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/array-crafted/xor4_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:29:08,762 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:29:08,764 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:29:08,783 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:29:08,783 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:29:08,784 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:29:08,786 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:29:08,788 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:29:08,789 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:29:08,790 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:29:08,791 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:29:08,792 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:29:08,793 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:29:08,794 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:29:08,795 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:29:08,796 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:29:08,797 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:29:08,799 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:29:08,801 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:29:08,802 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:29:08,804 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:29:08,805 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:29:08,808 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:29:08,808 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:29:08,809 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:29:08,810 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:29:08,811 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:29:08,812 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:29:08,812 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:29:08,814 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:29:08,814 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:29:08,815 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:29:08,815 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:29:08,815 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:29:08,816 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:29:08,817 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:29:08,817 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 12:29:08,838 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:29:08,838 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:29:08,839 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:29:08,840 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:29:08,840 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:29:08,841 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:29:08,841 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:29:08,841 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:29:08,841 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:29:08,841 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:29:08,842 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:29:08,842 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:29:08,842 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:29:08,842 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:29:08,842 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:29:08,842 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:29:08,843 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:29:08,843 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:29:08,843 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:29:08,843 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:29:08,843 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:29:08,844 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:29:08,844 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:29:08,844 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:29:08,844 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:29:08,844 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:29:08,845 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:29:08,845 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:29:08,845 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:29:08,845 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:29:08,845 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:29:08,908 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:29:08,926 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:29:08,930 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:29:08,931 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:29:08,931 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:29:08,932 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/xor4_true-unreach-call.i [2018-11-23 12:29:08,996 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52cb4e7d6/f6c9c2b09cef4773b2561af9756dc1c7/FLAG25cbf825e [2018-11-23 12:29:09,430 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:29:09,431 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/xor4_true-unreach-call.i [2018-11-23 12:29:09,438 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52cb4e7d6/f6c9c2b09cef4773b2561af9756dc1c7/FLAG25cbf825e [2018-11-23 12:29:09,805 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52cb4e7d6/f6c9c2b09cef4773b2561af9756dc1c7 [2018-11-23 12:29:09,817 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:29:09,819 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:29:09,820 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:29:09,820 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:29:09,824 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:29:09,826 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:29:09" (1/1) ... [2018-11-23 12:29:09,830 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d084b7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:29:09, skipping insertion in model container [2018-11-23 12:29:09,830 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:29:09" (1/1) ... [2018-11-23 12:29:09,841 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:29:09,868 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:29:10,147 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:29:10,168 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:29:10,197 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:29:10,215 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:29:10,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:29:10 WrapperNode [2018-11-23 12:29:10,216 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:29:10,217 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:29:10,217 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:29:10,217 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:29:10,227 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:29:10" (1/1) ... [2018-11-23 12:29:10,239 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:29:10" (1/1) ... [2018-11-23 12:29:10,247 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:29:10,248 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:29:10,248 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:29:10,248 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:29:10,257 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:29:10" (1/1) ... [2018-11-23 12:29:10,257 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:29:10" (1/1) ... [2018-11-23 12:29:10,259 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:29:10" (1/1) ... [2018-11-23 12:29:10,259 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:29:10" (1/1) ... [2018-11-23 12:29:10,274 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:29:10" (1/1) ... [2018-11-23 12:29:10,281 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:29:10" (1/1) ... [2018-11-23 12:29:10,284 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:29:10" (1/1) ... [2018-11-23 12:29:10,288 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:29:10,288 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:29:10,289 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:29:10,289 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:29:10,290 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:29:10" (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 12:29:10,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:29:10,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:29:10,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:29:10,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:29:10,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:29:10,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:29:10,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:29:10,416 INFO L130 BoogieDeclarations]: Found specification of procedure xor [2018-11-23 12:29:10,417 INFO L138 BoogieDeclarations]: Found implementation of procedure xor [2018-11-23 12:29:10,417 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:29:10,417 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:29:10,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:29:11,137 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:29:11,137 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 12:29:11,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:29:11 BoogieIcfgContainer [2018-11-23 12:29:11,138 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:29:11,139 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:29:11,140 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:29:11,143 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:29:11,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:29:09" (1/3) ... [2018-11-23 12:29:11,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48d5d624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:29:11, skipping insertion in model container [2018-11-23 12:29:11,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:29:10" (2/3) ... [2018-11-23 12:29:11,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48d5d624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:29:11, skipping insertion in model container [2018-11-23 12:29:11,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:29:11" (3/3) ... [2018-11-23 12:29:11,147 INFO L112 eAbstractionObserver]: Analyzing ICFG xor4_true-unreach-call.i [2018-11-23 12:29:11,159 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:29:11,168 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:29:11,187 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:29:11,222 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:29:11,223 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:29:11,223 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:29:11,223 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:29:11,224 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:29:11,224 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:29:11,224 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:29:11,224 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:29:11,224 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:29:11,245 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-23 12:29:11,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:29:11,254 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:11,255 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:29:11,258 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:11,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:11,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1461178031, now seen corresponding path program 1 times [2018-11-23 12:29:11,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:11,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:11,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:11,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:29:11,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:11,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:11,521 INFO L256 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {34#true} is VALID [2018-11-23 12:29:11,526 INFO L273 TraceCheckUtils]: 1: Hoare triple {34#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {34#true} is VALID [2018-11-23 12:29:11,527 INFO L273 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:29:11,527 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #66#return; {34#true} is VALID [2018-11-23 12:29:11,527 INFO L256 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret13 := main(); {34#true} is VALID [2018-11-23 12:29:11,528 INFO L273 TraceCheckUtils]: 5: Hoare triple {34#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {34#true} is VALID [2018-11-23 12:29:11,530 INFO L273 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2018-11-23 12:29:11,530 INFO L256 TraceCheckUtils]: 7: Hoare triple {35#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {34#true} is VALID [2018-11-23 12:29:11,531 INFO L273 TraceCheckUtils]: 8: Hoare triple {34#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {34#true} is VALID [2018-11-23 12:29:11,531 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#true} assume !true; {34#true} is VALID [2018-11-23 12:29:11,531 INFO L273 TraceCheckUtils]: 10: Hoare triple {34#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {34#true} is VALID [2018-11-23 12:29:11,532 INFO L273 TraceCheckUtils]: 11: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:29:11,532 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {34#true} {35#false} #70#return; {35#false} is VALID [2018-11-23 12:29:11,532 INFO L273 TraceCheckUtils]: 13: Hoare triple {35#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {35#false} is VALID [2018-11-23 12:29:11,533 INFO L256 TraceCheckUtils]: 14: Hoare triple {35#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {34#true} is VALID [2018-11-23 12:29:11,533 INFO L273 TraceCheckUtils]: 15: Hoare triple {34#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {34#true} is VALID [2018-11-23 12:29:11,534 INFO L273 TraceCheckUtils]: 16: Hoare triple {34#true} assume !true; {34#true} is VALID [2018-11-23 12:29:11,534 INFO L273 TraceCheckUtils]: 17: Hoare triple {34#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {34#true} is VALID [2018-11-23 12:29:11,534 INFO L273 TraceCheckUtils]: 18: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:29:11,535 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {34#true} {35#false} #72#return; {35#false} is VALID [2018-11-23 12:29:11,535 INFO L273 TraceCheckUtils]: 20: Hoare triple {35#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {35#false} is VALID [2018-11-23 12:29:11,535 INFO L273 TraceCheckUtils]: 21: Hoare triple {35#false} assume !true; {35#false} is VALID [2018-11-23 12:29:11,536 INFO L273 TraceCheckUtils]: 22: Hoare triple {35#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {35#false} is VALID [2018-11-23 12:29:11,536 INFO L256 TraceCheckUtils]: 23: Hoare triple {35#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {34#true} is VALID [2018-11-23 12:29:11,536 INFO L273 TraceCheckUtils]: 24: Hoare triple {34#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {34#true} is VALID [2018-11-23 12:29:11,537 INFO L273 TraceCheckUtils]: 25: Hoare triple {34#true} assume !true; {34#true} is VALID [2018-11-23 12:29:11,537 INFO L273 TraceCheckUtils]: 26: Hoare triple {34#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {34#true} is VALID [2018-11-23 12:29:11,537 INFO L273 TraceCheckUtils]: 27: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:29:11,538 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {34#true} {35#false} #74#return; {35#false} is VALID [2018-11-23 12:29:11,538 INFO L273 TraceCheckUtils]: 29: Hoare triple {35#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {35#false} is VALID [2018-11-23 12:29:11,538 INFO L273 TraceCheckUtils]: 30: Hoare triple {35#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {35#false} is VALID [2018-11-23 12:29:11,539 INFO L273 TraceCheckUtils]: 31: Hoare triple {35#false} assume !false; {35#false} is VALID [2018-11-23 12:29:11,545 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 12:29:11,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:29:11,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:29:11,554 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-23 12:29:11,558 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:29:11,561 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:29:11,839 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 12:29:11,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:29:11,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:29:11,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:29:11,850 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-11-23 12:29:12,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:12,220 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2018-11-23 12:29:12,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:29:12,220 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-23 12:29:12,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:12,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:29:12,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-23 12:29:12,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:29:12,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-23 12:29:12,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 71 transitions. [2018-11-23 12:29:12,515 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 12:29:12,529 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:29:12,529 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 12:29:12,534 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 12:29:12,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 12:29:12,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 12:29:12,586 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:12,587 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-23 12:29:12,587 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 12:29:12,587 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 12:29:12,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:12,593 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-23 12:29:12,594 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 12:29:12,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:12,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:12,595 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 12:29:12,595 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 12:29:12,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:12,600 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-23 12:29:12,601 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 12:29:12,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:12,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:12,602 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:12,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:12,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:29:12,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-11-23 12:29:12,611 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 32 [2018-11-23 12:29:12,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:12,611 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-23 12:29:12,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:29:12,612 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 12:29:12,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:29:12,613 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:12,614 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:29:12,614 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:12,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:12,615 INFO L82 PathProgramCache]: Analyzing trace with hash -595992629, now seen corresponding path program 1 times [2018-11-23 12:29:12,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:12,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:12,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:12,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:29:12,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:12,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:12,727 INFO L256 TraceCheckUtils]: 0: Hoare triple {198#true} call ULTIMATE.init(); {198#true} is VALID [2018-11-23 12:29:12,727 INFO L273 TraceCheckUtils]: 1: Hoare triple {198#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {198#true} is VALID [2018-11-23 12:29:12,727 INFO L273 TraceCheckUtils]: 2: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:29:12,728 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {198#true} {198#true} #66#return; {198#true} is VALID [2018-11-23 12:29:12,728 INFO L256 TraceCheckUtils]: 4: Hoare triple {198#true} call #t~ret13 := main(); {198#true} is VALID [2018-11-23 12:29:12,741 INFO L273 TraceCheckUtils]: 5: Hoare triple {198#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {200#(= main_~i~1 0)} is VALID [2018-11-23 12:29:12,754 INFO L273 TraceCheckUtils]: 6: Hoare triple {200#(= main_~i~1 0)} assume !(~i~1 < 100000); {199#false} is VALID [2018-11-23 12:29:12,755 INFO L256 TraceCheckUtils]: 7: Hoare triple {199#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {198#true} is VALID [2018-11-23 12:29:12,755 INFO L273 TraceCheckUtils]: 8: Hoare triple {198#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {198#true} is VALID [2018-11-23 12:29:12,756 INFO L273 TraceCheckUtils]: 9: Hoare triple {198#true} assume !(~i~0 < 100000); {198#true} is VALID [2018-11-23 12:29:12,756 INFO L273 TraceCheckUtils]: 10: Hoare triple {198#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {198#true} is VALID [2018-11-23 12:29:12,756 INFO L273 TraceCheckUtils]: 11: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:29:12,757 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {198#true} {199#false} #70#return; {199#false} is VALID [2018-11-23 12:29:12,757 INFO L273 TraceCheckUtils]: 13: Hoare triple {199#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {199#false} is VALID [2018-11-23 12:29:12,758 INFO L256 TraceCheckUtils]: 14: Hoare triple {199#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {198#true} is VALID [2018-11-23 12:29:12,758 INFO L273 TraceCheckUtils]: 15: Hoare triple {198#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {198#true} is VALID [2018-11-23 12:29:12,758 INFO L273 TraceCheckUtils]: 16: Hoare triple {198#true} assume !(~i~0 < 100000); {198#true} is VALID [2018-11-23 12:29:12,758 INFO L273 TraceCheckUtils]: 17: Hoare triple {198#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {198#true} is VALID [2018-11-23 12:29:12,759 INFO L273 TraceCheckUtils]: 18: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:29:12,759 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {198#true} {199#false} #72#return; {199#false} is VALID [2018-11-23 12:29:12,759 INFO L273 TraceCheckUtils]: 20: Hoare triple {199#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {199#false} is VALID [2018-11-23 12:29:12,760 INFO L273 TraceCheckUtils]: 21: Hoare triple {199#false} assume !(~i~2 < 99999); {199#false} is VALID [2018-11-23 12:29:12,760 INFO L273 TraceCheckUtils]: 22: Hoare triple {199#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {199#false} is VALID [2018-11-23 12:29:12,760 INFO L256 TraceCheckUtils]: 23: Hoare triple {199#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {198#true} is VALID [2018-11-23 12:29:12,761 INFO L273 TraceCheckUtils]: 24: Hoare triple {198#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {198#true} is VALID [2018-11-23 12:29:12,761 INFO L273 TraceCheckUtils]: 25: Hoare triple {198#true} assume !(~i~0 < 100000); {198#true} is VALID [2018-11-23 12:29:12,761 INFO L273 TraceCheckUtils]: 26: Hoare triple {198#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {198#true} is VALID [2018-11-23 12:29:12,762 INFO L273 TraceCheckUtils]: 27: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:29:12,762 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {198#true} {199#false} #74#return; {199#false} is VALID [2018-11-23 12:29:12,762 INFO L273 TraceCheckUtils]: 29: Hoare triple {199#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {199#false} is VALID [2018-11-23 12:29:12,763 INFO L273 TraceCheckUtils]: 30: Hoare triple {199#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {199#false} is VALID [2018-11-23 12:29:12,763 INFO L273 TraceCheckUtils]: 31: Hoare triple {199#false} assume !false; {199#false} is VALID [2018-11-23 12:29:12,766 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 12:29:12,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:29:12,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:29:12,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 12:29:12,769 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:29:12,769 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:29:12,827 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 12:29:12,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:29:12,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:29:12,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:29:12,829 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 3 states. [2018-11-23 12:29:13,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:13,335 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-23 12:29:13,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:29:13,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 12:29:13,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:13,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:29:13,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2018-11-23 12:29:13,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:29:13,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2018-11-23 12:29:13,344 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2018-11-23 12:29:13,521 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 12:29:13,524 INFO L225 Difference]: With dead ends: 46 [2018-11-23 12:29:13,524 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 12:29:13,526 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 12:29:13,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 12:29:13,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-23 12:29:13,545 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:13,545 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 27 states. [2018-11-23 12:29:13,545 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 27 states. [2018-11-23 12:29:13,545 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 27 states. [2018-11-23 12:29:13,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:13,549 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 12:29:13,549 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 12:29:13,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:13,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:13,550 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states. [2018-11-23 12:29:13,551 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states. [2018-11-23 12:29:13,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:13,554 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 12:29:13,554 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 12:29:13,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:13,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:13,555 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:13,556 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:13,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:29:13,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-23 12:29:13,559 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 32 [2018-11-23 12:29:13,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:13,559 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 12:29:13,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:29:13,559 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-23 12:29:13,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 12:29:13,561 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:13,561 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:29:13,561 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:13,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:13,562 INFO L82 PathProgramCache]: Analyzing trace with hash 169606189, now seen corresponding path program 1 times [2018-11-23 12:29:13,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:13,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:13,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:13,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:29:13,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:13,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:13,756 INFO L256 TraceCheckUtils]: 0: Hoare triple {362#true} call ULTIMATE.init(); {362#true} is VALID [2018-11-23 12:29:13,757 INFO L273 TraceCheckUtils]: 1: Hoare triple {362#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {362#true} is VALID [2018-11-23 12:29:13,757 INFO L273 TraceCheckUtils]: 2: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:29:13,757 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {362#true} {362#true} #66#return; {362#true} is VALID [2018-11-23 12:29:13,758 INFO L256 TraceCheckUtils]: 4: Hoare triple {362#true} call #t~ret13 := main(); {362#true} is VALID [2018-11-23 12:29:13,758 INFO L273 TraceCheckUtils]: 5: Hoare triple {362#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {362#true} is VALID [2018-11-23 12:29:13,758 INFO L273 TraceCheckUtils]: 6: Hoare triple {362#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {362#true} is VALID [2018-11-23 12:29:13,759 INFO L273 TraceCheckUtils]: 7: Hoare triple {362#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {362#true} is VALID [2018-11-23 12:29:13,759 INFO L273 TraceCheckUtils]: 8: Hoare triple {362#true} assume !(~i~1 < 100000); {362#true} is VALID [2018-11-23 12:29:13,759 INFO L256 TraceCheckUtils]: 9: Hoare triple {362#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {362#true} is VALID [2018-11-23 12:29:13,761 INFO L273 TraceCheckUtils]: 10: Hoare triple {362#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {364#(= xor_~i~0 1)} is VALID [2018-11-23 12:29:13,761 INFO L273 TraceCheckUtils]: 11: Hoare triple {364#(= xor_~i~0 1)} assume !(~i~0 < 100000); {363#false} is VALID [2018-11-23 12:29:13,762 INFO L273 TraceCheckUtils]: 12: Hoare triple {363#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {363#false} is VALID [2018-11-23 12:29:13,762 INFO L273 TraceCheckUtils]: 13: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:29:13,762 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {363#false} {362#true} #70#return; {363#false} is VALID [2018-11-23 12:29:13,763 INFO L273 TraceCheckUtils]: 15: Hoare triple {363#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {363#false} is VALID [2018-11-23 12:29:13,763 INFO L256 TraceCheckUtils]: 16: Hoare triple {363#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {362#true} is VALID [2018-11-23 12:29:13,763 INFO L273 TraceCheckUtils]: 17: Hoare triple {362#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {362#true} is VALID [2018-11-23 12:29:13,764 INFO L273 TraceCheckUtils]: 18: Hoare triple {362#true} assume !(~i~0 < 100000); {362#true} is VALID [2018-11-23 12:29:13,764 INFO L273 TraceCheckUtils]: 19: Hoare triple {362#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {362#true} is VALID [2018-11-23 12:29:13,765 INFO L273 TraceCheckUtils]: 20: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:29:13,765 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {362#true} {363#false} #72#return; {363#false} is VALID [2018-11-23 12:29:13,765 INFO L273 TraceCheckUtils]: 22: Hoare triple {363#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {363#false} is VALID [2018-11-23 12:29:13,766 INFO L273 TraceCheckUtils]: 23: Hoare triple {363#false} assume !(~i~2 < 99999); {363#false} is VALID [2018-11-23 12:29:13,766 INFO L273 TraceCheckUtils]: 24: Hoare triple {363#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {363#false} is VALID [2018-11-23 12:29:13,766 INFO L256 TraceCheckUtils]: 25: Hoare triple {363#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {362#true} is VALID [2018-11-23 12:29:13,767 INFO L273 TraceCheckUtils]: 26: Hoare triple {362#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {362#true} is VALID [2018-11-23 12:29:13,767 INFO L273 TraceCheckUtils]: 27: Hoare triple {362#true} assume !(~i~0 < 100000); {362#true} is VALID [2018-11-23 12:29:13,767 INFO L273 TraceCheckUtils]: 28: Hoare triple {362#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {362#true} is VALID [2018-11-23 12:29:13,768 INFO L273 TraceCheckUtils]: 29: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:29:13,768 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {362#true} {363#false} #74#return; {363#false} is VALID [2018-11-23 12:29:13,768 INFO L273 TraceCheckUtils]: 31: Hoare triple {363#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {363#false} is VALID [2018-11-23 12:29:13,769 INFO L273 TraceCheckUtils]: 32: Hoare triple {363#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {363#false} is VALID [2018-11-23 12:29:13,769 INFO L273 TraceCheckUtils]: 33: Hoare triple {363#false} assume !false; {363#false} is VALID [2018-11-23 12:29:13,771 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 12:29:13,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:29:13,772 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 12:29:13,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:29:13,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:13,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:13,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:29:14,050 INFO L256 TraceCheckUtils]: 0: Hoare triple {362#true} call ULTIMATE.init(); {362#true} is VALID [2018-11-23 12:29:14,051 INFO L273 TraceCheckUtils]: 1: Hoare triple {362#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {362#true} is VALID [2018-11-23 12:29:14,051 INFO L273 TraceCheckUtils]: 2: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:29:14,052 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {362#true} {362#true} #66#return; {362#true} is VALID [2018-11-23 12:29:14,052 INFO L256 TraceCheckUtils]: 4: Hoare triple {362#true} call #t~ret13 := main(); {362#true} is VALID [2018-11-23 12:29:14,053 INFO L273 TraceCheckUtils]: 5: Hoare triple {362#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {362#true} is VALID [2018-11-23 12:29:14,053 INFO L273 TraceCheckUtils]: 6: Hoare triple {362#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {362#true} is VALID [2018-11-23 12:29:14,054 INFO L273 TraceCheckUtils]: 7: Hoare triple {362#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {362#true} is VALID [2018-11-23 12:29:14,054 INFO L273 TraceCheckUtils]: 8: Hoare triple {362#true} assume !(~i~1 < 100000); {362#true} is VALID [2018-11-23 12:29:14,055 INFO L256 TraceCheckUtils]: 9: Hoare triple {362#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {362#true} is VALID [2018-11-23 12:29:14,059 INFO L273 TraceCheckUtils]: 10: Hoare triple {362#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {398#(<= xor_~i~0 1)} is VALID [2018-11-23 12:29:14,060 INFO L273 TraceCheckUtils]: 11: Hoare triple {398#(<= xor_~i~0 1)} assume !(~i~0 < 100000); {363#false} is VALID [2018-11-23 12:29:14,061 INFO L273 TraceCheckUtils]: 12: Hoare triple {363#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {363#false} is VALID [2018-11-23 12:29:14,061 INFO L273 TraceCheckUtils]: 13: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:29:14,061 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {363#false} {362#true} #70#return; {363#false} is VALID [2018-11-23 12:29:14,061 INFO L273 TraceCheckUtils]: 15: Hoare triple {363#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {363#false} is VALID [2018-11-23 12:29:14,062 INFO L256 TraceCheckUtils]: 16: Hoare triple {363#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {363#false} is VALID [2018-11-23 12:29:14,062 INFO L273 TraceCheckUtils]: 17: Hoare triple {363#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {363#false} is VALID [2018-11-23 12:29:14,062 INFO L273 TraceCheckUtils]: 18: Hoare triple {363#false} assume !(~i~0 < 100000); {363#false} is VALID [2018-11-23 12:29:14,063 INFO L273 TraceCheckUtils]: 19: Hoare triple {363#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {363#false} is VALID [2018-11-23 12:29:14,063 INFO L273 TraceCheckUtils]: 20: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:29:14,063 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {363#false} {363#false} #72#return; {363#false} is VALID [2018-11-23 12:29:14,063 INFO L273 TraceCheckUtils]: 22: Hoare triple {363#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {363#false} is VALID [2018-11-23 12:29:14,064 INFO L273 TraceCheckUtils]: 23: Hoare triple {363#false} assume !(~i~2 < 99999); {363#false} is VALID [2018-11-23 12:29:14,064 INFO L273 TraceCheckUtils]: 24: Hoare triple {363#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {363#false} is VALID [2018-11-23 12:29:14,065 INFO L256 TraceCheckUtils]: 25: Hoare triple {363#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {363#false} is VALID [2018-11-23 12:29:14,065 INFO L273 TraceCheckUtils]: 26: Hoare triple {363#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {363#false} is VALID [2018-11-23 12:29:14,065 INFO L273 TraceCheckUtils]: 27: Hoare triple {363#false} assume !(~i~0 < 100000); {363#false} is VALID [2018-11-23 12:29:14,066 INFO L273 TraceCheckUtils]: 28: Hoare triple {363#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {363#false} is VALID [2018-11-23 12:29:14,066 INFO L273 TraceCheckUtils]: 29: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:29:14,066 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {363#false} {363#false} #74#return; {363#false} is VALID [2018-11-23 12:29:14,067 INFO L273 TraceCheckUtils]: 31: Hoare triple {363#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {363#false} is VALID [2018-11-23 12:29:14,067 INFO L273 TraceCheckUtils]: 32: Hoare triple {363#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {363#false} is VALID [2018-11-23 12:29:14,067 INFO L273 TraceCheckUtils]: 33: Hoare triple {363#false} assume !false; {363#false} is VALID [2018-11-23 12:29:14,070 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 12:29:14,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:29:14,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-11-23 12:29:14,100 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 12:29:14,102 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:29:14,102 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:29:14,168 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 12:29:14,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:29:14,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:29:14,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:29:14,170 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 4 states. [2018-11-23 12:29:14,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:14,461 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2018-11-23 12:29:14,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:29:14,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 12:29:14,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:14,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:29:14,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2018-11-23 12:29:14,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:29:14,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2018-11-23 12:29:14,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2018-11-23 12:29:14,608 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 12:29:14,610 INFO L225 Difference]: With dead ends: 46 [2018-11-23 12:29:14,611 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 12:29:14,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:29:14,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 12:29:14,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-11-23 12:29:14,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:14,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 28 states. [2018-11-23 12:29:14,630 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 28 states. [2018-11-23 12:29:14,631 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 28 states. [2018-11-23 12:29:14,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:14,634 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-23 12:29:14,634 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 12:29:14,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:14,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:14,635 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 29 states. [2018-11-23 12:29:14,635 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 29 states. [2018-11-23 12:29:14,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:14,638 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-23 12:29:14,638 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 12:29:14,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:14,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:14,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:14,639 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:14,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:29:14,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-11-23 12:29:14,642 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 34 [2018-11-23 12:29:14,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:14,643 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-23 12:29:14,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:29:14,643 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 12:29:14,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 12:29:14,644 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:14,645 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:29:14,645 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:14,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:14,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1462689141, now seen corresponding path program 1 times [2018-11-23 12:29:14,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:14,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:14,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:14,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:29:14,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:14,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:14,741 INFO L256 TraceCheckUtils]: 0: Hoare triple {630#true} call ULTIMATE.init(); {630#true} is VALID [2018-11-23 12:29:14,742 INFO L273 TraceCheckUtils]: 1: Hoare triple {630#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {630#true} is VALID [2018-11-23 12:29:14,742 INFO L273 TraceCheckUtils]: 2: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:29:14,743 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {630#true} {630#true} #66#return; {630#true} is VALID [2018-11-23 12:29:14,743 INFO L256 TraceCheckUtils]: 4: Hoare triple {630#true} call #t~ret13 := main(); {630#true} is VALID [2018-11-23 12:29:14,743 INFO L273 TraceCheckUtils]: 5: Hoare triple {630#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {630#true} is VALID [2018-11-23 12:29:14,743 INFO L273 TraceCheckUtils]: 6: Hoare triple {630#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {630#true} is VALID [2018-11-23 12:29:14,744 INFO L273 TraceCheckUtils]: 7: Hoare triple {630#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {630#true} is VALID [2018-11-23 12:29:14,744 INFO L273 TraceCheckUtils]: 8: Hoare triple {630#true} assume !(~i~1 < 100000); {630#true} is VALID [2018-11-23 12:29:14,744 INFO L256 TraceCheckUtils]: 9: Hoare triple {630#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {630#true} is VALID [2018-11-23 12:29:14,744 INFO L273 TraceCheckUtils]: 10: Hoare triple {630#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {630#true} is VALID [2018-11-23 12:29:14,745 INFO L273 TraceCheckUtils]: 11: Hoare triple {630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {630#true} is VALID [2018-11-23 12:29:14,745 INFO L273 TraceCheckUtils]: 12: Hoare triple {630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {630#true} is VALID [2018-11-23 12:29:14,745 INFO L273 TraceCheckUtils]: 13: Hoare triple {630#true} assume !(~i~0 < 100000); {630#true} is VALID [2018-11-23 12:29:14,745 INFO L273 TraceCheckUtils]: 14: Hoare triple {630#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {630#true} is VALID [2018-11-23 12:29:14,745 INFO L273 TraceCheckUtils]: 15: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:29:14,746 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {630#true} {630#true} #70#return; {630#true} is VALID [2018-11-23 12:29:14,746 INFO L273 TraceCheckUtils]: 17: Hoare triple {630#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {630#true} is VALID [2018-11-23 12:29:14,747 INFO L256 TraceCheckUtils]: 18: Hoare triple {630#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {630#true} is VALID [2018-11-23 12:29:14,747 INFO L273 TraceCheckUtils]: 19: Hoare triple {630#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {630#true} is VALID [2018-11-23 12:29:14,747 INFO L273 TraceCheckUtils]: 20: Hoare triple {630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {630#true} is VALID [2018-11-23 12:29:14,748 INFO L273 TraceCheckUtils]: 21: Hoare triple {630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {630#true} is VALID [2018-11-23 12:29:14,748 INFO L273 TraceCheckUtils]: 22: Hoare triple {630#true} assume !(~i~0 < 100000); {630#true} is VALID [2018-11-23 12:29:14,748 INFO L273 TraceCheckUtils]: 23: Hoare triple {630#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {630#true} is VALID [2018-11-23 12:29:14,748 INFO L273 TraceCheckUtils]: 24: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:29:14,749 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {630#true} {630#true} #72#return; {630#true} is VALID [2018-11-23 12:29:14,755 INFO L273 TraceCheckUtils]: 26: Hoare triple {630#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {632#(= main_~i~2 0)} is VALID [2018-11-23 12:29:14,758 INFO L273 TraceCheckUtils]: 27: Hoare triple {632#(= main_~i~2 0)} assume !(~i~2 < 99999); {631#false} is VALID [2018-11-23 12:29:14,758 INFO L273 TraceCheckUtils]: 28: Hoare triple {631#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {631#false} is VALID [2018-11-23 12:29:14,758 INFO L256 TraceCheckUtils]: 29: Hoare triple {631#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {630#true} is VALID [2018-11-23 12:29:14,758 INFO L273 TraceCheckUtils]: 30: Hoare triple {630#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {630#true} is VALID [2018-11-23 12:29:14,759 INFO L273 TraceCheckUtils]: 31: Hoare triple {630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {630#true} is VALID [2018-11-23 12:29:14,759 INFO L273 TraceCheckUtils]: 32: Hoare triple {630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {630#true} is VALID [2018-11-23 12:29:14,759 INFO L273 TraceCheckUtils]: 33: Hoare triple {630#true} assume !(~i~0 < 100000); {630#true} is VALID [2018-11-23 12:29:14,760 INFO L273 TraceCheckUtils]: 34: Hoare triple {630#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {630#true} is VALID [2018-11-23 12:29:14,760 INFO L273 TraceCheckUtils]: 35: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:29:14,760 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {630#true} {631#false} #74#return; {631#false} is VALID [2018-11-23 12:29:14,761 INFO L273 TraceCheckUtils]: 37: Hoare triple {631#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {631#false} is VALID [2018-11-23 12:29:14,761 INFO L273 TraceCheckUtils]: 38: Hoare triple {631#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {631#false} is VALID [2018-11-23 12:29:14,762 INFO L273 TraceCheckUtils]: 39: Hoare triple {631#false} assume !false; {631#false} is VALID [2018-11-23 12:29:14,764 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-23 12:29:14,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:29:14,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:29:14,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-23 12:29:14,766 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:29:14,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:29:14,839 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 12:29:14,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:29:14,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:29:14,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:29:14,840 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 3 states. [2018-11-23 12:29:14,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:14,950 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-11-23 12:29:14,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:29:14,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-23 12:29:14,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:14,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:29:14,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2018-11-23 12:29:14,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:29:14,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2018-11-23 12:29:14,956 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 45 transitions. [2018-11-23 12:29:15,084 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 12:29:15,087 INFO L225 Difference]: With dead ends: 43 [2018-11-23 12:29:15,087 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 12:29:15,088 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 12:29:15,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 12:29:15,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-23 12:29:15,111 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:15,111 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2018-11-23 12:29:15,111 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2018-11-23 12:29:15,111 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2018-11-23 12:29:15,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:15,114 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-23 12:29:15,114 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-23 12:29:15,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:15,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:15,115 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2018-11-23 12:29:15,116 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2018-11-23 12:29:15,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:15,118 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-23 12:29:15,119 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-23 12:29:15,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:15,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:15,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:15,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:15,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:29:15,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-11-23 12:29:15,122 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 40 [2018-11-23 12:29:15,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:15,123 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-23 12:29:15,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:29:15,123 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 12:29:15,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 12:29:15,124 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:15,124 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:29:15,125 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:15,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:15,125 INFO L82 PathProgramCache]: Analyzing trace with hash -233991671, now seen corresponding path program 1 times [2018-11-23 12:29:15,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:15,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:15,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:15,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:29:15,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:15,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:15,238 INFO L256 TraceCheckUtils]: 0: Hoare triple {799#true} call ULTIMATE.init(); {799#true} is VALID [2018-11-23 12:29:15,239 INFO L273 TraceCheckUtils]: 1: Hoare triple {799#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {799#true} is VALID [2018-11-23 12:29:15,239 INFO L273 TraceCheckUtils]: 2: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:29:15,239 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {799#true} {799#true} #66#return; {799#true} is VALID [2018-11-23 12:29:15,239 INFO L256 TraceCheckUtils]: 4: Hoare triple {799#true} call #t~ret13 := main(); {799#true} is VALID [2018-11-23 12:29:15,241 INFO L273 TraceCheckUtils]: 5: Hoare triple {799#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {801#(= main_~i~1 0)} is VALID [2018-11-23 12:29:15,243 INFO L273 TraceCheckUtils]: 6: Hoare triple {801#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {801#(= main_~i~1 0)} is VALID [2018-11-23 12:29:15,244 INFO L273 TraceCheckUtils]: 7: Hoare triple {801#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {802#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:15,245 INFO L273 TraceCheckUtils]: 8: Hoare triple {802#(<= main_~i~1 1)} assume !(~i~1 < 100000); {800#false} is VALID [2018-11-23 12:29:15,245 INFO L256 TraceCheckUtils]: 9: Hoare triple {800#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {799#true} is VALID [2018-11-23 12:29:15,245 INFO L273 TraceCheckUtils]: 10: Hoare triple {799#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {799#true} is VALID [2018-11-23 12:29:15,245 INFO L273 TraceCheckUtils]: 11: Hoare triple {799#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {799#true} is VALID [2018-11-23 12:29:15,246 INFO L273 TraceCheckUtils]: 12: Hoare triple {799#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {799#true} is VALID [2018-11-23 12:29:15,246 INFO L273 TraceCheckUtils]: 13: Hoare triple {799#true} assume !(~i~0 < 100000); {799#true} is VALID [2018-11-23 12:29:15,246 INFO L273 TraceCheckUtils]: 14: Hoare triple {799#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {799#true} is VALID [2018-11-23 12:29:15,246 INFO L273 TraceCheckUtils]: 15: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:29:15,247 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {799#true} {800#false} #70#return; {800#false} is VALID [2018-11-23 12:29:15,247 INFO L273 TraceCheckUtils]: 17: Hoare triple {800#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {800#false} is VALID [2018-11-23 12:29:15,248 INFO L256 TraceCheckUtils]: 18: Hoare triple {800#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {799#true} is VALID [2018-11-23 12:29:15,248 INFO L273 TraceCheckUtils]: 19: Hoare triple {799#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {799#true} is VALID [2018-11-23 12:29:15,249 INFO L273 TraceCheckUtils]: 20: Hoare triple {799#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {799#true} is VALID [2018-11-23 12:29:15,249 INFO L273 TraceCheckUtils]: 21: Hoare triple {799#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {799#true} is VALID [2018-11-23 12:29:15,249 INFO L273 TraceCheckUtils]: 22: Hoare triple {799#true} assume !(~i~0 < 100000); {799#true} is VALID [2018-11-23 12:29:15,250 INFO L273 TraceCheckUtils]: 23: Hoare triple {799#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {799#true} is VALID [2018-11-23 12:29:15,250 INFO L273 TraceCheckUtils]: 24: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:29:15,250 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {799#true} {800#false} #72#return; {800#false} is VALID [2018-11-23 12:29:15,250 INFO L273 TraceCheckUtils]: 26: Hoare triple {800#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {800#false} is VALID [2018-11-23 12:29:15,251 INFO L273 TraceCheckUtils]: 27: Hoare triple {800#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {800#false} is VALID [2018-11-23 12:29:15,251 INFO L273 TraceCheckUtils]: 28: Hoare triple {800#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {800#false} is VALID [2018-11-23 12:29:15,251 INFO L273 TraceCheckUtils]: 29: Hoare triple {800#false} assume !(~i~2 < 99999); {800#false} is VALID [2018-11-23 12:29:15,252 INFO L273 TraceCheckUtils]: 30: Hoare triple {800#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {800#false} is VALID [2018-11-23 12:29:15,252 INFO L256 TraceCheckUtils]: 31: Hoare triple {800#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {799#true} is VALID [2018-11-23 12:29:15,252 INFO L273 TraceCheckUtils]: 32: Hoare triple {799#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {799#true} is VALID [2018-11-23 12:29:15,253 INFO L273 TraceCheckUtils]: 33: Hoare triple {799#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {799#true} is VALID [2018-11-23 12:29:15,253 INFO L273 TraceCheckUtils]: 34: Hoare triple {799#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {799#true} is VALID [2018-11-23 12:29:15,253 INFO L273 TraceCheckUtils]: 35: Hoare triple {799#true} assume !(~i~0 < 100000); {799#true} is VALID [2018-11-23 12:29:15,253 INFO L273 TraceCheckUtils]: 36: Hoare triple {799#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {799#true} is VALID [2018-11-23 12:29:15,254 INFO L273 TraceCheckUtils]: 37: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:29:15,254 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {799#true} {800#false} #74#return; {800#false} is VALID [2018-11-23 12:29:15,254 INFO L273 TraceCheckUtils]: 39: Hoare triple {800#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {800#false} is VALID [2018-11-23 12:29:15,254 INFO L273 TraceCheckUtils]: 40: Hoare triple {800#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {800#false} is VALID [2018-11-23 12:29:15,255 INFO L273 TraceCheckUtils]: 41: Hoare triple {800#false} assume !false; {800#false} is VALID [2018-11-23 12:29:15,257 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-23 12:29:15,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:29:15,258 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 12:29:15,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:29:15,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:15,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:15,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:29:15,673 INFO L256 TraceCheckUtils]: 0: Hoare triple {799#true} call ULTIMATE.init(); {799#true} is VALID [2018-11-23 12:29:15,674 INFO L273 TraceCheckUtils]: 1: Hoare triple {799#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {799#true} is VALID [2018-11-23 12:29:15,674 INFO L273 TraceCheckUtils]: 2: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:29:15,674 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {799#true} {799#true} #66#return; {799#true} is VALID [2018-11-23 12:29:15,674 INFO L256 TraceCheckUtils]: 4: Hoare triple {799#true} call #t~ret13 := main(); {799#true} is VALID [2018-11-23 12:29:15,675 INFO L273 TraceCheckUtils]: 5: Hoare triple {799#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {821#(<= main_~i~1 0)} is VALID [2018-11-23 12:29:15,675 INFO L273 TraceCheckUtils]: 6: Hoare triple {821#(<= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {821#(<= main_~i~1 0)} is VALID [2018-11-23 12:29:15,676 INFO L273 TraceCheckUtils]: 7: Hoare triple {821#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {802#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:15,677 INFO L273 TraceCheckUtils]: 8: Hoare triple {802#(<= main_~i~1 1)} assume !(~i~1 < 100000); {800#false} is VALID [2018-11-23 12:29:15,677 INFO L256 TraceCheckUtils]: 9: Hoare triple {800#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {800#false} is VALID [2018-11-23 12:29:15,677 INFO L273 TraceCheckUtils]: 10: Hoare triple {800#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {800#false} is VALID [2018-11-23 12:29:15,677 INFO L273 TraceCheckUtils]: 11: Hoare triple {800#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {800#false} is VALID [2018-11-23 12:29:15,678 INFO L273 TraceCheckUtils]: 12: Hoare triple {800#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {800#false} is VALID [2018-11-23 12:29:15,678 INFO L273 TraceCheckUtils]: 13: Hoare triple {800#false} assume !(~i~0 < 100000); {800#false} is VALID [2018-11-23 12:29:15,678 INFO L273 TraceCheckUtils]: 14: Hoare triple {800#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {800#false} is VALID [2018-11-23 12:29:15,678 INFO L273 TraceCheckUtils]: 15: Hoare triple {800#false} assume true; {800#false} is VALID [2018-11-23 12:29:15,679 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {800#false} {800#false} #70#return; {800#false} is VALID [2018-11-23 12:29:15,679 INFO L273 TraceCheckUtils]: 17: Hoare triple {800#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {800#false} is VALID [2018-11-23 12:29:15,679 INFO L256 TraceCheckUtils]: 18: Hoare triple {800#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {800#false} is VALID [2018-11-23 12:29:15,679 INFO L273 TraceCheckUtils]: 19: Hoare triple {800#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {800#false} is VALID [2018-11-23 12:29:15,680 INFO L273 TraceCheckUtils]: 20: Hoare triple {800#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {800#false} is VALID [2018-11-23 12:29:15,680 INFO L273 TraceCheckUtils]: 21: Hoare triple {800#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {800#false} is VALID [2018-11-23 12:29:15,680 INFO L273 TraceCheckUtils]: 22: Hoare triple {800#false} assume !(~i~0 < 100000); {800#false} is VALID [2018-11-23 12:29:15,681 INFO L273 TraceCheckUtils]: 23: Hoare triple {800#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {800#false} is VALID [2018-11-23 12:29:15,681 INFO L273 TraceCheckUtils]: 24: Hoare triple {800#false} assume true; {800#false} is VALID [2018-11-23 12:29:15,682 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {800#false} {800#false} #72#return; {800#false} is VALID [2018-11-23 12:29:15,682 INFO L273 TraceCheckUtils]: 26: Hoare triple {800#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {800#false} is VALID [2018-11-23 12:29:15,682 INFO L273 TraceCheckUtils]: 27: Hoare triple {800#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {800#false} is VALID [2018-11-23 12:29:15,683 INFO L273 TraceCheckUtils]: 28: Hoare triple {800#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {800#false} is VALID [2018-11-23 12:29:15,683 INFO L273 TraceCheckUtils]: 29: Hoare triple {800#false} assume !(~i~2 < 99999); {800#false} is VALID [2018-11-23 12:29:15,683 INFO L273 TraceCheckUtils]: 30: Hoare triple {800#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {800#false} is VALID [2018-11-23 12:29:15,683 INFO L256 TraceCheckUtils]: 31: Hoare triple {800#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {800#false} is VALID [2018-11-23 12:29:15,684 INFO L273 TraceCheckUtils]: 32: Hoare triple {800#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {800#false} is VALID [2018-11-23 12:29:15,684 INFO L273 TraceCheckUtils]: 33: Hoare triple {800#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {800#false} is VALID [2018-11-23 12:29:15,684 INFO L273 TraceCheckUtils]: 34: Hoare triple {800#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {800#false} is VALID [2018-11-23 12:29:15,684 INFO L273 TraceCheckUtils]: 35: Hoare triple {800#false} assume !(~i~0 < 100000); {800#false} is VALID [2018-11-23 12:29:15,685 INFO L273 TraceCheckUtils]: 36: Hoare triple {800#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {800#false} is VALID [2018-11-23 12:29:15,685 INFO L273 TraceCheckUtils]: 37: Hoare triple {800#false} assume true; {800#false} is VALID [2018-11-23 12:29:15,685 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {800#false} {800#false} #74#return; {800#false} is VALID [2018-11-23 12:29:15,685 INFO L273 TraceCheckUtils]: 39: Hoare triple {800#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {800#false} is VALID [2018-11-23 12:29:15,686 INFO L273 TraceCheckUtils]: 40: Hoare triple {800#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {800#false} is VALID [2018-11-23 12:29:15,686 INFO L273 TraceCheckUtils]: 41: Hoare triple {800#false} assume !false; {800#false} is VALID [2018-11-23 12:29:15,689 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-23 12:29:15,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:29:15,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 12:29:15,720 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-11-23 12:29:15,721 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:29:15,721 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:29:15,813 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 12:29:15,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:29:15,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:29:15,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:29:15,815 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 5 states. [2018-11-23 12:29:16,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:16,107 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-11-23 12:29:16,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:29:16,108 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-11-23 12:29:16,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:16,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:29:16,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2018-11-23 12:29:16,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:29:16,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2018-11-23 12:29:16,113 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2018-11-23 12:29:16,190 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 12:29:16,192 INFO L225 Difference]: With dead ends: 52 [2018-11-23 12:29:16,193 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 12:29:16,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 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 12:29:16,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 12:29:16,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-23 12:29:16,272 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:16,272 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 31 states. [2018-11-23 12:29:16,272 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 31 states. [2018-11-23 12:29:16,272 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 31 states. [2018-11-23 12:29:16,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:16,276 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 12:29:16,276 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 12:29:16,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:16,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:16,277 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 32 states. [2018-11-23 12:29:16,277 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 32 states. [2018-11-23 12:29:16,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:16,280 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 12:29:16,280 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 12:29:16,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:16,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:16,281 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:16,281 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:16,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:29:16,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-23 12:29:16,283 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 42 [2018-11-23 12:29:16,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:16,284 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-23 12:29:16,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:29:16,284 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-23 12:29:16,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 12:29:16,285 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:16,285 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:29:16,286 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:16,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:16,286 INFO L82 PathProgramCache]: Analyzing trace with hash 4791275, now seen corresponding path program 2 times [2018-11-23 12:29:16,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:16,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:16,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:16,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:29:16,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:16,417 INFO L256 TraceCheckUtils]: 0: Hoare triple {1114#true} call ULTIMATE.init(); {1114#true} is VALID [2018-11-23 12:29:16,418 INFO L273 TraceCheckUtils]: 1: Hoare triple {1114#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1114#true} is VALID [2018-11-23 12:29:16,418 INFO L273 TraceCheckUtils]: 2: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:29:16,418 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1114#true} {1114#true} #66#return; {1114#true} is VALID [2018-11-23 12:29:16,418 INFO L256 TraceCheckUtils]: 4: Hoare triple {1114#true} call #t~ret13 := main(); {1114#true} is VALID [2018-11-23 12:29:16,420 INFO L273 TraceCheckUtils]: 5: Hoare triple {1114#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1116#(= main_~i~1 0)} is VALID [2018-11-23 12:29:16,422 INFO L273 TraceCheckUtils]: 6: Hoare triple {1116#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1116#(= main_~i~1 0)} is VALID [2018-11-23 12:29:16,423 INFO L273 TraceCheckUtils]: 7: Hoare triple {1116#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1117#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:16,424 INFO L273 TraceCheckUtils]: 8: Hoare triple {1117#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1117#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:16,424 INFO L273 TraceCheckUtils]: 9: Hoare triple {1117#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1118#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:16,425 INFO L273 TraceCheckUtils]: 10: Hoare triple {1118#(<= main_~i~1 2)} assume !(~i~1 < 100000); {1115#false} is VALID [2018-11-23 12:29:16,425 INFO L256 TraceCheckUtils]: 11: Hoare triple {1115#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {1114#true} is VALID [2018-11-23 12:29:16,425 INFO L273 TraceCheckUtils]: 12: Hoare triple {1114#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1114#true} is VALID [2018-11-23 12:29:16,425 INFO L273 TraceCheckUtils]: 13: Hoare triple {1114#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1114#true} is VALID [2018-11-23 12:29:16,426 INFO L273 TraceCheckUtils]: 14: Hoare triple {1114#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1114#true} is VALID [2018-11-23 12:29:16,426 INFO L273 TraceCheckUtils]: 15: Hoare triple {1114#true} assume !(~i~0 < 100000); {1114#true} is VALID [2018-11-23 12:29:16,426 INFO L273 TraceCheckUtils]: 16: Hoare triple {1114#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1114#true} is VALID [2018-11-23 12:29:16,426 INFO L273 TraceCheckUtils]: 17: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:29:16,427 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1114#true} {1115#false} #70#return; {1115#false} is VALID [2018-11-23 12:29:16,427 INFO L273 TraceCheckUtils]: 19: Hoare triple {1115#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1115#false} is VALID [2018-11-23 12:29:16,427 INFO L256 TraceCheckUtils]: 20: Hoare triple {1115#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {1114#true} is VALID [2018-11-23 12:29:16,428 INFO L273 TraceCheckUtils]: 21: Hoare triple {1114#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1114#true} is VALID [2018-11-23 12:29:16,428 INFO L273 TraceCheckUtils]: 22: Hoare triple {1114#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1114#true} is VALID [2018-11-23 12:29:16,428 INFO L273 TraceCheckUtils]: 23: Hoare triple {1114#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1114#true} is VALID [2018-11-23 12:29:16,429 INFO L273 TraceCheckUtils]: 24: Hoare triple {1114#true} assume !(~i~0 < 100000); {1114#true} is VALID [2018-11-23 12:29:16,429 INFO L273 TraceCheckUtils]: 25: Hoare triple {1114#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1114#true} is VALID [2018-11-23 12:29:16,429 INFO L273 TraceCheckUtils]: 26: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:29:16,429 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1114#true} {1115#false} #72#return; {1115#false} is VALID [2018-11-23 12:29:16,430 INFO L273 TraceCheckUtils]: 28: Hoare triple {1115#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {1115#false} is VALID [2018-11-23 12:29:16,430 INFO L273 TraceCheckUtils]: 29: Hoare triple {1115#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {1115#false} is VALID [2018-11-23 12:29:16,430 INFO L273 TraceCheckUtils]: 30: Hoare triple {1115#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {1115#false} is VALID [2018-11-23 12:29:16,430 INFO L273 TraceCheckUtils]: 31: Hoare triple {1115#false} assume !(~i~2 < 99999); {1115#false} is VALID [2018-11-23 12:29:16,430 INFO L273 TraceCheckUtils]: 32: Hoare triple {1115#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {1115#false} is VALID [2018-11-23 12:29:16,431 INFO L256 TraceCheckUtils]: 33: Hoare triple {1115#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {1114#true} is VALID [2018-11-23 12:29:16,431 INFO L273 TraceCheckUtils]: 34: Hoare triple {1114#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1114#true} is VALID [2018-11-23 12:29:16,431 INFO L273 TraceCheckUtils]: 35: Hoare triple {1114#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1114#true} is VALID [2018-11-23 12:29:16,431 INFO L273 TraceCheckUtils]: 36: Hoare triple {1114#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1114#true} is VALID [2018-11-23 12:29:16,431 INFO L273 TraceCheckUtils]: 37: Hoare triple {1114#true} assume !(~i~0 < 100000); {1114#true} is VALID [2018-11-23 12:29:16,432 INFO L273 TraceCheckUtils]: 38: Hoare triple {1114#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1114#true} is VALID [2018-11-23 12:29:16,432 INFO L273 TraceCheckUtils]: 39: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:29:16,432 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1114#true} {1115#false} #74#return; {1115#false} is VALID [2018-11-23 12:29:16,432 INFO L273 TraceCheckUtils]: 41: Hoare triple {1115#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {1115#false} is VALID [2018-11-23 12:29:16,433 INFO L273 TraceCheckUtils]: 42: Hoare triple {1115#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {1115#false} is VALID [2018-11-23 12:29:16,433 INFO L273 TraceCheckUtils]: 43: Hoare triple {1115#false} assume !false; {1115#false} is VALID [2018-11-23 12:29:16,435 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-23 12:29:16,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:29:16,435 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 12:29:16,445 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:29:16,484 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:29:16,485 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:29:16,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:16,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:29:16,652 INFO L256 TraceCheckUtils]: 0: Hoare triple {1114#true} call ULTIMATE.init(); {1114#true} is VALID [2018-11-23 12:29:16,653 INFO L273 TraceCheckUtils]: 1: Hoare triple {1114#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1114#true} is VALID [2018-11-23 12:29:16,653 INFO L273 TraceCheckUtils]: 2: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:29:16,653 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1114#true} {1114#true} #66#return; {1114#true} is VALID [2018-11-23 12:29:16,653 INFO L256 TraceCheckUtils]: 4: Hoare triple {1114#true} call #t~ret13 := main(); {1114#true} is VALID [2018-11-23 12:29:16,654 INFO L273 TraceCheckUtils]: 5: Hoare triple {1114#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1137#(<= main_~i~1 0)} is VALID [2018-11-23 12:29:16,655 INFO L273 TraceCheckUtils]: 6: Hoare triple {1137#(<= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1137#(<= main_~i~1 0)} is VALID [2018-11-23 12:29:16,655 INFO L273 TraceCheckUtils]: 7: Hoare triple {1137#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1117#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:16,661 INFO L273 TraceCheckUtils]: 8: Hoare triple {1117#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1117#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:16,662 INFO L273 TraceCheckUtils]: 9: Hoare triple {1117#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1118#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:16,663 INFO L273 TraceCheckUtils]: 10: Hoare triple {1118#(<= main_~i~1 2)} assume !(~i~1 < 100000); {1115#false} is VALID [2018-11-23 12:29:16,663 INFO L256 TraceCheckUtils]: 11: Hoare triple {1115#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {1115#false} is VALID [2018-11-23 12:29:16,664 INFO L273 TraceCheckUtils]: 12: Hoare triple {1115#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1115#false} is VALID [2018-11-23 12:29:16,664 INFO L273 TraceCheckUtils]: 13: Hoare triple {1115#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1115#false} is VALID [2018-11-23 12:29:16,664 INFO L273 TraceCheckUtils]: 14: Hoare triple {1115#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1115#false} is VALID [2018-11-23 12:29:16,664 INFO L273 TraceCheckUtils]: 15: Hoare triple {1115#false} assume !(~i~0 < 100000); {1115#false} is VALID [2018-11-23 12:29:16,664 INFO L273 TraceCheckUtils]: 16: Hoare triple {1115#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1115#false} is VALID [2018-11-23 12:29:16,665 INFO L273 TraceCheckUtils]: 17: Hoare triple {1115#false} assume true; {1115#false} is VALID [2018-11-23 12:29:16,665 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1115#false} {1115#false} #70#return; {1115#false} is VALID [2018-11-23 12:29:16,665 INFO L273 TraceCheckUtils]: 19: Hoare triple {1115#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1115#false} is VALID [2018-11-23 12:29:16,666 INFO L256 TraceCheckUtils]: 20: Hoare triple {1115#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {1115#false} is VALID [2018-11-23 12:29:16,666 INFO L273 TraceCheckUtils]: 21: Hoare triple {1115#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1115#false} is VALID [2018-11-23 12:29:16,667 INFO L273 TraceCheckUtils]: 22: Hoare triple {1115#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1115#false} is VALID [2018-11-23 12:29:16,667 INFO L273 TraceCheckUtils]: 23: Hoare triple {1115#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1115#false} is VALID [2018-11-23 12:29:16,667 INFO L273 TraceCheckUtils]: 24: Hoare triple {1115#false} assume !(~i~0 < 100000); {1115#false} is VALID [2018-11-23 12:29:16,667 INFO L273 TraceCheckUtils]: 25: Hoare triple {1115#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1115#false} is VALID [2018-11-23 12:29:16,667 INFO L273 TraceCheckUtils]: 26: Hoare triple {1115#false} assume true; {1115#false} is VALID [2018-11-23 12:29:16,667 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1115#false} {1115#false} #72#return; {1115#false} is VALID [2018-11-23 12:29:16,668 INFO L273 TraceCheckUtils]: 28: Hoare triple {1115#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {1115#false} is VALID [2018-11-23 12:29:16,668 INFO L273 TraceCheckUtils]: 29: Hoare triple {1115#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {1115#false} is VALID [2018-11-23 12:29:16,668 INFO L273 TraceCheckUtils]: 30: Hoare triple {1115#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {1115#false} is VALID [2018-11-23 12:29:16,668 INFO L273 TraceCheckUtils]: 31: Hoare triple {1115#false} assume !(~i~2 < 99999); {1115#false} is VALID [2018-11-23 12:29:16,668 INFO L273 TraceCheckUtils]: 32: Hoare triple {1115#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {1115#false} is VALID [2018-11-23 12:29:16,669 INFO L256 TraceCheckUtils]: 33: Hoare triple {1115#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {1115#false} is VALID [2018-11-23 12:29:16,669 INFO L273 TraceCheckUtils]: 34: Hoare triple {1115#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1115#false} is VALID [2018-11-23 12:29:16,669 INFO L273 TraceCheckUtils]: 35: Hoare triple {1115#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1115#false} is VALID [2018-11-23 12:29:16,669 INFO L273 TraceCheckUtils]: 36: Hoare triple {1115#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1115#false} is VALID [2018-11-23 12:29:16,670 INFO L273 TraceCheckUtils]: 37: Hoare triple {1115#false} assume !(~i~0 < 100000); {1115#false} is VALID [2018-11-23 12:29:16,670 INFO L273 TraceCheckUtils]: 38: Hoare triple {1115#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1115#false} is VALID [2018-11-23 12:29:16,670 INFO L273 TraceCheckUtils]: 39: Hoare triple {1115#false} assume true; {1115#false} is VALID [2018-11-23 12:29:16,670 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1115#false} {1115#false} #74#return; {1115#false} is VALID [2018-11-23 12:29:16,671 INFO L273 TraceCheckUtils]: 41: Hoare triple {1115#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {1115#false} is VALID [2018-11-23 12:29:16,671 INFO L273 TraceCheckUtils]: 42: Hoare triple {1115#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {1115#false} is VALID [2018-11-23 12:29:16,671 INFO L273 TraceCheckUtils]: 43: Hoare triple {1115#false} assume !false; {1115#false} is VALID [2018-11-23 12:29:16,673 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-23 12:29:16,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:29:16,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 12:29:16,694 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-11-23 12:29:16,694 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:29:16,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:29:16,749 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 12:29:16,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:29:16,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:29:16,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:29:16,750 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 6 states. [2018-11-23 12:29:16,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:16,925 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2018-11-23 12:29:16,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:29:16,926 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-11-23 12:29:16,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:16,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:29:16,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2018-11-23 12:29:16,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:29:16,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2018-11-23 12:29:16,930 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 58 transitions. [2018-11-23 12:29:17,126 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 12:29:17,129 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:29:17,130 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 12:29:17,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 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 12:29:17,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 12:29:17,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-23 12:29:17,183 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:17,183 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2018-11-23 12:29:17,183 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2018-11-23 12:29:17,183 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2018-11-23 12:29:17,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:17,187 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 12:29:17,187 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 12:29:17,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:17,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:17,188 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2018-11-23 12:29:17,188 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2018-11-23 12:29:17,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:17,191 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 12:29:17,192 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 12:29:17,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:17,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:17,192 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:17,192 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:17,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:29:17,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-23 12:29:17,196 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 44 [2018-11-23 12:29:17,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:17,196 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-23 12:29:17,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:29:17,197 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 12:29:17,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 12:29:17,198 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:17,198 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:29:17,198 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:17,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:17,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1841935693, now seen corresponding path program 3 times [2018-11-23 12:29:17,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:17,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:17,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:17,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:29:17,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:17,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:17,846 INFO L256 TraceCheckUtils]: 0: Hoare triple {1446#true} call ULTIMATE.init(); {1446#true} is VALID [2018-11-23 12:29:17,846 INFO L273 TraceCheckUtils]: 1: Hoare triple {1446#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1446#true} is VALID [2018-11-23 12:29:17,847 INFO L273 TraceCheckUtils]: 2: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:29:17,847 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1446#true} {1446#true} #66#return; {1446#true} is VALID [2018-11-23 12:29:17,848 INFO L256 TraceCheckUtils]: 4: Hoare triple {1446#true} call #t~ret13 := main(); {1446#true} is VALID [2018-11-23 12:29:17,848 INFO L273 TraceCheckUtils]: 5: Hoare triple {1446#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1448#(= main_~i~1 0)} is VALID [2018-11-23 12:29:17,850 INFO L273 TraceCheckUtils]: 6: Hoare triple {1448#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1448#(= main_~i~1 0)} is VALID [2018-11-23 12:29:17,850 INFO L273 TraceCheckUtils]: 7: Hoare triple {1448#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1449#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:17,851 INFO L273 TraceCheckUtils]: 8: Hoare triple {1449#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1449#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:17,851 INFO L273 TraceCheckUtils]: 9: Hoare triple {1449#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1450#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:17,852 INFO L273 TraceCheckUtils]: 10: Hoare triple {1450#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1450#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:17,852 INFO L273 TraceCheckUtils]: 11: Hoare triple {1450#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1451#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:17,853 INFO L273 TraceCheckUtils]: 12: Hoare triple {1451#(<= main_~i~1 3)} assume !(~i~1 < 100000); {1447#false} is VALID [2018-11-23 12:29:17,854 INFO L256 TraceCheckUtils]: 13: Hoare triple {1447#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {1446#true} is VALID [2018-11-23 12:29:17,854 INFO L273 TraceCheckUtils]: 14: Hoare triple {1446#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1446#true} is VALID [2018-11-23 12:29:17,854 INFO L273 TraceCheckUtils]: 15: Hoare triple {1446#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1446#true} is VALID [2018-11-23 12:29:17,855 INFO L273 TraceCheckUtils]: 16: Hoare triple {1446#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1446#true} is VALID [2018-11-23 12:29:17,855 INFO L273 TraceCheckUtils]: 17: Hoare triple {1446#true} assume !(~i~0 < 100000); {1446#true} is VALID [2018-11-23 12:29:17,856 INFO L273 TraceCheckUtils]: 18: Hoare triple {1446#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1446#true} is VALID [2018-11-23 12:29:17,856 INFO L273 TraceCheckUtils]: 19: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:29:17,856 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1446#true} {1447#false} #70#return; {1447#false} is VALID [2018-11-23 12:29:17,857 INFO L273 TraceCheckUtils]: 21: Hoare triple {1447#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1447#false} is VALID [2018-11-23 12:29:17,857 INFO L256 TraceCheckUtils]: 22: Hoare triple {1447#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {1446#true} is VALID [2018-11-23 12:29:17,857 INFO L273 TraceCheckUtils]: 23: Hoare triple {1446#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1446#true} is VALID [2018-11-23 12:29:17,857 INFO L273 TraceCheckUtils]: 24: Hoare triple {1446#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1446#true} is VALID [2018-11-23 12:29:17,863 INFO L273 TraceCheckUtils]: 25: Hoare triple {1446#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1446#true} is VALID [2018-11-23 12:29:17,863 INFO L273 TraceCheckUtils]: 26: Hoare triple {1446#true} assume !(~i~0 < 100000); {1446#true} is VALID [2018-11-23 12:29:17,863 INFO L273 TraceCheckUtils]: 27: Hoare triple {1446#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1446#true} is VALID [2018-11-23 12:29:17,864 INFO L273 TraceCheckUtils]: 28: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:29:17,864 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1446#true} {1447#false} #72#return; {1447#false} is VALID [2018-11-23 12:29:17,864 INFO L273 TraceCheckUtils]: 30: Hoare triple {1447#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {1447#false} is VALID [2018-11-23 12:29:17,864 INFO L273 TraceCheckUtils]: 31: Hoare triple {1447#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {1447#false} is VALID [2018-11-23 12:29:17,865 INFO L273 TraceCheckUtils]: 32: Hoare triple {1447#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {1447#false} is VALID [2018-11-23 12:29:17,865 INFO L273 TraceCheckUtils]: 33: Hoare triple {1447#false} assume !(~i~2 < 99999); {1447#false} is VALID [2018-11-23 12:29:17,865 INFO L273 TraceCheckUtils]: 34: Hoare triple {1447#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {1447#false} is VALID [2018-11-23 12:29:17,865 INFO L256 TraceCheckUtils]: 35: Hoare triple {1447#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {1446#true} is VALID [2018-11-23 12:29:17,865 INFO L273 TraceCheckUtils]: 36: Hoare triple {1446#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1446#true} is VALID [2018-11-23 12:29:17,866 INFO L273 TraceCheckUtils]: 37: Hoare triple {1446#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1446#true} is VALID [2018-11-23 12:29:17,866 INFO L273 TraceCheckUtils]: 38: Hoare triple {1446#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1446#true} is VALID [2018-11-23 12:29:17,866 INFO L273 TraceCheckUtils]: 39: Hoare triple {1446#true} assume !(~i~0 < 100000); {1446#true} is VALID [2018-11-23 12:29:17,866 INFO L273 TraceCheckUtils]: 40: Hoare triple {1446#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1446#true} is VALID [2018-11-23 12:29:17,867 INFO L273 TraceCheckUtils]: 41: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:29:17,867 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1446#true} {1447#false} #74#return; {1447#false} is VALID [2018-11-23 12:29:17,867 INFO L273 TraceCheckUtils]: 43: Hoare triple {1447#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {1447#false} is VALID [2018-11-23 12:29:17,868 INFO L273 TraceCheckUtils]: 44: Hoare triple {1447#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {1447#false} is VALID [2018-11-23 12:29:17,868 INFO L273 TraceCheckUtils]: 45: Hoare triple {1447#false} assume !false; {1447#false} is VALID [2018-11-23 12:29:17,870 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-23 12:29:17,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:29:17,871 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 12:29:17,882 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:29:17,909 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 12:29:17,909 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:29:17,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:17,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:29:18,269 INFO L256 TraceCheckUtils]: 0: Hoare triple {1446#true} call ULTIMATE.init(); {1446#true} is VALID [2018-11-23 12:29:18,269 INFO L273 TraceCheckUtils]: 1: Hoare triple {1446#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1446#true} is VALID [2018-11-23 12:29:18,270 INFO L273 TraceCheckUtils]: 2: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:29:18,270 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1446#true} {1446#true} #66#return; {1446#true} is VALID [2018-11-23 12:29:18,270 INFO L256 TraceCheckUtils]: 4: Hoare triple {1446#true} call #t~ret13 := main(); {1446#true} is VALID [2018-11-23 12:29:18,270 INFO L273 TraceCheckUtils]: 5: Hoare triple {1446#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1446#true} is VALID [2018-11-23 12:29:18,270 INFO L273 TraceCheckUtils]: 6: Hoare triple {1446#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1446#true} is VALID [2018-11-23 12:29:18,270 INFO L273 TraceCheckUtils]: 7: Hoare triple {1446#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1446#true} is VALID [2018-11-23 12:29:18,270 INFO L273 TraceCheckUtils]: 8: Hoare triple {1446#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1446#true} is VALID [2018-11-23 12:29:18,271 INFO L273 TraceCheckUtils]: 9: Hoare triple {1446#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1446#true} is VALID [2018-11-23 12:29:18,271 INFO L273 TraceCheckUtils]: 10: Hoare triple {1446#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1446#true} is VALID [2018-11-23 12:29:18,271 INFO L273 TraceCheckUtils]: 11: Hoare triple {1446#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1446#true} is VALID [2018-11-23 12:29:18,271 INFO L273 TraceCheckUtils]: 12: Hoare triple {1446#true} assume !(~i~1 < 100000); {1446#true} is VALID [2018-11-23 12:29:18,271 INFO L256 TraceCheckUtils]: 13: Hoare triple {1446#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {1446#true} is VALID [2018-11-23 12:29:18,271 INFO L273 TraceCheckUtils]: 14: Hoare triple {1446#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1446#true} is VALID [2018-11-23 12:29:18,271 INFO L273 TraceCheckUtils]: 15: Hoare triple {1446#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1446#true} is VALID [2018-11-23 12:29:18,272 INFO L273 TraceCheckUtils]: 16: Hoare triple {1446#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1446#true} is VALID [2018-11-23 12:29:18,272 INFO L273 TraceCheckUtils]: 17: Hoare triple {1446#true} assume !(~i~0 < 100000); {1446#true} is VALID [2018-11-23 12:29:18,272 INFO L273 TraceCheckUtils]: 18: Hoare triple {1446#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1446#true} is VALID [2018-11-23 12:29:18,272 INFO L273 TraceCheckUtils]: 19: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:29:18,272 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1446#true} {1446#true} #70#return; {1446#true} is VALID [2018-11-23 12:29:18,272 INFO L273 TraceCheckUtils]: 21: Hoare triple {1446#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1446#true} is VALID [2018-11-23 12:29:18,272 INFO L256 TraceCheckUtils]: 22: Hoare triple {1446#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {1446#true} is VALID [2018-11-23 12:29:18,273 INFO L273 TraceCheckUtils]: 23: Hoare triple {1446#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1446#true} is VALID [2018-11-23 12:29:18,273 INFO L273 TraceCheckUtils]: 24: Hoare triple {1446#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1446#true} is VALID [2018-11-23 12:29:18,273 INFO L273 TraceCheckUtils]: 25: Hoare triple {1446#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1446#true} is VALID [2018-11-23 12:29:18,273 INFO L273 TraceCheckUtils]: 26: Hoare triple {1446#true} assume !(~i~0 < 100000); {1446#true} is VALID [2018-11-23 12:29:18,273 INFO L273 TraceCheckUtils]: 27: Hoare triple {1446#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1446#true} is VALID [2018-11-23 12:29:18,273 INFO L273 TraceCheckUtils]: 28: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:29:18,273 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1446#true} {1446#true} #72#return; {1446#true} is VALID [2018-11-23 12:29:18,274 INFO L273 TraceCheckUtils]: 30: Hoare triple {1446#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {1446#true} is VALID [2018-11-23 12:29:18,274 INFO L273 TraceCheckUtils]: 31: Hoare triple {1446#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {1446#true} is VALID [2018-11-23 12:29:18,274 INFO L273 TraceCheckUtils]: 32: Hoare triple {1446#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {1446#true} is VALID [2018-11-23 12:29:18,274 INFO L273 TraceCheckUtils]: 33: Hoare triple {1446#true} assume !(~i~2 < 99999); {1446#true} is VALID [2018-11-23 12:29:18,274 INFO L273 TraceCheckUtils]: 34: Hoare triple {1446#true} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {1446#true} is VALID [2018-11-23 12:29:18,274 INFO L256 TraceCheckUtils]: 35: Hoare triple {1446#true} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {1446#true} is VALID [2018-11-23 12:29:18,275 INFO L273 TraceCheckUtils]: 36: Hoare triple {1446#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1563#(<= xor_~i~0 1)} is VALID [2018-11-23 12:29:18,275 INFO L273 TraceCheckUtils]: 37: Hoare triple {1563#(<= xor_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1563#(<= xor_~i~0 1)} is VALID [2018-11-23 12:29:18,276 INFO L273 TraceCheckUtils]: 38: Hoare triple {1563#(<= xor_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1570#(<= xor_~i~0 2)} is VALID [2018-11-23 12:29:18,276 INFO L273 TraceCheckUtils]: 39: Hoare triple {1570#(<= xor_~i~0 2)} assume !(~i~0 < 100000); {1447#false} is VALID [2018-11-23 12:29:18,277 INFO L273 TraceCheckUtils]: 40: Hoare triple {1447#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1447#false} is VALID [2018-11-23 12:29:18,277 INFO L273 TraceCheckUtils]: 41: Hoare triple {1447#false} assume true; {1447#false} is VALID [2018-11-23 12:29:18,277 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1447#false} {1446#true} #74#return; {1447#false} is VALID [2018-11-23 12:29:18,277 INFO L273 TraceCheckUtils]: 43: Hoare triple {1447#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {1447#false} is VALID [2018-11-23 12:29:18,277 INFO L273 TraceCheckUtils]: 44: Hoare triple {1447#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {1447#false} is VALID [2018-11-23 12:29:18,277 INFO L273 TraceCheckUtils]: 45: Hoare triple {1447#false} assume !false; {1447#false} is VALID [2018-11-23 12:29:18,278 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-23 12:29:18,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:29:18,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-11-23 12:29:18,300 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-11-23 12:29:18,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:29:18,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:29:18,403 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 12:29:18,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:29:18,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:29:18,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:29:18,404 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 8 states. [2018-11-23 12:29:18,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:18,666 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2018-11-23 12:29:18,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:29:18,666 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-11-23 12:29:18,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:18,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:29:18,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2018-11-23 12:29:18,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:29:18,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2018-11-23 12:29:18,671 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 68 transitions. [2018-11-23 12:29:18,778 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 12:29:18,780 INFO L225 Difference]: With dead ends: 59 [2018-11-23 12:29:18,781 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 12:29:18,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:29:18,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 12:29:18,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-11-23 12:29:18,806 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:18,806 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 37 states. [2018-11-23 12:29:18,807 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 37 states. [2018-11-23 12:29:18,807 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 37 states. [2018-11-23 12:29:18,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:18,810 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-23 12:29:18,810 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 12:29:18,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:18,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:18,811 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 39 states. [2018-11-23 12:29:18,811 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 39 states. [2018-11-23 12:29:18,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:18,813 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-23 12:29:18,814 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 12:29:18,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:18,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:18,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:18,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:18,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:29:18,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-23 12:29:18,817 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 46 [2018-11-23 12:29:18,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:18,817 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-23 12:29:18,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:29:18,817 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-23 12:29:18,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 12:29:18,818 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:18,818 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:29:18,819 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:18,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:18,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1174865395, now seen corresponding path program 4 times [2018-11-23 12:29:18,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:18,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:18,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:18,820 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:29:18,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:18,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:18,949 INFO L256 TraceCheckUtils]: 0: Hoare triple {1809#true} call ULTIMATE.init(); {1809#true} is VALID [2018-11-23 12:29:18,949 INFO L273 TraceCheckUtils]: 1: Hoare triple {1809#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1809#true} is VALID [2018-11-23 12:29:18,950 INFO L273 TraceCheckUtils]: 2: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:29:18,950 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1809#true} {1809#true} #66#return; {1809#true} is VALID [2018-11-23 12:29:18,950 INFO L256 TraceCheckUtils]: 4: Hoare triple {1809#true} call #t~ret13 := main(); {1809#true} is VALID [2018-11-23 12:29:18,951 INFO L273 TraceCheckUtils]: 5: Hoare triple {1809#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1811#(= main_~i~1 0)} is VALID [2018-11-23 12:29:18,955 INFO L273 TraceCheckUtils]: 6: Hoare triple {1811#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1811#(= main_~i~1 0)} is VALID [2018-11-23 12:29:18,956 INFO L273 TraceCheckUtils]: 7: Hoare triple {1811#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1812#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:18,956 INFO L273 TraceCheckUtils]: 8: Hoare triple {1812#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1812#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:18,957 INFO L273 TraceCheckUtils]: 9: Hoare triple {1812#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1813#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:18,957 INFO L273 TraceCheckUtils]: 10: Hoare triple {1813#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1813#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:18,958 INFO L273 TraceCheckUtils]: 11: Hoare triple {1813#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1814#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:18,961 INFO L273 TraceCheckUtils]: 12: Hoare triple {1814#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1814#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:18,962 INFO L273 TraceCheckUtils]: 13: Hoare triple {1814#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1815#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:18,963 INFO L273 TraceCheckUtils]: 14: Hoare triple {1815#(<= main_~i~1 4)} assume !(~i~1 < 100000); {1810#false} is VALID [2018-11-23 12:29:18,963 INFO L256 TraceCheckUtils]: 15: Hoare triple {1810#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {1809#true} is VALID [2018-11-23 12:29:18,963 INFO L273 TraceCheckUtils]: 16: Hoare triple {1809#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1809#true} is VALID [2018-11-23 12:29:18,963 INFO L273 TraceCheckUtils]: 17: Hoare triple {1809#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1809#true} is VALID [2018-11-23 12:29:18,964 INFO L273 TraceCheckUtils]: 18: Hoare triple {1809#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1809#true} is VALID [2018-11-23 12:29:18,964 INFO L273 TraceCheckUtils]: 19: Hoare triple {1809#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1809#true} is VALID [2018-11-23 12:29:18,964 INFO L273 TraceCheckUtils]: 20: Hoare triple {1809#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1809#true} is VALID [2018-11-23 12:29:18,964 INFO L273 TraceCheckUtils]: 21: Hoare triple {1809#true} assume !(~i~0 < 100000); {1809#true} is VALID [2018-11-23 12:29:18,965 INFO L273 TraceCheckUtils]: 22: Hoare triple {1809#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1809#true} is VALID [2018-11-23 12:29:18,965 INFO L273 TraceCheckUtils]: 23: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:29:18,965 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1809#true} {1810#false} #70#return; {1810#false} is VALID [2018-11-23 12:29:18,965 INFO L273 TraceCheckUtils]: 25: Hoare triple {1810#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1810#false} is VALID [2018-11-23 12:29:18,965 INFO L256 TraceCheckUtils]: 26: Hoare triple {1810#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {1809#true} is VALID [2018-11-23 12:29:18,966 INFO L273 TraceCheckUtils]: 27: Hoare triple {1809#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1809#true} is VALID [2018-11-23 12:29:18,966 INFO L273 TraceCheckUtils]: 28: Hoare triple {1809#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1809#true} is VALID [2018-11-23 12:29:18,966 INFO L273 TraceCheckUtils]: 29: Hoare triple {1809#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1809#true} is VALID [2018-11-23 12:29:18,966 INFO L273 TraceCheckUtils]: 30: Hoare triple {1809#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1809#true} is VALID [2018-11-23 12:29:18,967 INFO L273 TraceCheckUtils]: 31: Hoare triple {1809#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1809#true} is VALID [2018-11-23 12:29:18,967 INFO L273 TraceCheckUtils]: 32: Hoare triple {1809#true} assume !(~i~0 < 100000); {1809#true} is VALID [2018-11-23 12:29:18,967 INFO L273 TraceCheckUtils]: 33: Hoare triple {1809#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1809#true} is VALID [2018-11-23 12:29:18,967 INFO L273 TraceCheckUtils]: 34: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:29:18,968 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1809#true} {1810#false} #72#return; {1810#false} is VALID [2018-11-23 12:29:18,968 INFO L273 TraceCheckUtils]: 36: Hoare triple {1810#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {1810#false} is VALID [2018-11-23 12:29:18,968 INFO L273 TraceCheckUtils]: 37: Hoare triple {1810#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {1810#false} is VALID [2018-11-23 12:29:18,968 INFO L273 TraceCheckUtils]: 38: Hoare triple {1810#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {1810#false} is VALID [2018-11-23 12:29:18,969 INFO L273 TraceCheckUtils]: 39: Hoare triple {1810#false} assume !(~i~2 < 99999); {1810#false} is VALID [2018-11-23 12:29:18,969 INFO L273 TraceCheckUtils]: 40: Hoare triple {1810#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {1810#false} is VALID [2018-11-23 12:29:18,969 INFO L256 TraceCheckUtils]: 41: Hoare triple {1810#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {1809#true} is VALID [2018-11-23 12:29:18,969 INFO L273 TraceCheckUtils]: 42: Hoare triple {1809#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1809#true} is VALID [2018-11-23 12:29:18,970 INFO L273 TraceCheckUtils]: 43: Hoare triple {1809#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1809#true} is VALID [2018-11-23 12:29:18,970 INFO L273 TraceCheckUtils]: 44: Hoare triple {1809#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1809#true} is VALID [2018-11-23 12:29:18,970 INFO L273 TraceCheckUtils]: 45: Hoare triple {1809#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1809#true} is VALID [2018-11-23 12:29:18,970 INFO L273 TraceCheckUtils]: 46: Hoare triple {1809#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1809#true} is VALID [2018-11-23 12:29:18,971 INFO L273 TraceCheckUtils]: 47: Hoare triple {1809#true} assume !(~i~0 < 100000); {1809#true} is VALID [2018-11-23 12:29:18,971 INFO L273 TraceCheckUtils]: 48: Hoare triple {1809#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1809#true} is VALID [2018-11-23 12:29:18,971 INFO L273 TraceCheckUtils]: 49: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:29:18,971 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {1809#true} {1810#false} #74#return; {1810#false} is VALID [2018-11-23 12:29:18,972 INFO L273 TraceCheckUtils]: 51: Hoare triple {1810#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {1810#false} is VALID [2018-11-23 12:29:18,972 INFO L273 TraceCheckUtils]: 52: Hoare triple {1810#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {1810#false} is VALID [2018-11-23 12:29:18,972 INFO L273 TraceCheckUtils]: 53: Hoare triple {1810#false} assume !false; {1810#false} is VALID [2018-11-23 12:29:18,975 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-23 12:29:18,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:29:18,976 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 12:29:18,993 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:29:19,053 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:29:19,053 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:29:19,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:19,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:29:19,222 INFO L256 TraceCheckUtils]: 0: Hoare triple {1809#true} call ULTIMATE.init(); {1809#true} is VALID [2018-11-23 12:29:19,222 INFO L273 TraceCheckUtils]: 1: Hoare triple {1809#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1809#true} is VALID [2018-11-23 12:29:19,222 INFO L273 TraceCheckUtils]: 2: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:29:19,222 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1809#true} {1809#true} #66#return; {1809#true} is VALID [2018-11-23 12:29:19,222 INFO L256 TraceCheckUtils]: 4: Hoare triple {1809#true} call #t~ret13 := main(); {1809#true} is VALID [2018-11-23 12:29:19,223 INFO L273 TraceCheckUtils]: 5: Hoare triple {1809#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1834#(<= main_~i~1 0)} is VALID [2018-11-23 12:29:19,224 INFO L273 TraceCheckUtils]: 6: Hoare triple {1834#(<= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1834#(<= main_~i~1 0)} is VALID [2018-11-23 12:29:19,225 INFO L273 TraceCheckUtils]: 7: Hoare triple {1834#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1812#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:19,225 INFO L273 TraceCheckUtils]: 8: Hoare triple {1812#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1812#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:19,226 INFO L273 TraceCheckUtils]: 9: Hoare triple {1812#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1813#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:19,226 INFO L273 TraceCheckUtils]: 10: Hoare triple {1813#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1813#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:19,227 INFO L273 TraceCheckUtils]: 11: Hoare triple {1813#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1814#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:19,227 INFO L273 TraceCheckUtils]: 12: Hoare triple {1814#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1814#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:19,233 INFO L273 TraceCheckUtils]: 13: Hoare triple {1814#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1815#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:19,234 INFO L273 TraceCheckUtils]: 14: Hoare triple {1815#(<= main_~i~1 4)} assume !(~i~1 < 100000); {1810#false} is VALID [2018-11-23 12:29:19,234 INFO L256 TraceCheckUtils]: 15: Hoare triple {1810#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {1810#false} is VALID [2018-11-23 12:29:19,234 INFO L273 TraceCheckUtils]: 16: Hoare triple {1810#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1810#false} is VALID [2018-11-23 12:29:19,235 INFO L273 TraceCheckUtils]: 17: Hoare triple {1810#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1810#false} is VALID [2018-11-23 12:29:19,235 INFO L273 TraceCheckUtils]: 18: Hoare triple {1810#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1810#false} is VALID [2018-11-23 12:29:19,235 INFO L273 TraceCheckUtils]: 19: Hoare triple {1810#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1810#false} is VALID [2018-11-23 12:29:19,235 INFO L273 TraceCheckUtils]: 20: Hoare triple {1810#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1810#false} is VALID [2018-11-23 12:29:19,235 INFO L273 TraceCheckUtils]: 21: Hoare triple {1810#false} assume !(~i~0 < 100000); {1810#false} is VALID [2018-11-23 12:29:19,236 INFO L273 TraceCheckUtils]: 22: Hoare triple {1810#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1810#false} is VALID [2018-11-23 12:29:19,236 INFO L273 TraceCheckUtils]: 23: Hoare triple {1810#false} assume true; {1810#false} is VALID [2018-11-23 12:29:19,236 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1810#false} {1810#false} #70#return; {1810#false} is VALID [2018-11-23 12:29:19,237 INFO L273 TraceCheckUtils]: 25: Hoare triple {1810#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1810#false} is VALID [2018-11-23 12:29:19,237 INFO L256 TraceCheckUtils]: 26: Hoare triple {1810#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {1810#false} is VALID [2018-11-23 12:29:19,237 INFO L273 TraceCheckUtils]: 27: Hoare triple {1810#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1810#false} is VALID [2018-11-23 12:29:19,237 INFO L273 TraceCheckUtils]: 28: Hoare triple {1810#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1810#false} is VALID [2018-11-23 12:29:19,237 INFO L273 TraceCheckUtils]: 29: Hoare triple {1810#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1810#false} is VALID [2018-11-23 12:29:19,238 INFO L273 TraceCheckUtils]: 30: Hoare triple {1810#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1810#false} is VALID [2018-11-23 12:29:19,238 INFO L273 TraceCheckUtils]: 31: Hoare triple {1810#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1810#false} is VALID [2018-11-23 12:29:19,238 INFO L273 TraceCheckUtils]: 32: Hoare triple {1810#false} assume !(~i~0 < 100000); {1810#false} is VALID [2018-11-23 12:29:19,238 INFO L273 TraceCheckUtils]: 33: Hoare triple {1810#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1810#false} is VALID [2018-11-23 12:29:19,239 INFO L273 TraceCheckUtils]: 34: Hoare triple {1810#false} assume true; {1810#false} is VALID [2018-11-23 12:29:19,239 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1810#false} {1810#false} #72#return; {1810#false} is VALID [2018-11-23 12:29:19,239 INFO L273 TraceCheckUtils]: 36: Hoare triple {1810#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {1810#false} is VALID [2018-11-23 12:29:19,239 INFO L273 TraceCheckUtils]: 37: Hoare triple {1810#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {1810#false} is VALID [2018-11-23 12:29:19,240 INFO L273 TraceCheckUtils]: 38: Hoare triple {1810#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {1810#false} is VALID [2018-11-23 12:29:19,240 INFO L273 TraceCheckUtils]: 39: Hoare triple {1810#false} assume !(~i~2 < 99999); {1810#false} is VALID [2018-11-23 12:29:19,240 INFO L273 TraceCheckUtils]: 40: Hoare triple {1810#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {1810#false} is VALID [2018-11-23 12:29:19,240 INFO L256 TraceCheckUtils]: 41: Hoare triple {1810#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {1810#false} is VALID [2018-11-23 12:29:19,241 INFO L273 TraceCheckUtils]: 42: Hoare triple {1810#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1810#false} is VALID [2018-11-23 12:29:19,241 INFO L273 TraceCheckUtils]: 43: Hoare triple {1810#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1810#false} is VALID [2018-11-23 12:29:19,241 INFO L273 TraceCheckUtils]: 44: Hoare triple {1810#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1810#false} is VALID [2018-11-23 12:29:19,241 INFO L273 TraceCheckUtils]: 45: Hoare triple {1810#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1810#false} is VALID [2018-11-23 12:29:19,241 INFO L273 TraceCheckUtils]: 46: Hoare triple {1810#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1810#false} is VALID [2018-11-23 12:29:19,242 INFO L273 TraceCheckUtils]: 47: Hoare triple {1810#false} assume !(~i~0 < 100000); {1810#false} is VALID [2018-11-23 12:29:19,242 INFO L273 TraceCheckUtils]: 48: Hoare triple {1810#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1810#false} is VALID [2018-11-23 12:29:19,242 INFO L273 TraceCheckUtils]: 49: Hoare triple {1810#false} assume true; {1810#false} is VALID [2018-11-23 12:29:19,242 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {1810#false} {1810#false} #74#return; {1810#false} is VALID [2018-11-23 12:29:19,242 INFO L273 TraceCheckUtils]: 51: Hoare triple {1810#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {1810#false} is VALID [2018-11-23 12:29:19,242 INFO L273 TraceCheckUtils]: 52: Hoare triple {1810#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {1810#false} is VALID [2018-11-23 12:29:19,243 INFO L273 TraceCheckUtils]: 53: Hoare triple {1810#false} assume !false; {1810#false} is VALID [2018-11-23 12:29:19,246 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-23 12:29:19,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:29:19,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 12:29:19,267 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-11-23 12:29:19,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:29:19,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:29:19,355 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 12:29:19,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:29:19,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:29:19,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:29:19,356 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 8 states. [2018-11-23 12:29:19,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:19,578 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-11-23 12:29:19,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:29:19,578 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-11-23 12:29:19,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:19,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:29:19,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2018-11-23 12:29:19,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:29:19,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2018-11-23 12:29:19,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 62 transitions. [2018-11-23 12:29:19,683 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 12:29:19,684 INFO L225 Difference]: With dead ends: 62 [2018-11-23 12:29:19,685 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 12:29:19,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 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 12:29:19,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 12:29:19,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-23 12:29:19,709 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:19,710 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 39 states. [2018-11-23 12:29:19,710 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 39 states. [2018-11-23 12:29:19,710 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 39 states. [2018-11-23 12:29:19,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:19,712 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-23 12:29:19,712 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-23 12:29:19,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:19,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:19,713 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 40 states. [2018-11-23 12:29:19,713 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 40 states. [2018-11-23 12:29:19,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:19,715 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-23 12:29:19,716 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-23 12:29:19,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:19,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:19,716 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:19,717 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:19,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:29:19,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-11-23 12:29:19,719 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 54 [2018-11-23 12:29:19,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:19,719 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-23 12:29:19,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:29:19,719 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 12:29:19,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 12:29:19,720 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:19,720 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:29:19,721 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:19,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:19,721 INFO L82 PathProgramCache]: Analyzing trace with hash -170213137, now seen corresponding path program 5 times [2018-11-23 12:29:19,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:19,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:19,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:19,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:29:19,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:19,868 INFO L256 TraceCheckUtils]: 0: Hoare triple {2206#true} call ULTIMATE.init(); {2206#true} is VALID [2018-11-23 12:29:19,869 INFO L273 TraceCheckUtils]: 1: Hoare triple {2206#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2206#true} is VALID [2018-11-23 12:29:19,869 INFO L273 TraceCheckUtils]: 2: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:29:19,869 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2206#true} {2206#true} #66#return; {2206#true} is VALID [2018-11-23 12:29:19,869 INFO L256 TraceCheckUtils]: 4: Hoare triple {2206#true} call #t~ret13 := main(); {2206#true} is VALID [2018-11-23 12:29:19,873 INFO L273 TraceCheckUtils]: 5: Hoare triple {2206#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2208#(= main_~i~1 0)} is VALID [2018-11-23 12:29:19,873 INFO L273 TraceCheckUtils]: 6: Hoare triple {2208#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2208#(= main_~i~1 0)} is VALID [2018-11-23 12:29:19,874 INFO L273 TraceCheckUtils]: 7: Hoare triple {2208#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2209#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:19,874 INFO L273 TraceCheckUtils]: 8: Hoare triple {2209#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2209#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:19,875 INFO L273 TraceCheckUtils]: 9: Hoare triple {2209#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2210#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:19,875 INFO L273 TraceCheckUtils]: 10: Hoare triple {2210#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2210#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:19,876 INFO L273 TraceCheckUtils]: 11: Hoare triple {2210#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2211#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:19,876 INFO L273 TraceCheckUtils]: 12: Hoare triple {2211#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2211#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:19,877 INFO L273 TraceCheckUtils]: 13: Hoare triple {2211#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2212#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:19,877 INFO L273 TraceCheckUtils]: 14: Hoare triple {2212#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2212#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:19,878 INFO L273 TraceCheckUtils]: 15: Hoare triple {2212#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2213#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:19,879 INFO L273 TraceCheckUtils]: 16: Hoare triple {2213#(<= main_~i~1 5)} assume !(~i~1 < 100000); {2207#false} is VALID [2018-11-23 12:29:19,879 INFO L256 TraceCheckUtils]: 17: Hoare triple {2207#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {2206#true} is VALID [2018-11-23 12:29:19,879 INFO L273 TraceCheckUtils]: 18: Hoare triple {2206#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2206#true} is VALID [2018-11-23 12:29:19,880 INFO L273 TraceCheckUtils]: 19: Hoare triple {2206#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2206#true} is VALID [2018-11-23 12:29:19,880 INFO L273 TraceCheckUtils]: 20: Hoare triple {2206#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2206#true} is VALID [2018-11-23 12:29:19,880 INFO L273 TraceCheckUtils]: 21: Hoare triple {2206#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2206#true} is VALID [2018-11-23 12:29:19,880 INFO L273 TraceCheckUtils]: 22: Hoare triple {2206#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2206#true} is VALID [2018-11-23 12:29:19,880 INFO L273 TraceCheckUtils]: 23: Hoare triple {2206#true} assume !(~i~0 < 100000); {2206#true} is VALID [2018-11-23 12:29:19,881 INFO L273 TraceCheckUtils]: 24: Hoare triple {2206#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2206#true} is VALID [2018-11-23 12:29:19,881 INFO L273 TraceCheckUtils]: 25: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:29:19,881 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {2206#true} {2207#false} #70#return; {2207#false} is VALID [2018-11-23 12:29:19,881 INFO L273 TraceCheckUtils]: 27: Hoare triple {2207#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {2207#false} is VALID [2018-11-23 12:29:19,882 INFO L256 TraceCheckUtils]: 28: Hoare triple {2207#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {2206#true} is VALID [2018-11-23 12:29:19,882 INFO L273 TraceCheckUtils]: 29: Hoare triple {2206#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2206#true} is VALID [2018-11-23 12:29:19,882 INFO L273 TraceCheckUtils]: 30: Hoare triple {2206#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2206#true} is VALID [2018-11-23 12:29:19,882 INFO L273 TraceCheckUtils]: 31: Hoare triple {2206#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2206#true} is VALID [2018-11-23 12:29:19,883 INFO L273 TraceCheckUtils]: 32: Hoare triple {2206#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2206#true} is VALID [2018-11-23 12:29:19,883 INFO L273 TraceCheckUtils]: 33: Hoare triple {2206#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2206#true} is VALID [2018-11-23 12:29:19,883 INFO L273 TraceCheckUtils]: 34: Hoare triple {2206#true} assume !(~i~0 < 100000); {2206#true} is VALID [2018-11-23 12:29:19,883 INFO L273 TraceCheckUtils]: 35: Hoare triple {2206#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2206#true} is VALID [2018-11-23 12:29:19,883 INFO L273 TraceCheckUtils]: 36: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:29:19,883 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {2206#true} {2207#false} #72#return; {2207#false} is VALID [2018-11-23 12:29:19,883 INFO L273 TraceCheckUtils]: 38: Hoare triple {2207#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {2207#false} is VALID [2018-11-23 12:29:19,883 INFO L273 TraceCheckUtils]: 39: Hoare triple {2207#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {2207#false} is VALID [2018-11-23 12:29:19,884 INFO L273 TraceCheckUtils]: 40: Hoare triple {2207#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {2207#false} is VALID [2018-11-23 12:29:19,884 INFO L273 TraceCheckUtils]: 41: Hoare triple {2207#false} assume !(~i~2 < 99999); {2207#false} is VALID [2018-11-23 12:29:19,884 INFO L273 TraceCheckUtils]: 42: Hoare triple {2207#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {2207#false} is VALID [2018-11-23 12:29:19,884 INFO L256 TraceCheckUtils]: 43: Hoare triple {2207#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {2206#true} is VALID [2018-11-23 12:29:19,884 INFO L273 TraceCheckUtils]: 44: Hoare triple {2206#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2206#true} is VALID [2018-11-23 12:29:19,884 INFO L273 TraceCheckUtils]: 45: Hoare triple {2206#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2206#true} is VALID [2018-11-23 12:29:19,884 INFO L273 TraceCheckUtils]: 46: Hoare triple {2206#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2206#true} is VALID [2018-11-23 12:29:19,885 INFO L273 TraceCheckUtils]: 47: Hoare triple {2206#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2206#true} is VALID [2018-11-23 12:29:19,885 INFO L273 TraceCheckUtils]: 48: Hoare triple {2206#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2206#true} is VALID [2018-11-23 12:29:19,885 INFO L273 TraceCheckUtils]: 49: Hoare triple {2206#true} assume !(~i~0 < 100000); {2206#true} is VALID [2018-11-23 12:29:19,885 INFO L273 TraceCheckUtils]: 50: Hoare triple {2206#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2206#true} is VALID [2018-11-23 12:29:19,885 INFO L273 TraceCheckUtils]: 51: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:29:19,885 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {2206#true} {2207#false} #74#return; {2207#false} is VALID [2018-11-23 12:29:19,885 INFO L273 TraceCheckUtils]: 53: Hoare triple {2207#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {2207#false} is VALID [2018-11-23 12:29:19,885 INFO L273 TraceCheckUtils]: 54: Hoare triple {2207#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {2207#false} is VALID [2018-11-23 12:29:19,886 INFO L273 TraceCheckUtils]: 55: Hoare triple {2207#false} assume !false; {2207#false} is VALID [2018-11-23 12:29:19,887 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-23 12:29:19,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:29:19,887 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 12:29:19,897 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:29:19,947 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 12:29:19,947 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:29:19,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:19,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:29:20,106 INFO L256 TraceCheckUtils]: 0: Hoare triple {2206#true} call ULTIMATE.init(); {2206#true} is VALID [2018-11-23 12:29:20,106 INFO L273 TraceCheckUtils]: 1: Hoare triple {2206#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2206#true} is VALID [2018-11-23 12:29:20,106 INFO L273 TraceCheckUtils]: 2: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:29:20,107 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2206#true} {2206#true} #66#return; {2206#true} is VALID [2018-11-23 12:29:20,107 INFO L256 TraceCheckUtils]: 4: Hoare triple {2206#true} call #t~ret13 := main(); {2206#true} is VALID [2018-11-23 12:29:20,107 INFO L273 TraceCheckUtils]: 5: Hoare triple {2206#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2206#true} is VALID [2018-11-23 12:29:20,107 INFO L273 TraceCheckUtils]: 6: Hoare triple {2206#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2206#true} is VALID [2018-11-23 12:29:20,107 INFO L273 TraceCheckUtils]: 7: Hoare triple {2206#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2206#true} is VALID [2018-11-23 12:29:20,107 INFO L273 TraceCheckUtils]: 8: Hoare triple {2206#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2206#true} is VALID [2018-11-23 12:29:20,108 INFO L273 TraceCheckUtils]: 9: Hoare triple {2206#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2206#true} is VALID [2018-11-23 12:29:20,108 INFO L273 TraceCheckUtils]: 10: Hoare triple {2206#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2206#true} is VALID [2018-11-23 12:29:20,108 INFO L273 TraceCheckUtils]: 11: Hoare triple {2206#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2206#true} is VALID [2018-11-23 12:29:20,108 INFO L273 TraceCheckUtils]: 12: Hoare triple {2206#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2206#true} is VALID [2018-11-23 12:29:20,108 INFO L273 TraceCheckUtils]: 13: Hoare triple {2206#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2206#true} is VALID [2018-11-23 12:29:20,108 INFO L273 TraceCheckUtils]: 14: Hoare triple {2206#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2206#true} is VALID [2018-11-23 12:29:20,108 INFO L273 TraceCheckUtils]: 15: Hoare triple {2206#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2206#true} is VALID [2018-11-23 12:29:20,109 INFO L273 TraceCheckUtils]: 16: Hoare triple {2206#true} assume !(~i~1 < 100000); {2206#true} is VALID [2018-11-23 12:29:20,109 INFO L256 TraceCheckUtils]: 17: Hoare triple {2206#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {2206#true} is VALID [2018-11-23 12:29:20,109 INFO L273 TraceCheckUtils]: 18: Hoare triple {2206#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2271#(<= xor_~i~0 1)} is VALID [2018-11-23 12:29:20,110 INFO L273 TraceCheckUtils]: 19: Hoare triple {2271#(<= xor_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2271#(<= xor_~i~0 1)} is VALID [2018-11-23 12:29:20,110 INFO L273 TraceCheckUtils]: 20: Hoare triple {2271#(<= xor_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2278#(<= xor_~i~0 2)} is VALID [2018-11-23 12:29:20,111 INFO L273 TraceCheckUtils]: 21: Hoare triple {2278#(<= xor_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2278#(<= xor_~i~0 2)} is VALID [2018-11-23 12:29:20,111 INFO L273 TraceCheckUtils]: 22: Hoare triple {2278#(<= xor_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2285#(<= xor_~i~0 3)} is VALID [2018-11-23 12:29:20,112 INFO L273 TraceCheckUtils]: 23: Hoare triple {2285#(<= xor_~i~0 3)} assume !(~i~0 < 100000); {2207#false} is VALID [2018-11-23 12:29:20,112 INFO L273 TraceCheckUtils]: 24: Hoare triple {2207#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2207#false} is VALID [2018-11-23 12:29:20,112 INFO L273 TraceCheckUtils]: 25: Hoare triple {2207#false} assume true; {2207#false} is VALID [2018-11-23 12:29:20,112 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {2207#false} {2206#true} #70#return; {2207#false} is VALID [2018-11-23 12:29:20,112 INFO L273 TraceCheckUtils]: 27: Hoare triple {2207#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {2207#false} is VALID [2018-11-23 12:29:20,113 INFO L256 TraceCheckUtils]: 28: Hoare triple {2207#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {2207#false} is VALID [2018-11-23 12:29:20,113 INFO L273 TraceCheckUtils]: 29: Hoare triple {2207#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2207#false} is VALID [2018-11-23 12:29:20,113 INFO L273 TraceCheckUtils]: 30: Hoare triple {2207#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2207#false} is VALID [2018-11-23 12:29:20,113 INFO L273 TraceCheckUtils]: 31: Hoare triple {2207#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2207#false} is VALID [2018-11-23 12:29:20,113 INFO L273 TraceCheckUtils]: 32: Hoare triple {2207#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2207#false} is VALID [2018-11-23 12:29:20,114 INFO L273 TraceCheckUtils]: 33: Hoare triple {2207#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2207#false} is VALID [2018-11-23 12:29:20,114 INFO L273 TraceCheckUtils]: 34: Hoare triple {2207#false} assume !(~i~0 < 100000); {2207#false} is VALID [2018-11-23 12:29:20,114 INFO L273 TraceCheckUtils]: 35: Hoare triple {2207#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2207#false} is VALID [2018-11-23 12:29:20,114 INFO L273 TraceCheckUtils]: 36: Hoare triple {2207#false} assume true; {2207#false} is VALID [2018-11-23 12:29:20,115 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {2207#false} {2207#false} #72#return; {2207#false} is VALID [2018-11-23 12:29:20,115 INFO L273 TraceCheckUtils]: 38: Hoare triple {2207#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {2207#false} is VALID [2018-11-23 12:29:20,115 INFO L273 TraceCheckUtils]: 39: Hoare triple {2207#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {2207#false} is VALID [2018-11-23 12:29:20,115 INFO L273 TraceCheckUtils]: 40: Hoare triple {2207#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {2207#false} is VALID [2018-11-23 12:29:20,115 INFO L273 TraceCheckUtils]: 41: Hoare triple {2207#false} assume !(~i~2 < 99999); {2207#false} is VALID [2018-11-23 12:29:20,116 INFO L273 TraceCheckUtils]: 42: Hoare triple {2207#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {2207#false} is VALID [2018-11-23 12:29:20,116 INFO L256 TraceCheckUtils]: 43: Hoare triple {2207#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {2207#false} is VALID [2018-11-23 12:29:20,116 INFO L273 TraceCheckUtils]: 44: Hoare triple {2207#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2207#false} is VALID [2018-11-23 12:29:20,116 INFO L273 TraceCheckUtils]: 45: Hoare triple {2207#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2207#false} is VALID [2018-11-23 12:29:20,116 INFO L273 TraceCheckUtils]: 46: Hoare triple {2207#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2207#false} is VALID [2018-11-23 12:29:20,117 INFO L273 TraceCheckUtils]: 47: Hoare triple {2207#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2207#false} is VALID [2018-11-23 12:29:20,117 INFO L273 TraceCheckUtils]: 48: Hoare triple {2207#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2207#false} is VALID [2018-11-23 12:29:20,117 INFO L273 TraceCheckUtils]: 49: Hoare triple {2207#false} assume !(~i~0 < 100000); {2207#false} is VALID [2018-11-23 12:29:20,117 INFO L273 TraceCheckUtils]: 50: Hoare triple {2207#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2207#false} is VALID [2018-11-23 12:29:20,117 INFO L273 TraceCheckUtils]: 51: Hoare triple {2207#false} assume true; {2207#false} is VALID [2018-11-23 12:29:20,118 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {2207#false} {2207#false} #74#return; {2207#false} is VALID [2018-11-23 12:29:20,118 INFO L273 TraceCheckUtils]: 53: Hoare triple {2207#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {2207#false} is VALID [2018-11-23 12:29:20,118 INFO L273 TraceCheckUtils]: 54: Hoare triple {2207#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {2207#false} is VALID [2018-11-23 12:29:20,118 INFO L273 TraceCheckUtils]: 55: Hoare triple {2207#false} assume !false; {2207#false} is VALID [2018-11-23 12:29:20,120 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 28 proven. 4 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-23 12:29:20,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:29:20,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-11-23 12:29:20,150 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2018-11-23 12:29:20,151 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:29:20,151 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:29:20,351 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 12:29:20,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:29:20,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:29:20,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:29:20,353 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 11 states. [2018-11-23 12:29:21,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:21,001 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2018-11-23 12:29:21,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:29:21,002 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2018-11-23 12:29:21,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:21,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:29:21,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 74 transitions. [2018-11-23 12:29:21,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:29:21,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 74 transitions. [2018-11-23 12:29:21,008 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 74 transitions. [2018-11-23 12:29:21,106 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 12:29:21,107 INFO L225 Difference]: With dead ends: 67 [2018-11-23 12:29:21,108 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 12:29:21,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:29:21,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 12:29:21,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-11-23 12:29:21,145 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:21,146 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 43 states. [2018-11-23 12:29:21,146 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 43 states. [2018-11-23 12:29:21,146 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 43 states. [2018-11-23 12:29:21,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:21,149 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-11-23 12:29:21,149 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-23 12:29:21,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:21,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:21,149 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 45 states. [2018-11-23 12:29:21,149 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 45 states. [2018-11-23 12:29:21,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:21,151 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-11-23 12:29:21,151 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-23 12:29:21,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:21,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:21,152 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:21,152 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:21,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:29:21,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-11-23 12:29:21,153 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 56 [2018-11-23 12:29:21,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:21,154 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-11-23 12:29:21,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:29:21,154 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-23 12:29:21,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 12:29:21,155 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:21,155 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:29:21,155 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:21,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:21,156 INFO L82 PathProgramCache]: Analyzing trace with hash 778875311, now seen corresponding path program 6 times [2018-11-23 12:29:21,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:21,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:21,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:21,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:29:21,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:21,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:21,465 INFO L256 TraceCheckUtils]: 0: Hoare triple {2635#true} call ULTIMATE.init(); {2635#true} is VALID [2018-11-23 12:29:21,465 INFO L273 TraceCheckUtils]: 1: Hoare triple {2635#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2635#true} is VALID [2018-11-23 12:29:21,466 INFO L273 TraceCheckUtils]: 2: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:29:21,466 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2635#true} {2635#true} #66#return; {2635#true} is VALID [2018-11-23 12:29:21,466 INFO L256 TraceCheckUtils]: 4: Hoare triple {2635#true} call #t~ret13 := main(); {2635#true} is VALID [2018-11-23 12:29:21,467 INFO L273 TraceCheckUtils]: 5: Hoare triple {2635#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2637#(= main_~i~1 0)} is VALID [2018-11-23 12:29:21,467 INFO L273 TraceCheckUtils]: 6: Hoare triple {2637#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2637#(= main_~i~1 0)} is VALID [2018-11-23 12:29:21,468 INFO L273 TraceCheckUtils]: 7: Hoare triple {2637#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2638#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:21,468 INFO L273 TraceCheckUtils]: 8: Hoare triple {2638#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2638#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:21,469 INFO L273 TraceCheckUtils]: 9: Hoare triple {2638#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2639#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:21,469 INFO L273 TraceCheckUtils]: 10: Hoare triple {2639#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2639#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:21,470 INFO L273 TraceCheckUtils]: 11: Hoare triple {2639#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2640#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:21,471 INFO L273 TraceCheckUtils]: 12: Hoare triple {2640#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2640#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:21,471 INFO L273 TraceCheckUtils]: 13: Hoare triple {2640#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2641#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:21,472 INFO L273 TraceCheckUtils]: 14: Hoare triple {2641#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2641#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:21,473 INFO L273 TraceCheckUtils]: 15: Hoare triple {2641#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2642#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:21,473 INFO L273 TraceCheckUtils]: 16: Hoare triple {2642#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2642#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:21,474 INFO L273 TraceCheckUtils]: 17: Hoare triple {2642#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2643#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:21,475 INFO L273 TraceCheckUtils]: 18: Hoare triple {2643#(<= main_~i~1 6)} assume !(~i~1 < 100000); {2636#false} is VALID [2018-11-23 12:29:21,475 INFO L256 TraceCheckUtils]: 19: Hoare triple {2636#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {2635#true} is VALID [2018-11-23 12:29:21,475 INFO L273 TraceCheckUtils]: 20: Hoare triple {2635#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2635#true} is VALID [2018-11-23 12:29:21,476 INFO L273 TraceCheckUtils]: 21: Hoare triple {2635#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:29:21,476 INFO L273 TraceCheckUtils]: 22: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:29:21,476 INFO L273 TraceCheckUtils]: 23: Hoare triple {2635#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:29:21,476 INFO L273 TraceCheckUtils]: 24: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:29:21,476 INFO L273 TraceCheckUtils]: 25: Hoare triple {2635#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:29:21,477 INFO L273 TraceCheckUtils]: 26: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:29:21,477 INFO L273 TraceCheckUtils]: 27: Hoare triple {2635#true} assume !(~i~0 < 100000); {2635#true} is VALID [2018-11-23 12:29:21,477 INFO L273 TraceCheckUtils]: 28: Hoare triple {2635#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2635#true} is VALID [2018-11-23 12:29:21,477 INFO L273 TraceCheckUtils]: 29: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:29:21,478 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {2635#true} {2636#false} #70#return; {2636#false} is VALID [2018-11-23 12:29:21,478 INFO L273 TraceCheckUtils]: 31: Hoare triple {2636#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {2636#false} is VALID [2018-11-23 12:29:21,478 INFO L256 TraceCheckUtils]: 32: Hoare triple {2636#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {2635#true} is VALID [2018-11-23 12:29:21,478 INFO L273 TraceCheckUtils]: 33: Hoare triple {2635#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2635#true} is VALID [2018-11-23 12:29:21,478 INFO L273 TraceCheckUtils]: 34: Hoare triple {2635#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:29:21,479 INFO L273 TraceCheckUtils]: 35: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:29:21,479 INFO L273 TraceCheckUtils]: 36: Hoare triple {2635#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:29:21,479 INFO L273 TraceCheckUtils]: 37: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:29:21,479 INFO L273 TraceCheckUtils]: 38: Hoare triple {2635#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:29:21,479 INFO L273 TraceCheckUtils]: 39: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:29:21,479 INFO L273 TraceCheckUtils]: 40: Hoare triple {2635#true} assume !(~i~0 < 100000); {2635#true} is VALID [2018-11-23 12:29:21,479 INFO L273 TraceCheckUtils]: 41: Hoare triple {2635#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2635#true} is VALID [2018-11-23 12:29:21,480 INFO L273 TraceCheckUtils]: 42: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:29:21,480 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {2635#true} {2636#false} #72#return; {2636#false} is VALID [2018-11-23 12:29:21,480 INFO L273 TraceCheckUtils]: 44: Hoare triple {2636#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {2636#false} is VALID [2018-11-23 12:29:21,480 INFO L273 TraceCheckUtils]: 45: Hoare triple {2636#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {2636#false} is VALID [2018-11-23 12:29:21,480 INFO L273 TraceCheckUtils]: 46: Hoare triple {2636#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {2636#false} is VALID [2018-11-23 12:29:21,480 INFO L273 TraceCheckUtils]: 47: Hoare triple {2636#false} assume !(~i~2 < 99999); {2636#false} is VALID [2018-11-23 12:29:21,480 INFO L273 TraceCheckUtils]: 48: Hoare triple {2636#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {2636#false} is VALID [2018-11-23 12:29:21,480 INFO L256 TraceCheckUtils]: 49: Hoare triple {2636#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {2635#true} is VALID [2018-11-23 12:29:21,481 INFO L273 TraceCheckUtils]: 50: Hoare triple {2635#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2635#true} is VALID [2018-11-23 12:29:21,481 INFO L273 TraceCheckUtils]: 51: Hoare triple {2635#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:29:21,481 INFO L273 TraceCheckUtils]: 52: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:29:21,481 INFO L273 TraceCheckUtils]: 53: Hoare triple {2635#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:29:21,481 INFO L273 TraceCheckUtils]: 54: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:29:21,481 INFO L273 TraceCheckUtils]: 55: Hoare triple {2635#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:29:21,481 INFO L273 TraceCheckUtils]: 56: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:29:21,481 INFO L273 TraceCheckUtils]: 57: Hoare triple {2635#true} assume !(~i~0 < 100000); {2635#true} is VALID [2018-11-23 12:29:21,482 INFO L273 TraceCheckUtils]: 58: Hoare triple {2635#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2635#true} is VALID [2018-11-23 12:29:21,482 INFO L273 TraceCheckUtils]: 59: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:29:21,482 INFO L268 TraceCheckUtils]: 60: Hoare quadruple {2635#true} {2636#false} #74#return; {2636#false} is VALID [2018-11-23 12:29:21,482 INFO L273 TraceCheckUtils]: 61: Hoare triple {2636#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {2636#false} is VALID [2018-11-23 12:29:21,482 INFO L273 TraceCheckUtils]: 62: Hoare triple {2636#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {2636#false} is VALID [2018-11-23 12:29:21,482 INFO L273 TraceCheckUtils]: 63: Hoare triple {2636#false} assume !false; {2636#false} is VALID [2018-11-23 12:29:21,484 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-11-23 12:29:21,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:29:21,485 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 12:29:21,496 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:29:21,539 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-11-23 12:29:21,539 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:29:21,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:21,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:29:21,863 INFO L256 TraceCheckUtils]: 0: Hoare triple {2635#true} call ULTIMATE.init(); {2635#true} is VALID [2018-11-23 12:29:21,863 INFO L273 TraceCheckUtils]: 1: Hoare triple {2635#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2635#true} is VALID [2018-11-23 12:29:21,863 INFO L273 TraceCheckUtils]: 2: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:29:21,864 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2635#true} {2635#true} #66#return; {2635#true} is VALID [2018-11-23 12:29:21,864 INFO L256 TraceCheckUtils]: 4: Hoare triple {2635#true} call #t~ret13 := main(); {2635#true} is VALID [2018-11-23 12:29:21,864 INFO L273 TraceCheckUtils]: 5: Hoare triple {2635#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2635#true} is VALID [2018-11-23 12:29:21,864 INFO L273 TraceCheckUtils]: 6: Hoare triple {2635#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2635#true} is VALID [2018-11-23 12:29:21,864 INFO L273 TraceCheckUtils]: 7: Hoare triple {2635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2635#true} is VALID [2018-11-23 12:29:21,864 INFO L273 TraceCheckUtils]: 8: Hoare triple {2635#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2635#true} is VALID [2018-11-23 12:29:21,864 INFO L273 TraceCheckUtils]: 9: Hoare triple {2635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2635#true} is VALID [2018-11-23 12:29:21,864 INFO L273 TraceCheckUtils]: 10: Hoare triple {2635#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2635#true} is VALID [2018-11-23 12:29:21,865 INFO L273 TraceCheckUtils]: 11: Hoare triple {2635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2635#true} is VALID [2018-11-23 12:29:21,865 INFO L273 TraceCheckUtils]: 12: Hoare triple {2635#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2635#true} is VALID [2018-11-23 12:29:21,865 INFO L273 TraceCheckUtils]: 13: Hoare triple {2635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2635#true} is VALID [2018-11-23 12:29:21,865 INFO L273 TraceCheckUtils]: 14: Hoare triple {2635#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2635#true} is VALID [2018-11-23 12:29:21,865 INFO L273 TraceCheckUtils]: 15: Hoare triple {2635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2635#true} is VALID [2018-11-23 12:29:21,865 INFO L273 TraceCheckUtils]: 16: Hoare triple {2635#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2635#true} is VALID [2018-11-23 12:29:21,865 INFO L273 TraceCheckUtils]: 17: Hoare triple {2635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2635#true} is VALID [2018-11-23 12:29:21,865 INFO L273 TraceCheckUtils]: 18: Hoare triple {2635#true} assume !(~i~1 < 100000); {2635#true} is VALID [2018-11-23 12:29:21,866 INFO L256 TraceCheckUtils]: 19: Hoare triple {2635#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {2635#true} is VALID [2018-11-23 12:29:21,866 INFO L273 TraceCheckUtils]: 20: Hoare triple {2635#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2635#true} is VALID [2018-11-23 12:29:21,866 INFO L273 TraceCheckUtils]: 21: Hoare triple {2635#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:29:21,866 INFO L273 TraceCheckUtils]: 22: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:29:21,866 INFO L273 TraceCheckUtils]: 23: Hoare triple {2635#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:29:21,866 INFO L273 TraceCheckUtils]: 24: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:29:21,866 INFO L273 TraceCheckUtils]: 25: Hoare triple {2635#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:29:21,867 INFO L273 TraceCheckUtils]: 26: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:29:21,867 INFO L273 TraceCheckUtils]: 27: Hoare triple {2635#true} assume !(~i~0 < 100000); {2635#true} is VALID [2018-11-23 12:29:21,867 INFO L273 TraceCheckUtils]: 28: Hoare triple {2635#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2635#true} is VALID [2018-11-23 12:29:21,867 INFO L273 TraceCheckUtils]: 29: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:29:21,867 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {2635#true} {2635#true} #70#return; {2635#true} is VALID [2018-11-23 12:29:21,867 INFO L273 TraceCheckUtils]: 31: Hoare triple {2635#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {2635#true} is VALID [2018-11-23 12:29:21,867 INFO L256 TraceCheckUtils]: 32: Hoare triple {2635#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {2635#true} is VALID [2018-11-23 12:29:21,867 INFO L273 TraceCheckUtils]: 33: Hoare triple {2635#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2635#true} is VALID [2018-11-23 12:29:21,868 INFO L273 TraceCheckUtils]: 34: Hoare triple {2635#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:29:21,868 INFO L273 TraceCheckUtils]: 35: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:29:21,868 INFO L273 TraceCheckUtils]: 36: Hoare triple {2635#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:29:21,868 INFO L273 TraceCheckUtils]: 37: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:29:21,868 INFO L273 TraceCheckUtils]: 38: Hoare triple {2635#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:29:21,868 INFO L273 TraceCheckUtils]: 39: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:29:21,868 INFO L273 TraceCheckUtils]: 40: Hoare triple {2635#true} assume !(~i~0 < 100000); {2635#true} is VALID [2018-11-23 12:29:21,868 INFO L273 TraceCheckUtils]: 41: Hoare triple {2635#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2635#true} is VALID [2018-11-23 12:29:21,869 INFO L273 TraceCheckUtils]: 42: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:29:21,869 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {2635#true} {2635#true} #72#return; {2635#true} is VALID [2018-11-23 12:29:21,869 INFO L273 TraceCheckUtils]: 44: Hoare triple {2635#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {2779#(<= main_~i~2 0)} is VALID [2018-11-23 12:29:21,870 INFO L273 TraceCheckUtils]: 45: Hoare triple {2779#(<= main_~i~2 0)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {2779#(<= main_~i~2 0)} is VALID [2018-11-23 12:29:21,870 INFO L273 TraceCheckUtils]: 46: Hoare triple {2779#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {2786#(<= main_~i~2 1)} is VALID [2018-11-23 12:29:21,872 INFO L273 TraceCheckUtils]: 47: Hoare triple {2786#(<= main_~i~2 1)} assume !(~i~2 < 99999); {2636#false} is VALID [2018-11-23 12:29:21,872 INFO L273 TraceCheckUtils]: 48: Hoare triple {2636#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {2636#false} is VALID [2018-11-23 12:29:21,872 INFO L256 TraceCheckUtils]: 49: Hoare triple {2636#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {2636#false} is VALID [2018-11-23 12:29:21,872 INFO L273 TraceCheckUtils]: 50: Hoare triple {2636#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2636#false} is VALID [2018-11-23 12:29:21,872 INFO L273 TraceCheckUtils]: 51: Hoare triple {2636#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2636#false} is VALID [2018-11-23 12:29:21,872 INFO L273 TraceCheckUtils]: 52: Hoare triple {2636#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2636#false} is VALID [2018-11-23 12:29:21,873 INFO L273 TraceCheckUtils]: 53: Hoare triple {2636#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2636#false} is VALID [2018-11-23 12:29:21,873 INFO L273 TraceCheckUtils]: 54: Hoare triple {2636#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2636#false} is VALID [2018-11-23 12:29:21,873 INFO L273 TraceCheckUtils]: 55: Hoare triple {2636#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2636#false} is VALID [2018-11-23 12:29:21,873 INFO L273 TraceCheckUtils]: 56: Hoare triple {2636#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2636#false} is VALID [2018-11-23 12:29:21,873 INFO L273 TraceCheckUtils]: 57: Hoare triple {2636#false} assume !(~i~0 < 100000); {2636#false} is VALID [2018-11-23 12:29:21,873 INFO L273 TraceCheckUtils]: 58: Hoare triple {2636#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2636#false} is VALID [2018-11-23 12:29:21,874 INFO L273 TraceCheckUtils]: 59: Hoare triple {2636#false} assume true; {2636#false} is VALID [2018-11-23 12:29:21,874 INFO L268 TraceCheckUtils]: 60: Hoare quadruple {2636#false} {2636#false} #74#return; {2636#false} is VALID [2018-11-23 12:29:21,874 INFO L273 TraceCheckUtils]: 61: Hoare triple {2636#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {2636#false} is VALID [2018-11-23 12:29:21,874 INFO L273 TraceCheckUtils]: 62: Hoare triple {2636#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {2636#false} is VALID [2018-11-23 12:29:21,874 INFO L273 TraceCheckUtils]: 63: Hoare triple {2636#false} assume !false; {2636#false} is VALID [2018-11-23 12:29:21,877 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 58 proven. 1 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-11-23 12:29:21,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:29:21,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2018-11-23 12:29:21,906 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2018-11-23 12:29:21,906 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:29:21,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:29:22,045 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 12:29:22,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:29:22,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:29:22,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:29:22,046 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 11 states. [2018-11-23 12:29:22,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:22,348 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-11-23 12:29:22,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:29:22,348 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2018-11-23 12:29:22,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:22,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:29:22,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 71 transitions. [2018-11-23 12:29:22,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:29:22,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 71 transitions. [2018-11-23 12:29:22,352 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 71 transitions. [2018-11-23 12:29:22,474 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 12:29:22,476 INFO L225 Difference]: With dead ends: 73 [2018-11-23 12:29:22,476 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 12:29:22,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:29:22,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 12:29:22,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-11-23 12:29:22,502 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:22,502 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 47 states. [2018-11-23 12:29:22,502 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 47 states. [2018-11-23 12:29:22,502 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 47 states. [2018-11-23 12:29:22,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:22,504 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-23 12:29:22,504 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-23 12:29:22,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:22,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:22,505 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 49 states. [2018-11-23 12:29:22,505 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 49 states. [2018-11-23 12:29:22,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:22,506 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-23 12:29:22,507 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-23 12:29:22,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:22,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:22,507 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:22,507 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:22,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:29:22,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-11-23 12:29:22,509 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 64 [2018-11-23 12:29:22,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:22,509 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-11-23 12:29:22,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:29:22,509 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-23 12:29:22,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 12:29:22,510 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:22,510 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 7, 7, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:29:22,511 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:22,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:22,511 INFO L82 PathProgramCache]: Analyzing trace with hash -122717169, now seen corresponding path program 7 times [2018-11-23 12:29:22,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:22,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:22,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:22,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:29:22,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:22,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:22,740 INFO L256 TraceCheckUtils]: 0: Hoare triple {3111#true} call ULTIMATE.init(); {3111#true} is VALID [2018-11-23 12:29:22,741 INFO L273 TraceCheckUtils]: 1: Hoare triple {3111#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3111#true} is VALID [2018-11-23 12:29:22,741 INFO L273 TraceCheckUtils]: 2: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:29:22,742 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3111#true} {3111#true} #66#return; {3111#true} is VALID [2018-11-23 12:29:22,742 INFO L256 TraceCheckUtils]: 4: Hoare triple {3111#true} call #t~ret13 := main(); {3111#true} is VALID [2018-11-23 12:29:22,742 INFO L273 TraceCheckUtils]: 5: Hoare triple {3111#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3113#(= main_~i~1 0)} is VALID [2018-11-23 12:29:22,743 INFO L273 TraceCheckUtils]: 6: Hoare triple {3113#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3113#(= main_~i~1 0)} is VALID [2018-11-23 12:29:22,743 INFO L273 TraceCheckUtils]: 7: Hoare triple {3113#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3114#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:22,744 INFO L273 TraceCheckUtils]: 8: Hoare triple {3114#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3114#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:22,744 INFO L273 TraceCheckUtils]: 9: Hoare triple {3114#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3115#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:22,744 INFO L273 TraceCheckUtils]: 10: Hoare triple {3115#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3115#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:22,745 INFO L273 TraceCheckUtils]: 11: Hoare triple {3115#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3116#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:22,745 INFO L273 TraceCheckUtils]: 12: Hoare triple {3116#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3116#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:22,746 INFO L273 TraceCheckUtils]: 13: Hoare triple {3116#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3117#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:22,747 INFO L273 TraceCheckUtils]: 14: Hoare triple {3117#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3117#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:22,747 INFO L273 TraceCheckUtils]: 15: Hoare triple {3117#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3118#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:22,748 INFO L273 TraceCheckUtils]: 16: Hoare triple {3118#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3118#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:22,749 INFO L273 TraceCheckUtils]: 17: Hoare triple {3118#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3119#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:22,749 INFO L273 TraceCheckUtils]: 18: Hoare triple {3119#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3119#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:22,750 INFO L273 TraceCheckUtils]: 19: Hoare triple {3119#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3120#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:22,751 INFO L273 TraceCheckUtils]: 20: Hoare triple {3120#(<= main_~i~1 7)} assume !(~i~1 < 100000); {3112#false} is VALID [2018-11-23 12:29:22,751 INFO L256 TraceCheckUtils]: 21: Hoare triple {3112#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {3111#true} is VALID [2018-11-23 12:29:22,751 INFO L273 TraceCheckUtils]: 22: Hoare triple {3111#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3111#true} is VALID [2018-11-23 12:29:22,751 INFO L273 TraceCheckUtils]: 23: Hoare triple {3111#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3111#true} is VALID [2018-11-23 12:29:22,752 INFO L273 TraceCheckUtils]: 24: Hoare triple {3111#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3111#true} is VALID [2018-11-23 12:29:22,752 INFO L273 TraceCheckUtils]: 25: Hoare triple {3111#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3111#true} is VALID [2018-11-23 12:29:22,752 INFO L273 TraceCheckUtils]: 26: Hoare triple {3111#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3111#true} is VALID [2018-11-23 12:29:22,752 INFO L273 TraceCheckUtils]: 27: Hoare triple {3111#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3111#true} is VALID [2018-11-23 12:29:22,752 INFO L273 TraceCheckUtils]: 28: Hoare triple {3111#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3111#true} is VALID [2018-11-23 12:29:22,753 INFO L273 TraceCheckUtils]: 29: Hoare triple {3111#true} assume !(~i~0 < 100000); {3111#true} is VALID [2018-11-23 12:29:22,753 INFO L273 TraceCheckUtils]: 30: Hoare triple {3111#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3111#true} is VALID [2018-11-23 12:29:22,753 INFO L273 TraceCheckUtils]: 31: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:29:22,753 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {3111#true} {3112#false} #70#return; {3112#false} is VALID [2018-11-23 12:29:22,753 INFO L273 TraceCheckUtils]: 33: Hoare triple {3112#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {3112#false} is VALID [2018-11-23 12:29:22,753 INFO L256 TraceCheckUtils]: 34: Hoare triple {3112#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {3111#true} is VALID [2018-11-23 12:29:22,754 INFO L273 TraceCheckUtils]: 35: Hoare triple {3111#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3111#true} is VALID [2018-11-23 12:29:22,754 INFO L273 TraceCheckUtils]: 36: Hoare triple {3111#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3111#true} is VALID [2018-11-23 12:29:22,754 INFO L273 TraceCheckUtils]: 37: Hoare triple {3111#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3111#true} is VALID [2018-11-23 12:29:22,754 INFO L273 TraceCheckUtils]: 38: Hoare triple {3111#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3111#true} is VALID [2018-11-23 12:29:22,754 INFO L273 TraceCheckUtils]: 39: Hoare triple {3111#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3111#true} is VALID [2018-11-23 12:29:22,754 INFO L273 TraceCheckUtils]: 40: Hoare triple {3111#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3111#true} is VALID [2018-11-23 12:29:22,755 INFO L273 TraceCheckUtils]: 41: Hoare triple {3111#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3111#true} is VALID [2018-11-23 12:29:22,755 INFO L273 TraceCheckUtils]: 42: Hoare triple {3111#true} assume !(~i~0 < 100000); {3111#true} is VALID [2018-11-23 12:29:22,755 INFO L273 TraceCheckUtils]: 43: Hoare triple {3111#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3111#true} is VALID [2018-11-23 12:29:22,755 INFO L273 TraceCheckUtils]: 44: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:29:22,755 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {3111#true} {3112#false} #72#return; {3112#false} is VALID [2018-11-23 12:29:22,756 INFO L273 TraceCheckUtils]: 46: Hoare triple {3112#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {3112#false} is VALID [2018-11-23 12:29:22,756 INFO L273 TraceCheckUtils]: 47: Hoare triple {3112#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {3112#false} is VALID [2018-11-23 12:29:22,756 INFO L273 TraceCheckUtils]: 48: Hoare triple {3112#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {3112#false} is VALID [2018-11-23 12:29:22,756 INFO L273 TraceCheckUtils]: 49: Hoare triple {3112#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {3112#false} is VALID [2018-11-23 12:29:22,756 INFO L273 TraceCheckUtils]: 50: Hoare triple {3112#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {3112#false} is VALID [2018-11-23 12:29:22,756 INFO L273 TraceCheckUtils]: 51: Hoare triple {3112#false} assume !(~i~2 < 99999); {3112#false} is VALID [2018-11-23 12:29:22,757 INFO L273 TraceCheckUtils]: 52: Hoare triple {3112#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {3112#false} is VALID [2018-11-23 12:29:22,757 INFO L256 TraceCheckUtils]: 53: Hoare triple {3112#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {3111#true} is VALID [2018-11-23 12:29:22,757 INFO L273 TraceCheckUtils]: 54: Hoare triple {3111#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3111#true} is VALID [2018-11-23 12:29:22,757 INFO L273 TraceCheckUtils]: 55: Hoare triple {3111#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3111#true} is VALID [2018-11-23 12:29:22,757 INFO L273 TraceCheckUtils]: 56: Hoare triple {3111#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3111#true} is VALID [2018-11-23 12:29:22,757 INFO L273 TraceCheckUtils]: 57: Hoare triple {3111#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3111#true} is VALID [2018-11-23 12:29:22,758 INFO L273 TraceCheckUtils]: 58: Hoare triple {3111#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3111#true} is VALID [2018-11-23 12:29:22,758 INFO L273 TraceCheckUtils]: 59: Hoare triple {3111#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3111#true} is VALID [2018-11-23 12:29:22,758 INFO L273 TraceCheckUtils]: 60: Hoare triple {3111#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3111#true} is VALID [2018-11-23 12:29:22,758 INFO L273 TraceCheckUtils]: 61: Hoare triple {3111#true} assume !(~i~0 < 100000); {3111#true} is VALID [2018-11-23 12:29:22,758 INFO L273 TraceCheckUtils]: 62: Hoare triple {3111#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3111#true} is VALID [2018-11-23 12:29:22,758 INFO L273 TraceCheckUtils]: 63: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:29:22,759 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {3111#true} {3112#false} #74#return; {3112#false} is VALID [2018-11-23 12:29:22,759 INFO L273 TraceCheckUtils]: 65: Hoare triple {3112#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {3112#false} is VALID [2018-11-23 12:29:22,759 INFO L273 TraceCheckUtils]: 66: Hoare triple {3112#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {3112#false} is VALID [2018-11-23 12:29:22,759 INFO L273 TraceCheckUtils]: 67: Hoare triple {3112#false} assume !false; {3112#false} is VALID [2018-11-23 12:29:22,762 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-11-23 12:29:22,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:29:22,762 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 12:29:22,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:29:22,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:22,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:22,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:29:22,957 INFO L256 TraceCheckUtils]: 0: Hoare triple {3111#true} call ULTIMATE.init(); {3111#true} is VALID [2018-11-23 12:29:22,958 INFO L273 TraceCheckUtils]: 1: Hoare triple {3111#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3111#true} is VALID [2018-11-23 12:29:22,958 INFO L273 TraceCheckUtils]: 2: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:29:22,958 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3111#true} {3111#true} #66#return; {3111#true} is VALID [2018-11-23 12:29:22,958 INFO L256 TraceCheckUtils]: 4: Hoare triple {3111#true} call #t~ret13 := main(); {3111#true} is VALID [2018-11-23 12:29:22,959 INFO L273 TraceCheckUtils]: 5: Hoare triple {3111#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3139#(<= main_~i~1 0)} is VALID [2018-11-23 12:29:22,960 INFO L273 TraceCheckUtils]: 6: Hoare triple {3139#(<= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3139#(<= main_~i~1 0)} is VALID [2018-11-23 12:29:22,961 INFO L273 TraceCheckUtils]: 7: Hoare triple {3139#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3114#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:22,961 INFO L273 TraceCheckUtils]: 8: Hoare triple {3114#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3114#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:22,961 INFO L273 TraceCheckUtils]: 9: Hoare triple {3114#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3115#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:22,962 INFO L273 TraceCheckUtils]: 10: Hoare triple {3115#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3115#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:22,962 INFO L273 TraceCheckUtils]: 11: Hoare triple {3115#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3116#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:22,963 INFO L273 TraceCheckUtils]: 12: Hoare triple {3116#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3116#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:22,963 INFO L273 TraceCheckUtils]: 13: Hoare triple {3116#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3117#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:22,964 INFO L273 TraceCheckUtils]: 14: Hoare triple {3117#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3117#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:22,965 INFO L273 TraceCheckUtils]: 15: Hoare triple {3117#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3118#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:22,965 INFO L273 TraceCheckUtils]: 16: Hoare triple {3118#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3118#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:22,966 INFO L273 TraceCheckUtils]: 17: Hoare triple {3118#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3119#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:22,967 INFO L273 TraceCheckUtils]: 18: Hoare triple {3119#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3119#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:22,967 INFO L273 TraceCheckUtils]: 19: Hoare triple {3119#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3120#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:22,968 INFO L273 TraceCheckUtils]: 20: Hoare triple {3120#(<= main_~i~1 7)} assume !(~i~1 < 100000); {3112#false} is VALID [2018-11-23 12:29:22,968 INFO L256 TraceCheckUtils]: 21: Hoare triple {3112#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {3112#false} is VALID [2018-11-23 12:29:22,969 INFO L273 TraceCheckUtils]: 22: Hoare triple {3112#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3112#false} is VALID [2018-11-23 12:29:22,969 INFO L273 TraceCheckUtils]: 23: Hoare triple {3112#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3112#false} is VALID [2018-11-23 12:29:22,969 INFO L273 TraceCheckUtils]: 24: Hoare triple {3112#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3112#false} is VALID [2018-11-23 12:29:22,969 INFO L273 TraceCheckUtils]: 25: Hoare triple {3112#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3112#false} is VALID [2018-11-23 12:29:22,969 INFO L273 TraceCheckUtils]: 26: Hoare triple {3112#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3112#false} is VALID [2018-11-23 12:29:22,970 INFO L273 TraceCheckUtils]: 27: Hoare triple {3112#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3112#false} is VALID [2018-11-23 12:29:22,970 INFO L273 TraceCheckUtils]: 28: Hoare triple {3112#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3112#false} is VALID [2018-11-23 12:29:22,970 INFO L273 TraceCheckUtils]: 29: Hoare triple {3112#false} assume !(~i~0 < 100000); {3112#false} is VALID [2018-11-23 12:29:22,970 INFO L273 TraceCheckUtils]: 30: Hoare triple {3112#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3112#false} is VALID [2018-11-23 12:29:22,970 INFO L273 TraceCheckUtils]: 31: Hoare triple {3112#false} assume true; {3112#false} is VALID [2018-11-23 12:29:22,971 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {3112#false} {3112#false} #70#return; {3112#false} is VALID [2018-11-23 12:29:22,971 INFO L273 TraceCheckUtils]: 33: Hoare triple {3112#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {3112#false} is VALID [2018-11-23 12:29:22,971 INFO L256 TraceCheckUtils]: 34: Hoare triple {3112#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {3112#false} is VALID [2018-11-23 12:29:22,971 INFO L273 TraceCheckUtils]: 35: Hoare triple {3112#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3112#false} is VALID [2018-11-23 12:29:22,972 INFO L273 TraceCheckUtils]: 36: Hoare triple {3112#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3112#false} is VALID [2018-11-23 12:29:22,972 INFO L273 TraceCheckUtils]: 37: Hoare triple {3112#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3112#false} is VALID [2018-11-23 12:29:22,972 INFO L273 TraceCheckUtils]: 38: Hoare triple {3112#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3112#false} is VALID [2018-11-23 12:29:22,972 INFO L273 TraceCheckUtils]: 39: Hoare triple {3112#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3112#false} is VALID [2018-11-23 12:29:22,972 INFO L273 TraceCheckUtils]: 40: Hoare triple {3112#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3112#false} is VALID [2018-11-23 12:29:22,973 INFO L273 TraceCheckUtils]: 41: Hoare triple {3112#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3112#false} is VALID [2018-11-23 12:29:22,973 INFO L273 TraceCheckUtils]: 42: Hoare triple {3112#false} assume !(~i~0 < 100000); {3112#false} is VALID [2018-11-23 12:29:22,973 INFO L273 TraceCheckUtils]: 43: Hoare triple {3112#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3112#false} is VALID [2018-11-23 12:29:22,973 INFO L273 TraceCheckUtils]: 44: Hoare triple {3112#false} assume true; {3112#false} is VALID [2018-11-23 12:29:22,973 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {3112#false} {3112#false} #72#return; {3112#false} is VALID [2018-11-23 12:29:22,974 INFO L273 TraceCheckUtils]: 46: Hoare triple {3112#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {3112#false} is VALID [2018-11-23 12:29:22,974 INFO L273 TraceCheckUtils]: 47: Hoare triple {3112#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {3112#false} is VALID [2018-11-23 12:29:22,974 INFO L273 TraceCheckUtils]: 48: Hoare triple {3112#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {3112#false} is VALID [2018-11-23 12:29:22,974 INFO L273 TraceCheckUtils]: 49: Hoare triple {3112#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {3112#false} is VALID [2018-11-23 12:29:22,974 INFO L273 TraceCheckUtils]: 50: Hoare triple {3112#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {3112#false} is VALID [2018-11-23 12:29:22,974 INFO L273 TraceCheckUtils]: 51: Hoare triple {3112#false} assume !(~i~2 < 99999); {3112#false} is VALID [2018-11-23 12:29:22,974 INFO L273 TraceCheckUtils]: 52: Hoare triple {3112#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {3112#false} is VALID [2018-11-23 12:29:22,974 INFO L256 TraceCheckUtils]: 53: Hoare triple {3112#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {3112#false} is VALID [2018-11-23 12:29:22,975 INFO L273 TraceCheckUtils]: 54: Hoare triple {3112#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3112#false} is VALID [2018-11-23 12:29:22,975 INFO L273 TraceCheckUtils]: 55: Hoare triple {3112#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3112#false} is VALID [2018-11-23 12:29:22,975 INFO L273 TraceCheckUtils]: 56: Hoare triple {3112#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3112#false} is VALID [2018-11-23 12:29:22,975 INFO L273 TraceCheckUtils]: 57: Hoare triple {3112#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3112#false} is VALID [2018-11-23 12:29:22,975 INFO L273 TraceCheckUtils]: 58: Hoare triple {3112#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3112#false} is VALID [2018-11-23 12:29:22,975 INFO L273 TraceCheckUtils]: 59: Hoare triple {3112#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3112#false} is VALID [2018-11-23 12:29:22,975 INFO L273 TraceCheckUtils]: 60: Hoare triple {3112#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3112#false} is VALID [2018-11-23 12:29:22,975 INFO L273 TraceCheckUtils]: 61: Hoare triple {3112#false} assume !(~i~0 < 100000); {3112#false} is VALID [2018-11-23 12:29:22,975 INFO L273 TraceCheckUtils]: 62: Hoare triple {3112#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3112#false} is VALID [2018-11-23 12:29:22,976 INFO L273 TraceCheckUtils]: 63: Hoare triple {3112#false} assume true; {3112#false} is VALID [2018-11-23 12:29:22,976 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {3112#false} {3112#false} #74#return; {3112#false} is VALID [2018-11-23 12:29:22,976 INFO L273 TraceCheckUtils]: 65: Hoare triple {3112#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {3112#false} is VALID [2018-11-23 12:29:22,976 INFO L273 TraceCheckUtils]: 66: Hoare triple {3112#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {3112#false} is VALID [2018-11-23 12:29:22,976 INFO L273 TraceCheckUtils]: 67: Hoare triple {3112#false} assume !false; {3112#false} is VALID [2018-11-23 12:29:22,978 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-11-23 12:29:22,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:29:22,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 12:29:22,999 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-11-23 12:29:23,000 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:29:23,001 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:29:23,063 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 12:29:23,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:29:23,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:29:23,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:29:23,064 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 11 states. [2018-11-23 12:29:23,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:23,308 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2018-11-23 12:29:23,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:29:23,308 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-11-23 12:29:23,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:23,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:29:23,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 68 transitions. [2018-11-23 12:29:23,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:29:23,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 68 transitions. [2018-11-23 12:29:23,310 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 68 transitions. [2018-11-23 12:29:23,375 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 12:29:23,377 INFO L225 Difference]: With dead ends: 76 [2018-11-23 12:29:23,377 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 12:29:23,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:29:23,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 12:29:23,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-11-23 12:29:23,405 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:23,405 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 49 states. [2018-11-23 12:29:23,405 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 49 states. [2018-11-23 12:29:23,405 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 49 states. [2018-11-23 12:29:23,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:23,407 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-11-23 12:29:23,407 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-23 12:29:23,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:23,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:23,407 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 50 states. [2018-11-23 12:29:23,407 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 50 states. [2018-11-23 12:29:23,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:23,409 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-11-23 12:29:23,409 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-23 12:29:23,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:23,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:23,410 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:23,410 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:23,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:29:23,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-11-23 12:29:23,411 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 68 [2018-11-23 12:29:23,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:23,412 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-11-23 12:29:23,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:29:23,412 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-23 12:29:23,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 12:29:23,413 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:23,413 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:29:23,413 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:23,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:23,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1588760433, now seen corresponding path program 8 times [2018-11-23 12:29:23,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:23,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:23,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:23,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:29:23,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:23,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:24,362 INFO L256 TraceCheckUtils]: 0: Hoare triple {3609#true} call ULTIMATE.init(); {3609#true} is VALID [2018-11-23 12:29:24,362 INFO L273 TraceCheckUtils]: 1: Hoare triple {3609#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3609#true} is VALID [2018-11-23 12:29:24,362 INFO L273 TraceCheckUtils]: 2: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:29:24,363 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3609#true} {3609#true} #66#return; {3609#true} is VALID [2018-11-23 12:29:24,363 INFO L256 TraceCheckUtils]: 4: Hoare triple {3609#true} call #t~ret13 := main(); {3609#true} is VALID [2018-11-23 12:29:24,364 INFO L273 TraceCheckUtils]: 5: Hoare triple {3609#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3611#(= main_~i~1 0)} is VALID [2018-11-23 12:29:24,364 INFO L273 TraceCheckUtils]: 6: Hoare triple {3611#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3611#(= main_~i~1 0)} is VALID [2018-11-23 12:29:24,365 INFO L273 TraceCheckUtils]: 7: Hoare triple {3611#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3612#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:24,365 INFO L273 TraceCheckUtils]: 8: Hoare triple {3612#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3612#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:24,365 INFO L273 TraceCheckUtils]: 9: Hoare triple {3612#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3613#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:24,366 INFO L273 TraceCheckUtils]: 10: Hoare triple {3613#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3613#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:24,366 INFO L273 TraceCheckUtils]: 11: Hoare triple {3613#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3614#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:24,367 INFO L273 TraceCheckUtils]: 12: Hoare triple {3614#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3614#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:24,367 INFO L273 TraceCheckUtils]: 13: Hoare triple {3614#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3615#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:24,368 INFO L273 TraceCheckUtils]: 14: Hoare triple {3615#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3615#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:24,368 INFO L273 TraceCheckUtils]: 15: Hoare triple {3615#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3616#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:24,369 INFO L273 TraceCheckUtils]: 16: Hoare triple {3616#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3616#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:24,370 INFO L273 TraceCheckUtils]: 17: Hoare triple {3616#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3617#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:24,370 INFO L273 TraceCheckUtils]: 18: Hoare triple {3617#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3617#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:24,371 INFO L273 TraceCheckUtils]: 19: Hoare triple {3617#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3618#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:24,372 INFO L273 TraceCheckUtils]: 20: Hoare triple {3618#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3618#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:24,372 INFO L273 TraceCheckUtils]: 21: Hoare triple {3618#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3619#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:24,373 INFO L273 TraceCheckUtils]: 22: Hoare triple {3619#(<= main_~i~1 8)} assume !(~i~1 < 100000); {3610#false} is VALID [2018-11-23 12:29:24,373 INFO L256 TraceCheckUtils]: 23: Hoare triple {3610#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {3609#true} is VALID [2018-11-23 12:29:24,374 INFO L273 TraceCheckUtils]: 24: Hoare triple {3609#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3609#true} is VALID [2018-11-23 12:29:24,374 INFO L273 TraceCheckUtils]: 25: Hoare triple {3609#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3609#true} is VALID [2018-11-23 12:29:24,374 INFO L273 TraceCheckUtils]: 26: Hoare triple {3609#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3609#true} is VALID [2018-11-23 12:29:24,374 INFO L273 TraceCheckUtils]: 27: Hoare triple {3609#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3609#true} is VALID [2018-11-23 12:29:24,374 INFO L273 TraceCheckUtils]: 28: Hoare triple {3609#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3609#true} is VALID [2018-11-23 12:29:24,375 INFO L273 TraceCheckUtils]: 29: Hoare triple {3609#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3609#true} is VALID [2018-11-23 12:29:24,375 INFO L273 TraceCheckUtils]: 30: Hoare triple {3609#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3609#true} is VALID [2018-11-23 12:29:24,375 INFO L273 TraceCheckUtils]: 31: Hoare triple {3609#true} assume !(~i~0 < 100000); {3609#true} is VALID [2018-11-23 12:29:24,375 INFO L273 TraceCheckUtils]: 32: Hoare triple {3609#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3609#true} is VALID [2018-11-23 12:29:24,375 INFO L273 TraceCheckUtils]: 33: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:29:24,376 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {3609#true} {3610#false} #70#return; {3610#false} is VALID [2018-11-23 12:29:24,376 INFO L273 TraceCheckUtils]: 35: Hoare triple {3610#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {3610#false} is VALID [2018-11-23 12:29:24,376 INFO L256 TraceCheckUtils]: 36: Hoare triple {3610#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {3609#true} is VALID [2018-11-23 12:29:24,376 INFO L273 TraceCheckUtils]: 37: Hoare triple {3609#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3609#true} is VALID [2018-11-23 12:29:24,376 INFO L273 TraceCheckUtils]: 38: Hoare triple {3609#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3609#true} is VALID [2018-11-23 12:29:24,377 INFO L273 TraceCheckUtils]: 39: Hoare triple {3609#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3609#true} is VALID [2018-11-23 12:29:24,377 INFO L273 TraceCheckUtils]: 40: Hoare triple {3609#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3609#true} is VALID [2018-11-23 12:29:24,377 INFO L273 TraceCheckUtils]: 41: Hoare triple {3609#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3609#true} is VALID [2018-11-23 12:29:24,377 INFO L273 TraceCheckUtils]: 42: Hoare triple {3609#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3609#true} is VALID [2018-11-23 12:29:24,377 INFO L273 TraceCheckUtils]: 43: Hoare triple {3609#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3609#true} is VALID [2018-11-23 12:29:24,378 INFO L273 TraceCheckUtils]: 44: Hoare triple {3609#true} assume !(~i~0 < 100000); {3609#true} is VALID [2018-11-23 12:29:24,378 INFO L273 TraceCheckUtils]: 45: Hoare triple {3609#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3609#true} is VALID [2018-11-23 12:29:24,378 INFO L273 TraceCheckUtils]: 46: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:29:24,378 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {3609#true} {3610#false} #72#return; {3610#false} is VALID [2018-11-23 12:29:24,379 INFO L273 TraceCheckUtils]: 48: Hoare triple {3610#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {3610#false} is VALID [2018-11-23 12:29:24,379 INFO L273 TraceCheckUtils]: 49: Hoare triple {3610#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {3610#false} is VALID [2018-11-23 12:29:24,379 INFO L273 TraceCheckUtils]: 50: Hoare triple {3610#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {3610#false} is VALID [2018-11-23 12:29:24,379 INFO L273 TraceCheckUtils]: 51: Hoare triple {3610#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {3610#false} is VALID [2018-11-23 12:29:24,379 INFO L273 TraceCheckUtils]: 52: Hoare triple {3610#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {3610#false} is VALID [2018-11-23 12:29:24,379 INFO L273 TraceCheckUtils]: 53: Hoare triple {3610#false} assume !(~i~2 < 99999); {3610#false} is VALID [2018-11-23 12:29:24,380 INFO L273 TraceCheckUtils]: 54: Hoare triple {3610#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {3610#false} is VALID [2018-11-23 12:29:24,380 INFO L256 TraceCheckUtils]: 55: Hoare triple {3610#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {3609#true} is VALID [2018-11-23 12:29:24,380 INFO L273 TraceCheckUtils]: 56: Hoare triple {3609#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3609#true} is VALID [2018-11-23 12:29:24,380 INFO L273 TraceCheckUtils]: 57: Hoare triple {3609#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3609#true} is VALID [2018-11-23 12:29:24,380 INFO L273 TraceCheckUtils]: 58: Hoare triple {3609#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3609#true} is VALID [2018-11-23 12:29:24,380 INFO L273 TraceCheckUtils]: 59: Hoare triple {3609#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3609#true} is VALID [2018-11-23 12:29:24,380 INFO L273 TraceCheckUtils]: 60: Hoare triple {3609#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3609#true} is VALID [2018-11-23 12:29:24,381 INFO L273 TraceCheckUtils]: 61: Hoare triple {3609#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3609#true} is VALID [2018-11-23 12:29:24,381 INFO L273 TraceCheckUtils]: 62: Hoare triple {3609#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3609#true} is VALID [2018-11-23 12:29:24,381 INFO L273 TraceCheckUtils]: 63: Hoare triple {3609#true} assume !(~i~0 < 100000); {3609#true} is VALID [2018-11-23 12:29:24,381 INFO L273 TraceCheckUtils]: 64: Hoare triple {3609#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3609#true} is VALID [2018-11-23 12:29:24,381 INFO L273 TraceCheckUtils]: 65: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:29:24,381 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {3609#true} {3610#false} #74#return; {3610#false} is VALID [2018-11-23 12:29:24,381 INFO L273 TraceCheckUtils]: 67: Hoare triple {3610#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {3610#false} is VALID [2018-11-23 12:29:24,382 INFO L273 TraceCheckUtils]: 68: Hoare triple {3610#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {3610#false} is VALID [2018-11-23 12:29:24,382 INFO L273 TraceCheckUtils]: 69: Hoare triple {3610#false} assume !false; {3610#false} is VALID [2018-11-23 12:29:24,386 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-11-23 12:29:24,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:29:24,386 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 12:29:24,396 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:29:24,459 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:29:24,459 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:29:24,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:24,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:29:24,606 INFO L256 TraceCheckUtils]: 0: Hoare triple {3609#true} call ULTIMATE.init(); {3609#true} is VALID [2018-11-23 12:29:24,607 INFO L273 TraceCheckUtils]: 1: Hoare triple {3609#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3609#true} is VALID [2018-11-23 12:29:24,607 INFO L273 TraceCheckUtils]: 2: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:29:24,607 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3609#true} {3609#true} #66#return; {3609#true} is VALID [2018-11-23 12:29:24,607 INFO L256 TraceCheckUtils]: 4: Hoare triple {3609#true} call #t~ret13 := main(); {3609#true} is VALID [2018-11-23 12:29:24,608 INFO L273 TraceCheckUtils]: 5: Hoare triple {3609#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3638#(<= main_~i~1 0)} is VALID [2018-11-23 12:29:24,609 INFO L273 TraceCheckUtils]: 6: Hoare triple {3638#(<= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3638#(<= main_~i~1 0)} is VALID [2018-11-23 12:29:24,609 INFO L273 TraceCheckUtils]: 7: Hoare triple {3638#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3612#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:24,610 INFO L273 TraceCheckUtils]: 8: Hoare triple {3612#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3612#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:24,610 INFO L273 TraceCheckUtils]: 9: Hoare triple {3612#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3613#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:24,610 INFO L273 TraceCheckUtils]: 10: Hoare triple {3613#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3613#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:24,611 INFO L273 TraceCheckUtils]: 11: Hoare triple {3613#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3614#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:24,612 INFO L273 TraceCheckUtils]: 12: Hoare triple {3614#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3614#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:24,612 INFO L273 TraceCheckUtils]: 13: Hoare triple {3614#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3615#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:24,613 INFO L273 TraceCheckUtils]: 14: Hoare triple {3615#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3615#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:24,614 INFO L273 TraceCheckUtils]: 15: Hoare triple {3615#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3616#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:24,614 INFO L273 TraceCheckUtils]: 16: Hoare triple {3616#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3616#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:24,615 INFO L273 TraceCheckUtils]: 17: Hoare triple {3616#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3617#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:24,616 INFO L273 TraceCheckUtils]: 18: Hoare triple {3617#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3617#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:24,616 INFO L273 TraceCheckUtils]: 19: Hoare triple {3617#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3618#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:24,617 INFO L273 TraceCheckUtils]: 20: Hoare triple {3618#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3618#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:24,618 INFO L273 TraceCheckUtils]: 21: Hoare triple {3618#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3619#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:24,619 INFO L273 TraceCheckUtils]: 22: Hoare triple {3619#(<= main_~i~1 8)} assume !(~i~1 < 100000); {3610#false} is VALID [2018-11-23 12:29:24,619 INFO L256 TraceCheckUtils]: 23: Hoare triple {3610#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {3610#false} is VALID [2018-11-23 12:29:24,619 INFO L273 TraceCheckUtils]: 24: Hoare triple {3610#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3610#false} is VALID [2018-11-23 12:29:24,619 INFO L273 TraceCheckUtils]: 25: Hoare triple {3610#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3610#false} is VALID [2018-11-23 12:29:24,619 INFO L273 TraceCheckUtils]: 26: Hoare triple {3610#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3610#false} is VALID [2018-11-23 12:29:24,620 INFO L273 TraceCheckUtils]: 27: Hoare triple {3610#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3610#false} is VALID [2018-11-23 12:29:24,620 INFO L273 TraceCheckUtils]: 28: Hoare triple {3610#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3610#false} is VALID [2018-11-23 12:29:24,620 INFO L273 TraceCheckUtils]: 29: Hoare triple {3610#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3610#false} is VALID [2018-11-23 12:29:24,620 INFO L273 TraceCheckUtils]: 30: Hoare triple {3610#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3610#false} is VALID [2018-11-23 12:29:24,620 INFO L273 TraceCheckUtils]: 31: Hoare triple {3610#false} assume !(~i~0 < 100000); {3610#false} is VALID [2018-11-23 12:29:24,621 INFO L273 TraceCheckUtils]: 32: Hoare triple {3610#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3610#false} is VALID [2018-11-23 12:29:24,621 INFO L273 TraceCheckUtils]: 33: Hoare triple {3610#false} assume true; {3610#false} is VALID [2018-11-23 12:29:24,621 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {3610#false} {3610#false} #70#return; {3610#false} is VALID [2018-11-23 12:29:24,621 INFO L273 TraceCheckUtils]: 35: Hoare triple {3610#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {3610#false} is VALID [2018-11-23 12:29:24,621 INFO L256 TraceCheckUtils]: 36: Hoare triple {3610#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {3610#false} is VALID [2018-11-23 12:29:24,622 INFO L273 TraceCheckUtils]: 37: Hoare triple {3610#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3610#false} is VALID [2018-11-23 12:29:24,622 INFO L273 TraceCheckUtils]: 38: Hoare triple {3610#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3610#false} is VALID [2018-11-23 12:29:24,622 INFO L273 TraceCheckUtils]: 39: Hoare triple {3610#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3610#false} is VALID [2018-11-23 12:29:24,622 INFO L273 TraceCheckUtils]: 40: Hoare triple {3610#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3610#false} is VALID [2018-11-23 12:29:24,622 INFO L273 TraceCheckUtils]: 41: Hoare triple {3610#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3610#false} is VALID [2018-11-23 12:29:24,622 INFO L273 TraceCheckUtils]: 42: Hoare triple {3610#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3610#false} is VALID [2018-11-23 12:29:24,622 INFO L273 TraceCheckUtils]: 43: Hoare triple {3610#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3610#false} is VALID [2018-11-23 12:29:24,622 INFO L273 TraceCheckUtils]: 44: Hoare triple {3610#false} assume !(~i~0 < 100000); {3610#false} is VALID [2018-11-23 12:29:24,623 INFO L273 TraceCheckUtils]: 45: Hoare triple {3610#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3610#false} is VALID [2018-11-23 12:29:24,623 INFO L273 TraceCheckUtils]: 46: Hoare triple {3610#false} assume true; {3610#false} is VALID [2018-11-23 12:29:24,623 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {3610#false} {3610#false} #72#return; {3610#false} is VALID [2018-11-23 12:29:24,623 INFO L273 TraceCheckUtils]: 48: Hoare triple {3610#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {3610#false} is VALID [2018-11-23 12:29:24,623 INFO L273 TraceCheckUtils]: 49: Hoare triple {3610#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {3610#false} is VALID [2018-11-23 12:29:24,623 INFO L273 TraceCheckUtils]: 50: Hoare triple {3610#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {3610#false} is VALID [2018-11-23 12:29:24,623 INFO L273 TraceCheckUtils]: 51: Hoare triple {3610#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {3610#false} is VALID [2018-11-23 12:29:24,623 INFO L273 TraceCheckUtils]: 52: Hoare triple {3610#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {3610#false} is VALID [2018-11-23 12:29:24,624 INFO L273 TraceCheckUtils]: 53: Hoare triple {3610#false} assume !(~i~2 < 99999); {3610#false} is VALID [2018-11-23 12:29:24,624 INFO L273 TraceCheckUtils]: 54: Hoare triple {3610#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {3610#false} is VALID [2018-11-23 12:29:24,624 INFO L256 TraceCheckUtils]: 55: Hoare triple {3610#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {3610#false} is VALID [2018-11-23 12:29:24,624 INFO L273 TraceCheckUtils]: 56: Hoare triple {3610#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3610#false} is VALID [2018-11-23 12:29:24,624 INFO L273 TraceCheckUtils]: 57: Hoare triple {3610#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3610#false} is VALID [2018-11-23 12:29:24,624 INFO L273 TraceCheckUtils]: 58: Hoare triple {3610#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3610#false} is VALID [2018-11-23 12:29:24,624 INFO L273 TraceCheckUtils]: 59: Hoare triple {3610#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3610#false} is VALID [2018-11-23 12:29:24,624 INFO L273 TraceCheckUtils]: 60: Hoare triple {3610#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3610#false} is VALID [2018-11-23 12:29:24,625 INFO L273 TraceCheckUtils]: 61: Hoare triple {3610#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3610#false} is VALID [2018-11-23 12:29:24,625 INFO L273 TraceCheckUtils]: 62: Hoare triple {3610#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3610#false} is VALID [2018-11-23 12:29:24,625 INFO L273 TraceCheckUtils]: 63: Hoare triple {3610#false} assume !(~i~0 < 100000); {3610#false} is VALID [2018-11-23 12:29:24,625 INFO L273 TraceCheckUtils]: 64: Hoare triple {3610#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3610#false} is VALID [2018-11-23 12:29:24,625 INFO L273 TraceCheckUtils]: 65: Hoare triple {3610#false} assume true; {3610#false} is VALID [2018-11-23 12:29:24,625 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {3610#false} {3610#false} #74#return; {3610#false} is VALID [2018-11-23 12:29:24,625 INFO L273 TraceCheckUtils]: 67: Hoare triple {3610#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {3610#false} is VALID [2018-11-23 12:29:24,625 INFO L273 TraceCheckUtils]: 68: Hoare triple {3610#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {3610#false} is VALID [2018-11-23 12:29:24,626 INFO L273 TraceCheckUtils]: 69: Hoare triple {3610#false} assume !false; {3610#false} is VALID [2018-11-23 12:29:24,628 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-11-23 12:29:24,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:29:24,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 12:29:24,648 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-11-23 12:29:24,649 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:29:24,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:29:24,708 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 12:29:24,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:29:24,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:29:24,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:29:24,710 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 12 states. [2018-11-23 12:29:24,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:24,920 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2018-11-23 12:29:24,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:29:24,920 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-11-23 12:29:24,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:24,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:29:24,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2018-11-23 12:29:24,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:29:24,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2018-11-23 12:29:24,923 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 70 transitions. [2018-11-23 12:29:25,020 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 12:29:25,022 INFO L225 Difference]: With dead ends: 78 [2018-11-23 12:29:25,022 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 12:29:25,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:29:25,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 12:29:25,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-11-23 12:29:25,046 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:25,046 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 51 states. [2018-11-23 12:29:25,046 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 51 states. [2018-11-23 12:29:25,046 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 51 states. [2018-11-23 12:29:25,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:25,048 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-11-23 12:29:25,048 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-23 12:29:25,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:25,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:25,049 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 52 states. [2018-11-23 12:29:25,049 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 52 states. [2018-11-23 12:29:25,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:25,051 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-11-23 12:29:25,051 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-23 12:29:25,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:25,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:25,051 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:25,052 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:25,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:29:25,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-11-23 12:29:25,053 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 70 [2018-11-23 12:29:25,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:25,054 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-11-23 12:29:25,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:29:25,054 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-23 12:29:25,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-23 12:29:25,055 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:25,055 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:29:25,055 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:25,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:25,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1346261587, now seen corresponding path program 9 times [2018-11-23 12:29:25,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:25,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:25,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:25,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:29:25,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:25,330 INFO L256 TraceCheckUtils]: 0: Hoare triple {4124#true} call ULTIMATE.init(); {4124#true} is VALID [2018-11-23 12:29:25,330 INFO L273 TraceCheckUtils]: 1: Hoare triple {4124#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4124#true} is VALID [2018-11-23 12:29:25,330 INFO L273 TraceCheckUtils]: 2: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:29:25,331 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4124#true} {4124#true} #66#return; {4124#true} is VALID [2018-11-23 12:29:25,331 INFO L256 TraceCheckUtils]: 4: Hoare triple {4124#true} call #t~ret13 := main(); {4124#true} is VALID [2018-11-23 12:29:25,332 INFO L273 TraceCheckUtils]: 5: Hoare triple {4124#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {4126#(= main_~i~1 0)} is VALID [2018-11-23 12:29:25,332 INFO L273 TraceCheckUtils]: 6: Hoare triple {4126#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4126#(= main_~i~1 0)} is VALID [2018-11-23 12:29:25,333 INFO L273 TraceCheckUtils]: 7: Hoare triple {4126#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4127#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:25,333 INFO L273 TraceCheckUtils]: 8: Hoare triple {4127#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4127#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:25,334 INFO L273 TraceCheckUtils]: 9: Hoare triple {4127#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4128#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:25,335 INFO L273 TraceCheckUtils]: 10: Hoare triple {4128#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4128#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:25,336 INFO L273 TraceCheckUtils]: 11: Hoare triple {4128#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4129#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:25,336 INFO L273 TraceCheckUtils]: 12: Hoare triple {4129#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4129#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:25,337 INFO L273 TraceCheckUtils]: 13: Hoare triple {4129#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4130#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:25,338 INFO L273 TraceCheckUtils]: 14: Hoare triple {4130#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4130#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:25,338 INFO L273 TraceCheckUtils]: 15: Hoare triple {4130#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4131#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:25,339 INFO L273 TraceCheckUtils]: 16: Hoare triple {4131#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4131#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:25,340 INFO L273 TraceCheckUtils]: 17: Hoare triple {4131#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4132#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:25,340 INFO L273 TraceCheckUtils]: 18: Hoare triple {4132#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4132#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:25,341 INFO L273 TraceCheckUtils]: 19: Hoare triple {4132#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4133#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:25,342 INFO L273 TraceCheckUtils]: 20: Hoare triple {4133#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4133#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:25,342 INFO L273 TraceCheckUtils]: 21: Hoare triple {4133#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4134#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:25,343 INFO L273 TraceCheckUtils]: 22: Hoare triple {4134#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4134#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:25,344 INFO L273 TraceCheckUtils]: 23: Hoare triple {4134#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4135#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:25,344 INFO L273 TraceCheckUtils]: 24: Hoare triple {4135#(<= main_~i~1 9)} assume !(~i~1 < 100000); {4125#false} is VALID [2018-11-23 12:29:25,345 INFO L256 TraceCheckUtils]: 25: Hoare triple {4125#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {4124#true} is VALID [2018-11-23 12:29:25,345 INFO L273 TraceCheckUtils]: 26: Hoare triple {4124#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4124#true} is VALID [2018-11-23 12:29:25,345 INFO L273 TraceCheckUtils]: 27: Hoare triple {4124#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:29:25,345 INFO L273 TraceCheckUtils]: 28: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:29:25,346 INFO L273 TraceCheckUtils]: 29: Hoare triple {4124#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:29:25,346 INFO L273 TraceCheckUtils]: 30: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:29:25,346 INFO L273 TraceCheckUtils]: 31: Hoare triple {4124#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:29:25,346 INFO L273 TraceCheckUtils]: 32: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:29:25,346 INFO L273 TraceCheckUtils]: 33: Hoare triple {4124#true} assume !(~i~0 < 100000); {4124#true} is VALID [2018-11-23 12:29:25,347 INFO L273 TraceCheckUtils]: 34: Hoare triple {4124#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4124#true} is VALID [2018-11-23 12:29:25,347 INFO L273 TraceCheckUtils]: 35: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:29:25,347 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {4124#true} {4125#false} #70#return; {4125#false} is VALID [2018-11-23 12:29:25,347 INFO L273 TraceCheckUtils]: 37: Hoare triple {4125#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {4125#false} is VALID [2018-11-23 12:29:25,347 INFO L256 TraceCheckUtils]: 38: Hoare triple {4125#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {4124#true} is VALID [2018-11-23 12:29:25,348 INFO L273 TraceCheckUtils]: 39: Hoare triple {4124#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4124#true} is VALID [2018-11-23 12:29:25,348 INFO L273 TraceCheckUtils]: 40: Hoare triple {4124#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:29:25,348 INFO L273 TraceCheckUtils]: 41: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:29:25,348 INFO L273 TraceCheckUtils]: 42: Hoare triple {4124#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:29:25,348 INFO L273 TraceCheckUtils]: 43: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:29:25,348 INFO L273 TraceCheckUtils]: 44: Hoare triple {4124#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:29:25,349 INFO L273 TraceCheckUtils]: 45: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:29:25,349 INFO L273 TraceCheckUtils]: 46: Hoare triple {4124#true} assume !(~i~0 < 100000); {4124#true} is VALID [2018-11-23 12:29:25,349 INFO L273 TraceCheckUtils]: 47: Hoare triple {4124#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4124#true} is VALID [2018-11-23 12:29:25,349 INFO L273 TraceCheckUtils]: 48: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:29:25,349 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {4124#true} {4125#false} #72#return; {4125#false} is VALID [2018-11-23 12:29:25,349 INFO L273 TraceCheckUtils]: 50: Hoare triple {4125#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {4125#false} is VALID [2018-11-23 12:29:25,349 INFO L273 TraceCheckUtils]: 51: Hoare triple {4125#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {4125#false} is VALID [2018-11-23 12:29:25,349 INFO L273 TraceCheckUtils]: 52: Hoare triple {4125#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {4125#false} is VALID [2018-11-23 12:29:25,349 INFO L273 TraceCheckUtils]: 53: Hoare triple {4125#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {4125#false} is VALID [2018-11-23 12:29:25,350 INFO L273 TraceCheckUtils]: 54: Hoare triple {4125#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {4125#false} is VALID [2018-11-23 12:29:25,350 INFO L273 TraceCheckUtils]: 55: Hoare triple {4125#false} assume !(~i~2 < 99999); {4125#false} is VALID [2018-11-23 12:29:25,350 INFO L273 TraceCheckUtils]: 56: Hoare triple {4125#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {4125#false} is VALID [2018-11-23 12:29:25,350 INFO L256 TraceCheckUtils]: 57: Hoare triple {4125#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {4124#true} is VALID [2018-11-23 12:29:25,350 INFO L273 TraceCheckUtils]: 58: Hoare triple {4124#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4124#true} is VALID [2018-11-23 12:29:25,350 INFO L273 TraceCheckUtils]: 59: Hoare triple {4124#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:29:25,350 INFO L273 TraceCheckUtils]: 60: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:29:25,350 INFO L273 TraceCheckUtils]: 61: Hoare triple {4124#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:29:25,351 INFO L273 TraceCheckUtils]: 62: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:29:25,351 INFO L273 TraceCheckUtils]: 63: Hoare triple {4124#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:29:25,351 INFO L273 TraceCheckUtils]: 64: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:29:25,351 INFO L273 TraceCheckUtils]: 65: Hoare triple {4124#true} assume !(~i~0 < 100000); {4124#true} is VALID [2018-11-23 12:29:25,351 INFO L273 TraceCheckUtils]: 66: Hoare triple {4124#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4124#true} is VALID [2018-11-23 12:29:25,351 INFO L273 TraceCheckUtils]: 67: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:29:25,352 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {4124#true} {4125#false} #74#return; {4125#false} is VALID [2018-11-23 12:29:25,352 INFO L273 TraceCheckUtils]: 69: Hoare triple {4125#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {4125#false} is VALID [2018-11-23 12:29:25,352 INFO L273 TraceCheckUtils]: 70: Hoare triple {4125#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {4125#false} is VALID [2018-11-23 12:29:25,352 INFO L273 TraceCheckUtils]: 71: Hoare triple {4125#false} assume !false; {4125#false} is VALID [2018-11-23 12:29:25,356 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-11-23 12:29:25,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:29:25,357 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 12:29:25,368 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:29:25,422 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 12:29:25,422 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:29:25,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:25,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:29:25,795 INFO L256 TraceCheckUtils]: 0: Hoare triple {4124#true} call ULTIMATE.init(); {4124#true} is VALID [2018-11-23 12:29:25,795 INFO L273 TraceCheckUtils]: 1: Hoare triple {4124#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4124#true} is VALID [2018-11-23 12:29:25,795 INFO L273 TraceCheckUtils]: 2: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:29:25,795 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4124#true} {4124#true} #66#return; {4124#true} is VALID [2018-11-23 12:29:25,796 INFO L256 TraceCheckUtils]: 4: Hoare triple {4124#true} call #t~ret13 := main(); {4124#true} is VALID [2018-11-23 12:29:25,796 INFO L273 TraceCheckUtils]: 5: Hoare triple {4124#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {4124#true} is VALID [2018-11-23 12:29:25,796 INFO L273 TraceCheckUtils]: 6: Hoare triple {4124#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4124#true} is VALID [2018-11-23 12:29:25,796 INFO L273 TraceCheckUtils]: 7: Hoare triple {4124#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4124#true} is VALID [2018-11-23 12:29:25,796 INFO L273 TraceCheckUtils]: 8: Hoare triple {4124#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4124#true} is VALID [2018-11-23 12:29:25,796 INFO L273 TraceCheckUtils]: 9: Hoare triple {4124#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4124#true} is VALID [2018-11-23 12:29:25,797 INFO L273 TraceCheckUtils]: 10: Hoare triple {4124#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4124#true} is VALID [2018-11-23 12:29:25,797 INFO L273 TraceCheckUtils]: 11: Hoare triple {4124#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4124#true} is VALID [2018-11-23 12:29:25,797 INFO L273 TraceCheckUtils]: 12: Hoare triple {4124#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4124#true} is VALID [2018-11-23 12:29:25,797 INFO L273 TraceCheckUtils]: 13: Hoare triple {4124#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4124#true} is VALID [2018-11-23 12:29:25,797 INFO L273 TraceCheckUtils]: 14: Hoare triple {4124#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4124#true} is VALID [2018-11-23 12:29:25,797 INFO L273 TraceCheckUtils]: 15: Hoare triple {4124#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4124#true} is VALID [2018-11-23 12:29:25,797 INFO L273 TraceCheckUtils]: 16: Hoare triple {4124#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4124#true} is VALID [2018-11-23 12:29:25,798 INFO L273 TraceCheckUtils]: 17: Hoare triple {4124#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4124#true} is VALID [2018-11-23 12:29:25,798 INFO L273 TraceCheckUtils]: 18: Hoare triple {4124#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4124#true} is VALID [2018-11-23 12:29:25,798 INFO L273 TraceCheckUtils]: 19: Hoare triple {4124#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4124#true} is VALID [2018-11-23 12:29:25,798 INFO L273 TraceCheckUtils]: 20: Hoare triple {4124#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4124#true} is VALID [2018-11-23 12:29:25,798 INFO L273 TraceCheckUtils]: 21: Hoare triple {4124#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4124#true} is VALID [2018-11-23 12:29:25,798 INFO L273 TraceCheckUtils]: 22: Hoare triple {4124#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4124#true} is VALID [2018-11-23 12:29:25,799 INFO L273 TraceCheckUtils]: 23: Hoare triple {4124#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4124#true} is VALID [2018-11-23 12:29:25,799 INFO L273 TraceCheckUtils]: 24: Hoare triple {4124#true} assume !(~i~1 < 100000); {4124#true} is VALID [2018-11-23 12:29:25,799 INFO L256 TraceCheckUtils]: 25: Hoare triple {4124#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {4124#true} is VALID [2018-11-23 12:29:25,799 INFO L273 TraceCheckUtils]: 26: Hoare triple {4124#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4124#true} is VALID [2018-11-23 12:29:25,799 INFO L273 TraceCheckUtils]: 27: Hoare triple {4124#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:29:25,799 INFO L273 TraceCheckUtils]: 28: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:29:25,799 INFO L273 TraceCheckUtils]: 29: Hoare triple {4124#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:29:25,800 INFO L273 TraceCheckUtils]: 30: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:29:25,800 INFO L273 TraceCheckUtils]: 31: Hoare triple {4124#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:29:25,800 INFO L273 TraceCheckUtils]: 32: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:29:25,800 INFO L273 TraceCheckUtils]: 33: Hoare triple {4124#true} assume !(~i~0 < 100000); {4124#true} is VALID [2018-11-23 12:29:25,800 INFO L273 TraceCheckUtils]: 34: Hoare triple {4124#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4124#true} is VALID [2018-11-23 12:29:25,800 INFO L273 TraceCheckUtils]: 35: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:29:25,801 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {4124#true} {4124#true} #70#return; {4124#true} is VALID [2018-11-23 12:29:25,801 INFO L273 TraceCheckUtils]: 37: Hoare triple {4124#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {4124#true} is VALID [2018-11-23 12:29:25,801 INFO L256 TraceCheckUtils]: 38: Hoare triple {4124#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {4124#true} is VALID [2018-11-23 12:29:25,801 INFO L273 TraceCheckUtils]: 39: Hoare triple {4124#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4124#true} is VALID [2018-11-23 12:29:25,801 INFO L273 TraceCheckUtils]: 40: Hoare triple {4124#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:29:25,801 INFO L273 TraceCheckUtils]: 41: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:29:25,801 INFO L273 TraceCheckUtils]: 42: Hoare triple {4124#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:29:25,802 INFO L273 TraceCheckUtils]: 43: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:29:25,802 INFO L273 TraceCheckUtils]: 44: Hoare triple {4124#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:29:25,802 INFO L273 TraceCheckUtils]: 45: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:29:25,802 INFO L273 TraceCheckUtils]: 46: Hoare triple {4124#true} assume !(~i~0 < 100000); {4124#true} is VALID [2018-11-23 12:29:25,802 INFO L273 TraceCheckUtils]: 47: Hoare triple {4124#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4124#true} is VALID [2018-11-23 12:29:25,802 INFO L273 TraceCheckUtils]: 48: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:29:25,803 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {4124#true} {4124#true} #72#return; {4124#true} is VALID [2018-11-23 12:29:25,803 INFO L273 TraceCheckUtils]: 50: Hoare triple {4124#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {4289#(<= main_~i~2 0)} is VALID [2018-11-23 12:29:25,805 INFO L273 TraceCheckUtils]: 51: Hoare triple {4289#(<= main_~i~2 0)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {4289#(<= main_~i~2 0)} is VALID [2018-11-23 12:29:25,805 INFO L273 TraceCheckUtils]: 52: Hoare triple {4289#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {4296#(<= main_~i~2 1)} is VALID [2018-11-23 12:29:25,807 INFO L273 TraceCheckUtils]: 53: Hoare triple {4296#(<= main_~i~2 1)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {4296#(<= main_~i~2 1)} is VALID [2018-11-23 12:29:25,807 INFO L273 TraceCheckUtils]: 54: Hoare triple {4296#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {4303#(<= main_~i~2 2)} is VALID [2018-11-23 12:29:25,809 INFO L273 TraceCheckUtils]: 55: Hoare triple {4303#(<= main_~i~2 2)} assume !(~i~2 < 99999); {4125#false} is VALID [2018-11-23 12:29:25,809 INFO L273 TraceCheckUtils]: 56: Hoare triple {4125#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {4125#false} is VALID [2018-11-23 12:29:25,809 INFO L256 TraceCheckUtils]: 57: Hoare triple {4125#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {4125#false} is VALID [2018-11-23 12:29:25,810 INFO L273 TraceCheckUtils]: 58: Hoare triple {4125#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4125#false} is VALID [2018-11-23 12:29:25,810 INFO L273 TraceCheckUtils]: 59: Hoare triple {4125#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4125#false} is VALID [2018-11-23 12:29:25,810 INFO L273 TraceCheckUtils]: 60: Hoare triple {4125#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4125#false} is VALID [2018-11-23 12:29:25,810 INFO L273 TraceCheckUtils]: 61: Hoare triple {4125#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4125#false} is VALID [2018-11-23 12:29:25,811 INFO L273 TraceCheckUtils]: 62: Hoare triple {4125#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4125#false} is VALID [2018-11-23 12:29:25,811 INFO L273 TraceCheckUtils]: 63: Hoare triple {4125#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4125#false} is VALID [2018-11-23 12:29:25,811 INFO L273 TraceCheckUtils]: 64: Hoare triple {4125#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4125#false} is VALID [2018-11-23 12:29:25,811 INFO L273 TraceCheckUtils]: 65: Hoare triple {4125#false} assume !(~i~0 < 100000); {4125#false} is VALID [2018-11-23 12:29:25,811 INFO L273 TraceCheckUtils]: 66: Hoare triple {4125#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4125#false} is VALID [2018-11-23 12:29:25,811 INFO L273 TraceCheckUtils]: 67: Hoare triple {4125#false} assume true; {4125#false} is VALID [2018-11-23 12:29:25,812 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {4125#false} {4125#false} #74#return; {4125#false} is VALID [2018-11-23 12:29:25,812 INFO L273 TraceCheckUtils]: 69: Hoare triple {4125#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {4125#false} is VALID [2018-11-23 12:29:25,812 INFO L273 TraceCheckUtils]: 70: Hoare triple {4125#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {4125#false} is VALID [2018-11-23 12:29:25,812 INFO L273 TraceCheckUtils]: 71: Hoare triple {4125#false} assume !false; {4125#false} is VALID [2018-11-23 12:29:25,816 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 58 proven. 4 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2018-11-23 12:29:25,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:29:25,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2018-11-23 12:29:25,837 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2018-11-23 12:29:25,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:29:25,837 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 12:29:25,962 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 12:29:25,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 12:29:25,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 12:29:25,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:29:25,963 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 15 states. [2018-11-23 12:29:26,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:26,446 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2018-11-23 12:29:26,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 12:29:26,446 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2018-11-23 12:29:26,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:26,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:29:26,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 79 transitions. [2018-11-23 12:29:26,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:29:26,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 79 transitions. [2018-11-23 12:29:26,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 79 transitions. [2018-11-23 12:29:26,568 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 12:29:26,569 INFO L225 Difference]: With dead ends: 83 [2018-11-23 12:29:26,570 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 12:29:26,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:29:26,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 12:29:26,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-11-23 12:29:26,602 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:26,602 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 55 states. [2018-11-23 12:29:26,602 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 55 states. [2018-11-23 12:29:26,603 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 55 states. [2018-11-23 12:29:26,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:26,605 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-11-23 12:29:26,605 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-11-23 12:29:26,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:26,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:26,605 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 57 states. [2018-11-23 12:29:26,605 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 57 states. [2018-11-23 12:29:26,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:26,607 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-11-23 12:29:26,607 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-11-23 12:29:26,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:26,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:26,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:26,608 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:26,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 12:29:26,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-11-23 12:29:26,610 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 72 [2018-11-23 12:29:26,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:26,610 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-11-23 12:29:26,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 12:29:26,610 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-11-23 12:29:26,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 12:29:26,611 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:26,611 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:29:26,611 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:26,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:26,612 INFO L82 PathProgramCache]: Analyzing trace with hash -2116910669, now seen corresponding path program 10 times [2018-11-23 12:29:26,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:26,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:26,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:26,613 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:29:26,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:26,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:27,199 INFO L256 TraceCheckUtils]: 0: Hoare triple {4671#true} call ULTIMATE.init(); {4671#true} is VALID [2018-11-23 12:29:27,200 INFO L273 TraceCheckUtils]: 1: Hoare triple {4671#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4671#true} is VALID [2018-11-23 12:29:27,200 INFO L273 TraceCheckUtils]: 2: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:29:27,200 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4671#true} {4671#true} #66#return; {4671#true} is VALID [2018-11-23 12:29:27,201 INFO L256 TraceCheckUtils]: 4: Hoare triple {4671#true} call #t~ret13 := main(); {4671#true} is VALID [2018-11-23 12:29:27,201 INFO L273 TraceCheckUtils]: 5: Hoare triple {4671#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {4673#(= main_~i~1 0)} is VALID [2018-11-23 12:29:27,202 INFO L273 TraceCheckUtils]: 6: Hoare triple {4673#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4673#(= main_~i~1 0)} is VALID [2018-11-23 12:29:27,202 INFO L273 TraceCheckUtils]: 7: Hoare triple {4673#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4674#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:27,203 INFO L273 TraceCheckUtils]: 8: Hoare triple {4674#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4674#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:27,203 INFO L273 TraceCheckUtils]: 9: Hoare triple {4674#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4675#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:27,203 INFO L273 TraceCheckUtils]: 10: Hoare triple {4675#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4675#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:27,204 INFO L273 TraceCheckUtils]: 11: Hoare triple {4675#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4676#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:27,205 INFO L273 TraceCheckUtils]: 12: Hoare triple {4676#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4676#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:27,205 INFO L273 TraceCheckUtils]: 13: Hoare triple {4676#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4677#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:27,206 INFO L273 TraceCheckUtils]: 14: Hoare triple {4677#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4677#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:27,207 INFO L273 TraceCheckUtils]: 15: Hoare triple {4677#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4678#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:27,207 INFO L273 TraceCheckUtils]: 16: Hoare triple {4678#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4678#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:27,208 INFO L273 TraceCheckUtils]: 17: Hoare triple {4678#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4679#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:27,209 INFO L273 TraceCheckUtils]: 18: Hoare triple {4679#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4679#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:27,209 INFO L273 TraceCheckUtils]: 19: Hoare triple {4679#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4680#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:27,210 INFO L273 TraceCheckUtils]: 20: Hoare triple {4680#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4680#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:27,211 INFO L273 TraceCheckUtils]: 21: Hoare triple {4680#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4681#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:27,211 INFO L273 TraceCheckUtils]: 22: Hoare triple {4681#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4681#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:27,212 INFO L273 TraceCheckUtils]: 23: Hoare triple {4681#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4682#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:27,213 INFO L273 TraceCheckUtils]: 24: Hoare triple {4682#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4682#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:27,213 INFO L273 TraceCheckUtils]: 25: Hoare triple {4682#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4683#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:27,214 INFO L273 TraceCheckUtils]: 26: Hoare triple {4683#(<= main_~i~1 10)} assume !(~i~1 < 100000); {4672#false} is VALID [2018-11-23 12:29:27,214 INFO L256 TraceCheckUtils]: 27: Hoare triple {4672#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {4671#true} is VALID [2018-11-23 12:29:27,215 INFO L273 TraceCheckUtils]: 28: Hoare triple {4671#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4671#true} is VALID [2018-11-23 12:29:27,215 INFO L273 TraceCheckUtils]: 29: Hoare triple {4671#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:29:27,215 INFO L273 TraceCheckUtils]: 30: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:29:27,215 INFO L273 TraceCheckUtils]: 31: Hoare triple {4671#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:29:27,215 INFO L273 TraceCheckUtils]: 32: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:29:27,216 INFO L273 TraceCheckUtils]: 33: Hoare triple {4671#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:29:27,216 INFO L273 TraceCheckUtils]: 34: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:29:27,216 INFO L273 TraceCheckUtils]: 35: Hoare triple {4671#true} assume !(~i~0 < 100000); {4671#true} is VALID [2018-11-23 12:29:27,216 INFO L273 TraceCheckUtils]: 36: Hoare triple {4671#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4671#true} is VALID [2018-11-23 12:29:27,216 INFO L273 TraceCheckUtils]: 37: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:29:27,217 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {4671#true} {4672#false} #70#return; {4672#false} is VALID [2018-11-23 12:29:27,217 INFO L273 TraceCheckUtils]: 39: Hoare triple {4672#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {4672#false} is VALID [2018-11-23 12:29:27,217 INFO L256 TraceCheckUtils]: 40: Hoare triple {4672#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {4671#true} is VALID [2018-11-23 12:29:27,217 INFO L273 TraceCheckUtils]: 41: Hoare triple {4671#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4671#true} is VALID [2018-11-23 12:29:27,217 INFO L273 TraceCheckUtils]: 42: Hoare triple {4671#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:29:27,217 INFO L273 TraceCheckUtils]: 43: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:29:27,217 INFO L273 TraceCheckUtils]: 44: Hoare triple {4671#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:29:27,217 INFO L273 TraceCheckUtils]: 45: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:29:27,218 INFO L273 TraceCheckUtils]: 46: Hoare triple {4671#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:29:27,218 INFO L273 TraceCheckUtils]: 47: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:29:27,218 INFO L273 TraceCheckUtils]: 48: Hoare triple {4671#true} assume !(~i~0 < 100000); {4671#true} is VALID [2018-11-23 12:29:27,218 INFO L273 TraceCheckUtils]: 49: Hoare triple {4671#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4671#true} is VALID [2018-11-23 12:29:27,218 INFO L273 TraceCheckUtils]: 50: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:29:27,218 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {4671#true} {4672#false} #72#return; {4672#false} is VALID [2018-11-23 12:29:27,218 INFO L273 TraceCheckUtils]: 52: Hoare triple {4672#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {4672#false} is VALID [2018-11-23 12:29:27,218 INFO L273 TraceCheckUtils]: 53: Hoare triple {4672#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {4672#false} is VALID [2018-11-23 12:29:27,218 INFO L273 TraceCheckUtils]: 54: Hoare triple {4672#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {4672#false} is VALID [2018-11-23 12:29:27,219 INFO L273 TraceCheckUtils]: 55: Hoare triple {4672#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {4672#false} is VALID [2018-11-23 12:29:27,219 INFO L273 TraceCheckUtils]: 56: Hoare triple {4672#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {4672#false} is VALID [2018-11-23 12:29:27,219 INFO L273 TraceCheckUtils]: 57: Hoare triple {4672#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {4672#false} is VALID [2018-11-23 12:29:27,219 INFO L273 TraceCheckUtils]: 58: Hoare triple {4672#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {4672#false} is VALID [2018-11-23 12:29:27,219 INFO L273 TraceCheckUtils]: 59: Hoare triple {4672#false} assume !(~i~2 < 99999); {4672#false} is VALID [2018-11-23 12:29:27,219 INFO L273 TraceCheckUtils]: 60: Hoare triple {4672#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {4672#false} is VALID [2018-11-23 12:29:27,219 INFO L256 TraceCheckUtils]: 61: Hoare triple {4672#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {4671#true} is VALID [2018-11-23 12:29:27,219 INFO L273 TraceCheckUtils]: 62: Hoare triple {4671#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4671#true} is VALID [2018-11-23 12:29:27,220 INFO L273 TraceCheckUtils]: 63: Hoare triple {4671#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:29:27,220 INFO L273 TraceCheckUtils]: 64: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:29:27,220 INFO L273 TraceCheckUtils]: 65: Hoare triple {4671#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:29:27,220 INFO L273 TraceCheckUtils]: 66: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:29:27,220 INFO L273 TraceCheckUtils]: 67: Hoare triple {4671#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:29:27,220 INFO L273 TraceCheckUtils]: 68: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:29:27,220 INFO L273 TraceCheckUtils]: 69: Hoare triple {4671#true} assume !(~i~0 < 100000); {4671#true} is VALID [2018-11-23 12:29:27,220 INFO L273 TraceCheckUtils]: 70: Hoare triple {4671#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4671#true} is VALID [2018-11-23 12:29:27,221 INFO L273 TraceCheckUtils]: 71: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:29:27,221 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {4671#true} {4672#false} #74#return; {4672#false} is VALID [2018-11-23 12:29:27,221 INFO L273 TraceCheckUtils]: 73: Hoare triple {4672#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {4672#false} is VALID [2018-11-23 12:29:27,221 INFO L273 TraceCheckUtils]: 74: Hoare triple {4672#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {4672#false} is VALID [2018-11-23 12:29:27,221 INFO L273 TraceCheckUtils]: 75: Hoare triple {4672#false} assume !false; {4672#false} is VALID [2018-11-23 12:29:27,224 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-11-23 12:29:27,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:29:27,224 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 12:29:27,238 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:29:27,275 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:29:27,275 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:29:27,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:27,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:29:27,476 INFO L256 TraceCheckUtils]: 0: Hoare triple {4671#true} call ULTIMATE.init(); {4671#true} is VALID [2018-11-23 12:29:27,477 INFO L273 TraceCheckUtils]: 1: Hoare triple {4671#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4671#true} is VALID [2018-11-23 12:29:27,477 INFO L273 TraceCheckUtils]: 2: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:29:27,477 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4671#true} {4671#true} #66#return; {4671#true} is VALID [2018-11-23 12:29:27,477 INFO L256 TraceCheckUtils]: 4: Hoare triple {4671#true} call #t~ret13 := main(); {4671#true} is VALID [2018-11-23 12:29:27,478 INFO L273 TraceCheckUtils]: 5: Hoare triple {4671#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {4671#true} is VALID [2018-11-23 12:29:27,478 INFO L273 TraceCheckUtils]: 6: Hoare triple {4671#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4671#true} is VALID [2018-11-23 12:29:27,478 INFO L273 TraceCheckUtils]: 7: Hoare triple {4671#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4671#true} is VALID [2018-11-23 12:29:27,478 INFO L273 TraceCheckUtils]: 8: Hoare triple {4671#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4671#true} is VALID [2018-11-23 12:29:27,479 INFO L273 TraceCheckUtils]: 9: Hoare triple {4671#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4671#true} is VALID [2018-11-23 12:29:27,479 INFO L273 TraceCheckUtils]: 10: Hoare triple {4671#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4671#true} is VALID [2018-11-23 12:29:27,479 INFO L273 TraceCheckUtils]: 11: Hoare triple {4671#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4671#true} is VALID [2018-11-23 12:29:27,479 INFO L273 TraceCheckUtils]: 12: Hoare triple {4671#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4671#true} is VALID [2018-11-23 12:29:27,479 INFO L273 TraceCheckUtils]: 13: Hoare triple {4671#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4671#true} is VALID [2018-11-23 12:29:27,480 INFO L273 TraceCheckUtils]: 14: Hoare triple {4671#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4671#true} is VALID [2018-11-23 12:29:27,480 INFO L273 TraceCheckUtils]: 15: Hoare triple {4671#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4671#true} is VALID [2018-11-23 12:29:27,480 INFO L273 TraceCheckUtils]: 16: Hoare triple {4671#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4671#true} is VALID [2018-11-23 12:29:27,480 INFO L273 TraceCheckUtils]: 17: Hoare triple {4671#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4671#true} is VALID [2018-11-23 12:29:27,480 INFO L273 TraceCheckUtils]: 18: Hoare triple {4671#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4671#true} is VALID [2018-11-23 12:29:27,481 INFO L273 TraceCheckUtils]: 19: Hoare triple {4671#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4671#true} is VALID [2018-11-23 12:29:27,481 INFO L273 TraceCheckUtils]: 20: Hoare triple {4671#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4671#true} is VALID [2018-11-23 12:29:27,481 INFO L273 TraceCheckUtils]: 21: Hoare triple {4671#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4671#true} is VALID [2018-11-23 12:29:27,481 INFO L273 TraceCheckUtils]: 22: Hoare triple {4671#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4671#true} is VALID [2018-11-23 12:29:27,481 INFO L273 TraceCheckUtils]: 23: Hoare triple {4671#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4671#true} is VALID [2018-11-23 12:29:27,482 INFO L273 TraceCheckUtils]: 24: Hoare triple {4671#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4671#true} is VALID [2018-11-23 12:29:27,482 INFO L273 TraceCheckUtils]: 25: Hoare triple {4671#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4671#true} is VALID [2018-11-23 12:29:27,482 INFO L273 TraceCheckUtils]: 26: Hoare triple {4671#true} assume !(~i~1 < 100000); {4671#true} is VALID [2018-11-23 12:29:27,482 INFO L256 TraceCheckUtils]: 27: Hoare triple {4671#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {4671#true} is VALID [2018-11-23 12:29:27,482 INFO L273 TraceCheckUtils]: 28: Hoare triple {4671#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4671#true} is VALID [2018-11-23 12:29:27,482 INFO L273 TraceCheckUtils]: 29: Hoare triple {4671#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:29:27,483 INFO L273 TraceCheckUtils]: 30: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:29:27,483 INFO L273 TraceCheckUtils]: 31: Hoare triple {4671#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:29:27,483 INFO L273 TraceCheckUtils]: 32: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:29:27,483 INFO L273 TraceCheckUtils]: 33: Hoare triple {4671#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:29:27,483 INFO L273 TraceCheckUtils]: 34: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:29:27,483 INFO L273 TraceCheckUtils]: 35: Hoare triple {4671#true} assume !(~i~0 < 100000); {4671#true} is VALID [2018-11-23 12:29:27,483 INFO L273 TraceCheckUtils]: 36: Hoare triple {4671#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4671#true} is VALID [2018-11-23 12:29:27,483 INFO L273 TraceCheckUtils]: 37: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:29:27,483 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {4671#true} {4671#true} #70#return; {4671#true} is VALID [2018-11-23 12:29:27,484 INFO L273 TraceCheckUtils]: 39: Hoare triple {4671#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {4671#true} is VALID [2018-11-23 12:29:27,484 INFO L256 TraceCheckUtils]: 40: Hoare triple {4671#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {4671#true} is VALID [2018-11-23 12:29:27,484 INFO L273 TraceCheckUtils]: 41: Hoare triple {4671#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4671#true} is VALID [2018-11-23 12:29:27,484 INFO L273 TraceCheckUtils]: 42: Hoare triple {4671#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:29:27,484 INFO L273 TraceCheckUtils]: 43: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:29:27,484 INFO L273 TraceCheckUtils]: 44: Hoare triple {4671#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:29:27,484 INFO L273 TraceCheckUtils]: 45: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:29:27,484 INFO L273 TraceCheckUtils]: 46: Hoare triple {4671#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:29:27,485 INFO L273 TraceCheckUtils]: 47: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:29:27,485 INFO L273 TraceCheckUtils]: 48: Hoare triple {4671#true} assume !(~i~0 < 100000); {4671#true} is VALID [2018-11-23 12:29:27,485 INFO L273 TraceCheckUtils]: 49: Hoare triple {4671#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4671#true} is VALID [2018-11-23 12:29:27,485 INFO L273 TraceCheckUtils]: 50: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:29:27,485 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {4671#true} {4671#true} #72#return; {4671#true} is VALID [2018-11-23 12:29:27,485 INFO L273 TraceCheckUtils]: 52: Hoare triple {4671#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {4671#true} is VALID [2018-11-23 12:29:27,485 INFO L273 TraceCheckUtils]: 53: Hoare triple {4671#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {4671#true} is VALID [2018-11-23 12:29:27,485 INFO L273 TraceCheckUtils]: 54: Hoare triple {4671#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {4671#true} is VALID [2018-11-23 12:29:27,486 INFO L273 TraceCheckUtils]: 55: Hoare triple {4671#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {4671#true} is VALID [2018-11-23 12:29:27,486 INFO L273 TraceCheckUtils]: 56: Hoare triple {4671#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {4671#true} is VALID [2018-11-23 12:29:27,486 INFO L273 TraceCheckUtils]: 57: Hoare triple {4671#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {4671#true} is VALID [2018-11-23 12:29:27,486 INFO L273 TraceCheckUtils]: 58: Hoare triple {4671#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {4671#true} is VALID [2018-11-23 12:29:27,486 INFO L273 TraceCheckUtils]: 59: Hoare triple {4671#true} assume !(~i~2 < 99999); {4671#true} is VALID [2018-11-23 12:29:27,486 INFO L273 TraceCheckUtils]: 60: Hoare triple {4671#true} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {4671#true} is VALID [2018-11-23 12:29:27,486 INFO L256 TraceCheckUtils]: 61: Hoare triple {4671#true} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {4671#true} is VALID [2018-11-23 12:29:27,487 INFO L273 TraceCheckUtils]: 62: Hoare triple {4671#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4873#(<= xor_~i~0 1)} is VALID [2018-11-23 12:29:27,487 INFO L273 TraceCheckUtils]: 63: Hoare triple {4873#(<= xor_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4873#(<= xor_~i~0 1)} is VALID [2018-11-23 12:29:27,488 INFO L273 TraceCheckUtils]: 64: Hoare triple {4873#(<= xor_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4880#(<= xor_~i~0 2)} is VALID [2018-11-23 12:29:27,488 INFO L273 TraceCheckUtils]: 65: Hoare triple {4880#(<= xor_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4880#(<= xor_~i~0 2)} is VALID [2018-11-23 12:29:27,489 INFO L273 TraceCheckUtils]: 66: Hoare triple {4880#(<= xor_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4887#(<= xor_~i~0 3)} is VALID [2018-11-23 12:29:27,489 INFO L273 TraceCheckUtils]: 67: Hoare triple {4887#(<= xor_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4887#(<= xor_~i~0 3)} is VALID [2018-11-23 12:29:27,489 INFO L273 TraceCheckUtils]: 68: Hoare triple {4887#(<= xor_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4894#(<= xor_~i~0 4)} is VALID [2018-11-23 12:29:27,490 INFO L273 TraceCheckUtils]: 69: Hoare triple {4894#(<= xor_~i~0 4)} assume !(~i~0 < 100000); {4672#false} is VALID [2018-11-23 12:29:27,490 INFO L273 TraceCheckUtils]: 70: Hoare triple {4672#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4672#false} is VALID [2018-11-23 12:29:27,490 INFO L273 TraceCheckUtils]: 71: Hoare triple {4672#false} assume true; {4672#false} is VALID [2018-11-23 12:29:27,490 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {4672#false} {4671#true} #74#return; {4672#false} is VALID [2018-11-23 12:29:27,490 INFO L273 TraceCheckUtils]: 73: Hoare triple {4672#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {4672#false} is VALID [2018-11-23 12:29:27,490 INFO L273 TraceCheckUtils]: 74: Hoare triple {4672#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {4672#false} is VALID [2018-11-23 12:29:27,491 INFO L273 TraceCheckUtils]: 75: Hoare triple {4672#false} assume !false; {4672#false} is VALID [2018-11-23 12:29:27,493 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 56 proven. 9 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2018-11-23 12:29:27,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:29:27,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6] total 17 [2018-11-23 12:29:27,515 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 76 [2018-11-23 12:29:27,515 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:29:27,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:29:27,587 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 12:29:27,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:29:27,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:29:27,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:29:27,589 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 17 states. [2018-11-23 12:29:28,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:28,070 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2018-11-23 12:29:28,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:29:28,071 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 76 [2018-11-23 12:29:28,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:28,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:29:28,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 86 transitions. [2018-11-23 12:29:28,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:29:28,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 86 transitions. [2018-11-23 12:29:28,075 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 86 transitions. [2018-11-23 12:29:28,187 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 12:29:28,189 INFO L225 Difference]: With dead ends: 89 [2018-11-23 12:29:28,189 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 12:29:28,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:29:28,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 12:29:28,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-11-23 12:29:28,220 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:28,220 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 59 states. [2018-11-23 12:29:28,220 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 59 states. [2018-11-23 12:29:28,220 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 59 states. [2018-11-23 12:29:28,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:28,223 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-11-23 12:29:28,223 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-11-23 12:29:28,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:28,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:28,224 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 61 states. [2018-11-23 12:29:28,224 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 61 states. [2018-11-23 12:29:28,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:28,226 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-11-23 12:29:28,226 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-11-23 12:29:28,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:28,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:28,227 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:28,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:28,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 12:29:28,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-11-23 12:29:28,229 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 76 [2018-11-23 12:29:28,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:28,229 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-11-23 12:29:28,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:29:28,229 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-11-23 12:29:28,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-23 12:29:28,230 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:28,230 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:29:28,230 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:28,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:28,231 INFO L82 PathProgramCache]: Analyzing trace with hash 343984243, now seen corresponding path program 11 times [2018-11-23 12:29:28,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:28,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:28,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:28,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:29:28,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:28,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:29,090 INFO L256 TraceCheckUtils]: 0: Hoare triple {5255#true} call ULTIMATE.init(); {5255#true} is VALID [2018-11-23 12:29:29,091 INFO L273 TraceCheckUtils]: 1: Hoare triple {5255#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5255#true} is VALID [2018-11-23 12:29:29,091 INFO L273 TraceCheckUtils]: 2: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:29:29,091 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5255#true} {5255#true} #66#return; {5255#true} is VALID [2018-11-23 12:29:29,091 INFO L256 TraceCheckUtils]: 4: Hoare triple {5255#true} call #t~ret13 := main(); {5255#true} is VALID [2018-11-23 12:29:29,092 INFO L273 TraceCheckUtils]: 5: Hoare triple {5255#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5257#(= main_~i~1 0)} is VALID [2018-11-23 12:29:29,092 INFO L273 TraceCheckUtils]: 6: Hoare triple {5257#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5257#(= main_~i~1 0)} is VALID [2018-11-23 12:29:29,093 INFO L273 TraceCheckUtils]: 7: Hoare triple {5257#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5258#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:29,093 INFO L273 TraceCheckUtils]: 8: Hoare triple {5258#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5258#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:29,094 INFO L273 TraceCheckUtils]: 9: Hoare triple {5258#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5259#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:29,094 INFO L273 TraceCheckUtils]: 10: Hoare triple {5259#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5259#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:29,095 INFO L273 TraceCheckUtils]: 11: Hoare triple {5259#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5260#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:29,095 INFO L273 TraceCheckUtils]: 12: Hoare triple {5260#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5260#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:29,096 INFO L273 TraceCheckUtils]: 13: Hoare triple {5260#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5261#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:29,096 INFO L273 TraceCheckUtils]: 14: Hoare triple {5261#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5261#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:29,097 INFO L273 TraceCheckUtils]: 15: Hoare triple {5261#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5262#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:29,097 INFO L273 TraceCheckUtils]: 16: Hoare triple {5262#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5262#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:29,098 INFO L273 TraceCheckUtils]: 17: Hoare triple {5262#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5263#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:29,099 INFO L273 TraceCheckUtils]: 18: Hoare triple {5263#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5263#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:29,100 INFO L273 TraceCheckUtils]: 19: Hoare triple {5263#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5264#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:29,100 INFO L273 TraceCheckUtils]: 20: Hoare triple {5264#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5264#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:29,117 INFO L273 TraceCheckUtils]: 21: Hoare triple {5264#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5265#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:29,121 INFO L273 TraceCheckUtils]: 22: Hoare triple {5265#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5265#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:29,122 INFO L273 TraceCheckUtils]: 23: Hoare triple {5265#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5266#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:29,122 INFO L273 TraceCheckUtils]: 24: Hoare triple {5266#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5266#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:29,123 INFO L273 TraceCheckUtils]: 25: Hoare triple {5266#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5267#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:29,123 INFO L273 TraceCheckUtils]: 26: Hoare triple {5267#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5267#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:29,124 INFO L273 TraceCheckUtils]: 27: Hoare triple {5267#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5268#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:29,124 INFO L273 TraceCheckUtils]: 28: Hoare triple {5268#(<= main_~i~1 11)} assume !(~i~1 < 100000); {5256#false} is VALID [2018-11-23 12:29:29,124 INFO L256 TraceCheckUtils]: 29: Hoare triple {5256#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {5255#true} is VALID [2018-11-23 12:29:29,125 INFO L273 TraceCheckUtils]: 30: Hoare triple {5255#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5255#true} is VALID [2018-11-23 12:29:29,125 INFO L273 TraceCheckUtils]: 31: Hoare triple {5255#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:29:29,125 INFO L273 TraceCheckUtils]: 32: Hoare triple {5255#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5255#true} is VALID [2018-11-23 12:29:29,125 INFO L273 TraceCheckUtils]: 33: Hoare triple {5255#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:29:29,125 INFO L273 TraceCheckUtils]: 34: Hoare triple {5255#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5255#true} is VALID [2018-11-23 12:29:29,126 INFO L273 TraceCheckUtils]: 35: Hoare triple {5255#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:29:29,126 INFO L273 TraceCheckUtils]: 36: Hoare triple {5255#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5255#true} is VALID [2018-11-23 12:29:29,126 INFO L273 TraceCheckUtils]: 37: Hoare triple {5255#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:29:29,126 INFO L273 TraceCheckUtils]: 38: Hoare triple {5255#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5255#true} is VALID [2018-11-23 12:29:29,126 INFO L273 TraceCheckUtils]: 39: Hoare triple {5255#true} assume !(~i~0 < 100000); {5255#true} is VALID [2018-11-23 12:29:29,126 INFO L273 TraceCheckUtils]: 40: Hoare triple {5255#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5255#true} is VALID [2018-11-23 12:29:29,127 INFO L273 TraceCheckUtils]: 41: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:29:29,127 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {5255#true} {5256#false} #70#return; {5256#false} is VALID [2018-11-23 12:29:29,127 INFO L273 TraceCheckUtils]: 43: Hoare triple {5256#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {5256#false} is VALID [2018-11-23 12:29:29,127 INFO L256 TraceCheckUtils]: 44: Hoare triple {5256#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {5255#true} is VALID [2018-11-23 12:29:29,127 INFO L273 TraceCheckUtils]: 45: Hoare triple {5255#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5255#true} is VALID [2018-11-23 12:29:29,127 INFO L273 TraceCheckUtils]: 46: Hoare triple {5255#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:29:29,127 INFO L273 TraceCheckUtils]: 47: Hoare triple {5255#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5255#true} is VALID [2018-11-23 12:29:29,127 INFO L273 TraceCheckUtils]: 48: Hoare triple {5255#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:29:29,128 INFO L273 TraceCheckUtils]: 49: Hoare triple {5255#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5255#true} is VALID [2018-11-23 12:29:29,128 INFO L273 TraceCheckUtils]: 50: Hoare triple {5255#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:29:29,128 INFO L273 TraceCheckUtils]: 51: Hoare triple {5255#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5255#true} is VALID [2018-11-23 12:29:29,128 INFO L273 TraceCheckUtils]: 52: Hoare triple {5255#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:29:29,128 INFO L273 TraceCheckUtils]: 53: Hoare triple {5255#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5255#true} is VALID [2018-11-23 12:29:29,128 INFO L273 TraceCheckUtils]: 54: Hoare triple {5255#true} assume !(~i~0 < 100000); {5255#true} is VALID [2018-11-23 12:29:29,128 INFO L273 TraceCheckUtils]: 55: Hoare triple {5255#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5255#true} is VALID [2018-11-23 12:29:29,128 INFO L273 TraceCheckUtils]: 56: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:29:29,129 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {5255#true} {5256#false} #72#return; {5256#false} is VALID [2018-11-23 12:29:29,129 INFO L273 TraceCheckUtils]: 58: Hoare triple {5256#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {5256#false} is VALID [2018-11-23 12:29:29,129 INFO L273 TraceCheckUtils]: 59: Hoare triple {5256#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {5256#false} is VALID [2018-11-23 12:29:29,129 INFO L273 TraceCheckUtils]: 60: Hoare triple {5256#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {5256#false} is VALID [2018-11-23 12:29:29,129 INFO L273 TraceCheckUtils]: 61: Hoare triple {5256#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {5256#false} is VALID [2018-11-23 12:29:29,129 INFO L273 TraceCheckUtils]: 62: Hoare triple {5256#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {5256#false} is VALID [2018-11-23 12:29:29,129 INFO L273 TraceCheckUtils]: 63: Hoare triple {5256#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {5256#false} is VALID [2018-11-23 12:29:29,129 INFO L273 TraceCheckUtils]: 64: Hoare triple {5256#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {5256#false} is VALID [2018-11-23 12:29:29,130 INFO L273 TraceCheckUtils]: 65: Hoare triple {5256#false} assume !(~i~2 < 99999); {5256#false} is VALID [2018-11-23 12:29:29,130 INFO L273 TraceCheckUtils]: 66: Hoare triple {5256#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {5256#false} is VALID [2018-11-23 12:29:29,130 INFO L256 TraceCheckUtils]: 67: Hoare triple {5256#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {5255#true} is VALID [2018-11-23 12:29:29,130 INFO L273 TraceCheckUtils]: 68: Hoare triple {5255#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5255#true} is VALID [2018-11-23 12:29:29,130 INFO L273 TraceCheckUtils]: 69: Hoare triple {5255#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:29:29,130 INFO L273 TraceCheckUtils]: 70: Hoare triple {5255#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5255#true} is VALID [2018-11-23 12:29:29,130 INFO L273 TraceCheckUtils]: 71: Hoare triple {5255#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:29:29,130 INFO L273 TraceCheckUtils]: 72: Hoare triple {5255#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5255#true} is VALID [2018-11-23 12:29:29,131 INFO L273 TraceCheckUtils]: 73: Hoare triple {5255#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:29:29,131 INFO L273 TraceCheckUtils]: 74: Hoare triple {5255#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5255#true} is VALID [2018-11-23 12:29:29,131 INFO L273 TraceCheckUtils]: 75: Hoare triple {5255#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:29:29,131 INFO L273 TraceCheckUtils]: 76: Hoare triple {5255#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5255#true} is VALID [2018-11-23 12:29:29,131 INFO L273 TraceCheckUtils]: 77: Hoare triple {5255#true} assume !(~i~0 < 100000); {5255#true} is VALID [2018-11-23 12:29:29,131 INFO L273 TraceCheckUtils]: 78: Hoare triple {5255#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5255#true} is VALID [2018-11-23 12:29:29,131 INFO L273 TraceCheckUtils]: 79: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:29:29,131 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {5255#true} {5256#false} #74#return; {5256#false} is VALID [2018-11-23 12:29:29,131 INFO L273 TraceCheckUtils]: 81: Hoare triple {5256#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {5256#false} is VALID [2018-11-23 12:29:29,132 INFO L273 TraceCheckUtils]: 82: Hoare triple {5256#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {5256#false} is VALID [2018-11-23 12:29:29,132 INFO L273 TraceCheckUtils]: 83: Hoare triple {5256#false} assume !false; {5256#false} is VALID [2018-11-23 12:29:29,135 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-11-23 12:29:29,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:29:29,135 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 12:29:29,144 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:29:29,441 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-11-23 12:29:29,442 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:29:29,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:29,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:29:29,613 INFO L256 TraceCheckUtils]: 0: Hoare triple {5255#true} call ULTIMATE.init(); {5255#true} is VALID [2018-11-23 12:29:29,613 INFO L273 TraceCheckUtils]: 1: Hoare triple {5255#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5255#true} is VALID [2018-11-23 12:29:29,613 INFO L273 TraceCheckUtils]: 2: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:29:29,614 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5255#true} {5255#true} #66#return; {5255#true} is VALID [2018-11-23 12:29:29,614 INFO L256 TraceCheckUtils]: 4: Hoare triple {5255#true} call #t~ret13 := main(); {5255#true} is VALID [2018-11-23 12:29:29,614 INFO L273 TraceCheckUtils]: 5: Hoare triple {5255#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5255#true} is VALID [2018-11-23 12:29:29,614 INFO L273 TraceCheckUtils]: 6: Hoare triple {5255#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5255#true} is VALID [2018-11-23 12:29:29,614 INFO L273 TraceCheckUtils]: 7: Hoare triple {5255#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5255#true} is VALID [2018-11-23 12:29:29,615 INFO L273 TraceCheckUtils]: 8: Hoare triple {5255#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5255#true} is VALID [2018-11-23 12:29:29,615 INFO L273 TraceCheckUtils]: 9: Hoare triple {5255#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5255#true} is VALID [2018-11-23 12:29:29,615 INFO L273 TraceCheckUtils]: 10: Hoare triple {5255#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5255#true} is VALID [2018-11-23 12:29:29,615 INFO L273 TraceCheckUtils]: 11: Hoare triple {5255#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5255#true} is VALID [2018-11-23 12:29:29,615 INFO L273 TraceCheckUtils]: 12: Hoare triple {5255#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5255#true} is VALID [2018-11-23 12:29:29,615 INFO L273 TraceCheckUtils]: 13: Hoare triple {5255#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5255#true} is VALID [2018-11-23 12:29:29,616 INFO L273 TraceCheckUtils]: 14: Hoare triple {5255#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5255#true} is VALID [2018-11-23 12:29:29,616 INFO L273 TraceCheckUtils]: 15: Hoare triple {5255#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5255#true} is VALID [2018-11-23 12:29:29,616 INFO L273 TraceCheckUtils]: 16: Hoare triple {5255#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5255#true} is VALID [2018-11-23 12:29:29,616 INFO L273 TraceCheckUtils]: 17: Hoare triple {5255#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5255#true} is VALID [2018-11-23 12:29:29,616 INFO L273 TraceCheckUtils]: 18: Hoare triple {5255#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5255#true} is VALID [2018-11-23 12:29:29,616 INFO L273 TraceCheckUtils]: 19: Hoare triple {5255#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5255#true} is VALID [2018-11-23 12:29:29,616 INFO L273 TraceCheckUtils]: 20: Hoare triple {5255#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5255#true} is VALID [2018-11-23 12:29:29,616 INFO L273 TraceCheckUtils]: 21: Hoare triple {5255#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5255#true} is VALID [2018-11-23 12:29:29,617 INFO L273 TraceCheckUtils]: 22: Hoare triple {5255#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5255#true} is VALID [2018-11-23 12:29:29,617 INFO L273 TraceCheckUtils]: 23: Hoare triple {5255#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5255#true} is VALID [2018-11-23 12:29:29,617 INFO L273 TraceCheckUtils]: 24: Hoare triple {5255#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5255#true} is VALID [2018-11-23 12:29:29,617 INFO L273 TraceCheckUtils]: 25: Hoare triple {5255#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5255#true} is VALID [2018-11-23 12:29:29,617 INFO L273 TraceCheckUtils]: 26: Hoare triple {5255#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5255#true} is VALID [2018-11-23 12:29:29,617 INFO L273 TraceCheckUtils]: 27: Hoare triple {5255#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5255#true} is VALID [2018-11-23 12:29:29,617 INFO L273 TraceCheckUtils]: 28: Hoare triple {5255#true} assume !(~i~1 < 100000); {5255#true} is VALID [2018-11-23 12:29:29,617 INFO L256 TraceCheckUtils]: 29: Hoare triple {5255#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {5255#true} is VALID [2018-11-23 12:29:29,618 INFO L273 TraceCheckUtils]: 30: Hoare triple {5255#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5362#(<= xor_~i~0 1)} is VALID [2018-11-23 12:29:29,618 INFO L273 TraceCheckUtils]: 31: Hoare triple {5362#(<= xor_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5362#(<= xor_~i~0 1)} is VALID [2018-11-23 12:29:29,619 INFO L273 TraceCheckUtils]: 32: Hoare triple {5362#(<= xor_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5369#(<= xor_~i~0 2)} is VALID [2018-11-23 12:29:29,619 INFO L273 TraceCheckUtils]: 33: Hoare triple {5369#(<= xor_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5369#(<= xor_~i~0 2)} is VALID [2018-11-23 12:29:29,620 INFO L273 TraceCheckUtils]: 34: Hoare triple {5369#(<= xor_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5376#(<= xor_~i~0 3)} is VALID [2018-11-23 12:29:29,620 INFO L273 TraceCheckUtils]: 35: Hoare triple {5376#(<= xor_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5376#(<= xor_~i~0 3)} is VALID [2018-11-23 12:29:29,620 INFO L273 TraceCheckUtils]: 36: Hoare triple {5376#(<= xor_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5383#(<= xor_~i~0 4)} is VALID [2018-11-23 12:29:29,621 INFO L273 TraceCheckUtils]: 37: Hoare triple {5383#(<= xor_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5383#(<= xor_~i~0 4)} is VALID [2018-11-23 12:29:29,621 INFO L273 TraceCheckUtils]: 38: Hoare triple {5383#(<= xor_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5390#(<= xor_~i~0 5)} is VALID [2018-11-23 12:29:29,622 INFO L273 TraceCheckUtils]: 39: Hoare triple {5390#(<= xor_~i~0 5)} assume !(~i~0 < 100000); {5256#false} is VALID [2018-11-23 12:29:29,622 INFO L273 TraceCheckUtils]: 40: Hoare triple {5256#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5256#false} is VALID [2018-11-23 12:29:29,622 INFO L273 TraceCheckUtils]: 41: Hoare triple {5256#false} assume true; {5256#false} is VALID [2018-11-23 12:29:29,623 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {5256#false} {5255#true} #70#return; {5256#false} is VALID [2018-11-23 12:29:29,623 INFO L273 TraceCheckUtils]: 43: Hoare triple {5256#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {5256#false} is VALID [2018-11-23 12:29:29,623 INFO L256 TraceCheckUtils]: 44: Hoare triple {5256#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {5256#false} is VALID [2018-11-23 12:29:29,623 INFO L273 TraceCheckUtils]: 45: Hoare triple {5256#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5256#false} is VALID [2018-11-23 12:29:29,623 INFO L273 TraceCheckUtils]: 46: Hoare triple {5256#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5256#false} is VALID [2018-11-23 12:29:29,624 INFO L273 TraceCheckUtils]: 47: Hoare triple {5256#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5256#false} is VALID [2018-11-23 12:29:29,624 INFO L273 TraceCheckUtils]: 48: Hoare triple {5256#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5256#false} is VALID [2018-11-23 12:29:29,624 INFO L273 TraceCheckUtils]: 49: Hoare triple {5256#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5256#false} is VALID [2018-11-23 12:29:29,624 INFO L273 TraceCheckUtils]: 50: Hoare triple {5256#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5256#false} is VALID [2018-11-23 12:29:29,625 INFO L273 TraceCheckUtils]: 51: Hoare triple {5256#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5256#false} is VALID [2018-11-23 12:29:29,625 INFO L273 TraceCheckUtils]: 52: Hoare triple {5256#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5256#false} is VALID [2018-11-23 12:29:29,625 INFO L273 TraceCheckUtils]: 53: Hoare triple {5256#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5256#false} is VALID [2018-11-23 12:29:29,625 INFO L273 TraceCheckUtils]: 54: Hoare triple {5256#false} assume !(~i~0 < 100000); {5256#false} is VALID [2018-11-23 12:29:29,625 INFO L273 TraceCheckUtils]: 55: Hoare triple {5256#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5256#false} is VALID [2018-11-23 12:29:29,626 INFO L273 TraceCheckUtils]: 56: Hoare triple {5256#false} assume true; {5256#false} is VALID [2018-11-23 12:29:29,626 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {5256#false} {5256#false} #72#return; {5256#false} is VALID [2018-11-23 12:29:29,626 INFO L273 TraceCheckUtils]: 58: Hoare triple {5256#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {5256#false} is VALID [2018-11-23 12:29:29,626 INFO L273 TraceCheckUtils]: 59: Hoare triple {5256#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {5256#false} is VALID [2018-11-23 12:29:29,626 INFO L273 TraceCheckUtils]: 60: Hoare triple {5256#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {5256#false} is VALID [2018-11-23 12:29:29,626 INFO L273 TraceCheckUtils]: 61: Hoare triple {5256#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {5256#false} is VALID [2018-11-23 12:29:29,626 INFO L273 TraceCheckUtils]: 62: Hoare triple {5256#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {5256#false} is VALID [2018-11-23 12:29:29,627 INFO L273 TraceCheckUtils]: 63: Hoare triple {5256#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {5256#false} is VALID [2018-11-23 12:29:29,627 INFO L273 TraceCheckUtils]: 64: Hoare triple {5256#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {5256#false} is VALID [2018-11-23 12:29:29,627 INFO L273 TraceCheckUtils]: 65: Hoare triple {5256#false} assume !(~i~2 < 99999); {5256#false} is VALID [2018-11-23 12:29:29,627 INFO L273 TraceCheckUtils]: 66: Hoare triple {5256#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {5256#false} is VALID [2018-11-23 12:29:29,627 INFO L256 TraceCheckUtils]: 67: Hoare triple {5256#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {5256#false} is VALID [2018-11-23 12:29:29,627 INFO L273 TraceCheckUtils]: 68: Hoare triple {5256#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5256#false} is VALID [2018-11-23 12:29:29,627 INFO L273 TraceCheckUtils]: 69: Hoare triple {5256#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5256#false} is VALID [2018-11-23 12:29:29,627 INFO L273 TraceCheckUtils]: 70: Hoare triple {5256#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5256#false} is VALID [2018-11-23 12:29:29,628 INFO L273 TraceCheckUtils]: 71: Hoare triple {5256#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5256#false} is VALID [2018-11-23 12:29:29,628 INFO L273 TraceCheckUtils]: 72: Hoare triple {5256#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5256#false} is VALID [2018-11-23 12:29:29,628 INFO L273 TraceCheckUtils]: 73: Hoare triple {5256#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5256#false} is VALID [2018-11-23 12:29:29,628 INFO L273 TraceCheckUtils]: 74: Hoare triple {5256#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5256#false} is VALID [2018-11-23 12:29:29,628 INFO L273 TraceCheckUtils]: 75: Hoare triple {5256#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5256#false} is VALID [2018-11-23 12:29:29,628 INFO L273 TraceCheckUtils]: 76: Hoare triple {5256#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5256#false} is VALID [2018-11-23 12:29:29,628 INFO L273 TraceCheckUtils]: 77: Hoare triple {5256#false} assume !(~i~0 < 100000); {5256#false} is VALID [2018-11-23 12:29:29,628 INFO L273 TraceCheckUtils]: 78: Hoare triple {5256#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5256#false} is VALID [2018-11-23 12:29:29,628 INFO L273 TraceCheckUtils]: 79: Hoare triple {5256#false} assume true; {5256#false} is VALID [2018-11-23 12:29:29,629 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {5256#false} {5256#false} #74#return; {5256#false} is VALID [2018-11-23 12:29:29,629 INFO L273 TraceCheckUtils]: 81: Hoare triple {5256#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {5256#false} is VALID [2018-11-23 12:29:29,629 INFO L273 TraceCheckUtils]: 82: Hoare triple {5256#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {5256#false} is VALID [2018-11-23 12:29:29,629 INFO L273 TraceCheckUtils]: 83: Hoare triple {5256#false} assume !false; {5256#false} is VALID [2018-11-23 12:29:29,632 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 84 proven. 16 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2018-11-23 12:29:29,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:29:29,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 19 [2018-11-23 12:29:29,652 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 84 [2018-11-23 12:29:29,653 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:29:29,653 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 12:29:29,728 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 12:29:29,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 12:29:29,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 12:29:29,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:29:29,730 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 19 states. [2018-11-23 12:29:30,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:30,216 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2018-11-23 12:29:30,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:29:30,216 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 84 [2018-11-23 12:29:30,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:30,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:29:30,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 90 transitions. [2018-11-23 12:29:30,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:29:30,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 90 transitions. [2018-11-23 12:29:30,220 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 90 transitions. [2018-11-23 12:29:31,085 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 12:29:31,087 INFO L225 Difference]: With dead ends: 95 [2018-11-23 12:29:31,087 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 12:29:31,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:29:31,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 12:29:31,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-11-23 12:29:31,119 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:31,119 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 63 states. [2018-11-23 12:29:31,119 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 63 states. [2018-11-23 12:29:31,120 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 63 states. [2018-11-23 12:29:31,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:31,123 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-11-23 12:29:31,123 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-11-23 12:29:31,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:31,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:31,123 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 65 states. [2018-11-23 12:29:31,124 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 65 states. [2018-11-23 12:29:31,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:31,126 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-11-23 12:29:31,126 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-11-23 12:29:31,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:31,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:31,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:31,127 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:31,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 12:29:31,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-11-23 12:29:31,129 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 84 [2018-11-23 12:29:31,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:31,129 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-11-23 12:29:31,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 12:29:31,129 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-11-23 12:29:31,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-23 12:29:31,130 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:31,131 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:29:31,131 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:31,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:31,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1658502451, now seen corresponding path program 12 times [2018-11-23 12:29:31,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:31,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:31,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:31,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:29:31,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:31,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:32,614 INFO L256 TraceCheckUtils]: 0: Hoare triple {5888#true} call ULTIMATE.init(); {5888#true} is VALID [2018-11-23 12:29:32,614 INFO L273 TraceCheckUtils]: 1: Hoare triple {5888#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5888#true} is VALID [2018-11-23 12:29:32,614 INFO L273 TraceCheckUtils]: 2: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:29:32,615 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5888#true} {5888#true} #66#return; {5888#true} is VALID [2018-11-23 12:29:32,615 INFO L256 TraceCheckUtils]: 4: Hoare triple {5888#true} call #t~ret13 := main(); {5888#true} is VALID [2018-11-23 12:29:32,615 INFO L273 TraceCheckUtils]: 5: Hoare triple {5888#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5890#(= main_~i~1 0)} is VALID [2018-11-23 12:29:32,616 INFO L273 TraceCheckUtils]: 6: Hoare triple {5890#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5890#(= main_~i~1 0)} is VALID [2018-11-23 12:29:32,617 INFO L273 TraceCheckUtils]: 7: Hoare triple {5890#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5891#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:32,617 INFO L273 TraceCheckUtils]: 8: Hoare triple {5891#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5891#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:32,618 INFO L273 TraceCheckUtils]: 9: Hoare triple {5891#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5892#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:32,619 INFO L273 TraceCheckUtils]: 10: Hoare triple {5892#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5892#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:32,619 INFO L273 TraceCheckUtils]: 11: Hoare triple {5892#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5893#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:32,621 INFO L273 TraceCheckUtils]: 12: Hoare triple {5893#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5893#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:32,622 INFO L273 TraceCheckUtils]: 13: Hoare triple {5893#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5894#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:32,623 INFO L273 TraceCheckUtils]: 14: Hoare triple {5894#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5894#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:32,623 INFO L273 TraceCheckUtils]: 15: Hoare triple {5894#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5895#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:32,624 INFO L273 TraceCheckUtils]: 16: Hoare triple {5895#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5895#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:32,625 INFO L273 TraceCheckUtils]: 17: Hoare triple {5895#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5896#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:32,625 INFO L273 TraceCheckUtils]: 18: Hoare triple {5896#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5896#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:32,626 INFO L273 TraceCheckUtils]: 19: Hoare triple {5896#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5897#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:32,627 INFO L273 TraceCheckUtils]: 20: Hoare triple {5897#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5897#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:32,627 INFO L273 TraceCheckUtils]: 21: Hoare triple {5897#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5898#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:32,628 INFO L273 TraceCheckUtils]: 22: Hoare triple {5898#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5898#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:32,629 INFO L273 TraceCheckUtils]: 23: Hoare triple {5898#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5899#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:32,629 INFO L273 TraceCheckUtils]: 24: Hoare triple {5899#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5899#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:32,630 INFO L273 TraceCheckUtils]: 25: Hoare triple {5899#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5900#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:32,631 INFO L273 TraceCheckUtils]: 26: Hoare triple {5900#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5900#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:32,631 INFO L273 TraceCheckUtils]: 27: Hoare triple {5900#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5901#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:32,632 INFO L273 TraceCheckUtils]: 28: Hoare triple {5901#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5901#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:32,633 INFO L273 TraceCheckUtils]: 29: Hoare triple {5901#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5902#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:32,633 INFO L273 TraceCheckUtils]: 30: Hoare triple {5902#(<= main_~i~1 12)} assume !(~i~1 < 100000); {5889#false} is VALID [2018-11-23 12:29:32,634 INFO L256 TraceCheckUtils]: 31: Hoare triple {5889#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {5888#true} is VALID [2018-11-23 12:29:32,634 INFO L273 TraceCheckUtils]: 32: Hoare triple {5888#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5888#true} is VALID [2018-11-23 12:29:32,634 INFO L273 TraceCheckUtils]: 33: Hoare triple {5888#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:29:32,634 INFO L273 TraceCheckUtils]: 34: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:29:32,635 INFO L273 TraceCheckUtils]: 35: Hoare triple {5888#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:29:32,635 INFO L273 TraceCheckUtils]: 36: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:29:32,635 INFO L273 TraceCheckUtils]: 37: Hoare triple {5888#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:29:32,635 INFO L273 TraceCheckUtils]: 38: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:29:32,635 INFO L273 TraceCheckUtils]: 39: Hoare triple {5888#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:29:32,636 INFO L273 TraceCheckUtils]: 40: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:29:32,636 INFO L273 TraceCheckUtils]: 41: Hoare triple {5888#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:29:32,636 INFO L273 TraceCheckUtils]: 42: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:29:32,636 INFO L273 TraceCheckUtils]: 43: Hoare triple {5888#true} assume !(~i~0 < 100000); {5888#true} is VALID [2018-11-23 12:29:32,636 INFO L273 TraceCheckUtils]: 44: Hoare triple {5888#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5888#true} is VALID [2018-11-23 12:29:32,637 INFO L273 TraceCheckUtils]: 45: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:29:32,637 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {5888#true} {5889#false} #70#return; {5889#false} is VALID [2018-11-23 12:29:32,637 INFO L273 TraceCheckUtils]: 47: Hoare triple {5889#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {5889#false} is VALID [2018-11-23 12:29:32,637 INFO L256 TraceCheckUtils]: 48: Hoare triple {5889#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {5888#true} is VALID [2018-11-23 12:29:32,637 INFO L273 TraceCheckUtils]: 49: Hoare triple {5888#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5888#true} is VALID [2018-11-23 12:29:32,637 INFO L273 TraceCheckUtils]: 50: Hoare triple {5888#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:29:32,637 INFO L273 TraceCheckUtils]: 51: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:29:32,638 INFO L273 TraceCheckUtils]: 52: Hoare triple {5888#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:29:32,638 INFO L273 TraceCheckUtils]: 53: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:29:32,638 INFO L273 TraceCheckUtils]: 54: Hoare triple {5888#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:29:32,638 INFO L273 TraceCheckUtils]: 55: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:29:32,638 INFO L273 TraceCheckUtils]: 56: Hoare triple {5888#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:29:32,638 INFO L273 TraceCheckUtils]: 57: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:29:32,638 INFO L273 TraceCheckUtils]: 58: Hoare triple {5888#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:29:32,638 INFO L273 TraceCheckUtils]: 59: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:29:32,638 INFO L273 TraceCheckUtils]: 60: Hoare triple {5888#true} assume !(~i~0 < 100000); {5888#true} is VALID [2018-11-23 12:29:32,639 INFO L273 TraceCheckUtils]: 61: Hoare triple {5888#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5888#true} is VALID [2018-11-23 12:29:32,639 INFO L273 TraceCheckUtils]: 62: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:29:32,639 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {5888#true} {5889#false} #72#return; {5889#false} is VALID [2018-11-23 12:29:32,639 INFO L273 TraceCheckUtils]: 64: Hoare triple {5889#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {5889#false} is VALID [2018-11-23 12:29:32,639 INFO L273 TraceCheckUtils]: 65: Hoare triple {5889#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {5889#false} is VALID [2018-11-23 12:29:32,639 INFO L273 TraceCheckUtils]: 66: Hoare triple {5889#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {5889#false} is VALID [2018-11-23 12:29:32,639 INFO L273 TraceCheckUtils]: 67: Hoare triple {5889#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {5889#false} is VALID [2018-11-23 12:29:32,639 INFO L273 TraceCheckUtils]: 68: Hoare triple {5889#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {5889#false} is VALID [2018-11-23 12:29:32,640 INFO L273 TraceCheckUtils]: 69: Hoare triple {5889#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {5889#false} is VALID [2018-11-23 12:29:32,640 INFO L273 TraceCheckUtils]: 70: Hoare triple {5889#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {5889#false} is VALID [2018-11-23 12:29:32,640 INFO L273 TraceCheckUtils]: 71: Hoare triple {5889#false} assume !(~i~2 < 99999); {5889#false} is VALID [2018-11-23 12:29:32,640 INFO L273 TraceCheckUtils]: 72: Hoare triple {5889#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {5889#false} is VALID [2018-11-23 12:29:32,640 INFO L256 TraceCheckUtils]: 73: Hoare triple {5889#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {5888#true} is VALID [2018-11-23 12:29:32,640 INFO L273 TraceCheckUtils]: 74: Hoare triple {5888#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5888#true} is VALID [2018-11-23 12:29:32,640 INFO L273 TraceCheckUtils]: 75: Hoare triple {5888#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:29:32,640 INFO L273 TraceCheckUtils]: 76: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:29:32,641 INFO L273 TraceCheckUtils]: 77: Hoare triple {5888#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:29:32,641 INFO L273 TraceCheckUtils]: 78: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:29:32,641 INFO L273 TraceCheckUtils]: 79: Hoare triple {5888#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:29:32,641 INFO L273 TraceCheckUtils]: 80: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:29:32,641 INFO L273 TraceCheckUtils]: 81: Hoare triple {5888#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:29:32,641 INFO L273 TraceCheckUtils]: 82: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:29:32,641 INFO L273 TraceCheckUtils]: 83: Hoare triple {5888#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:29:32,641 INFO L273 TraceCheckUtils]: 84: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:29:32,642 INFO L273 TraceCheckUtils]: 85: Hoare triple {5888#true} assume !(~i~0 < 100000); {5888#true} is VALID [2018-11-23 12:29:32,642 INFO L273 TraceCheckUtils]: 86: Hoare triple {5888#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5888#true} is VALID [2018-11-23 12:29:32,642 INFO L273 TraceCheckUtils]: 87: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:29:32,642 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {5888#true} {5889#false} #74#return; {5889#false} is VALID [2018-11-23 12:29:32,642 INFO L273 TraceCheckUtils]: 89: Hoare triple {5889#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {5889#false} is VALID [2018-11-23 12:29:32,642 INFO L273 TraceCheckUtils]: 90: Hoare triple {5889#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {5889#false} is VALID [2018-11-23 12:29:32,642 INFO L273 TraceCheckUtils]: 91: Hoare triple {5889#false} assume !false; {5889#false} is VALID [2018-11-23 12:29:32,646 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2018-11-23 12:29:32,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:29:32,647 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 12:29:32,657 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:29:32,790 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-11-23 12:29:32,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:29:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:32,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:29:33,024 INFO L256 TraceCheckUtils]: 0: Hoare triple {5888#true} call ULTIMATE.init(); {5888#true} is VALID [2018-11-23 12:29:33,024 INFO L273 TraceCheckUtils]: 1: Hoare triple {5888#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5888#true} is VALID [2018-11-23 12:29:33,024 INFO L273 TraceCheckUtils]: 2: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:29:33,024 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5888#true} {5888#true} #66#return; {5888#true} is VALID [2018-11-23 12:29:33,024 INFO L256 TraceCheckUtils]: 4: Hoare triple {5888#true} call #t~ret13 := main(); {5888#true} is VALID [2018-11-23 12:29:33,025 INFO L273 TraceCheckUtils]: 5: Hoare triple {5888#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5888#true} is VALID [2018-11-23 12:29:33,025 INFO L273 TraceCheckUtils]: 6: Hoare triple {5888#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5888#true} is VALID [2018-11-23 12:29:33,025 INFO L273 TraceCheckUtils]: 7: Hoare triple {5888#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5888#true} is VALID [2018-11-23 12:29:33,025 INFO L273 TraceCheckUtils]: 8: Hoare triple {5888#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5888#true} is VALID [2018-11-23 12:29:33,025 INFO L273 TraceCheckUtils]: 9: Hoare triple {5888#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5888#true} is VALID [2018-11-23 12:29:33,025 INFO L273 TraceCheckUtils]: 10: Hoare triple {5888#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5888#true} is VALID [2018-11-23 12:29:33,025 INFO L273 TraceCheckUtils]: 11: Hoare triple {5888#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5888#true} is VALID [2018-11-23 12:29:33,025 INFO L273 TraceCheckUtils]: 12: Hoare triple {5888#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5888#true} is VALID [2018-11-23 12:29:33,025 INFO L273 TraceCheckUtils]: 13: Hoare triple {5888#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5888#true} is VALID [2018-11-23 12:29:33,026 INFO L273 TraceCheckUtils]: 14: Hoare triple {5888#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5888#true} is VALID [2018-11-23 12:29:33,026 INFO L273 TraceCheckUtils]: 15: Hoare triple {5888#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5888#true} is VALID [2018-11-23 12:29:33,026 INFO L273 TraceCheckUtils]: 16: Hoare triple {5888#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5888#true} is VALID [2018-11-23 12:29:33,026 INFO L273 TraceCheckUtils]: 17: Hoare triple {5888#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5888#true} is VALID [2018-11-23 12:29:33,026 INFO L273 TraceCheckUtils]: 18: Hoare triple {5888#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5888#true} is VALID [2018-11-23 12:29:33,026 INFO L273 TraceCheckUtils]: 19: Hoare triple {5888#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5888#true} is VALID [2018-11-23 12:29:33,026 INFO L273 TraceCheckUtils]: 20: Hoare triple {5888#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5888#true} is VALID [2018-11-23 12:29:33,026 INFO L273 TraceCheckUtils]: 21: Hoare triple {5888#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5888#true} is VALID [2018-11-23 12:29:33,027 INFO L273 TraceCheckUtils]: 22: Hoare triple {5888#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5888#true} is VALID [2018-11-23 12:29:33,027 INFO L273 TraceCheckUtils]: 23: Hoare triple {5888#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5888#true} is VALID [2018-11-23 12:29:33,027 INFO L273 TraceCheckUtils]: 24: Hoare triple {5888#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5888#true} is VALID [2018-11-23 12:29:33,027 INFO L273 TraceCheckUtils]: 25: Hoare triple {5888#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5888#true} is VALID [2018-11-23 12:29:33,027 INFO L273 TraceCheckUtils]: 26: Hoare triple {5888#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5888#true} is VALID [2018-11-23 12:29:33,027 INFO L273 TraceCheckUtils]: 27: Hoare triple {5888#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5888#true} is VALID [2018-11-23 12:29:33,027 INFO L273 TraceCheckUtils]: 28: Hoare triple {5888#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5888#true} is VALID [2018-11-23 12:29:33,027 INFO L273 TraceCheckUtils]: 29: Hoare triple {5888#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5888#true} is VALID [2018-11-23 12:29:33,028 INFO L273 TraceCheckUtils]: 30: Hoare triple {5888#true} assume !(~i~1 < 100000); {5888#true} is VALID [2018-11-23 12:29:33,028 INFO L256 TraceCheckUtils]: 31: Hoare triple {5888#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {5888#true} is VALID [2018-11-23 12:29:33,028 INFO L273 TraceCheckUtils]: 32: Hoare triple {5888#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5888#true} is VALID [2018-11-23 12:29:33,028 INFO L273 TraceCheckUtils]: 33: Hoare triple {5888#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:29:33,028 INFO L273 TraceCheckUtils]: 34: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:29:33,028 INFO L273 TraceCheckUtils]: 35: Hoare triple {5888#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:29:33,028 INFO L273 TraceCheckUtils]: 36: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:29:33,028 INFO L273 TraceCheckUtils]: 37: Hoare triple {5888#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:29:33,029 INFO L273 TraceCheckUtils]: 38: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:29:33,029 INFO L273 TraceCheckUtils]: 39: Hoare triple {5888#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:29:33,029 INFO L273 TraceCheckUtils]: 40: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:29:33,029 INFO L273 TraceCheckUtils]: 41: Hoare triple {5888#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:29:33,029 INFO L273 TraceCheckUtils]: 42: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:29:33,029 INFO L273 TraceCheckUtils]: 43: Hoare triple {5888#true} assume !(~i~0 < 100000); {5888#true} is VALID [2018-11-23 12:29:33,029 INFO L273 TraceCheckUtils]: 44: Hoare triple {5888#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5888#true} is VALID [2018-11-23 12:29:33,029 INFO L273 TraceCheckUtils]: 45: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:29:33,029 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {5888#true} {5888#true} #70#return; {5888#true} is VALID [2018-11-23 12:29:33,030 INFO L273 TraceCheckUtils]: 47: Hoare triple {5888#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {5888#true} is VALID [2018-11-23 12:29:33,030 INFO L256 TraceCheckUtils]: 48: Hoare triple {5888#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {5888#true} is VALID [2018-11-23 12:29:33,030 INFO L273 TraceCheckUtils]: 49: Hoare triple {5888#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5888#true} is VALID [2018-11-23 12:29:33,030 INFO L273 TraceCheckUtils]: 50: Hoare triple {5888#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:29:33,030 INFO L273 TraceCheckUtils]: 51: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:29:33,030 INFO L273 TraceCheckUtils]: 52: Hoare triple {5888#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:29:33,030 INFO L273 TraceCheckUtils]: 53: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:29:33,030 INFO L273 TraceCheckUtils]: 54: Hoare triple {5888#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:29:33,031 INFO L273 TraceCheckUtils]: 55: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:29:33,031 INFO L273 TraceCheckUtils]: 56: Hoare triple {5888#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:29:33,031 INFO L273 TraceCheckUtils]: 57: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:29:33,031 INFO L273 TraceCheckUtils]: 58: Hoare triple {5888#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:29:33,031 INFO L273 TraceCheckUtils]: 59: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:29:33,031 INFO L273 TraceCheckUtils]: 60: Hoare triple {5888#true} assume !(~i~0 < 100000); {5888#true} is VALID [2018-11-23 12:29:33,031 INFO L273 TraceCheckUtils]: 61: Hoare triple {5888#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5888#true} is VALID [2018-11-23 12:29:33,031 INFO L273 TraceCheckUtils]: 62: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:29:33,031 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {5888#true} {5888#true} #72#return; {5888#true} is VALID [2018-11-23 12:29:33,032 INFO L273 TraceCheckUtils]: 64: Hoare triple {5888#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {6098#(<= main_~i~2 0)} is VALID [2018-11-23 12:29:33,033 INFO L273 TraceCheckUtils]: 65: Hoare triple {6098#(<= main_~i~2 0)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {6098#(<= main_~i~2 0)} is VALID [2018-11-23 12:29:33,033 INFO L273 TraceCheckUtils]: 66: Hoare triple {6098#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {6105#(<= main_~i~2 1)} is VALID [2018-11-23 12:29:33,033 INFO L273 TraceCheckUtils]: 67: Hoare triple {6105#(<= main_~i~2 1)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {6105#(<= main_~i~2 1)} is VALID [2018-11-23 12:29:33,034 INFO L273 TraceCheckUtils]: 68: Hoare triple {6105#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {6112#(<= main_~i~2 2)} is VALID [2018-11-23 12:29:33,035 INFO L273 TraceCheckUtils]: 69: Hoare triple {6112#(<= main_~i~2 2)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {6112#(<= main_~i~2 2)} is VALID [2018-11-23 12:29:33,035 INFO L273 TraceCheckUtils]: 70: Hoare triple {6112#(<= main_~i~2 2)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {6119#(<= main_~i~2 3)} is VALID [2018-11-23 12:29:33,036 INFO L273 TraceCheckUtils]: 71: Hoare triple {6119#(<= main_~i~2 3)} assume !(~i~2 < 99999); {5889#false} is VALID [2018-11-23 12:29:33,036 INFO L273 TraceCheckUtils]: 72: Hoare triple {5889#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {5889#false} is VALID [2018-11-23 12:29:33,037 INFO L256 TraceCheckUtils]: 73: Hoare triple {5889#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {5889#false} is VALID [2018-11-23 12:29:33,037 INFO L273 TraceCheckUtils]: 74: Hoare triple {5889#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5889#false} is VALID [2018-11-23 12:29:33,037 INFO L273 TraceCheckUtils]: 75: Hoare triple {5889#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5889#false} is VALID [2018-11-23 12:29:33,037 INFO L273 TraceCheckUtils]: 76: Hoare triple {5889#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5889#false} is VALID [2018-11-23 12:29:33,037 INFO L273 TraceCheckUtils]: 77: Hoare triple {5889#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5889#false} is VALID [2018-11-23 12:29:33,038 INFO L273 TraceCheckUtils]: 78: Hoare triple {5889#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5889#false} is VALID [2018-11-23 12:29:33,038 INFO L273 TraceCheckUtils]: 79: Hoare triple {5889#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5889#false} is VALID [2018-11-23 12:29:33,038 INFO L273 TraceCheckUtils]: 80: Hoare triple {5889#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5889#false} is VALID [2018-11-23 12:29:33,038 INFO L273 TraceCheckUtils]: 81: Hoare triple {5889#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5889#false} is VALID [2018-11-23 12:29:33,039 INFO L273 TraceCheckUtils]: 82: Hoare triple {5889#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5889#false} is VALID [2018-11-23 12:29:33,039 INFO L273 TraceCheckUtils]: 83: Hoare triple {5889#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5889#false} is VALID [2018-11-23 12:29:33,039 INFO L273 TraceCheckUtils]: 84: Hoare triple {5889#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5889#false} is VALID [2018-11-23 12:29:33,039 INFO L273 TraceCheckUtils]: 85: Hoare triple {5889#false} assume !(~i~0 < 100000); {5889#false} is VALID [2018-11-23 12:29:33,039 INFO L273 TraceCheckUtils]: 86: Hoare triple {5889#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5889#false} is VALID [2018-11-23 12:29:33,040 INFO L273 TraceCheckUtils]: 87: Hoare triple {5889#false} assume true; {5889#false} is VALID [2018-11-23 12:29:33,040 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {5889#false} {5889#false} #74#return; {5889#false} is VALID [2018-11-23 12:29:33,040 INFO L273 TraceCheckUtils]: 89: Hoare triple {5889#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {5889#false} is VALID [2018-11-23 12:29:33,040 INFO L273 TraceCheckUtils]: 90: Hoare triple {5889#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {5889#false} is VALID [2018-11-23 12:29:33,040 INFO L273 TraceCheckUtils]: 91: Hoare triple {5889#false} assume !false; {5889#false} is VALID [2018-11-23 12:29:33,044 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 130 proven. 9 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2018-11-23 12:29:33,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:29:33,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6] total 19 [2018-11-23 12:29:33,066 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2018-11-23 12:29:33,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:29:33,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 12:29:33,148 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 12:29:33,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 12:29:33,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 12:29:33,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:29:33,150 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 19 states. [2018-11-23 12:29:33,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:33,764 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2018-11-23 12:29:33,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:29:33,764 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2018-11-23 12:29:33,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:33,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:29:33,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 87 transitions. [2018-11-23 12:29:33,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:29:33,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 87 transitions. [2018-11-23 12:29:33,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 87 transitions. [2018-11-23 12:29:34,227 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 12:29:34,229 INFO L225 Difference]: With dead ends: 101 [2018-11-23 12:29:34,229 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 12:29:34,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:29:34,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 12:29:34,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-11-23 12:29:34,254 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:34,255 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 67 states. [2018-11-23 12:29:34,255 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 67 states. [2018-11-23 12:29:34,255 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 67 states. [2018-11-23 12:29:34,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:34,257 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-23 12:29:34,257 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-23 12:29:34,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:34,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:34,258 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 69 states. [2018-11-23 12:29:34,258 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 69 states. [2018-11-23 12:29:34,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:34,260 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-23 12:29:34,260 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-23 12:29:34,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:34,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:34,261 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:34,261 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:34,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 12:29:34,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-11-23 12:29:34,263 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 92 [2018-11-23 12:29:34,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:34,263 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-11-23 12:29:34,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 12:29:34,264 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-23 12:29:34,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-23 12:29:34,265 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:34,265 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 13, 13, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:29:34,265 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:34,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:34,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1949368429, now seen corresponding path program 13 times [2018-11-23 12:29:34,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:34,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:34,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:34,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:29:34,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:34,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:35,253 INFO L256 TraceCheckUtils]: 0: Hoare triple {6568#true} call ULTIMATE.init(); {6568#true} is VALID [2018-11-23 12:29:35,253 INFO L273 TraceCheckUtils]: 1: Hoare triple {6568#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6568#true} is VALID [2018-11-23 12:29:35,253 INFO L273 TraceCheckUtils]: 2: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:29:35,254 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6568#true} {6568#true} #66#return; {6568#true} is VALID [2018-11-23 12:29:35,254 INFO L256 TraceCheckUtils]: 4: Hoare triple {6568#true} call #t~ret13 := main(); {6568#true} is VALID [2018-11-23 12:29:35,254 INFO L273 TraceCheckUtils]: 5: Hoare triple {6568#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {6570#(= main_~i~1 0)} is VALID [2018-11-23 12:29:35,255 INFO L273 TraceCheckUtils]: 6: Hoare triple {6570#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6570#(= main_~i~1 0)} is VALID [2018-11-23 12:29:35,256 INFO L273 TraceCheckUtils]: 7: Hoare triple {6570#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6571#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:35,256 INFO L273 TraceCheckUtils]: 8: Hoare triple {6571#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6571#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:35,257 INFO L273 TraceCheckUtils]: 9: Hoare triple {6571#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6572#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:35,258 INFO L273 TraceCheckUtils]: 10: Hoare triple {6572#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6572#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:35,258 INFO L273 TraceCheckUtils]: 11: Hoare triple {6572#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6573#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:35,259 INFO L273 TraceCheckUtils]: 12: Hoare triple {6573#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6573#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:35,260 INFO L273 TraceCheckUtils]: 13: Hoare triple {6573#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6574#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:35,260 INFO L273 TraceCheckUtils]: 14: Hoare triple {6574#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6574#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:35,261 INFO L273 TraceCheckUtils]: 15: Hoare triple {6574#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6575#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:35,262 INFO L273 TraceCheckUtils]: 16: Hoare triple {6575#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6575#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:35,262 INFO L273 TraceCheckUtils]: 17: Hoare triple {6575#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6576#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:35,263 INFO L273 TraceCheckUtils]: 18: Hoare triple {6576#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6576#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:35,264 INFO L273 TraceCheckUtils]: 19: Hoare triple {6576#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6577#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:35,264 INFO L273 TraceCheckUtils]: 20: Hoare triple {6577#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6577#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:35,265 INFO L273 TraceCheckUtils]: 21: Hoare triple {6577#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6578#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:35,266 INFO L273 TraceCheckUtils]: 22: Hoare triple {6578#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6578#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:35,266 INFO L273 TraceCheckUtils]: 23: Hoare triple {6578#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6579#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:35,267 INFO L273 TraceCheckUtils]: 24: Hoare triple {6579#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6579#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:35,268 INFO L273 TraceCheckUtils]: 25: Hoare triple {6579#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6580#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:35,268 INFO L273 TraceCheckUtils]: 26: Hoare triple {6580#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6580#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:35,269 INFO L273 TraceCheckUtils]: 27: Hoare triple {6580#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6581#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:35,270 INFO L273 TraceCheckUtils]: 28: Hoare triple {6581#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6581#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:35,270 INFO L273 TraceCheckUtils]: 29: Hoare triple {6581#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6582#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:35,271 INFO L273 TraceCheckUtils]: 30: Hoare triple {6582#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6582#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:35,272 INFO L273 TraceCheckUtils]: 31: Hoare triple {6582#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6583#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:35,272 INFO L273 TraceCheckUtils]: 32: Hoare triple {6583#(<= main_~i~1 13)} assume !(~i~1 < 100000); {6569#false} is VALID [2018-11-23 12:29:35,273 INFO L256 TraceCheckUtils]: 33: Hoare triple {6569#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {6568#true} is VALID [2018-11-23 12:29:35,273 INFO L273 TraceCheckUtils]: 34: Hoare triple {6568#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {6568#true} is VALID [2018-11-23 12:29:35,273 INFO L273 TraceCheckUtils]: 35: Hoare triple {6568#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:29:35,273 INFO L273 TraceCheckUtils]: 36: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:29:35,274 INFO L273 TraceCheckUtils]: 37: Hoare triple {6568#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:29:35,274 INFO L273 TraceCheckUtils]: 38: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:29:35,274 INFO L273 TraceCheckUtils]: 39: Hoare triple {6568#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:29:35,274 INFO L273 TraceCheckUtils]: 40: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:29:35,274 INFO L273 TraceCheckUtils]: 41: Hoare triple {6568#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:29:35,275 INFO L273 TraceCheckUtils]: 42: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:29:35,275 INFO L273 TraceCheckUtils]: 43: Hoare triple {6568#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:29:35,275 INFO L273 TraceCheckUtils]: 44: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:29:35,275 INFO L273 TraceCheckUtils]: 45: Hoare triple {6568#true} assume !(~i~0 < 100000); {6568#true} is VALID [2018-11-23 12:29:35,275 INFO L273 TraceCheckUtils]: 46: Hoare triple {6568#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6568#true} is VALID [2018-11-23 12:29:35,276 INFO L273 TraceCheckUtils]: 47: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:29:35,276 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {6568#true} {6569#false} #70#return; {6569#false} is VALID [2018-11-23 12:29:35,276 INFO L273 TraceCheckUtils]: 49: Hoare triple {6569#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {6569#false} is VALID [2018-11-23 12:29:35,276 INFO L256 TraceCheckUtils]: 50: Hoare triple {6569#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {6568#true} is VALID [2018-11-23 12:29:35,276 INFO L273 TraceCheckUtils]: 51: Hoare triple {6568#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {6568#true} is VALID [2018-11-23 12:29:35,277 INFO L273 TraceCheckUtils]: 52: Hoare triple {6568#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:29:35,277 INFO L273 TraceCheckUtils]: 53: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:29:35,277 INFO L273 TraceCheckUtils]: 54: Hoare triple {6568#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:29:35,277 INFO L273 TraceCheckUtils]: 55: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:29:35,277 INFO L273 TraceCheckUtils]: 56: Hoare triple {6568#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:29:35,278 INFO L273 TraceCheckUtils]: 57: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:29:35,278 INFO L273 TraceCheckUtils]: 58: Hoare triple {6568#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:29:35,278 INFO L273 TraceCheckUtils]: 59: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:29:35,278 INFO L273 TraceCheckUtils]: 60: Hoare triple {6568#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:29:35,278 INFO L273 TraceCheckUtils]: 61: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:29:35,278 INFO L273 TraceCheckUtils]: 62: Hoare triple {6568#true} assume !(~i~0 < 100000); {6568#true} is VALID [2018-11-23 12:29:35,278 INFO L273 TraceCheckUtils]: 63: Hoare triple {6568#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6568#true} is VALID [2018-11-23 12:29:35,279 INFO L273 TraceCheckUtils]: 64: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:29:35,279 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {6568#true} {6569#false} #72#return; {6569#false} is VALID [2018-11-23 12:29:35,279 INFO L273 TraceCheckUtils]: 66: Hoare triple {6569#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {6569#false} is VALID [2018-11-23 12:29:35,279 INFO L273 TraceCheckUtils]: 67: Hoare triple {6569#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {6569#false} is VALID [2018-11-23 12:29:35,279 INFO L273 TraceCheckUtils]: 68: Hoare triple {6569#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {6569#false} is VALID [2018-11-23 12:29:35,279 INFO L273 TraceCheckUtils]: 69: Hoare triple {6569#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {6569#false} is VALID [2018-11-23 12:29:35,279 INFO L273 TraceCheckUtils]: 70: Hoare triple {6569#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {6569#false} is VALID [2018-11-23 12:29:35,279 INFO L273 TraceCheckUtils]: 71: Hoare triple {6569#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {6569#false} is VALID [2018-11-23 12:29:35,279 INFO L273 TraceCheckUtils]: 72: Hoare triple {6569#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {6569#false} is VALID [2018-11-23 12:29:35,280 INFO L273 TraceCheckUtils]: 73: Hoare triple {6569#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {6569#false} is VALID [2018-11-23 12:29:35,280 INFO L273 TraceCheckUtils]: 74: Hoare triple {6569#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {6569#false} is VALID [2018-11-23 12:29:35,280 INFO L273 TraceCheckUtils]: 75: Hoare triple {6569#false} assume !(~i~2 < 99999); {6569#false} is VALID [2018-11-23 12:29:35,280 INFO L273 TraceCheckUtils]: 76: Hoare triple {6569#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {6569#false} is VALID [2018-11-23 12:29:35,280 INFO L256 TraceCheckUtils]: 77: Hoare triple {6569#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {6568#true} is VALID [2018-11-23 12:29:35,280 INFO L273 TraceCheckUtils]: 78: Hoare triple {6568#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {6568#true} is VALID [2018-11-23 12:29:35,280 INFO L273 TraceCheckUtils]: 79: Hoare triple {6568#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:29:35,280 INFO L273 TraceCheckUtils]: 80: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:29:35,281 INFO L273 TraceCheckUtils]: 81: Hoare triple {6568#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:29:35,281 INFO L273 TraceCheckUtils]: 82: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:29:35,281 INFO L273 TraceCheckUtils]: 83: Hoare triple {6568#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:29:35,281 INFO L273 TraceCheckUtils]: 84: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:29:35,281 INFO L273 TraceCheckUtils]: 85: Hoare triple {6568#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:29:35,281 INFO L273 TraceCheckUtils]: 86: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:29:35,281 INFO L273 TraceCheckUtils]: 87: Hoare triple {6568#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:29:35,281 INFO L273 TraceCheckUtils]: 88: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:29:35,282 INFO L273 TraceCheckUtils]: 89: Hoare triple {6568#true} assume !(~i~0 < 100000); {6568#true} is VALID [2018-11-23 12:29:35,282 INFO L273 TraceCheckUtils]: 90: Hoare triple {6568#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6568#true} is VALID [2018-11-23 12:29:35,282 INFO L273 TraceCheckUtils]: 91: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:29:35,282 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {6568#true} {6569#false} #74#return; {6569#false} is VALID [2018-11-23 12:29:35,282 INFO L273 TraceCheckUtils]: 93: Hoare triple {6569#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {6569#false} is VALID [2018-11-23 12:29:35,282 INFO L273 TraceCheckUtils]: 94: Hoare triple {6569#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {6569#false} is VALID [2018-11-23 12:29:35,282 INFO L273 TraceCheckUtils]: 95: Hoare triple {6569#false} assume !false; {6569#false} is VALID [2018-11-23 12:29:35,286 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2018-11-23 12:29:35,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:29:35,287 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 12:29:35,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:29:35,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:35,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:35,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:29:35,768 INFO L256 TraceCheckUtils]: 0: Hoare triple {6568#true} call ULTIMATE.init(); {6568#true} is VALID [2018-11-23 12:29:35,768 INFO L273 TraceCheckUtils]: 1: Hoare triple {6568#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6568#true} is VALID [2018-11-23 12:29:35,768 INFO L273 TraceCheckUtils]: 2: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:29:35,769 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6568#true} {6568#true} #66#return; {6568#true} is VALID [2018-11-23 12:29:35,769 INFO L256 TraceCheckUtils]: 4: Hoare triple {6568#true} call #t~ret13 := main(); {6568#true} is VALID [2018-11-23 12:29:35,770 INFO L273 TraceCheckUtils]: 5: Hoare triple {6568#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {6602#(<= main_~i~1 0)} is VALID [2018-11-23 12:29:35,774 INFO L273 TraceCheckUtils]: 6: Hoare triple {6602#(<= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6602#(<= main_~i~1 0)} is VALID [2018-11-23 12:29:35,775 INFO L273 TraceCheckUtils]: 7: Hoare triple {6602#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6571#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:35,776 INFO L273 TraceCheckUtils]: 8: Hoare triple {6571#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6571#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:35,776 INFO L273 TraceCheckUtils]: 9: Hoare triple {6571#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6572#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:35,778 INFO L273 TraceCheckUtils]: 10: Hoare triple {6572#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6572#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:35,779 INFO L273 TraceCheckUtils]: 11: Hoare triple {6572#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6573#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:35,780 INFO L273 TraceCheckUtils]: 12: Hoare triple {6573#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6573#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:35,780 INFO L273 TraceCheckUtils]: 13: Hoare triple {6573#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6574#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:35,782 INFO L273 TraceCheckUtils]: 14: Hoare triple {6574#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6574#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:35,782 INFO L273 TraceCheckUtils]: 15: Hoare triple {6574#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6575#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:35,784 INFO L273 TraceCheckUtils]: 16: Hoare triple {6575#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6575#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:35,785 INFO L273 TraceCheckUtils]: 17: Hoare triple {6575#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6576#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:35,786 INFO L273 TraceCheckUtils]: 18: Hoare triple {6576#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6576#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:35,786 INFO L273 TraceCheckUtils]: 19: Hoare triple {6576#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6577#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:35,788 INFO L273 TraceCheckUtils]: 20: Hoare triple {6577#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6577#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:35,789 INFO L273 TraceCheckUtils]: 21: Hoare triple {6577#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6578#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:35,790 INFO L273 TraceCheckUtils]: 22: Hoare triple {6578#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6578#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:35,790 INFO L273 TraceCheckUtils]: 23: Hoare triple {6578#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6579#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:35,791 INFO L273 TraceCheckUtils]: 24: Hoare triple {6579#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6579#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:35,792 INFO L273 TraceCheckUtils]: 25: Hoare triple {6579#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6580#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:35,792 INFO L273 TraceCheckUtils]: 26: Hoare triple {6580#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6580#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:35,793 INFO L273 TraceCheckUtils]: 27: Hoare triple {6580#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6581#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:35,797 INFO L273 TraceCheckUtils]: 28: Hoare triple {6581#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6581#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:35,798 INFO L273 TraceCheckUtils]: 29: Hoare triple {6581#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6582#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:35,799 INFO L273 TraceCheckUtils]: 30: Hoare triple {6582#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6582#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:35,799 INFO L273 TraceCheckUtils]: 31: Hoare triple {6582#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6583#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:35,800 INFO L273 TraceCheckUtils]: 32: Hoare triple {6583#(<= main_~i~1 13)} assume !(~i~1 < 100000); {6569#false} is VALID [2018-11-23 12:29:35,800 INFO L256 TraceCheckUtils]: 33: Hoare triple {6569#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {6569#false} is VALID [2018-11-23 12:29:35,800 INFO L273 TraceCheckUtils]: 34: Hoare triple {6569#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {6569#false} is VALID [2018-11-23 12:29:35,800 INFO L273 TraceCheckUtils]: 35: Hoare triple {6569#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:29:35,800 INFO L273 TraceCheckUtils]: 36: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:29:35,800 INFO L273 TraceCheckUtils]: 37: Hoare triple {6569#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:29:35,801 INFO L273 TraceCheckUtils]: 38: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:29:35,801 INFO L273 TraceCheckUtils]: 39: Hoare triple {6569#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:29:35,801 INFO L273 TraceCheckUtils]: 40: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:29:35,801 INFO L273 TraceCheckUtils]: 41: Hoare triple {6569#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:29:35,801 INFO L273 TraceCheckUtils]: 42: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:29:35,801 INFO L273 TraceCheckUtils]: 43: Hoare triple {6569#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:29:35,802 INFO L273 TraceCheckUtils]: 44: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:29:35,802 INFO L273 TraceCheckUtils]: 45: Hoare triple {6569#false} assume !(~i~0 < 100000); {6569#false} is VALID [2018-11-23 12:29:35,802 INFO L273 TraceCheckUtils]: 46: Hoare triple {6569#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6569#false} is VALID [2018-11-23 12:29:35,802 INFO L273 TraceCheckUtils]: 47: Hoare triple {6569#false} assume true; {6569#false} is VALID [2018-11-23 12:29:35,802 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {6569#false} {6569#false} #70#return; {6569#false} is VALID [2018-11-23 12:29:35,802 INFO L273 TraceCheckUtils]: 49: Hoare triple {6569#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {6569#false} is VALID [2018-11-23 12:29:35,802 INFO L256 TraceCheckUtils]: 50: Hoare triple {6569#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {6569#false} is VALID [2018-11-23 12:29:35,803 INFO L273 TraceCheckUtils]: 51: Hoare triple {6569#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {6569#false} is VALID [2018-11-23 12:29:35,803 INFO L273 TraceCheckUtils]: 52: Hoare triple {6569#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:29:35,803 INFO L273 TraceCheckUtils]: 53: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:29:35,803 INFO L273 TraceCheckUtils]: 54: Hoare triple {6569#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:29:35,803 INFO L273 TraceCheckUtils]: 55: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:29:35,803 INFO L273 TraceCheckUtils]: 56: Hoare triple {6569#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:29:35,803 INFO L273 TraceCheckUtils]: 57: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:29:35,804 INFO L273 TraceCheckUtils]: 58: Hoare triple {6569#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:29:35,804 INFO L273 TraceCheckUtils]: 59: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:29:35,804 INFO L273 TraceCheckUtils]: 60: Hoare triple {6569#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:29:35,804 INFO L273 TraceCheckUtils]: 61: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:29:35,804 INFO L273 TraceCheckUtils]: 62: Hoare triple {6569#false} assume !(~i~0 < 100000); {6569#false} is VALID [2018-11-23 12:29:35,804 INFO L273 TraceCheckUtils]: 63: Hoare triple {6569#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6569#false} is VALID [2018-11-23 12:29:35,805 INFO L273 TraceCheckUtils]: 64: Hoare triple {6569#false} assume true; {6569#false} is VALID [2018-11-23 12:29:35,805 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {6569#false} {6569#false} #72#return; {6569#false} is VALID [2018-11-23 12:29:35,805 INFO L273 TraceCheckUtils]: 66: Hoare triple {6569#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {6569#false} is VALID [2018-11-23 12:29:35,805 INFO L273 TraceCheckUtils]: 67: Hoare triple {6569#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {6569#false} is VALID [2018-11-23 12:29:35,805 INFO L273 TraceCheckUtils]: 68: Hoare triple {6569#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {6569#false} is VALID [2018-11-23 12:29:35,805 INFO L273 TraceCheckUtils]: 69: Hoare triple {6569#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {6569#false} is VALID [2018-11-23 12:29:35,805 INFO L273 TraceCheckUtils]: 70: Hoare triple {6569#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {6569#false} is VALID [2018-11-23 12:29:35,806 INFO L273 TraceCheckUtils]: 71: Hoare triple {6569#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {6569#false} is VALID [2018-11-23 12:29:35,806 INFO L273 TraceCheckUtils]: 72: Hoare triple {6569#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {6569#false} is VALID [2018-11-23 12:29:35,806 INFO L273 TraceCheckUtils]: 73: Hoare triple {6569#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {6569#false} is VALID [2018-11-23 12:29:35,806 INFO L273 TraceCheckUtils]: 74: Hoare triple {6569#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {6569#false} is VALID [2018-11-23 12:29:35,806 INFO L273 TraceCheckUtils]: 75: Hoare triple {6569#false} assume !(~i~2 < 99999); {6569#false} is VALID [2018-11-23 12:29:35,806 INFO L273 TraceCheckUtils]: 76: Hoare triple {6569#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {6569#false} is VALID [2018-11-23 12:29:35,807 INFO L256 TraceCheckUtils]: 77: Hoare triple {6569#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {6569#false} is VALID [2018-11-23 12:29:35,807 INFO L273 TraceCheckUtils]: 78: Hoare triple {6569#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {6569#false} is VALID [2018-11-23 12:29:35,807 INFO L273 TraceCheckUtils]: 79: Hoare triple {6569#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:29:35,807 INFO L273 TraceCheckUtils]: 80: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:29:35,807 INFO L273 TraceCheckUtils]: 81: Hoare triple {6569#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:29:35,807 INFO L273 TraceCheckUtils]: 82: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:29:35,807 INFO L273 TraceCheckUtils]: 83: Hoare triple {6569#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:29:35,808 INFO L273 TraceCheckUtils]: 84: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:29:35,808 INFO L273 TraceCheckUtils]: 85: Hoare triple {6569#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:29:35,808 INFO L273 TraceCheckUtils]: 86: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:29:35,808 INFO L273 TraceCheckUtils]: 87: Hoare triple {6569#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:29:35,808 INFO L273 TraceCheckUtils]: 88: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:29:35,808 INFO L273 TraceCheckUtils]: 89: Hoare triple {6569#false} assume !(~i~0 < 100000); {6569#false} is VALID [2018-11-23 12:29:35,808 INFO L273 TraceCheckUtils]: 90: Hoare triple {6569#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6569#false} is VALID [2018-11-23 12:29:35,809 INFO L273 TraceCheckUtils]: 91: Hoare triple {6569#false} assume true; {6569#false} is VALID [2018-11-23 12:29:35,809 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {6569#false} {6569#false} #74#return; {6569#false} is VALID [2018-11-23 12:29:35,809 INFO L273 TraceCheckUtils]: 93: Hoare triple {6569#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {6569#false} is VALID [2018-11-23 12:29:35,809 INFO L273 TraceCheckUtils]: 94: Hoare triple {6569#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {6569#false} is VALID [2018-11-23 12:29:35,809 INFO L273 TraceCheckUtils]: 95: Hoare triple {6569#false} assume !false; {6569#false} is VALID [2018-11-23 12:29:35,818 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2018-11-23 12:29:35,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:29:35,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 12:29:35,838 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2018-11-23 12:29:35,839 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:29:35,839 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:29:35,970 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 12:29:35,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:29:35,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:29:35,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:29:35,972 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 17 states. [2018-11-23 12:29:36,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:36,752 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2018-11-23 12:29:36,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:29:36,752 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2018-11-23 12:29:36,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:36,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:29:36,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 80 transitions. [2018-11-23 12:29:36,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:29:36,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 80 transitions. [2018-11-23 12:29:36,755 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 80 transitions. [2018-11-23 12:29:37,260 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 12:29:37,262 INFO L225 Difference]: With dead ends: 104 [2018-11-23 12:29:37,263 INFO L226 Difference]: Without dead ends: 70 [2018-11-23 12:29:37,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:29:37,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-23 12:29:37,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-11-23 12:29:37,288 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:37,288 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 69 states. [2018-11-23 12:29:37,288 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 69 states. [2018-11-23 12:29:37,288 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 69 states. [2018-11-23 12:29:37,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:37,293 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-11-23 12:29:37,293 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-11-23 12:29:37,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:37,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:37,294 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 70 states. [2018-11-23 12:29:37,294 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 70 states. [2018-11-23 12:29:37,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:37,296 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-11-23 12:29:37,296 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-11-23 12:29:37,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:37,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:37,297 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:37,297 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:37,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 12:29:37,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-11-23 12:29:37,299 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 96 [2018-11-23 12:29:37,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:37,299 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-11-23 12:29:37,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:29:37,299 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-23 12:29:37,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-23 12:29:37,300 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:37,300 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:29:37,301 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:37,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:37,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1574767605, now seen corresponding path program 14 times [2018-11-23 12:29:37,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:37,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:37,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:37,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:29:37,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:37,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:37,730 INFO L256 TraceCheckUtils]: 0: Hoare triple {7268#true} call ULTIMATE.init(); {7268#true} is VALID [2018-11-23 12:29:37,730 INFO L273 TraceCheckUtils]: 1: Hoare triple {7268#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7268#true} is VALID [2018-11-23 12:29:37,730 INFO L273 TraceCheckUtils]: 2: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:29:37,731 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7268#true} {7268#true} #66#return; {7268#true} is VALID [2018-11-23 12:29:37,731 INFO L256 TraceCheckUtils]: 4: Hoare triple {7268#true} call #t~ret13 := main(); {7268#true} is VALID [2018-11-23 12:29:37,731 INFO L273 TraceCheckUtils]: 5: Hoare triple {7268#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {7270#(= main_~i~1 0)} is VALID [2018-11-23 12:29:37,732 INFO L273 TraceCheckUtils]: 6: Hoare triple {7270#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7270#(= main_~i~1 0)} is VALID [2018-11-23 12:29:37,733 INFO L273 TraceCheckUtils]: 7: Hoare triple {7270#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7271#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:37,733 INFO L273 TraceCheckUtils]: 8: Hoare triple {7271#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7271#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:37,734 INFO L273 TraceCheckUtils]: 9: Hoare triple {7271#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7272#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:37,735 INFO L273 TraceCheckUtils]: 10: Hoare triple {7272#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7272#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:37,735 INFO L273 TraceCheckUtils]: 11: Hoare triple {7272#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7273#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:37,736 INFO L273 TraceCheckUtils]: 12: Hoare triple {7273#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7273#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:37,737 INFO L273 TraceCheckUtils]: 13: Hoare triple {7273#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7274#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:37,737 INFO L273 TraceCheckUtils]: 14: Hoare triple {7274#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7274#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:37,738 INFO L273 TraceCheckUtils]: 15: Hoare triple {7274#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7275#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:37,739 INFO L273 TraceCheckUtils]: 16: Hoare triple {7275#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7275#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:37,739 INFO L273 TraceCheckUtils]: 17: Hoare triple {7275#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7276#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:37,740 INFO L273 TraceCheckUtils]: 18: Hoare triple {7276#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7276#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:37,741 INFO L273 TraceCheckUtils]: 19: Hoare triple {7276#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7277#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:37,741 INFO L273 TraceCheckUtils]: 20: Hoare triple {7277#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7277#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:37,742 INFO L273 TraceCheckUtils]: 21: Hoare triple {7277#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7278#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:37,743 INFO L273 TraceCheckUtils]: 22: Hoare triple {7278#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7278#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:37,744 INFO L273 TraceCheckUtils]: 23: Hoare triple {7278#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7279#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:37,744 INFO L273 TraceCheckUtils]: 24: Hoare triple {7279#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7279#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:37,745 INFO L273 TraceCheckUtils]: 25: Hoare triple {7279#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7280#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:37,746 INFO L273 TraceCheckUtils]: 26: Hoare triple {7280#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7280#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:37,746 INFO L273 TraceCheckUtils]: 27: Hoare triple {7280#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7281#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:37,747 INFO L273 TraceCheckUtils]: 28: Hoare triple {7281#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7281#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:37,748 INFO L273 TraceCheckUtils]: 29: Hoare triple {7281#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7282#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:37,748 INFO L273 TraceCheckUtils]: 30: Hoare triple {7282#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7282#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:37,749 INFO L273 TraceCheckUtils]: 31: Hoare triple {7282#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7283#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:37,750 INFO L273 TraceCheckUtils]: 32: Hoare triple {7283#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7283#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:37,750 INFO L273 TraceCheckUtils]: 33: Hoare triple {7283#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7284#(<= main_~i~1 14)} is VALID [2018-11-23 12:29:37,751 INFO L273 TraceCheckUtils]: 34: Hoare triple {7284#(<= main_~i~1 14)} assume !(~i~1 < 100000); {7269#false} is VALID [2018-11-23 12:29:37,751 INFO L256 TraceCheckUtils]: 35: Hoare triple {7269#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {7268#true} is VALID [2018-11-23 12:29:37,752 INFO L273 TraceCheckUtils]: 36: Hoare triple {7268#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7268#true} is VALID [2018-11-23 12:29:37,752 INFO L273 TraceCheckUtils]: 37: Hoare triple {7268#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:29:37,752 INFO L273 TraceCheckUtils]: 38: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:29:37,752 INFO L273 TraceCheckUtils]: 39: Hoare triple {7268#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:29:37,752 INFO L273 TraceCheckUtils]: 40: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:29:37,753 INFO L273 TraceCheckUtils]: 41: Hoare triple {7268#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:29:37,753 INFO L273 TraceCheckUtils]: 42: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:29:37,753 INFO L273 TraceCheckUtils]: 43: Hoare triple {7268#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:29:37,753 INFO L273 TraceCheckUtils]: 44: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:29:37,753 INFO L273 TraceCheckUtils]: 45: Hoare triple {7268#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:29:37,754 INFO L273 TraceCheckUtils]: 46: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:29:37,754 INFO L273 TraceCheckUtils]: 47: Hoare triple {7268#true} assume !(~i~0 < 100000); {7268#true} is VALID [2018-11-23 12:29:37,754 INFO L273 TraceCheckUtils]: 48: Hoare triple {7268#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7268#true} is VALID [2018-11-23 12:29:37,754 INFO L273 TraceCheckUtils]: 49: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:29:37,754 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {7268#true} {7269#false} #70#return; {7269#false} is VALID [2018-11-23 12:29:37,755 INFO L273 TraceCheckUtils]: 51: Hoare triple {7269#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {7269#false} is VALID [2018-11-23 12:29:37,755 INFO L256 TraceCheckUtils]: 52: Hoare triple {7269#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {7268#true} is VALID [2018-11-23 12:29:37,755 INFO L273 TraceCheckUtils]: 53: Hoare triple {7268#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7268#true} is VALID [2018-11-23 12:29:37,755 INFO L273 TraceCheckUtils]: 54: Hoare triple {7268#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:29:37,755 INFO L273 TraceCheckUtils]: 55: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:29:37,755 INFO L273 TraceCheckUtils]: 56: Hoare triple {7268#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:29:37,755 INFO L273 TraceCheckUtils]: 57: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:29:37,755 INFO L273 TraceCheckUtils]: 58: Hoare triple {7268#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:29:37,756 INFO L273 TraceCheckUtils]: 59: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:29:37,756 INFO L273 TraceCheckUtils]: 60: Hoare triple {7268#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:29:37,756 INFO L273 TraceCheckUtils]: 61: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:29:37,756 INFO L273 TraceCheckUtils]: 62: Hoare triple {7268#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:29:37,756 INFO L273 TraceCheckUtils]: 63: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:29:37,756 INFO L273 TraceCheckUtils]: 64: Hoare triple {7268#true} assume !(~i~0 < 100000); {7268#true} is VALID [2018-11-23 12:29:37,756 INFO L273 TraceCheckUtils]: 65: Hoare triple {7268#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7268#true} is VALID [2018-11-23 12:29:37,757 INFO L273 TraceCheckUtils]: 66: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:29:37,757 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {7268#true} {7269#false} #72#return; {7269#false} is VALID [2018-11-23 12:29:37,757 INFO L273 TraceCheckUtils]: 68: Hoare triple {7269#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {7269#false} is VALID [2018-11-23 12:29:37,757 INFO L273 TraceCheckUtils]: 69: Hoare triple {7269#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7269#false} is VALID [2018-11-23 12:29:37,757 INFO L273 TraceCheckUtils]: 70: Hoare triple {7269#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7269#false} is VALID [2018-11-23 12:29:37,757 INFO L273 TraceCheckUtils]: 71: Hoare triple {7269#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7269#false} is VALID [2018-11-23 12:29:37,758 INFO L273 TraceCheckUtils]: 72: Hoare triple {7269#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7269#false} is VALID [2018-11-23 12:29:37,758 INFO L273 TraceCheckUtils]: 73: Hoare triple {7269#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7269#false} is VALID [2018-11-23 12:29:37,758 INFO L273 TraceCheckUtils]: 74: Hoare triple {7269#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7269#false} is VALID [2018-11-23 12:29:37,758 INFO L273 TraceCheckUtils]: 75: Hoare triple {7269#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7269#false} is VALID [2018-11-23 12:29:37,758 INFO L273 TraceCheckUtils]: 76: Hoare triple {7269#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7269#false} is VALID [2018-11-23 12:29:37,758 INFO L273 TraceCheckUtils]: 77: Hoare triple {7269#false} assume !(~i~2 < 99999); {7269#false} is VALID [2018-11-23 12:29:37,759 INFO L273 TraceCheckUtils]: 78: Hoare triple {7269#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {7269#false} is VALID [2018-11-23 12:29:37,759 INFO L256 TraceCheckUtils]: 79: Hoare triple {7269#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {7268#true} is VALID [2018-11-23 12:29:37,759 INFO L273 TraceCheckUtils]: 80: Hoare triple {7268#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7268#true} is VALID [2018-11-23 12:29:37,759 INFO L273 TraceCheckUtils]: 81: Hoare triple {7268#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:29:37,759 INFO L273 TraceCheckUtils]: 82: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:29:37,759 INFO L273 TraceCheckUtils]: 83: Hoare triple {7268#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:29:37,760 INFO L273 TraceCheckUtils]: 84: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:29:37,760 INFO L273 TraceCheckUtils]: 85: Hoare triple {7268#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:29:37,760 INFO L273 TraceCheckUtils]: 86: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:29:37,760 INFO L273 TraceCheckUtils]: 87: Hoare triple {7268#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:29:37,760 INFO L273 TraceCheckUtils]: 88: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:29:37,760 INFO L273 TraceCheckUtils]: 89: Hoare triple {7268#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:29:37,761 INFO L273 TraceCheckUtils]: 90: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:29:37,761 INFO L273 TraceCheckUtils]: 91: Hoare triple {7268#true} assume !(~i~0 < 100000); {7268#true} is VALID [2018-11-23 12:29:37,761 INFO L273 TraceCheckUtils]: 92: Hoare triple {7268#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7268#true} is VALID [2018-11-23 12:29:37,761 INFO L273 TraceCheckUtils]: 93: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:29:37,761 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {7268#true} {7269#false} #74#return; {7269#false} is VALID [2018-11-23 12:29:37,761 INFO L273 TraceCheckUtils]: 95: Hoare triple {7269#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {7269#false} is VALID [2018-11-23 12:29:37,762 INFO L273 TraceCheckUtils]: 96: Hoare triple {7269#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {7269#false} is VALID [2018-11-23 12:29:37,762 INFO L273 TraceCheckUtils]: 97: Hoare triple {7269#false} assume !false; {7269#false} is VALID [2018-11-23 12:29:37,767 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2018-11-23 12:29:37,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:29:37,767 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 12:29:37,776 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:29:37,825 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:29:37,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:29:37,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:37,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:29:38,074 INFO L256 TraceCheckUtils]: 0: Hoare triple {7268#true} call ULTIMATE.init(); {7268#true} is VALID [2018-11-23 12:29:38,074 INFO L273 TraceCheckUtils]: 1: Hoare triple {7268#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7268#true} is VALID [2018-11-23 12:29:38,074 INFO L273 TraceCheckUtils]: 2: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:29:38,074 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7268#true} {7268#true} #66#return; {7268#true} is VALID [2018-11-23 12:29:38,075 INFO L256 TraceCheckUtils]: 4: Hoare triple {7268#true} call #t~ret13 := main(); {7268#true} is VALID [2018-11-23 12:29:38,076 INFO L273 TraceCheckUtils]: 5: Hoare triple {7268#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {7303#(<= main_~i~1 0)} is VALID [2018-11-23 12:29:38,076 INFO L273 TraceCheckUtils]: 6: Hoare triple {7303#(<= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7303#(<= main_~i~1 0)} is VALID [2018-11-23 12:29:38,077 INFO L273 TraceCheckUtils]: 7: Hoare triple {7303#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7271#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:38,077 INFO L273 TraceCheckUtils]: 8: Hoare triple {7271#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7271#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:38,077 INFO L273 TraceCheckUtils]: 9: Hoare triple {7271#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7272#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:38,078 INFO L273 TraceCheckUtils]: 10: Hoare triple {7272#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7272#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:38,078 INFO L273 TraceCheckUtils]: 11: Hoare triple {7272#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7273#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:38,078 INFO L273 TraceCheckUtils]: 12: Hoare triple {7273#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7273#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:38,079 INFO L273 TraceCheckUtils]: 13: Hoare triple {7273#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7274#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:38,079 INFO L273 TraceCheckUtils]: 14: Hoare triple {7274#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7274#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:38,080 INFO L273 TraceCheckUtils]: 15: Hoare triple {7274#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7275#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:38,081 INFO L273 TraceCheckUtils]: 16: Hoare triple {7275#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7275#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:38,082 INFO L273 TraceCheckUtils]: 17: Hoare triple {7275#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7276#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:38,082 INFO L273 TraceCheckUtils]: 18: Hoare triple {7276#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7276#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:38,083 INFO L273 TraceCheckUtils]: 19: Hoare triple {7276#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7277#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:38,083 INFO L273 TraceCheckUtils]: 20: Hoare triple {7277#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7277#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:38,084 INFO L273 TraceCheckUtils]: 21: Hoare triple {7277#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7278#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:38,085 INFO L273 TraceCheckUtils]: 22: Hoare triple {7278#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7278#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:38,085 INFO L273 TraceCheckUtils]: 23: Hoare triple {7278#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7279#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:38,086 INFO L273 TraceCheckUtils]: 24: Hoare triple {7279#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7279#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:38,087 INFO L273 TraceCheckUtils]: 25: Hoare triple {7279#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7280#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:38,087 INFO L273 TraceCheckUtils]: 26: Hoare triple {7280#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7280#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:38,088 INFO L273 TraceCheckUtils]: 27: Hoare triple {7280#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7281#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:38,089 INFO L273 TraceCheckUtils]: 28: Hoare triple {7281#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7281#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:38,089 INFO L273 TraceCheckUtils]: 29: Hoare triple {7281#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7282#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:38,090 INFO L273 TraceCheckUtils]: 30: Hoare triple {7282#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7282#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:38,091 INFO L273 TraceCheckUtils]: 31: Hoare triple {7282#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7283#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:38,091 INFO L273 TraceCheckUtils]: 32: Hoare triple {7283#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7283#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:38,092 INFO L273 TraceCheckUtils]: 33: Hoare triple {7283#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7284#(<= main_~i~1 14)} is VALID [2018-11-23 12:29:38,093 INFO L273 TraceCheckUtils]: 34: Hoare triple {7284#(<= main_~i~1 14)} assume !(~i~1 < 100000); {7269#false} is VALID [2018-11-23 12:29:38,093 INFO L256 TraceCheckUtils]: 35: Hoare triple {7269#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {7269#false} is VALID [2018-11-23 12:29:38,093 INFO L273 TraceCheckUtils]: 36: Hoare triple {7269#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7269#false} is VALID [2018-11-23 12:29:38,093 INFO L273 TraceCheckUtils]: 37: Hoare triple {7269#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:29:38,094 INFO L273 TraceCheckUtils]: 38: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:29:38,094 INFO L273 TraceCheckUtils]: 39: Hoare triple {7269#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:29:38,094 INFO L273 TraceCheckUtils]: 40: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:29:38,094 INFO L273 TraceCheckUtils]: 41: Hoare triple {7269#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:29:38,094 INFO L273 TraceCheckUtils]: 42: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:29:38,095 INFO L273 TraceCheckUtils]: 43: Hoare triple {7269#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:29:38,095 INFO L273 TraceCheckUtils]: 44: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:29:38,095 INFO L273 TraceCheckUtils]: 45: Hoare triple {7269#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:29:38,095 INFO L273 TraceCheckUtils]: 46: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:29:38,095 INFO L273 TraceCheckUtils]: 47: Hoare triple {7269#false} assume !(~i~0 < 100000); {7269#false} is VALID [2018-11-23 12:29:38,096 INFO L273 TraceCheckUtils]: 48: Hoare triple {7269#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7269#false} is VALID [2018-11-23 12:29:38,096 INFO L273 TraceCheckUtils]: 49: Hoare triple {7269#false} assume true; {7269#false} is VALID [2018-11-23 12:29:38,096 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {7269#false} {7269#false} #70#return; {7269#false} is VALID [2018-11-23 12:29:38,096 INFO L273 TraceCheckUtils]: 51: Hoare triple {7269#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {7269#false} is VALID [2018-11-23 12:29:38,096 INFO L256 TraceCheckUtils]: 52: Hoare triple {7269#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {7269#false} is VALID [2018-11-23 12:29:38,096 INFO L273 TraceCheckUtils]: 53: Hoare triple {7269#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7269#false} is VALID [2018-11-23 12:29:38,097 INFO L273 TraceCheckUtils]: 54: Hoare triple {7269#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:29:38,097 INFO L273 TraceCheckUtils]: 55: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:29:38,097 INFO L273 TraceCheckUtils]: 56: Hoare triple {7269#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:29:38,097 INFO L273 TraceCheckUtils]: 57: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:29:38,097 INFO L273 TraceCheckUtils]: 58: Hoare triple {7269#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:29:38,097 INFO L273 TraceCheckUtils]: 59: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:29:38,097 INFO L273 TraceCheckUtils]: 60: Hoare triple {7269#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:29:38,097 INFO L273 TraceCheckUtils]: 61: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:29:38,098 INFO L273 TraceCheckUtils]: 62: Hoare triple {7269#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:29:38,098 INFO L273 TraceCheckUtils]: 63: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:29:38,098 INFO L273 TraceCheckUtils]: 64: Hoare triple {7269#false} assume !(~i~0 < 100000); {7269#false} is VALID [2018-11-23 12:29:38,098 INFO L273 TraceCheckUtils]: 65: Hoare triple {7269#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7269#false} is VALID [2018-11-23 12:29:38,098 INFO L273 TraceCheckUtils]: 66: Hoare triple {7269#false} assume true; {7269#false} is VALID [2018-11-23 12:29:38,098 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {7269#false} {7269#false} #72#return; {7269#false} is VALID [2018-11-23 12:29:38,098 INFO L273 TraceCheckUtils]: 68: Hoare triple {7269#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {7269#false} is VALID [2018-11-23 12:29:38,098 INFO L273 TraceCheckUtils]: 69: Hoare triple {7269#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7269#false} is VALID [2018-11-23 12:29:38,098 INFO L273 TraceCheckUtils]: 70: Hoare triple {7269#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7269#false} is VALID [2018-11-23 12:29:38,099 INFO L273 TraceCheckUtils]: 71: Hoare triple {7269#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7269#false} is VALID [2018-11-23 12:29:38,099 INFO L273 TraceCheckUtils]: 72: Hoare triple {7269#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7269#false} is VALID [2018-11-23 12:29:38,099 INFO L273 TraceCheckUtils]: 73: Hoare triple {7269#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7269#false} is VALID [2018-11-23 12:29:38,099 INFO L273 TraceCheckUtils]: 74: Hoare triple {7269#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7269#false} is VALID [2018-11-23 12:29:38,099 INFO L273 TraceCheckUtils]: 75: Hoare triple {7269#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7269#false} is VALID [2018-11-23 12:29:38,099 INFO L273 TraceCheckUtils]: 76: Hoare triple {7269#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7269#false} is VALID [2018-11-23 12:29:38,099 INFO L273 TraceCheckUtils]: 77: Hoare triple {7269#false} assume !(~i~2 < 99999); {7269#false} is VALID [2018-11-23 12:29:38,099 INFO L273 TraceCheckUtils]: 78: Hoare triple {7269#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {7269#false} is VALID [2018-11-23 12:29:38,100 INFO L256 TraceCheckUtils]: 79: Hoare triple {7269#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {7269#false} is VALID [2018-11-23 12:29:38,100 INFO L273 TraceCheckUtils]: 80: Hoare triple {7269#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7269#false} is VALID [2018-11-23 12:29:38,100 INFO L273 TraceCheckUtils]: 81: Hoare triple {7269#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:29:38,100 INFO L273 TraceCheckUtils]: 82: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:29:38,100 INFO L273 TraceCheckUtils]: 83: Hoare triple {7269#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:29:38,100 INFO L273 TraceCheckUtils]: 84: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:29:38,100 INFO L273 TraceCheckUtils]: 85: Hoare triple {7269#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:29:38,100 INFO L273 TraceCheckUtils]: 86: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:29:38,101 INFO L273 TraceCheckUtils]: 87: Hoare triple {7269#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:29:38,101 INFO L273 TraceCheckUtils]: 88: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:29:38,101 INFO L273 TraceCheckUtils]: 89: Hoare triple {7269#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:29:38,101 INFO L273 TraceCheckUtils]: 90: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:29:38,101 INFO L273 TraceCheckUtils]: 91: Hoare triple {7269#false} assume !(~i~0 < 100000); {7269#false} is VALID [2018-11-23 12:29:38,101 INFO L273 TraceCheckUtils]: 92: Hoare triple {7269#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7269#false} is VALID [2018-11-23 12:29:38,101 INFO L273 TraceCheckUtils]: 93: Hoare triple {7269#false} assume true; {7269#false} is VALID [2018-11-23 12:29:38,101 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {7269#false} {7269#false} #74#return; {7269#false} is VALID [2018-11-23 12:29:38,101 INFO L273 TraceCheckUtils]: 95: Hoare triple {7269#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {7269#false} is VALID [2018-11-23 12:29:38,102 INFO L273 TraceCheckUtils]: 96: Hoare triple {7269#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {7269#false} is VALID [2018-11-23 12:29:38,102 INFO L273 TraceCheckUtils]: 97: Hoare triple {7269#false} assume !false; {7269#false} is VALID [2018-11-23 12:29:38,106 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2018-11-23 12:29:38,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:29:38,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 12:29:38,126 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 98 [2018-11-23 12:29:38,126 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:29:38,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 12:29:38,194 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 12:29:38,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 12:29:38,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 12:29:38,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:29:38,196 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 18 states. [2018-11-23 12:29:38,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:38,635 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2018-11-23 12:29:38,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:29:38,635 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 98 [2018-11-23 12:29:38,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:38,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:29:38,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions. [2018-11-23 12:29:38,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:29:38,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions. [2018-11-23 12:29:38,638 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 82 transitions. [2018-11-23 12:29:38,737 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 12:29:38,739 INFO L225 Difference]: With dead ends: 106 [2018-11-23 12:29:38,739 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 12:29:38,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:29:38,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 12:29:38,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2018-11-23 12:29:38,768 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:38,768 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 71 states. [2018-11-23 12:29:38,768 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 71 states. [2018-11-23 12:29:38,768 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 71 states. [2018-11-23 12:29:38,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:38,771 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-11-23 12:29:38,771 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-11-23 12:29:38,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:38,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:38,771 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 72 states. [2018-11-23 12:29:38,772 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 72 states. [2018-11-23 12:29:38,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:38,773 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-11-23 12:29:38,774 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-11-23 12:29:38,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:38,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:38,774 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:38,774 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:38,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-23 12:29:38,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-11-23 12:29:38,776 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 98 [2018-11-23 12:29:38,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:38,776 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-11-23 12:29:38,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 12:29:38,777 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-11-23 12:29:38,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-23 12:29:38,777 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:38,778 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:29:38,778 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:38,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:38,778 INFO L82 PathProgramCache]: Analyzing trace with hash -459700265, now seen corresponding path program 15 times [2018-11-23 12:29:38,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:38,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:38,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:38,779 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:29:38,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:38,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:39,086 INFO L256 TraceCheckUtils]: 0: Hoare triple {7985#true} call ULTIMATE.init(); {7985#true} is VALID [2018-11-23 12:29:39,086 INFO L273 TraceCheckUtils]: 1: Hoare triple {7985#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7985#true} is VALID [2018-11-23 12:29:39,087 INFO L273 TraceCheckUtils]: 2: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:29:39,087 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7985#true} {7985#true} #66#return; {7985#true} is VALID [2018-11-23 12:29:39,087 INFO L256 TraceCheckUtils]: 4: Hoare triple {7985#true} call #t~ret13 := main(); {7985#true} is VALID [2018-11-23 12:29:39,087 INFO L273 TraceCheckUtils]: 5: Hoare triple {7985#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {7987#(= main_~i~1 0)} is VALID [2018-11-23 12:29:39,088 INFO L273 TraceCheckUtils]: 6: Hoare triple {7987#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7987#(= main_~i~1 0)} is VALID [2018-11-23 12:29:39,089 INFO L273 TraceCheckUtils]: 7: Hoare triple {7987#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7988#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:39,089 INFO L273 TraceCheckUtils]: 8: Hoare triple {7988#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7988#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:39,090 INFO L273 TraceCheckUtils]: 9: Hoare triple {7988#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7989#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:39,091 INFO L273 TraceCheckUtils]: 10: Hoare triple {7989#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7989#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:39,091 INFO L273 TraceCheckUtils]: 11: Hoare triple {7989#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7990#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:39,092 INFO L273 TraceCheckUtils]: 12: Hoare triple {7990#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7990#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:39,093 INFO L273 TraceCheckUtils]: 13: Hoare triple {7990#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7991#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:39,093 INFO L273 TraceCheckUtils]: 14: Hoare triple {7991#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7991#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:39,094 INFO L273 TraceCheckUtils]: 15: Hoare triple {7991#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7992#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:39,095 INFO L273 TraceCheckUtils]: 16: Hoare triple {7992#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7992#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:39,095 INFO L273 TraceCheckUtils]: 17: Hoare triple {7992#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7993#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:39,096 INFO L273 TraceCheckUtils]: 18: Hoare triple {7993#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7993#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:39,097 INFO L273 TraceCheckUtils]: 19: Hoare triple {7993#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7994#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:39,097 INFO L273 TraceCheckUtils]: 20: Hoare triple {7994#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7994#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:39,098 INFO L273 TraceCheckUtils]: 21: Hoare triple {7994#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7995#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:39,099 INFO L273 TraceCheckUtils]: 22: Hoare triple {7995#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7995#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:39,099 INFO L273 TraceCheckUtils]: 23: Hoare triple {7995#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7996#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:39,100 INFO L273 TraceCheckUtils]: 24: Hoare triple {7996#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7996#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:39,101 INFO L273 TraceCheckUtils]: 25: Hoare triple {7996#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7997#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:39,101 INFO L273 TraceCheckUtils]: 26: Hoare triple {7997#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7997#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:39,102 INFO L273 TraceCheckUtils]: 27: Hoare triple {7997#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7998#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:39,103 INFO L273 TraceCheckUtils]: 28: Hoare triple {7998#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7998#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:39,103 INFO L273 TraceCheckUtils]: 29: Hoare triple {7998#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7999#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:39,104 INFO L273 TraceCheckUtils]: 30: Hoare triple {7999#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7999#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:39,105 INFO L273 TraceCheckUtils]: 31: Hoare triple {7999#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8000#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:39,105 INFO L273 TraceCheckUtils]: 32: Hoare triple {8000#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8000#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:39,106 INFO L273 TraceCheckUtils]: 33: Hoare triple {8000#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8001#(<= main_~i~1 14)} is VALID [2018-11-23 12:29:39,107 INFO L273 TraceCheckUtils]: 34: Hoare triple {8001#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8001#(<= main_~i~1 14)} is VALID [2018-11-23 12:29:39,107 INFO L273 TraceCheckUtils]: 35: Hoare triple {8001#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8002#(<= main_~i~1 15)} is VALID [2018-11-23 12:29:39,108 INFO L273 TraceCheckUtils]: 36: Hoare triple {8002#(<= main_~i~1 15)} assume !(~i~1 < 100000); {7986#false} is VALID [2018-11-23 12:29:39,108 INFO L256 TraceCheckUtils]: 37: Hoare triple {7986#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {7985#true} is VALID [2018-11-23 12:29:39,108 INFO L273 TraceCheckUtils]: 38: Hoare triple {7985#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7985#true} is VALID [2018-11-23 12:29:39,109 INFO L273 TraceCheckUtils]: 39: Hoare triple {7985#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:29:39,109 INFO L273 TraceCheckUtils]: 40: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:29:39,109 INFO L273 TraceCheckUtils]: 41: Hoare triple {7985#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:29:39,109 INFO L273 TraceCheckUtils]: 42: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:29:39,110 INFO L273 TraceCheckUtils]: 43: Hoare triple {7985#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:29:39,110 INFO L273 TraceCheckUtils]: 44: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:29:39,110 INFO L273 TraceCheckUtils]: 45: Hoare triple {7985#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:29:39,110 INFO L273 TraceCheckUtils]: 46: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:29:39,110 INFO L273 TraceCheckUtils]: 47: Hoare triple {7985#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:29:39,111 INFO L273 TraceCheckUtils]: 48: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:29:39,111 INFO L273 TraceCheckUtils]: 49: Hoare triple {7985#true} assume !(~i~0 < 100000); {7985#true} is VALID [2018-11-23 12:29:39,111 INFO L273 TraceCheckUtils]: 50: Hoare triple {7985#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7985#true} is VALID [2018-11-23 12:29:39,111 INFO L273 TraceCheckUtils]: 51: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:29:39,111 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {7985#true} {7986#false} #70#return; {7986#false} is VALID [2018-11-23 12:29:39,111 INFO L273 TraceCheckUtils]: 53: Hoare triple {7986#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {7986#false} is VALID [2018-11-23 12:29:39,111 INFO L256 TraceCheckUtils]: 54: Hoare triple {7986#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {7985#true} is VALID [2018-11-23 12:29:39,112 INFO L273 TraceCheckUtils]: 55: Hoare triple {7985#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7985#true} is VALID [2018-11-23 12:29:39,112 INFO L273 TraceCheckUtils]: 56: Hoare triple {7985#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:29:39,112 INFO L273 TraceCheckUtils]: 57: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:29:39,112 INFO L273 TraceCheckUtils]: 58: Hoare triple {7985#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:29:39,112 INFO L273 TraceCheckUtils]: 59: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:29:39,112 INFO L273 TraceCheckUtils]: 60: Hoare triple {7985#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:29:39,112 INFO L273 TraceCheckUtils]: 61: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:29:39,112 INFO L273 TraceCheckUtils]: 62: Hoare triple {7985#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:29:39,113 INFO L273 TraceCheckUtils]: 63: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:29:39,113 INFO L273 TraceCheckUtils]: 64: Hoare triple {7985#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:29:39,113 INFO L273 TraceCheckUtils]: 65: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:29:39,113 INFO L273 TraceCheckUtils]: 66: Hoare triple {7985#true} assume !(~i~0 < 100000); {7985#true} is VALID [2018-11-23 12:29:39,113 INFO L273 TraceCheckUtils]: 67: Hoare triple {7985#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7985#true} is VALID [2018-11-23 12:29:39,113 INFO L273 TraceCheckUtils]: 68: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:29:39,113 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {7985#true} {7986#false} #72#return; {7986#false} is VALID [2018-11-23 12:29:39,113 INFO L273 TraceCheckUtils]: 70: Hoare triple {7986#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {7986#false} is VALID [2018-11-23 12:29:39,114 INFO L273 TraceCheckUtils]: 71: Hoare triple {7986#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7986#false} is VALID [2018-11-23 12:29:39,114 INFO L273 TraceCheckUtils]: 72: Hoare triple {7986#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7986#false} is VALID [2018-11-23 12:29:39,114 INFO L273 TraceCheckUtils]: 73: Hoare triple {7986#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7986#false} is VALID [2018-11-23 12:29:39,114 INFO L273 TraceCheckUtils]: 74: Hoare triple {7986#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7986#false} is VALID [2018-11-23 12:29:39,114 INFO L273 TraceCheckUtils]: 75: Hoare triple {7986#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7986#false} is VALID [2018-11-23 12:29:39,114 INFO L273 TraceCheckUtils]: 76: Hoare triple {7986#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7986#false} is VALID [2018-11-23 12:29:39,114 INFO L273 TraceCheckUtils]: 77: Hoare triple {7986#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7986#false} is VALID [2018-11-23 12:29:39,114 INFO L273 TraceCheckUtils]: 78: Hoare triple {7986#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7986#false} is VALID [2018-11-23 12:29:39,114 INFO L273 TraceCheckUtils]: 79: Hoare triple {7986#false} assume !(~i~2 < 99999); {7986#false} is VALID [2018-11-23 12:29:39,115 INFO L273 TraceCheckUtils]: 80: Hoare triple {7986#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {7986#false} is VALID [2018-11-23 12:29:39,115 INFO L256 TraceCheckUtils]: 81: Hoare triple {7986#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {7985#true} is VALID [2018-11-23 12:29:39,115 INFO L273 TraceCheckUtils]: 82: Hoare triple {7985#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7985#true} is VALID [2018-11-23 12:29:39,115 INFO L273 TraceCheckUtils]: 83: Hoare triple {7985#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:29:39,115 INFO L273 TraceCheckUtils]: 84: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:29:39,115 INFO L273 TraceCheckUtils]: 85: Hoare triple {7985#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:29:39,115 INFO L273 TraceCheckUtils]: 86: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:29:39,115 INFO L273 TraceCheckUtils]: 87: Hoare triple {7985#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:29:39,116 INFO L273 TraceCheckUtils]: 88: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:29:39,116 INFO L273 TraceCheckUtils]: 89: Hoare triple {7985#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:29:39,116 INFO L273 TraceCheckUtils]: 90: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:29:39,116 INFO L273 TraceCheckUtils]: 91: Hoare triple {7985#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:29:39,116 INFO L273 TraceCheckUtils]: 92: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:29:39,116 INFO L273 TraceCheckUtils]: 93: Hoare triple {7985#true} assume !(~i~0 < 100000); {7985#true} is VALID [2018-11-23 12:29:39,116 INFO L273 TraceCheckUtils]: 94: Hoare triple {7985#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7985#true} is VALID [2018-11-23 12:29:39,116 INFO L273 TraceCheckUtils]: 95: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:29:39,117 INFO L268 TraceCheckUtils]: 96: Hoare quadruple {7985#true} {7986#false} #74#return; {7986#false} is VALID [2018-11-23 12:29:39,117 INFO L273 TraceCheckUtils]: 97: Hoare triple {7986#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {7986#false} is VALID [2018-11-23 12:29:39,117 INFO L273 TraceCheckUtils]: 98: Hoare triple {7986#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {7986#false} is VALID [2018-11-23 12:29:39,117 INFO L273 TraceCheckUtils]: 99: Hoare triple {7986#false} assume !false; {7986#false} is VALID [2018-11-23 12:29:39,121 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2018-11-23 12:29:39,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:29:39,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 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 12:29:39,131 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:29:39,214 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 12:29:39,214 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:29:39,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:39,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:29:39,405 INFO L256 TraceCheckUtils]: 0: Hoare triple {7985#true} call ULTIMATE.init(); {7985#true} is VALID [2018-11-23 12:29:39,406 INFO L273 TraceCheckUtils]: 1: Hoare triple {7985#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7985#true} is VALID [2018-11-23 12:29:39,406 INFO L273 TraceCheckUtils]: 2: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:29:39,406 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7985#true} {7985#true} #66#return; {7985#true} is VALID [2018-11-23 12:29:39,407 INFO L256 TraceCheckUtils]: 4: Hoare triple {7985#true} call #t~ret13 := main(); {7985#true} is VALID [2018-11-23 12:29:39,407 INFO L273 TraceCheckUtils]: 5: Hoare triple {7985#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {7985#true} is VALID [2018-11-23 12:29:39,407 INFO L273 TraceCheckUtils]: 6: Hoare triple {7985#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:29:39,407 INFO L273 TraceCheckUtils]: 7: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:29:39,407 INFO L273 TraceCheckUtils]: 8: Hoare triple {7985#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:29:39,408 INFO L273 TraceCheckUtils]: 9: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:29:39,408 INFO L273 TraceCheckUtils]: 10: Hoare triple {7985#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:29:39,408 INFO L273 TraceCheckUtils]: 11: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:29:39,408 INFO L273 TraceCheckUtils]: 12: Hoare triple {7985#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:29:39,408 INFO L273 TraceCheckUtils]: 13: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:29:39,409 INFO L273 TraceCheckUtils]: 14: Hoare triple {7985#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:29:39,409 INFO L273 TraceCheckUtils]: 15: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:29:39,409 INFO L273 TraceCheckUtils]: 16: Hoare triple {7985#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:29:39,409 INFO L273 TraceCheckUtils]: 17: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:29:39,409 INFO L273 TraceCheckUtils]: 18: Hoare triple {7985#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:29:39,409 INFO L273 TraceCheckUtils]: 19: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:29:39,409 INFO L273 TraceCheckUtils]: 20: Hoare triple {7985#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:29:39,409 INFO L273 TraceCheckUtils]: 21: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:29:39,410 INFO L273 TraceCheckUtils]: 22: Hoare triple {7985#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:29:39,410 INFO L273 TraceCheckUtils]: 23: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:29:39,410 INFO L273 TraceCheckUtils]: 24: Hoare triple {7985#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:29:39,410 INFO L273 TraceCheckUtils]: 25: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:29:39,410 INFO L273 TraceCheckUtils]: 26: Hoare triple {7985#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:29:39,410 INFO L273 TraceCheckUtils]: 27: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:29:39,410 INFO L273 TraceCheckUtils]: 28: Hoare triple {7985#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:29:39,410 INFO L273 TraceCheckUtils]: 29: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:29:39,411 INFO L273 TraceCheckUtils]: 30: Hoare triple {7985#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:29:39,411 INFO L273 TraceCheckUtils]: 31: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:29:39,411 INFO L273 TraceCheckUtils]: 32: Hoare triple {7985#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:29:39,411 INFO L273 TraceCheckUtils]: 33: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:29:39,411 INFO L273 TraceCheckUtils]: 34: Hoare triple {7985#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:29:39,411 INFO L273 TraceCheckUtils]: 35: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:29:39,411 INFO L273 TraceCheckUtils]: 36: Hoare triple {7985#true} assume !(~i~1 < 100000); {7985#true} is VALID [2018-11-23 12:29:39,411 INFO L256 TraceCheckUtils]: 37: Hoare triple {7985#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {7985#true} is VALID [2018-11-23 12:29:39,411 INFO L273 TraceCheckUtils]: 38: Hoare triple {7985#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7985#true} is VALID [2018-11-23 12:29:39,412 INFO L273 TraceCheckUtils]: 39: Hoare triple {7985#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:29:39,412 INFO L273 TraceCheckUtils]: 40: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:29:39,412 INFO L273 TraceCheckUtils]: 41: Hoare triple {7985#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:29:39,412 INFO L273 TraceCheckUtils]: 42: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:29:39,412 INFO L273 TraceCheckUtils]: 43: Hoare triple {7985#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:29:39,412 INFO L273 TraceCheckUtils]: 44: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:29:39,412 INFO L273 TraceCheckUtils]: 45: Hoare triple {7985#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:29:39,412 INFO L273 TraceCheckUtils]: 46: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:29:39,413 INFO L273 TraceCheckUtils]: 47: Hoare triple {7985#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:29:39,413 INFO L273 TraceCheckUtils]: 48: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:29:39,413 INFO L273 TraceCheckUtils]: 49: Hoare triple {7985#true} assume !(~i~0 < 100000); {7985#true} is VALID [2018-11-23 12:29:39,413 INFO L273 TraceCheckUtils]: 50: Hoare triple {7985#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7985#true} is VALID [2018-11-23 12:29:39,413 INFO L273 TraceCheckUtils]: 51: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:29:39,413 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {7985#true} {7985#true} #70#return; {7985#true} is VALID [2018-11-23 12:29:39,413 INFO L273 TraceCheckUtils]: 53: Hoare triple {7985#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {7985#true} is VALID [2018-11-23 12:29:39,413 INFO L256 TraceCheckUtils]: 54: Hoare triple {7985#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {7985#true} is VALID [2018-11-23 12:29:39,414 INFO L273 TraceCheckUtils]: 55: Hoare triple {7985#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7985#true} is VALID [2018-11-23 12:29:39,414 INFO L273 TraceCheckUtils]: 56: Hoare triple {7985#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:29:39,414 INFO L273 TraceCheckUtils]: 57: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:29:39,414 INFO L273 TraceCheckUtils]: 58: Hoare triple {7985#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:29:39,414 INFO L273 TraceCheckUtils]: 59: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:29:39,414 INFO L273 TraceCheckUtils]: 60: Hoare triple {7985#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:29:39,414 INFO L273 TraceCheckUtils]: 61: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:29:39,414 INFO L273 TraceCheckUtils]: 62: Hoare triple {7985#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:29:39,415 INFO L273 TraceCheckUtils]: 63: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:29:39,415 INFO L273 TraceCheckUtils]: 64: Hoare triple {7985#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:29:39,415 INFO L273 TraceCheckUtils]: 65: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:29:39,415 INFO L273 TraceCheckUtils]: 66: Hoare triple {7985#true} assume !(~i~0 < 100000); {7985#true} is VALID [2018-11-23 12:29:39,415 INFO L273 TraceCheckUtils]: 67: Hoare triple {7985#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7985#true} is VALID [2018-11-23 12:29:39,415 INFO L273 TraceCheckUtils]: 68: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:29:39,415 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {7985#true} {7985#true} #72#return; {7985#true} is VALID [2018-11-23 12:29:39,415 INFO L273 TraceCheckUtils]: 70: Hoare triple {7985#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {7985#true} is VALID [2018-11-23 12:29:39,415 INFO L273 TraceCheckUtils]: 71: Hoare triple {7985#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7985#true} is VALID [2018-11-23 12:29:39,416 INFO L273 TraceCheckUtils]: 72: Hoare triple {7985#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7985#true} is VALID [2018-11-23 12:29:39,416 INFO L273 TraceCheckUtils]: 73: Hoare triple {7985#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7985#true} is VALID [2018-11-23 12:29:39,416 INFO L273 TraceCheckUtils]: 74: Hoare triple {7985#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7985#true} is VALID [2018-11-23 12:29:39,416 INFO L273 TraceCheckUtils]: 75: Hoare triple {7985#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7985#true} is VALID [2018-11-23 12:29:39,416 INFO L273 TraceCheckUtils]: 76: Hoare triple {7985#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7985#true} is VALID [2018-11-23 12:29:39,416 INFO L273 TraceCheckUtils]: 77: Hoare triple {7985#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7985#true} is VALID [2018-11-23 12:29:39,416 INFO L273 TraceCheckUtils]: 78: Hoare triple {7985#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7985#true} is VALID [2018-11-23 12:29:39,416 INFO L273 TraceCheckUtils]: 79: Hoare triple {7985#true} assume !(~i~2 < 99999); {7985#true} is VALID [2018-11-23 12:29:39,417 INFO L273 TraceCheckUtils]: 80: Hoare triple {7985#true} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {7985#true} is VALID [2018-11-23 12:29:39,417 INFO L256 TraceCheckUtils]: 81: Hoare triple {7985#true} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {7985#true} is VALID [2018-11-23 12:29:39,417 INFO L273 TraceCheckUtils]: 82: Hoare triple {7985#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {8252#(<= xor_~i~0 1)} is VALID [2018-11-23 12:29:39,418 INFO L273 TraceCheckUtils]: 83: Hoare triple {8252#(<= xor_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8252#(<= xor_~i~0 1)} is VALID [2018-11-23 12:29:39,418 INFO L273 TraceCheckUtils]: 84: Hoare triple {8252#(<= xor_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8259#(<= xor_~i~0 2)} is VALID [2018-11-23 12:29:39,419 INFO L273 TraceCheckUtils]: 85: Hoare triple {8259#(<= xor_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8259#(<= xor_~i~0 2)} is VALID [2018-11-23 12:29:39,419 INFO L273 TraceCheckUtils]: 86: Hoare triple {8259#(<= xor_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8266#(<= xor_~i~0 3)} is VALID [2018-11-23 12:29:39,419 INFO L273 TraceCheckUtils]: 87: Hoare triple {8266#(<= xor_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8266#(<= xor_~i~0 3)} is VALID [2018-11-23 12:29:39,420 INFO L273 TraceCheckUtils]: 88: Hoare triple {8266#(<= xor_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8273#(<= xor_~i~0 4)} is VALID [2018-11-23 12:29:39,421 INFO L273 TraceCheckUtils]: 89: Hoare triple {8273#(<= xor_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8273#(<= xor_~i~0 4)} is VALID [2018-11-23 12:29:39,421 INFO L273 TraceCheckUtils]: 90: Hoare triple {8273#(<= xor_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8280#(<= xor_~i~0 5)} is VALID [2018-11-23 12:29:39,422 INFO L273 TraceCheckUtils]: 91: Hoare triple {8280#(<= xor_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8280#(<= xor_~i~0 5)} is VALID [2018-11-23 12:29:39,423 INFO L273 TraceCheckUtils]: 92: Hoare triple {8280#(<= xor_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8287#(<= xor_~i~0 6)} is VALID [2018-11-23 12:29:39,423 INFO L273 TraceCheckUtils]: 93: Hoare triple {8287#(<= xor_~i~0 6)} assume !(~i~0 < 100000); {7986#false} is VALID [2018-11-23 12:29:39,424 INFO L273 TraceCheckUtils]: 94: Hoare triple {7986#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7986#false} is VALID [2018-11-23 12:29:39,424 INFO L273 TraceCheckUtils]: 95: Hoare triple {7986#false} assume true; {7986#false} is VALID [2018-11-23 12:29:39,424 INFO L268 TraceCheckUtils]: 96: Hoare quadruple {7986#false} {7985#true} #74#return; {7986#false} is VALID [2018-11-23 12:29:39,424 INFO L273 TraceCheckUtils]: 97: Hoare triple {7986#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {7986#false} is VALID [2018-11-23 12:29:39,424 INFO L273 TraceCheckUtils]: 98: Hoare triple {7986#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {7986#false} is VALID [2018-11-23 12:29:39,425 INFO L273 TraceCheckUtils]: 99: Hoare triple {7986#false} assume !false; {7986#false} is VALID [2018-11-23 12:29:39,430 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 128 proven. 25 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2018-11-23 12:29:39,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:29:39,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8] total 24 [2018-11-23 12:29:39,450 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 100 [2018-11-23 12:29:39,451 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:29:39,451 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 12:29:39,595 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 12:29:39,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 12:29:39,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 12:29:39,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:29:39,596 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 24 states. [2018-11-23 12:29:39,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:39,970 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2018-11-23 12:29:39,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 12:29:39,970 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 100 [2018-11-23 12:29:39,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:39,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:29:39,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 100 transitions. [2018-11-23 12:29:39,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:29:39,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 100 transitions. [2018-11-23 12:29:39,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 100 transitions. [2018-11-23 12:29:40,139 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:29:40,142 INFO L225 Difference]: With dead ends: 111 [2018-11-23 12:29:40,142 INFO L226 Difference]: Without dead ends: 77 [2018-11-23 12:29:40,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:29:40,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-23 12:29:40,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-11-23 12:29:40,169 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:40,169 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 75 states. [2018-11-23 12:29:40,170 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 75 states. [2018-11-23 12:29:40,170 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 75 states. [2018-11-23 12:29:40,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:40,172 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-11-23 12:29:40,172 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-23 12:29:40,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:40,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:40,173 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 77 states. [2018-11-23 12:29:40,173 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 77 states. [2018-11-23 12:29:40,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:40,175 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-11-23 12:29:40,175 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-23 12:29:40,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:40,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:40,176 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:40,176 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:40,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 12:29:40,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-11-23 12:29:40,177 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 100 [2018-11-23 12:29:40,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:40,178 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-11-23 12:29:40,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 12:29:40,178 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-11-23 12:29:40,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-23 12:29:40,179 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:40,179 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 16, 16, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:29:40,180 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:40,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:40,180 INFO L82 PathProgramCache]: Analyzing trace with hash -727614313, now seen corresponding path program 16 times [2018-11-23 12:29:40,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:40,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:40,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:40,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:29:40,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:40,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:40,531 INFO L256 TraceCheckUtils]: 0: Hoare triple {8737#true} call ULTIMATE.init(); {8737#true} is VALID [2018-11-23 12:29:40,532 INFO L273 TraceCheckUtils]: 1: Hoare triple {8737#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8737#true} is VALID [2018-11-23 12:29:40,532 INFO L273 TraceCheckUtils]: 2: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:29:40,532 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8737#true} {8737#true} #66#return; {8737#true} is VALID [2018-11-23 12:29:40,532 INFO L256 TraceCheckUtils]: 4: Hoare triple {8737#true} call #t~ret13 := main(); {8737#true} is VALID [2018-11-23 12:29:40,532 INFO L273 TraceCheckUtils]: 5: Hoare triple {8737#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {8739#(= main_~i~1 0)} is VALID [2018-11-23 12:29:40,533 INFO L273 TraceCheckUtils]: 6: Hoare triple {8739#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8739#(= main_~i~1 0)} is VALID [2018-11-23 12:29:40,533 INFO L273 TraceCheckUtils]: 7: Hoare triple {8739#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8740#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:40,534 INFO L273 TraceCheckUtils]: 8: Hoare triple {8740#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8740#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:40,534 INFO L273 TraceCheckUtils]: 9: Hoare triple {8740#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8741#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:40,534 INFO L273 TraceCheckUtils]: 10: Hoare triple {8741#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8741#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:40,535 INFO L273 TraceCheckUtils]: 11: Hoare triple {8741#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8742#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:40,535 INFO L273 TraceCheckUtils]: 12: Hoare triple {8742#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8742#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:40,536 INFO L273 TraceCheckUtils]: 13: Hoare triple {8742#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8743#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:40,536 INFO L273 TraceCheckUtils]: 14: Hoare triple {8743#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8743#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:40,536 INFO L273 TraceCheckUtils]: 15: Hoare triple {8743#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8744#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:40,537 INFO L273 TraceCheckUtils]: 16: Hoare triple {8744#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8744#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:40,538 INFO L273 TraceCheckUtils]: 17: Hoare triple {8744#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8745#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:40,538 INFO L273 TraceCheckUtils]: 18: Hoare triple {8745#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8745#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:40,539 INFO L273 TraceCheckUtils]: 19: Hoare triple {8745#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8746#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:40,539 INFO L273 TraceCheckUtils]: 20: Hoare triple {8746#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8746#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:40,540 INFO L273 TraceCheckUtils]: 21: Hoare triple {8746#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8747#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:40,541 INFO L273 TraceCheckUtils]: 22: Hoare triple {8747#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8747#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:40,542 INFO L273 TraceCheckUtils]: 23: Hoare triple {8747#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8748#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:40,542 INFO L273 TraceCheckUtils]: 24: Hoare triple {8748#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8748#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:40,543 INFO L273 TraceCheckUtils]: 25: Hoare triple {8748#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8749#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:40,543 INFO L273 TraceCheckUtils]: 26: Hoare triple {8749#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8749#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:40,544 INFO L273 TraceCheckUtils]: 27: Hoare triple {8749#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8750#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:40,545 INFO L273 TraceCheckUtils]: 28: Hoare triple {8750#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8750#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:40,545 INFO L273 TraceCheckUtils]: 29: Hoare triple {8750#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8751#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:40,546 INFO L273 TraceCheckUtils]: 30: Hoare triple {8751#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8751#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:40,547 INFO L273 TraceCheckUtils]: 31: Hoare triple {8751#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8752#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:40,547 INFO L273 TraceCheckUtils]: 32: Hoare triple {8752#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8752#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:40,548 INFO L273 TraceCheckUtils]: 33: Hoare triple {8752#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8753#(<= main_~i~1 14)} is VALID [2018-11-23 12:29:40,549 INFO L273 TraceCheckUtils]: 34: Hoare triple {8753#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8753#(<= main_~i~1 14)} is VALID [2018-11-23 12:29:40,549 INFO L273 TraceCheckUtils]: 35: Hoare triple {8753#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8754#(<= main_~i~1 15)} is VALID [2018-11-23 12:29:40,550 INFO L273 TraceCheckUtils]: 36: Hoare triple {8754#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8754#(<= main_~i~1 15)} is VALID [2018-11-23 12:29:40,551 INFO L273 TraceCheckUtils]: 37: Hoare triple {8754#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8755#(<= main_~i~1 16)} is VALID [2018-11-23 12:29:40,552 INFO L273 TraceCheckUtils]: 38: Hoare triple {8755#(<= main_~i~1 16)} assume !(~i~1 < 100000); {8738#false} is VALID [2018-11-23 12:29:40,552 INFO L256 TraceCheckUtils]: 39: Hoare triple {8738#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {8737#true} is VALID [2018-11-23 12:29:40,552 INFO L273 TraceCheckUtils]: 40: Hoare triple {8737#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {8737#true} is VALID [2018-11-23 12:29:40,552 INFO L273 TraceCheckUtils]: 41: Hoare triple {8737#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:29:40,552 INFO L273 TraceCheckUtils]: 42: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:29:40,553 INFO L273 TraceCheckUtils]: 43: Hoare triple {8737#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:29:40,553 INFO L273 TraceCheckUtils]: 44: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:29:40,553 INFO L273 TraceCheckUtils]: 45: Hoare triple {8737#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:29:40,553 INFO L273 TraceCheckUtils]: 46: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:29:40,553 INFO L273 TraceCheckUtils]: 47: Hoare triple {8737#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:29:40,554 INFO L273 TraceCheckUtils]: 48: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:29:40,554 INFO L273 TraceCheckUtils]: 49: Hoare triple {8737#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:29:40,554 INFO L273 TraceCheckUtils]: 50: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:29:40,554 INFO L273 TraceCheckUtils]: 51: Hoare triple {8737#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:29:40,554 INFO L273 TraceCheckUtils]: 52: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:29:40,555 INFO L273 TraceCheckUtils]: 53: Hoare triple {8737#true} assume !(~i~0 < 100000); {8737#true} is VALID [2018-11-23 12:29:40,555 INFO L273 TraceCheckUtils]: 54: Hoare triple {8737#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8737#true} is VALID [2018-11-23 12:29:40,555 INFO L273 TraceCheckUtils]: 55: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:29:40,555 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {8737#true} {8738#false} #70#return; {8738#false} is VALID [2018-11-23 12:29:40,555 INFO L273 TraceCheckUtils]: 57: Hoare triple {8738#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {8738#false} is VALID [2018-11-23 12:29:40,556 INFO L256 TraceCheckUtils]: 58: Hoare triple {8738#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {8737#true} is VALID [2018-11-23 12:29:40,556 INFO L273 TraceCheckUtils]: 59: Hoare triple {8737#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {8737#true} is VALID [2018-11-23 12:29:40,556 INFO L273 TraceCheckUtils]: 60: Hoare triple {8737#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:29:40,556 INFO L273 TraceCheckUtils]: 61: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:29:40,557 INFO L273 TraceCheckUtils]: 62: Hoare triple {8737#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:29:40,557 INFO L273 TraceCheckUtils]: 63: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:29:40,557 INFO L273 TraceCheckUtils]: 64: Hoare triple {8737#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:29:40,557 INFO L273 TraceCheckUtils]: 65: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:29:40,557 INFO L273 TraceCheckUtils]: 66: Hoare triple {8737#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:29:40,557 INFO L273 TraceCheckUtils]: 67: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:29:40,557 INFO L273 TraceCheckUtils]: 68: Hoare triple {8737#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:29:40,557 INFO L273 TraceCheckUtils]: 69: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:29:40,558 INFO L273 TraceCheckUtils]: 70: Hoare triple {8737#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:29:40,558 INFO L273 TraceCheckUtils]: 71: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:29:40,558 INFO L273 TraceCheckUtils]: 72: Hoare triple {8737#true} assume !(~i~0 < 100000); {8737#true} is VALID [2018-11-23 12:29:40,558 INFO L273 TraceCheckUtils]: 73: Hoare triple {8737#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8737#true} is VALID [2018-11-23 12:29:40,558 INFO L273 TraceCheckUtils]: 74: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:29:40,558 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {8737#true} {8738#false} #72#return; {8738#false} is VALID [2018-11-23 12:29:40,558 INFO L273 TraceCheckUtils]: 76: Hoare triple {8738#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {8738#false} is VALID [2018-11-23 12:29:40,558 INFO L273 TraceCheckUtils]: 77: Hoare triple {8738#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {8738#false} is VALID [2018-11-23 12:29:40,558 INFO L273 TraceCheckUtils]: 78: Hoare triple {8738#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {8738#false} is VALID [2018-11-23 12:29:40,559 INFO L273 TraceCheckUtils]: 79: Hoare triple {8738#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {8738#false} is VALID [2018-11-23 12:29:40,559 INFO L273 TraceCheckUtils]: 80: Hoare triple {8738#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {8738#false} is VALID [2018-11-23 12:29:40,559 INFO L273 TraceCheckUtils]: 81: Hoare triple {8738#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {8738#false} is VALID [2018-11-23 12:29:40,559 INFO L273 TraceCheckUtils]: 82: Hoare triple {8738#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {8738#false} is VALID [2018-11-23 12:29:40,559 INFO L273 TraceCheckUtils]: 83: Hoare triple {8738#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {8738#false} is VALID [2018-11-23 12:29:40,559 INFO L273 TraceCheckUtils]: 84: Hoare triple {8738#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {8738#false} is VALID [2018-11-23 12:29:40,559 INFO L273 TraceCheckUtils]: 85: Hoare triple {8738#false} assume !(~i~2 < 99999); {8738#false} is VALID [2018-11-23 12:29:40,559 INFO L273 TraceCheckUtils]: 86: Hoare triple {8738#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {8738#false} is VALID [2018-11-23 12:29:40,560 INFO L256 TraceCheckUtils]: 87: Hoare triple {8738#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {8737#true} is VALID [2018-11-23 12:29:40,560 INFO L273 TraceCheckUtils]: 88: Hoare triple {8737#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {8737#true} is VALID [2018-11-23 12:29:40,560 INFO L273 TraceCheckUtils]: 89: Hoare triple {8737#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:29:40,560 INFO L273 TraceCheckUtils]: 90: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:29:40,560 INFO L273 TraceCheckUtils]: 91: Hoare triple {8737#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:29:40,560 INFO L273 TraceCheckUtils]: 92: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:29:40,560 INFO L273 TraceCheckUtils]: 93: Hoare triple {8737#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:29:40,560 INFO L273 TraceCheckUtils]: 94: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:29:40,560 INFO L273 TraceCheckUtils]: 95: Hoare triple {8737#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:29:40,561 INFO L273 TraceCheckUtils]: 96: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:29:40,561 INFO L273 TraceCheckUtils]: 97: Hoare triple {8737#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:29:40,561 INFO L273 TraceCheckUtils]: 98: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:29:40,561 INFO L273 TraceCheckUtils]: 99: Hoare triple {8737#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:29:40,561 INFO L273 TraceCheckUtils]: 100: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:29:40,561 INFO L273 TraceCheckUtils]: 101: Hoare triple {8737#true} assume !(~i~0 < 100000); {8737#true} is VALID [2018-11-23 12:29:40,561 INFO L273 TraceCheckUtils]: 102: Hoare triple {8737#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8737#true} is VALID [2018-11-23 12:29:40,561 INFO L273 TraceCheckUtils]: 103: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:29:40,562 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {8737#true} {8738#false} #74#return; {8738#false} is VALID [2018-11-23 12:29:40,562 INFO L273 TraceCheckUtils]: 105: Hoare triple {8738#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {8738#false} is VALID [2018-11-23 12:29:40,562 INFO L273 TraceCheckUtils]: 106: Hoare triple {8738#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {8738#false} is VALID [2018-11-23 12:29:40,562 INFO L273 TraceCheckUtils]: 107: Hoare triple {8738#false} assume !false; {8738#false} is VALID [2018-11-23 12:29:40,567 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2018-11-23 12:29:40,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:29:40,568 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 12:29:40,578 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:29:40,626 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:29:40,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:29:40,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:40,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:29:40,884 INFO L256 TraceCheckUtils]: 0: Hoare triple {8737#true} call ULTIMATE.init(); {8737#true} is VALID [2018-11-23 12:29:40,884 INFO L273 TraceCheckUtils]: 1: Hoare triple {8737#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8737#true} is VALID [2018-11-23 12:29:40,884 INFO L273 TraceCheckUtils]: 2: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:29:40,885 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8737#true} {8737#true} #66#return; {8737#true} is VALID [2018-11-23 12:29:40,885 INFO L256 TraceCheckUtils]: 4: Hoare triple {8737#true} call #t~ret13 := main(); {8737#true} is VALID [2018-11-23 12:29:40,886 INFO L273 TraceCheckUtils]: 5: Hoare triple {8737#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {8774#(<= main_~i~1 0)} is VALID [2018-11-23 12:29:40,886 INFO L273 TraceCheckUtils]: 6: Hoare triple {8774#(<= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8774#(<= main_~i~1 0)} is VALID [2018-11-23 12:29:40,888 INFO L273 TraceCheckUtils]: 7: Hoare triple {8774#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8740#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:40,888 INFO L273 TraceCheckUtils]: 8: Hoare triple {8740#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8740#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:40,890 INFO L273 TraceCheckUtils]: 9: Hoare triple {8740#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8741#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:40,890 INFO L273 TraceCheckUtils]: 10: Hoare triple {8741#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8741#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:40,893 INFO L273 TraceCheckUtils]: 11: Hoare triple {8741#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8742#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:40,893 INFO L273 TraceCheckUtils]: 12: Hoare triple {8742#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8742#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:40,895 INFO L273 TraceCheckUtils]: 13: Hoare triple {8742#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8743#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:40,895 INFO L273 TraceCheckUtils]: 14: Hoare triple {8743#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8743#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:40,898 INFO L273 TraceCheckUtils]: 15: Hoare triple {8743#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8744#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:40,898 INFO L273 TraceCheckUtils]: 16: Hoare triple {8744#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8744#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:40,901 INFO L273 TraceCheckUtils]: 17: Hoare triple {8744#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8745#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:40,901 INFO L273 TraceCheckUtils]: 18: Hoare triple {8745#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8745#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:40,904 INFO L273 TraceCheckUtils]: 19: Hoare triple {8745#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8746#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:40,904 INFO L273 TraceCheckUtils]: 20: Hoare triple {8746#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8746#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:40,906 INFO L273 TraceCheckUtils]: 21: Hoare triple {8746#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8747#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:40,906 INFO L273 TraceCheckUtils]: 22: Hoare triple {8747#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8747#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:40,908 INFO L273 TraceCheckUtils]: 23: Hoare triple {8747#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8748#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:40,908 INFO L273 TraceCheckUtils]: 24: Hoare triple {8748#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8748#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:40,910 INFO L273 TraceCheckUtils]: 25: Hoare triple {8748#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8749#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:40,910 INFO L273 TraceCheckUtils]: 26: Hoare triple {8749#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8749#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:40,913 INFO L273 TraceCheckUtils]: 27: Hoare triple {8749#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8750#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:40,913 INFO L273 TraceCheckUtils]: 28: Hoare triple {8750#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8750#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:40,915 INFO L273 TraceCheckUtils]: 29: Hoare triple {8750#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8751#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:40,915 INFO L273 TraceCheckUtils]: 30: Hoare triple {8751#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8751#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:40,915 INFO L273 TraceCheckUtils]: 31: Hoare triple {8751#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8752#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:40,917 INFO L273 TraceCheckUtils]: 32: Hoare triple {8752#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8752#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:40,917 INFO L273 TraceCheckUtils]: 33: Hoare triple {8752#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8753#(<= main_~i~1 14)} is VALID [2018-11-23 12:29:40,919 INFO L273 TraceCheckUtils]: 34: Hoare triple {8753#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8753#(<= main_~i~1 14)} is VALID [2018-11-23 12:29:40,921 INFO L273 TraceCheckUtils]: 35: Hoare triple {8753#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8754#(<= main_~i~1 15)} is VALID [2018-11-23 12:29:40,924 INFO L273 TraceCheckUtils]: 36: Hoare triple {8754#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8754#(<= main_~i~1 15)} is VALID [2018-11-23 12:29:40,924 INFO L273 TraceCheckUtils]: 37: Hoare triple {8754#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8755#(<= main_~i~1 16)} is VALID [2018-11-23 12:29:40,926 INFO L273 TraceCheckUtils]: 38: Hoare triple {8755#(<= main_~i~1 16)} assume !(~i~1 < 100000); {8738#false} is VALID [2018-11-23 12:29:40,926 INFO L256 TraceCheckUtils]: 39: Hoare triple {8738#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {8738#false} is VALID [2018-11-23 12:29:40,926 INFO L273 TraceCheckUtils]: 40: Hoare triple {8738#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {8738#false} is VALID [2018-11-23 12:29:40,926 INFO L273 TraceCheckUtils]: 41: Hoare triple {8738#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:29:40,926 INFO L273 TraceCheckUtils]: 42: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:29:40,926 INFO L273 TraceCheckUtils]: 43: Hoare triple {8738#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:29:40,926 INFO L273 TraceCheckUtils]: 44: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:29:40,927 INFO L273 TraceCheckUtils]: 45: Hoare triple {8738#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:29:40,927 INFO L273 TraceCheckUtils]: 46: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:29:40,927 INFO L273 TraceCheckUtils]: 47: Hoare triple {8738#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:29:40,927 INFO L273 TraceCheckUtils]: 48: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:29:40,927 INFO L273 TraceCheckUtils]: 49: Hoare triple {8738#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:29:40,927 INFO L273 TraceCheckUtils]: 50: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:29:40,927 INFO L273 TraceCheckUtils]: 51: Hoare triple {8738#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:29:40,927 INFO L273 TraceCheckUtils]: 52: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:29:40,928 INFO L273 TraceCheckUtils]: 53: Hoare triple {8738#false} assume !(~i~0 < 100000); {8738#false} is VALID [2018-11-23 12:29:40,928 INFO L273 TraceCheckUtils]: 54: Hoare triple {8738#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8738#false} is VALID [2018-11-23 12:29:40,928 INFO L273 TraceCheckUtils]: 55: Hoare triple {8738#false} assume true; {8738#false} is VALID [2018-11-23 12:29:40,928 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {8738#false} {8738#false} #70#return; {8738#false} is VALID [2018-11-23 12:29:40,928 INFO L273 TraceCheckUtils]: 57: Hoare triple {8738#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {8738#false} is VALID [2018-11-23 12:29:40,928 INFO L256 TraceCheckUtils]: 58: Hoare triple {8738#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {8738#false} is VALID [2018-11-23 12:29:40,928 INFO L273 TraceCheckUtils]: 59: Hoare triple {8738#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {8738#false} is VALID [2018-11-23 12:29:40,928 INFO L273 TraceCheckUtils]: 60: Hoare triple {8738#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:29:40,928 INFO L273 TraceCheckUtils]: 61: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:29:40,929 INFO L273 TraceCheckUtils]: 62: Hoare triple {8738#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:29:40,929 INFO L273 TraceCheckUtils]: 63: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:29:40,929 INFO L273 TraceCheckUtils]: 64: Hoare triple {8738#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:29:40,929 INFO L273 TraceCheckUtils]: 65: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:29:40,929 INFO L273 TraceCheckUtils]: 66: Hoare triple {8738#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:29:40,929 INFO L273 TraceCheckUtils]: 67: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:29:40,929 INFO L273 TraceCheckUtils]: 68: Hoare triple {8738#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:29:40,929 INFO L273 TraceCheckUtils]: 69: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:29:40,929 INFO L273 TraceCheckUtils]: 70: Hoare triple {8738#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:29:40,930 INFO L273 TraceCheckUtils]: 71: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:29:40,930 INFO L273 TraceCheckUtils]: 72: Hoare triple {8738#false} assume !(~i~0 < 100000); {8738#false} is VALID [2018-11-23 12:29:40,930 INFO L273 TraceCheckUtils]: 73: Hoare triple {8738#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8738#false} is VALID [2018-11-23 12:29:40,930 INFO L273 TraceCheckUtils]: 74: Hoare triple {8738#false} assume true; {8738#false} is VALID [2018-11-23 12:29:40,930 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {8738#false} {8738#false} #72#return; {8738#false} is VALID [2018-11-23 12:29:40,930 INFO L273 TraceCheckUtils]: 76: Hoare triple {8738#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {8738#false} is VALID [2018-11-23 12:29:40,930 INFO L273 TraceCheckUtils]: 77: Hoare triple {8738#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {8738#false} is VALID [2018-11-23 12:29:40,930 INFO L273 TraceCheckUtils]: 78: Hoare triple {8738#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {8738#false} is VALID [2018-11-23 12:29:40,931 INFO L273 TraceCheckUtils]: 79: Hoare triple {8738#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {8738#false} is VALID [2018-11-23 12:29:40,931 INFO L273 TraceCheckUtils]: 80: Hoare triple {8738#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {8738#false} is VALID [2018-11-23 12:29:40,931 INFO L273 TraceCheckUtils]: 81: Hoare triple {8738#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {8738#false} is VALID [2018-11-23 12:29:40,931 INFO L273 TraceCheckUtils]: 82: Hoare triple {8738#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {8738#false} is VALID [2018-11-23 12:29:40,931 INFO L273 TraceCheckUtils]: 83: Hoare triple {8738#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {8738#false} is VALID [2018-11-23 12:29:40,931 INFO L273 TraceCheckUtils]: 84: Hoare triple {8738#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {8738#false} is VALID [2018-11-23 12:29:40,931 INFO L273 TraceCheckUtils]: 85: Hoare triple {8738#false} assume !(~i~2 < 99999); {8738#false} is VALID [2018-11-23 12:29:40,931 INFO L273 TraceCheckUtils]: 86: Hoare triple {8738#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {8738#false} is VALID [2018-11-23 12:29:40,931 INFO L256 TraceCheckUtils]: 87: Hoare triple {8738#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {8738#false} is VALID [2018-11-23 12:29:40,932 INFO L273 TraceCheckUtils]: 88: Hoare triple {8738#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {8738#false} is VALID [2018-11-23 12:29:40,932 INFO L273 TraceCheckUtils]: 89: Hoare triple {8738#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:29:40,932 INFO L273 TraceCheckUtils]: 90: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:29:40,932 INFO L273 TraceCheckUtils]: 91: Hoare triple {8738#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:29:40,932 INFO L273 TraceCheckUtils]: 92: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:29:40,932 INFO L273 TraceCheckUtils]: 93: Hoare triple {8738#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:29:40,932 INFO L273 TraceCheckUtils]: 94: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:29:40,932 INFO L273 TraceCheckUtils]: 95: Hoare triple {8738#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:29:40,933 INFO L273 TraceCheckUtils]: 96: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:29:40,933 INFO L273 TraceCheckUtils]: 97: Hoare triple {8738#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:29:40,933 INFO L273 TraceCheckUtils]: 98: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:29:40,933 INFO L273 TraceCheckUtils]: 99: Hoare triple {8738#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:29:40,933 INFO L273 TraceCheckUtils]: 100: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:29:40,933 INFO L273 TraceCheckUtils]: 101: Hoare triple {8738#false} assume !(~i~0 < 100000); {8738#false} is VALID [2018-11-23 12:29:40,933 INFO L273 TraceCheckUtils]: 102: Hoare triple {8738#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8738#false} is VALID [2018-11-23 12:29:40,933 INFO L273 TraceCheckUtils]: 103: Hoare triple {8738#false} assume true; {8738#false} is VALID [2018-11-23 12:29:40,933 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {8738#false} {8738#false} #74#return; {8738#false} is VALID [2018-11-23 12:29:40,934 INFO L273 TraceCheckUtils]: 105: Hoare triple {8738#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {8738#false} is VALID [2018-11-23 12:29:40,934 INFO L273 TraceCheckUtils]: 106: Hoare triple {8738#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {8738#false} is VALID [2018-11-23 12:29:40,934 INFO L273 TraceCheckUtils]: 107: Hoare triple {8738#false} assume !false; {8738#false} is VALID [2018-11-23 12:29:40,939 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2018-11-23 12:29:40,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:29:40,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 12:29:40,959 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 108 [2018-11-23 12:29:40,960 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:29:40,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 12:29:41,071 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 12:29:41,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 12:29:41,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 12:29:41,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:29:41,072 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 20 states. [2018-11-23 12:29:41,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:41,645 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2018-11-23 12:29:41,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:29:41,645 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 108 [2018-11-23 12:29:41,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:41,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:29:41,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 86 transitions. [2018-11-23 12:29:41,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:29:41,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 86 transitions. [2018-11-23 12:29:41,648 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 86 transitions. [2018-11-23 12:29:41,856 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 12:29:41,858 INFO L225 Difference]: With dead ends: 114 [2018-11-23 12:29:41,858 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 12:29:41,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 108 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 12:29:41,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 12:29:41,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-11-23 12:29:41,894 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:41,894 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 77 states. [2018-11-23 12:29:41,894 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 77 states. [2018-11-23 12:29:41,894 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 77 states. [2018-11-23 12:29:41,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:41,896 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-11-23 12:29:41,896 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-11-23 12:29:41,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:41,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:41,896 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 78 states. [2018-11-23 12:29:41,897 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 78 states. [2018-11-23 12:29:41,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:41,898 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-11-23 12:29:41,898 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-11-23 12:29:41,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:41,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:41,899 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:41,899 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:41,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-23 12:29:41,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-11-23 12:29:41,901 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 108 [2018-11-23 12:29:41,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:41,901 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-11-23 12:29:41,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 12:29:41,902 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-23 12:29:41,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-23 12:29:41,903 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:41,903 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:29:41,903 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:41,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:41,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1948648953, now seen corresponding path program 17 times [2018-11-23 12:29:41,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:41,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:41,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:41,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:29:41,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:41,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:42,820 INFO L256 TraceCheckUtils]: 0: Hoare triple {9519#true} call ULTIMATE.init(); {9519#true} is VALID [2018-11-23 12:29:42,820 INFO L273 TraceCheckUtils]: 1: Hoare triple {9519#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9519#true} is VALID [2018-11-23 12:29:42,820 INFO L273 TraceCheckUtils]: 2: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:29:42,821 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9519#true} {9519#true} #66#return; {9519#true} is VALID [2018-11-23 12:29:42,821 INFO L256 TraceCheckUtils]: 4: Hoare triple {9519#true} call #t~ret13 := main(); {9519#true} is VALID [2018-11-23 12:29:42,821 INFO L273 TraceCheckUtils]: 5: Hoare triple {9519#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {9521#(= main_~i~1 0)} is VALID [2018-11-23 12:29:42,821 INFO L273 TraceCheckUtils]: 6: Hoare triple {9521#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9521#(= main_~i~1 0)} is VALID [2018-11-23 12:29:42,822 INFO L273 TraceCheckUtils]: 7: Hoare triple {9521#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9522#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:42,822 INFO L273 TraceCheckUtils]: 8: Hoare triple {9522#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9522#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:42,823 INFO L273 TraceCheckUtils]: 9: Hoare triple {9522#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9523#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:42,824 INFO L273 TraceCheckUtils]: 10: Hoare triple {9523#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9523#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:42,825 INFO L273 TraceCheckUtils]: 11: Hoare triple {9523#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9524#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:42,825 INFO L273 TraceCheckUtils]: 12: Hoare triple {9524#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9524#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:42,826 INFO L273 TraceCheckUtils]: 13: Hoare triple {9524#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9525#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:42,826 INFO L273 TraceCheckUtils]: 14: Hoare triple {9525#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9525#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:42,827 INFO L273 TraceCheckUtils]: 15: Hoare triple {9525#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9526#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:42,828 INFO L273 TraceCheckUtils]: 16: Hoare triple {9526#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9526#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:42,828 INFO L273 TraceCheckUtils]: 17: Hoare triple {9526#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9527#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:42,829 INFO L273 TraceCheckUtils]: 18: Hoare triple {9527#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9527#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:42,830 INFO L273 TraceCheckUtils]: 19: Hoare triple {9527#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9528#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:42,830 INFO L273 TraceCheckUtils]: 20: Hoare triple {9528#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9528#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:42,849 INFO L273 TraceCheckUtils]: 21: Hoare triple {9528#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9529#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:42,850 INFO L273 TraceCheckUtils]: 22: Hoare triple {9529#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9529#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:42,851 INFO L273 TraceCheckUtils]: 23: Hoare triple {9529#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9530#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:42,851 INFO L273 TraceCheckUtils]: 24: Hoare triple {9530#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9530#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:42,852 INFO L273 TraceCheckUtils]: 25: Hoare triple {9530#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9531#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:42,853 INFO L273 TraceCheckUtils]: 26: Hoare triple {9531#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9531#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:42,854 INFO L273 TraceCheckUtils]: 27: Hoare triple {9531#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9532#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:42,854 INFO L273 TraceCheckUtils]: 28: Hoare triple {9532#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9532#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:42,855 INFO L273 TraceCheckUtils]: 29: Hoare triple {9532#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9533#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:42,855 INFO L273 TraceCheckUtils]: 30: Hoare triple {9533#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9533#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:42,856 INFO L273 TraceCheckUtils]: 31: Hoare triple {9533#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9534#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:42,856 INFO L273 TraceCheckUtils]: 32: Hoare triple {9534#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9534#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:42,856 INFO L273 TraceCheckUtils]: 33: Hoare triple {9534#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9535#(<= main_~i~1 14)} is VALID [2018-11-23 12:29:42,857 INFO L273 TraceCheckUtils]: 34: Hoare triple {9535#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9535#(<= main_~i~1 14)} is VALID [2018-11-23 12:29:42,857 INFO L273 TraceCheckUtils]: 35: Hoare triple {9535#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9536#(<= main_~i~1 15)} is VALID [2018-11-23 12:29:42,858 INFO L273 TraceCheckUtils]: 36: Hoare triple {9536#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9536#(<= main_~i~1 15)} is VALID [2018-11-23 12:29:42,858 INFO L273 TraceCheckUtils]: 37: Hoare triple {9536#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9537#(<= main_~i~1 16)} is VALID [2018-11-23 12:29:42,859 INFO L273 TraceCheckUtils]: 38: Hoare triple {9537#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9537#(<= main_~i~1 16)} is VALID [2018-11-23 12:29:42,860 INFO L273 TraceCheckUtils]: 39: Hoare triple {9537#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9538#(<= main_~i~1 17)} is VALID [2018-11-23 12:29:42,861 INFO L273 TraceCheckUtils]: 40: Hoare triple {9538#(<= main_~i~1 17)} assume !(~i~1 < 100000); {9520#false} is VALID [2018-11-23 12:29:42,861 INFO L256 TraceCheckUtils]: 41: Hoare triple {9520#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {9519#true} is VALID [2018-11-23 12:29:42,861 INFO L273 TraceCheckUtils]: 42: Hoare triple {9519#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {9519#true} is VALID [2018-11-23 12:29:42,861 INFO L273 TraceCheckUtils]: 43: Hoare triple {9519#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:29:42,861 INFO L273 TraceCheckUtils]: 44: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:29:42,862 INFO L273 TraceCheckUtils]: 45: Hoare triple {9519#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:29:42,862 INFO L273 TraceCheckUtils]: 46: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:29:42,862 INFO L273 TraceCheckUtils]: 47: Hoare triple {9519#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:29:42,862 INFO L273 TraceCheckUtils]: 48: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:29:42,862 INFO L273 TraceCheckUtils]: 49: Hoare triple {9519#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:29:42,863 INFO L273 TraceCheckUtils]: 50: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:29:42,863 INFO L273 TraceCheckUtils]: 51: Hoare triple {9519#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:29:42,863 INFO L273 TraceCheckUtils]: 52: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:29:42,863 INFO L273 TraceCheckUtils]: 53: Hoare triple {9519#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:29:42,863 INFO L273 TraceCheckUtils]: 54: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:29:42,863 INFO L273 TraceCheckUtils]: 55: Hoare triple {9519#true} assume !(~i~0 < 100000); {9519#true} is VALID [2018-11-23 12:29:42,863 INFO L273 TraceCheckUtils]: 56: Hoare triple {9519#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {9519#true} is VALID [2018-11-23 12:29:42,864 INFO L273 TraceCheckUtils]: 57: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:29:42,864 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {9519#true} {9520#false} #70#return; {9520#false} is VALID [2018-11-23 12:29:42,864 INFO L273 TraceCheckUtils]: 59: Hoare triple {9520#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {9520#false} is VALID [2018-11-23 12:29:42,864 INFO L256 TraceCheckUtils]: 60: Hoare triple {9520#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {9519#true} is VALID [2018-11-23 12:29:42,864 INFO L273 TraceCheckUtils]: 61: Hoare triple {9519#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {9519#true} is VALID [2018-11-23 12:29:42,864 INFO L273 TraceCheckUtils]: 62: Hoare triple {9519#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:29:42,864 INFO L273 TraceCheckUtils]: 63: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:29:42,864 INFO L273 TraceCheckUtils]: 64: Hoare triple {9519#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:29:42,865 INFO L273 TraceCheckUtils]: 65: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:29:42,865 INFO L273 TraceCheckUtils]: 66: Hoare triple {9519#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:29:42,865 INFO L273 TraceCheckUtils]: 67: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:29:42,865 INFO L273 TraceCheckUtils]: 68: Hoare triple {9519#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:29:42,865 INFO L273 TraceCheckUtils]: 69: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:29:42,865 INFO L273 TraceCheckUtils]: 70: Hoare triple {9519#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:29:42,865 INFO L273 TraceCheckUtils]: 71: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:29:42,865 INFO L273 TraceCheckUtils]: 72: Hoare triple {9519#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:29:42,865 INFO L273 TraceCheckUtils]: 73: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:29:42,866 INFO L273 TraceCheckUtils]: 74: Hoare triple {9519#true} assume !(~i~0 < 100000); {9519#true} is VALID [2018-11-23 12:29:42,866 INFO L273 TraceCheckUtils]: 75: Hoare triple {9519#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {9519#true} is VALID [2018-11-23 12:29:42,866 INFO L273 TraceCheckUtils]: 76: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:29:42,866 INFO L268 TraceCheckUtils]: 77: Hoare quadruple {9519#true} {9520#false} #72#return; {9520#false} is VALID [2018-11-23 12:29:42,866 INFO L273 TraceCheckUtils]: 78: Hoare triple {9520#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {9520#false} is VALID [2018-11-23 12:29:42,866 INFO L273 TraceCheckUtils]: 79: Hoare triple {9520#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {9520#false} is VALID [2018-11-23 12:29:42,866 INFO L273 TraceCheckUtils]: 80: Hoare triple {9520#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {9520#false} is VALID [2018-11-23 12:29:42,866 INFO L273 TraceCheckUtils]: 81: Hoare triple {9520#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {9520#false} is VALID [2018-11-23 12:29:42,867 INFO L273 TraceCheckUtils]: 82: Hoare triple {9520#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {9520#false} is VALID [2018-11-23 12:29:42,867 INFO L273 TraceCheckUtils]: 83: Hoare triple {9520#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {9520#false} is VALID [2018-11-23 12:29:42,867 INFO L273 TraceCheckUtils]: 84: Hoare triple {9520#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {9520#false} is VALID [2018-11-23 12:29:42,867 INFO L273 TraceCheckUtils]: 85: Hoare triple {9520#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {9520#false} is VALID [2018-11-23 12:29:42,867 INFO L273 TraceCheckUtils]: 86: Hoare triple {9520#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {9520#false} is VALID [2018-11-23 12:29:42,867 INFO L273 TraceCheckUtils]: 87: Hoare triple {9520#false} assume !(~i~2 < 99999); {9520#false} is VALID [2018-11-23 12:29:42,867 INFO L273 TraceCheckUtils]: 88: Hoare triple {9520#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {9520#false} is VALID [2018-11-23 12:29:42,867 INFO L256 TraceCheckUtils]: 89: Hoare triple {9520#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {9519#true} is VALID [2018-11-23 12:29:42,867 INFO L273 TraceCheckUtils]: 90: Hoare triple {9519#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {9519#true} is VALID [2018-11-23 12:29:42,868 INFO L273 TraceCheckUtils]: 91: Hoare triple {9519#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:29:42,868 INFO L273 TraceCheckUtils]: 92: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:29:42,868 INFO L273 TraceCheckUtils]: 93: Hoare triple {9519#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:29:42,868 INFO L273 TraceCheckUtils]: 94: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:29:42,868 INFO L273 TraceCheckUtils]: 95: Hoare triple {9519#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:29:42,868 INFO L273 TraceCheckUtils]: 96: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:29:42,868 INFO L273 TraceCheckUtils]: 97: Hoare triple {9519#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:29:42,868 INFO L273 TraceCheckUtils]: 98: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:29:42,869 INFO L273 TraceCheckUtils]: 99: Hoare triple {9519#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:29:42,869 INFO L273 TraceCheckUtils]: 100: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:29:42,869 INFO L273 TraceCheckUtils]: 101: Hoare triple {9519#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:29:42,869 INFO L273 TraceCheckUtils]: 102: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:29:42,869 INFO L273 TraceCheckUtils]: 103: Hoare triple {9519#true} assume !(~i~0 < 100000); {9519#true} is VALID [2018-11-23 12:29:42,869 INFO L273 TraceCheckUtils]: 104: Hoare triple {9519#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {9519#true} is VALID [2018-11-23 12:29:42,869 INFO L273 TraceCheckUtils]: 105: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:29:42,869 INFO L268 TraceCheckUtils]: 106: Hoare quadruple {9519#true} {9520#false} #74#return; {9520#false} is VALID [2018-11-23 12:29:42,869 INFO L273 TraceCheckUtils]: 107: Hoare triple {9520#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {9520#false} is VALID [2018-11-23 12:29:42,870 INFO L273 TraceCheckUtils]: 108: Hoare triple {9520#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {9520#false} is VALID [2018-11-23 12:29:42,870 INFO L273 TraceCheckUtils]: 109: Hoare triple {9520#false} assume !false; {9520#false} is VALID [2018-11-23 12:29:42,875 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2018-11-23 12:29:42,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:29:42,875 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 12:29:42,903 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:29:43,286 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2018-11-23 12:29:43,286 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:29:43,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:43,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:29:43,596 INFO L256 TraceCheckUtils]: 0: Hoare triple {9519#true} call ULTIMATE.init(); {9519#true} is VALID [2018-11-23 12:29:43,596 INFO L273 TraceCheckUtils]: 1: Hoare triple {9519#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9519#true} is VALID [2018-11-23 12:29:43,596 INFO L273 TraceCheckUtils]: 2: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:29:43,597 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9519#true} {9519#true} #66#return; {9519#true} is VALID [2018-11-23 12:29:43,597 INFO L256 TraceCheckUtils]: 4: Hoare triple {9519#true} call #t~ret13 := main(); {9519#true} is VALID [2018-11-23 12:29:43,597 INFO L273 TraceCheckUtils]: 5: Hoare triple {9519#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {9519#true} is VALID [2018-11-23 12:29:43,597 INFO L273 TraceCheckUtils]: 6: Hoare triple {9519#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:29:43,598 INFO L273 TraceCheckUtils]: 7: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:29:43,598 INFO L273 TraceCheckUtils]: 8: Hoare triple {9519#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:29:43,598 INFO L273 TraceCheckUtils]: 9: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:29:43,599 INFO L273 TraceCheckUtils]: 10: Hoare triple {9519#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:29:43,599 INFO L273 TraceCheckUtils]: 11: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:29:43,599 INFO L273 TraceCheckUtils]: 12: Hoare triple {9519#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:29:43,599 INFO L273 TraceCheckUtils]: 13: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:29:43,599 INFO L273 TraceCheckUtils]: 14: Hoare triple {9519#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:29:43,599 INFO L273 TraceCheckUtils]: 15: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:29:43,600 INFO L273 TraceCheckUtils]: 16: Hoare triple {9519#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:29:43,600 INFO L273 TraceCheckUtils]: 17: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:29:43,600 INFO L273 TraceCheckUtils]: 18: Hoare triple {9519#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:29:43,600 INFO L273 TraceCheckUtils]: 19: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:29:43,600 INFO L273 TraceCheckUtils]: 20: Hoare triple {9519#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:29:43,601 INFO L273 TraceCheckUtils]: 21: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:29:43,601 INFO L273 TraceCheckUtils]: 22: Hoare triple {9519#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:29:43,601 INFO L273 TraceCheckUtils]: 23: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:29:43,601 INFO L273 TraceCheckUtils]: 24: Hoare triple {9519#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:29:43,601 INFO L273 TraceCheckUtils]: 25: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:29:43,601 INFO L273 TraceCheckUtils]: 26: Hoare triple {9519#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:29:43,602 INFO L273 TraceCheckUtils]: 27: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:29:43,602 INFO L273 TraceCheckUtils]: 28: Hoare triple {9519#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:29:43,602 INFO L273 TraceCheckUtils]: 29: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:29:43,602 INFO L273 TraceCheckUtils]: 30: Hoare triple {9519#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:29:43,602 INFO L273 TraceCheckUtils]: 31: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:29:43,602 INFO L273 TraceCheckUtils]: 32: Hoare triple {9519#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:29:43,603 INFO L273 TraceCheckUtils]: 33: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:29:43,603 INFO L273 TraceCheckUtils]: 34: Hoare triple {9519#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:29:43,603 INFO L273 TraceCheckUtils]: 35: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:29:43,603 INFO L273 TraceCheckUtils]: 36: Hoare triple {9519#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:29:43,603 INFO L273 TraceCheckUtils]: 37: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:29:43,603 INFO L273 TraceCheckUtils]: 38: Hoare triple {9519#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:29:43,604 INFO L273 TraceCheckUtils]: 39: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:29:43,604 INFO L273 TraceCheckUtils]: 40: Hoare triple {9519#true} assume !(~i~1 < 100000); {9519#true} is VALID [2018-11-23 12:29:43,604 INFO L256 TraceCheckUtils]: 41: Hoare triple {9519#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {9519#true} is VALID [2018-11-23 12:29:43,604 INFO L273 TraceCheckUtils]: 42: Hoare triple {9519#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {9519#true} is VALID [2018-11-23 12:29:43,604 INFO L273 TraceCheckUtils]: 43: Hoare triple {9519#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:29:43,604 INFO L273 TraceCheckUtils]: 44: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:29:43,605 INFO L273 TraceCheckUtils]: 45: Hoare triple {9519#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:29:43,605 INFO L273 TraceCheckUtils]: 46: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:29:43,605 INFO L273 TraceCheckUtils]: 47: Hoare triple {9519#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:29:43,605 INFO L273 TraceCheckUtils]: 48: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:29:43,605 INFO L273 TraceCheckUtils]: 49: Hoare triple {9519#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:29:43,605 INFO L273 TraceCheckUtils]: 50: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:29:43,606 INFO L273 TraceCheckUtils]: 51: Hoare triple {9519#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:29:43,606 INFO L273 TraceCheckUtils]: 52: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:29:43,606 INFO L273 TraceCheckUtils]: 53: Hoare triple {9519#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:29:43,606 INFO L273 TraceCheckUtils]: 54: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:29:43,606 INFO L273 TraceCheckUtils]: 55: Hoare triple {9519#true} assume !(~i~0 < 100000); {9519#true} is VALID [2018-11-23 12:29:43,606 INFO L273 TraceCheckUtils]: 56: Hoare triple {9519#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {9519#true} is VALID [2018-11-23 12:29:43,607 INFO L273 TraceCheckUtils]: 57: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:29:43,607 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {9519#true} {9519#true} #70#return; {9519#true} is VALID [2018-11-23 12:29:43,607 INFO L273 TraceCheckUtils]: 59: Hoare triple {9519#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {9519#true} is VALID [2018-11-23 12:29:43,607 INFO L256 TraceCheckUtils]: 60: Hoare triple {9519#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {9519#true} is VALID [2018-11-23 12:29:43,607 INFO L273 TraceCheckUtils]: 61: Hoare triple {9519#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {9519#true} is VALID [2018-11-23 12:29:43,607 INFO L273 TraceCheckUtils]: 62: Hoare triple {9519#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:29:43,608 INFO L273 TraceCheckUtils]: 63: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:29:43,608 INFO L273 TraceCheckUtils]: 64: Hoare triple {9519#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:29:43,608 INFO L273 TraceCheckUtils]: 65: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:29:43,608 INFO L273 TraceCheckUtils]: 66: Hoare triple {9519#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:29:43,608 INFO L273 TraceCheckUtils]: 67: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:29:43,608 INFO L273 TraceCheckUtils]: 68: Hoare triple {9519#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:29:43,608 INFO L273 TraceCheckUtils]: 69: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:29:43,609 INFO L273 TraceCheckUtils]: 70: Hoare triple {9519#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:29:43,609 INFO L273 TraceCheckUtils]: 71: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:29:43,609 INFO L273 TraceCheckUtils]: 72: Hoare triple {9519#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:29:43,609 INFO L273 TraceCheckUtils]: 73: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:29:43,609 INFO L273 TraceCheckUtils]: 74: Hoare triple {9519#true} assume !(~i~0 < 100000); {9519#true} is VALID [2018-11-23 12:29:43,609 INFO L273 TraceCheckUtils]: 75: Hoare triple {9519#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {9519#true} is VALID [2018-11-23 12:29:43,610 INFO L273 TraceCheckUtils]: 76: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:29:43,610 INFO L268 TraceCheckUtils]: 77: Hoare quadruple {9519#true} {9519#true} #72#return; {9519#true} is VALID [2018-11-23 12:29:43,624 INFO L273 TraceCheckUtils]: 78: Hoare triple {9519#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {9776#(<= main_~i~2 0)} is VALID [2018-11-23 12:29:43,632 INFO L273 TraceCheckUtils]: 79: Hoare triple {9776#(<= main_~i~2 0)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {9776#(<= main_~i~2 0)} is VALID [2018-11-23 12:29:43,635 INFO L273 TraceCheckUtils]: 80: Hoare triple {9776#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {9783#(<= main_~i~2 1)} is VALID [2018-11-23 12:29:43,635 INFO L273 TraceCheckUtils]: 81: Hoare triple {9783#(<= main_~i~2 1)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {9783#(<= main_~i~2 1)} is VALID [2018-11-23 12:29:43,637 INFO L273 TraceCheckUtils]: 82: Hoare triple {9783#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {9790#(<= main_~i~2 2)} is VALID [2018-11-23 12:29:43,637 INFO L273 TraceCheckUtils]: 83: Hoare triple {9790#(<= main_~i~2 2)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {9790#(<= main_~i~2 2)} is VALID [2018-11-23 12:29:43,639 INFO L273 TraceCheckUtils]: 84: Hoare triple {9790#(<= main_~i~2 2)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {9797#(<= main_~i~2 3)} is VALID [2018-11-23 12:29:43,639 INFO L273 TraceCheckUtils]: 85: Hoare triple {9797#(<= main_~i~2 3)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {9797#(<= main_~i~2 3)} is VALID [2018-11-23 12:29:43,640 INFO L273 TraceCheckUtils]: 86: Hoare triple {9797#(<= main_~i~2 3)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {9804#(<= main_~i~2 4)} is VALID [2018-11-23 12:29:43,640 INFO L273 TraceCheckUtils]: 87: Hoare triple {9804#(<= main_~i~2 4)} assume !(~i~2 < 99999); {9520#false} is VALID [2018-11-23 12:29:43,640 INFO L273 TraceCheckUtils]: 88: Hoare triple {9520#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {9520#false} is VALID [2018-11-23 12:29:43,640 INFO L256 TraceCheckUtils]: 89: Hoare triple {9520#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {9520#false} is VALID [2018-11-23 12:29:43,640 INFO L273 TraceCheckUtils]: 90: Hoare triple {9520#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {9520#false} is VALID [2018-11-23 12:29:43,640 INFO L273 TraceCheckUtils]: 91: Hoare triple {9520#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9520#false} is VALID [2018-11-23 12:29:43,641 INFO L273 TraceCheckUtils]: 92: Hoare triple {9520#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9520#false} is VALID [2018-11-23 12:29:43,641 INFO L273 TraceCheckUtils]: 93: Hoare triple {9520#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9520#false} is VALID [2018-11-23 12:29:43,641 INFO L273 TraceCheckUtils]: 94: Hoare triple {9520#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9520#false} is VALID [2018-11-23 12:29:43,641 INFO L273 TraceCheckUtils]: 95: Hoare triple {9520#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9520#false} is VALID [2018-11-23 12:29:43,641 INFO L273 TraceCheckUtils]: 96: Hoare triple {9520#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9520#false} is VALID [2018-11-23 12:29:43,641 INFO L273 TraceCheckUtils]: 97: Hoare triple {9520#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9520#false} is VALID [2018-11-23 12:29:43,642 INFO L273 TraceCheckUtils]: 98: Hoare triple {9520#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9520#false} is VALID [2018-11-23 12:29:43,642 INFO L273 TraceCheckUtils]: 99: Hoare triple {9520#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9520#false} is VALID [2018-11-23 12:29:43,642 INFO L273 TraceCheckUtils]: 100: Hoare triple {9520#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9520#false} is VALID [2018-11-23 12:29:43,642 INFO L273 TraceCheckUtils]: 101: Hoare triple {9520#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9520#false} is VALID [2018-11-23 12:29:43,642 INFO L273 TraceCheckUtils]: 102: Hoare triple {9520#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9520#false} is VALID [2018-11-23 12:29:43,642 INFO L273 TraceCheckUtils]: 103: Hoare triple {9520#false} assume !(~i~0 < 100000); {9520#false} is VALID [2018-11-23 12:29:43,643 INFO L273 TraceCheckUtils]: 104: Hoare triple {9520#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {9520#false} is VALID [2018-11-23 12:29:43,643 INFO L273 TraceCheckUtils]: 105: Hoare triple {9520#false} assume true; {9520#false} is VALID [2018-11-23 12:29:43,643 INFO L268 TraceCheckUtils]: 106: Hoare quadruple {9520#false} {9520#false} #74#return; {9520#false} is VALID [2018-11-23 12:29:43,643 INFO L273 TraceCheckUtils]: 107: Hoare triple {9520#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {9520#false} is VALID [2018-11-23 12:29:43,643 INFO L273 TraceCheckUtils]: 108: Hoare triple {9520#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {9520#false} is VALID [2018-11-23 12:29:43,643 INFO L273 TraceCheckUtils]: 109: Hoare triple {9520#false} assume !false; {9520#false} is VALID [2018-11-23 12:29:43,648 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 178 proven. 16 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2018-11-23 12:29:43,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:29:43,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 7] total 25 [2018-11-23 12:29:43,670 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 110 [2018-11-23 12:29:43,670 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:29:43,670 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 12:29:43,764 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 12:29:43,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 12:29:43,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 12:29:43,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=390, Unknown=0, NotChecked=0, Total=600 [2018-11-23 12:29:43,764 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 25 states. [2018-11-23 12:29:45,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:45,041 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2018-11-23 12:29:45,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 12:29:45,041 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 110 [2018-11-23 12:29:45,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:45,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:29:45,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 99 transitions. [2018-11-23 12:29:45,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:29:45,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 99 transitions. [2018-11-23 12:29:45,043 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 99 transitions. [2018-11-23 12:29:45,170 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:29:45,172 INFO L225 Difference]: With dead ends: 119 [2018-11-23 12:29:45,172 INFO L226 Difference]: Without dead ends: 83 [2018-11-23 12:29:45,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=210, Invalid=390, Unknown=0, NotChecked=0, Total=600 [2018-11-23 12:29:45,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-23 12:29:45,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-11-23 12:29:45,212 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:45,213 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 81 states. [2018-11-23 12:29:45,213 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 81 states. [2018-11-23 12:29:45,213 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 81 states. [2018-11-23 12:29:45,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:45,216 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-11-23 12:29:45,216 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-11-23 12:29:45,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:45,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:45,217 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 83 states. [2018-11-23 12:29:45,217 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 83 states. [2018-11-23 12:29:45,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:45,219 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-11-23 12:29:45,219 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-11-23 12:29:45,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:45,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:45,219 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:45,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:45,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-23 12:29:45,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2018-11-23 12:29:45,221 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 110 [2018-11-23 12:29:45,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:45,222 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-11-23 12:29:45,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 12:29:45,222 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-11-23 12:29:45,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-23 12:29:45,223 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:45,223 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:29:45,223 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:45,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:45,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1749287513, now seen corresponding path program 18 times [2018-11-23 12:29:45,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:45,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:45,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:45,224 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:29:45,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:45,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:45,666 INFO L256 TraceCheckUtils]: 0: Hoare triple {10335#true} call ULTIMATE.init(); {10335#true} is VALID [2018-11-23 12:29:45,667 INFO L273 TraceCheckUtils]: 1: Hoare triple {10335#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10335#true} is VALID [2018-11-23 12:29:45,667 INFO L273 TraceCheckUtils]: 2: Hoare triple {10335#true} assume true; {10335#true} is VALID [2018-11-23 12:29:45,667 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10335#true} {10335#true} #66#return; {10335#true} is VALID [2018-11-23 12:29:45,667 INFO L256 TraceCheckUtils]: 4: Hoare triple {10335#true} call #t~ret13 := main(); {10335#true} is VALID [2018-11-23 12:29:45,667 INFO L273 TraceCheckUtils]: 5: Hoare triple {10335#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {10337#(= main_~i~1 0)} is VALID [2018-11-23 12:29:45,668 INFO L273 TraceCheckUtils]: 6: Hoare triple {10337#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10337#(= main_~i~1 0)} is VALID [2018-11-23 12:29:45,669 INFO L273 TraceCheckUtils]: 7: Hoare triple {10337#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10338#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:45,669 INFO L273 TraceCheckUtils]: 8: Hoare triple {10338#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10338#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:45,670 INFO L273 TraceCheckUtils]: 9: Hoare triple {10338#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10339#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:45,671 INFO L273 TraceCheckUtils]: 10: Hoare triple {10339#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10339#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:45,672 INFO L273 TraceCheckUtils]: 11: Hoare triple {10339#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10340#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:45,672 INFO L273 TraceCheckUtils]: 12: Hoare triple {10340#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10340#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:45,673 INFO L273 TraceCheckUtils]: 13: Hoare triple {10340#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10341#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:45,673 INFO L273 TraceCheckUtils]: 14: Hoare triple {10341#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10341#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:45,674 INFO L273 TraceCheckUtils]: 15: Hoare triple {10341#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10342#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:45,675 INFO L273 TraceCheckUtils]: 16: Hoare triple {10342#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10342#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:45,675 INFO L273 TraceCheckUtils]: 17: Hoare triple {10342#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10343#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:45,676 INFO L273 TraceCheckUtils]: 18: Hoare triple {10343#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10343#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:45,677 INFO L273 TraceCheckUtils]: 19: Hoare triple {10343#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10344#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:45,679 INFO L273 TraceCheckUtils]: 20: Hoare triple {10344#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10344#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:45,680 INFO L273 TraceCheckUtils]: 21: Hoare triple {10344#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10345#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:45,682 INFO L273 TraceCheckUtils]: 22: Hoare triple {10345#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10345#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:45,682 INFO L273 TraceCheckUtils]: 23: Hoare triple {10345#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10346#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:45,683 INFO L273 TraceCheckUtils]: 24: Hoare triple {10346#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10346#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:45,683 INFO L273 TraceCheckUtils]: 25: Hoare triple {10346#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10347#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:45,684 INFO L273 TraceCheckUtils]: 26: Hoare triple {10347#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10347#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:45,685 INFO L273 TraceCheckUtils]: 27: Hoare triple {10347#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10348#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:45,685 INFO L273 TraceCheckUtils]: 28: Hoare triple {10348#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10348#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:45,686 INFO L273 TraceCheckUtils]: 29: Hoare triple {10348#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10349#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:45,686 INFO L273 TraceCheckUtils]: 30: Hoare triple {10349#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10349#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:45,687 INFO L273 TraceCheckUtils]: 31: Hoare triple {10349#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10350#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:45,691 INFO L273 TraceCheckUtils]: 32: Hoare triple {10350#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10350#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:45,691 INFO L273 TraceCheckUtils]: 33: Hoare triple {10350#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10351#(<= main_~i~1 14)} is VALID [2018-11-23 12:29:45,692 INFO L273 TraceCheckUtils]: 34: Hoare triple {10351#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10351#(<= main_~i~1 14)} is VALID [2018-11-23 12:29:45,692 INFO L273 TraceCheckUtils]: 35: Hoare triple {10351#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10352#(<= main_~i~1 15)} is VALID [2018-11-23 12:29:45,693 INFO L273 TraceCheckUtils]: 36: Hoare triple {10352#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10352#(<= main_~i~1 15)} is VALID [2018-11-23 12:29:45,693 INFO L273 TraceCheckUtils]: 37: Hoare triple {10352#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10353#(<= main_~i~1 16)} is VALID [2018-11-23 12:29:45,693 INFO L273 TraceCheckUtils]: 38: Hoare triple {10353#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10353#(<= main_~i~1 16)} is VALID [2018-11-23 12:29:45,694 INFO L273 TraceCheckUtils]: 39: Hoare triple {10353#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10354#(<= main_~i~1 17)} is VALID [2018-11-23 12:29:45,694 INFO L273 TraceCheckUtils]: 40: Hoare triple {10354#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10354#(<= main_~i~1 17)} is VALID [2018-11-23 12:29:45,695 INFO L273 TraceCheckUtils]: 41: Hoare triple {10354#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10355#(<= main_~i~1 18)} is VALID [2018-11-23 12:29:45,696 INFO L273 TraceCheckUtils]: 42: Hoare triple {10355#(<= main_~i~1 18)} assume !(~i~1 < 100000); {10336#false} is VALID [2018-11-23 12:29:45,696 INFO L256 TraceCheckUtils]: 43: Hoare triple {10336#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {10335#true} is VALID [2018-11-23 12:29:45,696 INFO L273 TraceCheckUtils]: 44: Hoare triple {10335#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10335#true} is VALID [2018-11-23 12:29:45,697 INFO L273 TraceCheckUtils]: 45: Hoare triple {10335#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10335#true} is VALID [2018-11-23 12:29:45,697 INFO L273 TraceCheckUtils]: 46: Hoare triple {10335#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10335#true} is VALID [2018-11-23 12:29:45,697 INFO L273 TraceCheckUtils]: 47: Hoare triple {10335#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10335#true} is VALID [2018-11-23 12:29:45,697 INFO L273 TraceCheckUtils]: 48: Hoare triple {10335#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10335#true} is VALID [2018-11-23 12:29:45,697 INFO L273 TraceCheckUtils]: 49: Hoare triple {10335#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10335#true} is VALID [2018-11-23 12:29:45,698 INFO L273 TraceCheckUtils]: 50: Hoare triple {10335#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10335#true} is VALID [2018-11-23 12:29:45,698 INFO L273 TraceCheckUtils]: 51: Hoare triple {10335#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10335#true} is VALID [2018-11-23 12:29:45,698 INFO L273 TraceCheckUtils]: 52: Hoare triple {10335#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10335#true} is VALID [2018-11-23 12:29:45,698 INFO L273 TraceCheckUtils]: 53: Hoare triple {10335#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10335#true} is VALID [2018-11-23 12:29:45,698 INFO L273 TraceCheckUtils]: 54: Hoare triple {10335#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10335#true} is VALID [2018-11-23 12:29:45,699 INFO L273 TraceCheckUtils]: 55: Hoare triple {10335#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10335#true} is VALID [2018-11-23 12:29:45,699 INFO L273 TraceCheckUtils]: 56: Hoare triple {10335#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10335#true} is VALID [2018-11-23 12:29:45,699 INFO L273 TraceCheckUtils]: 57: Hoare triple {10335#true} assume !(~i~0 < 100000); {10335#true} is VALID [2018-11-23 12:29:45,699 INFO L273 TraceCheckUtils]: 58: Hoare triple {10335#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10335#true} is VALID [2018-11-23 12:29:45,699 INFO L273 TraceCheckUtils]: 59: Hoare triple {10335#true} assume true; {10335#true} is VALID [2018-11-23 12:29:45,699 INFO L268 TraceCheckUtils]: 60: Hoare quadruple {10335#true} {10336#false} #70#return; {10336#false} is VALID [2018-11-23 12:29:45,699 INFO L273 TraceCheckUtils]: 61: Hoare triple {10336#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {10336#false} is VALID [2018-11-23 12:29:45,699 INFO L256 TraceCheckUtils]: 62: Hoare triple {10336#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {10335#true} is VALID [2018-11-23 12:29:45,699 INFO L273 TraceCheckUtils]: 63: Hoare triple {10335#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10335#true} is VALID [2018-11-23 12:29:45,700 INFO L273 TraceCheckUtils]: 64: Hoare triple {10335#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10335#true} is VALID [2018-11-23 12:29:45,700 INFO L273 TraceCheckUtils]: 65: Hoare triple {10335#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10335#true} is VALID [2018-11-23 12:29:45,700 INFO L273 TraceCheckUtils]: 66: Hoare triple {10335#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10335#true} is VALID [2018-11-23 12:29:45,700 INFO L273 TraceCheckUtils]: 67: Hoare triple {10335#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10335#true} is VALID [2018-11-23 12:29:45,700 INFO L273 TraceCheckUtils]: 68: Hoare triple {10335#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10335#true} is VALID [2018-11-23 12:29:45,700 INFO L273 TraceCheckUtils]: 69: Hoare triple {10335#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10335#true} is VALID [2018-11-23 12:29:45,700 INFO L273 TraceCheckUtils]: 70: Hoare triple {10335#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10335#true} is VALID [2018-11-23 12:29:45,700 INFO L273 TraceCheckUtils]: 71: Hoare triple {10335#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10335#true} is VALID [2018-11-23 12:29:45,701 INFO L273 TraceCheckUtils]: 72: Hoare triple {10335#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10335#true} is VALID [2018-11-23 12:29:45,701 INFO L273 TraceCheckUtils]: 73: Hoare triple {10335#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10335#true} is VALID [2018-11-23 12:29:45,701 INFO L273 TraceCheckUtils]: 74: Hoare triple {10335#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10335#true} is VALID [2018-11-23 12:29:45,701 INFO L273 TraceCheckUtils]: 75: Hoare triple {10335#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10335#true} is VALID [2018-11-23 12:29:45,701 INFO L273 TraceCheckUtils]: 76: Hoare triple {10335#true} assume !(~i~0 < 100000); {10335#true} is VALID [2018-11-23 12:29:45,701 INFO L273 TraceCheckUtils]: 77: Hoare triple {10335#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10335#true} is VALID [2018-11-23 12:29:45,701 INFO L273 TraceCheckUtils]: 78: Hoare triple {10335#true} assume true; {10335#true} is VALID [2018-11-23 12:29:45,701 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {10335#true} {10336#false} #72#return; {10336#false} is VALID [2018-11-23 12:29:45,701 INFO L273 TraceCheckUtils]: 80: Hoare triple {10336#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {10336#false} is VALID [2018-11-23 12:29:45,702 INFO L273 TraceCheckUtils]: 81: Hoare triple {10336#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {10336#false} is VALID [2018-11-23 12:29:45,702 INFO L273 TraceCheckUtils]: 82: Hoare triple {10336#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {10336#false} is VALID [2018-11-23 12:29:45,702 INFO L273 TraceCheckUtils]: 83: Hoare triple {10336#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {10336#false} is VALID [2018-11-23 12:29:45,702 INFO L273 TraceCheckUtils]: 84: Hoare triple {10336#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {10336#false} is VALID [2018-11-23 12:29:45,702 INFO L273 TraceCheckUtils]: 85: Hoare triple {10336#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {10336#false} is VALID [2018-11-23 12:29:45,702 INFO L273 TraceCheckUtils]: 86: Hoare triple {10336#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {10336#false} is VALID [2018-11-23 12:29:45,702 INFO L273 TraceCheckUtils]: 87: Hoare triple {10336#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {10336#false} is VALID [2018-11-23 12:29:45,702 INFO L273 TraceCheckUtils]: 88: Hoare triple {10336#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {10336#false} is VALID [2018-11-23 12:29:45,702 INFO L273 TraceCheckUtils]: 89: Hoare triple {10336#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {10336#false} is VALID [2018-11-23 12:29:45,703 INFO L273 TraceCheckUtils]: 90: Hoare triple {10336#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {10336#false} is VALID [2018-11-23 12:29:45,703 INFO L273 TraceCheckUtils]: 91: Hoare triple {10336#false} assume !(~i~2 < 99999); {10336#false} is VALID [2018-11-23 12:29:45,703 INFO L273 TraceCheckUtils]: 92: Hoare triple {10336#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {10336#false} is VALID [2018-11-23 12:29:45,703 INFO L256 TraceCheckUtils]: 93: Hoare triple {10336#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {10335#true} is VALID [2018-11-23 12:29:45,703 INFO L273 TraceCheckUtils]: 94: Hoare triple {10335#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10335#true} is VALID [2018-11-23 12:29:45,703 INFO L273 TraceCheckUtils]: 95: Hoare triple {10335#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10335#true} is VALID [2018-11-23 12:29:45,703 INFO L273 TraceCheckUtils]: 96: Hoare triple {10335#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10335#true} is VALID [2018-11-23 12:29:45,703 INFO L273 TraceCheckUtils]: 97: Hoare triple {10335#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10335#true} is VALID [2018-11-23 12:29:45,704 INFO L273 TraceCheckUtils]: 98: Hoare triple {10335#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10335#true} is VALID [2018-11-23 12:29:45,704 INFO L273 TraceCheckUtils]: 99: Hoare triple {10335#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10335#true} is VALID [2018-11-23 12:29:45,704 INFO L273 TraceCheckUtils]: 100: Hoare triple {10335#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10335#true} is VALID [2018-11-23 12:29:45,704 INFO L273 TraceCheckUtils]: 101: Hoare triple {10335#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10335#true} is VALID [2018-11-23 12:29:45,704 INFO L273 TraceCheckUtils]: 102: Hoare triple {10335#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10335#true} is VALID [2018-11-23 12:29:45,704 INFO L273 TraceCheckUtils]: 103: Hoare triple {10335#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10335#true} is VALID [2018-11-23 12:29:45,704 INFO L273 TraceCheckUtils]: 104: Hoare triple {10335#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10335#true} is VALID [2018-11-23 12:29:45,704 INFO L273 TraceCheckUtils]: 105: Hoare triple {10335#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10335#true} is VALID [2018-11-23 12:29:45,704 INFO L273 TraceCheckUtils]: 106: Hoare triple {10335#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10335#true} is VALID [2018-11-23 12:29:45,705 INFO L273 TraceCheckUtils]: 107: Hoare triple {10335#true} assume !(~i~0 < 100000); {10335#true} is VALID [2018-11-23 12:29:45,705 INFO L273 TraceCheckUtils]: 108: Hoare triple {10335#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10335#true} is VALID [2018-11-23 12:29:45,705 INFO L273 TraceCheckUtils]: 109: Hoare triple {10335#true} assume true; {10335#true} is VALID [2018-11-23 12:29:45,705 INFO L268 TraceCheckUtils]: 110: Hoare quadruple {10335#true} {10336#false} #74#return; {10336#false} is VALID [2018-11-23 12:29:45,705 INFO L273 TraceCheckUtils]: 111: Hoare triple {10336#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {10336#false} is VALID [2018-11-23 12:29:45,705 INFO L273 TraceCheckUtils]: 112: Hoare triple {10336#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {10336#false} is VALID [2018-11-23 12:29:45,705 INFO L273 TraceCheckUtils]: 113: Hoare triple {10336#false} assume !false; {10336#false} is VALID [2018-11-23 12:29:45,711 INFO L134 CoverageAnalysis]: Checked inductivity of 724 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-11-23 12:29:45,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:29:45,711 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 12:29:45,720 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:29:46,424 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-23 12:29:46,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:29:46,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:46,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:29:46,640 INFO L256 TraceCheckUtils]: 0: Hoare triple {10335#true} call ULTIMATE.init(); {10335#true} is VALID [2018-11-23 12:29:46,640 INFO L273 TraceCheckUtils]: 1: Hoare triple {10335#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10335#true} is VALID [2018-11-23 12:29:46,640 INFO L273 TraceCheckUtils]: 2: Hoare triple {10335#true} assume true; {10335#true} is VALID [2018-11-23 12:29:46,640 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10335#true} {10335#true} #66#return; {10335#true} is VALID [2018-11-23 12:29:46,641 INFO L256 TraceCheckUtils]: 4: Hoare triple {10335#true} call #t~ret13 := main(); {10335#true} is VALID [2018-11-23 12:29:46,641 INFO L273 TraceCheckUtils]: 5: Hoare triple {10335#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {10335#true} is VALID [2018-11-23 12:29:46,641 INFO L273 TraceCheckUtils]: 6: Hoare triple {10335#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10335#true} is VALID [2018-11-23 12:29:46,641 INFO L273 TraceCheckUtils]: 7: Hoare triple {10335#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10335#true} is VALID [2018-11-23 12:29:46,641 INFO L273 TraceCheckUtils]: 8: Hoare triple {10335#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10335#true} is VALID [2018-11-23 12:29:46,642 INFO L273 TraceCheckUtils]: 9: Hoare triple {10335#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10335#true} is VALID [2018-11-23 12:29:46,642 INFO L273 TraceCheckUtils]: 10: Hoare triple {10335#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10335#true} is VALID [2018-11-23 12:29:46,642 INFO L273 TraceCheckUtils]: 11: Hoare triple {10335#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10335#true} is VALID [2018-11-23 12:29:46,642 INFO L273 TraceCheckUtils]: 12: Hoare triple {10335#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10335#true} is VALID [2018-11-23 12:29:46,642 INFO L273 TraceCheckUtils]: 13: Hoare triple {10335#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10335#true} is VALID [2018-11-23 12:29:46,642 INFO L273 TraceCheckUtils]: 14: Hoare triple {10335#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10335#true} is VALID [2018-11-23 12:29:46,642 INFO L273 TraceCheckUtils]: 15: Hoare triple {10335#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10335#true} is VALID [2018-11-23 12:29:46,642 INFO L273 TraceCheckUtils]: 16: Hoare triple {10335#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10335#true} is VALID [2018-11-23 12:29:46,642 INFO L273 TraceCheckUtils]: 17: Hoare triple {10335#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10335#true} is VALID [2018-11-23 12:29:46,643 INFO L273 TraceCheckUtils]: 18: Hoare triple {10335#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10335#true} is VALID [2018-11-23 12:29:46,643 INFO L273 TraceCheckUtils]: 19: Hoare triple {10335#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10335#true} is VALID [2018-11-23 12:29:46,643 INFO L273 TraceCheckUtils]: 20: Hoare triple {10335#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10335#true} is VALID [2018-11-23 12:29:46,643 INFO L273 TraceCheckUtils]: 21: Hoare triple {10335#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10335#true} is VALID [2018-11-23 12:29:46,643 INFO L273 TraceCheckUtils]: 22: Hoare triple {10335#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10335#true} is VALID [2018-11-23 12:29:46,643 INFO L273 TraceCheckUtils]: 23: Hoare triple {10335#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10335#true} is VALID [2018-11-23 12:29:46,643 INFO L273 TraceCheckUtils]: 24: Hoare triple {10335#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10335#true} is VALID [2018-11-23 12:29:46,643 INFO L273 TraceCheckUtils]: 25: Hoare triple {10335#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10335#true} is VALID [2018-11-23 12:29:46,643 INFO L273 TraceCheckUtils]: 26: Hoare triple {10335#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10335#true} is VALID [2018-11-23 12:29:46,644 INFO L273 TraceCheckUtils]: 27: Hoare triple {10335#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10335#true} is VALID [2018-11-23 12:29:46,644 INFO L273 TraceCheckUtils]: 28: Hoare triple {10335#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10335#true} is VALID [2018-11-23 12:29:46,644 INFO L273 TraceCheckUtils]: 29: Hoare triple {10335#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10335#true} is VALID [2018-11-23 12:29:46,644 INFO L273 TraceCheckUtils]: 30: Hoare triple {10335#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10335#true} is VALID [2018-11-23 12:29:46,644 INFO L273 TraceCheckUtils]: 31: Hoare triple {10335#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10335#true} is VALID [2018-11-23 12:29:46,644 INFO L273 TraceCheckUtils]: 32: Hoare triple {10335#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10335#true} is VALID [2018-11-23 12:29:46,644 INFO L273 TraceCheckUtils]: 33: Hoare triple {10335#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10335#true} is VALID [2018-11-23 12:29:46,644 INFO L273 TraceCheckUtils]: 34: Hoare triple {10335#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10335#true} is VALID [2018-11-23 12:29:46,644 INFO L273 TraceCheckUtils]: 35: Hoare triple {10335#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10335#true} is VALID [2018-11-23 12:29:46,645 INFO L273 TraceCheckUtils]: 36: Hoare triple {10335#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10335#true} is VALID [2018-11-23 12:29:46,645 INFO L273 TraceCheckUtils]: 37: Hoare triple {10335#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10335#true} is VALID [2018-11-23 12:29:46,645 INFO L273 TraceCheckUtils]: 38: Hoare triple {10335#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10335#true} is VALID [2018-11-23 12:29:46,645 INFO L273 TraceCheckUtils]: 39: Hoare triple {10335#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10335#true} is VALID [2018-11-23 12:29:46,645 INFO L273 TraceCheckUtils]: 40: Hoare triple {10335#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10335#true} is VALID [2018-11-23 12:29:46,645 INFO L273 TraceCheckUtils]: 41: Hoare triple {10335#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10335#true} is VALID [2018-11-23 12:29:46,645 INFO L273 TraceCheckUtils]: 42: Hoare triple {10335#true} assume !(~i~1 < 100000); {10335#true} is VALID [2018-11-23 12:29:46,645 INFO L256 TraceCheckUtils]: 43: Hoare triple {10335#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {10335#true} is VALID [2018-11-23 12:29:46,646 INFO L273 TraceCheckUtils]: 44: Hoare triple {10335#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10335#true} is VALID [2018-11-23 12:29:46,646 INFO L273 TraceCheckUtils]: 45: Hoare triple {10335#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10335#true} is VALID [2018-11-23 12:29:46,646 INFO L273 TraceCheckUtils]: 46: Hoare triple {10335#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10335#true} is VALID [2018-11-23 12:29:46,646 INFO L273 TraceCheckUtils]: 47: Hoare triple {10335#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10335#true} is VALID [2018-11-23 12:29:46,646 INFO L273 TraceCheckUtils]: 48: Hoare triple {10335#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10335#true} is VALID [2018-11-23 12:29:46,646 INFO L273 TraceCheckUtils]: 49: Hoare triple {10335#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10335#true} is VALID [2018-11-23 12:29:46,646 INFO L273 TraceCheckUtils]: 50: Hoare triple {10335#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10335#true} is VALID [2018-11-23 12:29:46,646 INFO L273 TraceCheckUtils]: 51: Hoare triple {10335#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10335#true} is VALID [2018-11-23 12:29:46,646 INFO L273 TraceCheckUtils]: 52: Hoare triple {10335#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10335#true} is VALID [2018-11-23 12:29:46,647 INFO L273 TraceCheckUtils]: 53: Hoare triple {10335#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10335#true} is VALID [2018-11-23 12:29:46,647 INFO L273 TraceCheckUtils]: 54: Hoare triple {10335#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10335#true} is VALID [2018-11-23 12:29:46,647 INFO L273 TraceCheckUtils]: 55: Hoare triple {10335#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10335#true} is VALID [2018-11-23 12:29:46,647 INFO L273 TraceCheckUtils]: 56: Hoare triple {10335#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10335#true} is VALID [2018-11-23 12:29:46,647 INFO L273 TraceCheckUtils]: 57: Hoare triple {10335#true} assume !(~i~0 < 100000); {10335#true} is VALID [2018-11-23 12:29:46,647 INFO L273 TraceCheckUtils]: 58: Hoare triple {10335#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10335#true} is VALID [2018-11-23 12:29:46,647 INFO L273 TraceCheckUtils]: 59: Hoare triple {10335#true} assume true; {10335#true} is VALID [2018-11-23 12:29:46,647 INFO L268 TraceCheckUtils]: 60: Hoare quadruple {10335#true} {10335#true} #70#return; {10335#true} is VALID [2018-11-23 12:29:46,647 INFO L273 TraceCheckUtils]: 61: Hoare triple {10335#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {10335#true} is VALID [2018-11-23 12:29:46,648 INFO L256 TraceCheckUtils]: 62: Hoare triple {10335#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {10335#true} is VALID [2018-11-23 12:29:46,648 INFO L273 TraceCheckUtils]: 63: Hoare triple {10335#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10335#true} is VALID [2018-11-23 12:29:46,648 INFO L273 TraceCheckUtils]: 64: Hoare triple {10335#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10335#true} is VALID [2018-11-23 12:29:46,648 INFO L273 TraceCheckUtils]: 65: Hoare triple {10335#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10335#true} is VALID [2018-11-23 12:29:46,648 INFO L273 TraceCheckUtils]: 66: Hoare triple {10335#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10335#true} is VALID [2018-11-23 12:29:46,648 INFO L273 TraceCheckUtils]: 67: Hoare triple {10335#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10335#true} is VALID [2018-11-23 12:29:46,648 INFO L273 TraceCheckUtils]: 68: Hoare triple {10335#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10335#true} is VALID [2018-11-23 12:29:46,648 INFO L273 TraceCheckUtils]: 69: Hoare triple {10335#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10335#true} is VALID [2018-11-23 12:29:46,648 INFO L273 TraceCheckUtils]: 70: Hoare triple {10335#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10335#true} is VALID [2018-11-23 12:29:46,649 INFO L273 TraceCheckUtils]: 71: Hoare triple {10335#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10335#true} is VALID [2018-11-23 12:29:46,649 INFO L273 TraceCheckUtils]: 72: Hoare triple {10335#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10335#true} is VALID [2018-11-23 12:29:46,649 INFO L273 TraceCheckUtils]: 73: Hoare triple {10335#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10335#true} is VALID [2018-11-23 12:29:46,649 INFO L273 TraceCheckUtils]: 74: Hoare triple {10335#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10335#true} is VALID [2018-11-23 12:29:46,649 INFO L273 TraceCheckUtils]: 75: Hoare triple {10335#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10335#true} is VALID [2018-11-23 12:29:46,649 INFO L273 TraceCheckUtils]: 76: Hoare triple {10335#true} assume !(~i~0 < 100000); {10335#true} is VALID [2018-11-23 12:29:46,649 INFO L273 TraceCheckUtils]: 77: Hoare triple {10335#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10335#true} is VALID [2018-11-23 12:29:46,649 INFO L273 TraceCheckUtils]: 78: Hoare triple {10335#true} assume true; {10335#true} is VALID [2018-11-23 12:29:46,649 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {10335#true} {10335#true} #72#return; {10335#true} is VALID [2018-11-23 12:29:46,650 INFO L273 TraceCheckUtils]: 80: Hoare triple {10335#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {10335#true} is VALID [2018-11-23 12:29:46,650 INFO L273 TraceCheckUtils]: 81: Hoare triple {10335#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {10335#true} is VALID [2018-11-23 12:29:46,650 INFO L273 TraceCheckUtils]: 82: Hoare triple {10335#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {10335#true} is VALID [2018-11-23 12:29:46,650 INFO L273 TraceCheckUtils]: 83: Hoare triple {10335#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {10335#true} is VALID [2018-11-23 12:29:46,650 INFO L273 TraceCheckUtils]: 84: Hoare triple {10335#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {10335#true} is VALID [2018-11-23 12:29:46,650 INFO L273 TraceCheckUtils]: 85: Hoare triple {10335#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {10335#true} is VALID [2018-11-23 12:29:46,650 INFO L273 TraceCheckUtils]: 86: Hoare triple {10335#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {10335#true} is VALID [2018-11-23 12:29:46,650 INFO L273 TraceCheckUtils]: 87: Hoare triple {10335#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {10335#true} is VALID [2018-11-23 12:29:46,651 INFO L273 TraceCheckUtils]: 88: Hoare triple {10335#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {10335#true} is VALID [2018-11-23 12:29:46,651 INFO L273 TraceCheckUtils]: 89: Hoare triple {10335#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {10335#true} is VALID [2018-11-23 12:29:46,651 INFO L273 TraceCheckUtils]: 90: Hoare triple {10335#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {10335#true} is VALID [2018-11-23 12:29:46,651 INFO L273 TraceCheckUtils]: 91: Hoare triple {10335#true} assume !(~i~2 < 99999); {10335#true} is VALID [2018-11-23 12:29:46,651 INFO L273 TraceCheckUtils]: 92: Hoare triple {10335#true} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {10335#true} is VALID [2018-11-23 12:29:46,651 INFO L256 TraceCheckUtils]: 93: Hoare triple {10335#true} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {10335#true} is VALID [2018-11-23 12:29:46,652 INFO L273 TraceCheckUtils]: 94: Hoare triple {10335#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10641#(<= xor_~i~0 1)} is VALID [2018-11-23 12:29:46,652 INFO L273 TraceCheckUtils]: 95: Hoare triple {10641#(<= xor_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10641#(<= xor_~i~0 1)} is VALID [2018-11-23 12:29:46,653 INFO L273 TraceCheckUtils]: 96: Hoare triple {10641#(<= xor_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10648#(<= xor_~i~0 2)} is VALID [2018-11-23 12:29:46,653 INFO L273 TraceCheckUtils]: 97: Hoare triple {10648#(<= xor_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10648#(<= xor_~i~0 2)} is VALID [2018-11-23 12:29:46,653 INFO L273 TraceCheckUtils]: 98: Hoare triple {10648#(<= xor_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10655#(<= xor_~i~0 3)} is VALID [2018-11-23 12:29:46,654 INFO L273 TraceCheckUtils]: 99: Hoare triple {10655#(<= xor_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10655#(<= xor_~i~0 3)} is VALID [2018-11-23 12:29:46,654 INFO L273 TraceCheckUtils]: 100: Hoare triple {10655#(<= xor_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10662#(<= xor_~i~0 4)} is VALID [2018-11-23 12:29:46,655 INFO L273 TraceCheckUtils]: 101: Hoare triple {10662#(<= xor_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10662#(<= xor_~i~0 4)} is VALID [2018-11-23 12:29:46,655 INFO L273 TraceCheckUtils]: 102: Hoare triple {10662#(<= xor_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10669#(<= xor_~i~0 5)} is VALID [2018-11-23 12:29:46,656 INFO L273 TraceCheckUtils]: 103: Hoare triple {10669#(<= xor_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10669#(<= xor_~i~0 5)} is VALID [2018-11-23 12:29:46,657 INFO L273 TraceCheckUtils]: 104: Hoare triple {10669#(<= xor_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10676#(<= xor_~i~0 6)} is VALID [2018-11-23 12:29:46,657 INFO L273 TraceCheckUtils]: 105: Hoare triple {10676#(<= xor_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10676#(<= xor_~i~0 6)} is VALID [2018-11-23 12:29:46,658 INFO L273 TraceCheckUtils]: 106: Hoare triple {10676#(<= xor_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10683#(<= xor_~i~0 7)} is VALID [2018-11-23 12:29:46,659 INFO L273 TraceCheckUtils]: 107: Hoare triple {10683#(<= xor_~i~0 7)} assume !(~i~0 < 100000); {10336#false} is VALID [2018-11-23 12:29:46,659 INFO L273 TraceCheckUtils]: 108: Hoare triple {10336#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10336#false} is VALID [2018-11-23 12:29:46,659 INFO L273 TraceCheckUtils]: 109: Hoare triple {10336#false} assume true; {10336#false} is VALID [2018-11-23 12:29:46,659 INFO L268 TraceCheckUtils]: 110: Hoare quadruple {10336#false} {10335#true} #74#return; {10336#false} is VALID [2018-11-23 12:29:46,659 INFO L273 TraceCheckUtils]: 111: Hoare triple {10336#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {10336#false} is VALID [2018-11-23 12:29:46,660 INFO L273 TraceCheckUtils]: 112: Hoare triple {10336#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {10336#false} is VALID [2018-11-23 12:29:46,660 INFO L273 TraceCheckUtils]: 113: Hoare triple {10336#false} assume !false; {10336#false} is VALID [2018-11-23 12:29:46,665 INFO L134 CoverageAnalysis]: Checked inductivity of 724 backedges. 176 proven. 36 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2018-11-23 12:29:46,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:29:46,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 9] total 28 [2018-11-23 12:29:46,686 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 114 [2018-11-23 12:29:46,686 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:29:46,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 12:29:46,791 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 12:29:46,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 12:29:46,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 12:29:46,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=511, Unknown=0, NotChecked=0, Total=756 [2018-11-23 12:29:46,792 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 28 states. [2018-11-23 12:29:47,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:47,757 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2018-11-23 12:29:47,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 12:29:47,757 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 114 [2018-11-23 12:29:47,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:47,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:29:47,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 108 transitions. [2018-11-23 12:29:47,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:29:47,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 108 transitions. [2018-11-23 12:29:47,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 108 transitions. [2018-11-23 12:29:48,185 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:29:48,187 INFO L225 Difference]: With dead ends: 125 [2018-11-23 12:29:48,187 INFO L226 Difference]: Without dead ends: 87 [2018-11-23 12:29:48,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=245, Invalid=511, Unknown=0, NotChecked=0, Total=756 [2018-11-23 12:29:48,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-23 12:29:48,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-11-23 12:29:48,223 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:48,223 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 85 states. [2018-11-23 12:29:48,223 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 85 states. [2018-11-23 12:29:48,223 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 85 states. [2018-11-23 12:29:48,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:48,226 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2018-11-23 12:29:48,226 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-11-23 12:29:48,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:48,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:48,227 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 87 states. [2018-11-23 12:29:48,227 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 87 states. [2018-11-23 12:29:48,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:48,228 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2018-11-23 12:29:48,228 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-11-23 12:29:48,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:48,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:48,229 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:48,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:48,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-23 12:29:48,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2018-11-23 12:29:48,230 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 114 [2018-11-23 12:29:48,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:48,230 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-11-23 12:29:48,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 12:29:48,231 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-11-23 12:29:48,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-23 12:29:48,231 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:48,231 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 19, 19, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:29:48,231 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:48,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:48,232 INFO L82 PathProgramCache]: Analyzing trace with hash -321357543, now seen corresponding path program 19 times [2018-11-23 12:29:48,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:48,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:48,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:48,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:29:48,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:48,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:48,553 INFO L256 TraceCheckUtils]: 0: Hoare triple {11189#true} call ULTIMATE.init(); {11189#true} is VALID [2018-11-23 12:29:48,554 INFO L273 TraceCheckUtils]: 1: Hoare triple {11189#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11189#true} is VALID [2018-11-23 12:29:48,554 INFO L273 TraceCheckUtils]: 2: Hoare triple {11189#true} assume true; {11189#true} is VALID [2018-11-23 12:29:48,554 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11189#true} {11189#true} #66#return; {11189#true} is VALID [2018-11-23 12:29:48,554 INFO L256 TraceCheckUtils]: 4: Hoare triple {11189#true} call #t~ret13 := main(); {11189#true} is VALID [2018-11-23 12:29:48,555 INFO L273 TraceCheckUtils]: 5: Hoare triple {11189#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {11191#(= main_~i~1 0)} is VALID [2018-11-23 12:29:48,556 INFO L273 TraceCheckUtils]: 6: Hoare triple {11191#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11191#(= main_~i~1 0)} is VALID [2018-11-23 12:29:48,556 INFO L273 TraceCheckUtils]: 7: Hoare triple {11191#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11192#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:48,557 INFO L273 TraceCheckUtils]: 8: Hoare triple {11192#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11192#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:48,557 INFO L273 TraceCheckUtils]: 9: Hoare triple {11192#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11193#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:48,557 INFO L273 TraceCheckUtils]: 10: Hoare triple {11193#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11193#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:48,558 INFO L273 TraceCheckUtils]: 11: Hoare triple {11193#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11194#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:48,558 INFO L273 TraceCheckUtils]: 12: Hoare triple {11194#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11194#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:48,559 INFO L273 TraceCheckUtils]: 13: Hoare triple {11194#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11195#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:48,560 INFO L273 TraceCheckUtils]: 14: Hoare triple {11195#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11195#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:48,560 INFO L273 TraceCheckUtils]: 15: Hoare triple {11195#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11196#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:48,561 INFO L273 TraceCheckUtils]: 16: Hoare triple {11196#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11196#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:48,562 INFO L273 TraceCheckUtils]: 17: Hoare triple {11196#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11197#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:48,562 INFO L273 TraceCheckUtils]: 18: Hoare triple {11197#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11197#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:48,563 INFO L273 TraceCheckUtils]: 19: Hoare triple {11197#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11198#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:48,563 INFO L273 TraceCheckUtils]: 20: Hoare triple {11198#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11198#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:48,564 INFO L273 TraceCheckUtils]: 21: Hoare triple {11198#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11199#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:48,565 INFO L273 TraceCheckUtils]: 22: Hoare triple {11199#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11199#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:48,565 INFO L273 TraceCheckUtils]: 23: Hoare triple {11199#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11200#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:48,566 INFO L273 TraceCheckUtils]: 24: Hoare triple {11200#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11200#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:48,567 INFO L273 TraceCheckUtils]: 25: Hoare triple {11200#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11201#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:48,567 INFO L273 TraceCheckUtils]: 26: Hoare triple {11201#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11201#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:48,568 INFO L273 TraceCheckUtils]: 27: Hoare triple {11201#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11202#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:48,568 INFO L273 TraceCheckUtils]: 28: Hoare triple {11202#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11202#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:48,569 INFO L273 TraceCheckUtils]: 29: Hoare triple {11202#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11203#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:48,570 INFO L273 TraceCheckUtils]: 30: Hoare triple {11203#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11203#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:48,571 INFO L273 TraceCheckUtils]: 31: Hoare triple {11203#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11204#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:48,571 INFO L273 TraceCheckUtils]: 32: Hoare triple {11204#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11204#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:48,572 INFO L273 TraceCheckUtils]: 33: Hoare triple {11204#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11205#(<= main_~i~1 14)} is VALID [2018-11-23 12:29:48,572 INFO L273 TraceCheckUtils]: 34: Hoare triple {11205#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11205#(<= main_~i~1 14)} is VALID [2018-11-23 12:29:48,573 INFO L273 TraceCheckUtils]: 35: Hoare triple {11205#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11206#(<= main_~i~1 15)} is VALID [2018-11-23 12:29:48,574 INFO L273 TraceCheckUtils]: 36: Hoare triple {11206#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11206#(<= main_~i~1 15)} is VALID [2018-11-23 12:29:48,574 INFO L273 TraceCheckUtils]: 37: Hoare triple {11206#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11207#(<= main_~i~1 16)} is VALID [2018-11-23 12:29:48,575 INFO L273 TraceCheckUtils]: 38: Hoare triple {11207#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11207#(<= main_~i~1 16)} is VALID [2018-11-23 12:29:48,576 INFO L273 TraceCheckUtils]: 39: Hoare triple {11207#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11208#(<= main_~i~1 17)} is VALID [2018-11-23 12:29:48,576 INFO L273 TraceCheckUtils]: 40: Hoare triple {11208#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11208#(<= main_~i~1 17)} is VALID [2018-11-23 12:29:48,577 INFO L273 TraceCheckUtils]: 41: Hoare triple {11208#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11209#(<= main_~i~1 18)} is VALID [2018-11-23 12:29:48,578 INFO L273 TraceCheckUtils]: 42: Hoare triple {11209#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11209#(<= main_~i~1 18)} is VALID [2018-11-23 12:29:48,578 INFO L273 TraceCheckUtils]: 43: Hoare triple {11209#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11210#(<= main_~i~1 19)} is VALID [2018-11-23 12:29:48,579 INFO L273 TraceCheckUtils]: 44: Hoare triple {11210#(<= main_~i~1 19)} assume !(~i~1 < 100000); {11190#false} is VALID [2018-11-23 12:29:48,579 INFO L256 TraceCheckUtils]: 45: Hoare triple {11190#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {11189#true} is VALID [2018-11-23 12:29:48,579 INFO L273 TraceCheckUtils]: 46: Hoare triple {11189#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {11189#true} is VALID [2018-11-23 12:29:48,580 INFO L273 TraceCheckUtils]: 47: Hoare triple {11189#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11189#true} is VALID [2018-11-23 12:29:48,580 INFO L273 TraceCheckUtils]: 48: Hoare triple {11189#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11189#true} is VALID [2018-11-23 12:29:48,580 INFO L273 TraceCheckUtils]: 49: Hoare triple {11189#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11189#true} is VALID [2018-11-23 12:29:48,580 INFO L273 TraceCheckUtils]: 50: Hoare triple {11189#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11189#true} is VALID [2018-11-23 12:29:48,580 INFO L273 TraceCheckUtils]: 51: Hoare triple {11189#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11189#true} is VALID [2018-11-23 12:29:48,581 INFO L273 TraceCheckUtils]: 52: Hoare triple {11189#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11189#true} is VALID [2018-11-23 12:29:48,581 INFO L273 TraceCheckUtils]: 53: Hoare triple {11189#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11189#true} is VALID [2018-11-23 12:29:48,581 INFO L273 TraceCheckUtils]: 54: Hoare triple {11189#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11189#true} is VALID [2018-11-23 12:29:48,581 INFO L273 TraceCheckUtils]: 55: Hoare triple {11189#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11189#true} is VALID [2018-11-23 12:29:48,581 INFO L273 TraceCheckUtils]: 56: Hoare triple {11189#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11189#true} is VALID [2018-11-23 12:29:48,582 INFO L273 TraceCheckUtils]: 57: Hoare triple {11189#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11189#true} is VALID [2018-11-23 12:29:48,582 INFO L273 TraceCheckUtils]: 58: Hoare triple {11189#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11189#true} is VALID [2018-11-23 12:29:48,582 INFO L273 TraceCheckUtils]: 59: Hoare triple {11189#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11189#true} is VALID [2018-11-23 12:29:48,582 INFO L273 TraceCheckUtils]: 60: Hoare triple {11189#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11189#true} is VALID [2018-11-23 12:29:48,582 INFO L273 TraceCheckUtils]: 61: Hoare triple {11189#true} assume !(~i~0 < 100000); {11189#true} is VALID [2018-11-23 12:29:48,583 INFO L273 TraceCheckUtils]: 62: Hoare triple {11189#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11189#true} is VALID [2018-11-23 12:29:48,583 INFO L273 TraceCheckUtils]: 63: Hoare triple {11189#true} assume true; {11189#true} is VALID [2018-11-23 12:29:48,583 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {11189#true} {11190#false} #70#return; {11190#false} is VALID [2018-11-23 12:29:48,583 INFO L273 TraceCheckUtils]: 65: Hoare triple {11190#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {11190#false} is VALID [2018-11-23 12:29:48,583 INFO L256 TraceCheckUtils]: 66: Hoare triple {11190#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {11189#true} is VALID [2018-11-23 12:29:48,584 INFO L273 TraceCheckUtils]: 67: Hoare triple {11189#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {11189#true} is VALID [2018-11-23 12:29:48,584 INFO L273 TraceCheckUtils]: 68: Hoare triple {11189#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11189#true} is VALID [2018-11-23 12:29:48,584 INFO L273 TraceCheckUtils]: 69: Hoare triple {11189#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11189#true} is VALID [2018-11-23 12:29:48,584 INFO L273 TraceCheckUtils]: 70: Hoare triple {11189#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11189#true} is VALID [2018-11-23 12:29:48,584 INFO L273 TraceCheckUtils]: 71: Hoare triple {11189#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11189#true} is VALID [2018-11-23 12:29:48,584 INFO L273 TraceCheckUtils]: 72: Hoare triple {11189#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11189#true} is VALID [2018-11-23 12:29:48,584 INFO L273 TraceCheckUtils]: 73: Hoare triple {11189#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11189#true} is VALID [2018-11-23 12:29:48,585 INFO L273 TraceCheckUtils]: 74: Hoare triple {11189#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11189#true} is VALID [2018-11-23 12:29:48,585 INFO L273 TraceCheckUtils]: 75: Hoare triple {11189#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11189#true} is VALID [2018-11-23 12:29:48,585 INFO L273 TraceCheckUtils]: 76: Hoare triple {11189#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11189#true} is VALID [2018-11-23 12:29:48,585 INFO L273 TraceCheckUtils]: 77: Hoare triple {11189#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11189#true} is VALID [2018-11-23 12:29:48,585 INFO L273 TraceCheckUtils]: 78: Hoare triple {11189#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11189#true} is VALID [2018-11-23 12:29:48,585 INFO L273 TraceCheckUtils]: 79: Hoare triple {11189#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11189#true} is VALID [2018-11-23 12:29:48,585 INFO L273 TraceCheckUtils]: 80: Hoare triple {11189#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11189#true} is VALID [2018-11-23 12:29:48,585 INFO L273 TraceCheckUtils]: 81: Hoare triple {11189#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11189#true} is VALID [2018-11-23 12:29:48,585 INFO L273 TraceCheckUtils]: 82: Hoare triple {11189#true} assume !(~i~0 < 100000); {11189#true} is VALID [2018-11-23 12:29:48,586 INFO L273 TraceCheckUtils]: 83: Hoare triple {11189#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11189#true} is VALID [2018-11-23 12:29:48,586 INFO L273 TraceCheckUtils]: 84: Hoare triple {11189#true} assume true; {11189#true} is VALID [2018-11-23 12:29:48,586 INFO L268 TraceCheckUtils]: 85: Hoare quadruple {11189#true} {11190#false} #72#return; {11190#false} is VALID [2018-11-23 12:29:48,586 INFO L273 TraceCheckUtils]: 86: Hoare triple {11190#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {11190#false} is VALID [2018-11-23 12:29:48,586 INFO L273 TraceCheckUtils]: 87: Hoare triple {11190#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {11190#false} is VALID [2018-11-23 12:29:48,586 INFO L273 TraceCheckUtils]: 88: Hoare triple {11190#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {11190#false} is VALID [2018-11-23 12:29:48,586 INFO L273 TraceCheckUtils]: 89: Hoare triple {11190#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {11190#false} is VALID [2018-11-23 12:29:48,586 INFO L273 TraceCheckUtils]: 90: Hoare triple {11190#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {11190#false} is VALID [2018-11-23 12:29:48,586 INFO L273 TraceCheckUtils]: 91: Hoare triple {11190#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {11190#false} is VALID [2018-11-23 12:29:48,587 INFO L273 TraceCheckUtils]: 92: Hoare triple {11190#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {11190#false} is VALID [2018-11-23 12:29:48,587 INFO L273 TraceCheckUtils]: 93: Hoare triple {11190#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {11190#false} is VALID [2018-11-23 12:29:48,587 INFO L273 TraceCheckUtils]: 94: Hoare triple {11190#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {11190#false} is VALID [2018-11-23 12:29:48,587 INFO L273 TraceCheckUtils]: 95: Hoare triple {11190#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {11190#false} is VALID [2018-11-23 12:29:48,587 INFO L273 TraceCheckUtils]: 96: Hoare triple {11190#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {11190#false} is VALID [2018-11-23 12:29:48,587 INFO L273 TraceCheckUtils]: 97: Hoare triple {11190#false} assume !(~i~2 < 99999); {11190#false} is VALID [2018-11-23 12:29:48,587 INFO L273 TraceCheckUtils]: 98: Hoare triple {11190#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {11190#false} is VALID [2018-11-23 12:29:48,587 INFO L256 TraceCheckUtils]: 99: Hoare triple {11190#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {11189#true} is VALID [2018-11-23 12:29:48,587 INFO L273 TraceCheckUtils]: 100: Hoare triple {11189#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {11189#true} is VALID [2018-11-23 12:29:48,588 INFO L273 TraceCheckUtils]: 101: Hoare triple {11189#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11189#true} is VALID [2018-11-23 12:29:48,588 INFO L273 TraceCheckUtils]: 102: Hoare triple {11189#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11189#true} is VALID [2018-11-23 12:29:48,588 INFO L273 TraceCheckUtils]: 103: Hoare triple {11189#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11189#true} is VALID [2018-11-23 12:29:48,588 INFO L273 TraceCheckUtils]: 104: Hoare triple {11189#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11189#true} is VALID [2018-11-23 12:29:48,588 INFO L273 TraceCheckUtils]: 105: Hoare triple {11189#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11189#true} is VALID [2018-11-23 12:29:48,588 INFO L273 TraceCheckUtils]: 106: Hoare triple {11189#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11189#true} is VALID [2018-11-23 12:29:48,588 INFO L273 TraceCheckUtils]: 107: Hoare triple {11189#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11189#true} is VALID [2018-11-23 12:29:48,588 INFO L273 TraceCheckUtils]: 108: Hoare triple {11189#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11189#true} is VALID [2018-11-23 12:29:48,589 INFO L273 TraceCheckUtils]: 109: Hoare triple {11189#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11189#true} is VALID [2018-11-23 12:29:48,589 INFO L273 TraceCheckUtils]: 110: Hoare triple {11189#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11189#true} is VALID [2018-11-23 12:29:48,589 INFO L273 TraceCheckUtils]: 111: Hoare triple {11189#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11189#true} is VALID [2018-11-23 12:29:48,589 INFO L273 TraceCheckUtils]: 112: Hoare triple {11189#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11189#true} is VALID [2018-11-23 12:29:48,589 INFO L273 TraceCheckUtils]: 113: Hoare triple {11189#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11189#true} is VALID [2018-11-23 12:29:48,589 INFO L273 TraceCheckUtils]: 114: Hoare triple {11189#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11189#true} is VALID [2018-11-23 12:29:48,589 INFO L273 TraceCheckUtils]: 115: Hoare triple {11189#true} assume !(~i~0 < 100000); {11189#true} is VALID [2018-11-23 12:29:48,589 INFO L273 TraceCheckUtils]: 116: Hoare triple {11189#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11189#true} is VALID [2018-11-23 12:29:48,589 INFO L273 TraceCheckUtils]: 117: Hoare triple {11189#true} assume true; {11189#true} is VALID [2018-11-23 12:29:48,590 INFO L268 TraceCheckUtils]: 118: Hoare quadruple {11189#true} {11190#false} #74#return; {11190#false} is VALID [2018-11-23 12:29:48,590 INFO L273 TraceCheckUtils]: 119: Hoare triple {11190#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {11190#false} is VALID [2018-11-23 12:29:48,590 INFO L273 TraceCheckUtils]: 120: Hoare triple {11190#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {11190#false} is VALID [2018-11-23 12:29:48,590 INFO L273 TraceCheckUtils]: 121: Hoare triple {11190#false} assume !false; {11190#false} is VALID [2018-11-23 12:29:48,596 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2018-11-23 12:29:48,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:29:48,597 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 12:29:48,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:29:48,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:48,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:48,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:29:49,045 INFO L256 TraceCheckUtils]: 0: Hoare triple {11189#true} call ULTIMATE.init(); {11189#true} is VALID [2018-11-23 12:29:49,045 INFO L273 TraceCheckUtils]: 1: Hoare triple {11189#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11189#true} is VALID [2018-11-23 12:29:49,045 INFO L273 TraceCheckUtils]: 2: Hoare triple {11189#true} assume true; {11189#true} is VALID [2018-11-23 12:29:49,045 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11189#true} {11189#true} #66#return; {11189#true} is VALID [2018-11-23 12:29:49,046 INFO L256 TraceCheckUtils]: 4: Hoare triple {11189#true} call #t~ret13 := main(); {11189#true} is VALID [2018-11-23 12:29:49,047 INFO L273 TraceCheckUtils]: 5: Hoare triple {11189#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {11229#(<= main_~i~1 0)} is VALID [2018-11-23 12:29:49,047 INFO L273 TraceCheckUtils]: 6: Hoare triple {11229#(<= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11229#(<= main_~i~1 0)} is VALID [2018-11-23 12:29:49,047 INFO L273 TraceCheckUtils]: 7: Hoare triple {11229#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11192#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:49,048 INFO L273 TraceCheckUtils]: 8: Hoare triple {11192#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11192#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:49,048 INFO L273 TraceCheckUtils]: 9: Hoare triple {11192#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11193#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:49,049 INFO L273 TraceCheckUtils]: 10: Hoare triple {11193#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11193#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:49,049 INFO L273 TraceCheckUtils]: 11: Hoare triple {11193#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11194#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:49,050 INFO L273 TraceCheckUtils]: 12: Hoare triple {11194#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11194#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:49,051 INFO L273 TraceCheckUtils]: 13: Hoare triple {11194#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11195#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:49,051 INFO L273 TraceCheckUtils]: 14: Hoare triple {11195#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11195#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:49,052 INFO L273 TraceCheckUtils]: 15: Hoare triple {11195#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11196#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:49,052 INFO L273 TraceCheckUtils]: 16: Hoare triple {11196#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11196#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:49,053 INFO L273 TraceCheckUtils]: 17: Hoare triple {11196#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11197#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:49,054 INFO L273 TraceCheckUtils]: 18: Hoare triple {11197#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11197#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:49,054 INFO L273 TraceCheckUtils]: 19: Hoare triple {11197#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11198#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:49,055 INFO L273 TraceCheckUtils]: 20: Hoare triple {11198#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11198#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:49,056 INFO L273 TraceCheckUtils]: 21: Hoare triple {11198#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11199#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:49,056 INFO L273 TraceCheckUtils]: 22: Hoare triple {11199#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11199#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:49,057 INFO L273 TraceCheckUtils]: 23: Hoare triple {11199#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11200#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:49,058 INFO L273 TraceCheckUtils]: 24: Hoare triple {11200#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11200#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:49,058 INFO L273 TraceCheckUtils]: 25: Hoare triple {11200#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11201#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:49,059 INFO L273 TraceCheckUtils]: 26: Hoare triple {11201#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11201#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:49,060 INFO L273 TraceCheckUtils]: 27: Hoare triple {11201#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11202#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:49,060 INFO L273 TraceCheckUtils]: 28: Hoare triple {11202#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11202#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:49,061 INFO L273 TraceCheckUtils]: 29: Hoare triple {11202#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11203#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:49,061 INFO L273 TraceCheckUtils]: 30: Hoare triple {11203#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11203#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:49,062 INFO L273 TraceCheckUtils]: 31: Hoare triple {11203#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11204#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:49,063 INFO L273 TraceCheckUtils]: 32: Hoare triple {11204#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11204#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:49,063 INFO L273 TraceCheckUtils]: 33: Hoare triple {11204#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11205#(<= main_~i~1 14)} is VALID [2018-11-23 12:29:49,064 INFO L273 TraceCheckUtils]: 34: Hoare triple {11205#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11205#(<= main_~i~1 14)} is VALID [2018-11-23 12:29:49,065 INFO L273 TraceCheckUtils]: 35: Hoare triple {11205#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11206#(<= main_~i~1 15)} is VALID [2018-11-23 12:29:49,065 INFO L273 TraceCheckUtils]: 36: Hoare triple {11206#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11206#(<= main_~i~1 15)} is VALID [2018-11-23 12:29:49,066 INFO L273 TraceCheckUtils]: 37: Hoare triple {11206#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11207#(<= main_~i~1 16)} is VALID [2018-11-23 12:29:49,067 INFO L273 TraceCheckUtils]: 38: Hoare triple {11207#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11207#(<= main_~i~1 16)} is VALID [2018-11-23 12:29:49,067 INFO L273 TraceCheckUtils]: 39: Hoare triple {11207#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11208#(<= main_~i~1 17)} is VALID [2018-11-23 12:29:49,068 INFO L273 TraceCheckUtils]: 40: Hoare triple {11208#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11208#(<= main_~i~1 17)} is VALID [2018-11-23 12:29:49,069 INFO L273 TraceCheckUtils]: 41: Hoare triple {11208#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11209#(<= main_~i~1 18)} is VALID [2018-11-23 12:29:49,069 INFO L273 TraceCheckUtils]: 42: Hoare triple {11209#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11209#(<= main_~i~1 18)} is VALID [2018-11-23 12:29:49,070 INFO L273 TraceCheckUtils]: 43: Hoare triple {11209#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11210#(<= main_~i~1 19)} is VALID [2018-11-23 12:29:49,070 INFO L273 TraceCheckUtils]: 44: Hoare triple {11210#(<= main_~i~1 19)} assume !(~i~1 < 100000); {11190#false} is VALID [2018-11-23 12:29:49,071 INFO L256 TraceCheckUtils]: 45: Hoare triple {11190#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {11190#false} is VALID [2018-11-23 12:29:49,071 INFO L273 TraceCheckUtils]: 46: Hoare triple {11190#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {11190#false} is VALID [2018-11-23 12:29:49,071 INFO L273 TraceCheckUtils]: 47: Hoare triple {11190#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11190#false} is VALID [2018-11-23 12:29:49,071 INFO L273 TraceCheckUtils]: 48: Hoare triple {11190#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11190#false} is VALID [2018-11-23 12:29:49,072 INFO L273 TraceCheckUtils]: 49: Hoare triple {11190#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11190#false} is VALID [2018-11-23 12:29:49,072 INFO L273 TraceCheckUtils]: 50: Hoare triple {11190#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11190#false} is VALID [2018-11-23 12:29:49,072 INFO L273 TraceCheckUtils]: 51: Hoare triple {11190#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11190#false} is VALID [2018-11-23 12:29:49,072 INFO L273 TraceCheckUtils]: 52: Hoare triple {11190#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11190#false} is VALID [2018-11-23 12:29:49,072 INFO L273 TraceCheckUtils]: 53: Hoare triple {11190#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11190#false} is VALID [2018-11-23 12:29:49,073 INFO L273 TraceCheckUtils]: 54: Hoare triple {11190#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11190#false} is VALID [2018-11-23 12:29:49,073 INFO L273 TraceCheckUtils]: 55: Hoare triple {11190#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11190#false} is VALID [2018-11-23 12:29:49,073 INFO L273 TraceCheckUtils]: 56: Hoare triple {11190#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11190#false} is VALID [2018-11-23 12:29:49,073 INFO L273 TraceCheckUtils]: 57: Hoare triple {11190#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11190#false} is VALID [2018-11-23 12:29:49,073 INFO L273 TraceCheckUtils]: 58: Hoare triple {11190#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11190#false} is VALID [2018-11-23 12:29:49,073 INFO L273 TraceCheckUtils]: 59: Hoare triple {11190#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11190#false} is VALID [2018-11-23 12:29:49,074 INFO L273 TraceCheckUtils]: 60: Hoare triple {11190#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11190#false} is VALID [2018-11-23 12:29:49,074 INFO L273 TraceCheckUtils]: 61: Hoare triple {11190#false} assume !(~i~0 < 100000); {11190#false} is VALID [2018-11-23 12:29:49,074 INFO L273 TraceCheckUtils]: 62: Hoare triple {11190#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11190#false} is VALID [2018-11-23 12:29:49,074 INFO L273 TraceCheckUtils]: 63: Hoare triple {11190#false} assume true; {11190#false} is VALID [2018-11-23 12:29:49,074 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {11190#false} {11190#false} #70#return; {11190#false} is VALID [2018-11-23 12:29:49,075 INFO L273 TraceCheckUtils]: 65: Hoare triple {11190#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {11190#false} is VALID [2018-11-23 12:29:49,075 INFO L256 TraceCheckUtils]: 66: Hoare triple {11190#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {11190#false} is VALID [2018-11-23 12:29:49,075 INFO L273 TraceCheckUtils]: 67: Hoare triple {11190#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {11190#false} is VALID [2018-11-23 12:29:49,075 INFO L273 TraceCheckUtils]: 68: Hoare triple {11190#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11190#false} is VALID [2018-11-23 12:29:49,075 INFO L273 TraceCheckUtils]: 69: Hoare triple {11190#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11190#false} is VALID [2018-11-23 12:29:49,076 INFO L273 TraceCheckUtils]: 70: Hoare triple {11190#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11190#false} is VALID [2018-11-23 12:29:49,076 INFO L273 TraceCheckUtils]: 71: Hoare triple {11190#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11190#false} is VALID [2018-11-23 12:29:49,076 INFO L273 TraceCheckUtils]: 72: Hoare triple {11190#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11190#false} is VALID [2018-11-23 12:29:49,076 INFO L273 TraceCheckUtils]: 73: Hoare triple {11190#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11190#false} is VALID [2018-11-23 12:29:49,076 INFO L273 TraceCheckUtils]: 74: Hoare triple {11190#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11190#false} is VALID [2018-11-23 12:29:49,076 INFO L273 TraceCheckUtils]: 75: Hoare triple {11190#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11190#false} is VALID [2018-11-23 12:29:49,076 INFO L273 TraceCheckUtils]: 76: Hoare triple {11190#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11190#false} is VALID [2018-11-23 12:29:49,077 INFO L273 TraceCheckUtils]: 77: Hoare triple {11190#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11190#false} is VALID [2018-11-23 12:29:49,077 INFO L273 TraceCheckUtils]: 78: Hoare triple {11190#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11190#false} is VALID [2018-11-23 12:29:49,077 INFO L273 TraceCheckUtils]: 79: Hoare triple {11190#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11190#false} is VALID [2018-11-23 12:29:49,077 INFO L273 TraceCheckUtils]: 80: Hoare triple {11190#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11190#false} is VALID [2018-11-23 12:29:49,077 INFO L273 TraceCheckUtils]: 81: Hoare triple {11190#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11190#false} is VALID [2018-11-23 12:29:49,077 INFO L273 TraceCheckUtils]: 82: Hoare triple {11190#false} assume !(~i~0 < 100000); {11190#false} is VALID [2018-11-23 12:29:49,077 INFO L273 TraceCheckUtils]: 83: Hoare triple {11190#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11190#false} is VALID [2018-11-23 12:29:49,077 INFO L273 TraceCheckUtils]: 84: Hoare triple {11190#false} assume true; {11190#false} is VALID [2018-11-23 12:29:49,077 INFO L268 TraceCheckUtils]: 85: Hoare quadruple {11190#false} {11190#false} #72#return; {11190#false} is VALID [2018-11-23 12:29:49,078 INFO L273 TraceCheckUtils]: 86: Hoare triple {11190#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {11190#false} is VALID [2018-11-23 12:29:49,078 INFO L273 TraceCheckUtils]: 87: Hoare triple {11190#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {11190#false} is VALID [2018-11-23 12:29:49,078 INFO L273 TraceCheckUtils]: 88: Hoare triple {11190#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {11190#false} is VALID [2018-11-23 12:29:49,078 INFO L273 TraceCheckUtils]: 89: Hoare triple {11190#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {11190#false} is VALID [2018-11-23 12:29:49,078 INFO L273 TraceCheckUtils]: 90: Hoare triple {11190#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {11190#false} is VALID [2018-11-23 12:29:49,078 INFO L273 TraceCheckUtils]: 91: Hoare triple {11190#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {11190#false} is VALID [2018-11-23 12:29:49,078 INFO L273 TraceCheckUtils]: 92: Hoare triple {11190#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {11190#false} is VALID [2018-11-23 12:29:49,078 INFO L273 TraceCheckUtils]: 93: Hoare triple {11190#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {11190#false} is VALID [2018-11-23 12:29:49,078 INFO L273 TraceCheckUtils]: 94: Hoare triple {11190#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {11190#false} is VALID [2018-11-23 12:29:49,079 INFO L273 TraceCheckUtils]: 95: Hoare triple {11190#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {11190#false} is VALID [2018-11-23 12:29:49,079 INFO L273 TraceCheckUtils]: 96: Hoare triple {11190#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {11190#false} is VALID [2018-11-23 12:29:49,079 INFO L273 TraceCheckUtils]: 97: Hoare triple {11190#false} assume !(~i~2 < 99999); {11190#false} is VALID [2018-11-23 12:29:49,079 INFO L273 TraceCheckUtils]: 98: Hoare triple {11190#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {11190#false} is VALID [2018-11-23 12:29:49,079 INFO L256 TraceCheckUtils]: 99: Hoare triple {11190#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {11190#false} is VALID [2018-11-23 12:29:49,079 INFO L273 TraceCheckUtils]: 100: Hoare triple {11190#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {11190#false} is VALID [2018-11-23 12:29:49,079 INFO L273 TraceCheckUtils]: 101: Hoare triple {11190#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11190#false} is VALID [2018-11-23 12:29:49,079 INFO L273 TraceCheckUtils]: 102: Hoare triple {11190#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11190#false} is VALID [2018-11-23 12:29:49,079 INFO L273 TraceCheckUtils]: 103: Hoare triple {11190#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11190#false} is VALID [2018-11-23 12:29:49,080 INFO L273 TraceCheckUtils]: 104: Hoare triple {11190#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11190#false} is VALID [2018-11-23 12:29:49,080 INFO L273 TraceCheckUtils]: 105: Hoare triple {11190#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11190#false} is VALID [2018-11-23 12:29:49,080 INFO L273 TraceCheckUtils]: 106: Hoare triple {11190#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11190#false} is VALID [2018-11-23 12:29:49,080 INFO L273 TraceCheckUtils]: 107: Hoare triple {11190#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11190#false} is VALID [2018-11-23 12:29:49,080 INFO L273 TraceCheckUtils]: 108: Hoare triple {11190#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11190#false} is VALID [2018-11-23 12:29:49,080 INFO L273 TraceCheckUtils]: 109: Hoare triple {11190#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11190#false} is VALID [2018-11-23 12:29:49,080 INFO L273 TraceCheckUtils]: 110: Hoare triple {11190#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11190#false} is VALID [2018-11-23 12:29:49,080 INFO L273 TraceCheckUtils]: 111: Hoare triple {11190#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11190#false} is VALID [2018-11-23 12:29:49,081 INFO L273 TraceCheckUtils]: 112: Hoare triple {11190#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11190#false} is VALID [2018-11-23 12:29:49,081 INFO L273 TraceCheckUtils]: 113: Hoare triple {11190#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11190#false} is VALID [2018-11-23 12:29:49,081 INFO L273 TraceCheckUtils]: 114: Hoare triple {11190#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11190#false} is VALID [2018-11-23 12:29:49,081 INFO L273 TraceCheckUtils]: 115: Hoare triple {11190#false} assume !(~i~0 < 100000); {11190#false} is VALID [2018-11-23 12:29:49,081 INFO L273 TraceCheckUtils]: 116: Hoare triple {11190#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11190#false} is VALID [2018-11-23 12:29:49,081 INFO L273 TraceCheckUtils]: 117: Hoare triple {11190#false} assume true; {11190#false} is VALID [2018-11-23 12:29:49,081 INFO L268 TraceCheckUtils]: 118: Hoare quadruple {11190#false} {11190#false} #74#return; {11190#false} is VALID [2018-11-23 12:29:49,081 INFO L273 TraceCheckUtils]: 119: Hoare triple {11190#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {11190#false} is VALID [2018-11-23 12:29:49,081 INFO L273 TraceCheckUtils]: 120: Hoare triple {11190#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {11190#false} is VALID [2018-11-23 12:29:49,082 INFO L273 TraceCheckUtils]: 121: Hoare triple {11190#false} assume !false; {11190#false} is VALID [2018-11-23 12:29:49,089 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2018-11-23 12:29:49,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:29:49,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-23 12:29:49,109 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 122 [2018-11-23 12:29:49,109 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:29:49,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 12:29:49,189 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 12:29:49,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 12:29:49,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 12:29:49,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:29:49,190 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 23 states. [2018-11-23 12:29:49,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:49,655 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-11-23 12:29:49,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 12:29:49,655 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 122 [2018-11-23 12:29:49,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:49,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:29:49,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 92 transitions. [2018-11-23 12:29:49,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:29:49,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 92 transitions. [2018-11-23 12:29:49,657 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 92 transitions. [2018-11-23 12:29:49,804 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 12:29:49,806 INFO L225 Difference]: With dead ends: 128 [2018-11-23 12:29:49,806 INFO L226 Difference]: Without dead ends: 88 [2018-11-23 12:29:49,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:29:49,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-23 12:29:49,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2018-11-23 12:29:49,838 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:49,838 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 87 states. [2018-11-23 12:29:49,839 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 87 states. [2018-11-23 12:29:49,839 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 87 states. [2018-11-23 12:29:49,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:49,840 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2018-11-23 12:29:49,840 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-11-23 12:29:49,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:49,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:49,841 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 88 states. [2018-11-23 12:29:49,841 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 88 states. [2018-11-23 12:29:49,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:49,843 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2018-11-23 12:29:49,843 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-11-23 12:29:49,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:49,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:49,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:49,844 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:49,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-23 12:29:49,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2018-11-23 12:29:49,846 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 122 [2018-11-23 12:29:49,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:49,846 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2018-11-23 12:29:49,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 12:29:49,846 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-11-23 12:29:49,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-23 12:29:49,847 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:49,847 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:29:49,847 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:49,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:49,848 INFO L82 PathProgramCache]: Analyzing trace with hash -415764741, now seen corresponding path program 20 times [2018-11-23 12:29:49,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:49,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:49,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:49,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:29:49,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:49,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:50,525 INFO L256 TraceCheckUtils]: 0: Hoare triple {12072#true} call ULTIMATE.init(); {12072#true} is VALID [2018-11-23 12:29:50,526 INFO L273 TraceCheckUtils]: 1: Hoare triple {12072#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12072#true} is VALID [2018-11-23 12:29:50,526 INFO L273 TraceCheckUtils]: 2: Hoare triple {12072#true} assume true; {12072#true} is VALID [2018-11-23 12:29:50,526 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12072#true} {12072#true} #66#return; {12072#true} is VALID [2018-11-23 12:29:50,526 INFO L256 TraceCheckUtils]: 4: Hoare triple {12072#true} call #t~ret13 := main(); {12072#true} is VALID [2018-11-23 12:29:50,527 INFO L273 TraceCheckUtils]: 5: Hoare triple {12072#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {12074#(= main_~i~1 0)} is VALID [2018-11-23 12:29:50,527 INFO L273 TraceCheckUtils]: 6: Hoare triple {12074#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12074#(= main_~i~1 0)} is VALID [2018-11-23 12:29:50,527 INFO L273 TraceCheckUtils]: 7: Hoare triple {12074#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12075#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:50,528 INFO L273 TraceCheckUtils]: 8: Hoare triple {12075#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12075#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:50,528 INFO L273 TraceCheckUtils]: 9: Hoare triple {12075#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12076#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:50,529 INFO L273 TraceCheckUtils]: 10: Hoare triple {12076#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12076#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:50,530 INFO L273 TraceCheckUtils]: 11: Hoare triple {12076#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12077#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:50,530 INFO L273 TraceCheckUtils]: 12: Hoare triple {12077#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12077#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:50,531 INFO L273 TraceCheckUtils]: 13: Hoare triple {12077#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12078#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:50,532 INFO L273 TraceCheckUtils]: 14: Hoare triple {12078#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12078#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:50,533 INFO L273 TraceCheckUtils]: 15: Hoare triple {12078#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12079#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:50,533 INFO L273 TraceCheckUtils]: 16: Hoare triple {12079#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12079#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:50,534 INFO L273 TraceCheckUtils]: 17: Hoare triple {12079#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12080#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:50,535 INFO L273 TraceCheckUtils]: 18: Hoare triple {12080#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12080#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:50,536 INFO L273 TraceCheckUtils]: 19: Hoare triple {12080#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12081#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:50,536 INFO L273 TraceCheckUtils]: 20: Hoare triple {12081#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12081#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:50,537 INFO L273 TraceCheckUtils]: 21: Hoare triple {12081#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12082#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:50,538 INFO L273 TraceCheckUtils]: 22: Hoare triple {12082#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12082#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:50,539 INFO L273 TraceCheckUtils]: 23: Hoare triple {12082#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12083#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:50,539 INFO L273 TraceCheckUtils]: 24: Hoare triple {12083#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12083#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:50,540 INFO L273 TraceCheckUtils]: 25: Hoare triple {12083#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12084#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:50,541 INFO L273 TraceCheckUtils]: 26: Hoare triple {12084#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12084#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:50,542 INFO L273 TraceCheckUtils]: 27: Hoare triple {12084#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12085#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:50,543 INFO L273 TraceCheckUtils]: 28: Hoare triple {12085#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12085#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:50,543 INFO L273 TraceCheckUtils]: 29: Hoare triple {12085#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12086#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:50,544 INFO L273 TraceCheckUtils]: 30: Hoare triple {12086#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12086#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:50,545 INFO L273 TraceCheckUtils]: 31: Hoare triple {12086#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12087#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:50,546 INFO L273 TraceCheckUtils]: 32: Hoare triple {12087#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12087#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:50,546 INFO L273 TraceCheckUtils]: 33: Hoare triple {12087#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12088#(<= main_~i~1 14)} is VALID [2018-11-23 12:29:50,547 INFO L273 TraceCheckUtils]: 34: Hoare triple {12088#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12088#(<= main_~i~1 14)} is VALID [2018-11-23 12:29:50,548 INFO L273 TraceCheckUtils]: 35: Hoare triple {12088#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12089#(<= main_~i~1 15)} is VALID [2018-11-23 12:29:50,549 INFO L273 TraceCheckUtils]: 36: Hoare triple {12089#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12089#(<= main_~i~1 15)} is VALID [2018-11-23 12:29:50,550 INFO L273 TraceCheckUtils]: 37: Hoare triple {12089#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12090#(<= main_~i~1 16)} is VALID [2018-11-23 12:29:50,550 INFO L273 TraceCheckUtils]: 38: Hoare triple {12090#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12090#(<= main_~i~1 16)} is VALID [2018-11-23 12:29:50,551 INFO L273 TraceCheckUtils]: 39: Hoare triple {12090#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12091#(<= main_~i~1 17)} is VALID [2018-11-23 12:29:50,552 INFO L273 TraceCheckUtils]: 40: Hoare triple {12091#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12091#(<= main_~i~1 17)} is VALID [2018-11-23 12:29:50,552 INFO L273 TraceCheckUtils]: 41: Hoare triple {12091#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12092#(<= main_~i~1 18)} is VALID [2018-11-23 12:29:50,553 INFO L273 TraceCheckUtils]: 42: Hoare triple {12092#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12092#(<= main_~i~1 18)} is VALID [2018-11-23 12:29:50,554 INFO L273 TraceCheckUtils]: 43: Hoare triple {12092#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12093#(<= main_~i~1 19)} is VALID [2018-11-23 12:29:50,555 INFO L273 TraceCheckUtils]: 44: Hoare triple {12093#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12093#(<= main_~i~1 19)} is VALID [2018-11-23 12:29:50,556 INFO L273 TraceCheckUtils]: 45: Hoare triple {12093#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12094#(<= main_~i~1 20)} is VALID [2018-11-23 12:29:50,556 INFO L273 TraceCheckUtils]: 46: Hoare triple {12094#(<= main_~i~1 20)} assume !(~i~1 < 100000); {12073#false} is VALID [2018-11-23 12:29:50,557 INFO L256 TraceCheckUtils]: 47: Hoare triple {12073#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {12072#true} is VALID [2018-11-23 12:29:50,557 INFO L273 TraceCheckUtils]: 48: Hoare triple {12072#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {12072#true} is VALID [2018-11-23 12:29:50,557 INFO L273 TraceCheckUtils]: 49: Hoare triple {12072#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12072#true} is VALID [2018-11-23 12:29:50,557 INFO L273 TraceCheckUtils]: 50: Hoare triple {12072#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12072#true} is VALID [2018-11-23 12:29:50,558 INFO L273 TraceCheckUtils]: 51: Hoare triple {12072#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12072#true} is VALID [2018-11-23 12:29:50,558 INFO L273 TraceCheckUtils]: 52: Hoare triple {12072#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12072#true} is VALID [2018-11-23 12:29:50,558 INFO L273 TraceCheckUtils]: 53: Hoare triple {12072#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12072#true} is VALID [2018-11-23 12:29:50,558 INFO L273 TraceCheckUtils]: 54: Hoare triple {12072#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12072#true} is VALID [2018-11-23 12:29:50,559 INFO L273 TraceCheckUtils]: 55: Hoare triple {12072#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12072#true} is VALID [2018-11-23 12:29:50,559 INFO L273 TraceCheckUtils]: 56: Hoare triple {12072#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12072#true} is VALID [2018-11-23 12:29:50,559 INFO L273 TraceCheckUtils]: 57: Hoare triple {12072#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12072#true} is VALID [2018-11-23 12:29:50,559 INFO L273 TraceCheckUtils]: 58: Hoare triple {12072#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12072#true} is VALID [2018-11-23 12:29:50,560 INFO L273 TraceCheckUtils]: 59: Hoare triple {12072#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12072#true} is VALID [2018-11-23 12:29:50,560 INFO L273 TraceCheckUtils]: 60: Hoare triple {12072#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12072#true} is VALID [2018-11-23 12:29:50,560 INFO L273 TraceCheckUtils]: 61: Hoare triple {12072#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12072#true} is VALID [2018-11-23 12:29:50,560 INFO L273 TraceCheckUtils]: 62: Hoare triple {12072#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12072#true} is VALID [2018-11-23 12:29:50,561 INFO L273 TraceCheckUtils]: 63: Hoare triple {12072#true} assume !(~i~0 < 100000); {12072#true} is VALID [2018-11-23 12:29:50,561 INFO L273 TraceCheckUtils]: 64: Hoare triple {12072#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {12072#true} is VALID [2018-11-23 12:29:50,561 INFO L273 TraceCheckUtils]: 65: Hoare triple {12072#true} assume true; {12072#true} is VALID [2018-11-23 12:29:50,561 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {12072#true} {12073#false} #70#return; {12073#false} is VALID [2018-11-23 12:29:50,561 INFO L273 TraceCheckUtils]: 67: Hoare triple {12073#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {12073#false} is VALID [2018-11-23 12:29:50,561 INFO L256 TraceCheckUtils]: 68: Hoare triple {12073#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {12072#true} is VALID [2018-11-23 12:29:50,562 INFO L273 TraceCheckUtils]: 69: Hoare triple {12072#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {12072#true} is VALID [2018-11-23 12:29:50,562 INFO L273 TraceCheckUtils]: 70: Hoare triple {12072#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12072#true} is VALID [2018-11-23 12:29:50,562 INFO L273 TraceCheckUtils]: 71: Hoare triple {12072#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12072#true} is VALID [2018-11-23 12:29:50,562 INFO L273 TraceCheckUtils]: 72: Hoare triple {12072#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12072#true} is VALID [2018-11-23 12:29:50,562 INFO L273 TraceCheckUtils]: 73: Hoare triple {12072#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12072#true} is VALID [2018-11-23 12:29:50,562 INFO L273 TraceCheckUtils]: 74: Hoare triple {12072#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12072#true} is VALID [2018-11-23 12:29:50,562 INFO L273 TraceCheckUtils]: 75: Hoare triple {12072#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12072#true} is VALID [2018-11-23 12:29:50,563 INFO L273 TraceCheckUtils]: 76: Hoare triple {12072#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12072#true} is VALID [2018-11-23 12:29:50,563 INFO L273 TraceCheckUtils]: 77: Hoare triple {12072#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12072#true} is VALID [2018-11-23 12:29:50,563 INFO L273 TraceCheckUtils]: 78: Hoare triple {12072#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12072#true} is VALID [2018-11-23 12:29:50,563 INFO L273 TraceCheckUtils]: 79: Hoare triple {12072#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12072#true} is VALID [2018-11-23 12:29:50,563 INFO L273 TraceCheckUtils]: 80: Hoare triple {12072#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12072#true} is VALID [2018-11-23 12:29:50,563 INFO L273 TraceCheckUtils]: 81: Hoare triple {12072#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12072#true} is VALID [2018-11-23 12:29:50,564 INFO L273 TraceCheckUtils]: 82: Hoare triple {12072#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12072#true} is VALID [2018-11-23 12:29:50,564 INFO L273 TraceCheckUtils]: 83: Hoare triple {12072#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12072#true} is VALID [2018-11-23 12:29:50,564 INFO L273 TraceCheckUtils]: 84: Hoare triple {12072#true} assume !(~i~0 < 100000); {12072#true} is VALID [2018-11-23 12:29:50,564 INFO L273 TraceCheckUtils]: 85: Hoare triple {12072#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {12072#true} is VALID [2018-11-23 12:29:50,564 INFO L273 TraceCheckUtils]: 86: Hoare triple {12072#true} assume true; {12072#true} is VALID [2018-11-23 12:29:50,564 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {12072#true} {12073#false} #72#return; {12073#false} is VALID [2018-11-23 12:29:50,565 INFO L273 TraceCheckUtils]: 88: Hoare triple {12073#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {12073#false} is VALID [2018-11-23 12:29:50,565 INFO L273 TraceCheckUtils]: 89: Hoare triple {12073#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12073#false} is VALID [2018-11-23 12:29:50,565 INFO L273 TraceCheckUtils]: 90: Hoare triple {12073#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12073#false} is VALID [2018-11-23 12:29:50,565 INFO L273 TraceCheckUtils]: 91: Hoare triple {12073#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12073#false} is VALID [2018-11-23 12:29:50,565 INFO L273 TraceCheckUtils]: 92: Hoare triple {12073#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12073#false} is VALID [2018-11-23 12:29:50,566 INFO L273 TraceCheckUtils]: 93: Hoare triple {12073#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12073#false} is VALID [2018-11-23 12:29:50,566 INFO L273 TraceCheckUtils]: 94: Hoare triple {12073#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12073#false} is VALID [2018-11-23 12:29:50,566 INFO L273 TraceCheckUtils]: 95: Hoare triple {12073#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12073#false} is VALID [2018-11-23 12:29:50,566 INFO L273 TraceCheckUtils]: 96: Hoare triple {12073#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12073#false} is VALID [2018-11-23 12:29:50,567 INFO L273 TraceCheckUtils]: 97: Hoare triple {12073#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12073#false} is VALID [2018-11-23 12:29:50,567 INFO L273 TraceCheckUtils]: 98: Hoare triple {12073#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12073#false} is VALID [2018-11-23 12:29:50,567 INFO L273 TraceCheckUtils]: 99: Hoare triple {12073#false} assume !(~i~2 < 99999); {12073#false} is VALID [2018-11-23 12:29:50,567 INFO L273 TraceCheckUtils]: 100: Hoare triple {12073#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {12073#false} is VALID [2018-11-23 12:29:50,567 INFO L256 TraceCheckUtils]: 101: Hoare triple {12073#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {12072#true} is VALID [2018-11-23 12:29:50,568 INFO L273 TraceCheckUtils]: 102: Hoare triple {12072#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {12072#true} is VALID [2018-11-23 12:29:50,568 INFO L273 TraceCheckUtils]: 103: Hoare triple {12072#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12072#true} is VALID [2018-11-23 12:29:50,568 INFO L273 TraceCheckUtils]: 104: Hoare triple {12072#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12072#true} is VALID [2018-11-23 12:29:50,568 INFO L273 TraceCheckUtils]: 105: Hoare triple {12072#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12072#true} is VALID [2018-11-23 12:29:50,568 INFO L273 TraceCheckUtils]: 106: Hoare triple {12072#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12072#true} is VALID [2018-11-23 12:29:50,569 INFO L273 TraceCheckUtils]: 107: Hoare triple {12072#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12072#true} is VALID [2018-11-23 12:29:50,569 INFO L273 TraceCheckUtils]: 108: Hoare triple {12072#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12072#true} is VALID [2018-11-23 12:29:50,569 INFO L273 TraceCheckUtils]: 109: Hoare triple {12072#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12072#true} is VALID [2018-11-23 12:29:50,569 INFO L273 TraceCheckUtils]: 110: Hoare triple {12072#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12072#true} is VALID [2018-11-23 12:29:50,569 INFO L273 TraceCheckUtils]: 111: Hoare triple {12072#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12072#true} is VALID [2018-11-23 12:29:50,569 INFO L273 TraceCheckUtils]: 112: Hoare triple {12072#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12072#true} is VALID [2018-11-23 12:29:50,570 INFO L273 TraceCheckUtils]: 113: Hoare triple {12072#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12072#true} is VALID [2018-11-23 12:29:50,570 INFO L273 TraceCheckUtils]: 114: Hoare triple {12072#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12072#true} is VALID [2018-11-23 12:29:50,570 INFO L273 TraceCheckUtils]: 115: Hoare triple {12072#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12072#true} is VALID [2018-11-23 12:29:50,570 INFO L273 TraceCheckUtils]: 116: Hoare triple {12072#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12072#true} is VALID [2018-11-23 12:29:50,570 INFO L273 TraceCheckUtils]: 117: Hoare triple {12072#true} assume !(~i~0 < 100000); {12072#true} is VALID [2018-11-23 12:29:50,570 INFO L273 TraceCheckUtils]: 118: Hoare triple {12072#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {12072#true} is VALID [2018-11-23 12:29:50,571 INFO L273 TraceCheckUtils]: 119: Hoare triple {12072#true} assume true; {12072#true} is VALID [2018-11-23 12:29:50,571 INFO L268 TraceCheckUtils]: 120: Hoare quadruple {12072#true} {12073#false} #74#return; {12073#false} is VALID [2018-11-23 12:29:50,571 INFO L273 TraceCheckUtils]: 121: Hoare triple {12073#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {12073#false} is VALID [2018-11-23 12:29:50,571 INFO L273 TraceCheckUtils]: 122: Hoare triple {12073#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {12073#false} is VALID [2018-11-23 12:29:50,571 INFO L273 TraceCheckUtils]: 123: Hoare triple {12073#false} assume !false; {12073#false} is VALID [2018-11-23 12:29:50,587 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2018-11-23 12:29:50,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:29:50,587 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 12:29:50,602 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:29:50,681 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:29:50,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:29:50,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:50,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:29:51,365 INFO L256 TraceCheckUtils]: 0: Hoare triple {12072#true} call ULTIMATE.init(); {12072#true} is VALID [2018-11-23 12:29:51,365 INFO L273 TraceCheckUtils]: 1: Hoare triple {12072#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12072#true} is VALID [2018-11-23 12:29:51,365 INFO L273 TraceCheckUtils]: 2: Hoare triple {12072#true} assume true; {12072#true} is VALID [2018-11-23 12:29:51,366 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12072#true} {12072#true} #66#return; {12072#true} is VALID [2018-11-23 12:29:51,366 INFO L256 TraceCheckUtils]: 4: Hoare triple {12072#true} call #t~ret13 := main(); {12072#true} is VALID [2018-11-23 12:29:51,366 INFO L273 TraceCheckUtils]: 5: Hoare triple {12072#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {12113#(<= main_~i~1 0)} is VALID [2018-11-23 12:29:51,368 INFO L273 TraceCheckUtils]: 6: Hoare triple {12113#(<= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12113#(<= main_~i~1 0)} is VALID [2018-11-23 12:29:51,368 INFO L273 TraceCheckUtils]: 7: Hoare triple {12113#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12075#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:51,370 INFO L273 TraceCheckUtils]: 8: Hoare triple {12075#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12075#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:51,371 INFO L273 TraceCheckUtils]: 9: Hoare triple {12075#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12076#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:51,372 INFO L273 TraceCheckUtils]: 10: Hoare triple {12076#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12076#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:51,372 INFO L273 TraceCheckUtils]: 11: Hoare triple {12076#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12077#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:51,375 INFO L273 TraceCheckUtils]: 12: Hoare triple {12077#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12077#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:51,376 INFO L273 TraceCheckUtils]: 13: Hoare triple {12077#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12078#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:51,378 INFO L273 TraceCheckUtils]: 14: Hoare triple {12078#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12078#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:51,378 INFO L273 TraceCheckUtils]: 15: Hoare triple {12078#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12079#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:51,380 INFO L273 TraceCheckUtils]: 16: Hoare triple {12079#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12079#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:51,380 INFO L273 TraceCheckUtils]: 17: Hoare triple {12079#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12080#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:51,382 INFO L273 TraceCheckUtils]: 18: Hoare triple {12080#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12080#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:51,383 INFO L273 TraceCheckUtils]: 19: Hoare triple {12080#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12081#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:51,383 INFO L273 TraceCheckUtils]: 20: Hoare triple {12081#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12081#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:51,384 INFO L273 TraceCheckUtils]: 21: Hoare triple {12081#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12082#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:51,388 INFO L273 TraceCheckUtils]: 22: Hoare triple {12082#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12082#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:51,389 INFO L273 TraceCheckUtils]: 23: Hoare triple {12082#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12083#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:51,391 INFO L273 TraceCheckUtils]: 24: Hoare triple {12083#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12083#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:51,392 INFO L273 TraceCheckUtils]: 25: Hoare triple {12083#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12084#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:51,393 INFO L273 TraceCheckUtils]: 26: Hoare triple {12084#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12084#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:51,393 INFO L273 TraceCheckUtils]: 27: Hoare triple {12084#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12085#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:51,395 INFO L273 TraceCheckUtils]: 28: Hoare triple {12085#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12085#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:51,395 INFO L273 TraceCheckUtils]: 29: Hoare triple {12085#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12086#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:51,397 INFO L273 TraceCheckUtils]: 30: Hoare triple {12086#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12086#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:51,398 INFO L273 TraceCheckUtils]: 31: Hoare triple {12086#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12087#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:51,399 INFO L273 TraceCheckUtils]: 32: Hoare triple {12087#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12087#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:51,400 INFO L273 TraceCheckUtils]: 33: Hoare triple {12087#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12088#(<= main_~i~1 14)} is VALID [2018-11-23 12:29:51,400 INFO L273 TraceCheckUtils]: 34: Hoare triple {12088#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12088#(<= main_~i~1 14)} is VALID [2018-11-23 12:29:51,401 INFO L273 TraceCheckUtils]: 35: Hoare triple {12088#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12089#(<= main_~i~1 15)} is VALID [2018-11-23 12:29:51,402 INFO L273 TraceCheckUtils]: 36: Hoare triple {12089#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12089#(<= main_~i~1 15)} is VALID [2018-11-23 12:29:51,405 INFO L273 TraceCheckUtils]: 37: Hoare triple {12089#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12090#(<= main_~i~1 16)} is VALID [2018-11-23 12:29:51,405 INFO L273 TraceCheckUtils]: 38: Hoare triple {12090#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12090#(<= main_~i~1 16)} is VALID [2018-11-23 12:29:51,406 INFO L273 TraceCheckUtils]: 39: Hoare triple {12090#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12091#(<= main_~i~1 17)} is VALID [2018-11-23 12:29:51,406 INFO L273 TraceCheckUtils]: 40: Hoare triple {12091#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12091#(<= main_~i~1 17)} is VALID [2018-11-23 12:29:51,407 INFO L273 TraceCheckUtils]: 41: Hoare triple {12091#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12092#(<= main_~i~1 18)} is VALID [2018-11-23 12:29:51,407 INFO L273 TraceCheckUtils]: 42: Hoare triple {12092#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12092#(<= main_~i~1 18)} is VALID [2018-11-23 12:29:51,408 INFO L273 TraceCheckUtils]: 43: Hoare triple {12092#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12093#(<= main_~i~1 19)} is VALID [2018-11-23 12:29:51,408 INFO L273 TraceCheckUtils]: 44: Hoare triple {12093#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12093#(<= main_~i~1 19)} is VALID [2018-11-23 12:29:51,408 INFO L273 TraceCheckUtils]: 45: Hoare triple {12093#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12094#(<= main_~i~1 20)} is VALID [2018-11-23 12:29:51,409 INFO L273 TraceCheckUtils]: 46: Hoare triple {12094#(<= main_~i~1 20)} assume !(~i~1 < 100000); {12073#false} is VALID [2018-11-23 12:29:51,409 INFO L256 TraceCheckUtils]: 47: Hoare triple {12073#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {12073#false} is VALID [2018-11-23 12:29:51,409 INFO L273 TraceCheckUtils]: 48: Hoare triple {12073#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {12073#false} is VALID [2018-11-23 12:29:51,409 INFO L273 TraceCheckUtils]: 49: Hoare triple {12073#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12073#false} is VALID [2018-11-23 12:29:51,410 INFO L273 TraceCheckUtils]: 50: Hoare triple {12073#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12073#false} is VALID [2018-11-23 12:29:51,410 INFO L273 TraceCheckUtils]: 51: Hoare triple {12073#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12073#false} is VALID [2018-11-23 12:29:51,410 INFO L273 TraceCheckUtils]: 52: Hoare triple {12073#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12073#false} is VALID [2018-11-23 12:29:51,410 INFO L273 TraceCheckUtils]: 53: Hoare triple {12073#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12073#false} is VALID [2018-11-23 12:29:51,410 INFO L273 TraceCheckUtils]: 54: Hoare triple {12073#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12073#false} is VALID [2018-11-23 12:29:51,410 INFO L273 TraceCheckUtils]: 55: Hoare triple {12073#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12073#false} is VALID [2018-11-23 12:29:51,411 INFO L273 TraceCheckUtils]: 56: Hoare triple {12073#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12073#false} is VALID [2018-11-23 12:29:51,411 INFO L273 TraceCheckUtils]: 57: Hoare triple {12073#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12073#false} is VALID [2018-11-23 12:29:51,411 INFO L273 TraceCheckUtils]: 58: Hoare triple {12073#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12073#false} is VALID [2018-11-23 12:29:51,411 INFO L273 TraceCheckUtils]: 59: Hoare triple {12073#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12073#false} is VALID [2018-11-23 12:29:51,411 INFO L273 TraceCheckUtils]: 60: Hoare triple {12073#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12073#false} is VALID [2018-11-23 12:29:51,412 INFO L273 TraceCheckUtils]: 61: Hoare triple {12073#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12073#false} is VALID [2018-11-23 12:29:51,412 INFO L273 TraceCheckUtils]: 62: Hoare triple {12073#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12073#false} is VALID [2018-11-23 12:29:51,412 INFO L273 TraceCheckUtils]: 63: Hoare triple {12073#false} assume !(~i~0 < 100000); {12073#false} is VALID [2018-11-23 12:29:51,412 INFO L273 TraceCheckUtils]: 64: Hoare triple {12073#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {12073#false} is VALID [2018-11-23 12:29:51,413 INFO L273 TraceCheckUtils]: 65: Hoare triple {12073#false} assume true; {12073#false} is VALID [2018-11-23 12:29:51,413 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {12073#false} {12073#false} #70#return; {12073#false} is VALID [2018-11-23 12:29:51,413 INFO L273 TraceCheckUtils]: 67: Hoare triple {12073#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {12073#false} is VALID [2018-11-23 12:29:51,413 INFO L256 TraceCheckUtils]: 68: Hoare triple {12073#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {12073#false} is VALID [2018-11-23 12:29:51,413 INFO L273 TraceCheckUtils]: 69: Hoare triple {12073#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {12073#false} is VALID [2018-11-23 12:29:51,413 INFO L273 TraceCheckUtils]: 70: Hoare triple {12073#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12073#false} is VALID [2018-11-23 12:29:51,413 INFO L273 TraceCheckUtils]: 71: Hoare triple {12073#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12073#false} is VALID [2018-11-23 12:29:51,414 INFO L273 TraceCheckUtils]: 72: Hoare triple {12073#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12073#false} is VALID [2018-11-23 12:29:51,414 INFO L273 TraceCheckUtils]: 73: Hoare triple {12073#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12073#false} is VALID [2018-11-23 12:29:51,414 INFO L273 TraceCheckUtils]: 74: Hoare triple {12073#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12073#false} is VALID [2018-11-23 12:29:51,414 INFO L273 TraceCheckUtils]: 75: Hoare triple {12073#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12073#false} is VALID [2018-11-23 12:29:51,414 INFO L273 TraceCheckUtils]: 76: Hoare triple {12073#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12073#false} is VALID [2018-11-23 12:29:51,414 INFO L273 TraceCheckUtils]: 77: Hoare triple {12073#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12073#false} is VALID [2018-11-23 12:29:51,414 INFO L273 TraceCheckUtils]: 78: Hoare triple {12073#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12073#false} is VALID [2018-11-23 12:29:51,415 INFO L273 TraceCheckUtils]: 79: Hoare triple {12073#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12073#false} is VALID [2018-11-23 12:29:51,415 INFO L273 TraceCheckUtils]: 80: Hoare triple {12073#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12073#false} is VALID [2018-11-23 12:29:51,415 INFO L273 TraceCheckUtils]: 81: Hoare triple {12073#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12073#false} is VALID [2018-11-23 12:29:51,415 INFO L273 TraceCheckUtils]: 82: Hoare triple {12073#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12073#false} is VALID [2018-11-23 12:29:51,415 INFO L273 TraceCheckUtils]: 83: Hoare triple {12073#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12073#false} is VALID [2018-11-23 12:29:51,415 INFO L273 TraceCheckUtils]: 84: Hoare triple {12073#false} assume !(~i~0 < 100000); {12073#false} is VALID [2018-11-23 12:29:51,415 INFO L273 TraceCheckUtils]: 85: Hoare triple {12073#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {12073#false} is VALID [2018-11-23 12:29:51,416 INFO L273 TraceCheckUtils]: 86: Hoare triple {12073#false} assume true; {12073#false} is VALID [2018-11-23 12:29:51,416 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {12073#false} {12073#false} #72#return; {12073#false} is VALID [2018-11-23 12:29:51,416 INFO L273 TraceCheckUtils]: 88: Hoare triple {12073#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {12073#false} is VALID [2018-11-23 12:29:51,416 INFO L273 TraceCheckUtils]: 89: Hoare triple {12073#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12073#false} is VALID [2018-11-23 12:29:51,416 INFO L273 TraceCheckUtils]: 90: Hoare triple {12073#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12073#false} is VALID [2018-11-23 12:29:51,416 INFO L273 TraceCheckUtils]: 91: Hoare triple {12073#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12073#false} is VALID [2018-11-23 12:29:51,416 INFO L273 TraceCheckUtils]: 92: Hoare triple {12073#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12073#false} is VALID [2018-11-23 12:29:51,417 INFO L273 TraceCheckUtils]: 93: Hoare triple {12073#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12073#false} is VALID [2018-11-23 12:29:51,417 INFO L273 TraceCheckUtils]: 94: Hoare triple {12073#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12073#false} is VALID [2018-11-23 12:29:51,417 INFO L273 TraceCheckUtils]: 95: Hoare triple {12073#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12073#false} is VALID [2018-11-23 12:29:51,417 INFO L273 TraceCheckUtils]: 96: Hoare triple {12073#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12073#false} is VALID [2018-11-23 12:29:51,417 INFO L273 TraceCheckUtils]: 97: Hoare triple {12073#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12073#false} is VALID [2018-11-23 12:29:51,417 INFO L273 TraceCheckUtils]: 98: Hoare triple {12073#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12073#false} is VALID [2018-11-23 12:29:51,417 INFO L273 TraceCheckUtils]: 99: Hoare triple {12073#false} assume !(~i~2 < 99999); {12073#false} is VALID [2018-11-23 12:29:51,418 INFO L273 TraceCheckUtils]: 100: Hoare triple {12073#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {12073#false} is VALID [2018-11-23 12:29:51,418 INFO L256 TraceCheckUtils]: 101: Hoare triple {12073#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {12073#false} is VALID [2018-11-23 12:29:51,418 INFO L273 TraceCheckUtils]: 102: Hoare triple {12073#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {12073#false} is VALID [2018-11-23 12:29:51,418 INFO L273 TraceCheckUtils]: 103: Hoare triple {12073#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12073#false} is VALID [2018-11-23 12:29:51,418 INFO L273 TraceCheckUtils]: 104: Hoare triple {12073#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12073#false} is VALID [2018-11-23 12:29:51,418 INFO L273 TraceCheckUtils]: 105: Hoare triple {12073#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12073#false} is VALID [2018-11-23 12:29:51,418 INFO L273 TraceCheckUtils]: 106: Hoare triple {12073#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12073#false} is VALID [2018-11-23 12:29:51,419 INFO L273 TraceCheckUtils]: 107: Hoare triple {12073#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12073#false} is VALID [2018-11-23 12:29:51,419 INFO L273 TraceCheckUtils]: 108: Hoare triple {12073#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12073#false} is VALID [2018-11-23 12:29:51,419 INFO L273 TraceCheckUtils]: 109: Hoare triple {12073#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12073#false} is VALID [2018-11-23 12:29:51,419 INFO L273 TraceCheckUtils]: 110: Hoare triple {12073#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12073#false} is VALID [2018-11-23 12:29:51,419 INFO L273 TraceCheckUtils]: 111: Hoare triple {12073#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12073#false} is VALID [2018-11-23 12:29:51,419 INFO L273 TraceCheckUtils]: 112: Hoare triple {12073#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12073#false} is VALID [2018-11-23 12:29:51,419 INFO L273 TraceCheckUtils]: 113: Hoare triple {12073#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12073#false} is VALID [2018-11-23 12:29:51,420 INFO L273 TraceCheckUtils]: 114: Hoare triple {12073#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12073#false} is VALID [2018-11-23 12:29:51,420 INFO L273 TraceCheckUtils]: 115: Hoare triple {12073#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12073#false} is VALID [2018-11-23 12:29:51,420 INFO L273 TraceCheckUtils]: 116: Hoare triple {12073#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12073#false} is VALID [2018-11-23 12:29:51,420 INFO L273 TraceCheckUtils]: 117: Hoare triple {12073#false} assume !(~i~0 < 100000); {12073#false} is VALID [2018-11-23 12:29:51,420 INFO L273 TraceCheckUtils]: 118: Hoare triple {12073#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {12073#false} is VALID [2018-11-23 12:29:51,420 INFO L273 TraceCheckUtils]: 119: Hoare triple {12073#false} assume true; {12073#false} is VALID [2018-11-23 12:29:51,420 INFO L268 TraceCheckUtils]: 120: Hoare quadruple {12073#false} {12073#false} #74#return; {12073#false} is VALID [2018-11-23 12:29:51,421 INFO L273 TraceCheckUtils]: 121: Hoare triple {12073#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {12073#false} is VALID [2018-11-23 12:29:51,421 INFO L273 TraceCheckUtils]: 122: Hoare triple {12073#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {12073#false} is VALID [2018-11-23 12:29:51,421 INFO L273 TraceCheckUtils]: 123: Hoare triple {12073#false} assume !false; {12073#false} is VALID [2018-11-23 12:29:51,436 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2018-11-23 12:29:51,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:29:51,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-23 12:29:51,456 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 124 [2018-11-23 12:29:51,456 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:29:51,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 12:29:51,576 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 12:29:51,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 12:29:51,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 12:29:51,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:29:51,577 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 24 states. [2018-11-23 12:29:52,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:52,244 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2018-11-23 12:29:52,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 12:29:52,245 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 124 [2018-11-23 12:29:52,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:52,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:29:52,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 94 transitions. [2018-11-23 12:29:52,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:29:52,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 94 transitions. [2018-11-23 12:29:52,247 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 94 transitions. [2018-11-23 12:29:52,446 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 12:29:52,448 INFO L225 Difference]: With dead ends: 130 [2018-11-23 12:29:52,449 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 12:29:52,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 124 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 12:29:52,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 12:29:52,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-11-23 12:29:52,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:52,479 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 89 states. [2018-11-23 12:29:52,480 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 89 states. [2018-11-23 12:29:52,480 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 89 states. [2018-11-23 12:29:52,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:52,482 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-11-23 12:29:52,482 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-11-23 12:29:52,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:52,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:52,483 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 90 states. [2018-11-23 12:29:52,483 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 90 states. [2018-11-23 12:29:52,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:52,485 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-11-23 12:29:52,485 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-11-23 12:29:52,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:52,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:52,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:52,486 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:52,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-23 12:29:52,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-11-23 12:29:52,488 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 124 [2018-11-23 12:29:52,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:52,488 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-11-23 12:29:52,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 12:29:52,488 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-11-23 12:29:52,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-23 12:29:52,489 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:52,489 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:29:52,490 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:52,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:52,490 INFO L82 PathProgramCache]: Analyzing trace with hash -946768803, now seen corresponding path program 21 times [2018-11-23 12:29:52,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:52,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:52,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:52,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:29:52,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:52,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:53,013 INFO L256 TraceCheckUtils]: 0: Hoare triple {12972#true} call ULTIMATE.init(); {12972#true} is VALID [2018-11-23 12:29:53,014 INFO L273 TraceCheckUtils]: 1: Hoare triple {12972#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12972#true} is VALID [2018-11-23 12:29:53,014 INFO L273 TraceCheckUtils]: 2: Hoare triple {12972#true} assume true; {12972#true} is VALID [2018-11-23 12:29:53,014 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12972#true} {12972#true} #66#return; {12972#true} is VALID [2018-11-23 12:29:53,015 INFO L256 TraceCheckUtils]: 4: Hoare triple {12972#true} call #t~ret13 := main(); {12972#true} is VALID [2018-11-23 12:29:53,035 INFO L273 TraceCheckUtils]: 5: Hoare triple {12972#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {12974#(= main_~i~1 0)} is VALID [2018-11-23 12:29:53,052 INFO L273 TraceCheckUtils]: 6: Hoare triple {12974#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12974#(= main_~i~1 0)} is VALID [2018-11-23 12:29:53,061 INFO L273 TraceCheckUtils]: 7: Hoare triple {12974#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12975#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:53,064 INFO L273 TraceCheckUtils]: 8: Hoare triple {12975#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12975#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:53,065 INFO L273 TraceCheckUtils]: 9: Hoare triple {12975#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12976#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:53,065 INFO L273 TraceCheckUtils]: 10: Hoare triple {12976#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12976#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:53,065 INFO L273 TraceCheckUtils]: 11: Hoare triple {12976#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12977#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:53,066 INFO L273 TraceCheckUtils]: 12: Hoare triple {12977#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12977#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:53,066 INFO L273 TraceCheckUtils]: 13: Hoare triple {12977#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12978#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:53,066 INFO L273 TraceCheckUtils]: 14: Hoare triple {12978#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12978#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:53,067 INFO L273 TraceCheckUtils]: 15: Hoare triple {12978#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12979#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:53,067 INFO L273 TraceCheckUtils]: 16: Hoare triple {12979#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12979#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:53,068 INFO L273 TraceCheckUtils]: 17: Hoare triple {12979#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12980#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:53,068 INFO L273 TraceCheckUtils]: 18: Hoare triple {12980#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12980#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:53,068 INFO L273 TraceCheckUtils]: 19: Hoare triple {12980#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12981#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:53,069 INFO L273 TraceCheckUtils]: 20: Hoare triple {12981#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12981#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:53,070 INFO L273 TraceCheckUtils]: 21: Hoare triple {12981#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12982#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:53,070 INFO L273 TraceCheckUtils]: 22: Hoare triple {12982#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12982#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:53,071 INFO L273 TraceCheckUtils]: 23: Hoare triple {12982#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12983#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:53,071 INFO L273 TraceCheckUtils]: 24: Hoare triple {12983#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12983#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:53,072 INFO L273 TraceCheckUtils]: 25: Hoare triple {12983#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12984#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:53,073 INFO L273 TraceCheckUtils]: 26: Hoare triple {12984#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12984#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:53,073 INFO L273 TraceCheckUtils]: 27: Hoare triple {12984#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12985#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:53,074 INFO L273 TraceCheckUtils]: 28: Hoare triple {12985#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12985#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:53,075 INFO L273 TraceCheckUtils]: 29: Hoare triple {12985#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12986#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:53,075 INFO L273 TraceCheckUtils]: 30: Hoare triple {12986#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12986#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:53,076 INFO L273 TraceCheckUtils]: 31: Hoare triple {12986#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12987#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:53,076 INFO L273 TraceCheckUtils]: 32: Hoare triple {12987#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12987#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:53,077 INFO L273 TraceCheckUtils]: 33: Hoare triple {12987#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12988#(<= main_~i~1 14)} is VALID [2018-11-23 12:29:53,078 INFO L273 TraceCheckUtils]: 34: Hoare triple {12988#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12988#(<= main_~i~1 14)} is VALID [2018-11-23 12:29:53,078 INFO L273 TraceCheckUtils]: 35: Hoare triple {12988#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12989#(<= main_~i~1 15)} is VALID [2018-11-23 12:29:53,079 INFO L273 TraceCheckUtils]: 36: Hoare triple {12989#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12989#(<= main_~i~1 15)} is VALID [2018-11-23 12:29:53,080 INFO L273 TraceCheckUtils]: 37: Hoare triple {12989#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12990#(<= main_~i~1 16)} is VALID [2018-11-23 12:29:53,080 INFO L273 TraceCheckUtils]: 38: Hoare triple {12990#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12990#(<= main_~i~1 16)} is VALID [2018-11-23 12:29:53,081 INFO L273 TraceCheckUtils]: 39: Hoare triple {12990#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12991#(<= main_~i~1 17)} is VALID [2018-11-23 12:29:53,081 INFO L273 TraceCheckUtils]: 40: Hoare triple {12991#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12991#(<= main_~i~1 17)} is VALID [2018-11-23 12:29:53,082 INFO L273 TraceCheckUtils]: 41: Hoare triple {12991#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12992#(<= main_~i~1 18)} is VALID [2018-11-23 12:29:53,083 INFO L273 TraceCheckUtils]: 42: Hoare triple {12992#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12992#(<= main_~i~1 18)} is VALID [2018-11-23 12:29:53,083 INFO L273 TraceCheckUtils]: 43: Hoare triple {12992#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12993#(<= main_~i~1 19)} is VALID [2018-11-23 12:29:53,084 INFO L273 TraceCheckUtils]: 44: Hoare triple {12993#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12993#(<= main_~i~1 19)} is VALID [2018-11-23 12:29:53,085 INFO L273 TraceCheckUtils]: 45: Hoare triple {12993#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12994#(<= main_~i~1 20)} is VALID [2018-11-23 12:29:53,085 INFO L273 TraceCheckUtils]: 46: Hoare triple {12994#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12994#(<= main_~i~1 20)} is VALID [2018-11-23 12:29:53,086 INFO L273 TraceCheckUtils]: 47: Hoare triple {12994#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12995#(<= main_~i~1 21)} is VALID [2018-11-23 12:29:53,087 INFO L273 TraceCheckUtils]: 48: Hoare triple {12995#(<= main_~i~1 21)} assume !(~i~1 < 100000); {12973#false} is VALID [2018-11-23 12:29:53,087 INFO L256 TraceCheckUtils]: 49: Hoare triple {12973#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {12972#true} is VALID [2018-11-23 12:29:53,087 INFO L273 TraceCheckUtils]: 50: Hoare triple {12972#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {12972#true} is VALID [2018-11-23 12:29:53,087 INFO L273 TraceCheckUtils]: 51: Hoare triple {12972#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12972#true} is VALID [2018-11-23 12:29:53,087 INFO L273 TraceCheckUtils]: 52: Hoare triple {12972#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12972#true} is VALID [2018-11-23 12:29:53,088 INFO L273 TraceCheckUtils]: 53: Hoare triple {12972#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12972#true} is VALID [2018-11-23 12:29:53,088 INFO L273 TraceCheckUtils]: 54: Hoare triple {12972#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12972#true} is VALID [2018-11-23 12:29:53,088 INFO L273 TraceCheckUtils]: 55: Hoare triple {12972#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12972#true} is VALID [2018-11-23 12:29:53,088 INFO L273 TraceCheckUtils]: 56: Hoare triple {12972#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12972#true} is VALID [2018-11-23 12:29:53,088 INFO L273 TraceCheckUtils]: 57: Hoare triple {12972#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12972#true} is VALID [2018-11-23 12:29:53,089 INFO L273 TraceCheckUtils]: 58: Hoare triple {12972#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12972#true} is VALID [2018-11-23 12:29:53,089 INFO L273 TraceCheckUtils]: 59: Hoare triple {12972#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12972#true} is VALID [2018-11-23 12:29:53,089 INFO L273 TraceCheckUtils]: 60: Hoare triple {12972#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12972#true} is VALID [2018-11-23 12:29:53,089 INFO L273 TraceCheckUtils]: 61: Hoare triple {12972#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12972#true} is VALID [2018-11-23 12:29:53,089 INFO L273 TraceCheckUtils]: 62: Hoare triple {12972#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12972#true} is VALID [2018-11-23 12:29:53,090 INFO L273 TraceCheckUtils]: 63: Hoare triple {12972#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12972#true} is VALID [2018-11-23 12:29:53,090 INFO L273 TraceCheckUtils]: 64: Hoare triple {12972#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12972#true} is VALID [2018-11-23 12:29:53,090 INFO L273 TraceCheckUtils]: 65: Hoare triple {12972#true} assume !(~i~0 < 100000); {12972#true} is VALID [2018-11-23 12:29:53,090 INFO L273 TraceCheckUtils]: 66: Hoare triple {12972#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {12972#true} is VALID [2018-11-23 12:29:53,090 INFO L273 TraceCheckUtils]: 67: Hoare triple {12972#true} assume true; {12972#true} is VALID [2018-11-23 12:29:53,090 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {12972#true} {12973#false} #70#return; {12973#false} is VALID [2018-11-23 12:29:53,090 INFO L273 TraceCheckUtils]: 69: Hoare triple {12973#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {12973#false} is VALID [2018-11-23 12:29:53,090 INFO L256 TraceCheckUtils]: 70: Hoare triple {12973#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {12972#true} is VALID [2018-11-23 12:29:53,090 INFO L273 TraceCheckUtils]: 71: Hoare triple {12972#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {12972#true} is VALID [2018-11-23 12:29:53,090 INFO L273 TraceCheckUtils]: 72: Hoare triple {12972#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12972#true} is VALID [2018-11-23 12:29:53,091 INFO L273 TraceCheckUtils]: 73: Hoare triple {12972#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12972#true} is VALID [2018-11-23 12:29:53,091 INFO L273 TraceCheckUtils]: 74: Hoare triple {12972#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12972#true} is VALID [2018-11-23 12:29:53,091 INFO L273 TraceCheckUtils]: 75: Hoare triple {12972#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12972#true} is VALID [2018-11-23 12:29:53,091 INFO L273 TraceCheckUtils]: 76: Hoare triple {12972#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12972#true} is VALID [2018-11-23 12:29:53,091 INFO L273 TraceCheckUtils]: 77: Hoare triple {12972#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12972#true} is VALID [2018-11-23 12:29:53,091 INFO L273 TraceCheckUtils]: 78: Hoare triple {12972#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12972#true} is VALID [2018-11-23 12:29:53,091 INFO L273 TraceCheckUtils]: 79: Hoare triple {12972#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12972#true} is VALID [2018-11-23 12:29:53,091 INFO L273 TraceCheckUtils]: 80: Hoare triple {12972#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12972#true} is VALID [2018-11-23 12:29:53,091 INFO L273 TraceCheckUtils]: 81: Hoare triple {12972#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12972#true} is VALID [2018-11-23 12:29:53,092 INFO L273 TraceCheckUtils]: 82: Hoare triple {12972#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12972#true} is VALID [2018-11-23 12:29:53,092 INFO L273 TraceCheckUtils]: 83: Hoare triple {12972#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12972#true} is VALID [2018-11-23 12:29:53,092 INFO L273 TraceCheckUtils]: 84: Hoare triple {12972#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12972#true} is VALID [2018-11-23 12:29:53,092 INFO L273 TraceCheckUtils]: 85: Hoare triple {12972#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12972#true} is VALID [2018-11-23 12:29:53,092 INFO L273 TraceCheckUtils]: 86: Hoare triple {12972#true} assume !(~i~0 < 100000); {12972#true} is VALID [2018-11-23 12:29:53,092 INFO L273 TraceCheckUtils]: 87: Hoare triple {12972#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {12972#true} is VALID [2018-11-23 12:29:53,093 INFO L273 TraceCheckUtils]: 88: Hoare triple {12972#true} assume true; {12972#true} is VALID [2018-11-23 12:29:53,093 INFO L268 TraceCheckUtils]: 89: Hoare quadruple {12972#true} {12973#false} #72#return; {12973#false} is VALID [2018-11-23 12:29:53,093 INFO L273 TraceCheckUtils]: 90: Hoare triple {12973#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {12973#false} is VALID [2018-11-23 12:29:53,093 INFO L273 TraceCheckUtils]: 91: Hoare triple {12973#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12973#false} is VALID [2018-11-23 12:29:53,093 INFO L273 TraceCheckUtils]: 92: Hoare triple {12973#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12973#false} is VALID [2018-11-23 12:29:53,093 INFO L273 TraceCheckUtils]: 93: Hoare triple {12973#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12973#false} is VALID [2018-11-23 12:29:53,093 INFO L273 TraceCheckUtils]: 94: Hoare triple {12973#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12973#false} is VALID [2018-11-23 12:29:53,094 INFO L273 TraceCheckUtils]: 95: Hoare triple {12973#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12973#false} is VALID [2018-11-23 12:29:53,094 INFO L273 TraceCheckUtils]: 96: Hoare triple {12973#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12973#false} is VALID [2018-11-23 12:29:53,094 INFO L273 TraceCheckUtils]: 97: Hoare triple {12973#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12973#false} is VALID [2018-11-23 12:29:53,094 INFO L273 TraceCheckUtils]: 98: Hoare triple {12973#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12973#false} is VALID [2018-11-23 12:29:53,094 INFO L273 TraceCheckUtils]: 99: Hoare triple {12973#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12973#false} is VALID [2018-11-23 12:29:53,094 INFO L273 TraceCheckUtils]: 100: Hoare triple {12973#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12973#false} is VALID [2018-11-23 12:29:53,095 INFO L273 TraceCheckUtils]: 101: Hoare triple {12973#false} assume !(~i~2 < 99999); {12973#false} is VALID [2018-11-23 12:29:53,095 INFO L273 TraceCheckUtils]: 102: Hoare triple {12973#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {12973#false} is VALID [2018-11-23 12:29:53,095 INFO L256 TraceCheckUtils]: 103: Hoare triple {12973#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {12972#true} is VALID [2018-11-23 12:29:53,095 INFO L273 TraceCheckUtils]: 104: Hoare triple {12972#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {12972#true} is VALID [2018-11-23 12:29:53,095 INFO L273 TraceCheckUtils]: 105: Hoare triple {12972#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12972#true} is VALID [2018-11-23 12:29:53,095 INFO L273 TraceCheckUtils]: 106: Hoare triple {12972#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12972#true} is VALID [2018-11-23 12:29:53,095 INFO L273 TraceCheckUtils]: 107: Hoare triple {12972#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12972#true} is VALID [2018-11-23 12:29:53,096 INFO L273 TraceCheckUtils]: 108: Hoare triple {12972#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12972#true} is VALID [2018-11-23 12:29:53,096 INFO L273 TraceCheckUtils]: 109: Hoare triple {12972#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12972#true} is VALID [2018-11-23 12:29:53,096 INFO L273 TraceCheckUtils]: 110: Hoare triple {12972#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12972#true} is VALID [2018-11-23 12:29:53,096 INFO L273 TraceCheckUtils]: 111: Hoare triple {12972#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12972#true} is VALID [2018-11-23 12:29:53,096 INFO L273 TraceCheckUtils]: 112: Hoare triple {12972#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12972#true} is VALID [2018-11-23 12:29:53,096 INFO L273 TraceCheckUtils]: 113: Hoare triple {12972#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12972#true} is VALID [2018-11-23 12:29:53,097 INFO L273 TraceCheckUtils]: 114: Hoare triple {12972#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12972#true} is VALID [2018-11-23 12:29:53,097 INFO L273 TraceCheckUtils]: 115: Hoare triple {12972#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12972#true} is VALID [2018-11-23 12:29:53,097 INFO L273 TraceCheckUtils]: 116: Hoare triple {12972#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12972#true} is VALID [2018-11-23 12:29:53,097 INFO L273 TraceCheckUtils]: 117: Hoare triple {12972#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12972#true} is VALID [2018-11-23 12:29:53,097 INFO L273 TraceCheckUtils]: 118: Hoare triple {12972#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12972#true} is VALID [2018-11-23 12:29:53,097 INFO L273 TraceCheckUtils]: 119: Hoare triple {12972#true} assume !(~i~0 < 100000); {12972#true} is VALID [2018-11-23 12:29:53,097 INFO L273 TraceCheckUtils]: 120: Hoare triple {12972#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {12972#true} is VALID [2018-11-23 12:29:53,098 INFO L273 TraceCheckUtils]: 121: Hoare triple {12972#true} assume true; {12972#true} is VALID [2018-11-23 12:29:53,098 INFO L268 TraceCheckUtils]: 122: Hoare quadruple {12972#true} {12973#false} #74#return; {12973#false} is VALID [2018-11-23 12:29:53,098 INFO L273 TraceCheckUtils]: 123: Hoare triple {12973#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {12973#false} is VALID [2018-11-23 12:29:53,098 INFO L273 TraceCheckUtils]: 124: Hoare triple {12973#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {12973#false} is VALID [2018-11-23 12:29:53,098 INFO L273 TraceCheckUtils]: 125: Hoare triple {12973#false} assume !false; {12973#false} is VALID [2018-11-23 12:29:53,107 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2018-11-23 12:29:53,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:29:53,107 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 12:29:53,118 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:29:53,196 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-23 12:29:53,196 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:29:53,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:53,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:29:53,413 INFO L256 TraceCheckUtils]: 0: Hoare triple {12972#true} call ULTIMATE.init(); {12972#true} is VALID [2018-11-23 12:29:53,414 INFO L273 TraceCheckUtils]: 1: Hoare triple {12972#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12972#true} is VALID [2018-11-23 12:29:53,414 INFO L273 TraceCheckUtils]: 2: Hoare triple {12972#true} assume true; {12972#true} is VALID [2018-11-23 12:29:53,414 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12972#true} {12972#true} #66#return; {12972#true} is VALID [2018-11-23 12:29:53,414 INFO L256 TraceCheckUtils]: 4: Hoare triple {12972#true} call #t~ret13 := main(); {12972#true} is VALID [2018-11-23 12:29:53,414 INFO L273 TraceCheckUtils]: 5: Hoare triple {12972#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {12972#true} is VALID [2018-11-23 12:29:53,415 INFO L273 TraceCheckUtils]: 6: Hoare triple {12972#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12972#true} is VALID [2018-11-23 12:29:53,415 INFO L273 TraceCheckUtils]: 7: Hoare triple {12972#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12972#true} is VALID [2018-11-23 12:29:53,415 INFO L273 TraceCheckUtils]: 8: Hoare triple {12972#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12972#true} is VALID [2018-11-23 12:29:53,415 INFO L273 TraceCheckUtils]: 9: Hoare triple {12972#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12972#true} is VALID [2018-11-23 12:29:53,415 INFO L273 TraceCheckUtils]: 10: Hoare triple {12972#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12972#true} is VALID [2018-11-23 12:29:53,415 INFO L273 TraceCheckUtils]: 11: Hoare triple {12972#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12972#true} is VALID [2018-11-23 12:29:53,415 INFO L273 TraceCheckUtils]: 12: Hoare triple {12972#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12972#true} is VALID [2018-11-23 12:29:53,416 INFO L273 TraceCheckUtils]: 13: Hoare triple {12972#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12972#true} is VALID [2018-11-23 12:29:53,416 INFO L273 TraceCheckUtils]: 14: Hoare triple {12972#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12972#true} is VALID [2018-11-23 12:29:53,416 INFO L273 TraceCheckUtils]: 15: Hoare triple {12972#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12972#true} is VALID [2018-11-23 12:29:53,416 INFO L273 TraceCheckUtils]: 16: Hoare triple {12972#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12972#true} is VALID [2018-11-23 12:29:53,416 INFO L273 TraceCheckUtils]: 17: Hoare triple {12972#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12972#true} is VALID [2018-11-23 12:29:53,416 INFO L273 TraceCheckUtils]: 18: Hoare triple {12972#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12972#true} is VALID [2018-11-23 12:29:53,416 INFO L273 TraceCheckUtils]: 19: Hoare triple {12972#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12972#true} is VALID [2018-11-23 12:29:53,416 INFO L273 TraceCheckUtils]: 20: Hoare triple {12972#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12972#true} is VALID [2018-11-23 12:29:53,416 INFO L273 TraceCheckUtils]: 21: Hoare triple {12972#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12972#true} is VALID [2018-11-23 12:29:53,417 INFO L273 TraceCheckUtils]: 22: Hoare triple {12972#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12972#true} is VALID [2018-11-23 12:29:53,417 INFO L273 TraceCheckUtils]: 23: Hoare triple {12972#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12972#true} is VALID [2018-11-23 12:29:53,417 INFO L273 TraceCheckUtils]: 24: Hoare triple {12972#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12972#true} is VALID [2018-11-23 12:29:53,417 INFO L273 TraceCheckUtils]: 25: Hoare triple {12972#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12972#true} is VALID [2018-11-23 12:29:53,417 INFO L273 TraceCheckUtils]: 26: Hoare triple {12972#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12972#true} is VALID [2018-11-23 12:29:53,417 INFO L273 TraceCheckUtils]: 27: Hoare triple {12972#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12972#true} is VALID [2018-11-23 12:29:53,417 INFO L273 TraceCheckUtils]: 28: Hoare triple {12972#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12972#true} is VALID [2018-11-23 12:29:53,417 INFO L273 TraceCheckUtils]: 29: Hoare triple {12972#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12972#true} is VALID [2018-11-23 12:29:53,417 INFO L273 TraceCheckUtils]: 30: Hoare triple {12972#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12972#true} is VALID [2018-11-23 12:29:53,418 INFO L273 TraceCheckUtils]: 31: Hoare triple {12972#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12972#true} is VALID [2018-11-23 12:29:53,418 INFO L273 TraceCheckUtils]: 32: Hoare triple {12972#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12972#true} is VALID [2018-11-23 12:29:53,418 INFO L273 TraceCheckUtils]: 33: Hoare triple {12972#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12972#true} is VALID [2018-11-23 12:29:53,418 INFO L273 TraceCheckUtils]: 34: Hoare triple {12972#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12972#true} is VALID [2018-11-23 12:29:53,418 INFO L273 TraceCheckUtils]: 35: Hoare triple {12972#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12972#true} is VALID [2018-11-23 12:29:53,418 INFO L273 TraceCheckUtils]: 36: Hoare triple {12972#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12972#true} is VALID [2018-11-23 12:29:53,418 INFO L273 TraceCheckUtils]: 37: Hoare triple {12972#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12972#true} is VALID [2018-11-23 12:29:53,418 INFO L273 TraceCheckUtils]: 38: Hoare triple {12972#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12972#true} is VALID [2018-11-23 12:29:53,419 INFO L273 TraceCheckUtils]: 39: Hoare triple {12972#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12972#true} is VALID [2018-11-23 12:29:53,419 INFO L273 TraceCheckUtils]: 40: Hoare triple {12972#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12972#true} is VALID [2018-11-23 12:29:53,419 INFO L273 TraceCheckUtils]: 41: Hoare triple {12972#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12972#true} is VALID [2018-11-23 12:29:53,419 INFO L273 TraceCheckUtils]: 42: Hoare triple {12972#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12972#true} is VALID [2018-11-23 12:29:53,419 INFO L273 TraceCheckUtils]: 43: Hoare triple {12972#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12972#true} is VALID [2018-11-23 12:29:53,419 INFO L273 TraceCheckUtils]: 44: Hoare triple {12972#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12972#true} is VALID [2018-11-23 12:29:53,420 INFO L273 TraceCheckUtils]: 45: Hoare triple {12972#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12972#true} is VALID [2018-11-23 12:29:53,420 INFO L273 TraceCheckUtils]: 46: Hoare triple {12972#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12972#true} is VALID [2018-11-23 12:29:53,420 INFO L273 TraceCheckUtils]: 47: Hoare triple {12972#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12972#true} is VALID [2018-11-23 12:29:53,420 INFO L273 TraceCheckUtils]: 48: Hoare triple {12972#true} assume !(~i~1 < 100000); {12972#true} is VALID [2018-11-23 12:29:53,420 INFO L256 TraceCheckUtils]: 49: Hoare triple {12972#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {12972#true} is VALID [2018-11-23 12:29:53,420 INFO L273 TraceCheckUtils]: 50: Hoare triple {12972#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {12972#true} is VALID [2018-11-23 12:29:53,420 INFO L273 TraceCheckUtils]: 51: Hoare triple {12972#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12972#true} is VALID [2018-11-23 12:29:53,421 INFO L273 TraceCheckUtils]: 52: Hoare triple {12972#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12972#true} is VALID [2018-11-23 12:29:53,421 INFO L273 TraceCheckUtils]: 53: Hoare triple {12972#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12972#true} is VALID [2018-11-23 12:29:53,421 INFO L273 TraceCheckUtils]: 54: Hoare triple {12972#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12972#true} is VALID [2018-11-23 12:29:53,421 INFO L273 TraceCheckUtils]: 55: Hoare triple {12972#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12972#true} is VALID [2018-11-23 12:29:53,421 INFO L273 TraceCheckUtils]: 56: Hoare triple {12972#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12972#true} is VALID [2018-11-23 12:29:53,421 INFO L273 TraceCheckUtils]: 57: Hoare triple {12972#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12972#true} is VALID [2018-11-23 12:29:53,421 INFO L273 TraceCheckUtils]: 58: Hoare triple {12972#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12972#true} is VALID [2018-11-23 12:29:53,422 INFO L273 TraceCheckUtils]: 59: Hoare triple {12972#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12972#true} is VALID [2018-11-23 12:29:53,422 INFO L273 TraceCheckUtils]: 60: Hoare triple {12972#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12972#true} is VALID [2018-11-23 12:29:53,422 INFO L273 TraceCheckUtils]: 61: Hoare triple {12972#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12972#true} is VALID [2018-11-23 12:29:53,422 INFO L273 TraceCheckUtils]: 62: Hoare triple {12972#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12972#true} is VALID [2018-11-23 12:29:53,422 INFO L273 TraceCheckUtils]: 63: Hoare triple {12972#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12972#true} is VALID [2018-11-23 12:29:53,422 INFO L273 TraceCheckUtils]: 64: Hoare triple {12972#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12972#true} is VALID [2018-11-23 12:29:53,422 INFO L273 TraceCheckUtils]: 65: Hoare triple {12972#true} assume !(~i~0 < 100000); {12972#true} is VALID [2018-11-23 12:29:53,422 INFO L273 TraceCheckUtils]: 66: Hoare triple {12972#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {12972#true} is VALID [2018-11-23 12:29:53,422 INFO L273 TraceCheckUtils]: 67: Hoare triple {12972#true} assume true; {12972#true} is VALID [2018-11-23 12:29:53,422 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {12972#true} {12972#true} #70#return; {12972#true} is VALID [2018-11-23 12:29:53,423 INFO L273 TraceCheckUtils]: 69: Hoare triple {12972#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {12972#true} is VALID [2018-11-23 12:29:53,423 INFO L256 TraceCheckUtils]: 70: Hoare triple {12972#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {12972#true} is VALID [2018-11-23 12:29:53,423 INFO L273 TraceCheckUtils]: 71: Hoare triple {12972#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {12972#true} is VALID [2018-11-23 12:29:53,423 INFO L273 TraceCheckUtils]: 72: Hoare triple {12972#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12972#true} is VALID [2018-11-23 12:29:53,423 INFO L273 TraceCheckUtils]: 73: Hoare triple {12972#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12972#true} is VALID [2018-11-23 12:29:53,423 INFO L273 TraceCheckUtils]: 74: Hoare triple {12972#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12972#true} is VALID [2018-11-23 12:29:53,423 INFO L273 TraceCheckUtils]: 75: Hoare triple {12972#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12972#true} is VALID [2018-11-23 12:29:53,423 INFO L273 TraceCheckUtils]: 76: Hoare triple {12972#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12972#true} is VALID [2018-11-23 12:29:53,423 INFO L273 TraceCheckUtils]: 77: Hoare triple {12972#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12972#true} is VALID [2018-11-23 12:29:53,424 INFO L273 TraceCheckUtils]: 78: Hoare triple {12972#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12972#true} is VALID [2018-11-23 12:29:53,424 INFO L273 TraceCheckUtils]: 79: Hoare triple {12972#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12972#true} is VALID [2018-11-23 12:29:53,424 INFO L273 TraceCheckUtils]: 80: Hoare triple {12972#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12972#true} is VALID [2018-11-23 12:29:53,424 INFO L273 TraceCheckUtils]: 81: Hoare triple {12972#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12972#true} is VALID [2018-11-23 12:29:53,424 INFO L273 TraceCheckUtils]: 82: Hoare triple {12972#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12972#true} is VALID [2018-11-23 12:29:53,424 INFO L273 TraceCheckUtils]: 83: Hoare triple {12972#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12972#true} is VALID [2018-11-23 12:29:53,424 INFO L273 TraceCheckUtils]: 84: Hoare triple {12972#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12972#true} is VALID [2018-11-23 12:29:53,424 INFO L273 TraceCheckUtils]: 85: Hoare triple {12972#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12972#true} is VALID [2018-11-23 12:29:53,424 INFO L273 TraceCheckUtils]: 86: Hoare triple {12972#true} assume !(~i~0 < 100000); {12972#true} is VALID [2018-11-23 12:29:53,424 INFO L273 TraceCheckUtils]: 87: Hoare triple {12972#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {12972#true} is VALID [2018-11-23 12:29:53,425 INFO L273 TraceCheckUtils]: 88: Hoare triple {12972#true} assume true; {12972#true} is VALID [2018-11-23 12:29:53,425 INFO L268 TraceCheckUtils]: 89: Hoare quadruple {12972#true} {12972#true} #72#return; {12972#true} is VALID [2018-11-23 12:29:53,425 INFO L273 TraceCheckUtils]: 90: Hoare triple {12972#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {13269#(<= main_~i~2 0)} is VALID [2018-11-23 12:29:53,426 INFO L273 TraceCheckUtils]: 91: Hoare triple {13269#(<= main_~i~2 0)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13269#(<= main_~i~2 0)} is VALID [2018-11-23 12:29:53,426 INFO L273 TraceCheckUtils]: 92: Hoare triple {13269#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13276#(<= main_~i~2 1)} is VALID [2018-11-23 12:29:53,427 INFO L273 TraceCheckUtils]: 93: Hoare triple {13276#(<= main_~i~2 1)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13276#(<= main_~i~2 1)} is VALID [2018-11-23 12:29:53,427 INFO L273 TraceCheckUtils]: 94: Hoare triple {13276#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13283#(<= main_~i~2 2)} is VALID [2018-11-23 12:29:53,427 INFO L273 TraceCheckUtils]: 95: Hoare triple {13283#(<= main_~i~2 2)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13283#(<= main_~i~2 2)} is VALID [2018-11-23 12:29:53,428 INFO L273 TraceCheckUtils]: 96: Hoare triple {13283#(<= main_~i~2 2)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13290#(<= main_~i~2 3)} is VALID [2018-11-23 12:29:53,428 INFO L273 TraceCheckUtils]: 97: Hoare triple {13290#(<= main_~i~2 3)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13290#(<= main_~i~2 3)} is VALID [2018-11-23 12:29:53,429 INFO L273 TraceCheckUtils]: 98: Hoare triple {13290#(<= main_~i~2 3)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13297#(<= main_~i~2 4)} is VALID [2018-11-23 12:29:53,429 INFO L273 TraceCheckUtils]: 99: Hoare triple {13297#(<= main_~i~2 4)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13297#(<= main_~i~2 4)} is VALID [2018-11-23 12:29:53,430 INFO L273 TraceCheckUtils]: 100: Hoare triple {13297#(<= main_~i~2 4)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13304#(<= main_~i~2 5)} is VALID [2018-11-23 12:29:53,431 INFO L273 TraceCheckUtils]: 101: Hoare triple {13304#(<= main_~i~2 5)} assume !(~i~2 < 99999); {12973#false} is VALID [2018-11-23 12:29:53,431 INFO L273 TraceCheckUtils]: 102: Hoare triple {12973#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {12973#false} is VALID [2018-11-23 12:29:53,431 INFO L256 TraceCheckUtils]: 103: Hoare triple {12973#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {12973#false} is VALID [2018-11-23 12:29:53,431 INFO L273 TraceCheckUtils]: 104: Hoare triple {12973#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {12973#false} is VALID [2018-11-23 12:29:53,431 INFO L273 TraceCheckUtils]: 105: Hoare triple {12973#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12973#false} is VALID [2018-11-23 12:29:53,432 INFO L273 TraceCheckUtils]: 106: Hoare triple {12973#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12973#false} is VALID [2018-11-23 12:29:53,432 INFO L273 TraceCheckUtils]: 107: Hoare triple {12973#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12973#false} is VALID [2018-11-23 12:29:53,432 INFO L273 TraceCheckUtils]: 108: Hoare triple {12973#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12973#false} is VALID [2018-11-23 12:29:53,432 INFO L273 TraceCheckUtils]: 109: Hoare triple {12973#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12973#false} is VALID [2018-11-23 12:29:53,432 INFO L273 TraceCheckUtils]: 110: Hoare triple {12973#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12973#false} is VALID [2018-11-23 12:29:53,432 INFO L273 TraceCheckUtils]: 111: Hoare triple {12973#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12973#false} is VALID [2018-11-23 12:29:53,433 INFO L273 TraceCheckUtils]: 112: Hoare triple {12973#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12973#false} is VALID [2018-11-23 12:29:53,433 INFO L273 TraceCheckUtils]: 113: Hoare triple {12973#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12973#false} is VALID [2018-11-23 12:29:53,433 INFO L273 TraceCheckUtils]: 114: Hoare triple {12973#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12973#false} is VALID [2018-11-23 12:29:53,433 INFO L273 TraceCheckUtils]: 115: Hoare triple {12973#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12973#false} is VALID [2018-11-23 12:29:53,433 INFO L273 TraceCheckUtils]: 116: Hoare triple {12973#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12973#false} is VALID [2018-11-23 12:29:53,433 INFO L273 TraceCheckUtils]: 117: Hoare triple {12973#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12973#false} is VALID [2018-11-23 12:29:53,433 INFO L273 TraceCheckUtils]: 118: Hoare triple {12973#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12973#false} is VALID [2018-11-23 12:29:53,434 INFO L273 TraceCheckUtils]: 119: Hoare triple {12973#false} assume !(~i~0 < 100000); {12973#false} is VALID [2018-11-23 12:29:53,434 INFO L273 TraceCheckUtils]: 120: Hoare triple {12973#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {12973#false} is VALID [2018-11-23 12:29:53,434 INFO L273 TraceCheckUtils]: 121: Hoare triple {12973#false} assume true; {12973#false} is VALID [2018-11-23 12:29:53,434 INFO L268 TraceCheckUtils]: 122: Hoare quadruple {12973#false} {12973#false} #74#return; {12973#false} is VALID [2018-11-23 12:29:53,434 INFO L273 TraceCheckUtils]: 123: Hoare triple {12973#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {12973#false} is VALID [2018-11-23 12:29:53,434 INFO L273 TraceCheckUtils]: 124: Hoare triple {12973#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {12973#false} is VALID [2018-11-23 12:29:53,434 INFO L273 TraceCheckUtils]: 125: Hoare triple {12973#false} assume !false; {12973#false} is VALID [2018-11-23 12:29:53,440 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 234 proven. 25 refuted. 0 times theorem prover too weak. 705 trivial. 0 not checked. [2018-11-23 12:29:53,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:29:53,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 8] total 30 [2018-11-23 12:29:53,460 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 126 [2018-11-23 12:29:53,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:29:53,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 12:29:53,577 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:29:53,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 12:29:53,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 12:29:53,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=567, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:29:53,579 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 30 states. [2018-11-23 12:29:54,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:54,030 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2018-11-23 12:29:54,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 12:29:54,030 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 126 [2018-11-23 12:29:54,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:54,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:29:54,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 109 transitions. [2018-11-23 12:29:54,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:29:54,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 109 transitions. [2018-11-23 12:29:54,033 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 109 transitions. [2018-11-23 12:29:54,142 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:29:54,143 INFO L225 Difference]: With dead ends: 135 [2018-11-23 12:29:54,144 INFO L226 Difference]: Without dead ends: 95 [2018-11-23 12:29:54,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=303, Invalid=567, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:29:54,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-23 12:29:54,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2018-11-23 12:29:54,190 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:54,190 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 93 states. [2018-11-23 12:29:54,190 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 93 states. [2018-11-23 12:29:54,190 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 93 states. [2018-11-23 12:29:54,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:54,192 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2018-11-23 12:29:54,192 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-11-23 12:29:54,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:54,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:54,193 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 95 states. [2018-11-23 12:29:54,193 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 95 states. [2018-11-23 12:29:54,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:54,194 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2018-11-23 12:29:54,194 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-11-23 12:29:54,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:54,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:54,195 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:54,195 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:54,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-23 12:29:54,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2018-11-23 12:29:54,196 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 126 [2018-11-23 12:29:54,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:54,196 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2018-11-23 12:29:54,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 12:29:54,196 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2018-11-23 12:29:54,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-23 12:29:54,197 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:54,197 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:29:54,198 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:54,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:54,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1306006595, now seen corresponding path program 22 times [2018-11-23 12:29:54,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:54,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:54,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:54,199 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:29:54,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:54,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:54,758 INFO L256 TraceCheckUtils]: 0: Hoare triple {13907#true} call ULTIMATE.init(); {13907#true} is VALID [2018-11-23 12:29:54,759 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 12:29:54,759 INFO L273 TraceCheckUtils]: 2: Hoare triple {13907#true} assume true; {13907#true} is VALID [2018-11-23 12:29:54,759 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13907#true} {13907#true} #66#return; {13907#true} is VALID [2018-11-23 12:29:54,759 INFO L256 TraceCheckUtils]: 4: Hoare triple {13907#true} call #t~ret13 := main(); {13907#true} is VALID [2018-11-23 12:29:54,760 INFO L273 TraceCheckUtils]: 5: Hoare triple {13907#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {13909#(= main_~i~1 0)} is VALID [2018-11-23 12:29:54,760 INFO L273 TraceCheckUtils]: 6: Hoare triple {13909#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13909#(= main_~i~1 0)} is VALID [2018-11-23 12:29:54,761 INFO L273 TraceCheckUtils]: 7: Hoare triple {13909#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13910#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:54,762 INFO L273 TraceCheckUtils]: 8: Hoare triple {13910#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13910#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:54,762 INFO L273 TraceCheckUtils]: 9: Hoare triple {13910#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13911#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:54,762 INFO L273 TraceCheckUtils]: 10: Hoare triple {13911#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13911#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:54,763 INFO L273 TraceCheckUtils]: 11: Hoare triple {13911#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13912#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:54,763 INFO L273 TraceCheckUtils]: 12: Hoare triple {13912#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13912#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:54,764 INFO L273 TraceCheckUtils]: 13: Hoare triple {13912#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13913#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:54,764 INFO L273 TraceCheckUtils]: 14: Hoare triple {13913#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13913#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:54,765 INFO L273 TraceCheckUtils]: 15: Hoare triple {13913#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13914#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:54,765 INFO L273 TraceCheckUtils]: 16: Hoare triple {13914#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13914#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:54,766 INFO L273 TraceCheckUtils]: 17: Hoare triple {13914#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13915#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:54,767 INFO L273 TraceCheckUtils]: 18: Hoare triple {13915#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13915#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:54,767 INFO L273 TraceCheckUtils]: 19: Hoare triple {13915#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13916#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:54,768 INFO L273 TraceCheckUtils]: 20: Hoare triple {13916#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13916#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:54,769 INFO L273 TraceCheckUtils]: 21: Hoare triple {13916#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13917#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:54,769 INFO L273 TraceCheckUtils]: 22: Hoare triple {13917#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13917#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:54,770 INFO L273 TraceCheckUtils]: 23: Hoare triple {13917#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13918#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:54,770 INFO L273 TraceCheckUtils]: 24: Hoare triple {13918#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13918#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:54,771 INFO L273 TraceCheckUtils]: 25: Hoare triple {13918#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13919#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:54,772 INFO L273 TraceCheckUtils]: 26: Hoare triple {13919#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13919#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:54,772 INFO L273 TraceCheckUtils]: 27: Hoare triple {13919#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13920#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:54,773 INFO L273 TraceCheckUtils]: 28: Hoare triple {13920#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13920#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:54,774 INFO L273 TraceCheckUtils]: 29: Hoare triple {13920#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13921#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:54,774 INFO L273 TraceCheckUtils]: 30: Hoare triple {13921#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13921#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:54,775 INFO L273 TraceCheckUtils]: 31: Hoare triple {13921#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13922#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:54,782 INFO L273 TraceCheckUtils]: 32: Hoare triple {13922#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13922#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:54,783 INFO L273 TraceCheckUtils]: 33: Hoare triple {13922#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13923#(<= main_~i~1 14)} is VALID [2018-11-23 12:29:54,783 INFO L273 TraceCheckUtils]: 34: Hoare triple {13923#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13923#(<= main_~i~1 14)} is VALID [2018-11-23 12:29:54,783 INFO L273 TraceCheckUtils]: 35: Hoare triple {13923#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13924#(<= main_~i~1 15)} is VALID [2018-11-23 12:29:54,784 INFO L273 TraceCheckUtils]: 36: Hoare triple {13924#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13924#(<= main_~i~1 15)} is VALID [2018-11-23 12:29:54,784 INFO L273 TraceCheckUtils]: 37: Hoare triple {13924#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13925#(<= main_~i~1 16)} is VALID [2018-11-23 12:29:54,784 INFO L273 TraceCheckUtils]: 38: Hoare triple {13925#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13925#(<= main_~i~1 16)} is VALID [2018-11-23 12:29:54,785 INFO L273 TraceCheckUtils]: 39: Hoare triple {13925#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13926#(<= main_~i~1 17)} is VALID [2018-11-23 12:29:54,785 INFO L273 TraceCheckUtils]: 40: Hoare triple {13926#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13926#(<= main_~i~1 17)} is VALID [2018-11-23 12:29:54,786 INFO L273 TraceCheckUtils]: 41: Hoare triple {13926#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13927#(<= main_~i~1 18)} is VALID [2018-11-23 12:29:54,786 INFO L273 TraceCheckUtils]: 42: Hoare triple {13927#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13927#(<= main_~i~1 18)} is VALID [2018-11-23 12:29:54,787 INFO L273 TraceCheckUtils]: 43: Hoare triple {13927#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13928#(<= main_~i~1 19)} is VALID [2018-11-23 12:29:54,787 INFO L273 TraceCheckUtils]: 44: Hoare triple {13928#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13928#(<= main_~i~1 19)} is VALID [2018-11-23 12:29:54,788 INFO L273 TraceCheckUtils]: 45: Hoare triple {13928#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13929#(<= main_~i~1 20)} is VALID [2018-11-23 12:29:54,789 INFO L273 TraceCheckUtils]: 46: Hoare triple {13929#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13929#(<= main_~i~1 20)} is VALID [2018-11-23 12:29:54,789 INFO L273 TraceCheckUtils]: 47: Hoare triple {13929#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13930#(<= main_~i~1 21)} is VALID [2018-11-23 12:29:54,790 INFO L273 TraceCheckUtils]: 48: Hoare triple {13930#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13930#(<= main_~i~1 21)} is VALID [2018-11-23 12:29:54,791 INFO L273 TraceCheckUtils]: 49: Hoare triple {13930#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13931#(<= main_~i~1 22)} is VALID [2018-11-23 12:29:54,791 INFO L273 TraceCheckUtils]: 50: Hoare triple {13931#(<= main_~i~1 22)} assume !(~i~1 < 100000); {13908#false} is VALID [2018-11-23 12:29:54,791 INFO L256 TraceCheckUtils]: 51: Hoare triple {13908#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {13907#true} is VALID [2018-11-23 12:29:54,792 INFO L273 TraceCheckUtils]: 52: Hoare triple {13907#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {13907#true} is VALID [2018-11-23 12:29:54,792 INFO L273 TraceCheckUtils]: 53: Hoare triple {13907#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13907#true} is VALID [2018-11-23 12:29:54,792 INFO L273 TraceCheckUtils]: 54: Hoare triple {13907#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13907#true} is VALID [2018-11-23 12:29:54,792 INFO L273 TraceCheckUtils]: 55: Hoare triple {13907#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13907#true} is VALID [2018-11-23 12:29:54,792 INFO L273 TraceCheckUtils]: 56: Hoare triple {13907#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13907#true} is VALID [2018-11-23 12:29:54,793 INFO L273 TraceCheckUtils]: 57: Hoare triple {13907#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13907#true} is VALID [2018-11-23 12:29:54,793 INFO L273 TraceCheckUtils]: 58: Hoare triple {13907#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13907#true} is VALID [2018-11-23 12:29:54,793 INFO L273 TraceCheckUtils]: 59: Hoare triple {13907#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13907#true} is VALID [2018-11-23 12:29:54,793 INFO L273 TraceCheckUtils]: 60: Hoare triple {13907#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13907#true} is VALID [2018-11-23 12:29:54,793 INFO L273 TraceCheckUtils]: 61: Hoare triple {13907#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13907#true} is VALID [2018-11-23 12:29:54,794 INFO L273 TraceCheckUtils]: 62: Hoare triple {13907#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13907#true} is VALID [2018-11-23 12:29:54,794 INFO L273 TraceCheckUtils]: 63: Hoare triple {13907#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13907#true} is VALID [2018-11-23 12:29:54,794 INFO L273 TraceCheckUtils]: 64: Hoare triple {13907#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13907#true} is VALID [2018-11-23 12:29:54,794 INFO L273 TraceCheckUtils]: 65: Hoare triple {13907#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13907#true} is VALID [2018-11-23 12:29:54,794 INFO L273 TraceCheckUtils]: 66: Hoare triple {13907#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13907#true} is VALID [2018-11-23 12:29:54,794 INFO L273 TraceCheckUtils]: 67: Hoare triple {13907#true} assume !(~i~0 < 100000); {13907#true} is VALID [2018-11-23 12:29:54,794 INFO L273 TraceCheckUtils]: 68: Hoare triple {13907#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {13907#true} is VALID [2018-11-23 12:29:54,795 INFO L273 TraceCheckUtils]: 69: Hoare triple {13907#true} assume true; {13907#true} is VALID [2018-11-23 12:29:54,795 INFO L268 TraceCheckUtils]: 70: Hoare quadruple {13907#true} {13908#false} #70#return; {13908#false} is VALID [2018-11-23 12:29:54,795 INFO L273 TraceCheckUtils]: 71: Hoare triple {13908#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {13908#false} is VALID [2018-11-23 12:29:54,795 INFO L256 TraceCheckUtils]: 72: Hoare triple {13908#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {13907#true} is VALID [2018-11-23 12:29:54,795 INFO L273 TraceCheckUtils]: 73: Hoare triple {13907#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {13907#true} is VALID [2018-11-23 12:29:54,795 INFO L273 TraceCheckUtils]: 74: Hoare triple {13907#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13907#true} is VALID [2018-11-23 12:29:54,795 INFO L273 TraceCheckUtils]: 75: Hoare triple {13907#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13907#true} is VALID [2018-11-23 12:29:54,795 INFO L273 TraceCheckUtils]: 76: Hoare triple {13907#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13907#true} is VALID [2018-11-23 12:29:54,795 INFO L273 TraceCheckUtils]: 77: Hoare triple {13907#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13907#true} is VALID [2018-11-23 12:29:54,796 INFO L273 TraceCheckUtils]: 78: Hoare triple {13907#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13907#true} is VALID [2018-11-23 12:29:54,796 INFO L273 TraceCheckUtils]: 79: Hoare triple {13907#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13907#true} is VALID [2018-11-23 12:29:54,796 INFO L273 TraceCheckUtils]: 80: Hoare triple {13907#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13907#true} is VALID [2018-11-23 12:29:54,796 INFO L273 TraceCheckUtils]: 81: Hoare triple {13907#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13907#true} is VALID [2018-11-23 12:29:54,796 INFO L273 TraceCheckUtils]: 82: Hoare triple {13907#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13907#true} is VALID [2018-11-23 12:29:54,796 INFO L273 TraceCheckUtils]: 83: Hoare triple {13907#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13907#true} is VALID [2018-11-23 12:29:54,796 INFO L273 TraceCheckUtils]: 84: Hoare triple {13907#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13907#true} is VALID [2018-11-23 12:29:54,796 INFO L273 TraceCheckUtils]: 85: Hoare triple {13907#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13907#true} is VALID [2018-11-23 12:29:54,796 INFO L273 TraceCheckUtils]: 86: Hoare triple {13907#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13907#true} is VALID [2018-11-23 12:29:54,797 INFO L273 TraceCheckUtils]: 87: Hoare triple {13907#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13907#true} is VALID [2018-11-23 12:29:54,797 INFO L273 TraceCheckUtils]: 88: Hoare triple {13907#true} assume !(~i~0 < 100000); {13907#true} is VALID [2018-11-23 12:29:54,797 INFO L273 TraceCheckUtils]: 89: Hoare triple {13907#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {13907#true} is VALID [2018-11-23 12:29:54,797 INFO L273 TraceCheckUtils]: 90: Hoare triple {13907#true} assume true; {13907#true} is VALID [2018-11-23 12:29:54,797 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {13907#true} {13908#false} #72#return; {13908#false} is VALID [2018-11-23 12:29:54,797 INFO L273 TraceCheckUtils]: 92: Hoare triple {13908#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {13908#false} is VALID [2018-11-23 12:29:54,797 INFO L273 TraceCheckUtils]: 93: Hoare triple {13908#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13908#false} is VALID [2018-11-23 12:29:54,797 INFO L273 TraceCheckUtils]: 94: Hoare triple {13908#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13908#false} is VALID [2018-11-23 12:29:54,797 INFO L273 TraceCheckUtils]: 95: Hoare triple {13908#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13908#false} is VALID [2018-11-23 12:29:54,797 INFO L273 TraceCheckUtils]: 96: Hoare triple {13908#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13908#false} is VALID [2018-11-23 12:29:54,798 INFO L273 TraceCheckUtils]: 97: Hoare triple {13908#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13908#false} is VALID [2018-11-23 12:29:54,798 INFO L273 TraceCheckUtils]: 98: Hoare triple {13908#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13908#false} is VALID [2018-11-23 12:29:54,798 INFO L273 TraceCheckUtils]: 99: Hoare triple {13908#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13908#false} is VALID [2018-11-23 12:29:54,798 INFO L273 TraceCheckUtils]: 100: Hoare triple {13908#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13908#false} is VALID [2018-11-23 12:29:54,798 INFO L273 TraceCheckUtils]: 101: Hoare triple {13908#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13908#false} is VALID [2018-11-23 12:29:54,798 INFO L273 TraceCheckUtils]: 102: Hoare triple {13908#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13908#false} is VALID [2018-11-23 12:29:54,798 INFO L273 TraceCheckUtils]: 103: Hoare triple {13908#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13908#false} is VALID [2018-11-23 12:29:54,798 INFO L273 TraceCheckUtils]: 104: Hoare triple {13908#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13908#false} is VALID [2018-11-23 12:29:54,798 INFO L273 TraceCheckUtils]: 105: Hoare triple {13908#false} assume !(~i~2 < 99999); {13908#false} is VALID [2018-11-23 12:29:54,799 INFO L273 TraceCheckUtils]: 106: Hoare triple {13908#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {13908#false} is VALID [2018-11-23 12:29:54,799 INFO L256 TraceCheckUtils]: 107: Hoare triple {13908#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {13907#true} is VALID [2018-11-23 12:29:54,799 INFO L273 TraceCheckUtils]: 108: Hoare triple {13907#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {13907#true} is VALID [2018-11-23 12:29:54,799 INFO L273 TraceCheckUtils]: 109: Hoare triple {13907#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13907#true} is VALID [2018-11-23 12:29:54,799 INFO L273 TraceCheckUtils]: 110: Hoare triple {13907#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13907#true} is VALID [2018-11-23 12:29:54,799 INFO L273 TraceCheckUtils]: 111: Hoare triple {13907#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13907#true} is VALID [2018-11-23 12:29:54,799 INFO L273 TraceCheckUtils]: 112: Hoare triple {13907#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13907#true} is VALID [2018-11-23 12:29:54,799 INFO L273 TraceCheckUtils]: 113: Hoare triple {13907#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13907#true} is VALID [2018-11-23 12:29:54,799 INFO L273 TraceCheckUtils]: 114: Hoare triple {13907#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13907#true} is VALID [2018-11-23 12:29:54,800 INFO L273 TraceCheckUtils]: 115: Hoare triple {13907#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13907#true} is VALID [2018-11-23 12:29:54,800 INFO L273 TraceCheckUtils]: 116: Hoare triple {13907#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13907#true} is VALID [2018-11-23 12:29:54,800 INFO L273 TraceCheckUtils]: 117: Hoare triple {13907#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13907#true} is VALID [2018-11-23 12:29:54,800 INFO L273 TraceCheckUtils]: 118: Hoare triple {13907#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13907#true} is VALID [2018-11-23 12:29:54,800 INFO L273 TraceCheckUtils]: 119: Hoare triple {13907#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13907#true} is VALID [2018-11-23 12:29:54,800 INFO L273 TraceCheckUtils]: 120: Hoare triple {13907#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13907#true} is VALID [2018-11-23 12:29:54,800 INFO L273 TraceCheckUtils]: 121: Hoare triple {13907#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13907#true} is VALID [2018-11-23 12:29:54,800 INFO L273 TraceCheckUtils]: 122: Hoare triple {13907#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13907#true} is VALID [2018-11-23 12:29:54,800 INFO L273 TraceCheckUtils]: 123: Hoare triple {13907#true} assume !(~i~0 < 100000); {13907#true} is VALID [2018-11-23 12:29:54,800 INFO L273 TraceCheckUtils]: 124: Hoare triple {13907#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {13907#true} is VALID [2018-11-23 12:29:54,801 INFO L273 TraceCheckUtils]: 125: Hoare triple {13907#true} assume true; {13907#true} is VALID [2018-11-23 12:29:54,801 INFO L268 TraceCheckUtils]: 126: Hoare quadruple {13907#true} {13908#false} #74#return; {13908#false} is VALID [2018-11-23 12:29:54,801 INFO L273 TraceCheckUtils]: 127: Hoare triple {13908#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {13908#false} is VALID [2018-11-23 12:29:54,801 INFO L273 TraceCheckUtils]: 128: Hoare triple {13908#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {13908#false} is VALID [2018-11-23 12:29:54,801 INFO L273 TraceCheckUtils]: 129: Hoare triple {13908#false} assume !false; {13908#false} is VALID [2018-11-23 12:29:54,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2018-11-23 12:29:54,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:29:54,809 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 12:29:54,818 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:29:54,878 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:29:54,878 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:29:54,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:54,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:29:55,155 INFO L256 TraceCheckUtils]: 0: Hoare triple {13907#true} call ULTIMATE.init(); {13907#true} is VALID [2018-11-23 12:29:55,155 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 12:29:55,155 INFO L273 TraceCheckUtils]: 2: Hoare triple {13907#true} assume true; {13907#true} is VALID [2018-11-23 12:29:55,156 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13907#true} {13907#true} #66#return; {13907#true} is VALID [2018-11-23 12:29:55,156 INFO L256 TraceCheckUtils]: 4: Hoare triple {13907#true} call #t~ret13 := main(); {13907#true} is VALID [2018-11-23 12:29:55,156 INFO L273 TraceCheckUtils]: 5: Hoare triple {13907#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {13950#(<= main_~i~1 0)} is VALID [2018-11-23 12:29:55,157 INFO L273 TraceCheckUtils]: 6: Hoare triple {13950#(<= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13950#(<= main_~i~1 0)} is VALID [2018-11-23 12:29:55,157 INFO L273 TraceCheckUtils]: 7: Hoare triple {13950#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13910#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:55,158 INFO L273 TraceCheckUtils]: 8: Hoare triple {13910#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13910#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:55,158 INFO L273 TraceCheckUtils]: 9: Hoare triple {13910#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13911#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:55,158 INFO L273 TraceCheckUtils]: 10: Hoare triple {13911#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13911#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:55,159 INFO L273 TraceCheckUtils]: 11: Hoare triple {13911#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13912#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:55,160 INFO L273 TraceCheckUtils]: 12: Hoare triple {13912#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13912#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:55,160 INFO L273 TraceCheckUtils]: 13: Hoare triple {13912#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13913#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:55,161 INFO L273 TraceCheckUtils]: 14: Hoare triple {13913#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13913#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:55,162 INFO L273 TraceCheckUtils]: 15: Hoare triple {13913#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13914#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:55,162 INFO L273 TraceCheckUtils]: 16: Hoare triple {13914#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13914#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:55,163 INFO L273 TraceCheckUtils]: 17: Hoare triple {13914#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13915#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:55,164 INFO L273 TraceCheckUtils]: 18: Hoare triple {13915#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13915#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:55,164 INFO L273 TraceCheckUtils]: 19: Hoare triple {13915#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13916#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:55,165 INFO L273 TraceCheckUtils]: 20: Hoare triple {13916#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13916#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:55,166 INFO L273 TraceCheckUtils]: 21: Hoare triple {13916#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13917#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:55,166 INFO L273 TraceCheckUtils]: 22: Hoare triple {13917#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13917#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:55,167 INFO L273 TraceCheckUtils]: 23: Hoare triple {13917#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13918#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:55,167 INFO L273 TraceCheckUtils]: 24: Hoare triple {13918#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13918#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:55,168 INFO L273 TraceCheckUtils]: 25: Hoare triple {13918#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13919#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:55,169 INFO L273 TraceCheckUtils]: 26: Hoare triple {13919#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13919#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:55,169 INFO L273 TraceCheckUtils]: 27: Hoare triple {13919#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13920#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:55,170 INFO L273 TraceCheckUtils]: 28: Hoare triple {13920#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13920#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:55,171 INFO L273 TraceCheckUtils]: 29: Hoare triple {13920#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13921#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:55,171 INFO L273 TraceCheckUtils]: 30: Hoare triple {13921#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13921#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:55,172 INFO L273 TraceCheckUtils]: 31: Hoare triple {13921#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13922#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:55,172 INFO L273 TraceCheckUtils]: 32: Hoare triple {13922#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13922#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:55,173 INFO L273 TraceCheckUtils]: 33: Hoare triple {13922#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13923#(<= main_~i~1 14)} is VALID [2018-11-23 12:29:55,174 INFO L273 TraceCheckUtils]: 34: Hoare triple {13923#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13923#(<= main_~i~1 14)} is VALID [2018-11-23 12:29:55,174 INFO L273 TraceCheckUtils]: 35: Hoare triple {13923#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13924#(<= main_~i~1 15)} is VALID [2018-11-23 12:29:55,175 INFO L273 TraceCheckUtils]: 36: Hoare triple {13924#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13924#(<= main_~i~1 15)} is VALID [2018-11-23 12:29:55,176 INFO L273 TraceCheckUtils]: 37: Hoare triple {13924#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13925#(<= main_~i~1 16)} is VALID [2018-11-23 12:29:55,176 INFO L273 TraceCheckUtils]: 38: Hoare triple {13925#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13925#(<= main_~i~1 16)} is VALID [2018-11-23 12:29:55,177 INFO L273 TraceCheckUtils]: 39: Hoare triple {13925#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13926#(<= main_~i~1 17)} is VALID [2018-11-23 12:29:55,177 INFO L273 TraceCheckUtils]: 40: Hoare triple {13926#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13926#(<= main_~i~1 17)} is VALID [2018-11-23 12:29:55,178 INFO L273 TraceCheckUtils]: 41: Hoare triple {13926#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13927#(<= main_~i~1 18)} is VALID [2018-11-23 12:29:55,179 INFO L273 TraceCheckUtils]: 42: Hoare triple {13927#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13927#(<= main_~i~1 18)} is VALID [2018-11-23 12:29:55,179 INFO L273 TraceCheckUtils]: 43: Hoare triple {13927#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13928#(<= main_~i~1 19)} is VALID [2018-11-23 12:29:55,180 INFO L273 TraceCheckUtils]: 44: Hoare triple {13928#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13928#(<= main_~i~1 19)} is VALID [2018-11-23 12:29:55,181 INFO L273 TraceCheckUtils]: 45: Hoare triple {13928#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13929#(<= main_~i~1 20)} is VALID [2018-11-23 12:29:55,181 INFO L273 TraceCheckUtils]: 46: Hoare triple {13929#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13929#(<= main_~i~1 20)} is VALID [2018-11-23 12:29:55,182 INFO L273 TraceCheckUtils]: 47: Hoare triple {13929#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13930#(<= main_~i~1 21)} is VALID [2018-11-23 12:29:55,182 INFO L273 TraceCheckUtils]: 48: Hoare triple {13930#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13930#(<= main_~i~1 21)} is VALID [2018-11-23 12:29:55,183 INFO L273 TraceCheckUtils]: 49: Hoare triple {13930#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13931#(<= main_~i~1 22)} is VALID [2018-11-23 12:29:55,184 INFO L273 TraceCheckUtils]: 50: Hoare triple {13931#(<= main_~i~1 22)} assume !(~i~1 < 100000); {13908#false} is VALID [2018-11-23 12:29:55,184 INFO L256 TraceCheckUtils]: 51: Hoare triple {13908#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {13908#false} is VALID [2018-11-23 12:29:55,184 INFO L273 TraceCheckUtils]: 52: Hoare triple {13908#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {13908#false} is VALID [2018-11-23 12:29:55,184 INFO L273 TraceCheckUtils]: 53: Hoare triple {13908#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13908#false} is VALID [2018-11-23 12:29:55,185 INFO L273 TraceCheckUtils]: 54: Hoare triple {13908#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13908#false} is VALID [2018-11-23 12:29:55,185 INFO L273 TraceCheckUtils]: 55: Hoare triple {13908#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13908#false} is VALID [2018-11-23 12:29:55,185 INFO L273 TraceCheckUtils]: 56: Hoare triple {13908#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13908#false} is VALID [2018-11-23 12:29:55,185 INFO L273 TraceCheckUtils]: 57: Hoare triple {13908#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13908#false} is VALID [2018-11-23 12:29:55,185 INFO L273 TraceCheckUtils]: 58: Hoare triple {13908#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13908#false} is VALID [2018-11-23 12:29:55,185 INFO L273 TraceCheckUtils]: 59: Hoare triple {13908#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13908#false} is VALID [2018-11-23 12:29:55,186 INFO L273 TraceCheckUtils]: 60: Hoare triple {13908#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13908#false} is VALID [2018-11-23 12:29:55,186 INFO L273 TraceCheckUtils]: 61: Hoare triple {13908#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13908#false} is VALID [2018-11-23 12:29:55,186 INFO L273 TraceCheckUtils]: 62: Hoare triple {13908#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13908#false} is VALID [2018-11-23 12:29:55,186 INFO L273 TraceCheckUtils]: 63: Hoare triple {13908#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13908#false} is VALID [2018-11-23 12:29:55,186 INFO L273 TraceCheckUtils]: 64: Hoare triple {13908#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13908#false} is VALID [2018-11-23 12:29:55,186 INFO L273 TraceCheckUtils]: 65: Hoare triple {13908#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13908#false} is VALID [2018-11-23 12:29:55,187 INFO L273 TraceCheckUtils]: 66: Hoare triple {13908#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13908#false} is VALID [2018-11-23 12:29:55,187 INFO L273 TraceCheckUtils]: 67: Hoare triple {13908#false} assume !(~i~0 < 100000); {13908#false} is VALID [2018-11-23 12:29:55,187 INFO L273 TraceCheckUtils]: 68: Hoare triple {13908#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {13908#false} is VALID [2018-11-23 12:29:55,187 INFO L273 TraceCheckUtils]: 69: Hoare triple {13908#false} assume true; {13908#false} is VALID [2018-11-23 12:29:55,187 INFO L268 TraceCheckUtils]: 70: Hoare quadruple {13908#false} {13908#false} #70#return; {13908#false} is VALID [2018-11-23 12:29:55,187 INFO L273 TraceCheckUtils]: 71: Hoare triple {13908#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {13908#false} is VALID [2018-11-23 12:29:55,187 INFO L256 TraceCheckUtils]: 72: Hoare triple {13908#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {13908#false} is VALID [2018-11-23 12:29:55,187 INFO L273 TraceCheckUtils]: 73: Hoare triple {13908#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {13908#false} is VALID [2018-11-23 12:29:55,187 INFO L273 TraceCheckUtils]: 74: Hoare triple {13908#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13908#false} is VALID [2018-11-23 12:29:55,188 INFO L273 TraceCheckUtils]: 75: Hoare triple {13908#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13908#false} is VALID [2018-11-23 12:29:55,188 INFO L273 TraceCheckUtils]: 76: Hoare triple {13908#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13908#false} is VALID [2018-11-23 12:29:55,188 INFO L273 TraceCheckUtils]: 77: Hoare triple {13908#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13908#false} is VALID [2018-11-23 12:29:55,188 INFO L273 TraceCheckUtils]: 78: Hoare triple {13908#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13908#false} is VALID [2018-11-23 12:29:55,188 INFO L273 TraceCheckUtils]: 79: Hoare triple {13908#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13908#false} is VALID [2018-11-23 12:29:55,188 INFO L273 TraceCheckUtils]: 80: Hoare triple {13908#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13908#false} is VALID [2018-11-23 12:29:55,188 INFO L273 TraceCheckUtils]: 81: Hoare triple {13908#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13908#false} is VALID [2018-11-23 12:29:55,188 INFO L273 TraceCheckUtils]: 82: Hoare triple {13908#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13908#false} is VALID [2018-11-23 12:29:55,188 INFO L273 TraceCheckUtils]: 83: Hoare triple {13908#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13908#false} is VALID [2018-11-23 12:29:55,189 INFO L273 TraceCheckUtils]: 84: Hoare triple {13908#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13908#false} is VALID [2018-11-23 12:29:55,189 INFO L273 TraceCheckUtils]: 85: Hoare triple {13908#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13908#false} is VALID [2018-11-23 12:29:55,189 INFO L273 TraceCheckUtils]: 86: Hoare triple {13908#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13908#false} is VALID [2018-11-23 12:29:55,189 INFO L273 TraceCheckUtils]: 87: Hoare triple {13908#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13908#false} is VALID [2018-11-23 12:29:55,189 INFO L273 TraceCheckUtils]: 88: Hoare triple {13908#false} assume !(~i~0 < 100000); {13908#false} is VALID [2018-11-23 12:29:55,189 INFO L273 TraceCheckUtils]: 89: Hoare triple {13908#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {13908#false} is VALID [2018-11-23 12:29:55,189 INFO L273 TraceCheckUtils]: 90: Hoare triple {13908#false} assume true; {13908#false} is VALID [2018-11-23 12:29:55,189 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {13908#false} {13908#false} #72#return; {13908#false} is VALID [2018-11-23 12:29:55,189 INFO L273 TraceCheckUtils]: 92: Hoare triple {13908#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {13908#false} is VALID [2018-11-23 12:29:55,189 INFO L273 TraceCheckUtils]: 93: Hoare triple {13908#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13908#false} is VALID [2018-11-23 12:29:55,190 INFO L273 TraceCheckUtils]: 94: Hoare triple {13908#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13908#false} is VALID [2018-11-23 12:29:55,190 INFO L273 TraceCheckUtils]: 95: Hoare triple {13908#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13908#false} is VALID [2018-11-23 12:29:55,190 INFO L273 TraceCheckUtils]: 96: Hoare triple {13908#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13908#false} is VALID [2018-11-23 12:29:55,190 INFO L273 TraceCheckUtils]: 97: Hoare triple {13908#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13908#false} is VALID [2018-11-23 12:29:55,190 INFO L273 TraceCheckUtils]: 98: Hoare triple {13908#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13908#false} is VALID [2018-11-23 12:29:55,190 INFO L273 TraceCheckUtils]: 99: Hoare triple {13908#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13908#false} is VALID [2018-11-23 12:29:55,190 INFO L273 TraceCheckUtils]: 100: Hoare triple {13908#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13908#false} is VALID [2018-11-23 12:29:55,190 INFO L273 TraceCheckUtils]: 101: Hoare triple {13908#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13908#false} is VALID [2018-11-23 12:29:55,190 INFO L273 TraceCheckUtils]: 102: Hoare triple {13908#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13908#false} is VALID [2018-11-23 12:29:55,191 INFO L273 TraceCheckUtils]: 103: Hoare triple {13908#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13908#false} is VALID [2018-11-23 12:29:55,191 INFO L273 TraceCheckUtils]: 104: Hoare triple {13908#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13908#false} is VALID [2018-11-23 12:29:55,191 INFO L273 TraceCheckUtils]: 105: Hoare triple {13908#false} assume !(~i~2 < 99999); {13908#false} is VALID [2018-11-23 12:29:55,191 INFO L273 TraceCheckUtils]: 106: Hoare triple {13908#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {13908#false} is VALID [2018-11-23 12:29:55,191 INFO L256 TraceCheckUtils]: 107: Hoare triple {13908#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {13908#false} is VALID [2018-11-23 12:29:55,191 INFO L273 TraceCheckUtils]: 108: Hoare triple {13908#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {13908#false} is VALID [2018-11-23 12:29:55,191 INFO L273 TraceCheckUtils]: 109: Hoare triple {13908#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13908#false} is VALID [2018-11-23 12:29:55,191 INFO L273 TraceCheckUtils]: 110: Hoare triple {13908#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13908#false} is VALID [2018-11-23 12:29:55,191 INFO L273 TraceCheckUtils]: 111: Hoare triple {13908#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13908#false} is VALID [2018-11-23 12:29:55,192 INFO L273 TraceCheckUtils]: 112: Hoare triple {13908#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13908#false} is VALID [2018-11-23 12:29:55,192 INFO L273 TraceCheckUtils]: 113: Hoare triple {13908#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13908#false} is VALID [2018-11-23 12:29:55,192 INFO L273 TraceCheckUtils]: 114: Hoare triple {13908#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13908#false} is VALID [2018-11-23 12:29:55,192 INFO L273 TraceCheckUtils]: 115: Hoare triple {13908#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13908#false} is VALID [2018-11-23 12:29:55,192 INFO L273 TraceCheckUtils]: 116: Hoare triple {13908#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13908#false} is VALID [2018-11-23 12:29:55,192 INFO L273 TraceCheckUtils]: 117: Hoare triple {13908#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13908#false} is VALID [2018-11-23 12:29:55,192 INFO L273 TraceCheckUtils]: 118: Hoare triple {13908#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13908#false} is VALID [2018-11-23 12:29:55,192 INFO L273 TraceCheckUtils]: 119: Hoare triple {13908#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13908#false} is VALID [2018-11-23 12:29:55,192 INFO L273 TraceCheckUtils]: 120: Hoare triple {13908#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13908#false} is VALID [2018-11-23 12:29:55,192 INFO L273 TraceCheckUtils]: 121: Hoare triple {13908#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13908#false} is VALID [2018-11-23 12:29:55,193 INFO L273 TraceCheckUtils]: 122: Hoare triple {13908#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13908#false} is VALID [2018-11-23 12:29:55,193 INFO L273 TraceCheckUtils]: 123: Hoare triple {13908#false} assume !(~i~0 < 100000); {13908#false} is VALID [2018-11-23 12:29:55,193 INFO L273 TraceCheckUtils]: 124: Hoare triple {13908#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {13908#false} is VALID [2018-11-23 12:29:55,193 INFO L273 TraceCheckUtils]: 125: Hoare triple {13908#false} assume true; {13908#false} is VALID [2018-11-23 12:29:55,193 INFO L268 TraceCheckUtils]: 126: Hoare quadruple {13908#false} {13908#false} #74#return; {13908#false} is VALID [2018-11-23 12:29:55,193 INFO L273 TraceCheckUtils]: 127: Hoare triple {13908#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {13908#false} is VALID [2018-11-23 12:29:55,193 INFO L273 TraceCheckUtils]: 128: Hoare triple {13908#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {13908#false} is VALID [2018-11-23 12:29:55,193 INFO L273 TraceCheckUtils]: 129: Hoare triple {13908#false} assume !false; {13908#false} is VALID [2018-11-23 12:29:55,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2018-11-23 12:29:55,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:29:55,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-11-23 12:29:55,227 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 130 [2018-11-23 12:29:55,228 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:29:55,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 12:29:55,344 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 12:29:55,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 12:29:55,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 12:29:55,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:29:55,346 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand 26 states. [2018-11-23 12:29:56,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:56,135 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2018-11-23 12:29:56,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 12:29:56,135 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 130 [2018-11-23 12:29:56,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:29:56,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:29:56,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 98 transitions. [2018-11-23 12:29:56,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:29:56,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 98 transitions. [2018-11-23 12:29:56,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 98 transitions. [2018-11-23 12:29:56,258 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 12:29:56,260 INFO L225 Difference]: With dead ends: 138 [2018-11-23 12:29:56,260 INFO L226 Difference]: Without dead ends: 96 [2018-11-23 12:29:56,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:29:56,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-23 12:29:56,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2018-11-23 12:29:56,382 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:29:56,382 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 95 states. [2018-11-23 12:29:56,382 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 95 states. [2018-11-23 12:29:56,383 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 95 states. [2018-11-23 12:29:56,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:56,385 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-11-23 12:29:56,386 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-11-23 12:29:56,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:56,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:56,386 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 96 states. [2018-11-23 12:29:56,387 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 96 states. [2018-11-23 12:29:56,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:29:56,388 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-11-23 12:29:56,388 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-11-23 12:29:56,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:29:56,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:29:56,389 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:29:56,389 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:29:56,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-23 12:29:56,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2018-11-23 12:29:56,391 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 130 [2018-11-23 12:29:56,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:29:56,391 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2018-11-23 12:29:56,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 12:29:56,392 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-11-23 12:29:56,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-23 12:29:56,393 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:29:56,393 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 21, 21, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:29:56,393 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:29:56,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:29:56,393 INFO L82 PathProgramCache]: Analyzing trace with hash 145514399, now seen corresponding path program 23 times [2018-11-23 12:29:56,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:29:56,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:29:56,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:56,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:29:56,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:29:56,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:29:57,457 INFO L256 TraceCheckUtils]: 0: Hoare triple {14860#true} call ULTIMATE.init(); {14860#true} is VALID [2018-11-23 12:29:57,457 INFO L273 TraceCheckUtils]: 1: Hoare triple {14860#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14860#true} is VALID [2018-11-23 12:29:57,457 INFO L273 TraceCheckUtils]: 2: Hoare triple {14860#true} assume true; {14860#true} is VALID [2018-11-23 12:29:57,457 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14860#true} {14860#true} #66#return; {14860#true} is VALID [2018-11-23 12:29:57,458 INFO L256 TraceCheckUtils]: 4: Hoare triple {14860#true} call #t~ret13 := main(); {14860#true} is VALID [2018-11-23 12:29:57,458 INFO L273 TraceCheckUtils]: 5: Hoare triple {14860#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {14862#(= main_~i~1 0)} is VALID [2018-11-23 12:29:57,459 INFO L273 TraceCheckUtils]: 6: Hoare triple {14862#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14862#(= main_~i~1 0)} is VALID [2018-11-23 12:29:57,459 INFO L273 TraceCheckUtils]: 7: Hoare triple {14862#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14863#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:57,460 INFO L273 TraceCheckUtils]: 8: Hoare triple {14863#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14863#(<= main_~i~1 1)} is VALID [2018-11-23 12:29:57,461 INFO L273 TraceCheckUtils]: 9: Hoare triple {14863#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14864#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:57,461 INFO L273 TraceCheckUtils]: 10: Hoare triple {14864#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14864#(<= main_~i~1 2)} is VALID [2018-11-23 12:29:57,462 INFO L273 TraceCheckUtils]: 11: Hoare triple {14864#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14865#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:57,462 INFO L273 TraceCheckUtils]: 12: Hoare triple {14865#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14865#(<= main_~i~1 3)} is VALID [2018-11-23 12:29:57,463 INFO L273 TraceCheckUtils]: 13: Hoare triple {14865#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14866#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:57,464 INFO L273 TraceCheckUtils]: 14: Hoare triple {14866#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14866#(<= main_~i~1 4)} is VALID [2018-11-23 12:29:57,464 INFO L273 TraceCheckUtils]: 15: Hoare triple {14866#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14867#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:57,469 INFO L273 TraceCheckUtils]: 16: Hoare triple {14867#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14867#(<= main_~i~1 5)} is VALID [2018-11-23 12:29:57,470 INFO L273 TraceCheckUtils]: 17: Hoare triple {14867#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14868#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:57,470 INFO L273 TraceCheckUtils]: 18: Hoare triple {14868#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14868#(<= main_~i~1 6)} is VALID [2018-11-23 12:29:57,471 INFO L273 TraceCheckUtils]: 19: Hoare triple {14868#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14869#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:57,471 INFO L273 TraceCheckUtils]: 20: Hoare triple {14869#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14869#(<= main_~i~1 7)} is VALID [2018-11-23 12:29:57,471 INFO L273 TraceCheckUtils]: 21: Hoare triple {14869#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14870#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:57,472 INFO L273 TraceCheckUtils]: 22: Hoare triple {14870#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14870#(<= main_~i~1 8)} is VALID [2018-11-23 12:29:57,472 INFO L273 TraceCheckUtils]: 23: Hoare triple {14870#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14871#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:57,472 INFO L273 TraceCheckUtils]: 24: Hoare triple {14871#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14871#(<= main_~i~1 9)} is VALID [2018-11-23 12:29:57,473 INFO L273 TraceCheckUtils]: 25: Hoare triple {14871#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14872#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:57,474 INFO L273 TraceCheckUtils]: 26: Hoare triple {14872#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14872#(<= main_~i~1 10)} is VALID [2018-11-23 12:29:57,474 INFO L273 TraceCheckUtils]: 27: Hoare triple {14872#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14873#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:57,475 INFO L273 TraceCheckUtils]: 28: Hoare triple {14873#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14873#(<= main_~i~1 11)} is VALID [2018-11-23 12:29:57,476 INFO L273 TraceCheckUtils]: 29: Hoare triple {14873#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14874#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:57,476 INFO L273 TraceCheckUtils]: 30: Hoare triple {14874#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14874#(<= main_~i~1 12)} is VALID [2018-11-23 12:29:57,477 INFO L273 TraceCheckUtils]: 31: Hoare triple {14874#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14875#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:57,477 INFO L273 TraceCheckUtils]: 32: Hoare triple {14875#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14875#(<= main_~i~1 13)} is VALID [2018-11-23 12:29:57,478 INFO L273 TraceCheckUtils]: 33: Hoare triple {14875#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14876#(<= main_~i~1 14)} is VALID [2018-11-23 12:29:57,479 INFO L273 TraceCheckUtils]: 34: Hoare triple {14876#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14876#(<= main_~i~1 14)} is VALID [2018-11-23 12:29:57,479 INFO L273 TraceCheckUtils]: 35: Hoare triple {14876#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14877#(<= main_~i~1 15)} is VALID [2018-11-23 12:29:57,480 INFO L273 TraceCheckUtils]: 36: Hoare triple {14877#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14877#(<= main_~i~1 15)} is VALID [2018-11-23 12:29:57,481 INFO L273 TraceCheckUtils]: 37: Hoare triple {14877#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14878#(<= main_~i~1 16)} is VALID [2018-11-23 12:29:57,481 INFO L273 TraceCheckUtils]: 38: Hoare triple {14878#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14878#(<= main_~i~1 16)} is VALID [2018-11-23 12:29:57,482 INFO L273 TraceCheckUtils]: 39: Hoare triple {14878#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14879#(<= main_~i~1 17)} is VALID [2018-11-23 12:29:57,482 INFO L273 TraceCheckUtils]: 40: Hoare triple {14879#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14879#(<= main_~i~1 17)} is VALID [2018-11-23 12:29:57,483 INFO L273 TraceCheckUtils]: 41: Hoare triple {14879#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14880#(<= main_~i~1 18)} is VALID [2018-11-23 12:29:57,484 INFO L273 TraceCheckUtils]: 42: Hoare triple {14880#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14880#(<= main_~i~1 18)} is VALID [2018-11-23 12:29:57,484 INFO L273 TraceCheckUtils]: 43: Hoare triple {14880#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14881#(<= main_~i~1 19)} is VALID [2018-11-23 12:29:57,485 INFO L273 TraceCheckUtils]: 44: Hoare triple {14881#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14881#(<= main_~i~1 19)} is VALID [2018-11-23 12:29:57,486 INFO L273 TraceCheckUtils]: 45: Hoare triple {14881#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14882#(<= main_~i~1 20)} is VALID [2018-11-23 12:29:57,486 INFO L273 TraceCheckUtils]: 46: Hoare triple {14882#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14882#(<= main_~i~1 20)} is VALID [2018-11-23 12:29:57,487 INFO L273 TraceCheckUtils]: 47: Hoare triple {14882#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14883#(<= main_~i~1 21)} is VALID [2018-11-23 12:29:57,487 INFO L273 TraceCheckUtils]: 48: Hoare triple {14883#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14883#(<= main_~i~1 21)} is VALID [2018-11-23 12:29:57,488 INFO L273 TraceCheckUtils]: 49: Hoare triple {14883#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14884#(<= main_~i~1 22)} is VALID [2018-11-23 12:29:57,489 INFO L273 TraceCheckUtils]: 50: Hoare triple {14884#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14884#(<= main_~i~1 22)} is VALID [2018-11-23 12:29:57,489 INFO L273 TraceCheckUtils]: 51: Hoare triple {14884#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14885#(<= main_~i~1 23)} is VALID [2018-11-23 12:29:57,490 INFO L273 TraceCheckUtils]: 52: Hoare triple {14885#(<= main_~i~1 23)} assume !(~i~1 < 100000); {14861#false} is VALID [2018-11-23 12:29:57,490 INFO L256 TraceCheckUtils]: 53: Hoare triple {14861#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {14860#true} is VALID [2018-11-23 12:29:57,491 INFO L273 TraceCheckUtils]: 54: Hoare triple {14860#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {14860#true} is VALID [2018-11-23 12:29:57,491 INFO L273 TraceCheckUtils]: 55: Hoare triple {14860#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14860#true} is VALID [2018-11-23 12:29:57,491 INFO L273 TraceCheckUtils]: 56: Hoare triple {14860#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14860#true} is VALID [2018-11-23 12:29:57,491 INFO L273 TraceCheckUtils]: 57: Hoare triple {14860#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14860#true} is VALID [2018-11-23 12:29:57,491 INFO L273 TraceCheckUtils]: 58: Hoare triple {14860#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14860#true} is VALID [2018-11-23 12:29:57,491 INFO L273 TraceCheckUtils]: 59: Hoare triple {14860#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14860#true} is VALID [2018-11-23 12:29:57,492 INFO L273 TraceCheckUtils]: 60: Hoare triple {14860#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14860#true} is VALID [2018-11-23 12:29:57,492 INFO L273 TraceCheckUtils]: 61: Hoare triple {14860#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14860#true} is VALID [2018-11-23 12:29:57,492 INFO L273 TraceCheckUtils]: 62: Hoare triple {14860#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14860#true} is VALID [2018-11-23 12:29:57,492 INFO L273 TraceCheckUtils]: 63: Hoare triple {14860#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14860#true} is VALID [2018-11-23 12:29:57,492 INFO L273 TraceCheckUtils]: 64: Hoare triple {14860#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14860#true} is VALID [2018-11-23 12:29:57,493 INFO L273 TraceCheckUtils]: 65: Hoare triple {14860#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14860#true} is VALID [2018-11-23 12:29:57,493 INFO L273 TraceCheckUtils]: 66: Hoare triple {14860#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14860#true} is VALID [2018-11-23 12:29:57,493 INFO L273 TraceCheckUtils]: 67: Hoare triple {14860#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14860#true} is VALID [2018-11-23 12:29:57,493 INFO L273 TraceCheckUtils]: 68: Hoare triple {14860#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14860#true} is VALID [2018-11-23 12:29:57,493 INFO L273 TraceCheckUtils]: 69: Hoare triple {14860#true} assume !(~i~0 < 100000); {14860#true} is VALID [2018-11-23 12:29:57,493 INFO L273 TraceCheckUtils]: 70: Hoare triple {14860#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {14860#true} is VALID [2018-11-23 12:29:57,493 INFO L273 TraceCheckUtils]: 71: Hoare triple {14860#true} assume true; {14860#true} is VALID [2018-11-23 12:29:57,493 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {14860#true} {14861#false} #70#return; {14861#false} is VALID [2018-11-23 12:29:57,493 INFO L273 TraceCheckUtils]: 73: Hoare triple {14861#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {14861#false} is VALID [2018-11-23 12:29:57,494 INFO L256 TraceCheckUtils]: 74: Hoare triple {14861#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {14860#true} is VALID [2018-11-23 12:29:57,494 INFO L273 TraceCheckUtils]: 75: Hoare triple {14860#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {14860#true} is VALID [2018-11-23 12:29:57,494 INFO L273 TraceCheckUtils]: 76: Hoare triple {14860#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14860#true} is VALID [2018-11-23 12:29:57,494 INFO L273 TraceCheckUtils]: 77: Hoare triple {14860#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14860#true} is VALID [2018-11-23 12:29:57,494 INFO L273 TraceCheckUtils]: 78: Hoare triple {14860#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14860#true} is VALID [2018-11-23 12:29:57,494 INFO L273 TraceCheckUtils]: 79: Hoare triple {14860#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14860#true} is VALID [2018-11-23 12:29:57,494 INFO L273 TraceCheckUtils]: 80: Hoare triple {14860#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14860#true} is VALID [2018-11-23 12:29:57,494 INFO L273 TraceCheckUtils]: 81: Hoare triple {14860#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14860#true} is VALID [2018-11-23 12:29:57,494 INFO L273 TraceCheckUtils]: 82: Hoare triple {14860#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14860#true} is VALID [2018-11-23 12:29:57,495 INFO L273 TraceCheckUtils]: 83: Hoare triple {14860#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14860#true} is VALID [2018-11-23 12:29:57,495 INFO L273 TraceCheckUtils]: 84: Hoare triple {14860#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14860#true} is VALID [2018-11-23 12:29:57,495 INFO L273 TraceCheckUtils]: 85: Hoare triple {14860#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14860#true} is VALID [2018-11-23 12:29:57,495 INFO L273 TraceCheckUtils]: 86: Hoare triple {14860#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14860#true} is VALID [2018-11-23 12:29:57,495 INFO L273 TraceCheckUtils]: 87: Hoare triple {14860#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14860#true} is VALID [2018-11-23 12:29:57,495 INFO L273 TraceCheckUtils]: 88: Hoare triple {14860#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14860#true} is VALID [2018-11-23 12:29:57,495 INFO L273 TraceCheckUtils]: 89: Hoare triple {14860#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14860#true} is VALID [2018-11-23 12:29:57,495 INFO L273 TraceCheckUtils]: 90: Hoare triple {14860#true} assume !(~i~0 < 100000); {14860#true} is VALID [2018-11-23 12:29:57,495 INFO L273 TraceCheckUtils]: 91: Hoare triple {14860#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {14860#true} is VALID [2018-11-23 12:29:57,496 INFO L273 TraceCheckUtils]: 92: Hoare triple {14860#true} assume true; {14860#true} is VALID [2018-11-23 12:29:57,496 INFO L268 TraceCheckUtils]: 93: Hoare quadruple {14860#true} {14861#false} #72#return; {14861#false} is VALID [2018-11-23 12:29:57,496 INFO L273 TraceCheckUtils]: 94: Hoare triple {14861#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {14861#false} is VALID [2018-11-23 12:29:57,496 INFO L273 TraceCheckUtils]: 95: Hoare triple {14861#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {14861#false} is VALID [2018-11-23 12:29:57,496 INFO L273 TraceCheckUtils]: 96: Hoare triple {14861#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {14861#false} is VALID [2018-11-23 12:29:57,496 INFO L273 TraceCheckUtils]: 97: Hoare triple {14861#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {14861#false} is VALID [2018-11-23 12:29:57,496 INFO L273 TraceCheckUtils]: 98: Hoare triple {14861#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {14861#false} is VALID [2018-11-23 12:29:57,496 INFO L273 TraceCheckUtils]: 99: Hoare triple {14861#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {14861#false} is VALID [2018-11-23 12:29:57,496 INFO L273 TraceCheckUtils]: 100: Hoare triple {14861#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {14861#false} is VALID [2018-11-23 12:29:57,496 INFO L273 TraceCheckUtils]: 101: Hoare triple {14861#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {14861#false} is VALID [2018-11-23 12:29:57,497 INFO L273 TraceCheckUtils]: 102: Hoare triple {14861#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {14861#false} is VALID [2018-11-23 12:29:57,497 INFO L273 TraceCheckUtils]: 103: Hoare triple {14861#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {14861#false} is VALID [2018-11-23 12:29:57,497 INFO L273 TraceCheckUtils]: 104: Hoare triple {14861#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {14861#false} is VALID [2018-11-23 12:29:57,497 INFO L273 TraceCheckUtils]: 105: Hoare triple {14861#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {14861#false} is VALID [2018-11-23 12:29:57,497 INFO L273 TraceCheckUtils]: 106: Hoare triple {14861#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {14861#false} is VALID [2018-11-23 12:29:57,497 INFO L273 TraceCheckUtils]: 107: Hoare triple {14861#false} assume !(~i~2 < 99999); {14861#false} is VALID [2018-11-23 12:29:57,497 INFO L273 TraceCheckUtils]: 108: Hoare triple {14861#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {14861#false} is VALID [2018-11-23 12:29:57,497 INFO L256 TraceCheckUtils]: 109: Hoare triple {14861#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {14860#true} is VALID [2018-11-23 12:29:57,497 INFO L273 TraceCheckUtils]: 110: Hoare triple {14860#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {14860#true} is VALID [2018-11-23 12:29:57,498 INFO L273 TraceCheckUtils]: 111: Hoare triple {14860#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14860#true} is VALID [2018-11-23 12:29:57,498 INFO L273 TraceCheckUtils]: 112: Hoare triple {14860#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14860#true} is VALID [2018-11-23 12:29:57,498 INFO L273 TraceCheckUtils]: 113: Hoare triple {14860#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14860#true} is VALID [2018-11-23 12:29:57,498 INFO L273 TraceCheckUtils]: 114: Hoare triple {14860#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14860#true} is VALID [2018-11-23 12:29:57,498 INFO L273 TraceCheckUtils]: 115: Hoare triple {14860#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14860#true} is VALID [2018-11-23 12:29:57,498 INFO L273 TraceCheckUtils]: 116: Hoare triple {14860#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14860#true} is VALID [2018-11-23 12:29:57,498 INFO L273 TraceCheckUtils]: 117: Hoare triple {14860#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14860#true} is VALID [2018-11-23 12:29:57,498 INFO L273 TraceCheckUtils]: 118: Hoare triple {14860#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14860#true} is VALID [2018-11-23 12:29:57,498 INFO L273 TraceCheckUtils]: 119: Hoare triple {14860#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14860#true} is VALID [2018-11-23 12:29:57,499 INFO L273 TraceCheckUtils]: 120: Hoare triple {14860#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14860#true} is VALID [2018-11-23 12:29:57,499 INFO L273 TraceCheckUtils]: 121: Hoare triple {14860#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14860#true} is VALID [2018-11-23 12:29:57,499 INFO L273 TraceCheckUtils]: 122: Hoare triple {14860#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14860#true} is VALID [2018-11-23 12:29:57,499 INFO L273 TraceCheckUtils]: 123: Hoare triple {14860#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14860#true} is VALID [2018-11-23 12:29:57,499 INFO L273 TraceCheckUtils]: 124: Hoare triple {14860#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14860#true} is VALID [2018-11-23 12:29:57,499 INFO L273 TraceCheckUtils]: 125: Hoare triple {14860#true} assume !(~i~0 < 100000); {14860#true} is VALID [2018-11-23 12:29:57,499 INFO L273 TraceCheckUtils]: 126: Hoare triple {14860#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {14860#true} is VALID [2018-11-23 12:29:57,499 INFO L273 TraceCheckUtils]: 127: Hoare triple {14860#true} assume true; {14860#true} is VALID [2018-11-23 12:29:57,499 INFO L268 TraceCheckUtils]: 128: Hoare quadruple {14860#true} {14861#false} #74#return; {14861#false} is VALID [2018-11-23 12:29:57,499 INFO L273 TraceCheckUtils]: 129: Hoare triple {14861#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {14861#false} is VALID [2018-11-23 12:29:57,500 INFO L273 TraceCheckUtils]: 130: Hoare triple {14861#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {14861#false} is VALID [2018-11-23 12:29:57,500 INFO L273 TraceCheckUtils]: 131: Hoare triple {14861#false} assume !false; {14861#false} is VALID [2018-11-23 12:29:57,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1063 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2018-11-23 12:29:57,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:29:57,508 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 12:29:57,519 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:30:00,604 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2018-11-23 12:30:00,605 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:30:00,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:00,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:30:01,345 INFO L256 TraceCheckUtils]: 0: Hoare triple {14860#true} call ULTIMATE.init(); {14860#true} is VALID [2018-11-23 12:30:01,346 INFO L273 TraceCheckUtils]: 1: Hoare triple {14860#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14860#true} is VALID [2018-11-23 12:30:01,346 INFO L273 TraceCheckUtils]: 2: Hoare triple {14860#true} assume true; {14860#true} is VALID [2018-11-23 12:30:01,346 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14860#true} {14860#true} #66#return; {14860#true} is VALID [2018-11-23 12:30:01,346 INFO L256 TraceCheckUtils]: 4: Hoare triple {14860#true} call #t~ret13 := main(); {14860#true} is VALID [2018-11-23 12:30:01,347 INFO L273 TraceCheckUtils]: 5: Hoare triple {14860#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {14860#true} is VALID [2018-11-23 12:30:01,347 INFO L273 TraceCheckUtils]: 6: Hoare triple {14860#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14860#true} is VALID [2018-11-23 12:30:01,347 INFO L273 TraceCheckUtils]: 7: Hoare triple {14860#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14860#true} is VALID [2018-11-23 12:30:01,347 INFO L273 TraceCheckUtils]: 8: Hoare triple {14860#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14860#true} is VALID [2018-11-23 12:30:01,347 INFO L273 TraceCheckUtils]: 9: Hoare triple {14860#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14860#true} is VALID [2018-11-23 12:30:01,347 INFO L273 TraceCheckUtils]: 10: Hoare triple {14860#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14860#true} is VALID [2018-11-23 12:30:01,347 INFO L273 TraceCheckUtils]: 11: Hoare triple {14860#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14860#true} is VALID [2018-11-23 12:30:01,348 INFO L273 TraceCheckUtils]: 12: Hoare triple {14860#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14860#true} is VALID [2018-11-23 12:30:01,348 INFO L273 TraceCheckUtils]: 13: Hoare triple {14860#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14860#true} is VALID [2018-11-23 12:30:01,348 INFO L273 TraceCheckUtils]: 14: Hoare triple {14860#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14860#true} is VALID [2018-11-23 12:30:01,348 INFO L273 TraceCheckUtils]: 15: Hoare triple {14860#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14860#true} is VALID [2018-11-23 12:30:01,348 INFO L273 TraceCheckUtils]: 16: Hoare triple {14860#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14860#true} is VALID [2018-11-23 12:30:01,348 INFO L273 TraceCheckUtils]: 17: Hoare triple {14860#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14860#true} is VALID [2018-11-23 12:30:01,348 INFO L273 TraceCheckUtils]: 18: Hoare triple {14860#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14860#true} is VALID [2018-11-23 12:30:01,348 INFO L273 TraceCheckUtils]: 19: Hoare triple {14860#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14860#true} is VALID [2018-11-23 12:30:01,348 INFO L273 TraceCheckUtils]: 20: Hoare triple {14860#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14860#true} is VALID [2018-11-23 12:30:01,349 INFO L273 TraceCheckUtils]: 21: Hoare triple {14860#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14860#true} is VALID [2018-11-23 12:30:01,349 INFO L273 TraceCheckUtils]: 22: Hoare triple {14860#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14860#true} is VALID [2018-11-23 12:30:01,349 INFO L273 TraceCheckUtils]: 23: Hoare triple {14860#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14860#true} is VALID [2018-11-23 12:30:01,349 INFO L273 TraceCheckUtils]: 24: Hoare triple {14860#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14860#true} is VALID [2018-11-23 12:30:01,349 INFO L273 TraceCheckUtils]: 25: Hoare triple {14860#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14860#true} is VALID [2018-11-23 12:30:01,349 INFO L273 TraceCheckUtils]: 26: Hoare triple {14860#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14860#true} is VALID [2018-11-23 12:30:01,349 INFO L273 TraceCheckUtils]: 27: Hoare triple {14860#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14860#true} is VALID [2018-11-23 12:30:01,349 INFO L273 TraceCheckUtils]: 28: Hoare triple {14860#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14860#true} is VALID [2018-11-23 12:30:01,349 INFO L273 TraceCheckUtils]: 29: Hoare triple {14860#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14860#true} is VALID [2018-11-23 12:30:01,349 INFO L273 TraceCheckUtils]: 30: Hoare triple {14860#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14860#true} is VALID [2018-11-23 12:30:01,350 INFO L273 TraceCheckUtils]: 31: Hoare triple {14860#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14860#true} is VALID [2018-11-23 12:30:01,350 INFO L273 TraceCheckUtils]: 32: Hoare triple {14860#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14860#true} is VALID [2018-11-23 12:30:01,350 INFO L273 TraceCheckUtils]: 33: Hoare triple {14860#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14860#true} is VALID [2018-11-23 12:30:01,350 INFO L273 TraceCheckUtils]: 34: Hoare triple {14860#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14860#true} is VALID [2018-11-23 12:30:01,350 INFO L273 TraceCheckUtils]: 35: Hoare triple {14860#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14860#true} is VALID [2018-11-23 12:30:01,350 INFO L273 TraceCheckUtils]: 36: Hoare triple {14860#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14860#true} is VALID [2018-11-23 12:30:01,350 INFO L273 TraceCheckUtils]: 37: Hoare triple {14860#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14860#true} is VALID [2018-11-23 12:30:01,350 INFO L273 TraceCheckUtils]: 38: Hoare triple {14860#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14860#true} is VALID [2018-11-23 12:30:01,350 INFO L273 TraceCheckUtils]: 39: Hoare triple {14860#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14860#true} is VALID [2018-11-23 12:30:01,351 INFO L273 TraceCheckUtils]: 40: Hoare triple {14860#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14860#true} is VALID [2018-11-23 12:30:01,351 INFO L273 TraceCheckUtils]: 41: Hoare triple {14860#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14860#true} is VALID [2018-11-23 12:30:01,351 INFO L273 TraceCheckUtils]: 42: Hoare triple {14860#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14860#true} is VALID [2018-11-23 12:30:01,351 INFO L273 TraceCheckUtils]: 43: Hoare triple {14860#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14860#true} is VALID [2018-11-23 12:30:01,351 INFO L273 TraceCheckUtils]: 44: Hoare triple {14860#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14860#true} is VALID [2018-11-23 12:30:01,351 INFO L273 TraceCheckUtils]: 45: Hoare triple {14860#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14860#true} is VALID [2018-11-23 12:30:01,351 INFO L273 TraceCheckUtils]: 46: Hoare triple {14860#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14860#true} is VALID [2018-11-23 12:30:01,351 INFO L273 TraceCheckUtils]: 47: Hoare triple {14860#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14860#true} is VALID [2018-11-23 12:30:01,351 INFO L273 TraceCheckUtils]: 48: Hoare triple {14860#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14860#true} is VALID [2018-11-23 12:30:01,352 INFO L273 TraceCheckUtils]: 49: Hoare triple {14860#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14860#true} is VALID [2018-11-23 12:30:01,352 INFO L273 TraceCheckUtils]: 50: Hoare triple {14860#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14860#true} is VALID [2018-11-23 12:30:01,352 INFO L273 TraceCheckUtils]: 51: Hoare triple {14860#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14860#true} is VALID [2018-11-23 12:30:01,352 INFO L273 TraceCheckUtils]: 52: Hoare triple {14860#true} assume !(~i~1 < 100000); {14860#true} is VALID [2018-11-23 12:30:01,352 INFO L256 TraceCheckUtils]: 53: Hoare triple {14860#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {14860#true} is VALID [2018-11-23 12:30:01,352 INFO L273 TraceCheckUtils]: 54: Hoare triple {14860#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {14860#true} is VALID [2018-11-23 12:30:01,352 INFO L273 TraceCheckUtils]: 55: Hoare triple {14860#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14860#true} is VALID [2018-11-23 12:30:01,352 INFO L273 TraceCheckUtils]: 56: Hoare triple {14860#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14860#true} is VALID [2018-11-23 12:30:01,352 INFO L273 TraceCheckUtils]: 57: Hoare triple {14860#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14860#true} is VALID [2018-11-23 12:30:01,352 INFO L273 TraceCheckUtils]: 58: Hoare triple {14860#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14860#true} is VALID [2018-11-23 12:30:01,353 INFO L273 TraceCheckUtils]: 59: Hoare triple {14860#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14860#true} is VALID [2018-11-23 12:30:01,353 INFO L273 TraceCheckUtils]: 60: Hoare triple {14860#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14860#true} is VALID [2018-11-23 12:30:01,353 INFO L273 TraceCheckUtils]: 61: Hoare triple {14860#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14860#true} is VALID [2018-11-23 12:30:01,353 INFO L273 TraceCheckUtils]: 62: Hoare triple {14860#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14860#true} is VALID [2018-11-23 12:30:01,353 INFO L273 TraceCheckUtils]: 63: Hoare triple {14860#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14860#true} is VALID [2018-11-23 12:30:01,353 INFO L273 TraceCheckUtils]: 64: Hoare triple {14860#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14860#true} is VALID [2018-11-23 12:30:01,353 INFO L273 TraceCheckUtils]: 65: Hoare triple {14860#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14860#true} is VALID [2018-11-23 12:30:01,353 INFO L273 TraceCheckUtils]: 66: Hoare triple {14860#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14860#true} is VALID [2018-11-23 12:30:01,353 INFO L273 TraceCheckUtils]: 67: Hoare triple {14860#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14860#true} is VALID [2018-11-23 12:30:01,354 INFO L273 TraceCheckUtils]: 68: Hoare triple {14860#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14860#true} is VALID [2018-11-23 12:30:01,354 INFO L273 TraceCheckUtils]: 69: Hoare triple {14860#true} assume !(~i~0 < 100000); {14860#true} is VALID [2018-11-23 12:30:01,354 INFO L273 TraceCheckUtils]: 70: Hoare triple {14860#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {14860#true} is VALID [2018-11-23 12:30:01,354 INFO L273 TraceCheckUtils]: 71: Hoare triple {14860#true} assume true; {14860#true} is VALID [2018-11-23 12:30:01,354 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {14860#true} {14860#true} #70#return; {14860#true} is VALID [2018-11-23 12:30:01,354 INFO L273 TraceCheckUtils]: 73: Hoare triple {14860#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {14860#true} is VALID [2018-11-23 12:30:01,354 INFO L256 TraceCheckUtils]: 74: Hoare triple {14860#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {14860#true} is VALID [2018-11-23 12:30:01,354 INFO L273 TraceCheckUtils]: 75: Hoare triple {14860#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {14860#true} is VALID [2018-11-23 12:30:01,354 INFO L273 TraceCheckUtils]: 76: Hoare triple {14860#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14860#true} is VALID [2018-11-23 12:30:01,355 INFO L273 TraceCheckUtils]: 77: Hoare triple {14860#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14860#true} is VALID [2018-11-23 12:30:01,355 INFO L273 TraceCheckUtils]: 78: Hoare triple {14860#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14860#true} is VALID [2018-11-23 12:30:01,355 INFO L273 TraceCheckUtils]: 79: Hoare triple {14860#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14860#true} is VALID [2018-11-23 12:30:01,355 INFO L273 TraceCheckUtils]: 80: Hoare triple {14860#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14860#true} is VALID [2018-11-23 12:30:01,355 INFO L273 TraceCheckUtils]: 81: Hoare triple {14860#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14860#true} is VALID [2018-11-23 12:30:01,355 INFO L273 TraceCheckUtils]: 82: Hoare triple {14860#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14860#true} is VALID [2018-11-23 12:30:01,355 INFO L273 TraceCheckUtils]: 83: Hoare triple {14860#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14860#true} is VALID [2018-11-23 12:30:01,355 INFO L273 TraceCheckUtils]: 84: Hoare triple {14860#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14860#true} is VALID [2018-11-23 12:30:01,355 INFO L273 TraceCheckUtils]: 85: Hoare triple {14860#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14860#true} is VALID [2018-11-23 12:30:01,355 INFO L273 TraceCheckUtils]: 86: Hoare triple {14860#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14860#true} is VALID [2018-11-23 12:30:01,356 INFO L273 TraceCheckUtils]: 87: Hoare triple {14860#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14860#true} is VALID [2018-11-23 12:30:01,356 INFO L273 TraceCheckUtils]: 88: Hoare triple {14860#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14860#true} is VALID [2018-11-23 12:30:01,356 INFO L273 TraceCheckUtils]: 89: Hoare triple {14860#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14860#true} is VALID [2018-11-23 12:30:01,356 INFO L273 TraceCheckUtils]: 90: Hoare triple {14860#true} assume !(~i~0 < 100000); {14860#true} is VALID [2018-11-23 12:30:01,356 INFO L273 TraceCheckUtils]: 91: Hoare triple {14860#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {14860#true} is VALID [2018-11-23 12:30:01,356 INFO L273 TraceCheckUtils]: 92: Hoare triple {14860#true} assume true; {14860#true} is VALID [2018-11-23 12:30:01,356 INFO L268 TraceCheckUtils]: 93: Hoare quadruple {14860#true} {14860#true} #72#return; {14860#true} is VALID [2018-11-23 12:30:01,357 INFO L273 TraceCheckUtils]: 94: Hoare triple {14860#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {15171#(<= main_~i~2 0)} is VALID [2018-11-23 12:30:01,357 INFO L273 TraceCheckUtils]: 95: Hoare triple {15171#(<= main_~i~2 0)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {15171#(<= main_~i~2 0)} is VALID [2018-11-23 12:30:01,359 INFO L273 TraceCheckUtils]: 96: Hoare triple {15171#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {15178#(<= main_~i~2 1)} is VALID [2018-11-23 12:30:01,359 INFO L273 TraceCheckUtils]: 97: Hoare triple {15178#(<= main_~i~2 1)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {15178#(<= main_~i~2 1)} is VALID [2018-11-23 12:30:01,361 INFO L273 TraceCheckUtils]: 98: Hoare triple {15178#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {15185#(<= main_~i~2 2)} is VALID [2018-11-23 12:30:01,361 INFO L273 TraceCheckUtils]: 99: Hoare triple {15185#(<= main_~i~2 2)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {15185#(<= main_~i~2 2)} is VALID [2018-11-23 12:30:01,363 INFO L273 TraceCheckUtils]: 100: Hoare triple {15185#(<= main_~i~2 2)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {15192#(<= main_~i~2 3)} is VALID [2018-11-23 12:30:01,363 INFO L273 TraceCheckUtils]: 101: Hoare triple {15192#(<= main_~i~2 3)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {15192#(<= main_~i~2 3)} is VALID [2018-11-23 12:30:01,365 INFO L273 TraceCheckUtils]: 102: Hoare triple {15192#(<= main_~i~2 3)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {15199#(<= main_~i~2 4)} is VALID [2018-11-23 12:30:01,365 INFO L273 TraceCheckUtils]: 103: Hoare triple {15199#(<= main_~i~2 4)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {15199#(<= main_~i~2 4)} is VALID [2018-11-23 12:30:01,367 INFO L273 TraceCheckUtils]: 104: Hoare triple {15199#(<= main_~i~2 4)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {15206#(<= main_~i~2 5)} is VALID [2018-11-23 12:30:01,367 INFO L273 TraceCheckUtils]: 105: Hoare triple {15206#(<= main_~i~2 5)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {15206#(<= main_~i~2 5)} is VALID [2018-11-23 12:30:01,369 INFO L273 TraceCheckUtils]: 106: Hoare triple {15206#(<= main_~i~2 5)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {15213#(<= main_~i~2 6)} is VALID [2018-11-23 12:30:01,369 INFO L273 TraceCheckUtils]: 107: Hoare triple {15213#(<= main_~i~2 6)} assume !(~i~2 < 99999); {14861#false} is VALID [2018-11-23 12:30:01,369 INFO L273 TraceCheckUtils]: 108: Hoare triple {14861#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {14861#false} is VALID [2018-11-23 12:30:01,369 INFO L256 TraceCheckUtils]: 109: Hoare triple {14861#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {14861#false} is VALID [2018-11-23 12:30:01,369 INFO L273 TraceCheckUtils]: 110: Hoare triple {14861#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {14861#false} is VALID [2018-11-23 12:30:01,370 INFO L273 TraceCheckUtils]: 111: Hoare triple {14861#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14861#false} is VALID [2018-11-23 12:30:01,370 INFO L273 TraceCheckUtils]: 112: Hoare triple {14861#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14861#false} is VALID [2018-11-23 12:30:01,370 INFO L273 TraceCheckUtils]: 113: Hoare triple {14861#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14861#false} is VALID [2018-11-23 12:30:01,370 INFO L273 TraceCheckUtils]: 114: Hoare triple {14861#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14861#false} is VALID [2018-11-23 12:30:01,370 INFO L273 TraceCheckUtils]: 115: Hoare triple {14861#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14861#false} is VALID [2018-11-23 12:30:01,370 INFO L273 TraceCheckUtils]: 116: Hoare triple {14861#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14861#false} is VALID [2018-11-23 12:30:01,370 INFO L273 TraceCheckUtils]: 117: Hoare triple {14861#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14861#false} is VALID [2018-11-23 12:30:01,370 INFO L273 TraceCheckUtils]: 118: Hoare triple {14861#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14861#false} is VALID [2018-11-23 12:30:01,370 INFO L273 TraceCheckUtils]: 119: Hoare triple {14861#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14861#false} is VALID [2018-11-23 12:30:01,371 INFO L273 TraceCheckUtils]: 120: Hoare triple {14861#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14861#false} is VALID [2018-11-23 12:30:01,371 INFO L273 TraceCheckUtils]: 121: Hoare triple {14861#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14861#false} is VALID [2018-11-23 12:30:01,371 INFO L273 TraceCheckUtils]: 122: Hoare triple {14861#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14861#false} is VALID [2018-11-23 12:30:01,371 INFO L273 TraceCheckUtils]: 123: Hoare triple {14861#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14861#false} is VALID [2018-11-23 12:30:01,371 INFO L273 TraceCheckUtils]: 124: Hoare triple {14861#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14861#false} is VALID [2018-11-23 12:30:01,371 INFO L273 TraceCheckUtils]: 125: Hoare triple {14861#false} assume !(~i~0 < 100000); {14861#false} is VALID [2018-11-23 12:30:01,371 INFO L273 TraceCheckUtils]: 126: Hoare triple {14861#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {14861#false} is VALID [2018-11-23 12:30:01,371 INFO L273 TraceCheckUtils]: 127: Hoare triple {14861#false} assume true; {14861#false} is VALID [2018-11-23 12:30:01,371 INFO L268 TraceCheckUtils]: 128: Hoare quadruple {14861#false} {14861#false} #74#return; {14861#false} is VALID [2018-11-23 12:30:01,371 INFO L273 TraceCheckUtils]: 129: Hoare triple {14861#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {14861#false} is VALID [2018-11-23 12:30:01,372 INFO L273 TraceCheckUtils]: 130: Hoare triple {14861#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {14861#false} is VALID [2018-11-23 12:30:01,372 INFO L273 TraceCheckUtils]: 131: Hoare triple {14861#false} assume !false; {14861#false} is VALID [2018-11-23 12:30:01,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1063 backedges. 234 proven. 36 refuted. 0 times theorem prover too weak. 793 trivial. 0 not checked. [2018-11-23 12:30:01,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:30:01,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 9] total 33 [2018-11-23 12:30:01,423 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 132 [2018-11-23 12:30:01,424 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:30:01,424 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-23 12:30:01,576 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:30:01,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-23 12:30:01,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-23 12:30:01,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=696, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 12:30:01,577 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 33 states. [2018-11-23 12:30:02,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:02,831 INFO L93 Difference]: Finished difference Result 143 states and 152 transitions. [2018-11-23 12:30:02,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-23 12:30:02,831 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 132 [2018-11-23 12:30:02,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:30:02,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:30:02,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 115 transitions. [2018-11-23 12:30:02,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:30:02,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 115 transitions. [2018-11-23 12:30:02,834 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 115 transitions. [2018-11-23 12:30:02,976 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:30:02,978 INFO L225 Difference]: With dead ends: 143 [2018-11-23 12:30:02,978 INFO L226 Difference]: Without dead ends: 101 [2018-11-23 12:30:02,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=360, Invalid=696, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 12:30:02,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-23 12:30:03,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2018-11-23 12:30:03,016 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:30:03,016 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 99 states. [2018-11-23 12:30:03,016 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 99 states. [2018-11-23 12:30:03,017 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 99 states. [2018-11-23 12:30:03,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:03,019 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-11-23 12:30:03,019 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-11-23 12:30:03,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:03,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:03,020 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 101 states. [2018-11-23 12:30:03,020 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 101 states. [2018-11-23 12:30:03,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:03,022 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-11-23 12:30:03,022 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-11-23 12:30:03,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:03,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:03,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:30:03,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:30:03,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-23 12:30:03,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2018-11-23 12:30:03,025 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 132 [2018-11-23 12:30:03,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:30:03,025 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2018-11-23 12:30:03,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-23 12:30:03,025 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2018-11-23 12:30:03,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-23 12:30:03,026 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:30:03,027 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 21, 21, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:30:03,027 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:30:03,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:30:03,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1975206657, now seen corresponding path program 24 times [2018-11-23 12:30:03,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:30:03,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:30:03,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:03,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:30:03,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:03,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:03,543 INFO L256 TraceCheckUtils]: 0: Hoare triple {15849#true} call ULTIMATE.init(); {15849#true} is VALID [2018-11-23 12:30:03,543 INFO L273 TraceCheckUtils]: 1: Hoare triple {15849#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15849#true} is VALID [2018-11-23 12:30:03,543 INFO L273 TraceCheckUtils]: 2: Hoare triple {15849#true} assume true; {15849#true} is VALID [2018-11-23 12:30:03,544 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15849#true} {15849#true} #66#return; {15849#true} is VALID [2018-11-23 12:30:03,544 INFO L256 TraceCheckUtils]: 4: Hoare triple {15849#true} call #t~ret13 := main(); {15849#true} is VALID [2018-11-23 12:30:03,545 INFO L273 TraceCheckUtils]: 5: Hoare triple {15849#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {15851#(= main_~i~1 0)} is VALID [2018-11-23 12:30:03,545 INFO L273 TraceCheckUtils]: 6: Hoare triple {15851#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15851#(= main_~i~1 0)} is VALID [2018-11-23 12:30:03,545 INFO L273 TraceCheckUtils]: 7: Hoare triple {15851#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15852#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:03,546 INFO L273 TraceCheckUtils]: 8: Hoare triple {15852#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15852#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:03,546 INFO L273 TraceCheckUtils]: 9: Hoare triple {15852#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15853#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:03,547 INFO L273 TraceCheckUtils]: 10: Hoare triple {15853#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15853#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:03,547 INFO L273 TraceCheckUtils]: 11: Hoare triple {15853#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15854#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:03,548 INFO L273 TraceCheckUtils]: 12: Hoare triple {15854#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15854#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:03,549 INFO L273 TraceCheckUtils]: 13: Hoare triple {15854#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15855#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:03,549 INFO L273 TraceCheckUtils]: 14: Hoare triple {15855#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15855#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:03,550 INFO L273 TraceCheckUtils]: 15: Hoare triple {15855#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15856#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:03,550 INFO L273 TraceCheckUtils]: 16: Hoare triple {15856#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15856#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:03,551 INFO L273 TraceCheckUtils]: 17: Hoare triple {15856#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15857#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:03,553 INFO L273 TraceCheckUtils]: 18: Hoare triple {15857#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15857#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:03,554 INFO L273 TraceCheckUtils]: 19: Hoare triple {15857#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15858#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:03,554 INFO L273 TraceCheckUtils]: 20: Hoare triple {15858#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15858#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:03,555 INFO L273 TraceCheckUtils]: 21: Hoare triple {15858#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15859#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:03,556 INFO L273 TraceCheckUtils]: 22: Hoare triple {15859#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15859#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:03,556 INFO L273 TraceCheckUtils]: 23: Hoare triple {15859#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15860#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:03,557 INFO L273 TraceCheckUtils]: 24: Hoare triple {15860#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15860#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:03,558 INFO L273 TraceCheckUtils]: 25: Hoare triple {15860#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15861#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:03,558 INFO L273 TraceCheckUtils]: 26: Hoare triple {15861#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15861#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:03,559 INFO L273 TraceCheckUtils]: 27: Hoare triple {15861#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15862#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:03,559 INFO L273 TraceCheckUtils]: 28: Hoare triple {15862#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15862#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:03,560 INFO L273 TraceCheckUtils]: 29: Hoare triple {15862#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15863#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:03,561 INFO L273 TraceCheckUtils]: 30: Hoare triple {15863#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15863#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:03,561 INFO L273 TraceCheckUtils]: 31: Hoare triple {15863#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15864#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:03,562 INFO L273 TraceCheckUtils]: 32: Hoare triple {15864#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15864#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:03,563 INFO L273 TraceCheckUtils]: 33: Hoare triple {15864#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15865#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:03,563 INFO L273 TraceCheckUtils]: 34: Hoare triple {15865#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15865#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:03,564 INFO L273 TraceCheckUtils]: 35: Hoare triple {15865#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15866#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:03,564 INFO L273 TraceCheckUtils]: 36: Hoare triple {15866#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15866#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:03,565 INFO L273 TraceCheckUtils]: 37: Hoare triple {15866#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15867#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:03,566 INFO L273 TraceCheckUtils]: 38: Hoare triple {15867#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15867#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:03,566 INFO L273 TraceCheckUtils]: 39: Hoare triple {15867#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15868#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:03,567 INFO L273 TraceCheckUtils]: 40: Hoare triple {15868#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15868#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:03,568 INFO L273 TraceCheckUtils]: 41: Hoare triple {15868#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15869#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:03,568 INFO L273 TraceCheckUtils]: 42: Hoare triple {15869#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15869#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:03,569 INFO L273 TraceCheckUtils]: 43: Hoare triple {15869#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15870#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:03,569 INFO L273 TraceCheckUtils]: 44: Hoare triple {15870#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15870#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:03,570 INFO L273 TraceCheckUtils]: 45: Hoare triple {15870#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15871#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:03,571 INFO L273 TraceCheckUtils]: 46: Hoare triple {15871#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15871#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:03,571 INFO L273 TraceCheckUtils]: 47: Hoare triple {15871#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15872#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:03,572 INFO L273 TraceCheckUtils]: 48: Hoare triple {15872#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15872#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:03,573 INFO L273 TraceCheckUtils]: 49: Hoare triple {15872#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15873#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:03,573 INFO L273 TraceCheckUtils]: 50: Hoare triple {15873#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15873#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:03,574 INFO L273 TraceCheckUtils]: 51: Hoare triple {15873#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15874#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:03,574 INFO L273 TraceCheckUtils]: 52: Hoare triple {15874#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15874#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:03,575 INFO L273 TraceCheckUtils]: 53: Hoare triple {15874#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15875#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:03,576 INFO L273 TraceCheckUtils]: 54: Hoare triple {15875#(<= main_~i~1 24)} assume !(~i~1 < 100000); {15850#false} is VALID [2018-11-23 12:30:03,576 INFO L256 TraceCheckUtils]: 55: Hoare triple {15850#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {15849#true} is VALID [2018-11-23 12:30:03,576 INFO L273 TraceCheckUtils]: 56: Hoare triple {15849#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {15849#true} is VALID [2018-11-23 12:30:03,576 INFO L273 TraceCheckUtils]: 57: Hoare triple {15849#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15849#true} is VALID [2018-11-23 12:30:03,577 INFO L273 TraceCheckUtils]: 58: Hoare triple {15849#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15849#true} is VALID [2018-11-23 12:30:03,577 INFO L273 TraceCheckUtils]: 59: Hoare triple {15849#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15849#true} is VALID [2018-11-23 12:30:03,577 INFO L273 TraceCheckUtils]: 60: Hoare triple {15849#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15849#true} is VALID [2018-11-23 12:30:03,577 INFO L273 TraceCheckUtils]: 61: Hoare triple {15849#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15849#true} is VALID [2018-11-23 12:30:03,577 INFO L273 TraceCheckUtils]: 62: Hoare triple {15849#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15849#true} is VALID [2018-11-23 12:30:03,578 INFO L273 TraceCheckUtils]: 63: Hoare triple {15849#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15849#true} is VALID [2018-11-23 12:30:03,578 INFO L273 TraceCheckUtils]: 64: Hoare triple {15849#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15849#true} is VALID [2018-11-23 12:30:03,578 INFO L273 TraceCheckUtils]: 65: Hoare triple {15849#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15849#true} is VALID [2018-11-23 12:30:03,578 INFO L273 TraceCheckUtils]: 66: Hoare triple {15849#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15849#true} is VALID [2018-11-23 12:30:03,578 INFO L273 TraceCheckUtils]: 67: Hoare triple {15849#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15849#true} is VALID [2018-11-23 12:30:03,578 INFO L273 TraceCheckUtils]: 68: Hoare triple {15849#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15849#true} is VALID [2018-11-23 12:30:03,579 INFO L273 TraceCheckUtils]: 69: Hoare triple {15849#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15849#true} is VALID [2018-11-23 12:30:03,579 INFO L273 TraceCheckUtils]: 70: Hoare triple {15849#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15849#true} is VALID [2018-11-23 12:30:03,579 INFO L273 TraceCheckUtils]: 71: Hoare triple {15849#true} assume !(~i~0 < 100000); {15849#true} is VALID [2018-11-23 12:30:03,579 INFO L273 TraceCheckUtils]: 72: Hoare triple {15849#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15849#true} is VALID [2018-11-23 12:30:03,579 INFO L273 TraceCheckUtils]: 73: Hoare triple {15849#true} assume true; {15849#true} is VALID [2018-11-23 12:30:03,579 INFO L268 TraceCheckUtils]: 74: Hoare quadruple {15849#true} {15850#false} #70#return; {15850#false} is VALID [2018-11-23 12:30:03,579 INFO L273 TraceCheckUtils]: 75: Hoare triple {15850#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {15850#false} is VALID [2018-11-23 12:30:03,579 INFO L256 TraceCheckUtils]: 76: Hoare triple {15850#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {15849#true} is VALID [2018-11-23 12:30:03,579 INFO L273 TraceCheckUtils]: 77: Hoare triple {15849#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {15849#true} is VALID [2018-11-23 12:30:03,579 INFO L273 TraceCheckUtils]: 78: Hoare triple {15849#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15849#true} is VALID [2018-11-23 12:30:03,580 INFO L273 TraceCheckUtils]: 79: Hoare triple {15849#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15849#true} is VALID [2018-11-23 12:30:03,580 INFO L273 TraceCheckUtils]: 80: Hoare triple {15849#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15849#true} is VALID [2018-11-23 12:30:03,580 INFO L273 TraceCheckUtils]: 81: Hoare triple {15849#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15849#true} is VALID [2018-11-23 12:30:03,580 INFO L273 TraceCheckUtils]: 82: Hoare triple {15849#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15849#true} is VALID [2018-11-23 12:30:03,580 INFO L273 TraceCheckUtils]: 83: Hoare triple {15849#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15849#true} is VALID [2018-11-23 12:30:03,580 INFO L273 TraceCheckUtils]: 84: Hoare triple {15849#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15849#true} is VALID [2018-11-23 12:30:03,580 INFO L273 TraceCheckUtils]: 85: Hoare triple {15849#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15849#true} is VALID [2018-11-23 12:30:03,580 INFO L273 TraceCheckUtils]: 86: Hoare triple {15849#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15849#true} is VALID [2018-11-23 12:30:03,580 INFO L273 TraceCheckUtils]: 87: Hoare triple {15849#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15849#true} is VALID [2018-11-23 12:30:03,581 INFO L273 TraceCheckUtils]: 88: Hoare triple {15849#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15849#true} is VALID [2018-11-23 12:30:03,581 INFO L273 TraceCheckUtils]: 89: Hoare triple {15849#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15849#true} is VALID [2018-11-23 12:30:03,581 INFO L273 TraceCheckUtils]: 90: Hoare triple {15849#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15849#true} is VALID [2018-11-23 12:30:03,581 INFO L273 TraceCheckUtils]: 91: Hoare triple {15849#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15849#true} is VALID [2018-11-23 12:30:03,581 INFO L273 TraceCheckUtils]: 92: Hoare triple {15849#true} assume !(~i~0 < 100000); {15849#true} is VALID [2018-11-23 12:30:03,581 INFO L273 TraceCheckUtils]: 93: Hoare triple {15849#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15849#true} is VALID [2018-11-23 12:30:03,581 INFO L273 TraceCheckUtils]: 94: Hoare triple {15849#true} assume true; {15849#true} is VALID [2018-11-23 12:30:03,582 INFO L268 TraceCheckUtils]: 95: Hoare quadruple {15849#true} {15850#false} #72#return; {15850#false} is VALID [2018-11-23 12:30:03,582 INFO L273 TraceCheckUtils]: 96: Hoare triple {15850#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {15850#false} is VALID [2018-11-23 12:30:03,582 INFO L273 TraceCheckUtils]: 97: Hoare triple {15850#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {15850#false} is VALID [2018-11-23 12:30:03,582 INFO L273 TraceCheckUtils]: 98: Hoare triple {15850#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {15850#false} is VALID [2018-11-23 12:30:03,582 INFO L273 TraceCheckUtils]: 99: Hoare triple {15850#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {15850#false} is VALID [2018-11-23 12:30:03,582 INFO L273 TraceCheckUtils]: 100: Hoare triple {15850#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {15850#false} is VALID [2018-11-23 12:30:03,583 INFO L273 TraceCheckUtils]: 101: Hoare triple {15850#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {15850#false} is VALID [2018-11-23 12:30:03,583 INFO L273 TraceCheckUtils]: 102: Hoare triple {15850#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {15850#false} is VALID [2018-11-23 12:30:03,583 INFO L273 TraceCheckUtils]: 103: Hoare triple {15850#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {15850#false} is VALID [2018-11-23 12:30:03,583 INFO L273 TraceCheckUtils]: 104: Hoare triple {15850#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {15850#false} is VALID [2018-11-23 12:30:03,583 INFO L273 TraceCheckUtils]: 105: Hoare triple {15850#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {15850#false} is VALID [2018-11-23 12:30:03,583 INFO L273 TraceCheckUtils]: 106: Hoare triple {15850#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {15850#false} is VALID [2018-11-23 12:30:03,583 INFO L273 TraceCheckUtils]: 107: Hoare triple {15850#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {15850#false} is VALID [2018-11-23 12:30:03,584 INFO L273 TraceCheckUtils]: 108: Hoare triple {15850#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {15850#false} is VALID [2018-11-23 12:30:03,584 INFO L273 TraceCheckUtils]: 109: Hoare triple {15850#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {15850#false} is VALID [2018-11-23 12:30:03,584 INFO L273 TraceCheckUtils]: 110: Hoare triple {15850#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {15850#false} is VALID [2018-11-23 12:30:03,584 INFO L273 TraceCheckUtils]: 111: Hoare triple {15850#false} assume !(~i~2 < 99999); {15850#false} is VALID [2018-11-23 12:30:03,584 INFO L273 TraceCheckUtils]: 112: Hoare triple {15850#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {15850#false} is VALID [2018-11-23 12:30:03,584 INFO L256 TraceCheckUtils]: 113: Hoare triple {15850#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {15849#true} is VALID [2018-11-23 12:30:03,584 INFO L273 TraceCheckUtils]: 114: Hoare triple {15849#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {15849#true} is VALID [2018-11-23 12:30:03,585 INFO L273 TraceCheckUtils]: 115: Hoare triple {15849#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15849#true} is VALID [2018-11-23 12:30:03,585 INFO L273 TraceCheckUtils]: 116: Hoare triple {15849#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15849#true} is VALID [2018-11-23 12:30:03,585 INFO L273 TraceCheckUtils]: 117: Hoare triple {15849#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15849#true} is VALID [2018-11-23 12:30:03,585 INFO L273 TraceCheckUtils]: 118: Hoare triple {15849#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15849#true} is VALID [2018-11-23 12:30:03,585 INFO L273 TraceCheckUtils]: 119: Hoare triple {15849#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15849#true} is VALID [2018-11-23 12:30:03,585 INFO L273 TraceCheckUtils]: 120: Hoare triple {15849#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15849#true} is VALID [2018-11-23 12:30:03,585 INFO L273 TraceCheckUtils]: 121: Hoare triple {15849#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15849#true} is VALID [2018-11-23 12:30:03,586 INFO L273 TraceCheckUtils]: 122: Hoare triple {15849#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15849#true} is VALID [2018-11-23 12:30:03,586 INFO L273 TraceCheckUtils]: 123: Hoare triple {15849#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15849#true} is VALID [2018-11-23 12:30:03,586 INFO L273 TraceCheckUtils]: 124: Hoare triple {15849#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15849#true} is VALID [2018-11-23 12:30:03,586 INFO L273 TraceCheckUtils]: 125: Hoare triple {15849#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15849#true} is VALID [2018-11-23 12:30:03,586 INFO L273 TraceCheckUtils]: 126: Hoare triple {15849#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15849#true} is VALID [2018-11-23 12:30:03,586 INFO L273 TraceCheckUtils]: 127: Hoare triple {15849#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15849#true} is VALID [2018-11-23 12:30:03,586 INFO L273 TraceCheckUtils]: 128: Hoare triple {15849#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15849#true} is VALID [2018-11-23 12:30:03,586 INFO L273 TraceCheckUtils]: 129: Hoare triple {15849#true} assume !(~i~0 < 100000); {15849#true} is VALID [2018-11-23 12:30:03,586 INFO L273 TraceCheckUtils]: 130: Hoare triple {15849#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15849#true} is VALID [2018-11-23 12:30:03,587 INFO L273 TraceCheckUtils]: 131: Hoare triple {15849#true} assume true; {15849#true} is VALID [2018-11-23 12:30:03,587 INFO L268 TraceCheckUtils]: 132: Hoare quadruple {15849#true} {15850#false} #74#return; {15850#false} is VALID [2018-11-23 12:30:03,587 INFO L273 TraceCheckUtils]: 133: Hoare triple {15850#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {15850#false} is VALID [2018-11-23 12:30:03,587 INFO L273 TraceCheckUtils]: 134: Hoare triple {15850#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {15850#false} is VALID [2018-11-23 12:30:03,587 INFO L273 TraceCheckUtils]: 135: Hoare triple {15850#false} assume !false; {15850#false} is VALID [2018-11-23 12:30:03,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1123 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2018-11-23 12:30:03,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:30:03,596 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 12:30:03,604 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:30:04,314 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2018-11-23 12:30:04,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:30:04,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:04,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:30:05,207 INFO L256 TraceCheckUtils]: 0: Hoare triple {15849#true} call ULTIMATE.init(); {15849#true} is VALID [2018-11-23 12:30:05,208 INFO L273 TraceCheckUtils]: 1: Hoare triple {15849#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15849#true} is VALID [2018-11-23 12:30:05,208 INFO L273 TraceCheckUtils]: 2: Hoare triple {15849#true} assume true; {15849#true} is VALID [2018-11-23 12:30:05,208 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15849#true} {15849#true} #66#return; {15849#true} is VALID [2018-11-23 12:30:05,208 INFO L256 TraceCheckUtils]: 4: Hoare triple {15849#true} call #t~ret13 := main(); {15849#true} is VALID [2018-11-23 12:30:05,209 INFO L273 TraceCheckUtils]: 5: Hoare triple {15849#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {15849#true} is VALID [2018-11-23 12:30:05,209 INFO L273 TraceCheckUtils]: 6: Hoare triple {15849#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15849#true} is VALID [2018-11-23 12:30:05,209 INFO L273 TraceCheckUtils]: 7: Hoare triple {15849#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15849#true} is VALID [2018-11-23 12:30:05,209 INFO L273 TraceCheckUtils]: 8: Hoare triple {15849#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15849#true} is VALID [2018-11-23 12:30:05,209 INFO L273 TraceCheckUtils]: 9: Hoare triple {15849#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15849#true} is VALID [2018-11-23 12:30:05,209 INFO L273 TraceCheckUtils]: 10: Hoare triple {15849#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15849#true} is VALID [2018-11-23 12:30:05,210 INFO L273 TraceCheckUtils]: 11: Hoare triple {15849#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15849#true} is VALID [2018-11-23 12:30:05,210 INFO L273 TraceCheckUtils]: 12: Hoare triple {15849#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15849#true} is VALID [2018-11-23 12:30:05,210 INFO L273 TraceCheckUtils]: 13: Hoare triple {15849#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15849#true} is VALID [2018-11-23 12:30:05,210 INFO L273 TraceCheckUtils]: 14: Hoare triple {15849#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15849#true} is VALID [2018-11-23 12:30:05,210 INFO L273 TraceCheckUtils]: 15: Hoare triple {15849#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15849#true} is VALID [2018-11-23 12:30:05,210 INFO L273 TraceCheckUtils]: 16: Hoare triple {15849#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15849#true} is VALID [2018-11-23 12:30:05,210 INFO L273 TraceCheckUtils]: 17: Hoare triple {15849#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15849#true} is VALID [2018-11-23 12:30:05,210 INFO L273 TraceCheckUtils]: 18: Hoare triple {15849#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15849#true} is VALID [2018-11-23 12:30:05,210 INFO L273 TraceCheckUtils]: 19: Hoare triple {15849#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15849#true} is VALID [2018-11-23 12:30:05,211 INFO L273 TraceCheckUtils]: 20: Hoare triple {15849#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15849#true} is VALID [2018-11-23 12:30:05,211 INFO L273 TraceCheckUtils]: 21: Hoare triple {15849#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15849#true} is VALID [2018-11-23 12:30:05,211 INFO L273 TraceCheckUtils]: 22: Hoare triple {15849#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15849#true} is VALID [2018-11-23 12:30:05,211 INFO L273 TraceCheckUtils]: 23: Hoare triple {15849#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15849#true} is VALID [2018-11-23 12:30:05,211 INFO L273 TraceCheckUtils]: 24: Hoare triple {15849#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15849#true} is VALID [2018-11-23 12:30:05,211 INFO L273 TraceCheckUtils]: 25: Hoare triple {15849#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15849#true} is VALID [2018-11-23 12:30:05,211 INFO L273 TraceCheckUtils]: 26: Hoare triple {15849#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15849#true} is VALID [2018-11-23 12:30:05,211 INFO L273 TraceCheckUtils]: 27: Hoare triple {15849#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15849#true} is VALID [2018-11-23 12:30:05,211 INFO L273 TraceCheckUtils]: 28: Hoare triple {15849#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15849#true} is VALID [2018-11-23 12:30:05,211 INFO L273 TraceCheckUtils]: 29: Hoare triple {15849#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15849#true} is VALID [2018-11-23 12:30:05,212 INFO L273 TraceCheckUtils]: 30: Hoare triple {15849#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15849#true} is VALID [2018-11-23 12:30:05,212 INFO L273 TraceCheckUtils]: 31: Hoare triple {15849#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15849#true} is VALID [2018-11-23 12:30:05,212 INFO L273 TraceCheckUtils]: 32: Hoare triple {15849#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15849#true} is VALID [2018-11-23 12:30:05,212 INFO L273 TraceCheckUtils]: 33: Hoare triple {15849#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15849#true} is VALID [2018-11-23 12:30:05,212 INFO L273 TraceCheckUtils]: 34: Hoare triple {15849#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15849#true} is VALID [2018-11-23 12:30:05,212 INFO L273 TraceCheckUtils]: 35: Hoare triple {15849#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15849#true} is VALID [2018-11-23 12:30:05,212 INFO L273 TraceCheckUtils]: 36: Hoare triple {15849#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15849#true} is VALID [2018-11-23 12:30:05,212 INFO L273 TraceCheckUtils]: 37: Hoare triple {15849#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15849#true} is VALID [2018-11-23 12:30:05,212 INFO L273 TraceCheckUtils]: 38: Hoare triple {15849#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15849#true} is VALID [2018-11-23 12:30:05,213 INFO L273 TraceCheckUtils]: 39: Hoare triple {15849#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15849#true} is VALID [2018-11-23 12:30:05,213 INFO L273 TraceCheckUtils]: 40: Hoare triple {15849#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15849#true} is VALID [2018-11-23 12:30:05,213 INFO L273 TraceCheckUtils]: 41: Hoare triple {15849#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15849#true} is VALID [2018-11-23 12:30:05,213 INFO L273 TraceCheckUtils]: 42: Hoare triple {15849#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15849#true} is VALID [2018-11-23 12:30:05,213 INFO L273 TraceCheckUtils]: 43: Hoare triple {15849#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15849#true} is VALID [2018-11-23 12:30:05,213 INFO L273 TraceCheckUtils]: 44: Hoare triple {15849#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15849#true} is VALID [2018-11-23 12:30:05,213 INFO L273 TraceCheckUtils]: 45: Hoare triple {15849#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15849#true} is VALID [2018-11-23 12:30:05,213 INFO L273 TraceCheckUtils]: 46: Hoare triple {15849#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15849#true} is VALID [2018-11-23 12:30:05,213 INFO L273 TraceCheckUtils]: 47: Hoare triple {15849#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15849#true} is VALID [2018-11-23 12:30:05,213 INFO L273 TraceCheckUtils]: 48: Hoare triple {15849#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15849#true} is VALID [2018-11-23 12:30:05,214 INFO L273 TraceCheckUtils]: 49: Hoare triple {15849#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15849#true} is VALID [2018-11-23 12:30:05,214 INFO L273 TraceCheckUtils]: 50: Hoare triple {15849#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15849#true} is VALID [2018-11-23 12:30:05,214 INFO L273 TraceCheckUtils]: 51: Hoare triple {15849#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15849#true} is VALID [2018-11-23 12:30:05,214 INFO L273 TraceCheckUtils]: 52: Hoare triple {15849#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15849#true} is VALID [2018-11-23 12:30:05,214 INFO L273 TraceCheckUtils]: 53: Hoare triple {15849#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15849#true} is VALID [2018-11-23 12:30:05,214 INFO L273 TraceCheckUtils]: 54: Hoare triple {15849#true} assume !(~i~1 < 100000); {15849#true} is VALID [2018-11-23 12:30:05,214 INFO L256 TraceCheckUtils]: 55: Hoare triple {15849#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {15849#true} is VALID [2018-11-23 12:30:05,214 INFO L273 TraceCheckUtils]: 56: Hoare triple {15849#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {15849#true} is VALID [2018-11-23 12:30:05,214 INFO L273 TraceCheckUtils]: 57: Hoare triple {15849#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15849#true} is VALID [2018-11-23 12:30:05,215 INFO L273 TraceCheckUtils]: 58: Hoare triple {15849#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15849#true} is VALID [2018-11-23 12:30:05,215 INFO L273 TraceCheckUtils]: 59: Hoare triple {15849#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15849#true} is VALID [2018-11-23 12:30:05,215 INFO L273 TraceCheckUtils]: 60: Hoare triple {15849#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15849#true} is VALID [2018-11-23 12:30:05,215 INFO L273 TraceCheckUtils]: 61: Hoare triple {15849#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15849#true} is VALID [2018-11-23 12:30:05,215 INFO L273 TraceCheckUtils]: 62: Hoare triple {15849#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15849#true} is VALID [2018-11-23 12:30:05,215 INFO L273 TraceCheckUtils]: 63: Hoare triple {15849#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15849#true} is VALID [2018-11-23 12:30:05,215 INFO L273 TraceCheckUtils]: 64: Hoare triple {15849#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15849#true} is VALID [2018-11-23 12:30:05,215 INFO L273 TraceCheckUtils]: 65: Hoare triple {15849#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15849#true} is VALID [2018-11-23 12:30:05,215 INFO L273 TraceCheckUtils]: 66: Hoare triple {15849#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15849#true} is VALID [2018-11-23 12:30:05,216 INFO L273 TraceCheckUtils]: 67: Hoare triple {15849#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15849#true} is VALID [2018-11-23 12:30:05,216 INFO L273 TraceCheckUtils]: 68: Hoare triple {15849#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15849#true} is VALID [2018-11-23 12:30:05,216 INFO L273 TraceCheckUtils]: 69: Hoare triple {15849#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15849#true} is VALID [2018-11-23 12:30:05,216 INFO L273 TraceCheckUtils]: 70: Hoare triple {15849#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15849#true} is VALID [2018-11-23 12:30:05,216 INFO L273 TraceCheckUtils]: 71: Hoare triple {15849#true} assume !(~i~0 < 100000); {15849#true} is VALID [2018-11-23 12:30:05,216 INFO L273 TraceCheckUtils]: 72: Hoare triple {15849#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15849#true} is VALID [2018-11-23 12:30:05,216 INFO L273 TraceCheckUtils]: 73: Hoare triple {15849#true} assume true; {15849#true} is VALID [2018-11-23 12:30:05,216 INFO L268 TraceCheckUtils]: 74: Hoare quadruple {15849#true} {15849#true} #70#return; {15849#true} is VALID [2018-11-23 12:30:05,216 INFO L273 TraceCheckUtils]: 75: Hoare triple {15849#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {15849#true} is VALID [2018-11-23 12:30:05,216 INFO L256 TraceCheckUtils]: 76: Hoare triple {15849#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {15849#true} is VALID [2018-11-23 12:30:05,217 INFO L273 TraceCheckUtils]: 77: Hoare triple {15849#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {15849#true} is VALID [2018-11-23 12:30:05,217 INFO L273 TraceCheckUtils]: 78: Hoare triple {15849#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15849#true} is VALID [2018-11-23 12:30:05,217 INFO L273 TraceCheckUtils]: 79: Hoare triple {15849#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15849#true} is VALID [2018-11-23 12:30:05,217 INFO L273 TraceCheckUtils]: 80: Hoare triple {15849#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15849#true} is VALID [2018-11-23 12:30:05,217 INFO L273 TraceCheckUtils]: 81: Hoare triple {15849#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15849#true} is VALID [2018-11-23 12:30:05,217 INFO L273 TraceCheckUtils]: 82: Hoare triple {15849#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15849#true} is VALID [2018-11-23 12:30:05,217 INFO L273 TraceCheckUtils]: 83: Hoare triple {15849#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15849#true} is VALID [2018-11-23 12:30:05,217 INFO L273 TraceCheckUtils]: 84: Hoare triple {15849#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15849#true} is VALID [2018-11-23 12:30:05,217 INFO L273 TraceCheckUtils]: 85: Hoare triple {15849#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15849#true} is VALID [2018-11-23 12:30:05,218 INFO L273 TraceCheckUtils]: 86: Hoare triple {15849#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15849#true} is VALID [2018-11-23 12:30:05,218 INFO L273 TraceCheckUtils]: 87: Hoare triple {15849#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15849#true} is VALID [2018-11-23 12:30:05,218 INFO L273 TraceCheckUtils]: 88: Hoare triple {15849#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15849#true} is VALID [2018-11-23 12:30:05,218 INFO L273 TraceCheckUtils]: 89: Hoare triple {15849#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15849#true} is VALID [2018-11-23 12:30:05,218 INFO L273 TraceCheckUtils]: 90: Hoare triple {15849#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15849#true} is VALID [2018-11-23 12:30:05,218 INFO L273 TraceCheckUtils]: 91: Hoare triple {15849#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15849#true} is VALID [2018-11-23 12:30:05,218 INFO L273 TraceCheckUtils]: 92: Hoare triple {15849#true} assume !(~i~0 < 100000); {15849#true} is VALID [2018-11-23 12:30:05,218 INFO L273 TraceCheckUtils]: 93: Hoare triple {15849#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15849#true} is VALID [2018-11-23 12:30:05,218 INFO L273 TraceCheckUtils]: 94: Hoare triple {15849#true} assume true; {15849#true} is VALID [2018-11-23 12:30:05,219 INFO L268 TraceCheckUtils]: 95: Hoare quadruple {15849#true} {15849#true} #72#return; {15849#true} is VALID [2018-11-23 12:30:05,219 INFO L273 TraceCheckUtils]: 96: Hoare triple {15849#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {15849#true} is VALID [2018-11-23 12:30:05,219 INFO L273 TraceCheckUtils]: 97: Hoare triple {15849#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {15849#true} is VALID [2018-11-23 12:30:05,219 INFO L273 TraceCheckUtils]: 98: Hoare triple {15849#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {15849#true} is VALID [2018-11-23 12:30:05,219 INFO L273 TraceCheckUtils]: 99: Hoare triple {15849#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {15849#true} is VALID [2018-11-23 12:30:05,219 INFO L273 TraceCheckUtils]: 100: Hoare triple {15849#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {15849#true} is VALID [2018-11-23 12:30:05,219 INFO L273 TraceCheckUtils]: 101: Hoare triple {15849#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {15849#true} is VALID [2018-11-23 12:30:05,219 INFO L273 TraceCheckUtils]: 102: Hoare triple {15849#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {15849#true} is VALID [2018-11-23 12:30:05,219 INFO L273 TraceCheckUtils]: 103: Hoare triple {15849#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {15849#true} is VALID [2018-11-23 12:30:05,219 INFO L273 TraceCheckUtils]: 104: Hoare triple {15849#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {15849#true} is VALID [2018-11-23 12:30:05,220 INFO L273 TraceCheckUtils]: 105: Hoare triple {15849#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {15849#true} is VALID [2018-11-23 12:30:05,220 INFO L273 TraceCheckUtils]: 106: Hoare triple {15849#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {15849#true} is VALID [2018-11-23 12:30:05,220 INFO L273 TraceCheckUtils]: 107: Hoare triple {15849#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {15849#true} is VALID [2018-11-23 12:30:05,220 INFO L273 TraceCheckUtils]: 108: Hoare triple {15849#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {15849#true} is VALID [2018-11-23 12:30:05,220 INFO L273 TraceCheckUtils]: 109: Hoare triple {15849#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {15849#true} is VALID [2018-11-23 12:30:05,220 INFO L273 TraceCheckUtils]: 110: Hoare triple {15849#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {15849#true} is VALID [2018-11-23 12:30:05,220 INFO L273 TraceCheckUtils]: 111: Hoare triple {15849#true} assume !(~i~2 < 99999); {15849#true} is VALID [2018-11-23 12:30:05,220 INFO L273 TraceCheckUtils]: 112: Hoare triple {15849#true} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {15849#true} is VALID [2018-11-23 12:30:05,220 INFO L256 TraceCheckUtils]: 113: Hoare triple {15849#true} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {15849#true} is VALID [2018-11-23 12:30:05,221 INFO L273 TraceCheckUtils]: 114: Hoare triple {15849#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {16221#(<= xor_~i~0 1)} is VALID [2018-11-23 12:30:05,221 INFO L273 TraceCheckUtils]: 115: Hoare triple {16221#(<= xor_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16221#(<= xor_~i~0 1)} is VALID [2018-11-23 12:30:05,222 INFO L273 TraceCheckUtils]: 116: Hoare triple {16221#(<= xor_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16228#(<= xor_~i~0 2)} is VALID [2018-11-23 12:30:05,222 INFO L273 TraceCheckUtils]: 117: Hoare triple {16228#(<= xor_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16228#(<= xor_~i~0 2)} is VALID [2018-11-23 12:30:05,223 INFO L273 TraceCheckUtils]: 118: Hoare triple {16228#(<= xor_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16235#(<= xor_~i~0 3)} is VALID [2018-11-23 12:30:05,223 INFO L273 TraceCheckUtils]: 119: Hoare triple {16235#(<= xor_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16235#(<= xor_~i~0 3)} is VALID [2018-11-23 12:30:05,223 INFO L273 TraceCheckUtils]: 120: Hoare triple {16235#(<= xor_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16242#(<= xor_~i~0 4)} is VALID [2018-11-23 12:30:05,224 INFO L273 TraceCheckUtils]: 121: Hoare triple {16242#(<= xor_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16242#(<= xor_~i~0 4)} is VALID [2018-11-23 12:30:05,224 INFO L273 TraceCheckUtils]: 122: Hoare triple {16242#(<= xor_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16249#(<= xor_~i~0 5)} is VALID [2018-11-23 12:30:05,224 INFO L273 TraceCheckUtils]: 123: Hoare triple {16249#(<= xor_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16249#(<= xor_~i~0 5)} is VALID [2018-11-23 12:30:05,225 INFO L273 TraceCheckUtils]: 124: Hoare triple {16249#(<= xor_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16256#(<= xor_~i~0 6)} is VALID [2018-11-23 12:30:05,226 INFO L273 TraceCheckUtils]: 125: Hoare triple {16256#(<= xor_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16256#(<= xor_~i~0 6)} is VALID [2018-11-23 12:30:05,226 INFO L273 TraceCheckUtils]: 126: Hoare triple {16256#(<= xor_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16263#(<= xor_~i~0 7)} is VALID [2018-11-23 12:30:05,227 INFO L273 TraceCheckUtils]: 127: Hoare triple {16263#(<= xor_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16263#(<= xor_~i~0 7)} is VALID [2018-11-23 12:30:05,228 INFO L273 TraceCheckUtils]: 128: Hoare triple {16263#(<= xor_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16270#(<= xor_~i~0 8)} is VALID [2018-11-23 12:30:05,228 INFO L273 TraceCheckUtils]: 129: Hoare triple {16270#(<= xor_~i~0 8)} assume !(~i~0 < 100000); {15850#false} is VALID [2018-11-23 12:30:05,228 INFO L273 TraceCheckUtils]: 130: Hoare triple {15850#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15850#false} is VALID [2018-11-23 12:30:05,229 INFO L273 TraceCheckUtils]: 131: Hoare triple {15850#false} assume true; {15850#false} is VALID [2018-11-23 12:30:05,229 INFO L268 TraceCheckUtils]: 132: Hoare quadruple {15850#false} {15849#true} #74#return; {15850#false} is VALID [2018-11-23 12:30:05,229 INFO L273 TraceCheckUtils]: 133: Hoare triple {15850#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {15850#false} is VALID [2018-11-23 12:30:05,229 INFO L273 TraceCheckUtils]: 134: Hoare triple {15850#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {15850#false} is VALID [2018-11-23 12:30:05,229 INFO L273 TraceCheckUtils]: 135: Hoare triple {15850#false} assume !false; {15850#false} is VALID [2018-11-23 12:30:05,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1123 backedges. 232 proven. 49 refuted. 0 times theorem prover too weak. 842 trivial. 0 not checked. [2018-11-23 12:30:05,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:30:05,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 10] total 35 [2018-11-23 12:30:05,258 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 136 [2018-11-23 12:30:05,258 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:30:05,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-23 12:30:05,893 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:30:05,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-23 12:30:05,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-23 12:30:05,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=795, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:30:05,895 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand 35 states. [2018-11-23 12:30:06,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:06,425 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2018-11-23 12:30:06,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 12:30:06,425 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 136 [2018-11-23 12:30:06,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:30:06,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:30:06,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 122 transitions. [2018-11-23 12:30:06,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:30:06,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 122 transitions. [2018-11-23 12:30:06,428 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 122 transitions. [2018-11-23 12:30:06,595 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:30:06,596 INFO L225 Difference]: With dead ends: 149 [2018-11-23 12:30:06,596 INFO L226 Difference]: Without dead ends: 105 [2018-11-23 12:30:06,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=395, Invalid=795, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:30:06,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-23 12:30:06,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-11-23 12:30:06,664 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:30:06,664 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand 103 states. [2018-11-23 12:30:06,664 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 103 states. [2018-11-23 12:30:06,664 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 103 states. [2018-11-23 12:30:06,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:06,666 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2018-11-23 12:30:06,666 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-11-23 12:30:06,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:06,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:06,667 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 105 states. [2018-11-23 12:30:06,667 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 105 states. [2018-11-23 12:30:06,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:06,669 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2018-11-23 12:30:06,669 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-11-23 12:30:06,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:06,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:06,670 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:30:06,670 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:30:06,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-23 12:30:06,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2018-11-23 12:30:06,672 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 136 [2018-11-23 12:30:06,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:30:06,672 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2018-11-23 12:30:06,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-23 12:30:06,673 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2018-11-23 12:30:06,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-23 12:30:06,674 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:30:06,674 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:30:06,674 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:30:06,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:30:06,674 INFO L82 PathProgramCache]: Analyzing trace with hash -702773313, now seen corresponding path program 25 times [2018-11-23 12:30:06,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:30:06,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:30:06,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:06,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:30:06,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:06,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:07,559 INFO L256 TraceCheckUtils]: 0: Hoare triple {16875#true} call ULTIMATE.init(); {16875#true} is VALID [2018-11-23 12:30:07,560 INFO L273 TraceCheckUtils]: 1: Hoare triple {16875#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16875#true} is VALID [2018-11-23 12:30:07,560 INFO L273 TraceCheckUtils]: 2: Hoare triple {16875#true} assume true; {16875#true} is VALID [2018-11-23 12:30:07,560 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16875#true} {16875#true} #66#return; {16875#true} is VALID [2018-11-23 12:30:07,560 INFO L256 TraceCheckUtils]: 4: Hoare triple {16875#true} call #t~ret13 := main(); {16875#true} is VALID [2018-11-23 12:30:07,573 INFO L273 TraceCheckUtils]: 5: Hoare triple {16875#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {16877#(= main_~i~1 0)} is VALID [2018-11-23 12:30:07,574 INFO L273 TraceCheckUtils]: 6: Hoare triple {16877#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16877#(= main_~i~1 0)} is VALID [2018-11-23 12:30:07,574 INFO L273 TraceCheckUtils]: 7: Hoare triple {16877#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16878#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:07,574 INFO L273 TraceCheckUtils]: 8: Hoare triple {16878#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16878#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:07,575 INFO L273 TraceCheckUtils]: 9: Hoare triple {16878#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16879#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:07,575 INFO L273 TraceCheckUtils]: 10: Hoare triple {16879#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16879#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:07,576 INFO L273 TraceCheckUtils]: 11: Hoare triple {16879#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16880#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:07,576 INFO L273 TraceCheckUtils]: 12: Hoare triple {16880#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16880#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:07,576 INFO L273 TraceCheckUtils]: 13: Hoare triple {16880#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16881#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:07,577 INFO L273 TraceCheckUtils]: 14: Hoare triple {16881#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16881#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:07,577 INFO L273 TraceCheckUtils]: 15: Hoare triple {16881#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16882#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:07,578 INFO L273 TraceCheckUtils]: 16: Hoare triple {16882#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16882#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:07,578 INFO L273 TraceCheckUtils]: 17: Hoare triple {16882#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16883#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:07,579 INFO L273 TraceCheckUtils]: 18: Hoare triple {16883#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16883#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:07,580 INFO L273 TraceCheckUtils]: 19: Hoare triple {16883#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16884#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:07,580 INFO L273 TraceCheckUtils]: 20: Hoare triple {16884#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16884#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:07,581 INFO L273 TraceCheckUtils]: 21: Hoare triple {16884#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16885#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:07,582 INFO L273 TraceCheckUtils]: 22: Hoare triple {16885#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16885#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:07,582 INFO L273 TraceCheckUtils]: 23: Hoare triple {16885#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16886#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:07,583 INFO L273 TraceCheckUtils]: 24: Hoare triple {16886#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16886#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:07,584 INFO L273 TraceCheckUtils]: 25: Hoare triple {16886#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16887#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:07,584 INFO L273 TraceCheckUtils]: 26: Hoare triple {16887#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16887#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:07,585 INFO L273 TraceCheckUtils]: 27: Hoare triple {16887#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16888#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:07,585 INFO L273 TraceCheckUtils]: 28: Hoare triple {16888#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16888#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:07,586 INFO L273 TraceCheckUtils]: 29: Hoare triple {16888#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16889#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:07,587 INFO L273 TraceCheckUtils]: 30: Hoare triple {16889#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16889#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:07,587 INFO L273 TraceCheckUtils]: 31: Hoare triple {16889#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16890#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:07,588 INFO L273 TraceCheckUtils]: 32: Hoare triple {16890#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16890#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:07,589 INFO L273 TraceCheckUtils]: 33: Hoare triple {16890#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16891#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:07,589 INFO L273 TraceCheckUtils]: 34: Hoare triple {16891#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16891#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:07,590 INFO L273 TraceCheckUtils]: 35: Hoare triple {16891#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16892#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:07,590 INFO L273 TraceCheckUtils]: 36: Hoare triple {16892#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16892#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:07,591 INFO L273 TraceCheckUtils]: 37: Hoare triple {16892#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16893#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:07,592 INFO L273 TraceCheckUtils]: 38: Hoare triple {16893#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16893#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:07,592 INFO L273 TraceCheckUtils]: 39: Hoare triple {16893#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16894#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:07,593 INFO L273 TraceCheckUtils]: 40: Hoare triple {16894#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16894#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:07,594 INFO L273 TraceCheckUtils]: 41: Hoare triple {16894#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16895#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:07,594 INFO L273 TraceCheckUtils]: 42: Hoare triple {16895#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16895#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:07,595 INFO L273 TraceCheckUtils]: 43: Hoare triple {16895#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16896#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:07,596 INFO L273 TraceCheckUtils]: 44: Hoare triple {16896#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16896#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:07,596 INFO L273 TraceCheckUtils]: 45: Hoare triple {16896#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16897#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:07,597 INFO L273 TraceCheckUtils]: 46: Hoare triple {16897#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16897#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:07,598 INFO L273 TraceCheckUtils]: 47: Hoare triple {16897#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16898#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:07,598 INFO L273 TraceCheckUtils]: 48: Hoare triple {16898#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16898#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:07,599 INFO L273 TraceCheckUtils]: 49: Hoare triple {16898#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16899#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:07,599 INFO L273 TraceCheckUtils]: 50: Hoare triple {16899#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16899#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:07,600 INFO L273 TraceCheckUtils]: 51: Hoare triple {16899#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16900#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:07,601 INFO L273 TraceCheckUtils]: 52: Hoare triple {16900#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16900#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:07,601 INFO L273 TraceCheckUtils]: 53: Hoare triple {16900#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16901#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:07,602 INFO L273 TraceCheckUtils]: 54: Hoare triple {16901#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16901#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:07,603 INFO L273 TraceCheckUtils]: 55: Hoare triple {16901#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16902#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:07,603 INFO L273 TraceCheckUtils]: 56: Hoare triple {16902#(<= main_~i~1 25)} assume !(~i~1 < 100000); {16876#false} is VALID [2018-11-23 12:30:07,603 INFO L256 TraceCheckUtils]: 57: Hoare triple {16876#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {16875#true} is VALID [2018-11-23 12:30:07,604 INFO L273 TraceCheckUtils]: 58: Hoare triple {16875#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {16875#true} is VALID [2018-11-23 12:30:07,604 INFO L273 TraceCheckUtils]: 59: Hoare triple {16875#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16875#true} is VALID [2018-11-23 12:30:07,604 INFO L273 TraceCheckUtils]: 60: Hoare triple {16875#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16875#true} is VALID [2018-11-23 12:30:07,604 INFO L273 TraceCheckUtils]: 61: Hoare triple {16875#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16875#true} is VALID [2018-11-23 12:30:07,604 INFO L273 TraceCheckUtils]: 62: Hoare triple {16875#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16875#true} is VALID [2018-11-23 12:30:07,605 INFO L273 TraceCheckUtils]: 63: Hoare triple {16875#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16875#true} is VALID [2018-11-23 12:30:07,605 INFO L273 TraceCheckUtils]: 64: Hoare triple {16875#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16875#true} is VALID [2018-11-23 12:30:07,605 INFO L273 TraceCheckUtils]: 65: Hoare triple {16875#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16875#true} is VALID [2018-11-23 12:30:07,605 INFO L273 TraceCheckUtils]: 66: Hoare triple {16875#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16875#true} is VALID [2018-11-23 12:30:07,605 INFO L273 TraceCheckUtils]: 67: Hoare triple {16875#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16875#true} is VALID [2018-11-23 12:30:07,606 INFO L273 TraceCheckUtils]: 68: Hoare triple {16875#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16875#true} is VALID [2018-11-23 12:30:07,606 INFO L273 TraceCheckUtils]: 69: Hoare triple {16875#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16875#true} is VALID [2018-11-23 12:30:07,606 INFO L273 TraceCheckUtils]: 70: Hoare triple {16875#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16875#true} is VALID [2018-11-23 12:30:07,606 INFO L273 TraceCheckUtils]: 71: Hoare triple {16875#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16875#true} is VALID [2018-11-23 12:30:07,606 INFO L273 TraceCheckUtils]: 72: Hoare triple {16875#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16875#true} is VALID [2018-11-23 12:30:07,606 INFO L273 TraceCheckUtils]: 73: Hoare triple {16875#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16875#true} is VALID [2018-11-23 12:30:07,606 INFO L273 TraceCheckUtils]: 74: Hoare triple {16875#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16875#true} is VALID [2018-11-23 12:30:07,606 INFO L273 TraceCheckUtils]: 75: Hoare triple {16875#true} assume !(~i~0 < 100000); {16875#true} is VALID [2018-11-23 12:30:07,606 INFO L273 TraceCheckUtils]: 76: Hoare triple {16875#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {16875#true} is VALID [2018-11-23 12:30:07,607 INFO L273 TraceCheckUtils]: 77: Hoare triple {16875#true} assume true; {16875#true} is VALID [2018-11-23 12:30:07,607 INFO L268 TraceCheckUtils]: 78: Hoare quadruple {16875#true} {16876#false} #70#return; {16876#false} is VALID [2018-11-23 12:30:07,607 INFO L273 TraceCheckUtils]: 79: Hoare triple {16876#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {16876#false} is VALID [2018-11-23 12:30:07,607 INFO L256 TraceCheckUtils]: 80: Hoare triple {16876#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {16875#true} is VALID [2018-11-23 12:30:07,607 INFO L273 TraceCheckUtils]: 81: Hoare triple {16875#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {16875#true} is VALID [2018-11-23 12:30:07,607 INFO L273 TraceCheckUtils]: 82: Hoare triple {16875#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16875#true} is VALID [2018-11-23 12:30:07,607 INFO L273 TraceCheckUtils]: 83: Hoare triple {16875#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16875#true} is VALID [2018-11-23 12:30:07,607 INFO L273 TraceCheckUtils]: 84: Hoare triple {16875#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16875#true} is VALID [2018-11-23 12:30:07,607 INFO L273 TraceCheckUtils]: 85: Hoare triple {16875#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16875#true} is VALID [2018-11-23 12:30:07,608 INFO L273 TraceCheckUtils]: 86: Hoare triple {16875#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16875#true} is VALID [2018-11-23 12:30:07,608 INFO L273 TraceCheckUtils]: 87: Hoare triple {16875#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16875#true} is VALID [2018-11-23 12:30:07,608 INFO L273 TraceCheckUtils]: 88: Hoare triple {16875#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16875#true} is VALID [2018-11-23 12:30:07,608 INFO L273 TraceCheckUtils]: 89: Hoare triple {16875#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16875#true} is VALID [2018-11-23 12:30:07,608 INFO L273 TraceCheckUtils]: 90: Hoare triple {16875#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16875#true} is VALID [2018-11-23 12:30:07,608 INFO L273 TraceCheckUtils]: 91: Hoare triple {16875#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16875#true} is VALID [2018-11-23 12:30:07,608 INFO L273 TraceCheckUtils]: 92: Hoare triple {16875#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16875#true} is VALID [2018-11-23 12:30:07,608 INFO L273 TraceCheckUtils]: 93: Hoare triple {16875#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16875#true} is VALID [2018-11-23 12:30:07,608 INFO L273 TraceCheckUtils]: 94: Hoare triple {16875#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16875#true} is VALID [2018-11-23 12:30:07,609 INFO L273 TraceCheckUtils]: 95: Hoare triple {16875#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16875#true} is VALID [2018-11-23 12:30:07,609 INFO L273 TraceCheckUtils]: 96: Hoare triple {16875#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16875#true} is VALID [2018-11-23 12:30:07,609 INFO L273 TraceCheckUtils]: 97: Hoare triple {16875#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16875#true} is VALID [2018-11-23 12:30:07,609 INFO L273 TraceCheckUtils]: 98: Hoare triple {16875#true} assume !(~i~0 < 100000); {16875#true} is VALID [2018-11-23 12:30:07,609 INFO L273 TraceCheckUtils]: 99: Hoare triple {16875#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {16875#true} is VALID [2018-11-23 12:30:07,609 INFO L273 TraceCheckUtils]: 100: Hoare triple {16875#true} assume true; {16875#true} is VALID [2018-11-23 12:30:07,609 INFO L268 TraceCheckUtils]: 101: Hoare quadruple {16875#true} {16876#false} #72#return; {16876#false} is VALID [2018-11-23 12:30:07,609 INFO L273 TraceCheckUtils]: 102: Hoare triple {16876#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {16876#false} is VALID [2018-11-23 12:30:07,609 INFO L273 TraceCheckUtils]: 103: Hoare triple {16876#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16876#false} is VALID [2018-11-23 12:30:07,610 INFO L273 TraceCheckUtils]: 104: Hoare triple {16876#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16876#false} is VALID [2018-11-23 12:30:07,610 INFO L273 TraceCheckUtils]: 105: Hoare triple {16876#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16876#false} is VALID [2018-11-23 12:30:07,610 INFO L273 TraceCheckUtils]: 106: Hoare triple {16876#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16876#false} is VALID [2018-11-23 12:30:07,610 INFO L273 TraceCheckUtils]: 107: Hoare triple {16876#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16876#false} is VALID [2018-11-23 12:30:07,610 INFO L273 TraceCheckUtils]: 108: Hoare triple {16876#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16876#false} is VALID [2018-11-23 12:30:07,610 INFO L273 TraceCheckUtils]: 109: Hoare triple {16876#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16876#false} is VALID [2018-11-23 12:30:07,610 INFO L273 TraceCheckUtils]: 110: Hoare triple {16876#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16876#false} is VALID [2018-11-23 12:30:07,610 INFO L273 TraceCheckUtils]: 111: Hoare triple {16876#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16876#false} is VALID [2018-11-23 12:30:07,610 INFO L273 TraceCheckUtils]: 112: Hoare triple {16876#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16876#false} is VALID [2018-11-23 12:30:07,610 INFO L273 TraceCheckUtils]: 113: Hoare triple {16876#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16876#false} is VALID [2018-11-23 12:30:07,611 INFO L273 TraceCheckUtils]: 114: Hoare triple {16876#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16876#false} is VALID [2018-11-23 12:30:07,611 INFO L273 TraceCheckUtils]: 115: Hoare triple {16876#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16876#false} is VALID [2018-11-23 12:30:07,611 INFO L273 TraceCheckUtils]: 116: Hoare triple {16876#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16876#false} is VALID [2018-11-23 12:30:07,611 INFO L273 TraceCheckUtils]: 117: Hoare triple {16876#false} assume !(~i~2 < 99999); {16876#false} is VALID [2018-11-23 12:30:07,611 INFO L273 TraceCheckUtils]: 118: Hoare triple {16876#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {16876#false} is VALID [2018-11-23 12:30:07,611 INFO L256 TraceCheckUtils]: 119: Hoare triple {16876#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {16875#true} is VALID [2018-11-23 12:30:07,611 INFO L273 TraceCheckUtils]: 120: Hoare triple {16875#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {16875#true} is VALID [2018-11-23 12:30:07,611 INFO L273 TraceCheckUtils]: 121: Hoare triple {16875#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16875#true} is VALID [2018-11-23 12:30:07,611 INFO L273 TraceCheckUtils]: 122: Hoare triple {16875#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16875#true} is VALID [2018-11-23 12:30:07,612 INFO L273 TraceCheckUtils]: 123: Hoare triple {16875#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16875#true} is VALID [2018-11-23 12:30:07,612 INFO L273 TraceCheckUtils]: 124: Hoare triple {16875#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16875#true} is VALID [2018-11-23 12:30:07,612 INFO L273 TraceCheckUtils]: 125: Hoare triple {16875#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16875#true} is VALID [2018-11-23 12:30:07,612 INFO L273 TraceCheckUtils]: 126: Hoare triple {16875#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16875#true} is VALID [2018-11-23 12:30:07,612 INFO L273 TraceCheckUtils]: 127: Hoare triple {16875#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16875#true} is VALID [2018-11-23 12:30:07,612 INFO L273 TraceCheckUtils]: 128: Hoare triple {16875#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16875#true} is VALID [2018-11-23 12:30:07,612 INFO L273 TraceCheckUtils]: 129: Hoare triple {16875#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16875#true} is VALID [2018-11-23 12:30:07,612 INFO L273 TraceCheckUtils]: 130: Hoare triple {16875#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16875#true} is VALID [2018-11-23 12:30:07,612 INFO L273 TraceCheckUtils]: 131: Hoare triple {16875#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16875#true} is VALID [2018-11-23 12:30:07,613 INFO L273 TraceCheckUtils]: 132: Hoare triple {16875#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16875#true} is VALID [2018-11-23 12:30:07,613 INFO L273 TraceCheckUtils]: 133: Hoare triple {16875#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16875#true} is VALID [2018-11-23 12:30:07,613 INFO L273 TraceCheckUtils]: 134: Hoare triple {16875#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16875#true} is VALID [2018-11-23 12:30:07,613 INFO L273 TraceCheckUtils]: 135: Hoare triple {16875#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16875#true} is VALID [2018-11-23 12:30:07,613 INFO L273 TraceCheckUtils]: 136: Hoare triple {16875#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16875#true} is VALID [2018-11-23 12:30:07,613 INFO L273 TraceCheckUtils]: 137: Hoare triple {16875#true} assume !(~i~0 < 100000); {16875#true} is VALID [2018-11-23 12:30:07,613 INFO L273 TraceCheckUtils]: 138: Hoare triple {16875#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {16875#true} is VALID [2018-11-23 12:30:07,613 INFO L273 TraceCheckUtils]: 139: Hoare triple {16875#true} assume true; {16875#true} is VALID [2018-11-23 12:30:07,613 INFO L268 TraceCheckUtils]: 140: Hoare quadruple {16875#true} {16876#false} #74#return; {16876#false} is VALID [2018-11-23 12:30:07,613 INFO L273 TraceCheckUtils]: 141: Hoare triple {16876#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {16876#false} is VALID [2018-11-23 12:30:07,614 INFO L273 TraceCheckUtils]: 142: Hoare triple {16876#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {16876#false} is VALID [2018-11-23 12:30:07,614 INFO L273 TraceCheckUtils]: 143: Hoare triple {16876#false} assume !false; {16876#false} is VALID [2018-11-23 12:30:07,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1313 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2018-11-23 12:30:07,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:30:07,623 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 12:30:07,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:30:07,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:07,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:07,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:30:07,978 INFO L256 TraceCheckUtils]: 0: Hoare triple {16875#true} call ULTIMATE.init(); {16875#true} is VALID [2018-11-23 12:30:07,978 INFO L273 TraceCheckUtils]: 1: Hoare triple {16875#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16875#true} is VALID [2018-11-23 12:30:07,978 INFO L273 TraceCheckUtils]: 2: Hoare triple {16875#true} assume true; {16875#true} is VALID [2018-11-23 12:30:07,979 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16875#true} {16875#true} #66#return; {16875#true} is VALID [2018-11-23 12:30:07,979 INFO L256 TraceCheckUtils]: 4: Hoare triple {16875#true} call #t~ret13 := main(); {16875#true} is VALID [2018-11-23 12:30:07,980 INFO L273 TraceCheckUtils]: 5: Hoare triple {16875#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {16921#(<= main_~i~1 0)} is VALID [2018-11-23 12:30:07,980 INFO L273 TraceCheckUtils]: 6: Hoare triple {16921#(<= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16921#(<= main_~i~1 0)} is VALID [2018-11-23 12:30:07,981 INFO L273 TraceCheckUtils]: 7: Hoare triple {16921#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16878#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:07,981 INFO L273 TraceCheckUtils]: 8: Hoare triple {16878#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16878#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:07,981 INFO L273 TraceCheckUtils]: 9: Hoare triple {16878#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16879#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:07,982 INFO L273 TraceCheckUtils]: 10: Hoare triple {16879#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16879#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:07,982 INFO L273 TraceCheckUtils]: 11: Hoare triple {16879#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16880#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:07,982 INFO L273 TraceCheckUtils]: 12: Hoare triple {16880#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16880#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:07,983 INFO L273 TraceCheckUtils]: 13: Hoare triple {16880#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16881#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:07,984 INFO L273 TraceCheckUtils]: 14: Hoare triple {16881#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16881#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:07,984 INFO L273 TraceCheckUtils]: 15: Hoare triple {16881#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16882#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:07,985 INFO L273 TraceCheckUtils]: 16: Hoare triple {16882#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16882#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:07,986 INFO L273 TraceCheckUtils]: 17: Hoare triple {16882#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16883#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:07,986 INFO L273 TraceCheckUtils]: 18: Hoare triple {16883#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16883#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:07,987 INFO L273 TraceCheckUtils]: 19: Hoare triple {16883#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16884#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:07,987 INFO L273 TraceCheckUtils]: 20: Hoare triple {16884#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16884#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:07,988 INFO L273 TraceCheckUtils]: 21: Hoare triple {16884#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16885#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:07,989 INFO L273 TraceCheckUtils]: 22: Hoare triple {16885#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16885#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:07,989 INFO L273 TraceCheckUtils]: 23: Hoare triple {16885#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16886#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:07,990 INFO L273 TraceCheckUtils]: 24: Hoare triple {16886#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16886#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:07,991 INFO L273 TraceCheckUtils]: 25: Hoare triple {16886#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16887#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:07,991 INFO L273 TraceCheckUtils]: 26: Hoare triple {16887#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16887#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:07,992 INFO L273 TraceCheckUtils]: 27: Hoare triple {16887#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16888#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:07,992 INFO L273 TraceCheckUtils]: 28: Hoare triple {16888#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16888#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:07,993 INFO L273 TraceCheckUtils]: 29: Hoare triple {16888#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16889#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:07,994 INFO L273 TraceCheckUtils]: 30: Hoare triple {16889#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16889#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:07,994 INFO L273 TraceCheckUtils]: 31: Hoare triple {16889#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16890#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:07,995 INFO L273 TraceCheckUtils]: 32: Hoare triple {16890#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16890#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:07,996 INFO L273 TraceCheckUtils]: 33: Hoare triple {16890#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16891#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:07,996 INFO L273 TraceCheckUtils]: 34: Hoare triple {16891#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16891#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:07,997 INFO L273 TraceCheckUtils]: 35: Hoare triple {16891#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16892#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:07,997 INFO L273 TraceCheckUtils]: 36: Hoare triple {16892#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16892#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:07,998 INFO L273 TraceCheckUtils]: 37: Hoare triple {16892#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16893#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:07,999 INFO L273 TraceCheckUtils]: 38: Hoare triple {16893#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16893#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:07,999 INFO L273 TraceCheckUtils]: 39: Hoare triple {16893#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16894#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:08,000 INFO L273 TraceCheckUtils]: 40: Hoare triple {16894#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16894#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:08,001 INFO L273 TraceCheckUtils]: 41: Hoare triple {16894#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16895#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:08,001 INFO L273 TraceCheckUtils]: 42: Hoare triple {16895#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16895#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:08,002 INFO L273 TraceCheckUtils]: 43: Hoare triple {16895#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16896#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:08,003 INFO L273 TraceCheckUtils]: 44: Hoare triple {16896#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16896#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:08,003 INFO L273 TraceCheckUtils]: 45: Hoare triple {16896#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16897#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:08,004 INFO L273 TraceCheckUtils]: 46: Hoare triple {16897#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16897#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:08,005 INFO L273 TraceCheckUtils]: 47: Hoare triple {16897#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16898#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:08,005 INFO L273 TraceCheckUtils]: 48: Hoare triple {16898#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16898#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:08,006 INFO L273 TraceCheckUtils]: 49: Hoare triple {16898#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16899#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:08,006 INFO L273 TraceCheckUtils]: 50: Hoare triple {16899#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16899#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:08,007 INFO L273 TraceCheckUtils]: 51: Hoare triple {16899#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16900#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:08,008 INFO L273 TraceCheckUtils]: 52: Hoare triple {16900#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16900#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:08,008 INFO L273 TraceCheckUtils]: 53: Hoare triple {16900#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16901#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:08,009 INFO L273 TraceCheckUtils]: 54: Hoare triple {16901#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16901#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:08,010 INFO L273 TraceCheckUtils]: 55: Hoare triple {16901#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16902#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:08,010 INFO L273 TraceCheckUtils]: 56: Hoare triple {16902#(<= main_~i~1 25)} assume !(~i~1 < 100000); {16876#false} is VALID [2018-11-23 12:30:08,010 INFO L256 TraceCheckUtils]: 57: Hoare triple {16876#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {16876#false} is VALID [2018-11-23 12:30:08,011 INFO L273 TraceCheckUtils]: 58: Hoare triple {16876#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {16876#false} is VALID [2018-11-23 12:30:08,011 INFO L273 TraceCheckUtils]: 59: Hoare triple {16876#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16876#false} is VALID [2018-11-23 12:30:08,011 INFO L273 TraceCheckUtils]: 60: Hoare triple {16876#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16876#false} is VALID [2018-11-23 12:30:08,011 INFO L273 TraceCheckUtils]: 61: Hoare triple {16876#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16876#false} is VALID [2018-11-23 12:30:08,011 INFO L273 TraceCheckUtils]: 62: Hoare triple {16876#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16876#false} is VALID [2018-11-23 12:30:08,012 INFO L273 TraceCheckUtils]: 63: Hoare triple {16876#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16876#false} is VALID [2018-11-23 12:30:08,012 INFO L273 TraceCheckUtils]: 64: Hoare triple {16876#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16876#false} is VALID [2018-11-23 12:30:08,012 INFO L273 TraceCheckUtils]: 65: Hoare triple {16876#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16876#false} is VALID [2018-11-23 12:30:08,012 INFO L273 TraceCheckUtils]: 66: Hoare triple {16876#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16876#false} is VALID [2018-11-23 12:30:08,012 INFO L273 TraceCheckUtils]: 67: Hoare triple {16876#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16876#false} is VALID [2018-11-23 12:30:08,013 INFO L273 TraceCheckUtils]: 68: Hoare triple {16876#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16876#false} is VALID [2018-11-23 12:30:08,013 INFO L273 TraceCheckUtils]: 69: Hoare triple {16876#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16876#false} is VALID [2018-11-23 12:30:08,013 INFO L273 TraceCheckUtils]: 70: Hoare triple {16876#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16876#false} is VALID [2018-11-23 12:30:08,013 INFO L273 TraceCheckUtils]: 71: Hoare triple {16876#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16876#false} is VALID [2018-11-23 12:30:08,013 INFO L273 TraceCheckUtils]: 72: Hoare triple {16876#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16876#false} is VALID [2018-11-23 12:30:08,013 INFO L273 TraceCheckUtils]: 73: Hoare triple {16876#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16876#false} is VALID [2018-11-23 12:30:08,013 INFO L273 TraceCheckUtils]: 74: Hoare triple {16876#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16876#false} is VALID [2018-11-23 12:30:08,013 INFO L273 TraceCheckUtils]: 75: Hoare triple {16876#false} assume !(~i~0 < 100000); {16876#false} is VALID [2018-11-23 12:30:08,013 INFO L273 TraceCheckUtils]: 76: Hoare triple {16876#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {16876#false} is VALID [2018-11-23 12:30:08,014 INFO L273 TraceCheckUtils]: 77: Hoare triple {16876#false} assume true; {16876#false} is VALID [2018-11-23 12:30:08,014 INFO L268 TraceCheckUtils]: 78: Hoare quadruple {16876#false} {16876#false} #70#return; {16876#false} is VALID [2018-11-23 12:30:08,014 INFO L273 TraceCheckUtils]: 79: Hoare triple {16876#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {16876#false} is VALID [2018-11-23 12:30:08,014 INFO L256 TraceCheckUtils]: 80: Hoare triple {16876#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {16876#false} is VALID [2018-11-23 12:30:08,014 INFO L273 TraceCheckUtils]: 81: Hoare triple {16876#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {16876#false} is VALID [2018-11-23 12:30:08,014 INFO L273 TraceCheckUtils]: 82: Hoare triple {16876#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16876#false} is VALID [2018-11-23 12:30:08,014 INFO L273 TraceCheckUtils]: 83: Hoare triple {16876#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16876#false} is VALID [2018-11-23 12:30:08,014 INFO L273 TraceCheckUtils]: 84: Hoare triple {16876#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16876#false} is VALID [2018-11-23 12:30:08,014 INFO L273 TraceCheckUtils]: 85: Hoare triple {16876#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16876#false} is VALID [2018-11-23 12:30:08,014 INFO L273 TraceCheckUtils]: 86: Hoare triple {16876#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16876#false} is VALID [2018-11-23 12:30:08,015 INFO L273 TraceCheckUtils]: 87: Hoare triple {16876#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16876#false} is VALID [2018-11-23 12:30:08,015 INFO L273 TraceCheckUtils]: 88: Hoare triple {16876#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16876#false} is VALID [2018-11-23 12:30:08,015 INFO L273 TraceCheckUtils]: 89: Hoare triple {16876#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16876#false} is VALID [2018-11-23 12:30:08,015 INFO L273 TraceCheckUtils]: 90: Hoare triple {16876#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16876#false} is VALID [2018-11-23 12:30:08,015 INFO L273 TraceCheckUtils]: 91: Hoare triple {16876#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16876#false} is VALID [2018-11-23 12:30:08,015 INFO L273 TraceCheckUtils]: 92: Hoare triple {16876#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16876#false} is VALID [2018-11-23 12:30:08,015 INFO L273 TraceCheckUtils]: 93: Hoare triple {16876#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16876#false} is VALID [2018-11-23 12:30:08,015 INFO L273 TraceCheckUtils]: 94: Hoare triple {16876#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16876#false} is VALID [2018-11-23 12:30:08,015 INFO L273 TraceCheckUtils]: 95: Hoare triple {16876#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16876#false} is VALID [2018-11-23 12:30:08,016 INFO L273 TraceCheckUtils]: 96: Hoare triple {16876#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16876#false} is VALID [2018-11-23 12:30:08,016 INFO L273 TraceCheckUtils]: 97: Hoare triple {16876#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16876#false} is VALID [2018-11-23 12:30:08,016 INFO L273 TraceCheckUtils]: 98: Hoare triple {16876#false} assume !(~i~0 < 100000); {16876#false} is VALID [2018-11-23 12:30:08,016 INFO L273 TraceCheckUtils]: 99: Hoare triple {16876#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {16876#false} is VALID [2018-11-23 12:30:08,016 INFO L273 TraceCheckUtils]: 100: Hoare triple {16876#false} assume true; {16876#false} is VALID [2018-11-23 12:30:08,016 INFO L268 TraceCheckUtils]: 101: Hoare quadruple {16876#false} {16876#false} #72#return; {16876#false} is VALID [2018-11-23 12:30:08,016 INFO L273 TraceCheckUtils]: 102: Hoare triple {16876#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {16876#false} is VALID [2018-11-23 12:30:08,016 INFO L273 TraceCheckUtils]: 103: Hoare triple {16876#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16876#false} is VALID [2018-11-23 12:30:08,016 INFO L273 TraceCheckUtils]: 104: Hoare triple {16876#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16876#false} is VALID [2018-11-23 12:30:08,017 INFO L273 TraceCheckUtils]: 105: Hoare triple {16876#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16876#false} is VALID [2018-11-23 12:30:08,017 INFO L273 TraceCheckUtils]: 106: Hoare triple {16876#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16876#false} is VALID [2018-11-23 12:30:08,017 INFO L273 TraceCheckUtils]: 107: Hoare triple {16876#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16876#false} is VALID [2018-11-23 12:30:08,017 INFO L273 TraceCheckUtils]: 108: Hoare triple {16876#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16876#false} is VALID [2018-11-23 12:30:08,017 INFO L273 TraceCheckUtils]: 109: Hoare triple {16876#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16876#false} is VALID [2018-11-23 12:30:08,017 INFO L273 TraceCheckUtils]: 110: Hoare triple {16876#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16876#false} is VALID [2018-11-23 12:30:08,017 INFO L273 TraceCheckUtils]: 111: Hoare triple {16876#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16876#false} is VALID [2018-11-23 12:30:08,017 INFO L273 TraceCheckUtils]: 112: Hoare triple {16876#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16876#false} is VALID [2018-11-23 12:30:08,017 INFO L273 TraceCheckUtils]: 113: Hoare triple {16876#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16876#false} is VALID [2018-11-23 12:30:08,017 INFO L273 TraceCheckUtils]: 114: Hoare triple {16876#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16876#false} is VALID [2018-11-23 12:30:08,018 INFO L273 TraceCheckUtils]: 115: Hoare triple {16876#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16876#false} is VALID [2018-11-23 12:30:08,018 INFO L273 TraceCheckUtils]: 116: Hoare triple {16876#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16876#false} is VALID [2018-11-23 12:30:08,018 INFO L273 TraceCheckUtils]: 117: Hoare triple {16876#false} assume !(~i~2 < 99999); {16876#false} is VALID [2018-11-23 12:30:08,018 INFO L273 TraceCheckUtils]: 118: Hoare triple {16876#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {16876#false} is VALID [2018-11-23 12:30:08,018 INFO L256 TraceCheckUtils]: 119: Hoare triple {16876#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {16876#false} is VALID [2018-11-23 12:30:08,018 INFO L273 TraceCheckUtils]: 120: Hoare triple {16876#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {16876#false} is VALID [2018-11-23 12:30:08,018 INFO L273 TraceCheckUtils]: 121: Hoare triple {16876#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16876#false} is VALID [2018-11-23 12:30:08,018 INFO L273 TraceCheckUtils]: 122: Hoare triple {16876#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16876#false} is VALID [2018-11-23 12:30:08,018 INFO L273 TraceCheckUtils]: 123: Hoare triple {16876#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16876#false} is VALID [2018-11-23 12:30:08,019 INFO L273 TraceCheckUtils]: 124: Hoare triple {16876#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16876#false} is VALID [2018-11-23 12:30:08,019 INFO L273 TraceCheckUtils]: 125: Hoare triple {16876#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16876#false} is VALID [2018-11-23 12:30:08,019 INFO L273 TraceCheckUtils]: 126: Hoare triple {16876#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16876#false} is VALID [2018-11-23 12:30:08,019 INFO L273 TraceCheckUtils]: 127: Hoare triple {16876#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16876#false} is VALID [2018-11-23 12:30:08,019 INFO L273 TraceCheckUtils]: 128: Hoare triple {16876#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16876#false} is VALID [2018-11-23 12:30:08,019 INFO L273 TraceCheckUtils]: 129: Hoare triple {16876#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16876#false} is VALID [2018-11-23 12:30:08,019 INFO L273 TraceCheckUtils]: 130: Hoare triple {16876#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16876#false} is VALID [2018-11-23 12:30:08,019 INFO L273 TraceCheckUtils]: 131: Hoare triple {16876#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16876#false} is VALID [2018-11-23 12:30:08,019 INFO L273 TraceCheckUtils]: 132: Hoare triple {16876#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16876#false} is VALID [2018-11-23 12:30:08,019 INFO L273 TraceCheckUtils]: 133: Hoare triple {16876#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16876#false} is VALID [2018-11-23 12:30:08,020 INFO L273 TraceCheckUtils]: 134: Hoare triple {16876#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16876#false} is VALID [2018-11-23 12:30:08,020 INFO L273 TraceCheckUtils]: 135: Hoare triple {16876#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16876#false} is VALID [2018-11-23 12:30:08,020 INFO L273 TraceCheckUtils]: 136: Hoare triple {16876#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16876#false} is VALID [2018-11-23 12:30:08,020 INFO L273 TraceCheckUtils]: 137: Hoare triple {16876#false} assume !(~i~0 < 100000); {16876#false} is VALID [2018-11-23 12:30:08,020 INFO L273 TraceCheckUtils]: 138: Hoare triple {16876#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {16876#false} is VALID [2018-11-23 12:30:08,020 INFO L273 TraceCheckUtils]: 139: Hoare triple {16876#false} assume true; {16876#false} is VALID [2018-11-23 12:30:08,020 INFO L268 TraceCheckUtils]: 140: Hoare quadruple {16876#false} {16876#false} #74#return; {16876#false} is VALID [2018-11-23 12:30:08,020 INFO L273 TraceCheckUtils]: 141: Hoare triple {16876#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {16876#false} is VALID [2018-11-23 12:30:08,020 INFO L273 TraceCheckUtils]: 142: Hoare triple {16876#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {16876#false} is VALID [2018-11-23 12:30:08,021 INFO L273 TraceCheckUtils]: 143: Hoare triple {16876#false} assume !false; {16876#false} is VALID [2018-11-23 12:30:08,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1313 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2018-11-23 12:30:08,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:30:08,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-11-23 12:30:08,051 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 144 [2018-11-23 12:30:08,051 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:30:08,051 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 12:30:08,142 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:30:08,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 12:30:08,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 12:30:08,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 12:30:08,143 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand 29 states. [2018-11-23 12:30:08,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:08,501 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2018-11-23 12:30:08,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 12:30:08,501 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 144 [2018-11-23 12:30:08,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:30:08,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:30:08,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 104 transitions. [2018-11-23 12:30:08,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:30:08,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 104 transitions. [2018-11-23 12:30:08,503 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 104 transitions. [2018-11-23 12:30:08,604 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:30:08,606 INFO L225 Difference]: With dead ends: 152 [2018-11-23 12:30:08,606 INFO L226 Difference]: Without dead ends: 106 [2018-11-23 12:30:08,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 144 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 12:30:08,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-23 12:30:08,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-11-23 12:30:08,644 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:30:08,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 105 states. [2018-11-23 12:30:08,645 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 105 states. [2018-11-23 12:30:08,645 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 105 states. [2018-11-23 12:30:08,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:08,646 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2018-11-23 12:30:08,646 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2018-11-23 12:30:08,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:08,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:08,647 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 106 states. [2018-11-23 12:30:08,647 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 106 states. [2018-11-23 12:30:08,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:08,649 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2018-11-23 12:30:08,649 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2018-11-23 12:30:08,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:08,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:08,650 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:30:08,650 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:30:08,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-23 12:30:08,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2018-11-23 12:30:08,652 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 144 [2018-11-23 12:30:08,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:30:08,652 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2018-11-23 12:30:08,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 12:30:08,653 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-11-23 12:30:08,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-23 12:30:08,654 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:30:08,654 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 24, 24, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:30:08,654 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:30:08,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:30:08,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1510967329, now seen corresponding path program 26 times [2018-11-23 12:30:08,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:30:08,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:30:08,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:08,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:30:08,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:08,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:09,217 INFO L256 TraceCheckUtils]: 0: Hoare triple {17929#true} call ULTIMATE.init(); {17929#true} is VALID [2018-11-23 12:30:09,218 INFO L273 TraceCheckUtils]: 1: Hoare triple {17929#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17929#true} is VALID [2018-11-23 12:30:09,218 INFO L273 TraceCheckUtils]: 2: Hoare triple {17929#true} assume true; {17929#true} is VALID [2018-11-23 12:30:09,218 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17929#true} {17929#true} #66#return; {17929#true} is VALID [2018-11-23 12:30:09,218 INFO L256 TraceCheckUtils]: 4: Hoare triple {17929#true} call #t~ret13 := main(); {17929#true} is VALID [2018-11-23 12:30:09,219 INFO L273 TraceCheckUtils]: 5: Hoare triple {17929#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {17931#(= main_~i~1 0)} is VALID [2018-11-23 12:30:09,219 INFO L273 TraceCheckUtils]: 6: Hoare triple {17931#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17931#(= main_~i~1 0)} is VALID [2018-11-23 12:30:09,220 INFO L273 TraceCheckUtils]: 7: Hoare triple {17931#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17932#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:09,220 INFO L273 TraceCheckUtils]: 8: Hoare triple {17932#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17932#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:09,221 INFO L273 TraceCheckUtils]: 9: Hoare triple {17932#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17933#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:09,221 INFO L273 TraceCheckUtils]: 10: Hoare triple {17933#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17933#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:09,222 INFO L273 TraceCheckUtils]: 11: Hoare triple {17933#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17934#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:09,222 INFO L273 TraceCheckUtils]: 12: Hoare triple {17934#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17934#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:09,223 INFO L273 TraceCheckUtils]: 13: Hoare triple {17934#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17935#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:09,223 INFO L273 TraceCheckUtils]: 14: Hoare triple {17935#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17935#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:09,224 INFO L273 TraceCheckUtils]: 15: Hoare triple {17935#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17936#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:09,225 INFO L273 TraceCheckUtils]: 16: Hoare triple {17936#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17936#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:09,225 INFO L273 TraceCheckUtils]: 17: Hoare triple {17936#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17937#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:09,226 INFO L273 TraceCheckUtils]: 18: Hoare triple {17937#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17937#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:09,227 INFO L273 TraceCheckUtils]: 19: Hoare triple {17937#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17938#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:09,227 INFO L273 TraceCheckUtils]: 20: Hoare triple {17938#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17938#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:09,228 INFO L273 TraceCheckUtils]: 21: Hoare triple {17938#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17939#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:09,228 INFO L273 TraceCheckUtils]: 22: Hoare triple {17939#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17939#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:09,229 INFO L273 TraceCheckUtils]: 23: Hoare triple {17939#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17940#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:09,230 INFO L273 TraceCheckUtils]: 24: Hoare triple {17940#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17940#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:09,230 INFO L273 TraceCheckUtils]: 25: Hoare triple {17940#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17941#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:09,231 INFO L273 TraceCheckUtils]: 26: Hoare triple {17941#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17941#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:09,232 INFO L273 TraceCheckUtils]: 27: Hoare triple {17941#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17942#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:09,232 INFO L273 TraceCheckUtils]: 28: Hoare triple {17942#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17942#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:09,233 INFO L273 TraceCheckUtils]: 29: Hoare triple {17942#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17943#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:09,233 INFO L273 TraceCheckUtils]: 30: Hoare triple {17943#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17943#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:09,234 INFO L273 TraceCheckUtils]: 31: Hoare triple {17943#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17944#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:09,235 INFO L273 TraceCheckUtils]: 32: Hoare triple {17944#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17944#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:09,235 INFO L273 TraceCheckUtils]: 33: Hoare triple {17944#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17945#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:09,236 INFO L273 TraceCheckUtils]: 34: Hoare triple {17945#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17945#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:09,237 INFO L273 TraceCheckUtils]: 35: Hoare triple {17945#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17946#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:09,237 INFO L273 TraceCheckUtils]: 36: Hoare triple {17946#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17946#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:09,238 INFO L273 TraceCheckUtils]: 37: Hoare triple {17946#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17947#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:09,239 INFO L273 TraceCheckUtils]: 38: Hoare triple {17947#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17947#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:09,239 INFO L273 TraceCheckUtils]: 39: Hoare triple {17947#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17948#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:09,240 INFO L273 TraceCheckUtils]: 40: Hoare triple {17948#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17948#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:09,241 INFO L273 TraceCheckUtils]: 41: Hoare triple {17948#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17949#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:09,242 INFO L273 TraceCheckUtils]: 42: Hoare triple {17949#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17949#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:09,242 INFO L273 TraceCheckUtils]: 43: Hoare triple {17949#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17950#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:09,243 INFO L273 TraceCheckUtils]: 44: Hoare triple {17950#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17950#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:09,244 INFO L273 TraceCheckUtils]: 45: Hoare triple {17950#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17951#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:09,244 INFO L273 TraceCheckUtils]: 46: Hoare triple {17951#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17951#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:09,245 INFO L273 TraceCheckUtils]: 47: Hoare triple {17951#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17952#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:09,246 INFO L273 TraceCheckUtils]: 48: Hoare triple {17952#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17952#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:09,247 INFO L273 TraceCheckUtils]: 49: Hoare triple {17952#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17953#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:09,247 INFO L273 TraceCheckUtils]: 50: Hoare triple {17953#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17953#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:09,248 INFO L273 TraceCheckUtils]: 51: Hoare triple {17953#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17954#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:09,249 INFO L273 TraceCheckUtils]: 52: Hoare triple {17954#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17954#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:09,250 INFO L273 TraceCheckUtils]: 53: Hoare triple {17954#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17955#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:09,250 INFO L273 TraceCheckUtils]: 54: Hoare triple {17955#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17955#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:09,251 INFO L273 TraceCheckUtils]: 55: Hoare triple {17955#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17956#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:09,252 INFO L273 TraceCheckUtils]: 56: Hoare triple {17956#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17956#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:09,253 INFO L273 TraceCheckUtils]: 57: Hoare triple {17956#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17957#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:09,253 INFO L273 TraceCheckUtils]: 58: Hoare triple {17957#(<= main_~i~1 26)} assume !(~i~1 < 100000); {17930#false} is VALID [2018-11-23 12:30:09,254 INFO L256 TraceCheckUtils]: 59: Hoare triple {17930#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {17929#true} is VALID [2018-11-23 12:30:09,254 INFO L273 TraceCheckUtils]: 60: Hoare triple {17929#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {17929#true} is VALID [2018-11-23 12:30:09,254 INFO L273 TraceCheckUtils]: 61: Hoare triple {17929#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17929#true} is VALID [2018-11-23 12:30:09,254 INFO L273 TraceCheckUtils]: 62: Hoare triple {17929#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17929#true} is VALID [2018-11-23 12:30:09,255 INFO L273 TraceCheckUtils]: 63: Hoare triple {17929#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17929#true} is VALID [2018-11-23 12:30:09,255 INFO L273 TraceCheckUtils]: 64: Hoare triple {17929#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17929#true} is VALID [2018-11-23 12:30:09,255 INFO L273 TraceCheckUtils]: 65: Hoare triple {17929#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17929#true} is VALID [2018-11-23 12:30:09,255 INFO L273 TraceCheckUtils]: 66: Hoare triple {17929#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17929#true} is VALID [2018-11-23 12:30:09,256 INFO L273 TraceCheckUtils]: 67: Hoare triple {17929#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17929#true} is VALID [2018-11-23 12:30:09,256 INFO L273 TraceCheckUtils]: 68: Hoare triple {17929#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17929#true} is VALID [2018-11-23 12:30:09,256 INFO L273 TraceCheckUtils]: 69: Hoare triple {17929#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17929#true} is VALID [2018-11-23 12:30:09,256 INFO L273 TraceCheckUtils]: 70: Hoare triple {17929#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17929#true} is VALID [2018-11-23 12:30:09,257 INFO L273 TraceCheckUtils]: 71: Hoare triple {17929#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17929#true} is VALID [2018-11-23 12:30:09,257 INFO L273 TraceCheckUtils]: 72: Hoare triple {17929#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17929#true} is VALID [2018-11-23 12:30:09,257 INFO L273 TraceCheckUtils]: 73: Hoare triple {17929#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17929#true} is VALID [2018-11-23 12:30:09,257 INFO L273 TraceCheckUtils]: 74: Hoare triple {17929#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17929#true} is VALID [2018-11-23 12:30:09,257 INFO L273 TraceCheckUtils]: 75: Hoare triple {17929#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17929#true} is VALID [2018-11-23 12:30:09,257 INFO L273 TraceCheckUtils]: 76: Hoare triple {17929#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17929#true} is VALID [2018-11-23 12:30:09,258 INFO L273 TraceCheckUtils]: 77: Hoare triple {17929#true} assume !(~i~0 < 100000); {17929#true} is VALID [2018-11-23 12:30:09,258 INFO L273 TraceCheckUtils]: 78: Hoare triple {17929#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {17929#true} is VALID [2018-11-23 12:30:09,258 INFO L273 TraceCheckUtils]: 79: Hoare triple {17929#true} assume true; {17929#true} is VALID [2018-11-23 12:30:09,258 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {17929#true} {17930#false} #70#return; {17930#false} is VALID [2018-11-23 12:30:09,258 INFO L273 TraceCheckUtils]: 81: Hoare triple {17930#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {17930#false} is VALID [2018-11-23 12:30:09,258 INFO L256 TraceCheckUtils]: 82: Hoare triple {17930#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {17929#true} is VALID [2018-11-23 12:30:09,259 INFO L273 TraceCheckUtils]: 83: Hoare triple {17929#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {17929#true} is VALID [2018-11-23 12:30:09,259 INFO L273 TraceCheckUtils]: 84: Hoare triple {17929#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17929#true} is VALID [2018-11-23 12:30:09,259 INFO L273 TraceCheckUtils]: 85: Hoare triple {17929#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17929#true} is VALID [2018-11-23 12:30:09,259 INFO L273 TraceCheckUtils]: 86: Hoare triple {17929#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17929#true} is VALID [2018-11-23 12:30:09,259 INFO L273 TraceCheckUtils]: 87: Hoare triple {17929#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17929#true} is VALID [2018-11-23 12:30:09,259 INFO L273 TraceCheckUtils]: 88: Hoare triple {17929#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17929#true} is VALID [2018-11-23 12:30:09,259 INFO L273 TraceCheckUtils]: 89: Hoare triple {17929#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17929#true} is VALID [2018-11-23 12:30:09,260 INFO L273 TraceCheckUtils]: 90: Hoare triple {17929#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17929#true} is VALID [2018-11-23 12:30:09,260 INFO L273 TraceCheckUtils]: 91: Hoare triple {17929#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17929#true} is VALID [2018-11-23 12:30:09,260 INFO L273 TraceCheckUtils]: 92: Hoare triple {17929#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17929#true} is VALID [2018-11-23 12:30:09,260 INFO L273 TraceCheckUtils]: 93: Hoare triple {17929#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17929#true} is VALID [2018-11-23 12:30:09,260 INFO L273 TraceCheckUtils]: 94: Hoare triple {17929#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17929#true} is VALID [2018-11-23 12:30:09,260 INFO L273 TraceCheckUtils]: 95: Hoare triple {17929#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17929#true} is VALID [2018-11-23 12:30:09,260 INFO L273 TraceCheckUtils]: 96: Hoare triple {17929#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17929#true} is VALID [2018-11-23 12:30:09,260 INFO L273 TraceCheckUtils]: 97: Hoare triple {17929#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17929#true} is VALID [2018-11-23 12:30:09,261 INFO L273 TraceCheckUtils]: 98: Hoare triple {17929#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17929#true} is VALID [2018-11-23 12:30:09,261 INFO L273 TraceCheckUtils]: 99: Hoare triple {17929#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17929#true} is VALID [2018-11-23 12:30:09,261 INFO L273 TraceCheckUtils]: 100: Hoare triple {17929#true} assume !(~i~0 < 100000); {17929#true} is VALID [2018-11-23 12:30:09,261 INFO L273 TraceCheckUtils]: 101: Hoare triple {17929#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {17929#true} is VALID [2018-11-23 12:30:09,261 INFO L273 TraceCheckUtils]: 102: Hoare triple {17929#true} assume true; {17929#true} is VALID [2018-11-23 12:30:09,261 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {17929#true} {17930#false} #72#return; {17930#false} is VALID [2018-11-23 12:30:09,261 INFO L273 TraceCheckUtils]: 104: Hoare triple {17930#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {17930#false} is VALID [2018-11-23 12:30:09,262 INFO L273 TraceCheckUtils]: 105: Hoare triple {17930#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17930#false} is VALID [2018-11-23 12:30:09,262 INFO L273 TraceCheckUtils]: 106: Hoare triple {17930#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17930#false} is VALID [2018-11-23 12:30:09,262 INFO L273 TraceCheckUtils]: 107: Hoare triple {17930#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17930#false} is VALID [2018-11-23 12:30:09,262 INFO L273 TraceCheckUtils]: 108: Hoare triple {17930#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17930#false} is VALID [2018-11-23 12:30:09,262 INFO L273 TraceCheckUtils]: 109: Hoare triple {17930#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17930#false} is VALID [2018-11-23 12:30:09,262 INFO L273 TraceCheckUtils]: 110: Hoare triple {17930#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17930#false} is VALID [2018-11-23 12:30:09,262 INFO L273 TraceCheckUtils]: 111: Hoare triple {17930#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17930#false} is VALID [2018-11-23 12:30:09,263 INFO L273 TraceCheckUtils]: 112: Hoare triple {17930#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17930#false} is VALID [2018-11-23 12:30:09,263 INFO L273 TraceCheckUtils]: 113: Hoare triple {17930#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17930#false} is VALID [2018-11-23 12:30:09,263 INFO L273 TraceCheckUtils]: 114: Hoare triple {17930#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17930#false} is VALID [2018-11-23 12:30:09,263 INFO L273 TraceCheckUtils]: 115: Hoare triple {17930#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17930#false} is VALID [2018-11-23 12:30:09,263 INFO L273 TraceCheckUtils]: 116: Hoare triple {17930#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17930#false} is VALID [2018-11-23 12:30:09,263 INFO L273 TraceCheckUtils]: 117: Hoare triple {17930#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17930#false} is VALID [2018-11-23 12:30:09,263 INFO L273 TraceCheckUtils]: 118: Hoare triple {17930#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17930#false} is VALID [2018-11-23 12:30:09,264 INFO L273 TraceCheckUtils]: 119: Hoare triple {17930#false} assume !(~i~2 < 99999); {17930#false} is VALID [2018-11-23 12:30:09,264 INFO L273 TraceCheckUtils]: 120: Hoare triple {17930#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {17930#false} is VALID [2018-11-23 12:30:09,264 INFO L256 TraceCheckUtils]: 121: Hoare triple {17930#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {17929#true} is VALID [2018-11-23 12:30:09,264 INFO L273 TraceCheckUtils]: 122: Hoare triple {17929#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {17929#true} is VALID [2018-11-23 12:30:09,264 INFO L273 TraceCheckUtils]: 123: Hoare triple {17929#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17929#true} is VALID [2018-11-23 12:30:09,264 INFO L273 TraceCheckUtils]: 124: Hoare triple {17929#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17929#true} is VALID [2018-11-23 12:30:09,264 INFO L273 TraceCheckUtils]: 125: Hoare triple {17929#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17929#true} is VALID [2018-11-23 12:30:09,265 INFO L273 TraceCheckUtils]: 126: Hoare triple {17929#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17929#true} is VALID [2018-11-23 12:30:09,265 INFO L273 TraceCheckUtils]: 127: Hoare triple {17929#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17929#true} is VALID [2018-11-23 12:30:09,265 INFO L273 TraceCheckUtils]: 128: Hoare triple {17929#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17929#true} is VALID [2018-11-23 12:30:09,265 INFO L273 TraceCheckUtils]: 129: Hoare triple {17929#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17929#true} is VALID [2018-11-23 12:30:09,265 INFO L273 TraceCheckUtils]: 130: Hoare triple {17929#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17929#true} is VALID [2018-11-23 12:30:09,265 INFO L273 TraceCheckUtils]: 131: Hoare triple {17929#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17929#true} is VALID [2018-11-23 12:30:09,265 INFO L273 TraceCheckUtils]: 132: Hoare triple {17929#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17929#true} is VALID [2018-11-23 12:30:09,266 INFO L273 TraceCheckUtils]: 133: Hoare triple {17929#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17929#true} is VALID [2018-11-23 12:30:09,266 INFO L273 TraceCheckUtils]: 134: Hoare triple {17929#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17929#true} is VALID [2018-11-23 12:30:09,266 INFO L273 TraceCheckUtils]: 135: Hoare triple {17929#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17929#true} is VALID [2018-11-23 12:30:09,266 INFO L273 TraceCheckUtils]: 136: Hoare triple {17929#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17929#true} is VALID [2018-11-23 12:30:09,266 INFO L273 TraceCheckUtils]: 137: Hoare triple {17929#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17929#true} is VALID [2018-11-23 12:30:09,266 INFO L273 TraceCheckUtils]: 138: Hoare triple {17929#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17929#true} is VALID [2018-11-23 12:30:09,266 INFO L273 TraceCheckUtils]: 139: Hoare triple {17929#true} assume !(~i~0 < 100000); {17929#true} is VALID [2018-11-23 12:30:09,267 INFO L273 TraceCheckUtils]: 140: Hoare triple {17929#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {17929#true} is VALID [2018-11-23 12:30:09,267 INFO L273 TraceCheckUtils]: 141: Hoare triple {17929#true} assume true; {17929#true} is VALID [2018-11-23 12:30:09,267 INFO L268 TraceCheckUtils]: 142: Hoare quadruple {17929#true} {17930#false} #74#return; {17930#false} is VALID [2018-11-23 12:30:09,267 INFO L273 TraceCheckUtils]: 143: Hoare triple {17930#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {17930#false} is VALID [2018-11-23 12:30:09,267 INFO L273 TraceCheckUtils]: 144: Hoare triple {17930#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {17930#false} is VALID [2018-11-23 12:30:09,267 INFO L273 TraceCheckUtils]: 145: Hoare triple {17930#false} assume !false; {17930#false} is VALID [2018-11-23 12:30:09,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1364 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2018-11-23 12:30:09,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:30:09,286 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 12:30:09,297 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:30:09,374 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:30:09,374 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:30:09,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:09,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:30:09,722 INFO L256 TraceCheckUtils]: 0: Hoare triple {17929#true} call ULTIMATE.init(); {17929#true} is VALID [2018-11-23 12:30:09,722 INFO L273 TraceCheckUtils]: 1: Hoare triple {17929#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17929#true} is VALID [2018-11-23 12:30:09,723 INFO L273 TraceCheckUtils]: 2: Hoare triple {17929#true} assume true; {17929#true} is VALID [2018-11-23 12:30:09,723 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17929#true} {17929#true} #66#return; {17929#true} is VALID [2018-11-23 12:30:09,723 INFO L256 TraceCheckUtils]: 4: Hoare triple {17929#true} call #t~ret13 := main(); {17929#true} is VALID [2018-11-23 12:30:09,724 INFO L273 TraceCheckUtils]: 5: Hoare triple {17929#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {17976#(<= main_~i~1 0)} is VALID [2018-11-23 12:30:09,724 INFO L273 TraceCheckUtils]: 6: Hoare triple {17976#(<= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17976#(<= main_~i~1 0)} is VALID [2018-11-23 12:30:09,725 INFO L273 TraceCheckUtils]: 7: Hoare triple {17976#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17932#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:09,725 INFO L273 TraceCheckUtils]: 8: Hoare triple {17932#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17932#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:09,725 INFO L273 TraceCheckUtils]: 9: Hoare triple {17932#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17933#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:09,726 INFO L273 TraceCheckUtils]: 10: Hoare triple {17933#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17933#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:09,726 INFO L273 TraceCheckUtils]: 11: Hoare triple {17933#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17934#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:09,727 INFO L273 TraceCheckUtils]: 12: Hoare triple {17934#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17934#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:09,728 INFO L273 TraceCheckUtils]: 13: Hoare triple {17934#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17935#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:09,728 INFO L273 TraceCheckUtils]: 14: Hoare triple {17935#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17935#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:09,729 INFO L273 TraceCheckUtils]: 15: Hoare triple {17935#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17936#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:09,729 INFO L273 TraceCheckUtils]: 16: Hoare triple {17936#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17936#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:09,730 INFO L273 TraceCheckUtils]: 17: Hoare triple {17936#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17937#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:09,731 INFO L273 TraceCheckUtils]: 18: Hoare triple {17937#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17937#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:09,731 INFO L273 TraceCheckUtils]: 19: Hoare triple {17937#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17938#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:09,732 INFO L273 TraceCheckUtils]: 20: Hoare triple {17938#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17938#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:09,733 INFO L273 TraceCheckUtils]: 21: Hoare triple {17938#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17939#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:09,733 INFO L273 TraceCheckUtils]: 22: Hoare triple {17939#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17939#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:09,734 INFO L273 TraceCheckUtils]: 23: Hoare triple {17939#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17940#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:09,734 INFO L273 TraceCheckUtils]: 24: Hoare triple {17940#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17940#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:09,735 INFO L273 TraceCheckUtils]: 25: Hoare triple {17940#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17941#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:09,736 INFO L273 TraceCheckUtils]: 26: Hoare triple {17941#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17941#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:09,736 INFO L273 TraceCheckUtils]: 27: Hoare triple {17941#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17942#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:09,737 INFO L273 TraceCheckUtils]: 28: Hoare triple {17942#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17942#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:09,738 INFO L273 TraceCheckUtils]: 29: Hoare triple {17942#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17943#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:09,738 INFO L273 TraceCheckUtils]: 30: Hoare triple {17943#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17943#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:09,739 INFO L273 TraceCheckUtils]: 31: Hoare triple {17943#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17944#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:09,739 INFO L273 TraceCheckUtils]: 32: Hoare triple {17944#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17944#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:09,740 INFO L273 TraceCheckUtils]: 33: Hoare triple {17944#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17945#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:09,741 INFO L273 TraceCheckUtils]: 34: Hoare triple {17945#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17945#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:09,741 INFO L273 TraceCheckUtils]: 35: Hoare triple {17945#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17946#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:09,742 INFO L273 TraceCheckUtils]: 36: Hoare triple {17946#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17946#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:09,743 INFO L273 TraceCheckUtils]: 37: Hoare triple {17946#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17947#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:09,743 INFO L273 TraceCheckUtils]: 38: Hoare triple {17947#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17947#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:09,744 INFO L273 TraceCheckUtils]: 39: Hoare triple {17947#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17948#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:09,744 INFO L273 TraceCheckUtils]: 40: Hoare triple {17948#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17948#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:09,745 INFO L273 TraceCheckUtils]: 41: Hoare triple {17948#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17949#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:09,746 INFO L273 TraceCheckUtils]: 42: Hoare triple {17949#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17949#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:09,746 INFO L273 TraceCheckUtils]: 43: Hoare triple {17949#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17950#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:09,747 INFO L273 TraceCheckUtils]: 44: Hoare triple {17950#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17950#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:09,748 INFO L273 TraceCheckUtils]: 45: Hoare triple {17950#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17951#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:09,748 INFO L273 TraceCheckUtils]: 46: Hoare triple {17951#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17951#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:09,749 INFO L273 TraceCheckUtils]: 47: Hoare triple {17951#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17952#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:09,750 INFO L273 TraceCheckUtils]: 48: Hoare triple {17952#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17952#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:09,750 INFO L273 TraceCheckUtils]: 49: Hoare triple {17952#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17953#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:09,751 INFO L273 TraceCheckUtils]: 50: Hoare triple {17953#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17953#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:09,751 INFO L273 TraceCheckUtils]: 51: Hoare triple {17953#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17954#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:09,752 INFO L273 TraceCheckUtils]: 52: Hoare triple {17954#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17954#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:09,753 INFO L273 TraceCheckUtils]: 53: Hoare triple {17954#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17955#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:09,753 INFO L273 TraceCheckUtils]: 54: Hoare triple {17955#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17955#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:09,754 INFO L273 TraceCheckUtils]: 55: Hoare triple {17955#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17956#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:09,754 INFO L273 TraceCheckUtils]: 56: Hoare triple {17956#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17956#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:09,755 INFO L273 TraceCheckUtils]: 57: Hoare triple {17956#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17957#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:09,756 INFO L273 TraceCheckUtils]: 58: Hoare triple {17957#(<= main_~i~1 26)} assume !(~i~1 < 100000); {17930#false} is VALID [2018-11-23 12:30:09,756 INFO L256 TraceCheckUtils]: 59: Hoare triple {17930#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {17930#false} is VALID [2018-11-23 12:30:09,756 INFO L273 TraceCheckUtils]: 60: Hoare triple {17930#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {17930#false} is VALID [2018-11-23 12:30:09,757 INFO L273 TraceCheckUtils]: 61: Hoare triple {17930#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17930#false} is VALID [2018-11-23 12:30:09,757 INFO L273 TraceCheckUtils]: 62: Hoare triple {17930#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17930#false} is VALID [2018-11-23 12:30:09,757 INFO L273 TraceCheckUtils]: 63: Hoare triple {17930#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17930#false} is VALID [2018-11-23 12:30:09,757 INFO L273 TraceCheckUtils]: 64: Hoare triple {17930#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17930#false} is VALID [2018-11-23 12:30:09,757 INFO L273 TraceCheckUtils]: 65: Hoare triple {17930#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17930#false} is VALID [2018-11-23 12:30:09,757 INFO L273 TraceCheckUtils]: 66: Hoare triple {17930#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17930#false} is VALID [2018-11-23 12:30:09,758 INFO L273 TraceCheckUtils]: 67: Hoare triple {17930#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17930#false} is VALID [2018-11-23 12:30:09,758 INFO L273 TraceCheckUtils]: 68: Hoare triple {17930#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17930#false} is VALID [2018-11-23 12:30:09,758 INFO L273 TraceCheckUtils]: 69: Hoare triple {17930#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17930#false} is VALID [2018-11-23 12:30:09,758 INFO L273 TraceCheckUtils]: 70: Hoare triple {17930#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17930#false} is VALID [2018-11-23 12:30:09,758 INFO L273 TraceCheckUtils]: 71: Hoare triple {17930#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17930#false} is VALID [2018-11-23 12:30:09,759 INFO L273 TraceCheckUtils]: 72: Hoare triple {17930#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17930#false} is VALID [2018-11-23 12:30:09,759 INFO L273 TraceCheckUtils]: 73: Hoare triple {17930#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17930#false} is VALID [2018-11-23 12:30:09,759 INFO L273 TraceCheckUtils]: 74: Hoare triple {17930#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17930#false} is VALID [2018-11-23 12:30:09,759 INFO L273 TraceCheckUtils]: 75: Hoare triple {17930#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17930#false} is VALID [2018-11-23 12:30:09,759 INFO L273 TraceCheckUtils]: 76: Hoare triple {17930#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17930#false} is VALID [2018-11-23 12:30:09,759 INFO L273 TraceCheckUtils]: 77: Hoare triple {17930#false} assume !(~i~0 < 100000); {17930#false} is VALID [2018-11-23 12:30:09,759 INFO L273 TraceCheckUtils]: 78: Hoare triple {17930#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {17930#false} is VALID [2018-11-23 12:30:09,759 INFO L273 TraceCheckUtils]: 79: Hoare triple {17930#false} assume true; {17930#false} is VALID [2018-11-23 12:30:09,760 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {17930#false} {17930#false} #70#return; {17930#false} is VALID [2018-11-23 12:30:09,760 INFO L273 TraceCheckUtils]: 81: Hoare triple {17930#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {17930#false} is VALID [2018-11-23 12:30:09,760 INFO L256 TraceCheckUtils]: 82: Hoare triple {17930#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {17930#false} is VALID [2018-11-23 12:30:09,760 INFO L273 TraceCheckUtils]: 83: Hoare triple {17930#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {17930#false} is VALID [2018-11-23 12:30:09,760 INFO L273 TraceCheckUtils]: 84: Hoare triple {17930#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17930#false} is VALID [2018-11-23 12:30:09,760 INFO L273 TraceCheckUtils]: 85: Hoare triple {17930#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17930#false} is VALID [2018-11-23 12:30:09,760 INFO L273 TraceCheckUtils]: 86: Hoare triple {17930#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17930#false} is VALID [2018-11-23 12:30:09,760 INFO L273 TraceCheckUtils]: 87: Hoare triple {17930#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17930#false} is VALID [2018-11-23 12:30:09,760 INFO L273 TraceCheckUtils]: 88: Hoare triple {17930#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17930#false} is VALID [2018-11-23 12:30:09,760 INFO L273 TraceCheckUtils]: 89: Hoare triple {17930#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17930#false} is VALID [2018-11-23 12:30:09,761 INFO L273 TraceCheckUtils]: 90: Hoare triple {17930#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17930#false} is VALID [2018-11-23 12:30:09,761 INFO L273 TraceCheckUtils]: 91: Hoare triple {17930#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17930#false} is VALID [2018-11-23 12:30:09,761 INFO L273 TraceCheckUtils]: 92: Hoare triple {17930#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17930#false} is VALID [2018-11-23 12:30:09,761 INFO L273 TraceCheckUtils]: 93: Hoare triple {17930#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17930#false} is VALID [2018-11-23 12:30:09,761 INFO L273 TraceCheckUtils]: 94: Hoare triple {17930#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17930#false} is VALID [2018-11-23 12:30:09,761 INFO L273 TraceCheckUtils]: 95: Hoare triple {17930#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17930#false} is VALID [2018-11-23 12:30:09,761 INFO L273 TraceCheckUtils]: 96: Hoare triple {17930#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17930#false} is VALID [2018-11-23 12:30:09,761 INFO L273 TraceCheckUtils]: 97: Hoare triple {17930#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17930#false} is VALID [2018-11-23 12:30:09,761 INFO L273 TraceCheckUtils]: 98: Hoare triple {17930#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17930#false} is VALID [2018-11-23 12:30:09,762 INFO L273 TraceCheckUtils]: 99: Hoare triple {17930#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17930#false} is VALID [2018-11-23 12:30:09,762 INFO L273 TraceCheckUtils]: 100: Hoare triple {17930#false} assume !(~i~0 < 100000); {17930#false} is VALID [2018-11-23 12:30:09,762 INFO L273 TraceCheckUtils]: 101: Hoare triple {17930#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {17930#false} is VALID [2018-11-23 12:30:09,762 INFO L273 TraceCheckUtils]: 102: Hoare triple {17930#false} assume true; {17930#false} is VALID [2018-11-23 12:30:09,762 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {17930#false} {17930#false} #72#return; {17930#false} is VALID [2018-11-23 12:30:09,762 INFO L273 TraceCheckUtils]: 104: Hoare triple {17930#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {17930#false} is VALID [2018-11-23 12:30:09,762 INFO L273 TraceCheckUtils]: 105: Hoare triple {17930#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17930#false} is VALID [2018-11-23 12:30:09,762 INFO L273 TraceCheckUtils]: 106: Hoare triple {17930#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17930#false} is VALID [2018-11-23 12:30:09,762 INFO L273 TraceCheckUtils]: 107: Hoare triple {17930#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17930#false} is VALID [2018-11-23 12:30:09,763 INFO L273 TraceCheckUtils]: 108: Hoare triple {17930#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17930#false} is VALID [2018-11-23 12:30:09,763 INFO L273 TraceCheckUtils]: 109: Hoare triple {17930#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17930#false} is VALID [2018-11-23 12:30:09,763 INFO L273 TraceCheckUtils]: 110: Hoare triple {17930#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17930#false} is VALID [2018-11-23 12:30:09,763 INFO L273 TraceCheckUtils]: 111: Hoare triple {17930#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17930#false} is VALID [2018-11-23 12:30:09,763 INFO L273 TraceCheckUtils]: 112: Hoare triple {17930#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17930#false} is VALID [2018-11-23 12:30:09,763 INFO L273 TraceCheckUtils]: 113: Hoare triple {17930#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17930#false} is VALID [2018-11-23 12:30:09,763 INFO L273 TraceCheckUtils]: 114: Hoare triple {17930#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17930#false} is VALID [2018-11-23 12:30:09,763 INFO L273 TraceCheckUtils]: 115: Hoare triple {17930#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17930#false} is VALID [2018-11-23 12:30:09,763 INFO L273 TraceCheckUtils]: 116: Hoare triple {17930#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17930#false} is VALID [2018-11-23 12:30:09,763 INFO L273 TraceCheckUtils]: 117: Hoare triple {17930#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17930#false} is VALID [2018-11-23 12:30:09,764 INFO L273 TraceCheckUtils]: 118: Hoare triple {17930#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17930#false} is VALID [2018-11-23 12:30:09,764 INFO L273 TraceCheckUtils]: 119: Hoare triple {17930#false} assume !(~i~2 < 99999); {17930#false} is VALID [2018-11-23 12:30:09,764 INFO L273 TraceCheckUtils]: 120: Hoare triple {17930#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {17930#false} is VALID [2018-11-23 12:30:09,764 INFO L256 TraceCheckUtils]: 121: Hoare triple {17930#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {17930#false} is VALID [2018-11-23 12:30:09,764 INFO L273 TraceCheckUtils]: 122: Hoare triple {17930#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {17930#false} is VALID [2018-11-23 12:30:09,764 INFO L273 TraceCheckUtils]: 123: Hoare triple {17930#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17930#false} is VALID [2018-11-23 12:30:09,764 INFO L273 TraceCheckUtils]: 124: Hoare triple {17930#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17930#false} is VALID [2018-11-23 12:30:09,764 INFO L273 TraceCheckUtils]: 125: Hoare triple {17930#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17930#false} is VALID [2018-11-23 12:30:09,764 INFO L273 TraceCheckUtils]: 126: Hoare triple {17930#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17930#false} is VALID [2018-11-23 12:30:09,765 INFO L273 TraceCheckUtils]: 127: Hoare triple {17930#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17930#false} is VALID [2018-11-23 12:30:09,765 INFO L273 TraceCheckUtils]: 128: Hoare triple {17930#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17930#false} is VALID [2018-11-23 12:30:09,765 INFO L273 TraceCheckUtils]: 129: Hoare triple {17930#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17930#false} is VALID [2018-11-23 12:30:09,765 INFO L273 TraceCheckUtils]: 130: Hoare triple {17930#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17930#false} is VALID [2018-11-23 12:30:09,765 INFO L273 TraceCheckUtils]: 131: Hoare triple {17930#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17930#false} is VALID [2018-11-23 12:30:09,765 INFO L273 TraceCheckUtils]: 132: Hoare triple {17930#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17930#false} is VALID [2018-11-23 12:30:09,765 INFO L273 TraceCheckUtils]: 133: Hoare triple {17930#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17930#false} is VALID [2018-11-23 12:30:09,765 INFO L273 TraceCheckUtils]: 134: Hoare triple {17930#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17930#false} is VALID [2018-11-23 12:30:09,765 INFO L273 TraceCheckUtils]: 135: Hoare triple {17930#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17930#false} is VALID [2018-11-23 12:30:09,765 INFO L273 TraceCheckUtils]: 136: Hoare triple {17930#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17930#false} is VALID [2018-11-23 12:30:09,766 INFO L273 TraceCheckUtils]: 137: Hoare triple {17930#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17930#false} is VALID [2018-11-23 12:30:09,766 INFO L273 TraceCheckUtils]: 138: Hoare triple {17930#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17930#false} is VALID [2018-11-23 12:30:09,766 INFO L273 TraceCheckUtils]: 139: Hoare triple {17930#false} assume !(~i~0 < 100000); {17930#false} is VALID [2018-11-23 12:30:09,766 INFO L273 TraceCheckUtils]: 140: Hoare triple {17930#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {17930#false} is VALID [2018-11-23 12:30:09,766 INFO L273 TraceCheckUtils]: 141: Hoare triple {17930#false} assume true; {17930#false} is VALID [2018-11-23 12:30:09,766 INFO L268 TraceCheckUtils]: 142: Hoare quadruple {17930#false} {17930#false} #74#return; {17930#false} is VALID [2018-11-23 12:30:09,766 INFO L273 TraceCheckUtils]: 143: Hoare triple {17930#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {17930#false} is VALID [2018-11-23 12:30:09,766 INFO L273 TraceCheckUtils]: 144: Hoare triple {17930#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {17930#false} is VALID [2018-11-23 12:30:09,766 INFO L273 TraceCheckUtils]: 145: Hoare triple {17930#false} assume !false; {17930#false} is VALID [2018-11-23 12:30:09,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1364 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2018-11-23 12:30:09,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:30:09,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-11-23 12:30:09,796 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 146 [2018-11-23 12:30:09,797 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:30:09,797 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 12:30:09,892 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:30:09,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 12:30:09,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 12:30:09,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:30:09,894 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand 30 states. [2018-11-23 12:30:10,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:10,832 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2018-11-23 12:30:10,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 12:30:10,833 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 146 [2018-11-23 12:30:10,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:30:10,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:30:10,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 106 transitions. [2018-11-23 12:30:10,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:30:10,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 106 transitions. [2018-11-23 12:30:10,835 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 106 transitions. [2018-11-23 12:30:11,003 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:30:11,005 INFO L225 Difference]: With dead ends: 154 [2018-11-23 12:30:11,006 INFO L226 Difference]: Without dead ends: 108 [2018-11-23 12:30:11,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:30:11,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-23 12:30:11,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2018-11-23 12:30:11,057 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:30:11,057 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand 107 states. [2018-11-23 12:30:11,058 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 107 states. [2018-11-23 12:30:11,058 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 107 states. [2018-11-23 12:30:11,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:11,059 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2018-11-23 12:30:11,060 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2018-11-23 12:30:11,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:11,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:11,060 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 108 states. [2018-11-23 12:30:11,060 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 108 states. [2018-11-23 12:30:11,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:11,062 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2018-11-23 12:30:11,063 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2018-11-23 12:30:11,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:11,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:11,063 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:30:11,064 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:30:11,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-23 12:30:11,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2018-11-23 12:30:11,066 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 146 [2018-11-23 12:30:11,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:30:11,066 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2018-11-23 12:30:11,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 12:30:11,066 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2018-11-23 12:30:11,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-23 12:30:11,067 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:30:11,067 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 24, 24, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:30:11,068 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:30:11,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:30:11,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1388054525, now seen corresponding path program 27 times [2018-11-23 12:30:11,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:30:11,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:30:11,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:11,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:30:11,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:11,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:12,004 INFO L256 TraceCheckUtils]: 0: Hoare triple {19000#true} call ULTIMATE.init(); {19000#true} is VALID [2018-11-23 12:30:12,005 INFO L273 TraceCheckUtils]: 1: Hoare triple {19000#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19000#true} is VALID [2018-11-23 12:30:12,005 INFO L273 TraceCheckUtils]: 2: Hoare triple {19000#true} assume true; {19000#true} is VALID [2018-11-23 12:30:12,005 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19000#true} {19000#true} #66#return; {19000#true} is VALID [2018-11-23 12:30:12,005 INFO L256 TraceCheckUtils]: 4: Hoare triple {19000#true} call #t~ret13 := main(); {19000#true} is VALID [2018-11-23 12:30:12,006 INFO L273 TraceCheckUtils]: 5: Hoare triple {19000#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {19002#(= main_~i~1 0)} is VALID [2018-11-23 12:30:12,006 INFO L273 TraceCheckUtils]: 6: Hoare triple {19002#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19002#(= main_~i~1 0)} is VALID [2018-11-23 12:30:12,007 INFO L273 TraceCheckUtils]: 7: Hoare triple {19002#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19003#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:12,007 INFO L273 TraceCheckUtils]: 8: Hoare triple {19003#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19003#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:12,008 INFO L273 TraceCheckUtils]: 9: Hoare triple {19003#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19004#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:12,009 INFO L273 TraceCheckUtils]: 10: Hoare triple {19004#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19004#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:12,009 INFO L273 TraceCheckUtils]: 11: Hoare triple {19004#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19005#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:12,010 INFO L273 TraceCheckUtils]: 12: Hoare triple {19005#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19005#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:12,011 INFO L273 TraceCheckUtils]: 13: Hoare triple {19005#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19006#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:12,011 INFO L273 TraceCheckUtils]: 14: Hoare triple {19006#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19006#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:12,012 INFO L273 TraceCheckUtils]: 15: Hoare triple {19006#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19007#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:12,012 INFO L273 TraceCheckUtils]: 16: Hoare triple {19007#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19007#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:12,013 INFO L273 TraceCheckUtils]: 17: Hoare triple {19007#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19008#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:12,014 INFO L273 TraceCheckUtils]: 18: Hoare triple {19008#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19008#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:12,014 INFO L273 TraceCheckUtils]: 19: Hoare triple {19008#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19009#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:12,015 INFO L273 TraceCheckUtils]: 20: Hoare triple {19009#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19009#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:12,016 INFO L273 TraceCheckUtils]: 21: Hoare triple {19009#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19010#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:12,016 INFO L273 TraceCheckUtils]: 22: Hoare triple {19010#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19010#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:12,017 INFO L273 TraceCheckUtils]: 23: Hoare triple {19010#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19011#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:12,017 INFO L273 TraceCheckUtils]: 24: Hoare triple {19011#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19011#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:12,018 INFO L273 TraceCheckUtils]: 25: Hoare triple {19011#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19012#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:12,019 INFO L273 TraceCheckUtils]: 26: Hoare triple {19012#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19012#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:12,019 INFO L273 TraceCheckUtils]: 27: Hoare triple {19012#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19013#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:12,020 INFO L273 TraceCheckUtils]: 28: Hoare triple {19013#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19013#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:12,021 INFO L273 TraceCheckUtils]: 29: Hoare triple {19013#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19014#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:12,021 INFO L273 TraceCheckUtils]: 30: Hoare triple {19014#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19014#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:12,022 INFO L273 TraceCheckUtils]: 31: Hoare triple {19014#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19015#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:12,022 INFO L273 TraceCheckUtils]: 32: Hoare triple {19015#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19015#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:12,023 INFO L273 TraceCheckUtils]: 33: Hoare triple {19015#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19016#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:12,024 INFO L273 TraceCheckUtils]: 34: Hoare triple {19016#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19016#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:12,024 INFO L273 TraceCheckUtils]: 35: Hoare triple {19016#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19017#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:12,025 INFO L273 TraceCheckUtils]: 36: Hoare triple {19017#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19017#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:12,026 INFO L273 TraceCheckUtils]: 37: Hoare triple {19017#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19018#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:12,026 INFO L273 TraceCheckUtils]: 38: Hoare triple {19018#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19018#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:12,027 INFO L273 TraceCheckUtils]: 39: Hoare triple {19018#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19019#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:12,028 INFO L273 TraceCheckUtils]: 40: Hoare triple {19019#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19019#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:12,028 INFO L273 TraceCheckUtils]: 41: Hoare triple {19019#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19020#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:12,029 INFO L273 TraceCheckUtils]: 42: Hoare triple {19020#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19020#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:12,030 INFO L273 TraceCheckUtils]: 43: Hoare triple {19020#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19021#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:12,030 INFO L273 TraceCheckUtils]: 44: Hoare triple {19021#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19021#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:12,031 INFO L273 TraceCheckUtils]: 45: Hoare triple {19021#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19022#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:12,031 INFO L273 TraceCheckUtils]: 46: Hoare triple {19022#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19022#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:12,032 INFO L273 TraceCheckUtils]: 47: Hoare triple {19022#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19023#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:12,033 INFO L273 TraceCheckUtils]: 48: Hoare triple {19023#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19023#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:12,033 INFO L273 TraceCheckUtils]: 49: Hoare triple {19023#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:12,034 INFO L273 TraceCheckUtils]: 50: Hoare triple {19024#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:12,035 INFO L273 TraceCheckUtils]: 51: Hoare triple {19024#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19025#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:12,035 INFO L273 TraceCheckUtils]: 52: Hoare triple {19025#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19025#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:12,036 INFO L273 TraceCheckUtils]: 53: Hoare triple {19025#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19026#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:12,036 INFO L273 TraceCheckUtils]: 54: Hoare triple {19026#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19026#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:12,037 INFO L273 TraceCheckUtils]: 55: Hoare triple {19026#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19027#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:12,038 INFO L273 TraceCheckUtils]: 56: Hoare triple {19027#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19027#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:12,038 INFO L273 TraceCheckUtils]: 57: Hoare triple {19027#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19028#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:12,039 INFO L273 TraceCheckUtils]: 58: Hoare triple {19028#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19028#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:12,040 INFO L273 TraceCheckUtils]: 59: Hoare triple {19028#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19029#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:12,040 INFO L273 TraceCheckUtils]: 60: Hoare triple {19029#(<= main_~i~1 27)} assume !(~i~1 < 100000); {19001#false} is VALID [2018-11-23 12:30:12,041 INFO L256 TraceCheckUtils]: 61: Hoare triple {19001#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {19000#true} is VALID [2018-11-23 12:30:12,041 INFO L273 TraceCheckUtils]: 62: Hoare triple {19000#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {19000#true} is VALID [2018-11-23 12:30:12,041 INFO L273 TraceCheckUtils]: 63: Hoare triple {19000#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19000#true} is VALID [2018-11-23 12:30:12,041 INFO L273 TraceCheckUtils]: 64: Hoare triple {19000#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19000#true} is VALID [2018-11-23 12:30:12,041 INFO L273 TraceCheckUtils]: 65: Hoare triple {19000#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19000#true} is VALID [2018-11-23 12:30:12,041 INFO L273 TraceCheckUtils]: 66: Hoare triple {19000#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19000#true} is VALID [2018-11-23 12:30:12,042 INFO L273 TraceCheckUtils]: 67: Hoare triple {19000#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19000#true} is VALID [2018-11-23 12:30:12,042 INFO L273 TraceCheckUtils]: 68: Hoare triple {19000#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19000#true} is VALID [2018-11-23 12:30:12,042 INFO L273 TraceCheckUtils]: 69: Hoare triple {19000#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19000#true} is VALID [2018-11-23 12:30:12,042 INFO L273 TraceCheckUtils]: 70: Hoare triple {19000#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19000#true} is VALID [2018-11-23 12:30:12,042 INFO L273 TraceCheckUtils]: 71: Hoare triple {19000#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19000#true} is VALID [2018-11-23 12:30:12,042 INFO L273 TraceCheckUtils]: 72: Hoare triple {19000#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19000#true} is VALID [2018-11-23 12:30:12,043 INFO L273 TraceCheckUtils]: 73: Hoare triple {19000#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19000#true} is VALID [2018-11-23 12:30:12,043 INFO L273 TraceCheckUtils]: 74: Hoare triple {19000#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19000#true} is VALID [2018-11-23 12:30:12,043 INFO L273 TraceCheckUtils]: 75: Hoare triple {19000#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19000#true} is VALID [2018-11-23 12:30:12,043 INFO L273 TraceCheckUtils]: 76: Hoare triple {19000#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19000#true} is VALID [2018-11-23 12:30:12,043 INFO L273 TraceCheckUtils]: 77: Hoare triple {19000#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19000#true} is VALID [2018-11-23 12:30:12,043 INFO L273 TraceCheckUtils]: 78: Hoare triple {19000#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19000#true} is VALID [2018-11-23 12:30:12,043 INFO L273 TraceCheckUtils]: 79: Hoare triple {19000#true} assume !(~i~0 < 100000); {19000#true} is VALID [2018-11-23 12:30:12,043 INFO L273 TraceCheckUtils]: 80: Hoare triple {19000#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {19000#true} is VALID [2018-11-23 12:30:12,043 INFO L273 TraceCheckUtils]: 81: Hoare triple {19000#true} assume true; {19000#true} is VALID [2018-11-23 12:30:12,044 INFO L268 TraceCheckUtils]: 82: Hoare quadruple {19000#true} {19001#false} #70#return; {19001#false} is VALID [2018-11-23 12:30:12,044 INFO L273 TraceCheckUtils]: 83: Hoare triple {19001#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {19001#false} is VALID [2018-11-23 12:30:12,044 INFO L256 TraceCheckUtils]: 84: Hoare triple {19001#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {19000#true} is VALID [2018-11-23 12:30:12,044 INFO L273 TraceCheckUtils]: 85: Hoare triple {19000#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {19000#true} is VALID [2018-11-23 12:30:12,044 INFO L273 TraceCheckUtils]: 86: Hoare triple {19000#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19000#true} is VALID [2018-11-23 12:30:12,044 INFO L273 TraceCheckUtils]: 87: Hoare triple {19000#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19000#true} is VALID [2018-11-23 12:30:12,044 INFO L273 TraceCheckUtils]: 88: Hoare triple {19000#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19000#true} is VALID [2018-11-23 12:30:12,044 INFO L273 TraceCheckUtils]: 89: Hoare triple {19000#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19000#true} is VALID [2018-11-23 12:30:12,044 INFO L273 TraceCheckUtils]: 90: Hoare triple {19000#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19000#true} is VALID [2018-11-23 12:30:12,044 INFO L273 TraceCheckUtils]: 91: Hoare triple {19000#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19000#true} is VALID [2018-11-23 12:30:12,045 INFO L273 TraceCheckUtils]: 92: Hoare triple {19000#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19000#true} is VALID [2018-11-23 12:30:12,045 INFO L273 TraceCheckUtils]: 93: Hoare triple {19000#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19000#true} is VALID [2018-11-23 12:30:12,045 INFO L273 TraceCheckUtils]: 94: Hoare triple {19000#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19000#true} is VALID [2018-11-23 12:30:12,045 INFO L273 TraceCheckUtils]: 95: Hoare triple {19000#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19000#true} is VALID [2018-11-23 12:30:12,045 INFO L273 TraceCheckUtils]: 96: Hoare triple {19000#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19000#true} is VALID [2018-11-23 12:30:12,045 INFO L273 TraceCheckUtils]: 97: Hoare triple {19000#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19000#true} is VALID [2018-11-23 12:30:12,045 INFO L273 TraceCheckUtils]: 98: Hoare triple {19000#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19000#true} is VALID [2018-11-23 12:30:12,045 INFO L273 TraceCheckUtils]: 99: Hoare triple {19000#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19000#true} is VALID [2018-11-23 12:30:12,045 INFO L273 TraceCheckUtils]: 100: Hoare triple {19000#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19000#true} is VALID [2018-11-23 12:30:12,046 INFO L273 TraceCheckUtils]: 101: Hoare triple {19000#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19000#true} is VALID [2018-11-23 12:30:12,046 INFO L273 TraceCheckUtils]: 102: Hoare triple {19000#true} assume !(~i~0 < 100000); {19000#true} is VALID [2018-11-23 12:30:12,046 INFO L273 TraceCheckUtils]: 103: Hoare triple {19000#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {19000#true} is VALID [2018-11-23 12:30:12,046 INFO L273 TraceCheckUtils]: 104: Hoare triple {19000#true} assume true; {19000#true} is VALID [2018-11-23 12:30:12,046 INFO L268 TraceCheckUtils]: 105: Hoare quadruple {19000#true} {19001#false} #72#return; {19001#false} is VALID [2018-11-23 12:30:12,046 INFO L273 TraceCheckUtils]: 106: Hoare triple {19001#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {19001#false} is VALID [2018-11-23 12:30:12,046 INFO L273 TraceCheckUtils]: 107: Hoare triple {19001#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19001#false} is VALID [2018-11-23 12:30:12,046 INFO L273 TraceCheckUtils]: 108: Hoare triple {19001#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19001#false} is VALID [2018-11-23 12:30:12,046 INFO L273 TraceCheckUtils]: 109: Hoare triple {19001#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19001#false} is VALID [2018-11-23 12:30:12,046 INFO L273 TraceCheckUtils]: 110: Hoare triple {19001#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19001#false} is VALID [2018-11-23 12:30:12,047 INFO L273 TraceCheckUtils]: 111: Hoare triple {19001#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19001#false} is VALID [2018-11-23 12:30:12,047 INFO L273 TraceCheckUtils]: 112: Hoare triple {19001#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19001#false} is VALID [2018-11-23 12:30:12,047 INFO L273 TraceCheckUtils]: 113: Hoare triple {19001#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19001#false} is VALID [2018-11-23 12:30:12,047 INFO L273 TraceCheckUtils]: 114: Hoare triple {19001#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19001#false} is VALID [2018-11-23 12:30:12,047 INFO L273 TraceCheckUtils]: 115: Hoare triple {19001#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19001#false} is VALID [2018-11-23 12:30:12,047 INFO L273 TraceCheckUtils]: 116: Hoare triple {19001#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19001#false} is VALID [2018-11-23 12:30:12,047 INFO L273 TraceCheckUtils]: 117: Hoare triple {19001#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19001#false} is VALID [2018-11-23 12:30:12,047 INFO L273 TraceCheckUtils]: 118: Hoare triple {19001#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19001#false} is VALID [2018-11-23 12:30:12,047 INFO L273 TraceCheckUtils]: 119: Hoare triple {19001#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19001#false} is VALID [2018-11-23 12:30:12,048 INFO L273 TraceCheckUtils]: 120: Hoare triple {19001#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19001#false} is VALID [2018-11-23 12:30:12,048 INFO L273 TraceCheckUtils]: 121: Hoare triple {19001#false} assume !(~i~2 < 99999); {19001#false} is VALID [2018-11-23 12:30:12,048 INFO L273 TraceCheckUtils]: 122: Hoare triple {19001#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {19001#false} is VALID [2018-11-23 12:30:12,048 INFO L256 TraceCheckUtils]: 123: Hoare triple {19001#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {19000#true} is VALID [2018-11-23 12:30:12,048 INFO L273 TraceCheckUtils]: 124: Hoare triple {19000#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {19000#true} is VALID [2018-11-23 12:30:12,048 INFO L273 TraceCheckUtils]: 125: Hoare triple {19000#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19000#true} is VALID [2018-11-23 12:30:12,048 INFO L273 TraceCheckUtils]: 126: Hoare triple {19000#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19000#true} is VALID [2018-11-23 12:30:12,048 INFO L273 TraceCheckUtils]: 127: Hoare triple {19000#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19000#true} is VALID [2018-11-23 12:30:12,048 INFO L273 TraceCheckUtils]: 128: Hoare triple {19000#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19000#true} is VALID [2018-11-23 12:30:12,048 INFO L273 TraceCheckUtils]: 129: Hoare triple {19000#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19000#true} is VALID [2018-11-23 12:30:12,049 INFO L273 TraceCheckUtils]: 130: Hoare triple {19000#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19000#true} is VALID [2018-11-23 12:30:12,049 INFO L273 TraceCheckUtils]: 131: Hoare triple {19000#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19000#true} is VALID [2018-11-23 12:30:12,049 INFO L273 TraceCheckUtils]: 132: Hoare triple {19000#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19000#true} is VALID [2018-11-23 12:30:12,049 INFO L273 TraceCheckUtils]: 133: Hoare triple {19000#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19000#true} is VALID [2018-11-23 12:30:12,049 INFO L273 TraceCheckUtils]: 134: Hoare triple {19000#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19000#true} is VALID [2018-11-23 12:30:12,049 INFO L273 TraceCheckUtils]: 135: Hoare triple {19000#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19000#true} is VALID [2018-11-23 12:30:12,049 INFO L273 TraceCheckUtils]: 136: Hoare triple {19000#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19000#true} is VALID [2018-11-23 12:30:12,049 INFO L273 TraceCheckUtils]: 137: Hoare triple {19000#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19000#true} is VALID [2018-11-23 12:30:12,049 INFO L273 TraceCheckUtils]: 138: Hoare triple {19000#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19000#true} is VALID [2018-11-23 12:30:12,050 INFO L273 TraceCheckUtils]: 139: Hoare triple {19000#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19000#true} is VALID [2018-11-23 12:30:12,050 INFO L273 TraceCheckUtils]: 140: Hoare triple {19000#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19000#true} is VALID [2018-11-23 12:30:12,050 INFO L273 TraceCheckUtils]: 141: Hoare triple {19000#true} assume !(~i~0 < 100000); {19000#true} is VALID [2018-11-23 12:30:12,050 INFO L273 TraceCheckUtils]: 142: Hoare triple {19000#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {19000#true} is VALID [2018-11-23 12:30:12,050 INFO L273 TraceCheckUtils]: 143: Hoare triple {19000#true} assume true; {19000#true} is VALID [2018-11-23 12:30:12,050 INFO L268 TraceCheckUtils]: 144: Hoare quadruple {19000#true} {19001#false} #74#return; {19001#false} is VALID [2018-11-23 12:30:12,050 INFO L273 TraceCheckUtils]: 145: Hoare triple {19001#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {19001#false} is VALID [2018-11-23 12:30:12,050 INFO L273 TraceCheckUtils]: 146: Hoare triple {19001#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {19001#false} is VALID [2018-11-23 12:30:12,050 INFO L273 TraceCheckUtils]: 147: Hoare triple {19001#false} assume !false; {19001#false} is VALID [2018-11-23 12:30:12,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2018-11-23 12:30:12,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:30:12,061 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 12:30:12,071 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:30:12,227 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 12:30:12,228 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:30:12,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:12,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:30:12,582 INFO L256 TraceCheckUtils]: 0: Hoare triple {19000#true} call ULTIMATE.init(); {19000#true} is VALID [2018-11-23 12:30:12,582 INFO L273 TraceCheckUtils]: 1: Hoare triple {19000#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19000#true} is VALID [2018-11-23 12:30:12,582 INFO L273 TraceCheckUtils]: 2: Hoare triple {19000#true} assume true; {19000#true} is VALID [2018-11-23 12:30:12,582 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19000#true} {19000#true} #66#return; {19000#true} is VALID [2018-11-23 12:30:12,583 INFO L256 TraceCheckUtils]: 4: Hoare triple {19000#true} call #t~ret13 := main(); {19000#true} is VALID [2018-11-23 12:30:12,583 INFO L273 TraceCheckUtils]: 5: Hoare triple {19000#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {19000#true} is VALID [2018-11-23 12:30:12,583 INFO L273 TraceCheckUtils]: 6: Hoare triple {19000#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19000#true} is VALID [2018-11-23 12:30:12,583 INFO L273 TraceCheckUtils]: 7: Hoare triple {19000#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19000#true} is VALID [2018-11-23 12:30:12,583 INFO L273 TraceCheckUtils]: 8: Hoare triple {19000#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19000#true} is VALID [2018-11-23 12:30:12,583 INFO L273 TraceCheckUtils]: 9: Hoare triple {19000#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19000#true} is VALID [2018-11-23 12:30:12,584 INFO L273 TraceCheckUtils]: 10: Hoare triple {19000#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19000#true} is VALID [2018-11-23 12:30:12,584 INFO L273 TraceCheckUtils]: 11: Hoare triple {19000#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19000#true} is VALID [2018-11-23 12:30:12,584 INFO L273 TraceCheckUtils]: 12: Hoare triple {19000#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19000#true} is VALID [2018-11-23 12:30:12,584 INFO L273 TraceCheckUtils]: 13: Hoare triple {19000#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19000#true} is VALID [2018-11-23 12:30:12,584 INFO L273 TraceCheckUtils]: 14: Hoare triple {19000#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19000#true} is VALID [2018-11-23 12:30:12,584 INFO L273 TraceCheckUtils]: 15: Hoare triple {19000#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19000#true} is VALID [2018-11-23 12:30:12,584 INFO L273 TraceCheckUtils]: 16: Hoare triple {19000#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19000#true} is VALID [2018-11-23 12:30:12,584 INFO L273 TraceCheckUtils]: 17: Hoare triple {19000#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19000#true} is VALID [2018-11-23 12:30:12,584 INFO L273 TraceCheckUtils]: 18: Hoare triple {19000#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19000#true} is VALID [2018-11-23 12:30:12,584 INFO L273 TraceCheckUtils]: 19: Hoare triple {19000#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19000#true} is VALID [2018-11-23 12:30:12,585 INFO L273 TraceCheckUtils]: 20: Hoare triple {19000#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19000#true} is VALID [2018-11-23 12:30:12,585 INFO L273 TraceCheckUtils]: 21: Hoare triple {19000#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19000#true} is VALID [2018-11-23 12:30:12,585 INFO L273 TraceCheckUtils]: 22: Hoare triple {19000#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19000#true} is VALID [2018-11-23 12:30:12,585 INFO L273 TraceCheckUtils]: 23: Hoare triple {19000#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19000#true} is VALID [2018-11-23 12:30:12,585 INFO L273 TraceCheckUtils]: 24: Hoare triple {19000#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19000#true} is VALID [2018-11-23 12:30:12,585 INFO L273 TraceCheckUtils]: 25: Hoare triple {19000#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19000#true} is VALID [2018-11-23 12:30:12,585 INFO L273 TraceCheckUtils]: 26: Hoare triple {19000#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19000#true} is VALID [2018-11-23 12:30:12,585 INFO L273 TraceCheckUtils]: 27: Hoare triple {19000#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19000#true} is VALID [2018-11-23 12:30:12,585 INFO L273 TraceCheckUtils]: 28: Hoare triple {19000#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19000#true} is VALID [2018-11-23 12:30:12,586 INFO L273 TraceCheckUtils]: 29: Hoare triple {19000#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19000#true} is VALID [2018-11-23 12:30:12,586 INFO L273 TraceCheckUtils]: 30: Hoare triple {19000#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19000#true} is VALID [2018-11-23 12:30:12,586 INFO L273 TraceCheckUtils]: 31: Hoare triple {19000#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19000#true} is VALID [2018-11-23 12:30:12,586 INFO L273 TraceCheckUtils]: 32: Hoare triple {19000#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19000#true} is VALID [2018-11-23 12:30:12,586 INFO L273 TraceCheckUtils]: 33: Hoare triple {19000#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19000#true} is VALID [2018-11-23 12:30:12,586 INFO L273 TraceCheckUtils]: 34: Hoare triple {19000#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19000#true} is VALID [2018-11-23 12:30:12,586 INFO L273 TraceCheckUtils]: 35: Hoare triple {19000#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19000#true} is VALID [2018-11-23 12:30:12,586 INFO L273 TraceCheckUtils]: 36: Hoare triple {19000#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19000#true} is VALID [2018-11-23 12:30:12,586 INFO L273 TraceCheckUtils]: 37: Hoare triple {19000#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19000#true} is VALID [2018-11-23 12:30:12,586 INFO L273 TraceCheckUtils]: 38: Hoare triple {19000#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19000#true} is VALID [2018-11-23 12:30:12,587 INFO L273 TraceCheckUtils]: 39: Hoare triple {19000#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19000#true} is VALID [2018-11-23 12:30:12,587 INFO L273 TraceCheckUtils]: 40: Hoare triple {19000#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19000#true} is VALID [2018-11-23 12:30:12,587 INFO L273 TraceCheckUtils]: 41: Hoare triple {19000#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19000#true} is VALID [2018-11-23 12:30:12,587 INFO L273 TraceCheckUtils]: 42: Hoare triple {19000#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19000#true} is VALID [2018-11-23 12:30:12,587 INFO L273 TraceCheckUtils]: 43: Hoare triple {19000#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19000#true} is VALID [2018-11-23 12:30:12,587 INFO L273 TraceCheckUtils]: 44: Hoare triple {19000#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19000#true} is VALID [2018-11-23 12:30:12,587 INFO L273 TraceCheckUtils]: 45: Hoare triple {19000#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19000#true} is VALID [2018-11-23 12:30:12,587 INFO L273 TraceCheckUtils]: 46: Hoare triple {19000#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19000#true} is VALID [2018-11-23 12:30:12,587 INFO L273 TraceCheckUtils]: 47: Hoare triple {19000#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19000#true} is VALID [2018-11-23 12:30:12,588 INFO L273 TraceCheckUtils]: 48: Hoare triple {19000#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19000#true} is VALID [2018-11-23 12:30:12,588 INFO L273 TraceCheckUtils]: 49: Hoare triple {19000#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19000#true} is VALID [2018-11-23 12:30:12,588 INFO L273 TraceCheckUtils]: 50: Hoare triple {19000#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19000#true} is VALID [2018-11-23 12:30:12,588 INFO L273 TraceCheckUtils]: 51: Hoare triple {19000#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19000#true} is VALID [2018-11-23 12:30:12,588 INFO L273 TraceCheckUtils]: 52: Hoare triple {19000#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19000#true} is VALID [2018-11-23 12:30:12,588 INFO L273 TraceCheckUtils]: 53: Hoare triple {19000#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19000#true} is VALID [2018-11-23 12:30:12,588 INFO L273 TraceCheckUtils]: 54: Hoare triple {19000#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19000#true} is VALID [2018-11-23 12:30:12,588 INFO L273 TraceCheckUtils]: 55: Hoare triple {19000#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19000#true} is VALID [2018-11-23 12:30:12,588 INFO L273 TraceCheckUtils]: 56: Hoare triple {19000#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19000#true} is VALID [2018-11-23 12:30:12,588 INFO L273 TraceCheckUtils]: 57: Hoare triple {19000#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19000#true} is VALID [2018-11-23 12:30:12,589 INFO L273 TraceCheckUtils]: 58: Hoare triple {19000#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19000#true} is VALID [2018-11-23 12:30:12,589 INFO L273 TraceCheckUtils]: 59: Hoare triple {19000#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19000#true} is VALID [2018-11-23 12:30:12,589 INFO L273 TraceCheckUtils]: 60: Hoare triple {19000#true} assume !(~i~1 < 100000); {19000#true} is VALID [2018-11-23 12:30:12,589 INFO L256 TraceCheckUtils]: 61: Hoare triple {19000#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {19000#true} is VALID [2018-11-23 12:30:12,589 INFO L273 TraceCheckUtils]: 62: Hoare triple {19000#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {19000#true} is VALID [2018-11-23 12:30:12,589 INFO L273 TraceCheckUtils]: 63: Hoare triple {19000#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19000#true} is VALID [2018-11-23 12:30:12,589 INFO L273 TraceCheckUtils]: 64: Hoare triple {19000#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19000#true} is VALID [2018-11-23 12:30:12,589 INFO L273 TraceCheckUtils]: 65: Hoare triple {19000#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19000#true} is VALID [2018-11-23 12:30:12,589 INFO L273 TraceCheckUtils]: 66: Hoare triple {19000#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19000#true} is VALID [2018-11-23 12:30:12,589 INFO L273 TraceCheckUtils]: 67: Hoare triple {19000#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19000#true} is VALID [2018-11-23 12:30:12,590 INFO L273 TraceCheckUtils]: 68: Hoare triple {19000#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19000#true} is VALID [2018-11-23 12:30:12,590 INFO L273 TraceCheckUtils]: 69: Hoare triple {19000#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19000#true} is VALID [2018-11-23 12:30:12,590 INFO L273 TraceCheckUtils]: 70: Hoare triple {19000#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19000#true} is VALID [2018-11-23 12:30:12,590 INFO L273 TraceCheckUtils]: 71: Hoare triple {19000#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19000#true} is VALID [2018-11-23 12:30:12,590 INFO L273 TraceCheckUtils]: 72: Hoare triple {19000#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19000#true} is VALID [2018-11-23 12:30:12,590 INFO L273 TraceCheckUtils]: 73: Hoare triple {19000#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19000#true} is VALID [2018-11-23 12:30:12,590 INFO L273 TraceCheckUtils]: 74: Hoare triple {19000#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19000#true} is VALID [2018-11-23 12:30:12,590 INFO L273 TraceCheckUtils]: 75: Hoare triple {19000#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19000#true} is VALID [2018-11-23 12:30:12,590 INFO L273 TraceCheckUtils]: 76: Hoare triple {19000#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19000#true} is VALID [2018-11-23 12:30:12,591 INFO L273 TraceCheckUtils]: 77: Hoare triple {19000#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19000#true} is VALID [2018-11-23 12:30:12,591 INFO L273 TraceCheckUtils]: 78: Hoare triple {19000#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19000#true} is VALID [2018-11-23 12:30:12,591 INFO L273 TraceCheckUtils]: 79: Hoare triple {19000#true} assume !(~i~0 < 100000); {19000#true} is VALID [2018-11-23 12:30:12,591 INFO L273 TraceCheckUtils]: 80: Hoare triple {19000#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {19000#true} is VALID [2018-11-23 12:30:12,591 INFO L273 TraceCheckUtils]: 81: Hoare triple {19000#true} assume true; {19000#true} is VALID [2018-11-23 12:30:12,591 INFO L268 TraceCheckUtils]: 82: Hoare quadruple {19000#true} {19000#true} #70#return; {19000#true} is VALID [2018-11-23 12:30:12,591 INFO L273 TraceCheckUtils]: 83: Hoare triple {19000#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {19000#true} is VALID [2018-11-23 12:30:12,591 INFO L256 TraceCheckUtils]: 84: Hoare triple {19000#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {19000#true} is VALID [2018-11-23 12:30:12,591 INFO L273 TraceCheckUtils]: 85: Hoare triple {19000#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {19000#true} is VALID [2018-11-23 12:30:12,591 INFO L273 TraceCheckUtils]: 86: Hoare triple {19000#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19000#true} is VALID [2018-11-23 12:30:12,592 INFO L273 TraceCheckUtils]: 87: Hoare triple {19000#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19000#true} is VALID [2018-11-23 12:30:12,592 INFO L273 TraceCheckUtils]: 88: Hoare triple {19000#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19000#true} is VALID [2018-11-23 12:30:12,592 INFO L273 TraceCheckUtils]: 89: Hoare triple {19000#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19000#true} is VALID [2018-11-23 12:30:12,592 INFO L273 TraceCheckUtils]: 90: Hoare triple {19000#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19000#true} is VALID [2018-11-23 12:30:12,592 INFO L273 TraceCheckUtils]: 91: Hoare triple {19000#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19000#true} is VALID [2018-11-23 12:30:12,592 INFO L273 TraceCheckUtils]: 92: Hoare triple {19000#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19000#true} is VALID [2018-11-23 12:30:12,592 INFO L273 TraceCheckUtils]: 93: Hoare triple {19000#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19000#true} is VALID [2018-11-23 12:30:12,592 INFO L273 TraceCheckUtils]: 94: Hoare triple {19000#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19000#true} is VALID [2018-11-23 12:30:12,592 INFO L273 TraceCheckUtils]: 95: Hoare triple {19000#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19000#true} is VALID [2018-11-23 12:30:12,593 INFO L273 TraceCheckUtils]: 96: Hoare triple {19000#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19000#true} is VALID [2018-11-23 12:30:12,593 INFO L273 TraceCheckUtils]: 97: Hoare triple {19000#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19000#true} is VALID [2018-11-23 12:30:12,593 INFO L273 TraceCheckUtils]: 98: Hoare triple {19000#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19000#true} is VALID [2018-11-23 12:30:12,593 INFO L273 TraceCheckUtils]: 99: Hoare triple {19000#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19000#true} is VALID [2018-11-23 12:30:12,593 INFO L273 TraceCheckUtils]: 100: Hoare triple {19000#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19000#true} is VALID [2018-11-23 12:30:12,593 INFO L273 TraceCheckUtils]: 101: Hoare triple {19000#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19000#true} is VALID [2018-11-23 12:30:12,593 INFO L273 TraceCheckUtils]: 102: Hoare triple {19000#true} assume !(~i~0 < 100000); {19000#true} is VALID [2018-11-23 12:30:12,593 INFO L273 TraceCheckUtils]: 103: Hoare triple {19000#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {19000#true} is VALID [2018-11-23 12:30:12,593 INFO L273 TraceCheckUtils]: 104: Hoare triple {19000#true} assume true; {19000#true} is VALID [2018-11-23 12:30:12,593 INFO L268 TraceCheckUtils]: 105: Hoare quadruple {19000#true} {19000#true} #72#return; {19000#true} is VALID [2018-11-23 12:30:12,594 INFO L273 TraceCheckUtils]: 106: Hoare triple {19000#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {19351#(<= main_~i~2 0)} is VALID [2018-11-23 12:30:12,594 INFO L273 TraceCheckUtils]: 107: Hoare triple {19351#(<= main_~i~2 0)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19351#(<= main_~i~2 0)} is VALID [2018-11-23 12:30:12,595 INFO L273 TraceCheckUtils]: 108: Hoare triple {19351#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19358#(<= main_~i~2 1)} is VALID [2018-11-23 12:30:12,595 INFO L273 TraceCheckUtils]: 109: Hoare triple {19358#(<= main_~i~2 1)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19358#(<= main_~i~2 1)} is VALID [2018-11-23 12:30:12,596 INFO L273 TraceCheckUtils]: 110: Hoare triple {19358#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19365#(<= main_~i~2 2)} is VALID [2018-11-23 12:30:12,596 INFO L273 TraceCheckUtils]: 111: Hoare triple {19365#(<= main_~i~2 2)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19365#(<= main_~i~2 2)} is VALID [2018-11-23 12:30:12,596 INFO L273 TraceCheckUtils]: 112: Hoare triple {19365#(<= main_~i~2 2)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19372#(<= main_~i~2 3)} is VALID [2018-11-23 12:30:12,597 INFO L273 TraceCheckUtils]: 113: Hoare triple {19372#(<= main_~i~2 3)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19372#(<= main_~i~2 3)} is VALID [2018-11-23 12:30:12,598 INFO L273 TraceCheckUtils]: 114: Hoare triple {19372#(<= main_~i~2 3)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19379#(<= main_~i~2 4)} is VALID [2018-11-23 12:30:12,598 INFO L273 TraceCheckUtils]: 115: Hoare triple {19379#(<= main_~i~2 4)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19379#(<= main_~i~2 4)} is VALID [2018-11-23 12:30:12,599 INFO L273 TraceCheckUtils]: 116: Hoare triple {19379#(<= main_~i~2 4)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19386#(<= main_~i~2 5)} is VALID [2018-11-23 12:30:12,600 INFO L273 TraceCheckUtils]: 117: Hoare triple {19386#(<= main_~i~2 5)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19386#(<= main_~i~2 5)} is VALID [2018-11-23 12:30:12,600 INFO L273 TraceCheckUtils]: 118: Hoare triple {19386#(<= main_~i~2 5)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19393#(<= main_~i~2 6)} is VALID [2018-11-23 12:30:12,601 INFO L273 TraceCheckUtils]: 119: Hoare triple {19393#(<= main_~i~2 6)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19393#(<= main_~i~2 6)} is VALID [2018-11-23 12:30:12,602 INFO L273 TraceCheckUtils]: 120: Hoare triple {19393#(<= main_~i~2 6)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19400#(<= main_~i~2 7)} is VALID [2018-11-23 12:30:12,602 INFO L273 TraceCheckUtils]: 121: Hoare triple {19400#(<= main_~i~2 7)} assume !(~i~2 < 99999); {19001#false} is VALID [2018-11-23 12:30:12,602 INFO L273 TraceCheckUtils]: 122: Hoare triple {19001#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {19001#false} is VALID [2018-11-23 12:30:12,603 INFO L256 TraceCheckUtils]: 123: Hoare triple {19001#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {19001#false} is VALID [2018-11-23 12:30:12,603 INFO L273 TraceCheckUtils]: 124: Hoare triple {19001#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {19001#false} is VALID [2018-11-23 12:30:12,603 INFO L273 TraceCheckUtils]: 125: Hoare triple {19001#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19001#false} is VALID [2018-11-23 12:30:12,603 INFO L273 TraceCheckUtils]: 126: Hoare triple {19001#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19001#false} is VALID [2018-11-23 12:30:12,603 INFO L273 TraceCheckUtils]: 127: Hoare triple {19001#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19001#false} is VALID [2018-11-23 12:30:12,603 INFO L273 TraceCheckUtils]: 128: Hoare triple {19001#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19001#false} is VALID [2018-11-23 12:30:12,604 INFO L273 TraceCheckUtils]: 129: Hoare triple {19001#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19001#false} is VALID [2018-11-23 12:30:12,604 INFO L273 TraceCheckUtils]: 130: Hoare triple {19001#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19001#false} is VALID [2018-11-23 12:30:12,604 INFO L273 TraceCheckUtils]: 131: Hoare triple {19001#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19001#false} is VALID [2018-11-23 12:30:12,604 INFO L273 TraceCheckUtils]: 132: Hoare triple {19001#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19001#false} is VALID [2018-11-23 12:30:12,604 INFO L273 TraceCheckUtils]: 133: Hoare triple {19001#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19001#false} is VALID [2018-11-23 12:30:12,605 INFO L273 TraceCheckUtils]: 134: Hoare triple {19001#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19001#false} is VALID [2018-11-23 12:30:12,605 INFO L273 TraceCheckUtils]: 135: Hoare triple {19001#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19001#false} is VALID [2018-11-23 12:30:12,605 INFO L273 TraceCheckUtils]: 136: Hoare triple {19001#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19001#false} is VALID [2018-11-23 12:30:12,605 INFO L273 TraceCheckUtils]: 137: Hoare triple {19001#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19001#false} is VALID [2018-11-23 12:30:12,605 INFO L273 TraceCheckUtils]: 138: Hoare triple {19001#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19001#false} is VALID [2018-11-23 12:30:12,605 INFO L273 TraceCheckUtils]: 139: Hoare triple {19001#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19001#false} is VALID [2018-11-23 12:30:12,606 INFO L273 TraceCheckUtils]: 140: Hoare triple {19001#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19001#false} is VALID [2018-11-23 12:30:12,606 INFO L273 TraceCheckUtils]: 141: Hoare triple {19001#false} assume !(~i~0 < 100000); {19001#false} is VALID [2018-11-23 12:30:12,606 INFO L273 TraceCheckUtils]: 142: Hoare triple {19001#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {19001#false} is VALID [2018-11-23 12:30:12,606 INFO L273 TraceCheckUtils]: 143: Hoare triple {19001#false} assume true; {19001#false} is VALID [2018-11-23 12:30:12,606 INFO L268 TraceCheckUtils]: 144: Hoare quadruple {19001#false} {19001#false} #74#return; {19001#false} is VALID [2018-11-23 12:30:12,607 INFO L273 TraceCheckUtils]: 145: Hoare triple {19001#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {19001#false} is VALID [2018-11-23 12:30:12,607 INFO L273 TraceCheckUtils]: 146: Hoare triple {19001#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {19001#false} is VALID [2018-11-23 12:30:12,607 INFO L273 TraceCheckUtils]: 147: Hoare triple {19001#false} assume !false; {19001#false} is VALID [2018-11-23 12:30:12,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 298 proven. 49 refuted. 0 times theorem prover too weak. 1070 trivial. 0 not checked. [2018-11-23 12:30:12,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:30:12,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 10] total 38 [2018-11-23 12:30:12,649 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 148 [2018-11-23 12:30:12,649 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:30:12,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-23 12:30:12,899 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:30:12,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-23 12:30:12,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-23 12:30:12,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=479, Invalid=927, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 12:30:12,901 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 38 states. [2018-11-23 12:30:13,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:13,727 INFO L93 Difference]: Finished difference Result 159 states and 168 transitions. [2018-11-23 12:30:13,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-23 12:30:13,727 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 148 [2018-11-23 12:30:13,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:30:13,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:30:13,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 125 transitions. [2018-11-23 12:30:13,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:30:13,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 125 transitions. [2018-11-23 12:30:13,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 125 transitions. [2018-11-23 12:30:13,855 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:30:13,858 INFO L225 Difference]: With dead ends: 159 [2018-11-23 12:30:13,858 INFO L226 Difference]: Without dead ends: 113 [2018-11-23 12:30:13,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=479, Invalid=927, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 12:30:13,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-23 12:30:14,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2018-11-23 12:30:14,029 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:30:14,029 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand 111 states. [2018-11-23 12:30:14,029 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 111 states. [2018-11-23 12:30:14,029 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 111 states. [2018-11-23 12:30:14,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:14,032 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-11-23 12:30:14,032 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2018-11-23 12:30:14,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:14,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:14,033 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 113 states. [2018-11-23 12:30:14,033 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 113 states. [2018-11-23 12:30:14,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:14,036 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-11-23 12:30:14,036 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2018-11-23 12:30:14,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:14,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:14,036 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:30:14,037 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:30:14,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-23 12:30:14,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2018-11-23 12:30:14,039 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 148 [2018-11-23 12:30:14,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:30:14,039 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2018-11-23 12:30:14,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-23 12:30:14,039 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2018-11-23 12:30:14,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-23 12:30:14,040 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:30:14,040 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 24, 24, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:30:14,041 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:30:14,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:30:14,041 INFO L82 PathProgramCache]: Analyzing trace with hash 109793379, now seen corresponding path program 28 times [2018-11-23 12:30:14,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:30:14,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:30:14,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:14,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:30:14,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:14,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:14,596 INFO L256 TraceCheckUtils]: 0: Hoare triple {20108#true} call ULTIMATE.init(); {20108#true} is VALID [2018-11-23 12:30:14,596 INFO L273 TraceCheckUtils]: 1: Hoare triple {20108#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20108#true} is VALID [2018-11-23 12:30:14,597 INFO L273 TraceCheckUtils]: 2: Hoare triple {20108#true} assume true; {20108#true} is VALID [2018-11-23 12:30:14,597 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20108#true} {20108#true} #66#return; {20108#true} is VALID [2018-11-23 12:30:14,597 INFO L256 TraceCheckUtils]: 4: Hoare triple {20108#true} call #t~ret13 := main(); {20108#true} is VALID [2018-11-23 12:30:14,598 INFO L273 TraceCheckUtils]: 5: Hoare triple {20108#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {20110#(= main_~i~1 0)} is VALID [2018-11-23 12:30:14,598 INFO L273 TraceCheckUtils]: 6: Hoare triple {20110#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20110#(= main_~i~1 0)} is VALID [2018-11-23 12:30:14,599 INFO L273 TraceCheckUtils]: 7: Hoare triple {20110#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20111#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:14,599 INFO L273 TraceCheckUtils]: 8: Hoare triple {20111#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20111#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:14,600 INFO L273 TraceCheckUtils]: 9: Hoare triple {20111#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20112#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:14,600 INFO L273 TraceCheckUtils]: 10: Hoare triple {20112#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20112#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:14,601 INFO L273 TraceCheckUtils]: 11: Hoare triple {20112#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20113#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:14,601 INFO L273 TraceCheckUtils]: 12: Hoare triple {20113#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20113#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:14,603 INFO L273 TraceCheckUtils]: 13: Hoare triple {20113#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20114#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:14,604 INFO L273 TraceCheckUtils]: 14: Hoare triple {20114#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20114#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:14,605 INFO L273 TraceCheckUtils]: 15: Hoare triple {20114#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20115#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:14,605 INFO L273 TraceCheckUtils]: 16: Hoare triple {20115#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20115#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:14,606 INFO L273 TraceCheckUtils]: 17: Hoare triple {20115#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20116#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:14,606 INFO L273 TraceCheckUtils]: 18: Hoare triple {20116#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20116#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:14,606 INFO L273 TraceCheckUtils]: 19: Hoare triple {20116#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20117#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:14,607 INFO L273 TraceCheckUtils]: 20: Hoare triple {20117#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20117#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:14,607 INFO L273 TraceCheckUtils]: 21: Hoare triple {20117#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20118#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:14,608 INFO L273 TraceCheckUtils]: 22: Hoare triple {20118#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20118#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:14,608 INFO L273 TraceCheckUtils]: 23: Hoare triple {20118#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20119#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:14,609 INFO L273 TraceCheckUtils]: 24: Hoare triple {20119#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20119#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:14,610 INFO L273 TraceCheckUtils]: 25: Hoare triple {20119#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20120#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:14,610 INFO L273 TraceCheckUtils]: 26: Hoare triple {20120#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20120#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:14,611 INFO L273 TraceCheckUtils]: 27: Hoare triple {20120#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20121#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:14,611 INFO L273 TraceCheckUtils]: 28: Hoare triple {20121#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20121#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:14,612 INFO L273 TraceCheckUtils]: 29: Hoare triple {20121#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20122#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:14,613 INFO L273 TraceCheckUtils]: 30: Hoare triple {20122#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20122#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:14,613 INFO L273 TraceCheckUtils]: 31: Hoare triple {20122#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20123#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:14,614 INFO L273 TraceCheckUtils]: 32: Hoare triple {20123#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20123#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:14,615 INFO L273 TraceCheckUtils]: 33: Hoare triple {20123#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20124#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:14,615 INFO L273 TraceCheckUtils]: 34: Hoare triple {20124#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20124#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:14,616 INFO L273 TraceCheckUtils]: 35: Hoare triple {20124#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20125#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:14,616 INFO L273 TraceCheckUtils]: 36: Hoare triple {20125#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20125#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:14,617 INFO L273 TraceCheckUtils]: 37: Hoare triple {20125#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20126#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:14,618 INFO L273 TraceCheckUtils]: 38: Hoare triple {20126#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20126#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:14,618 INFO L273 TraceCheckUtils]: 39: Hoare triple {20126#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20127#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:14,619 INFO L273 TraceCheckUtils]: 40: Hoare triple {20127#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20127#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:14,620 INFO L273 TraceCheckUtils]: 41: Hoare triple {20127#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20128#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:14,620 INFO L273 TraceCheckUtils]: 42: Hoare triple {20128#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20128#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:14,621 INFO L273 TraceCheckUtils]: 43: Hoare triple {20128#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20129#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:14,621 INFO L273 TraceCheckUtils]: 44: Hoare triple {20129#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20129#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:14,622 INFO L273 TraceCheckUtils]: 45: Hoare triple {20129#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20130#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:14,623 INFO L273 TraceCheckUtils]: 46: Hoare triple {20130#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20130#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:14,623 INFO L273 TraceCheckUtils]: 47: Hoare triple {20130#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20131#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:14,624 INFO L273 TraceCheckUtils]: 48: Hoare triple {20131#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20131#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:14,625 INFO L273 TraceCheckUtils]: 49: Hoare triple {20131#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:14,625 INFO L273 TraceCheckUtils]: 50: Hoare triple {20132#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:14,626 INFO L273 TraceCheckUtils]: 51: Hoare triple {20132#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20133#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:14,626 INFO L273 TraceCheckUtils]: 52: Hoare triple {20133#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20133#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:14,627 INFO L273 TraceCheckUtils]: 53: Hoare triple {20133#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20134#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:14,628 INFO L273 TraceCheckUtils]: 54: Hoare triple {20134#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20134#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:14,628 INFO L273 TraceCheckUtils]: 55: Hoare triple {20134#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20135#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:14,629 INFO L273 TraceCheckUtils]: 56: Hoare triple {20135#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20135#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:14,630 INFO L273 TraceCheckUtils]: 57: Hoare triple {20135#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20136#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:14,630 INFO L273 TraceCheckUtils]: 58: Hoare triple {20136#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20136#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:14,631 INFO L273 TraceCheckUtils]: 59: Hoare triple {20136#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20137#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:14,631 INFO L273 TraceCheckUtils]: 60: Hoare triple {20137#(<= main_~i~1 27)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20137#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:14,632 INFO L273 TraceCheckUtils]: 61: Hoare triple {20137#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20138#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:14,633 INFO L273 TraceCheckUtils]: 62: Hoare triple {20138#(<= main_~i~1 28)} assume !(~i~1 < 100000); {20109#false} is VALID [2018-11-23 12:30:14,633 INFO L256 TraceCheckUtils]: 63: Hoare triple {20109#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {20108#true} is VALID [2018-11-23 12:30:14,633 INFO L273 TraceCheckUtils]: 64: Hoare triple {20108#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {20108#true} is VALID [2018-11-23 12:30:14,633 INFO L273 TraceCheckUtils]: 65: Hoare triple {20108#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20108#true} is VALID [2018-11-23 12:30:14,634 INFO L273 TraceCheckUtils]: 66: Hoare triple {20108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20108#true} is VALID [2018-11-23 12:30:14,634 INFO L273 TraceCheckUtils]: 67: Hoare triple {20108#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20108#true} is VALID [2018-11-23 12:30:14,634 INFO L273 TraceCheckUtils]: 68: Hoare triple {20108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20108#true} is VALID [2018-11-23 12:30:14,634 INFO L273 TraceCheckUtils]: 69: Hoare triple {20108#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20108#true} is VALID [2018-11-23 12:30:14,634 INFO L273 TraceCheckUtils]: 70: Hoare triple {20108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20108#true} is VALID [2018-11-23 12:30:14,635 INFO L273 TraceCheckUtils]: 71: Hoare triple {20108#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20108#true} is VALID [2018-11-23 12:30:14,635 INFO L273 TraceCheckUtils]: 72: Hoare triple {20108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20108#true} is VALID [2018-11-23 12:30:14,635 INFO L273 TraceCheckUtils]: 73: Hoare triple {20108#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20108#true} is VALID [2018-11-23 12:30:14,635 INFO L273 TraceCheckUtils]: 74: Hoare triple {20108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20108#true} is VALID [2018-11-23 12:30:14,635 INFO L273 TraceCheckUtils]: 75: Hoare triple {20108#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20108#true} is VALID [2018-11-23 12:30:14,635 INFO L273 TraceCheckUtils]: 76: Hoare triple {20108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20108#true} is VALID [2018-11-23 12:30:14,635 INFO L273 TraceCheckUtils]: 77: Hoare triple {20108#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20108#true} is VALID [2018-11-23 12:30:14,636 INFO L273 TraceCheckUtils]: 78: Hoare triple {20108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20108#true} is VALID [2018-11-23 12:30:14,636 INFO L273 TraceCheckUtils]: 79: Hoare triple {20108#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20108#true} is VALID [2018-11-23 12:30:14,636 INFO L273 TraceCheckUtils]: 80: Hoare triple {20108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20108#true} is VALID [2018-11-23 12:30:14,636 INFO L273 TraceCheckUtils]: 81: Hoare triple {20108#true} assume !(~i~0 < 100000); {20108#true} is VALID [2018-11-23 12:30:14,636 INFO L273 TraceCheckUtils]: 82: Hoare triple {20108#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {20108#true} is VALID [2018-11-23 12:30:14,636 INFO L273 TraceCheckUtils]: 83: Hoare triple {20108#true} assume true; {20108#true} is VALID [2018-11-23 12:30:14,636 INFO L268 TraceCheckUtils]: 84: Hoare quadruple {20108#true} {20109#false} #70#return; {20109#false} is VALID [2018-11-23 12:30:14,636 INFO L273 TraceCheckUtils]: 85: Hoare triple {20109#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {20109#false} is VALID [2018-11-23 12:30:14,636 INFO L256 TraceCheckUtils]: 86: Hoare triple {20109#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {20108#true} is VALID [2018-11-23 12:30:14,636 INFO L273 TraceCheckUtils]: 87: Hoare triple {20108#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {20108#true} is VALID [2018-11-23 12:30:14,637 INFO L273 TraceCheckUtils]: 88: Hoare triple {20108#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20108#true} is VALID [2018-11-23 12:30:14,637 INFO L273 TraceCheckUtils]: 89: Hoare triple {20108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20108#true} is VALID [2018-11-23 12:30:14,637 INFO L273 TraceCheckUtils]: 90: Hoare triple {20108#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20108#true} is VALID [2018-11-23 12:30:14,637 INFO L273 TraceCheckUtils]: 91: Hoare triple {20108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20108#true} is VALID [2018-11-23 12:30:14,637 INFO L273 TraceCheckUtils]: 92: Hoare triple {20108#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20108#true} is VALID [2018-11-23 12:30:14,637 INFO L273 TraceCheckUtils]: 93: Hoare triple {20108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20108#true} is VALID [2018-11-23 12:30:14,637 INFO L273 TraceCheckUtils]: 94: Hoare triple {20108#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20108#true} is VALID [2018-11-23 12:30:14,637 INFO L273 TraceCheckUtils]: 95: Hoare triple {20108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20108#true} is VALID [2018-11-23 12:30:14,637 INFO L273 TraceCheckUtils]: 96: Hoare triple {20108#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20108#true} is VALID [2018-11-23 12:30:14,637 INFO L273 TraceCheckUtils]: 97: Hoare triple {20108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20108#true} is VALID [2018-11-23 12:30:14,638 INFO L273 TraceCheckUtils]: 98: Hoare triple {20108#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20108#true} is VALID [2018-11-23 12:30:14,638 INFO L273 TraceCheckUtils]: 99: Hoare triple {20108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20108#true} is VALID [2018-11-23 12:30:14,638 INFO L273 TraceCheckUtils]: 100: Hoare triple {20108#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20108#true} is VALID [2018-11-23 12:30:14,638 INFO L273 TraceCheckUtils]: 101: Hoare triple {20108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20108#true} is VALID [2018-11-23 12:30:14,638 INFO L273 TraceCheckUtils]: 102: Hoare triple {20108#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20108#true} is VALID [2018-11-23 12:30:14,638 INFO L273 TraceCheckUtils]: 103: Hoare triple {20108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20108#true} is VALID [2018-11-23 12:30:14,638 INFO L273 TraceCheckUtils]: 104: Hoare triple {20108#true} assume !(~i~0 < 100000); {20108#true} is VALID [2018-11-23 12:30:14,638 INFO L273 TraceCheckUtils]: 105: Hoare triple {20108#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {20108#true} is VALID [2018-11-23 12:30:14,638 INFO L273 TraceCheckUtils]: 106: Hoare triple {20108#true} assume true; {20108#true} is VALID [2018-11-23 12:30:14,639 INFO L268 TraceCheckUtils]: 107: Hoare quadruple {20108#true} {20109#false} #72#return; {20109#false} is VALID [2018-11-23 12:30:14,639 INFO L273 TraceCheckUtils]: 108: Hoare triple {20109#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {20109#false} is VALID [2018-11-23 12:30:14,639 INFO L273 TraceCheckUtils]: 109: Hoare triple {20109#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20109#false} is VALID [2018-11-23 12:30:14,639 INFO L273 TraceCheckUtils]: 110: Hoare triple {20109#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20109#false} is VALID [2018-11-23 12:30:14,639 INFO L273 TraceCheckUtils]: 111: Hoare triple {20109#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20109#false} is VALID [2018-11-23 12:30:14,639 INFO L273 TraceCheckUtils]: 112: Hoare triple {20109#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20109#false} is VALID [2018-11-23 12:30:14,639 INFO L273 TraceCheckUtils]: 113: Hoare triple {20109#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20109#false} is VALID [2018-11-23 12:30:14,639 INFO L273 TraceCheckUtils]: 114: Hoare triple {20109#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20109#false} is VALID [2018-11-23 12:30:14,639 INFO L273 TraceCheckUtils]: 115: Hoare triple {20109#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20109#false} is VALID [2018-11-23 12:30:14,639 INFO L273 TraceCheckUtils]: 116: Hoare triple {20109#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20109#false} is VALID [2018-11-23 12:30:14,640 INFO L273 TraceCheckUtils]: 117: Hoare triple {20109#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20109#false} is VALID [2018-11-23 12:30:14,640 INFO L273 TraceCheckUtils]: 118: Hoare triple {20109#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20109#false} is VALID [2018-11-23 12:30:14,640 INFO L273 TraceCheckUtils]: 119: Hoare triple {20109#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20109#false} is VALID [2018-11-23 12:30:14,640 INFO L273 TraceCheckUtils]: 120: Hoare triple {20109#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20109#false} is VALID [2018-11-23 12:30:14,640 INFO L273 TraceCheckUtils]: 121: Hoare triple {20109#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20109#false} is VALID [2018-11-23 12:30:14,640 INFO L273 TraceCheckUtils]: 122: Hoare triple {20109#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20109#false} is VALID [2018-11-23 12:30:14,640 INFO L273 TraceCheckUtils]: 123: Hoare triple {20109#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20109#false} is VALID [2018-11-23 12:30:14,640 INFO L273 TraceCheckUtils]: 124: Hoare triple {20109#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20109#false} is VALID [2018-11-23 12:30:14,640 INFO L273 TraceCheckUtils]: 125: Hoare triple {20109#false} assume !(~i~2 < 99999); {20109#false} is VALID [2018-11-23 12:30:14,641 INFO L273 TraceCheckUtils]: 126: Hoare triple {20109#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {20109#false} is VALID [2018-11-23 12:30:14,641 INFO L256 TraceCheckUtils]: 127: Hoare triple {20109#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {20108#true} is VALID [2018-11-23 12:30:14,641 INFO L273 TraceCheckUtils]: 128: Hoare triple {20108#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {20108#true} is VALID [2018-11-23 12:30:14,641 INFO L273 TraceCheckUtils]: 129: Hoare triple {20108#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20108#true} is VALID [2018-11-23 12:30:14,641 INFO L273 TraceCheckUtils]: 130: Hoare triple {20108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20108#true} is VALID [2018-11-23 12:30:14,641 INFO L273 TraceCheckUtils]: 131: Hoare triple {20108#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20108#true} is VALID [2018-11-23 12:30:14,641 INFO L273 TraceCheckUtils]: 132: Hoare triple {20108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20108#true} is VALID [2018-11-23 12:30:14,641 INFO L273 TraceCheckUtils]: 133: Hoare triple {20108#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20108#true} is VALID [2018-11-23 12:30:14,641 INFO L273 TraceCheckUtils]: 134: Hoare triple {20108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20108#true} is VALID [2018-11-23 12:30:14,641 INFO L273 TraceCheckUtils]: 135: Hoare triple {20108#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20108#true} is VALID [2018-11-23 12:30:14,642 INFO L273 TraceCheckUtils]: 136: Hoare triple {20108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20108#true} is VALID [2018-11-23 12:30:14,642 INFO L273 TraceCheckUtils]: 137: Hoare triple {20108#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20108#true} is VALID [2018-11-23 12:30:14,642 INFO L273 TraceCheckUtils]: 138: Hoare triple {20108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20108#true} is VALID [2018-11-23 12:30:14,642 INFO L273 TraceCheckUtils]: 139: Hoare triple {20108#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20108#true} is VALID [2018-11-23 12:30:14,642 INFO L273 TraceCheckUtils]: 140: Hoare triple {20108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20108#true} is VALID [2018-11-23 12:30:14,642 INFO L273 TraceCheckUtils]: 141: Hoare triple {20108#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20108#true} is VALID [2018-11-23 12:30:14,642 INFO L273 TraceCheckUtils]: 142: Hoare triple {20108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20108#true} is VALID [2018-11-23 12:30:14,642 INFO L273 TraceCheckUtils]: 143: Hoare triple {20108#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20108#true} is VALID [2018-11-23 12:30:14,642 INFO L273 TraceCheckUtils]: 144: Hoare triple {20108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20108#true} is VALID [2018-11-23 12:30:14,643 INFO L273 TraceCheckUtils]: 145: Hoare triple {20108#true} assume !(~i~0 < 100000); {20108#true} is VALID [2018-11-23 12:30:14,643 INFO L273 TraceCheckUtils]: 146: Hoare triple {20108#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {20108#true} is VALID [2018-11-23 12:30:14,643 INFO L273 TraceCheckUtils]: 147: Hoare triple {20108#true} assume true; {20108#true} is VALID [2018-11-23 12:30:14,643 INFO L268 TraceCheckUtils]: 148: Hoare quadruple {20108#true} {20109#false} #74#return; {20109#false} is VALID [2018-11-23 12:30:14,643 INFO L273 TraceCheckUtils]: 149: Hoare triple {20109#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {20109#false} is VALID [2018-11-23 12:30:14,643 INFO L273 TraceCheckUtils]: 150: Hoare triple {20109#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {20109#false} is VALID [2018-11-23 12:30:14,643 INFO L273 TraceCheckUtils]: 151: Hoare triple {20109#false} assume !false; {20109#false} is VALID [2018-11-23 12:30:14,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1487 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2018-11-23 12:30:14,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:30:14,655 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 12:30:14,665 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:30:14,735 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:30:14,735 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:30:14,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:14,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:30:15,068 INFO L256 TraceCheckUtils]: 0: Hoare triple {20108#true} call ULTIMATE.init(); {20108#true} is VALID [2018-11-23 12:30:15,068 INFO L273 TraceCheckUtils]: 1: Hoare triple {20108#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20108#true} is VALID [2018-11-23 12:30:15,068 INFO L273 TraceCheckUtils]: 2: Hoare triple {20108#true} assume true; {20108#true} is VALID [2018-11-23 12:30:15,069 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20108#true} {20108#true} #66#return; {20108#true} is VALID [2018-11-23 12:30:15,069 INFO L256 TraceCheckUtils]: 4: Hoare triple {20108#true} call #t~ret13 := main(); {20108#true} is VALID [2018-11-23 12:30:15,069 INFO L273 TraceCheckUtils]: 5: Hoare triple {20108#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {20108#true} is VALID [2018-11-23 12:30:15,069 INFO L273 TraceCheckUtils]: 6: Hoare triple {20108#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20108#true} is VALID [2018-11-23 12:30:15,069 INFO L273 TraceCheckUtils]: 7: Hoare triple {20108#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20108#true} is VALID [2018-11-23 12:30:15,070 INFO L273 TraceCheckUtils]: 8: Hoare triple {20108#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20108#true} is VALID [2018-11-23 12:30:15,070 INFO L273 TraceCheckUtils]: 9: Hoare triple {20108#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20108#true} is VALID [2018-11-23 12:30:15,070 INFO L273 TraceCheckUtils]: 10: Hoare triple {20108#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20108#true} is VALID [2018-11-23 12:30:15,070 INFO L273 TraceCheckUtils]: 11: Hoare triple {20108#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20108#true} is VALID [2018-11-23 12:30:15,070 INFO L273 TraceCheckUtils]: 12: Hoare triple {20108#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20108#true} is VALID [2018-11-23 12:30:15,070 INFO L273 TraceCheckUtils]: 13: Hoare triple {20108#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20108#true} is VALID [2018-11-23 12:30:15,070 INFO L273 TraceCheckUtils]: 14: Hoare triple {20108#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20108#true} is VALID [2018-11-23 12:30:15,070 INFO L273 TraceCheckUtils]: 15: Hoare triple {20108#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20108#true} is VALID [2018-11-23 12:30:15,071 INFO L273 TraceCheckUtils]: 16: Hoare triple {20108#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20108#true} is VALID [2018-11-23 12:30:15,071 INFO L273 TraceCheckUtils]: 17: Hoare triple {20108#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20108#true} is VALID [2018-11-23 12:30:15,071 INFO L273 TraceCheckUtils]: 18: Hoare triple {20108#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20108#true} is VALID [2018-11-23 12:30:15,071 INFO L273 TraceCheckUtils]: 19: Hoare triple {20108#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20108#true} is VALID [2018-11-23 12:30:15,071 INFO L273 TraceCheckUtils]: 20: Hoare triple {20108#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20108#true} is VALID [2018-11-23 12:30:15,071 INFO L273 TraceCheckUtils]: 21: Hoare triple {20108#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20108#true} is VALID [2018-11-23 12:30:15,071 INFO L273 TraceCheckUtils]: 22: Hoare triple {20108#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20108#true} is VALID [2018-11-23 12:30:15,071 INFO L273 TraceCheckUtils]: 23: Hoare triple {20108#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20108#true} is VALID [2018-11-23 12:30:15,071 INFO L273 TraceCheckUtils]: 24: Hoare triple {20108#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20108#true} is VALID [2018-11-23 12:30:15,072 INFO L273 TraceCheckUtils]: 25: Hoare triple {20108#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20108#true} is VALID [2018-11-23 12:30:15,072 INFO L273 TraceCheckUtils]: 26: Hoare triple {20108#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20108#true} is VALID [2018-11-23 12:30:15,072 INFO L273 TraceCheckUtils]: 27: Hoare triple {20108#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20108#true} is VALID [2018-11-23 12:30:15,072 INFO L273 TraceCheckUtils]: 28: Hoare triple {20108#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20108#true} is VALID [2018-11-23 12:30:15,072 INFO L273 TraceCheckUtils]: 29: Hoare triple {20108#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20108#true} is VALID [2018-11-23 12:30:15,072 INFO L273 TraceCheckUtils]: 30: Hoare triple {20108#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20108#true} is VALID [2018-11-23 12:30:15,072 INFO L273 TraceCheckUtils]: 31: Hoare triple {20108#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20108#true} is VALID [2018-11-23 12:30:15,072 INFO L273 TraceCheckUtils]: 32: Hoare triple {20108#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20108#true} is VALID [2018-11-23 12:30:15,072 INFO L273 TraceCheckUtils]: 33: Hoare triple {20108#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20108#true} is VALID [2018-11-23 12:30:15,072 INFO L273 TraceCheckUtils]: 34: Hoare triple {20108#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20108#true} is VALID [2018-11-23 12:30:15,073 INFO L273 TraceCheckUtils]: 35: Hoare triple {20108#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20108#true} is VALID [2018-11-23 12:30:15,073 INFO L273 TraceCheckUtils]: 36: Hoare triple {20108#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20108#true} is VALID [2018-11-23 12:30:15,073 INFO L273 TraceCheckUtils]: 37: Hoare triple {20108#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20108#true} is VALID [2018-11-23 12:30:15,073 INFO L273 TraceCheckUtils]: 38: Hoare triple {20108#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20108#true} is VALID [2018-11-23 12:30:15,073 INFO L273 TraceCheckUtils]: 39: Hoare triple {20108#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20108#true} is VALID [2018-11-23 12:30:15,073 INFO L273 TraceCheckUtils]: 40: Hoare triple {20108#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20108#true} is VALID [2018-11-23 12:30:15,073 INFO L273 TraceCheckUtils]: 41: Hoare triple {20108#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20108#true} is VALID [2018-11-23 12:30:15,073 INFO L273 TraceCheckUtils]: 42: Hoare triple {20108#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20108#true} is VALID [2018-11-23 12:30:15,073 INFO L273 TraceCheckUtils]: 43: Hoare triple {20108#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20108#true} is VALID [2018-11-23 12:30:15,073 INFO L273 TraceCheckUtils]: 44: Hoare triple {20108#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20108#true} is VALID [2018-11-23 12:30:15,074 INFO L273 TraceCheckUtils]: 45: Hoare triple {20108#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20108#true} is VALID [2018-11-23 12:30:15,074 INFO L273 TraceCheckUtils]: 46: Hoare triple {20108#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20108#true} is VALID [2018-11-23 12:30:15,074 INFO L273 TraceCheckUtils]: 47: Hoare triple {20108#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20108#true} is VALID [2018-11-23 12:30:15,074 INFO L273 TraceCheckUtils]: 48: Hoare triple {20108#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20108#true} is VALID [2018-11-23 12:30:15,074 INFO L273 TraceCheckUtils]: 49: Hoare triple {20108#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20108#true} is VALID [2018-11-23 12:30:15,074 INFO L273 TraceCheckUtils]: 50: Hoare triple {20108#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20108#true} is VALID [2018-11-23 12:30:15,074 INFO L273 TraceCheckUtils]: 51: Hoare triple {20108#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20108#true} is VALID [2018-11-23 12:30:15,074 INFO L273 TraceCheckUtils]: 52: Hoare triple {20108#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20108#true} is VALID [2018-11-23 12:30:15,074 INFO L273 TraceCheckUtils]: 53: Hoare triple {20108#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20108#true} is VALID [2018-11-23 12:30:15,075 INFO L273 TraceCheckUtils]: 54: Hoare triple {20108#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20108#true} is VALID [2018-11-23 12:30:15,075 INFO L273 TraceCheckUtils]: 55: Hoare triple {20108#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20108#true} is VALID [2018-11-23 12:30:15,075 INFO L273 TraceCheckUtils]: 56: Hoare triple {20108#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20108#true} is VALID [2018-11-23 12:30:15,075 INFO L273 TraceCheckUtils]: 57: Hoare triple {20108#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20108#true} is VALID [2018-11-23 12:30:15,075 INFO L273 TraceCheckUtils]: 58: Hoare triple {20108#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20108#true} is VALID [2018-11-23 12:30:15,075 INFO L273 TraceCheckUtils]: 59: Hoare triple {20108#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20108#true} is VALID [2018-11-23 12:30:15,075 INFO L273 TraceCheckUtils]: 60: Hoare triple {20108#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20108#true} is VALID [2018-11-23 12:30:15,075 INFO L273 TraceCheckUtils]: 61: Hoare triple {20108#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20108#true} is VALID [2018-11-23 12:30:15,075 INFO L273 TraceCheckUtils]: 62: Hoare triple {20108#true} assume !(~i~1 < 100000); {20108#true} is VALID [2018-11-23 12:30:15,075 INFO L256 TraceCheckUtils]: 63: Hoare triple {20108#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {20108#true} is VALID [2018-11-23 12:30:15,076 INFO L273 TraceCheckUtils]: 64: Hoare triple {20108#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {20108#true} is VALID [2018-11-23 12:30:15,076 INFO L273 TraceCheckUtils]: 65: Hoare triple {20108#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20108#true} is VALID [2018-11-23 12:30:15,076 INFO L273 TraceCheckUtils]: 66: Hoare triple {20108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20108#true} is VALID [2018-11-23 12:30:15,076 INFO L273 TraceCheckUtils]: 67: Hoare triple {20108#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20108#true} is VALID [2018-11-23 12:30:15,076 INFO L273 TraceCheckUtils]: 68: Hoare triple {20108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20108#true} is VALID [2018-11-23 12:30:15,076 INFO L273 TraceCheckUtils]: 69: Hoare triple {20108#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20108#true} is VALID [2018-11-23 12:30:15,076 INFO L273 TraceCheckUtils]: 70: Hoare triple {20108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20108#true} is VALID [2018-11-23 12:30:15,076 INFO L273 TraceCheckUtils]: 71: Hoare triple {20108#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20108#true} is VALID [2018-11-23 12:30:15,076 INFO L273 TraceCheckUtils]: 72: Hoare triple {20108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20108#true} is VALID [2018-11-23 12:30:15,077 INFO L273 TraceCheckUtils]: 73: Hoare triple {20108#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20108#true} is VALID [2018-11-23 12:30:15,077 INFO L273 TraceCheckUtils]: 74: Hoare triple {20108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20108#true} is VALID [2018-11-23 12:30:15,077 INFO L273 TraceCheckUtils]: 75: Hoare triple {20108#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20108#true} is VALID [2018-11-23 12:30:15,077 INFO L273 TraceCheckUtils]: 76: Hoare triple {20108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20108#true} is VALID [2018-11-23 12:30:15,077 INFO L273 TraceCheckUtils]: 77: Hoare triple {20108#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20108#true} is VALID [2018-11-23 12:30:15,077 INFO L273 TraceCheckUtils]: 78: Hoare triple {20108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20108#true} is VALID [2018-11-23 12:30:15,077 INFO L273 TraceCheckUtils]: 79: Hoare triple {20108#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20108#true} is VALID [2018-11-23 12:30:15,077 INFO L273 TraceCheckUtils]: 80: Hoare triple {20108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20108#true} is VALID [2018-11-23 12:30:15,077 INFO L273 TraceCheckUtils]: 81: Hoare triple {20108#true} assume !(~i~0 < 100000); {20108#true} is VALID [2018-11-23 12:30:15,077 INFO L273 TraceCheckUtils]: 82: Hoare triple {20108#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {20108#true} is VALID [2018-11-23 12:30:15,078 INFO L273 TraceCheckUtils]: 83: Hoare triple {20108#true} assume true; {20108#true} is VALID [2018-11-23 12:30:15,078 INFO L268 TraceCheckUtils]: 84: Hoare quadruple {20108#true} {20108#true} #70#return; {20108#true} is VALID [2018-11-23 12:30:15,078 INFO L273 TraceCheckUtils]: 85: Hoare triple {20108#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {20108#true} is VALID [2018-11-23 12:30:15,078 INFO L256 TraceCheckUtils]: 86: Hoare triple {20108#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {20108#true} is VALID [2018-11-23 12:30:15,078 INFO L273 TraceCheckUtils]: 87: Hoare triple {20108#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {20108#true} is VALID [2018-11-23 12:30:15,078 INFO L273 TraceCheckUtils]: 88: Hoare triple {20108#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20108#true} is VALID [2018-11-23 12:30:15,078 INFO L273 TraceCheckUtils]: 89: Hoare triple {20108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20108#true} is VALID [2018-11-23 12:30:15,078 INFO L273 TraceCheckUtils]: 90: Hoare triple {20108#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20108#true} is VALID [2018-11-23 12:30:15,078 INFO L273 TraceCheckUtils]: 91: Hoare triple {20108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20108#true} is VALID [2018-11-23 12:30:15,079 INFO L273 TraceCheckUtils]: 92: Hoare triple {20108#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20108#true} is VALID [2018-11-23 12:30:15,079 INFO L273 TraceCheckUtils]: 93: Hoare triple {20108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20108#true} is VALID [2018-11-23 12:30:15,079 INFO L273 TraceCheckUtils]: 94: Hoare triple {20108#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20108#true} is VALID [2018-11-23 12:30:15,079 INFO L273 TraceCheckUtils]: 95: Hoare triple {20108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20108#true} is VALID [2018-11-23 12:30:15,079 INFO L273 TraceCheckUtils]: 96: Hoare triple {20108#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20108#true} is VALID [2018-11-23 12:30:15,079 INFO L273 TraceCheckUtils]: 97: Hoare triple {20108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20108#true} is VALID [2018-11-23 12:30:15,079 INFO L273 TraceCheckUtils]: 98: Hoare triple {20108#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20108#true} is VALID [2018-11-23 12:30:15,079 INFO L273 TraceCheckUtils]: 99: Hoare triple {20108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20108#true} is VALID [2018-11-23 12:30:15,079 INFO L273 TraceCheckUtils]: 100: Hoare triple {20108#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20108#true} is VALID [2018-11-23 12:30:15,079 INFO L273 TraceCheckUtils]: 101: Hoare triple {20108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20108#true} is VALID [2018-11-23 12:30:15,080 INFO L273 TraceCheckUtils]: 102: Hoare triple {20108#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20108#true} is VALID [2018-11-23 12:30:15,080 INFO L273 TraceCheckUtils]: 103: Hoare triple {20108#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20108#true} is VALID [2018-11-23 12:30:15,080 INFO L273 TraceCheckUtils]: 104: Hoare triple {20108#true} assume !(~i~0 < 100000); {20108#true} is VALID [2018-11-23 12:30:15,080 INFO L273 TraceCheckUtils]: 105: Hoare triple {20108#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {20108#true} is VALID [2018-11-23 12:30:15,080 INFO L273 TraceCheckUtils]: 106: Hoare triple {20108#true} assume true; {20108#true} is VALID [2018-11-23 12:30:15,080 INFO L268 TraceCheckUtils]: 107: Hoare quadruple {20108#true} {20108#true} #72#return; {20108#true} is VALID [2018-11-23 12:30:15,081 INFO L273 TraceCheckUtils]: 108: Hoare triple {20108#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {20108#true} is VALID [2018-11-23 12:30:15,081 INFO L273 TraceCheckUtils]: 109: Hoare triple {20108#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20108#true} is VALID [2018-11-23 12:30:15,081 INFO L273 TraceCheckUtils]: 110: Hoare triple {20108#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20108#true} is VALID [2018-11-23 12:30:15,081 INFO L273 TraceCheckUtils]: 111: Hoare triple {20108#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20108#true} is VALID [2018-11-23 12:30:15,081 INFO L273 TraceCheckUtils]: 112: Hoare triple {20108#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20108#true} is VALID [2018-11-23 12:30:15,081 INFO L273 TraceCheckUtils]: 113: Hoare triple {20108#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20108#true} is VALID [2018-11-23 12:30:15,081 INFO L273 TraceCheckUtils]: 114: Hoare triple {20108#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20108#true} is VALID [2018-11-23 12:30:15,081 INFO L273 TraceCheckUtils]: 115: Hoare triple {20108#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20108#true} is VALID [2018-11-23 12:30:15,081 INFO L273 TraceCheckUtils]: 116: Hoare triple {20108#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20108#true} is VALID [2018-11-23 12:30:15,082 INFO L273 TraceCheckUtils]: 117: Hoare triple {20108#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20108#true} is VALID [2018-11-23 12:30:15,082 INFO L273 TraceCheckUtils]: 118: Hoare triple {20108#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20108#true} is VALID [2018-11-23 12:30:15,082 INFO L273 TraceCheckUtils]: 119: Hoare triple {20108#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20108#true} is VALID [2018-11-23 12:30:15,082 INFO L273 TraceCheckUtils]: 120: Hoare triple {20108#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20108#true} is VALID [2018-11-23 12:30:15,082 INFO L273 TraceCheckUtils]: 121: Hoare triple {20108#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20108#true} is VALID [2018-11-23 12:30:15,082 INFO L273 TraceCheckUtils]: 122: Hoare triple {20108#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20108#true} is VALID [2018-11-23 12:30:15,082 INFO L273 TraceCheckUtils]: 123: Hoare triple {20108#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20108#true} is VALID [2018-11-23 12:30:15,082 INFO L273 TraceCheckUtils]: 124: Hoare triple {20108#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20108#true} is VALID [2018-11-23 12:30:15,082 INFO L273 TraceCheckUtils]: 125: Hoare triple {20108#true} assume !(~i~2 < 99999); {20108#true} is VALID [2018-11-23 12:30:15,083 INFO L273 TraceCheckUtils]: 126: Hoare triple {20108#true} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {20108#true} is VALID [2018-11-23 12:30:15,083 INFO L256 TraceCheckUtils]: 127: Hoare triple {20108#true} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {20108#true} is VALID [2018-11-23 12:30:15,083 INFO L273 TraceCheckUtils]: 128: Hoare triple {20108#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {20526#(<= xor_~i~0 1)} is VALID [2018-11-23 12:30:15,084 INFO L273 TraceCheckUtils]: 129: Hoare triple {20526#(<= xor_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20526#(<= xor_~i~0 1)} is VALID [2018-11-23 12:30:15,084 INFO L273 TraceCheckUtils]: 130: Hoare triple {20526#(<= xor_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20533#(<= xor_~i~0 2)} is VALID [2018-11-23 12:30:15,084 INFO L273 TraceCheckUtils]: 131: Hoare triple {20533#(<= xor_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20533#(<= xor_~i~0 2)} is VALID [2018-11-23 12:30:15,085 INFO L273 TraceCheckUtils]: 132: Hoare triple {20533#(<= xor_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20540#(<= xor_~i~0 3)} is VALID [2018-11-23 12:30:15,085 INFO L273 TraceCheckUtils]: 133: Hoare triple {20540#(<= xor_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20540#(<= xor_~i~0 3)} is VALID [2018-11-23 12:30:15,086 INFO L273 TraceCheckUtils]: 134: Hoare triple {20540#(<= xor_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20547#(<= xor_~i~0 4)} is VALID [2018-11-23 12:30:15,086 INFO L273 TraceCheckUtils]: 135: Hoare triple {20547#(<= xor_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20547#(<= xor_~i~0 4)} is VALID [2018-11-23 12:30:15,086 INFO L273 TraceCheckUtils]: 136: Hoare triple {20547#(<= xor_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20554#(<= xor_~i~0 5)} is VALID [2018-11-23 12:30:15,087 INFO L273 TraceCheckUtils]: 137: Hoare triple {20554#(<= xor_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20554#(<= xor_~i~0 5)} is VALID [2018-11-23 12:30:15,088 INFO L273 TraceCheckUtils]: 138: Hoare triple {20554#(<= xor_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20561#(<= xor_~i~0 6)} is VALID [2018-11-23 12:30:15,088 INFO L273 TraceCheckUtils]: 139: Hoare triple {20561#(<= xor_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20561#(<= xor_~i~0 6)} is VALID [2018-11-23 12:30:15,089 INFO L273 TraceCheckUtils]: 140: Hoare triple {20561#(<= xor_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20568#(<= xor_~i~0 7)} is VALID [2018-11-23 12:30:15,089 INFO L273 TraceCheckUtils]: 141: Hoare triple {20568#(<= xor_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20568#(<= xor_~i~0 7)} is VALID [2018-11-23 12:30:15,090 INFO L273 TraceCheckUtils]: 142: Hoare triple {20568#(<= xor_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20575#(<= xor_~i~0 8)} is VALID [2018-11-23 12:30:15,091 INFO L273 TraceCheckUtils]: 143: Hoare triple {20575#(<= xor_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20575#(<= xor_~i~0 8)} is VALID [2018-11-23 12:30:15,091 INFO L273 TraceCheckUtils]: 144: Hoare triple {20575#(<= xor_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20582#(<= xor_~i~0 9)} is VALID [2018-11-23 12:30:15,092 INFO L273 TraceCheckUtils]: 145: Hoare triple {20582#(<= xor_~i~0 9)} assume !(~i~0 < 100000); {20109#false} is VALID [2018-11-23 12:30:15,092 INFO L273 TraceCheckUtils]: 146: Hoare triple {20109#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {20109#false} is VALID [2018-11-23 12:30:15,092 INFO L273 TraceCheckUtils]: 147: Hoare triple {20109#false} assume true; {20109#false} is VALID [2018-11-23 12:30:15,093 INFO L268 TraceCheckUtils]: 148: Hoare quadruple {20109#false} {20108#true} #74#return; {20109#false} is VALID [2018-11-23 12:30:15,093 INFO L273 TraceCheckUtils]: 149: Hoare triple {20109#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {20109#false} is VALID [2018-11-23 12:30:15,093 INFO L273 TraceCheckUtils]: 150: Hoare triple {20109#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {20109#false} is VALID [2018-11-23 12:30:15,093 INFO L273 TraceCheckUtils]: 151: Hoare triple {20109#false} assume !false; {20109#false} is VALID [2018-11-23 12:30:15,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1487 backedges. 296 proven. 64 refuted. 0 times theorem prover too weak. 1127 trivial. 0 not checked. [2018-11-23 12:30:15,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:30:15,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 11] total 40 [2018-11-23 12:30:15,126 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 152 [2018-11-23 12:30:15,126 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:30:15,127 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states. [2018-11-23 12:30:15,252 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:30:15,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-23 12:30:15,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-23 12:30:15,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=519, Invalid=1041, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 12:30:15,253 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand 40 states. [2018-11-23 12:30:16,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:16,383 INFO L93 Difference]: Finished difference Result 165 states and 177 transitions. [2018-11-23 12:30:16,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-23 12:30:16,383 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 152 [2018-11-23 12:30:16,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:30:16,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:30:16,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 132 transitions. [2018-11-23 12:30:16,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:30:16,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 132 transitions. [2018-11-23 12:30:16,386 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 132 transitions. [2018-11-23 12:30:16,513 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:30:16,516 INFO L225 Difference]: With dead ends: 165 [2018-11-23 12:30:16,516 INFO L226 Difference]: Without dead ends: 117 [2018-11-23 12:30:16,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=519, Invalid=1041, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 12:30:16,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-23 12:30:16,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-11-23 12:30:16,567 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:30:16,567 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand 115 states. [2018-11-23 12:30:16,568 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 115 states. [2018-11-23 12:30:16,568 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 115 states. [2018-11-23 12:30:16,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:16,570 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2018-11-23 12:30:16,570 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2018-11-23 12:30:16,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:16,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:16,571 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 117 states. [2018-11-23 12:30:16,571 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 117 states. [2018-11-23 12:30:16,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:16,573 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2018-11-23 12:30:16,573 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2018-11-23 12:30:16,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:16,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:16,573 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:30:16,573 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:30:16,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-23 12:30:16,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 119 transitions. [2018-11-23 12:30:16,575 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 119 transitions. Word has length 152 [2018-11-23 12:30:16,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:30:16,575 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 119 transitions. [2018-11-23 12:30:16,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-23 12:30:16,575 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2018-11-23 12:30:16,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-23 12:30:16,576 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:30:16,576 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 27, 27, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:30:16,577 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:30:16,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:30:16,577 INFO L82 PathProgramCache]: Analyzing trace with hash 402103075, now seen corresponding path program 29 times [2018-11-23 12:30:16,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:30:16,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:30:16,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:16,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:30:16,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:16,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:17,971 INFO L256 TraceCheckUtils]: 0: Hoare triple {21253#true} call ULTIMATE.init(); {21253#true} is VALID [2018-11-23 12:30:17,971 INFO L273 TraceCheckUtils]: 1: Hoare triple {21253#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21253#true} is VALID [2018-11-23 12:30:17,972 INFO L273 TraceCheckUtils]: 2: Hoare triple {21253#true} assume true; {21253#true} is VALID [2018-11-23 12:30:17,972 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21253#true} {21253#true} #66#return; {21253#true} is VALID [2018-11-23 12:30:17,972 INFO L256 TraceCheckUtils]: 4: Hoare triple {21253#true} call #t~ret13 := main(); {21253#true} is VALID [2018-11-23 12:30:17,972 INFO L273 TraceCheckUtils]: 5: Hoare triple {21253#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {21255#(= main_~i~1 0)} is VALID [2018-11-23 12:30:17,973 INFO L273 TraceCheckUtils]: 6: Hoare triple {21255#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21255#(= main_~i~1 0)} is VALID [2018-11-23 12:30:17,974 INFO L273 TraceCheckUtils]: 7: Hoare triple {21255#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21256#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:17,974 INFO L273 TraceCheckUtils]: 8: Hoare triple {21256#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21256#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:17,974 INFO L273 TraceCheckUtils]: 9: Hoare triple {21256#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21257#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:17,975 INFO L273 TraceCheckUtils]: 10: Hoare triple {21257#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21257#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:17,975 INFO L273 TraceCheckUtils]: 11: Hoare triple {21257#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21258#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:17,975 INFO L273 TraceCheckUtils]: 12: Hoare triple {21258#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21258#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:17,976 INFO L273 TraceCheckUtils]: 13: Hoare triple {21258#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21259#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:17,976 INFO L273 TraceCheckUtils]: 14: Hoare triple {21259#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21259#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:17,977 INFO L273 TraceCheckUtils]: 15: Hoare triple {21259#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21260#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:17,977 INFO L273 TraceCheckUtils]: 16: Hoare triple {21260#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21260#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:17,978 INFO L273 TraceCheckUtils]: 17: Hoare triple {21260#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21261#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:17,978 INFO L273 TraceCheckUtils]: 18: Hoare triple {21261#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21261#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:17,979 INFO L273 TraceCheckUtils]: 19: Hoare triple {21261#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21262#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:17,980 INFO L273 TraceCheckUtils]: 20: Hoare triple {21262#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21262#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:17,980 INFO L273 TraceCheckUtils]: 21: Hoare triple {21262#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21263#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:17,981 INFO L273 TraceCheckUtils]: 22: Hoare triple {21263#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21263#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:17,982 INFO L273 TraceCheckUtils]: 23: Hoare triple {21263#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21264#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:17,982 INFO L273 TraceCheckUtils]: 24: Hoare triple {21264#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21264#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:17,983 INFO L273 TraceCheckUtils]: 25: Hoare triple {21264#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21265#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:17,983 INFO L273 TraceCheckUtils]: 26: Hoare triple {21265#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21265#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:17,984 INFO L273 TraceCheckUtils]: 27: Hoare triple {21265#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21266#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:17,985 INFO L273 TraceCheckUtils]: 28: Hoare triple {21266#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21266#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:17,986 INFO L273 TraceCheckUtils]: 29: Hoare triple {21266#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21267#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:17,986 INFO L273 TraceCheckUtils]: 30: Hoare triple {21267#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21267#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:17,987 INFO L273 TraceCheckUtils]: 31: Hoare triple {21267#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21268#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:17,987 INFO L273 TraceCheckUtils]: 32: Hoare triple {21268#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21268#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:17,988 INFO L273 TraceCheckUtils]: 33: Hoare triple {21268#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21269#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:17,989 INFO L273 TraceCheckUtils]: 34: Hoare triple {21269#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21269#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:17,989 INFO L273 TraceCheckUtils]: 35: Hoare triple {21269#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21270#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:17,990 INFO L273 TraceCheckUtils]: 36: Hoare triple {21270#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21270#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:17,990 INFO L273 TraceCheckUtils]: 37: Hoare triple {21270#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21271#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:17,991 INFO L273 TraceCheckUtils]: 38: Hoare triple {21271#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21271#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:17,992 INFO L273 TraceCheckUtils]: 39: Hoare triple {21271#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21272#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:17,992 INFO L273 TraceCheckUtils]: 40: Hoare triple {21272#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21272#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:17,993 INFO L273 TraceCheckUtils]: 41: Hoare triple {21272#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21273#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:17,994 INFO L273 TraceCheckUtils]: 42: Hoare triple {21273#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21273#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:17,994 INFO L273 TraceCheckUtils]: 43: Hoare triple {21273#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21274#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:17,995 INFO L273 TraceCheckUtils]: 44: Hoare triple {21274#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21274#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:17,996 INFO L273 TraceCheckUtils]: 45: Hoare triple {21274#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21275#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:17,996 INFO L273 TraceCheckUtils]: 46: Hoare triple {21275#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21275#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:17,997 INFO L273 TraceCheckUtils]: 47: Hoare triple {21275#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21276#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:17,997 INFO L273 TraceCheckUtils]: 48: Hoare triple {21276#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21276#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:17,998 INFO L273 TraceCheckUtils]: 49: Hoare triple {21276#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:17,999 INFO L273 TraceCheckUtils]: 50: Hoare triple {21277#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:17,999 INFO L273 TraceCheckUtils]: 51: Hoare triple {21277#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21278#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:18,000 INFO L273 TraceCheckUtils]: 52: Hoare triple {21278#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21278#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:18,001 INFO L273 TraceCheckUtils]: 53: Hoare triple {21278#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21279#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:18,001 INFO L273 TraceCheckUtils]: 54: Hoare triple {21279#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21279#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:18,002 INFO L273 TraceCheckUtils]: 55: Hoare triple {21279#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21280#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:18,002 INFO L273 TraceCheckUtils]: 56: Hoare triple {21280#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21280#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:18,003 INFO L273 TraceCheckUtils]: 57: Hoare triple {21280#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21281#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:18,004 INFO L273 TraceCheckUtils]: 58: Hoare triple {21281#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21281#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:18,004 INFO L273 TraceCheckUtils]: 59: Hoare triple {21281#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21282#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:18,005 INFO L273 TraceCheckUtils]: 60: Hoare triple {21282#(<= main_~i~1 27)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21282#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:18,006 INFO L273 TraceCheckUtils]: 61: Hoare triple {21282#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21283#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:18,006 INFO L273 TraceCheckUtils]: 62: Hoare triple {21283#(<= main_~i~1 28)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21283#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:18,007 INFO L273 TraceCheckUtils]: 63: Hoare triple {21283#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21284#(<= main_~i~1 29)} is VALID [2018-11-23 12:30:18,008 INFO L273 TraceCheckUtils]: 64: Hoare triple {21284#(<= main_~i~1 29)} assume !(~i~1 < 100000); {21254#false} is VALID [2018-11-23 12:30:18,008 INFO L256 TraceCheckUtils]: 65: Hoare triple {21254#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {21253#true} is VALID [2018-11-23 12:30:18,008 INFO L273 TraceCheckUtils]: 66: Hoare triple {21253#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {21253#true} is VALID [2018-11-23 12:30:18,008 INFO L273 TraceCheckUtils]: 67: Hoare triple {21253#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21253#true} is VALID [2018-11-23 12:30:18,008 INFO L273 TraceCheckUtils]: 68: Hoare triple {21253#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21253#true} is VALID [2018-11-23 12:30:18,009 INFO L273 TraceCheckUtils]: 69: Hoare triple {21253#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21253#true} is VALID [2018-11-23 12:30:18,009 INFO L273 TraceCheckUtils]: 70: Hoare triple {21253#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21253#true} is VALID [2018-11-23 12:30:18,009 INFO L273 TraceCheckUtils]: 71: Hoare triple {21253#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21253#true} is VALID [2018-11-23 12:30:18,009 INFO L273 TraceCheckUtils]: 72: Hoare triple {21253#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21253#true} is VALID [2018-11-23 12:30:18,009 INFO L273 TraceCheckUtils]: 73: Hoare triple {21253#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21253#true} is VALID [2018-11-23 12:30:18,009 INFO L273 TraceCheckUtils]: 74: Hoare triple {21253#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21253#true} is VALID [2018-11-23 12:30:18,010 INFO L273 TraceCheckUtils]: 75: Hoare triple {21253#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21253#true} is VALID [2018-11-23 12:30:18,010 INFO L273 TraceCheckUtils]: 76: Hoare triple {21253#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21253#true} is VALID [2018-11-23 12:30:18,010 INFO L273 TraceCheckUtils]: 77: Hoare triple {21253#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21253#true} is VALID [2018-11-23 12:30:18,010 INFO L273 TraceCheckUtils]: 78: Hoare triple {21253#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21253#true} is VALID [2018-11-23 12:30:18,010 INFO L273 TraceCheckUtils]: 79: Hoare triple {21253#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21253#true} is VALID [2018-11-23 12:30:18,011 INFO L273 TraceCheckUtils]: 80: Hoare triple {21253#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21253#true} is VALID [2018-11-23 12:30:18,011 INFO L273 TraceCheckUtils]: 81: Hoare triple {21253#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21253#true} is VALID [2018-11-23 12:30:18,011 INFO L273 TraceCheckUtils]: 82: Hoare triple {21253#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21253#true} is VALID [2018-11-23 12:30:18,011 INFO L273 TraceCheckUtils]: 83: Hoare triple {21253#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21253#true} is VALID [2018-11-23 12:30:18,011 INFO L273 TraceCheckUtils]: 84: Hoare triple {21253#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21253#true} is VALID [2018-11-23 12:30:18,011 INFO L273 TraceCheckUtils]: 85: Hoare triple {21253#true} assume !(~i~0 < 100000); {21253#true} is VALID [2018-11-23 12:30:18,012 INFO L273 TraceCheckUtils]: 86: Hoare triple {21253#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {21253#true} is VALID [2018-11-23 12:30:18,012 INFO L273 TraceCheckUtils]: 87: Hoare triple {21253#true} assume true; {21253#true} is VALID [2018-11-23 12:30:18,012 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {21253#true} {21254#false} #70#return; {21254#false} is VALID [2018-11-23 12:30:18,012 INFO L273 TraceCheckUtils]: 89: Hoare triple {21254#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {21254#false} is VALID [2018-11-23 12:30:18,012 INFO L256 TraceCheckUtils]: 90: Hoare triple {21254#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {21253#true} is VALID [2018-11-23 12:30:18,013 INFO L273 TraceCheckUtils]: 91: Hoare triple {21253#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {21253#true} is VALID [2018-11-23 12:30:18,013 INFO L273 TraceCheckUtils]: 92: Hoare triple {21253#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21253#true} is VALID [2018-11-23 12:30:18,013 INFO L273 TraceCheckUtils]: 93: Hoare triple {21253#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21253#true} is VALID [2018-11-23 12:30:18,013 INFO L273 TraceCheckUtils]: 94: Hoare triple {21253#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21253#true} is VALID [2018-11-23 12:30:18,013 INFO L273 TraceCheckUtils]: 95: Hoare triple {21253#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21253#true} is VALID [2018-11-23 12:30:18,013 INFO L273 TraceCheckUtils]: 96: Hoare triple {21253#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21253#true} is VALID [2018-11-23 12:30:18,013 INFO L273 TraceCheckUtils]: 97: Hoare triple {21253#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21253#true} is VALID [2018-11-23 12:30:18,013 INFO L273 TraceCheckUtils]: 98: Hoare triple {21253#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21253#true} is VALID [2018-11-23 12:30:18,013 INFO L273 TraceCheckUtils]: 99: Hoare triple {21253#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21253#true} is VALID [2018-11-23 12:30:18,013 INFO L273 TraceCheckUtils]: 100: Hoare triple {21253#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21253#true} is VALID [2018-11-23 12:30:18,014 INFO L273 TraceCheckUtils]: 101: Hoare triple {21253#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21253#true} is VALID [2018-11-23 12:30:18,014 INFO L273 TraceCheckUtils]: 102: Hoare triple {21253#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21253#true} is VALID [2018-11-23 12:30:18,014 INFO L273 TraceCheckUtils]: 103: Hoare triple {21253#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21253#true} is VALID [2018-11-23 12:30:18,014 INFO L273 TraceCheckUtils]: 104: Hoare triple {21253#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21253#true} is VALID [2018-11-23 12:30:18,014 INFO L273 TraceCheckUtils]: 105: Hoare triple {21253#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21253#true} is VALID [2018-11-23 12:30:18,014 INFO L273 TraceCheckUtils]: 106: Hoare triple {21253#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21253#true} is VALID [2018-11-23 12:30:18,014 INFO L273 TraceCheckUtils]: 107: Hoare triple {21253#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21253#true} is VALID [2018-11-23 12:30:18,014 INFO L273 TraceCheckUtils]: 108: Hoare triple {21253#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21253#true} is VALID [2018-11-23 12:30:18,014 INFO L273 TraceCheckUtils]: 109: Hoare triple {21253#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21253#true} is VALID [2018-11-23 12:30:18,015 INFO L273 TraceCheckUtils]: 110: Hoare triple {21253#true} assume !(~i~0 < 100000); {21253#true} is VALID [2018-11-23 12:30:18,015 INFO L273 TraceCheckUtils]: 111: Hoare triple {21253#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {21253#true} is VALID [2018-11-23 12:30:18,015 INFO L273 TraceCheckUtils]: 112: Hoare triple {21253#true} assume true; {21253#true} is VALID [2018-11-23 12:30:18,015 INFO L268 TraceCheckUtils]: 113: Hoare quadruple {21253#true} {21254#false} #72#return; {21254#false} is VALID [2018-11-23 12:30:18,015 INFO L273 TraceCheckUtils]: 114: Hoare triple {21254#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {21254#false} is VALID [2018-11-23 12:30:18,015 INFO L273 TraceCheckUtils]: 115: Hoare triple {21254#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21254#false} is VALID [2018-11-23 12:30:18,015 INFO L273 TraceCheckUtils]: 116: Hoare triple {21254#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21254#false} is VALID [2018-11-23 12:30:18,015 INFO L273 TraceCheckUtils]: 117: Hoare triple {21254#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21254#false} is VALID [2018-11-23 12:30:18,015 INFO L273 TraceCheckUtils]: 118: Hoare triple {21254#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21254#false} is VALID [2018-11-23 12:30:18,015 INFO L273 TraceCheckUtils]: 119: Hoare triple {21254#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21254#false} is VALID [2018-11-23 12:30:18,016 INFO L273 TraceCheckUtils]: 120: Hoare triple {21254#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21254#false} is VALID [2018-11-23 12:30:18,016 INFO L273 TraceCheckUtils]: 121: Hoare triple {21254#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21254#false} is VALID [2018-11-23 12:30:18,016 INFO L273 TraceCheckUtils]: 122: Hoare triple {21254#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21254#false} is VALID [2018-11-23 12:30:18,016 INFO L273 TraceCheckUtils]: 123: Hoare triple {21254#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21254#false} is VALID [2018-11-23 12:30:18,016 INFO L273 TraceCheckUtils]: 124: Hoare triple {21254#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21254#false} is VALID [2018-11-23 12:30:18,016 INFO L273 TraceCheckUtils]: 125: Hoare triple {21254#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21254#false} is VALID [2018-11-23 12:30:18,016 INFO L273 TraceCheckUtils]: 126: Hoare triple {21254#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21254#false} is VALID [2018-11-23 12:30:18,016 INFO L273 TraceCheckUtils]: 127: Hoare triple {21254#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21254#false} is VALID [2018-11-23 12:30:18,016 INFO L273 TraceCheckUtils]: 128: Hoare triple {21254#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21254#false} is VALID [2018-11-23 12:30:18,017 INFO L273 TraceCheckUtils]: 129: Hoare triple {21254#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21254#false} is VALID [2018-11-23 12:30:18,017 INFO L273 TraceCheckUtils]: 130: Hoare triple {21254#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21254#false} is VALID [2018-11-23 12:30:18,017 INFO L273 TraceCheckUtils]: 131: Hoare triple {21254#false} assume !(~i~2 < 99999); {21254#false} is VALID [2018-11-23 12:30:18,017 INFO L273 TraceCheckUtils]: 132: Hoare triple {21254#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {21254#false} is VALID [2018-11-23 12:30:18,017 INFO L256 TraceCheckUtils]: 133: Hoare triple {21254#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {21253#true} is VALID [2018-11-23 12:30:18,017 INFO L273 TraceCheckUtils]: 134: Hoare triple {21253#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {21253#true} is VALID [2018-11-23 12:30:18,017 INFO L273 TraceCheckUtils]: 135: Hoare triple {21253#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21253#true} is VALID [2018-11-23 12:30:18,017 INFO L273 TraceCheckUtils]: 136: Hoare triple {21253#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21253#true} is VALID [2018-11-23 12:30:18,017 INFO L273 TraceCheckUtils]: 137: Hoare triple {21253#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21253#true} is VALID [2018-11-23 12:30:18,017 INFO L273 TraceCheckUtils]: 138: Hoare triple {21253#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21253#true} is VALID [2018-11-23 12:30:18,018 INFO L273 TraceCheckUtils]: 139: Hoare triple {21253#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21253#true} is VALID [2018-11-23 12:30:18,018 INFO L273 TraceCheckUtils]: 140: Hoare triple {21253#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21253#true} is VALID [2018-11-23 12:30:18,018 INFO L273 TraceCheckUtils]: 141: Hoare triple {21253#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21253#true} is VALID [2018-11-23 12:30:18,018 INFO L273 TraceCheckUtils]: 142: Hoare triple {21253#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21253#true} is VALID [2018-11-23 12:30:18,018 INFO L273 TraceCheckUtils]: 143: Hoare triple {21253#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21253#true} is VALID [2018-11-23 12:30:18,018 INFO L273 TraceCheckUtils]: 144: Hoare triple {21253#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21253#true} is VALID [2018-11-23 12:30:18,018 INFO L273 TraceCheckUtils]: 145: Hoare triple {21253#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21253#true} is VALID [2018-11-23 12:30:18,018 INFO L273 TraceCheckUtils]: 146: Hoare triple {21253#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21253#true} is VALID [2018-11-23 12:30:18,018 INFO L273 TraceCheckUtils]: 147: Hoare triple {21253#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21253#true} is VALID [2018-11-23 12:30:18,018 INFO L273 TraceCheckUtils]: 148: Hoare triple {21253#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21253#true} is VALID [2018-11-23 12:30:18,019 INFO L273 TraceCheckUtils]: 149: Hoare triple {21253#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21253#true} is VALID [2018-11-23 12:30:18,019 INFO L273 TraceCheckUtils]: 150: Hoare triple {21253#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21253#true} is VALID [2018-11-23 12:30:18,019 INFO L273 TraceCheckUtils]: 151: Hoare triple {21253#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21253#true} is VALID [2018-11-23 12:30:18,019 INFO L273 TraceCheckUtils]: 152: Hoare triple {21253#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21253#true} is VALID [2018-11-23 12:30:18,019 INFO L273 TraceCheckUtils]: 153: Hoare triple {21253#true} assume !(~i~0 < 100000); {21253#true} is VALID [2018-11-23 12:30:18,019 INFO L273 TraceCheckUtils]: 154: Hoare triple {21253#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {21253#true} is VALID [2018-11-23 12:30:18,019 INFO L273 TraceCheckUtils]: 155: Hoare triple {21253#true} assume true; {21253#true} is VALID [2018-11-23 12:30:18,019 INFO L268 TraceCheckUtils]: 156: Hoare quadruple {21253#true} {21254#false} #74#return; {21254#false} is VALID [2018-11-23 12:30:18,019 INFO L273 TraceCheckUtils]: 157: Hoare triple {21254#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {21254#false} is VALID [2018-11-23 12:30:18,020 INFO L273 TraceCheckUtils]: 158: Hoare triple {21254#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {21254#false} is VALID [2018-11-23 12:30:18,020 INFO L273 TraceCheckUtils]: 159: Hoare triple {21254#false} assume !false; {21254#false} is VALID [2018-11-23 12:30:18,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2018-11-23 12:30:18,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:30:18,032 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 12:30:18,044 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:30:35,191 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2018-11-23 12:30:35,192 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:30:35,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:35,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:30:35,603 INFO L256 TraceCheckUtils]: 0: Hoare triple {21253#true} call ULTIMATE.init(); {21253#true} is VALID [2018-11-23 12:30:35,603 INFO L273 TraceCheckUtils]: 1: Hoare triple {21253#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21253#true} is VALID [2018-11-23 12:30:35,603 INFO L273 TraceCheckUtils]: 2: Hoare triple {21253#true} assume true; {21253#true} is VALID [2018-11-23 12:30:35,603 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21253#true} {21253#true} #66#return; {21253#true} is VALID [2018-11-23 12:30:35,604 INFO L256 TraceCheckUtils]: 4: Hoare triple {21253#true} call #t~ret13 := main(); {21253#true} is VALID [2018-11-23 12:30:35,604 INFO L273 TraceCheckUtils]: 5: Hoare triple {21253#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {21253#true} is VALID [2018-11-23 12:30:35,604 INFO L273 TraceCheckUtils]: 6: Hoare triple {21253#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21253#true} is VALID [2018-11-23 12:30:35,604 INFO L273 TraceCheckUtils]: 7: Hoare triple {21253#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21253#true} is VALID [2018-11-23 12:30:35,604 INFO L273 TraceCheckUtils]: 8: Hoare triple {21253#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21253#true} is VALID [2018-11-23 12:30:35,605 INFO L273 TraceCheckUtils]: 9: Hoare triple {21253#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21253#true} is VALID [2018-11-23 12:30:35,605 INFO L273 TraceCheckUtils]: 10: Hoare triple {21253#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21253#true} is VALID [2018-11-23 12:30:35,605 INFO L273 TraceCheckUtils]: 11: Hoare triple {21253#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21253#true} is VALID [2018-11-23 12:30:35,605 INFO L273 TraceCheckUtils]: 12: Hoare triple {21253#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21253#true} is VALID [2018-11-23 12:30:35,605 INFO L273 TraceCheckUtils]: 13: Hoare triple {21253#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21253#true} is VALID [2018-11-23 12:30:35,605 INFO L273 TraceCheckUtils]: 14: Hoare triple {21253#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21253#true} is VALID [2018-11-23 12:30:35,606 INFO L273 TraceCheckUtils]: 15: Hoare triple {21253#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21253#true} is VALID [2018-11-23 12:30:35,606 INFO L273 TraceCheckUtils]: 16: Hoare triple {21253#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21253#true} is VALID [2018-11-23 12:30:35,606 INFO L273 TraceCheckUtils]: 17: Hoare triple {21253#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21253#true} is VALID [2018-11-23 12:30:35,606 INFO L273 TraceCheckUtils]: 18: Hoare triple {21253#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21253#true} is VALID [2018-11-23 12:30:35,606 INFO L273 TraceCheckUtils]: 19: Hoare triple {21253#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21253#true} is VALID [2018-11-23 12:30:35,606 INFO L273 TraceCheckUtils]: 20: Hoare triple {21253#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21253#true} is VALID [2018-11-23 12:30:35,606 INFO L273 TraceCheckUtils]: 21: Hoare triple {21253#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21253#true} is VALID [2018-11-23 12:30:35,606 INFO L273 TraceCheckUtils]: 22: Hoare triple {21253#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21253#true} is VALID [2018-11-23 12:30:35,607 INFO L273 TraceCheckUtils]: 23: Hoare triple {21253#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21253#true} is VALID [2018-11-23 12:30:35,607 INFO L273 TraceCheckUtils]: 24: Hoare triple {21253#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21253#true} is VALID [2018-11-23 12:30:35,607 INFO L273 TraceCheckUtils]: 25: Hoare triple {21253#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21253#true} is VALID [2018-11-23 12:30:35,607 INFO L273 TraceCheckUtils]: 26: Hoare triple {21253#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21253#true} is VALID [2018-11-23 12:30:35,607 INFO L273 TraceCheckUtils]: 27: Hoare triple {21253#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21253#true} is VALID [2018-11-23 12:30:35,607 INFO L273 TraceCheckUtils]: 28: Hoare triple {21253#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21253#true} is VALID [2018-11-23 12:30:35,607 INFO L273 TraceCheckUtils]: 29: Hoare triple {21253#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21253#true} is VALID [2018-11-23 12:30:35,607 INFO L273 TraceCheckUtils]: 30: Hoare triple {21253#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21253#true} is VALID [2018-11-23 12:30:35,607 INFO L273 TraceCheckUtils]: 31: Hoare triple {21253#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21253#true} is VALID [2018-11-23 12:30:35,607 INFO L273 TraceCheckUtils]: 32: Hoare triple {21253#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21253#true} is VALID [2018-11-23 12:30:35,608 INFO L273 TraceCheckUtils]: 33: Hoare triple {21253#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21253#true} is VALID [2018-11-23 12:30:35,608 INFO L273 TraceCheckUtils]: 34: Hoare triple {21253#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21253#true} is VALID [2018-11-23 12:30:35,608 INFO L273 TraceCheckUtils]: 35: Hoare triple {21253#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21253#true} is VALID [2018-11-23 12:30:35,608 INFO L273 TraceCheckUtils]: 36: Hoare triple {21253#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21253#true} is VALID [2018-11-23 12:30:35,608 INFO L273 TraceCheckUtils]: 37: Hoare triple {21253#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21253#true} is VALID [2018-11-23 12:30:35,608 INFO L273 TraceCheckUtils]: 38: Hoare triple {21253#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21253#true} is VALID [2018-11-23 12:30:35,608 INFO L273 TraceCheckUtils]: 39: Hoare triple {21253#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21253#true} is VALID [2018-11-23 12:30:35,608 INFO L273 TraceCheckUtils]: 40: Hoare triple {21253#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21253#true} is VALID [2018-11-23 12:30:35,608 INFO L273 TraceCheckUtils]: 41: Hoare triple {21253#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21253#true} is VALID [2018-11-23 12:30:35,609 INFO L273 TraceCheckUtils]: 42: Hoare triple {21253#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21253#true} is VALID [2018-11-23 12:30:35,609 INFO L273 TraceCheckUtils]: 43: Hoare triple {21253#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21253#true} is VALID [2018-11-23 12:30:35,609 INFO L273 TraceCheckUtils]: 44: Hoare triple {21253#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21253#true} is VALID [2018-11-23 12:30:35,609 INFO L273 TraceCheckUtils]: 45: Hoare triple {21253#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21253#true} is VALID [2018-11-23 12:30:35,609 INFO L273 TraceCheckUtils]: 46: Hoare triple {21253#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21253#true} is VALID [2018-11-23 12:30:35,609 INFO L273 TraceCheckUtils]: 47: Hoare triple {21253#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21253#true} is VALID [2018-11-23 12:30:35,609 INFO L273 TraceCheckUtils]: 48: Hoare triple {21253#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21253#true} is VALID [2018-11-23 12:30:35,609 INFO L273 TraceCheckUtils]: 49: Hoare triple {21253#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21253#true} is VALID [2018-11-23 12:30:35,609 INFO L273 TraceCheckUtils]: 50: Hoare triple {21253#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21253#true} is VALID [2018-11-23 12:30:35,609 INFO L273 TraceCheckUtils]: 51: Hoare triple {21253#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21253#true} is VALID [2018-11-23 12:30:35,610 INFO L273 TraceCheckUtils]: 52: Hoare triple {21253#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21253#true} is VALID [2018-11-23 12:30:35,610 INFO L273 TraceCheckUtils]: 53: Hoare triple {21253#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21253#true} is VALID [2018-11-23 12:30:35,610 INFO L273 TraceCheckUtils]: 54: Hoare triple {21253#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21253#true} is VALID [2018-11-23 12:30:35,610 INFO L273 TraceCheckUtils]: 55: Hoare triple {21253#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21253#true} is VALID [2018-11-23 12:30:35,610 INFO L273 TraceCheckUtils]: 56: Hoare triple {21253#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21253#true} is VALID [2018-11-23 12:30:35,610 INFO L273 TraceCheckUtils]: 57: Hoare triple {21253#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21253#true} is VALID [2018-11-23 12:30:35,610 INFO L273 TraceCheckUtils]: 58: Hoare triple {21253#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21253#true} is VALID [2018-11-23 12:30:35,610 INFO L273 TraceCheckUtils]: 59: Hoare triple {21253#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21253#true} is VALID [2018-11-23 12:30:35,610 INFO L273 TraceCheckUtils]: 60: Hoare triple {21253#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21253#true} is VALID [2018-11-23 12:30:35,610 INFO L273 TraceCheckUtils]: 61: Hoare triple {21253#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21253#true} is VALID [2018-11-23 12:30:35,611 INFO L273 TraceCheckUtils]: 62: Hoare triple {21253#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21253#true} is VALID [2018-11-23 12:30:35,611 INFO L273 TraceCheckUtils]: 63: Hoare triple {21253#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21253#true} is VALID [2018-11-23 12:30:35,611 INFO L273 TraceCheckUtils]: 64: Hoare triple {21253#true} assume !(~i~1 < 100000); {21253#true} is VALID [2018-11-23 12:30:35,611 INFO L256 TraceCheckUtils]: 65: Hoare triple {21253#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {21253#true} is VALID [2018-11-23 12:30:35,611 INFO L273 TraceCheckUtils]: 66: Hoare triple {21253#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {21486#(<= xor_~i~0 1)} is VALID [2018-11-23 12:30:35,612 INFO L273 TraceCheckUtils]: 67: Hoare triple {21486#(<= xor_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21486#(<= xor_~i~0 1)} is VALID [2018-11-23 12:30:35,612 INFO L273 TraceCheckUtils]: 68: Hoare triple {21486#(<= xor_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21493#(<= xor_~i~0 2)} is VALID [2018-11-23 12:30:35,613 INFO L273 TraceCheckUtils]: 69: Hoare triple {21493#(<= xor_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21493#(<= xor_~i~0 2)} is VALID [2018-11-23 12:30:35,613 INFO L273 TraceCheckUtils]: 70: Hoare triple {21493#(<= xor_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21500#(<= xor_~i~0 3)} is VALID [2018-11-23 12:30:35,613 INFO L273 TraceCheckUtils]: 71: Hoare triple {21500#(<= xor_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21500#(<= xor_~i~0 3)} is VALID [2018-11-23 12:30:35,614 INFO L273 TraceCheckUtils]: 72: Hoare triple {21500#(<= xor_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21507#(<= xor_~i~0 4)} is VALID [2018-11-23 12:30:35,614 INFO L273 TraceCheckUtils]: 73: Hoare triple {21507#(<= xor_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21507#(<= xor_~i~0 4)} is VALID [2018-11-23 12:30:35,615 INFO L273 TraceCheckUtils]: 74: Hoare triple {21507#(<= xor_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21514#(<= xor_~i~0 5)} is VALID [2018-11-23 12:30:35,616 INFO L273 TraceCheckUtils]: 75: Hoare triple {21514#(<= xor_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21514#(<= xor_~i~0 5)} is VALID [2018-11-23 12:30:35,616 INFO L273 TraceCheckUtils]: 76: Hoare triple {21514#(<= xor_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21521#(<= xor_~i~0 6)} is VALID [2018-11-23 12:30:35,617 INFO L273 TraceCheckUtils]: 77: Hoare triple {21521#(<= xor_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21521#(<= xor_~i~0 6)} is VALID [2018-11-23 12:30:35,618 INFO L273 TraceCheckUtils]: 78: Hoare triple {21521#(<= xor_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21528#(<= xor_~i~0 7)} is VALID [2018-11-23 12:30:35,618 INFO L273 TraceCheckUtils]: 79: Hoare triple {21528#(<= xor_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21528#(<= xor_~i~0 7)} is VALID [2018-11-23 12:30:35,619 INFO L273 TraceCheckUtils]: 80: Hoare triple {21528#(<= xor_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21535#(<= xor_~i~0 8)} is VALID [2018-11-23 12:30:35,619 INFO L273 TraceCheckUtils]: 81: Hoare triple {21535#(<= xor_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21535#(<= xor_~i~0 8)} is VALID [2018-11-23 12:30:35,620 INFO L273 TraceCheckUtils]: 82: Hoare triple {21535#(<= xor_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21542#(<= xor_~i~0 9)} is VALID [2018-11-23 12:30:35,621 INFO L273 TraceCheckUtils]: 83: Hoare triple {21542#(<= xor_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21542#(<= xor_~i~0 9)} is VALID [2018-11-23 12:30:35,621 INFO L273 TraceCheckUtils]: 84: Hoare triple {21542#(<= xor_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21549#(<= xor_~i~0 10)} is VALID [2018-11-23 12:30:35,622 INFO L273 TraceCheckUtils]: 85: Hoare triple {21549#(<= xor_~i~0 10)} assume !(~i~0 < 100000); {21254#false} is VALID [2018-11-23 12:30:35,622 INFO L273 TraceCheckUtils]: 86: Hoare triple {21254#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {21254#false} is VALID [2018-11-23 12:30:35,622 INFO L273 TraceCheckUtils]: 87: Hoare triple {21254#false} assume true; {21254#false} is VALID [2018-11-23 12:30:35,623 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {21254#false} {21253#true} #70#return; {21254#false} is VALID [2018-11-23 12:30:35,623 INFO L273 TraceCheckUtils]: 89: Hoare triple {21254#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {21254#false} is VALID [2018-11-23 12:30:35,623 INFO L256 TraceCheckUtils]: 90: Hoare triple {21254#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {21254#false} is VALID [2018-11-23 12:30:35,623 INFO L273 TraceCheckUtils]: 91: Hoare triple {21254#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {21254#false} is VALID [2018-11-23 12:30:35,623 INFO L273 TraceCheckUtils]: 92: Hoare triple {21254#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21254#false} is VALID [2018-11-23 12:30:35,624 INFO L273 TraceCheckUtils]: 93: Hoare triple {21254#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21254#false} is VALID [2018-11-23 12:30:35,624 INFO L273 TraceCheckUtils]: 94: Hoare triple {21254#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21254#false} is VALID [2018-11-23 12:30:35,624 INFO L273 TraceCheckUtils]: 95: Hoare triple {21254#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21254#false} is VALID [2018-11-23 12:30:35,624 INFO L273 TraceCheckUtils]: 96: Hoare triple {21254#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21254#false} is VALID [2018-11-23 12:30:35,624 INFO L273 TraceCheckUtils]: 97: Hoare triple {21254#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21254#false} is VALID [2018-11-23 12:30:35,624 INFO L273 TraceCheckUtils]: 98: Hoare triple {21254#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21254#false} is VALID [2018-11-23 12:30:35,625 INFO L273 TraceCheckUtils]: 99: Hoare triple {21254#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21254#false} is VALID [2018-11-23 12:30:35,625 INFO L273 TraceCheckUtils]: 100: Hoare triple {21254#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21254#false} is VALID [2018-11-23 12:30:35,625 INFO L273 TraceCheckUtils]: 101: Hoare triple {21254#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21254#false} is VALID [2018-11-23 12:30:35,625 INFO L273 TraceCheckUtils]: 102: Hoare triple {21254#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21254#false} is VALID [2018-11-23 12:30:35,626 INFO L273 TraceCheckUtils]: 103: Hoare triple {21254#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21254#false} is VALID [2018-11-23 12:30:35,626 INFO L273 TraceCheckUtils]: 104: Hoare triple {21254#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21254#false} is VALID [2018-11-23 12:30:35,626 INFO L273 TraceCheckUtils]: 105: Hoare triple {21254#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21254#false} is VALID [2018-11-23 12:30:35,627 INFO L273 TraceCheckUtils]: 106: Hoare triple {21254#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21254#false} is VALID [2018-11-23 12:30:35,627 INFO L273 TraceCheckUtils]: 107: Hoare triple {21254#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21254#false} is VALID [2018-11-23 12:30:35,627 INFO L273 TraceCheckUtils]: 108: Hoare triple {21254#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21254#false} is VALID [2018-11-23 12:30:35,627 INFO L273 TraceCheckUtils]: 109: Hoare triple {21254#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21254#false} is VALID [2018-11-23 12:30:35,627 INFO L273 TraceCheckUtils]: 110: Hoare triple {21254#false} assume !(~i~0 < 100000); {21254#false} is VALID [2018-11-23 12:30:35,627 INFO L273 TraceCheckUtils]: 111: Hoare triple {21254#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {21254#false} is VALID [2018-11-23 12:30:35,627 INFO L273 TraceCheckUtils]: 112: Hoare triple {21254#false} assume true; {21254#false} is VALID [2018-11-23 12:30:35,628 INFO L268 TraceCheckUtils]: 113: Hoare quadruple {21254#false} {21254#false} #72#return; {21254#false} is VALID [2018-11-23 12:30:35,628 INFO L273 TraceCheckUtils]: 114: Hoare triple {21254#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {21254#false} is VALID [2018-11-23 12:30:35,628 INFO L273 TraceCheckUtils]: 115: Hoare triple {21254#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21254#false} is VALID [2018-11-23 12:30:35,628 INFO L273 TraceCheckUtils]: 116: Hoare triple {21254#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21254#false} is VALID [2018-11-23 12:30:35,628 INFO L273 TraceCheckUtils]: 117: Hoare triple {21254#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21254#false} is VALID [2018-11-23 12:30:35,628 INFO L273 TraceCheckUtils]: 118: Hoare triple {21254#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21254#false} is VALID [2018-11-23 12:30:35,628 INFO L273 TraceCheckUtils]: 119: Hoare triple {21254#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21254#false} is VALID [2018-11-23 12:30:35,628 INFO L273 TraceCheckUtils]: 120: Hoare triple {21254#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21254#false} is VALID [2018-11-23 12:30:35,628 INFO L273 TraceCheckUtils]: 121: Hoare triple {21254#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21254#false} is VALID [2018-11-23 12:30:35,628 INFO L273 TraceCheckUtils]: 122: Hoare triple {21254#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21254#false} is VALID [2018-11-23 12:30:35,629 INFO L273 TraceCheckUtils]: 123: Hoare triple {21254#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21254#false} is VALID [2018-11-23 12:30:35,629 INFO L273 TraceCheckUtils]: 124: Hoare triple {21254#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21254#false} is VALID [2018-11-23 12:30:35,629 INFO L273 TraceCheckUtils]: 125: Hoare triple {21254#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21254#false} is VALID [2018-11-23 12:30:35,629 INFO L273 TraceCheckUtils]: 126: Hoare triple {21254#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21254#false} is VALID [2018-11-23 12:30:35,629 INFO L273 TraceCheckUtils]: 127: Hoare triple {21254#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21254#false} is VALID [2018-11-23 12:30:35,629 INFO L273 TraceCheckUtils]: 128: Hoare triple {21254#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21254#false} is VALID [2018-11-23 12:30:35,629 INFO L273 TraceCheckUtils]: 129: Hoare triple {21254#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21254#false} is VALID [2018-11-23 12:30:35,629 INFO L273 TraceCheckUtils]: 130: Hoare triple {21254#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21254#false} is VALID [2018-11-23 12:30:35,629 INFO L273 TraceCheckUtils]: 131: Hoare triple {21254#false} assume !(~i~2 < 99999); {21254#false} is VALID [2018-11-23 12:30:35,630 INFO L273 TraceCheckUtils]: 132: Hoare triple {21254#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {21254#false} is VALID [2018-11-23 12:30:35,630 INFO L256 TraceCheckUtils]: 133: Hoare triple {21254#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {21254#false} is VALID [2018-11-23 12:30:35,630 INFO L273 TraceCheckUtils]: 134: Hoare triple {21254#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {21254#false} is VALID [2018-11-23 12:30:35,630 INFO L273 TraceCheckUtils]: 135: Hoare triple {21254#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21254#false} is VALID [2018-11-23 12:30:35,630 INFO L273 TraceCheckUtils]: 136: Hoare triple {21254#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21254#false} is VALID [2018-11-23 12:30:35,630 INFO L273 TraceCheckUtils]: 137: Hoare triple {21254#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21254#false} is VALID [2018-11-23 12:30:35,630 INFO L273 TraceCheckUtils]: 138: Hoare triple {21254#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21254#false} is VALID [2018-11-23 12:30:35,630 INFO L273 TraceCheckUtils]: 139: Hoare triple {21254#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21254#false} is VALID [2018-11-23 12:30:35,630 INFO L273 TraceCheckUtils]: 140: Hoare triple {21254#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21254#false} is VALID [2018-11-23 12:30:35,630 INFO L273 TraceCheckUtils]: 141: Hoare triple {21254#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21254#false} is VALID [2018-11-23 12:30:35,631 INFO L273 TraceCheckUtils]: 142: Hoare triple {21254#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21254#false} is VALID [2018-11-23 12:30:35,631 INFO L273 TraceCheckUtils]: 143: Hoare triple {21254#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21254#false} is VALID [2018-11-23 12:30:35,631 INFO L273 TraceCheckUtils]: 144: Hoare triple {21254#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21254#false} is VALID [2018-11-23 12:30:35,631 INFO L273 TraceCheckUtils]: 145: Hoare triple {21254#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21254#false} is VALID [2018-11-23 12:30:35,631 INFO L273 TraceCheckUtils]: 146: Hoare triple {21254#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21254#false} is VALID [2018-11-23 12:30:35,631 INFO L273 TraceCheckUtils]: 147: Hoare triple {21254#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21254#false} is VALID [2018-11-23 12:30:35,631 INFO L273 TraceCheckUtils]: 148: Hoare triple {21254#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21254#false} is VALID [2018-11-23 12:30:35,631 INFO L273 TraceCheckUtils]: 149: Hoare triple {21254#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21254#false} is VALID [2018-11-23 12:30:35,631 INFO L273 TraceCheckUtils]: 150: Hoare triple {21254#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21254#false} is VALID [2018-11-23 12:30:35,632 INFO L273 TraceCheckUtils]: 151: Hoare triple {21254#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21254#false} is VALID [2018-11-23 12:30:35,632 INFO L273 TraceCheckUtils]: 152: Hoare triple {21254#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21254#false} is VALID [2018-11-23 12:30:35,632 INFO L273 TraceCheckUtils]: 153: Hoare triple {21254#false} assume !(~i~0 < 100000); {21254#false} is VALID [2018-11-23 12:30:35,632 INFO L273 TraceCheckUtils]: 154: Hoare triple {21254#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {21254#false} is VALID [2018-11-23 12:30:35,632 INFO L273 TraceCheckUtils]: 155: Hoare triple {21254#false} assume true; {21254#false} is VALID [2018-11-23 12:30:35,632 INFO L268 TraceCheckUtils]: 156: Hoare quadruple {21254#false} {21254#false} #74#return; {21254#false} is VALID [2018-11-23 12:30:35,632 INFO L273 TraceCheckUtils]: 157: Hoare triple {21254#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {21254#false} is VALID [2018-11-23 12:30:35,632 INFO L273 TraceCheckUtils]: 158: Hoare triple {21254#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {21254#false} is VALID [2018-11-23 12:30:35,632 INFO L273 TraceCheckUtils]: 159: Hoare triple {21254#false} assume !false; {21254#false} is VALID [2018-11-23 12:30:35,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 364 proven. 81 refuted. 0 times theorem prover too weak. 1258 trivial. 0 not checked. [2018-11-23 12:30:35,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:30:35,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 12] total 42 [2018-11-23 12:30:35,667 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 160 [2018-11-23 12:30:35,668 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:30:35,668 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 12:30:35,800 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:30:35,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 12:30:35,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 12:30:35,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=1161, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:30:35,802 INFO L87 Difference]: Start difference. First operand 115 states and 119 transitions. Second operand 42 states. [2018-11-23 12:30:36,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:36,914 INFO L93 Difference]: Finished difference Result 171 states and 183 transitions. [2018-11-23 12:30:36,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-23 12:30:36,914 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 160 [2018-11-23 12:30:36,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:30:36,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:30:36,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 136 transitions. [2018-11-23 12:30:36,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:30:36,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 136 transitions. [2018-11-23 12:30:36,917 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 136 transitions. [2018-11-23 12:30:37,050 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:30:37,053 INFO L225 Difference]: With dead ends: 171 [2018-11-23 12:30:37,053 INFO L226 Difference]: Without dead ends: 121 [2018-11-23 12:30:37,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=561, Invalid=1161, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:30:37,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-23 12:30:37,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-11-23 12:30:37,103 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:30:37,103 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand 119 states. [2018-11-23 12:30:37,103 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 119 states. [2018-11-23 12:30:37,103 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 119 states. [2018-11-23 12:30:37,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:37,106 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2018-11-23 12:30:37,106 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2018-11-23 12:30:37,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:37,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:37,107 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 121 states. [2018-11-23 12:30:37,107 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 121 states. [2018-11-23 12:30:37,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:37,109 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2018-11-23 12:30:37,109 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2018-11-23 12:30:37,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:37,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:37,110 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:30:37,110 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:30:37,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-23 12:30:37,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2018-11-23 12:30:37,112 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 160 [2018-11-23 12:30:37,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:30:37,112 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2018-11-23 12:30:37,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 12:30:37,113 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2018-11-23 12:30:37,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-23 12:30:37,114 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:30:37,114 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:30:37,114 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:30:37,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:30:37,114 INFO L82 PathProgramCache]: Analyzing trace with hash -595520541, now seen corresponding path program 30 times [2018-11-23 12:30:37,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:30:37,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:30:37,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:37,115 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:30:37,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:37,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:38,579 INFO L256 TraceCheckUtils]: 0: Hoare triple {22447#true} call ULTIMATE.init(); {22447#true} is VALID [2018-11-23 12:30:38,580 INFO L273 TraceCheckUtils]: 1: Hoare triple {22447#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22447#true} is VALID [2018-11-23 12:30:38,580 INFO L273 TraceCheckUtils]: 2: Hoare triple {22447#true} assume true; {22447#true} is VALID [2018-11-23 12:30:38,580 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22447#true} {22447#true} #66#return; {22447#true} is VALID [2018-11-23 12:30:38,580 INFO L256 TraceCheckUtils]: 4: Hoare triple {22447#true} call #t~ret13 := main(); {22447#true} is VALID [2018-11-23 12:30:38,580 INFO L273 TraceCheckUtils]: 5: Hoare triple {22447#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {22449#(= main_~i~1 0)} is VALID [2018-11-23 12:30:38,581 INFO L273 TraceCheckUtils]: 6: Hoare triple {22449#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22449#(= main_~i~1 0)} is VALID [2018-11-23 12:30:38,581 INFO L273 TraceCheckUtils]: 7: Hoare triple {22449#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22450#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:38,581 INFO L273 TraceCheckUtils]: 8: Hoare triple {22450#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22450#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:38,582 INFO L273 TraceCheckUtils]: 9: Hoare triple {22450#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22451#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:38,583 INFO L273 TraceCheckUtils]: 10: Hoare triple {22451#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22451#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:38,583 INFO L273 TraceCheckUtils]: 11: Hoare triple {22451#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22452#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:38,584 INFO L273 TraceCheckUtils]: 12: Hoare triple {22452#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22452#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:38,585 INFO L273 TraceCheckUtils]: 13: Hoare triple {22452#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22453#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:38,585 INFO L273 TraceCheckUtils]: 14: Hoare triple {22453#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22453#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:38,586 INFO L273 TraceCheckUtils]: 15: Hoare triple {22453#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22454#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:38,586 INFO L273 TraceCheckUtils]: 16: Hoare triple {22454#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22454#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:38,587 INFO L273 TraceCheckUtils]: 17: Hoare triple {22454#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22455#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:38,588 INFO L273 TraceCheckUtils]: 18: Hoare triple {22455#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22455#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:38,588 INFO L273 TraceCheckUtils]: 19: Hoare triple {22455#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22456#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:38,589 INFO L273 TraceCheckUtils]: 20: Hoare triple {22456#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22456#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:38,590 INFO L273 TraceCheckUtils]: 21: Hoare triple {22456#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22457#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:38,590 INFO L273 TraceCheckUtils]: 22: Hoare triple {22457#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22457#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:38,591 INFO L273 TraceCheckUtils]: 23: Hoare triple {22457#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22458#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:38,591 INFO L273 TraceCheckUtils]: 24: Hoare triple {22458#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22458#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:38,592 INFO L273 TraceCheckUtils]: 25: Hoare triple {22458#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22459#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:38,593 INFO L273 TraceCheckUtils]: 26: Hoare triple {22459#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22459#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:38,593 INFO L273 TraceCheckUtils]: 27: Hoare triple {22459#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22460#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:38,594 INFO L273 TraceCheckUtils]: 28: Hoare triple {22460#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22460#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:38,595 INFO L273 TraceCheckUtils]: 29: Hoare triple {22460#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22461#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:38,595 INFO L273 TraceCheckUtils]: 30: Hoare triple {22461#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22461#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:38,596 INFO L273 TraceCheckUtils]: 31: Hoare triple {22461#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22462#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:38,596 INFO L273 TraceCheckUtils]: 32: Hoare triple {22462#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22462#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:38,597 INFO L273 TraceCheckUtils]: 33: Hoare triple {22462#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22463#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:38,598 INFO L273 TraceCheckUtils]: 34: Hoare triple {22463#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22463#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:38,598 INFO L273 TraceCheckUtils]: 35: Hoare triple {22463#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22464#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:38,599 INFO L273 TraceCheckUtils]: 36: Hoare triple {22464#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22464#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:38,600 INFO L273 TraceCheckUtils]: 37: Hoare triple {22464#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22465#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:38,600 INFO L273 TraceCheckUtils]: 38: Hoare triple {22465#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22465#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:38,601 INFO L273 TraceCheckUtils]: 39: Hoare triple {22465#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22466#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:38,601 INFO L273 TraceCheckUtils]: 40: Hoare triple {22466#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22466#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:38,602 INFO L273 TraceCheckUtils]: 41: Hoare triple {22466#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22467#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:38,603 INFO L273 TraceCheckUtils]: 42: Hoare triple {22467#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22467#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:38,603 INFO L273 TraceCheckUtils]: 43: Hoare triple {22467#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22468#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:38,604 INFO L273 TraceCheckUtils]: 44: Hoare triple {22468#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22468#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:38,605 INFO L273 TraceCheckUtils]: 45: Hoare triple {22468#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22469#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:38,605 INFO L273 TraceCheckUtils]: 46: Hoare triple {22469#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22469#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:38,606 INFO L273 TraceCheckUtils]: 47: Hoare triple {22469#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22470#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:38,606 INFO L273 TraceCheckUtils]: 48: Hoare triple {22470#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22470#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:38,607 INFO L273 TraceCheckUtils]: 49: Hoare triple {22470#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:38,608 INFO L273 TraceCheckUtils]: 50: Hoare triple {22471#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:38,608 INFO L273 TraceCheckUtils]: 51: Hoare triple {22471#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22472#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:38,609 INFO L273 TraceCheckUtils]: 52: Hoare triple {22472#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22472#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:38,610 INFO L273 TraceCheckUtils]: 53: Hoare triple {22472#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22473#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:38,610 INFO L273 TraceCheckUtils]: 54: Hoare triple {22473#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22473#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:38,611 INFO L273 TraceCheckUtils]: 55: Hoare triple {22473#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22474#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:38,611 INFO L273 TraceCheckUtils]: 56: Hoare triple {22474#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22474#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:38,612 INFO L273 TraceCheckUtils]: 57: Hoare triple {22474#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22475#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:38,613 INFO L273 TraceCheckUtils]: 58: Hoare triple {22475#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22475#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:38,613 INFO L273 TraceCheckUtils]: 59: Hoare triple {22475#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22476#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:38,614 INFO L273 TraceCheckUtils]: 60: Hoare triple {22476#(<= main_~i~1 27)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22476#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:38,615 INFO L273 TraceCheckUtils]: 61: Hoare triple {22476#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22477#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:38,615 INFO L273 TraceCheckUtils]: 62: Hoare triple {22477#(<= main_~i~1 28)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22477#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:38,616 INFO L273 TraceCheckUtils]: 63: Hoare triple {22477#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22478#(<= main_~i~1 29)} is VALID [2018-11-23 12:30:38,616 INFO L273 TraceCheckUtils]: 64: Hoare triple {22478#(<= main_~i~1 29)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22478#(<= main_~i~1 29)} is VALID [2018-11-23 12:30:38,617 INFO L273 TraceCheckUtils]: 65: Hoare triple {22478#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22479#(<= main_~i~1 30)} is VALID [2018-11-23 12:30:38,618 INFO L273 TraceCheckUtils]: 66: Hoare triple {22479#(<= main_~i~1 30)} assume !(~i~1 < 100000); {22448#false} is VALID [2018-11-23 12:30:38,618 INFO L256 TraceCheckUtils]: 67: Hoare triple {22448#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {22447#true} is VALID [2018-11-23 12:30:38,618 INFO L273 TraceCheckUtils]: 68: Hoare triple {22447#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {22447#true} is VALID [2018-11-23 12:30:38,618 INFO L273 TraceCheckUtils]: 69: Hoare triple {22447#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22447#true} is VALID [2018-11-23 12:30:38,619 INFO L273 TraceCheckUtils]: 70: Hoare triple {22447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22447#true} is VALID [2018-11-23 12:30:38,619 INFO L273 TraceCheckUtils]: 71: Hoare triple {22447#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22447#true} is VALID [2018-11-23 12:30:38,619 INFO L273 TraceCheckUtils]: 72: Hoare triple {22447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22447#true} is VALID [2018-11-23 12:30:38,619 INFO L273 TraceCheckUtils]: 73: Hoare triple {22447#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22447#true} is VALID [2018-11-23 12:30:38,619 INFO L273 TraceCheckUtils]: 74: Hoare triple {22447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22447#true} is VALID [2018-11-23 12:30:38,619 INFO L273 TraceCheckUtils]: 75: Hoare triple {22447#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22447#true} is VALID [2018-11-23 12:30:38,620 INFO L273 TraceCheckUtils]: 76: Hoare triple {22447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22447#true} is VALID [2018-11-23 12:30:38,620 INFO L273 TraceCheckUtils]: 77: Hoare triple {22447#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22447#true} is VALID [2018-11-23 12:30:38,620 INFO L273 TraceCheckUtils]: 78: Hoare triple {22447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22447#true} is VALID [2018-11-23 12:30:38,620 INFO L273 TraceCheckUtils]: 79: Hoare triple {22447#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22447#true} is VALID [2018-11-23 12:30:38,620 INFO L273 TraceCheckUtils]: 80: Hoare triple {22447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22447#true} is VALID [2018-11-23 12:30:38,621 INFO L273 TraceCheckUtils]: 81: Hoare triple {22447#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22447#true} is VALID [2018-11-23 12:30:38,621 INFO L273 TraceCheckUtils]: 82: Hoare triple {22447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22447#true} is VALID [2018-11-23 12:30:38,621 INFO L273 TraceCheckUtils]: 83: Hoare triple {22447#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22447#true} is VALID [2018-11-23 12:30:38,621 INFO L273 TraceCheckUtils]: 84: Hoare triple {22447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22447#true} is VALID [2018-11-23 12:30:38,621 INFO L273 TraceCheckUtils]: 85: Hoare triple {22447#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22447#true} is VALID [2018-11-23 12:30:38,621 INFO L273 TraceCheckUtils]: 86: Hoare triple {22447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22447#true} is VALID [2018-11-23 12:30:38,621 INFO L273 TraceCheckUtils]: 87: Hoare triple {22447#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22447#true} is VALID [2018-11-23 12:30:38,621 INFO L273 TraceCheckUtils]: 88: Hoare triple {22447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22447#true} is VALID [2018-11-23 12:30:38,621 INFO L273 TraceCheckUtils]: 89: Hoare triple {22447#true} assume !(~i~0 < 100000); {22447#true} is VALID [2018-11-23 12:30:38,621 INFO L273 TraceCheckUtils]: 90: Hoare triple {22447#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {22447#true} is VALID [2018-11-23 12:30:38,622 INFO L273 TraceCheckUtils]: 91: Hoare triple {22447#true} assume true; {22447#true} is VALID [2018-11-23 12:30:38,622 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {22447#true} {22448#false} #70#return; {22448#false} is VALID [2018-11-23 12:30:38,622 INFO L273 TraceCheckUtils]: 93: Hoare triple {22448#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {22448#false} is VALID [2018-11-23 12:30:38,622 INFO L256 TraceCheckUtils]: 94: Hoare triple {22448#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {22447#true} is VALID [2018-11-23 12:30:38,622 INFO L273 TraceCheckUtils]: 95: Hoare triple {22447#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {22447#true} is VALID [2018-11-23 12:30:38,622 INFO L273 TraceCheckUtils]: 96: Hoare triple {22447#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22447#true} is VALID [2018-11-23 12:30:38,622 INFO L273 TraceCheckUtils]: 97: Hoare triple {22447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22447#true} is VALID [2018-11-23 12:30:38,622 INFO L273 TraceCheckUtils]: 98: Hoare triple {22447#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22447#true} is VALID [2018-11-23 12:30:38,622 INFO L273 TraceCheckUtils]: 99: Hoare triple {22447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22447#true} is VALID [2018-11-23 12:30:38,623 INFO L273 TraceCheckUtils]: 100: Hoare triple {22447#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22447#true} is VALID [2018-11-23 12:30:38,623 INFO L273 TraceCheckUtils]: 101: Hoare triple {22447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22447#true} is VALID [2018-11-23 12:30:38,623 INFO L273 TraceCheckUtils]: 102: Hoare triple {22447#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22447#true} is VALID [2018-11-23 12:30:38,623 INFO L273 TraceCheckUtils]: 103: Hoare triple {22447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22447#true} is VALID [2018-11-23 12:30:38,623 INFO L273 TraceCheckUtils]: 104: Hoare triple {22447#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22447#true} is VALID [2018-11-23 12:30:38,623 INFO L273 TraceCheckUtils]: 105: Hoare triple {22447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22447#true} is VALID [2018-11-23 12:30:38,623 INFO L273 TraceCheckUtils]: 106: Hoare triple {22447#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22447#true} is VALID [2018-11-23 12:30:38,623 INFO L273 TraceCheckUtils]: 107: Hoare triple {22447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22447#true} is VALID [2018-11-23 12:30:38,623 INFO L273 TraceCheckUtils]: 108: Hoare triple {22447#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22447#true} is VALID [2018-11-23 12:30:38,623 INFO L273 TraceCheckUtils]: 109: Hoare triple {22447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22447#true} is VALID [2018-11-23 12:30:38,624 INFO L273 TraceCheckUtils]: 110: Hoare triple {22447#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22447#true} is VALID [2018-11-23 12:30:38,624 INFO L273 TraceCheckUtils]: 111: Hoare triple {22447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22447#true} is VALID [2018-11-23 12:30:38,624 INFO L273 TraceCheckUtils]: 112: Hoare triple {22447#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22447#true} is VALID [2018-11-23 12:30:38,624 INFO L273 TraceCheckUtils]: 113: Hoare triple {22447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22447#true} is VALID [2018-11-23 12:30:38,624 INFO L273 TraceCheckUtils]: 114: Hoare triple {22447#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22447#true} is VALID [2018-11-23 12:30:38,624 INFO L273 TraceCheckUtils]: 115: Hoare triple {22447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22447#true} is VALID [2018-11-23 12:30:38,624 INFO L273 TraceCheckUtils]: 116: Hoare triple {22447#true} assume !(~i~0 < 100000); {22447#true} is VALID [2018-11-23 12:30:38,624 INFO L273 TraceCheckUtils]: 117: Hoare triple {22447#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {22447#true} is VALID [2018-11-23 12:30:38,624 INFO L273 TraceCheckUtils]: 118: Hoare triple {22447#true} assume true; {22447#true} is VALID [2018-11-23 12:30:38,625 INFO L268 TraceCheckUtils]: 119: Hoare quadruple {22447#true} {22448#false} #72#return; {22448#false} is VALID [2018-11-23 12:30:38,625 INFO L273 TraceCheckUtils]: 120: Hoare triple {22448#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {22448#false} is VALID [2018-11-23 12:30:38,625 INFO L273 TraceCheckUtils]: 121: Hoare triple {22448#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22448#false} is VALID [2018-11-23 12:30:38,625 INFO L273 TraceCheckUtils]: 122: Hoare triple {22448#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22448#false} is VALID [2018-11-23 12:30:38,625 INFO L273 TraceCheckUtils]: 123: Hoare triple {22448#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22448#false} is VALID [2018-11-23 12:30:38,625 INFO L273 TraceCheckUtils]: 124: Hoare triple {22448#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22448#false} is VALID [2018-11-23 12:30:38,625 INFO L273 TraceCheckUtils]: 125: Hoare triple {22448#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22448#false} is VALID [2018-11-23 12:30:38,625 INFO L273 TraceCheckUtils]: 126: Hoare triple {22448#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22448#false} is VALID [2018-11-23 12:30:38,625 INFO L273 TraceCheckUtils]: 127: Hoare triple {22448#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22448#false} is VALID [2018-11-23 12:30:38,625 INFO L273 TraceCheckUtils]: 128: Hoare triple {22448#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22448#false} is VALID [2018-11-23 12:30:38,626 INFO L273 TraceCheckUtils]: 129: Hoare triple {22448#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22448#false} is VALID [2018-11-23 12:30:38,626 INFO L273 TraceCheckUtils]: 130: Hoare triple {22448#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22448#false} is VALID [2018-11-23 12:30:38,626 INFO L273 TraceCheckUtils]: 131: Hoare triple {22448#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22448#false} is VALID [2018-11-23 12:30:38,626 INFO L273 TraceCheckUtils]: 132: Hoare triple {22448#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22448#false} is VALID [2018-11-23 12:30:38,626 INFO L273 TraceCheckUtils]: 133: Hoare triple {22448#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22448#false} is VALID [2018-11-23 12:30:38,626 INFO L273 TraceCheckUtils]: 134: Hoare triple {22448#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22448#false} is VALID [2018-11-23 12:30:38,626 INFO L273 TraceCheckUtils]: 135: Hoare triple {22448#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22448#false} is VALID [2018-11-23 12:30:38,626 INFO L273 TraceCheckUtils]: 136: Hoare triple {22448#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22448#false} is VALID [2018-11-23 12:30:38,626 INFO L273 TraceCheckUtils]: 137: Hoare triple {22448#false} assume !(~i~2 < 99999); {22448#false} is VALID [2018-11-23 12:30:38,627 INFO L273 TraceCheckUtils]: 138: Hoare triple {22448#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {22448#false} is VALID [2018-11-23 12:30:38,627 INFO L256 TraceCheckUtils]: 139: Hoare triple {22448#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {22447#true} is VALID [2018-11-23 12:30:38,627 INFO L273 TraceCheckUtils]: 140: Hoare triple {22447#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {22447#true} is VALID [2018-11-23 12:30:38,627 INFO L273 TraceCheckUtils]: 141: Hoare triple {22447#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22447#true} is VALID [2018-11-23 12:30:38,627 INFO L273 TraceCheckUtils]: 142: Hoare triple {22447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22447#true} is VALID [2018-11-23 12:30:38,627 INFO L273 TraceCheckUtils]: 143: Hoare triple {22447#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22447#true} is VALID [2018-11-23 12:30:38,627 INFO L273 TraceCheckUtils]: 144: Hoare triple {22447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22447#true} is VALID [2018-11-23 12:30:38,627 INFO L273 TraceCheckUtils]: 145: Hoare triple {22447#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22447#true} is VALID [2018-11-23 12:30:38,627 INFO L273 TraceCheckUtils]: 146: Hoare triple {22447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22447#true} is VALID [2018-11-23 12:30:38,627 INFO L273 TraceCheckUtils]: 147: Hoare triple {22447#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22447#true} is VALID [2018-11-23 12:30:38,628 INFO L273 TraceCheckUtils]: 148: Hoare triple {22447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22447#true} is VALID [2018-11-23 12:30:38,628 INFO L273 TraceCheckUtils]: 149: Hoare triple {22447#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22447#true} is VALID [2018-11-23 12:30:38,628 INFO L273 TraceCheckUtils]: 150: Hoare triple {22447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22447#true} is VALID [2018-11-23 12:30:38,628 INFO L273 TraceCheckUtils]: 151: Hoare triple {22447#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22447#true} is VALID [2018-11-23 12:30:38,628 INFO L273 TraceCheckUtils]: 152: Hoare triple {22447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22447#true} is VALID [2018-11-23 12:30:38,628 INFO L273 TraceCheckUtils]: 153: Hoare triple {22447#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22447#true} is VALID [2018-11-23 12:30:38,628 INFO L273 TraceCheckUtils]: 154: Hoare triple {22447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22447#true} is VALID [2018-11-23 12:30:38,628 INFO L273 TraceCheckUtils]: 155: Hoare triple {22447#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22447#true} is VALID [2018-11-23 12:30:38,628 INFO L273 TraceCheckUtils]: 156: Hoare triple {22447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22447#true} is VALID [2018-11-23 12:30:38,629 INFO L273 TraceCheckUtils]: 157: Hoare triple {22447#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22447#true} is VALID [2018-11-23 12:30:38,629 INFO L273 TraceCheckUtils]: 158: Hoare triple {22447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22447#true} is VALID [2018-11-23 12:30:38,629 INFO L273 TraceCheckUtils]: 159: Hoare triple {22447#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22447#true} is VALID [2018-11-23 12:30:38,629 INFO L273 TraceCheckUtils]: 160: Hoare triple {22447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22447#true} is VALID [2018-11-23 12:30:38,629 INFO L273 TraceCheckUtils]: 161: Hoare triple {22447#true} assume !(~i~0 < 100000); {22447#true} is VALID [2018-11-23 12:30:38,629 INFO L273 TraceCheckUtils]: 162: Hoare triple {22447#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {22447#true} is VALID [2018-11-23 12:30:38,629 INFO L273 TraceCheckUtils]: 163: Hoare triple {22447#true} assume true; {22447#true} is VALID [2018-11-23 12:30:38,629 INFO L268 TraceCheckUtils]: 164: Hoare quadruple {22447#true} {22448#false} #74#return; {22448#false} is VALID [2018-11-23 12:30:38,629 INFO L273 TraceCheckUtils]: 165: Hoare triple {22448#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {22448#false} is VALID [2018-11-23 12:30:38,630 INFO L273 TraceCheckUtils]: 166: Hoare triple {22448#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {22448#false} is VALID [2018-11-23 12:30:38,630 INFO L273 TraceCheckUtils]: 167: Hoare triple {22448#false} assume !false; {22448#false} is VALID [2018-11-23 12:30:38,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1939 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 1039 trivial. 0 not checked. [2018-11-23 12:30:38,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:30:38,643 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 12:30:38,651 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:30:39,941 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-23 12:30:39,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:30:39,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:39,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:30:40,518 INFO L256 TraceCheckUtils]: 0: Hoare triple {22447#true} call ULTIMATE.init(); {22447#true} is VALID [2018-11-23 12:30:40,518 INFO L273 TraceCheckUtils]: 1: Hoare triple {22447#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22447#true} is VALID [2018-11-23 12:30:40,518 INFO L273 TraceCheckUtils]: 2: Hoare triple {22447#true} assume true; {22447#true} is VALID [2018-11-23 12:30:40,518 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22447#true} {22447#true} #66#return; {22447#true} is VALID [2018-11-23 12:30:40,519 INFO L256 TraceCheckUtils]: 4: Hoare triple {22447#true} call #t~ret13 := main(); {22447#true} is VALID [2018-11-23 12:30:40,519 INFO L273 TraceCheckUtils]: 5: Hoare triple {22447#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {22447#true} is VALID [2018-11-23 12:30:40,519 INFO L273 TraceCheckUtils]: 6: Hoare triple {22447#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22447#true} is VALID [2018-11-23 12:30:40,519 INFO L273 TraceCheckUtils]: 7: Hoare triple {22447#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22447#true} is VALID [2018-11-23 12:30:40,519 INFO L273 TraceCheckUtils]: 8: Hoare triple {22447#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22447#true} is VALID [2018-11-23 12:30:40,520 INFO L273 TraceCheckUtils]: 9: Hoare triple {22447#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22447#true} is VALID [2018-11-23 12:30:40,520 INFO L273 TraceCheckUtils]: 10: Hoare triple {22447#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22447#true} is VALID [2018-11-23 12:30:40,520 INFO L273 TraceCheckUtils]: 11: Hoare triple {22447#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22447#true} is VALID [2018-11-23 12:30:40,520 INFO L273 TraceCheckUtils]: 12: Hoare triple {22447#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22447#true} is VALID [2018-11-23 12:30:40,520 INFO L273 TraceCheckUtils]: 13: Hoare triple {22447#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22447#true} is VALID [2018-11-23 12:30:40,520 INFO L273 TraceCheckUtils]: 14: Hoare triple {22447#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22447#true} is VALID [2018-11-23 12:30:40,520 INFO L273 TraceCheckUtils]: 15: Hoare triple {22447#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22447#true} is VALID [2018-11-23 12:30:40,521 INFO L273 TraceCheckUtils]: 16: Hoare triple {22447#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22447#true} is VALID [2018-11-23 12:30:40,521 INFO L273 TraceCheckUtils]: 17: Hoare triple {22447#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22447#true} is VALID [2018-11-23 12:30:40,521 INFO L273 TraceCheckUtils]: 18: Hoare triple {22447#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22447#true} is VALID [2018-11-23 12:30:40,521 INFO L273 TraceCheckUtils]: 19: Hoare triple {22447#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22447#true} is VALID [2018-11-23 12:30:40,521 INFO L273 TraceCheckUtils]: 20: Hoare triple {22447#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22447#true} is VALID [2018-11-23 12:30:40,522 INFO L273 TraceCheckUtils]: 21: Hoare triple {22447#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22447#true} is VALID [2018-11-23 12:30:40,522 INFO L273 TraceCheckUtils]: 22: Hoare triple {22447#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22447#true} is VALID [2018-11-23 12:30:40,522 INFO L273 TraceCheckUtils]: 23: Hoare triple {22447#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22447#true} is VALID [2018-11-23 12:30:40,522 INFO L273 TraceCheckUtils]: 24: Hoare triple {22447#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22447#true} is VALID [2018-11-23 12:30:40,522 INFO L273 TraceCheckUtils]: 25: Hoare triple {22447#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22447#true} is VALID [2018-11-23 12:30:40,522 INFO L273 TraceCheckUtils]: 26: Hoare triple {22447#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22447#true} is VALID [2018-11-23 12:30:40,522 INFO L273 TraceCheckUtils]: 27: Hoare triple {22447#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22447#true} is VALID [2018-11-23 12:30:40,523 INFO L273 TraceCheckUtils]: 28: Hoare triple {22447#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22447#true} is VALID [2018-11-23 12:30:40,523 INFO L273 TraceCheckUtils]: 29: Hoare triple {22447#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22447#true} is VALID [2018-11-23 12:30:40,523 INFO L273 TraceCheckUtils]: 30: Hoare triple {22447#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22447#true} is VALID [2018-11-23 12:30:40,523 INFO L273 TraceCheckUtils]: 31: Hoare triple {22447#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22447#true} is VALID [2018-11-23 12:30:40,523 INFO L273 TraceCheckUtils]: 32: Hoare triple {22447#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22447#true} is VALID [2018-11-23 12:30:40,523 INFO L273 TraceCheckUtils]: 33: Hoare triple {22447#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22447#true} is VALID [2018-11-23 12:30:40,524 INFO L273 TraceCheckUtils]: 34: Hoare triple {22447#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22447#true} is VALID [2018-11-23 12:30:40,524 INFO L273 TraceCheckUtils]: 35: Hoare triple {22447#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22447#true} is VALID [2018-11-23 12:30:40,524 INFO L273 TraceCheckUtils]: 36: Hoare triple {22447#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22447#true} is VALID [2018-11-23 12:30:40,524 INFO L273 TraceCheckUtils]: 37: Hoare triple {22447#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22447#true} is VALID [2018-11-23 12:30:40,524 INFO L273 TraceCheckUtils]: 38: Hoare triple {22447#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22447#true} is VALID [2018-11-23 12:30:40,524 INFO L273 TraceCheckUtils]: 39: Hoare triple {22447#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22447#true} is VALID [2018-11-23 12:30:40,524 INFO L273 TraceCheckUtils]: 40: Hoare triple {22447#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22447#true} is VALID [2018-11-23 12:30:40,525 INFO L273 TraceCheckUtils]: 41: Hoare triple {22447#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22447#true} is VALID [2018-11-23 12:30:40,525 INFO L273 TraceCheckUtils]: 42: Hoare triple {22447#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22447#true} is VALID [2018-11-23 12:30:40,525 INFO L273 TraceCheckUtils]: 43: Hoare triple {22447#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22447#true} is VALID [2018-11-23 12:30:40,525 INFO L273 TraceCheckUtils]: 44: Hoare triple {22447#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22447#true} is VALID [2018-11-23 12:30:40,525 INFO L273 TraceCheckUtils]: 45: Hoare triple {22447#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22447#true} is VALID [2018-11-23 12:30:40,525 INFO L273 TraceCheckUtils]: 46: Hoare triple {22447#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22447#true} is VALID [2018-11-23 12:30:40,525 INFO L273 TraceCheckUtils]: 47: Hoare triple {22447#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22447#true} is VALID [2018-11-23 12:30:40,526 INFO L273 TraceCheckUtils]: 48: Hoare triple {22447#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22447#true} is VALID [2018-11-23 12:30:40,526 INFO L273 TraceCheckUtils]: 49: Hoare triple {22447#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22447#true} is VALID [2018-11-23 12:30:40,526 INFO L273 TraceCheckUtils]: 50: Hoare triple {22447#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22447#true} is VALID [2018-11-23 12:30:40,526 INFO L273 TraceCheckUtils]: 51: Hoare triple {22447#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22447#true} is VALID [2018-11-23 12:30:40,526 INFO L273 TraceCheckUtils]: 52: Hoare triple {22447#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22447#true} is VALID [2018-11-23 12:30:40,526 INFO L273 TraceCheckUtils]: 53: Hoare triple {22447#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22447#true} is VALID [2018-11-23 12:30:40,527 INFO L273 TraceCheckUtils]: 54: Hoare triple {22447#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22447#true} is VALID [2018-11-23 12:30:40,527 INFO L273 TraceCheckUtils]: 55: Hoare triple {22447#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22447#true} is VALID [2018-11-23 12:30:40,527 INFO L273 TraceCheckUtils]: 56: Hoare triple {22447#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22447#true} is VALID [2018-11-23 12:30:40,527 INFO L273 TraceCheckUtils]: 57: Hoare triple {22447#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22447#true} is VALID [2018-11-23 12:30:40,527 INFO L273 TraceCheckUtils]: 58: Hoare triple {22447#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22447#true} is VALID [2018-11-23 12:30:40,527 INFO L273 TraceCheckUtils]: 59: Hoare triple {22447#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22447#true} is VALID [2018-11-23 12:30:40,527 INFO L273 TraceCheckUtils]: 60: Hoare triple {22447#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22447#true} is VALID [2018-11-23 12:30:40,528 INFO L273 TraceCheckUtils]: 61: Hoare triple {22447#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22447#true} is VALID [2018-11-23 12:30:40,528 INFO L273 TraceCheckUtils]: 62: Hoare triple {22447#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22447#true} is VALID [2018-11-23 12:30:40,528 INFO L273 TraceCheckUtils]: 63: Hoare triple {22447#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22447#true} is VALID [2018-11-23 12:30:40,528 INFO L273 TraceCheckUtils]: 64: Hoare triple {22447#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22447#true} is VALID [2018-11-23 12:30:40,528 INFO L273 TraceCheckUtils]: 65: Hoare triple {22447#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22447#true} is VALID [2018-11-23 12:30:40,528 INFO L273 TraceCheckUtils]: 66: Hoare triple {22447#true} assume !(~i~1 < 100000); {22447#true} is VALID [2018-11-23 12:30:40,528 INFO L256 TraceCheckUtils]: 67: Hoare triple {22447#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {22447#true} is VALID [2018-11-23 12:30:40,529 INFO L273 TraceCheckUtils]: 68: Hoare triple {22447#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {22447#true} is VALID [2018-11-23 12:30:40,529 INFO L273 TraceCheckUtils]: 69: Hoare triple {22447#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22447#true} is VALID [2018-11-23 12:30:40,529 INFO L273 TraceCheckUtils]: 70: Hoare triple {22447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22447#true} is VALID [2018-11-23 12:30:40,529 INFO L273 TraceCheckUtils]: 71: Hoare triple {22447#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22447#true} is VALID [2018-11-23 12:30:40,529 INFO L273 TraceCheckUtils]: 72: Hoare triple {22447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22447#true} is VALID [2018-11-23 12:30:40,529 INFO L273 TraceCheckUtils]: 73: Hoare triple {22447#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22447#true} is VALID [2018-11-23 12:30:40,529 INFO L273 TraceCheckUtils]: 74: Hoare triple {22447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22447#true} is VALID [2018-11-23 12:30:40,530 INFO L273 TraceCheckUtils]: 75: Hoare triple {22447#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22447#true} is VALID [2018-11-23 12:30:40,530 INFO L273 TraceCheckUtils]: 76: Hoare triple {22447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22447#true} is VALID [2018-11-23 12:30:40,530 INFO L273 TraceCheckUtils]: 77: Hoare triple {22447#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22447#true} is VALID [2018-11-23 12:30:40,530 INFO L273 TraceCheckUtils]: 78: Hoare triple {22447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22447#true} is VALID [2018-11-23 12:30:40,530 INFO L273 TraceCheckUtils]: 79: Hoare triple {22447#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22447#true} is VALID [2018-11-23 12:30:40,530 INFO L273 TraceCheckUtils]: 80: Hoare triple {22447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22447#true} is VALID [2018-11-23 12:30:40,530 INFO L273 TraceCheckUtils]: 81: Hoare triple {22447#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22447#true} is VALID [2018-11-23 12:30:40,531 INFO L273 TraceCheckUtils]: 82: Hoare triple {22447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22447#true} is VALID [2018-11-23 12:30:40,531 INFO L273 TraceCheckUtils]: 83: Hoare triple {22447#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22447#true} is VALID [2018-11-23 12:30:40,531 INFO L273 TraceCheckUtils]: 84: Hoare triple {22447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22447#true} is VALID [2018-11-23 12:30:40,531 INFO L273 TraceCheckUtils]: 85: Hoare triple {22447#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22447#true} is VALID [2018-11-23 12:30:40,531 INFO L273 TraceCheckUtils]: 86: Hoare triple {22447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22447#true} is VALID [2018-11-23 12:30:40,531 INFO L273 TraceCheckUtils]: 87: Hoare triple {22447#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22447#true} is VALID [2018-11-23 12:30:40,532 INFO L273 TraceCheckUtils]: 88: Hoare triple {22447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22447#true} is VALID [2018-11-23 12:30:40,532 INFO L273 TraceCheckUtils]: 89: Hoare triple {22447#true} assume !(~i~0 < 100000); {22447#true} is VALID [2018-11-23 12:30:40,532 INFO L273 TraceCheckUtils]: 90: Hoare triple {22447#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {22447#true} is VALID [2018-11-23 12:30:40,532 INFO L273 TraceCheckUtils]: 91: Hoare triple {22447#true} assume true; {22447#true} is VALID [2018-11-23 12:30:40,532 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {22447#true} {22447#true} #70#return; {22447#true} is VALID [2018-11-23 12:30:40,532 INFO L273 TraceCheckUtils]: 93: Hoare triple {22447#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {22447#true} is VALID [2018-11-23 12:30:40,532 INFO L256 TraceCheckUtils]: 94: Hoare triple {22447#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {22447#true} is VALID [2018-11-23 12:30:40,533 INFO L273 TraceCheckUtils]: 95: Hoare triple {22447#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {22447#true} is VALID [2018-11-23 12:30:40,533 INFO L273 TraceCheckUtils]: 96: Hoare triple {22447#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22447#true} is VALID [2018-11-23 12:30:40,533 INFO L273 TraceCheckUtils]: 97: Hoare triple {22447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22447#true} is VALID [2018-11-23 12:30:40,533 INFO L273 TraceCheckUtils]: 98: Hoare triple {22447#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22447#true} is VALID [2018-11-23 12:30:40,533 INFO L273 TraceCheckUtils]: 99: Hoare triple {22447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22447#true} is VALID [2018-11-23 12:30:40,533 INFO L273 TraceCheckUtils]: 100: Hoare triple {22447#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22447#true} is VALID [2018-11-23 12:30:40,533 INFO L273 TraceCheckUtils]: 101: Hoare triple {22447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22447#true} is VALID [2018-11-23 12:30:40,534 INFO L273 TraceCheckUtils]: 102: Hoare triple {22447#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22447#true} is VALID [2018-11-23 12:30:40,534 INFO L273 TraceCheckUtils]: 103: Hoare triple {22447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22447#true} is VALID [2018-11-23 12:30:40,534 INFO L273 TraceCheckUtils]: 104: Hoare triple {22447#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22447#true} is VALID [2018-11-23 12:30:40,534 INFO L273 TraceCheckUtils]: 105: Hoare triple {22447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22447#true} is VALID [2018-11-23 12:30:40,534 INFO L273 TraceCheckUtils]: 106: Hoare triple {22447#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22447#true} is VALID [2018-11-23 12:30:40,534 INFO L273 TraceCheckUtils]: 107: Hoare triple {22447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22447#true} is VALID [2018-11-23 12:30:40,534 INFO L273 TraceCheckUtils]: 108: Hoare triple {22447#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22447#true} is VALID [2018-11-23 12:30:40,535 INFO L273 TraceCheckUtils]: 109: Hoare triple {22447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22447#true} is VALID [2018-11-23 12:30:40,535 INFO L273 TraceCheckUtils]: 110: Hoare triple {22447#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22447#true} is VALID [2018-11-23 12:30:40,535 INFO L273 TraceCheckUtils]: 111: Hoare triple {22447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22447#true} is VALID [2018-11-23 12:30:40,535 INFO L273 TraceCheckUtils]: 112: Hoare triple {22447#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22447#true} is VALID [2018-11-23 12:30:40,535 INFO L273 TraceCheckUtils]: 113: Hoare triple {22447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22447#true} is VALID [2018-11-23 12:30:40,535 INFO L273 TraceCheckUtils]: 114: Hoare triple {22447#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22447#true} is VALID [2018-11-23 12:30:40,536 INFO L273 TraceCheckUtils]: 115: Hoare triple {22447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22447#true} is VALID [2018-11-23 12:30:40,536 INFO L273 TraceCheckUtils]: 116: Hoare triple {22447#true} assume !(~i~0 < 100000); {22447#true} is VALID [2018-11-23 12:30:40,536 INFO L273 TraceCheckUtils]: 117: Hoare triple {22447#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {22447#true} is VALID [2018-11-23 12:30:40,536 INFO L273 TraceCheckUtils]: 118: Hoare triple {22447#true} assume true; {22447#true} is VALID [2018-11-23 12:30:40,536 INFO L268 TraceCheckUtils]: 119: Hoare quadruple {22447#true} {22447#true} #72#return; {22447#true} is VALID [2018-11-23 12:30:40,547 INFO L273 TraceCheckUtils]: 120: Hoare triple {22447#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {22843#(<= main_~i~2 0)} is VALID [2018-11-23 12:30:40,549 INFO L273 TraceCheckUtils]: 121: Hoare triple {22843#(<= main_~i~2 0)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22843#(<= main_~i~2 0)} is VALID [2018-11-23 12:30:40,549 INFO L273 TraceCheckUtils]: 122: Hoare triple {22843#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22850#(<= main_~i~2 1)} is VALID [2018-11-23 12:30:40,550 INFO L273 TraceCheckUtils]: 123: Hoare triple {22850#(<= main_~i~2 1)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22850#(<= main_~i~2 1)} is VALID [2018-11-23 12:30:40,550 INFO L273 TraceCheckUtils]: 124: Hoare triple {22850#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22857#(<= main_~i~2 2)} is VALID [2018-11-23 12:30:40,551 INFO L273 TraceCheckUtils]: 125: Hoare triple {22857#(<= main_~i~2 2)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22857#(<= main_~i~2 2)} is VALID [2018-11-23 12:30:40,551 INFO L273 TraceCheckUtils]: 126: Hoare triple {22857#(<= main_~i~2 2)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22864#(<= main_~i~2 3)} is VALID [2018-11-23 12:30:40,551 INFO L273 TraceCheckUtils]: 127: Hoare triple {22864#(<= main_~i~2 3)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22864#(<= main_~i~2 3)} is VALID [2018-11-23 12:30:40,552 INFO L273 TraceCheckUtils]: 128: Hoare triple {22864#(<= main_~i~2 3)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22871#(<= main_~i~2 4)} is VALID [2018-11-23 12:30:40,552 INFO L273 TraceCheckUtils]: 129: Hoare triple {22871#(<= main_~i~2 4)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22871#(<= main_~i~2 4)} is VALID [2018-11-23 12:30:40,553 INFO L273 TraceCheckUtils]: 130: Hoare triple {22871#(<= main_~i~2 4)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22878#(<= main_~i~2 5)} is VALID [2018-11-23 12:30:40,553 INFO L273 TraceCheckUtils]: 131: Hoare triple {22878#(<= main_~i~2 5)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22878#(<= main_~i~2 5)} is VALID [2018-11-23 12:30:40,554 INFO L273 TraceCheckUtils]: 132: Hoare triple {22878#(<= main_~i~2 5)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22885#(<= main_~i~2 6)} is VALID [2018-11-23 12:30:40,555 INFO L273 TraceCheckUtils]: 133: Hoare triple {22885#(<= main_~i~2 6)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22885#(<= main_~i~2 6)} is VALID [2018-11-23 12:30:40,555 INFO L273 TraceCheckUtils]: 134: Hoare triple {22885#(<= main_~i~2 6)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22892#(<= main_~i~2 7)} is VALID [2018-11-23 12:30:40,556 INFO L273 TraceCheckUtils]: 135: Hoare triple {22892#(<= main_~i~2 7)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22892#(<= main_~i~2 7)} is VALID [2018-11-23 12:30:40,557 INFO L273 TraceCheckUtils]: 136: Hoare triple {22892#(<= main_~i~2 7)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22899#(<= main_~i~2 8)} is VALID [2018-11-23 12:30:40,557 INFO L273 TraceCheckUtils]: 137: Hoare triple {22899#(<= main_~i~2 8)} assume !(~i~2 < 99999); {22448#false} is VALID [2018-11-23 12:30:40,557 INFO L273 TraceCheckUtils]: 138: Hoare triple {22448#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {22448#false} is VALID [2018-11-23 12:30:40,558 INFO L256 TraceCheckUtils]: 139: Hoare triple {22448#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {22448#false} is VALID [2018-11-23 12:30:40,558 INFO L273 TraceCheckUtils]: 140: Hoare triple {22448#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {22448#false} is VALID [2018-11-23 12:30:40,558 INFO L273 TraceCheckUtils]: 141: Hoare triple {22448#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22448#false} is VALID [2018-11-23 12:30:40,558 INFO L273 TraceCheckUtils]: 142: Hoare triple {22448#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22448#false} is VALID [2018-11-23 12:30:40,558 INFO L273 TraceCheckUtils]: 143: Hoare triple {22448#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22448#false} is VALID [2018-11-23 12:30:40,559 INFO L273 TraceCheckUtils]: 144: Hoare triple {22448#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22448#false} is VALID [2018-11-23 12:30:40,559 INFO L273 TraceCheckUtils]: 145: Hoare triple {22448#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22448#false} is VALID [2018-11-23 12:30:40,559 INFO L273 TraceCheckUtils]: 146: Hoare triple {22448#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22448#false} is VALID [2018-11-23 12:30:40,559 INFO L273 TraceCheckUtils]: 147: Hoare triple {22448#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22448#false} is VALID [2018-11-23 12:30:40,559 INFO L273 TraceCheckUtils]: 148: Hoare triple {22448#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22448#false} is VALID [2018-11-23 12:30:40,559 INFO L273 TraceCheckUtils]: 149: Hoare triple {22448#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22448#false} is VALID [2018-11-23 12:30:40,560 INFO L273 TraceCheckUtils]: 150: Hoare triple {22448#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22448#false} is VALID [2018-11-23 12:30:40,560 INFO L273 TraceCheckUtils]: 151: Hoare triple {22448#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22448#false} is VALID [2018-11-23 12:30:40,560 INFO L273 TraceCheckUtils]: 152: Hoare triple {22448#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22448#false} is VALID [2018-11-23 12:30:40,560 INFO L273 TraceCheckUtils]: 153: Hoare triple {22448#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22448#false} is VALID [2018-11-23 12:30:40,560 INFO L273 TraceCheckUtils]: 154: Hoare triple {22448#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22448#false} is VALID [2018-11-23 12:30:40,560 INFO L273 TraceCheckUtils]: 155: Hoare triple {22448#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22448#false} is VALID [2018-11-23 12:30:40,561 INFO L273 TraceCheckUtils]: 156: Hoare triple {22448#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22448#false} is VALID [2018-11-23 12:30:40,561 INFO L273 TraceCheckUtils]: 157: Hoare triple {22448#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22448#false} is VALID [2018-11-23 12:30:40,561 INFO L273 TraceCheckUtils]: 158: Hoare triple {22448#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22448#false} is VALID [2018-11-23 12:30:40,561 INFO L273 TraceCheckUtils]: 159: Hoare triple {22448#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22448#false} is VALID [2018-11-23 12:30:40,561 INFO L273 TraceCheckUtils]: 160: Hoare triple {22448#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22448#false} is VALID [2018-11-23 12:30:40,561 INFO L273 TraceCheckUtils]: 161: Hoare triple {22448#false} assume !(~i~0 < 100000); {22448#false} is VALID [2018-11-23 12:30:40,562 INFO L273 TraceCheckUtils]: 162: Hoare triple {22448#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {22448#false} is VALID [2018-11-23 12:30:40,562 INFO L273 TraceCheckUtils]: 163: Hoare triple {22448#false} assume true; {22448#false} is VALID [2018-11-23 12:30:40,562 INFO L268 TraceCheckUtils]: 164: Hoare quadruple {22448#false} {22448#false} #74#return; {22448#false} is VALID [2018-11-23 12:30:40,562 INFO L273 TraceCheckUtils]: 165: Hoare triple {22448#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {22448#false} is VALID [2018-11-23 12:30:40,562 INFO L273 TraceCheckUtils]: 166: Hoare triple {22448#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {22448#false} is VALID [2018-11-23 12:30:40,562 INFO L273 TraceCheckUtils]: 167: Hoare triple {22448#false} assume !false; {22448#false} is VALID [2018-11-23 12:30:40,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1939 backedges. 450 proven. 64 refuted. 0 times theorem prover too weak. 1425 trivial. 0 not checked. [2018-11-23 12:30:40,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:30:40,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 11] total 42 [2018-11-23 12:30:40,594 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 168 [2018-11-23 12:30:40,594 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:30:40,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 12:30:40,720 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:30:40,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 12:30:40,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 12:30:40,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=582, Invalid=1140, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:30:40,721 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand 42 states. [2018-11-23 12:30:41,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:41,566 INFO L93 Difference]: Finished difference Result 177 states and 186 transitions. [2018-11-23 12:30:41,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-23 12:30:41,567 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 168 [2018-11-23 12:30:41,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:30:41,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:30:41,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 133 transitions. [2018-11-23 12:30:41,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:30:41,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 133 transitions. [2018-11-23 12:30:41,569 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 133 transitions. [2018-11-23 12:30:41,732 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:30:41,735 INFO L225 Difference]: With dead ends: 177 [2018-11-23 12:30:41,735 INFO L226 Difference]: Without dead ends: 125 [2018-11-23 12:30:41,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=582, Invalid=1140, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:30:41,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-23 12:30:41,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-11-23 12:30:41,788 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:30:41,788 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand 123 states. [2018-11-23 12:30:41,788 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 123 states. [2018-11-23 12:30:41,788 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 123 states. [2018-11-23 12:30:41,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:41,791 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2018-11-23 12:30:41,792 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-11-23 12:30:41,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:41,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:41,792 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 125 states. [2018-11-23 12:30:41,792 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 125 states. [2018-11-23 12:30:41,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:41,795 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2018-11-23 12:30:41,795 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-11-23 12:30:41,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:41,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:41,796 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:30:41,796 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:30:41,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-23 12:30:41,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 127 transitions. [2018-11-23 12:30:41,799 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 127 transitions. Word has length 168 [2018-11-23 12:30:41,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:30:41,799 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 127 transitions. [2018-11-23 12:30:41,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 12:30:41,799 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2018-11-23 12:30:41,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-23 12:30:41,801 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:30:41,801 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:30:41,801 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:30:41,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:30:41,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1949057213, now seen corresponding path program 31 times [2018-11-23 12:30:41,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:30:41,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:30:41,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:41,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:30:41,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:41,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:43,011 INFO L256 TraceCheckUtils]: 0: Hoare triple {23688#true} call ULTIMATE.init(); {23688#true} is VALID [2018-11-23 12:30:43,011 INFO L273 TraceCheckUtils]: 1: Hoare triple {23688#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23688#true} is VALID [2018-11-23 12:30:43,011 INFO L273 TraceCheckUtils]: 2: Hoare triple {23688#true} assume true; {23688#true} is VALID [2018-11-23 12:30:43,012 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23688#true} {23688#true} #66#return; {23688#true} is VALID [2018-11-23 12:30:43,012 INFO L256 TraceCheckUtils]: 4: Hoare triple {23688#true} call #t~ret13 := main(); {23688#true} is VALID [2018-11-23 12:30:43,012 INFO L273 TraceCheckUtils]: 5: Hoare triple {23688#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {23690#(= main_~i~1 0)} is VALID [2018-11-23 12:30:43,013 INFO L273 TraceCheckUtils]: 6: Hoare triple {23690#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23690#(= main_~i~1 0)} is VALID [2018-11-23 12:30:43,013 INFO L273 TraceCheckUtils]: 7: Hoare triple {23690#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23691#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:43,014 INFO L273 TraceCheckUtils]: 8: Hoare triple {23691#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23691#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:43,014 INFO L273 TraceCheckUtils]: 9: Hoare triple {23691#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23692#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:43,014 INFO L273 TraceCheckUtils]: 10: Hoare triple {23692#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23692#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:43,015 INFO L273 TraceCheckUtils]: 11: Hoare triple {23692#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23693#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:43,015 INFO L273 TraceCheckUtils]: 12: Hoare triple {23693#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23693#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:43,015 INFO L273 TraceCheckUtils]: 13: Hoare triple {23693#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23694#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:43,016 INFO L273 TraceCheckUtils]: 14: Hoare triple {23694#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23694#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:43,017 INFO L273 TraceCheckUtils]: 15: Hoare triple {23694#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23695#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:43,017 INFO L273 TraceCheckUtils]: 16: Hoare triple {23695#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23695#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:43,018 INFO L273 TraceCheckUtils]: 17: Hoare triple {23695#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23696#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:43,018 INFO L273 TraceCheckUtils]: 18: Hoare triple {23696#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23696#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:43,019 INFO L273 TraceCheckUtils]: 19: Hoare triple {23696#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23697#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:43,020 INFO L273 TraceCheckUtils]: 20: Hoare triple {23697#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23697#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:43,020 INFO L273 TraceCheckUtils]: 21: Hoare triple {23697#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23698#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:43,021 INFO L273 TraceCheckUtils]: 22: Hoare triple {23698#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23698#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:43,022 INFO L273 TraceCheckUtils]: 23: Hoare triple {23698#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23699#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:43,022 INFO L273 TraceCheckUtils]: 24: Hoare triple {23699#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23699#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:43,023 INFO L273 TraceCheckUtils]: 25: Hoare triple {23699#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23700#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:43,023 INFO L273 TraceCheckUtils]: 26: Hoare triple {23700#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23700#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:43,024 INFO L273 TraceCheckUtils]: 27: Hoare triple {23700#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23701#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:43,025 INFO L273 TraceCheckUtils]: 28: Hoare triple {23701#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23701#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:43,025 INFO L273 TraceCheckUtils]: 29: Hoare triple {23701#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23702#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:43,026 INFO L273 TraceCheckUtils]: 30: Hoare triple {23702#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23702#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:43,027 INFO L273 TraceCheckUtils]: 31: Hoare triple {23702#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23703#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:43,027 INFO L273 TraceCheckUtils]: 32: Hoare triple {23703#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23703#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:43,028 INFO L273 TraceCheckUtils]: 33: Hoare triple {23703#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23704#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:43,028 INFO L273 TraceCheckUtils]: 34: Hoare triple {23704#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23704#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:43,029 INFO L273 TraceCheckUtils]: 35: Hoare triple {23704#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23705#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:43,030 INFO L273 TraceCheckUtils]: 36: Hoare triple {23705#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23705#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:43,030 INFO L273 TraceCheckUtils]: 37: Hoare triple {23705#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23706#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:43,031 INFO L273 TraceCheckUtils]: 38: Hoare triple {23706#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23706#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:43,032 INFO L273 TraceCheckUtils]: 39: Hoare triple {23706#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23707#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:43,032 INFO L273 TraceCheckUtils]: 40: Hoare triple {23707#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23707#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:43,033 INFO L273 TraceCheckUtils]: 41: Hoare triple {23707#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23708#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:43,033 INFO L273 TraceCheckUtils]: 42: Hoare triple {23708#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23708#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:43,034 INFO L273 TraceCheckUtils]: 43: Hoare triple {23708#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23709#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:43,035 INFO L273 TraceCheckUtils]: 44: Hoare triple {23709#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23709#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:43,035 INFO L273 TraceCheckUtils]: 45: Hoare triple {23709#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23710#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:43,036 INFO L273 TraceCheckUtils]: 46: Hoare triple {23710#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23710#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:43,037 INFO L273 TraceCheckUtils]: 47: Hoare triple {23710#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23711#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:43,037 INFO L273 TraceCheckUtils]: 48: Hoare triple {23711#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23711#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:43,038 INFO L273 TraceCheckUtils]: 49: Hoare triple {23711#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23712#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:43,038 INFO L273 TraceCheckUtils]: 50: Hoare triple {23712#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23712#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:43,039 INFO L273 TraceCheckUtils]: 51: Hoare triple {23712#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23713#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:43,040 INFO L273 TraceCheckUtils]: 52: Hoare triple {23713#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23713#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:43,040 INFO L273 TraceCheckUtils]: 53: Hoare triple {23713#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23714#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:43,041 INFO L273 TraceCheckUtils]: 54: Hoare triple {23714#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23714#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:43,042 INFO L273 TraceCheckUtils]: 55: Hoare triple {23714#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23715#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:43,042 INFO L273 TraceCheckUtils]: 56: Hoare triple {23715#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23715#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:43,043 INFO L273 TraceCheckUtils]: 57: Hoare triple {23715#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23716#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:43,044 INFO L273 TraceCheckUtils]: 58: Hoare triple {23716#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23716#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:43,044 INFO L273 TraceCheckUtils]: 59: Hoare triple {23716#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23717#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:43,045 INFO L273 TraceCheckUtils]: 60: Hoare triple {23717#(<= main_~i~1 27)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23717#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:43,045 INFO L273 TraceCheckUtils]: 61: Hoare triple {23717#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23718#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:43,046 INFO L273 TraceCheckUtils]: 62: Hoare triple {23718#(<= main_~i~1 28)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23718#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:43,047 INFO L273 TraceCheckUtils]: 63: Hoare triple {23718#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23719#(<= main_~i~1 29)} is VALID [2018-11-23 12:30:43,047 INFO L273 TraceCheckUtils]: 64: Hoare triple {23719#(<= main_~i~1 29)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23719#(<= main_~i~1 29)} is VALID [2018-11-23 12:30:43,056 INFO L273 TraceCheckUtils]: 65: Hoare triple {23719#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23720#(<= main_~i~1 30)} is VALID [2018-11-23 12:30:43,057 INFO L273 TraceCheckUtils]: 66: Hoare triple {23720#(<= main_~i~1 30)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23720#(<= main_~i~1 30)} is VALID [2018-11-23 12:30:43,057 INFO L273 TraceCheckUtils]: 67: Hoare triple {23720#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23721#(<= main_~i~1 31)} is VALID [2018-11-23 12:30:43,057 INFO L273 TraceCheckUtils]: 68: Hoare triple {23721#(<= main_~i~1 31)} assume !(~i~1 < 100000); {23689#false} is VALID [2018-11-23 12:30:43,058 INFO L256 TraceCheckUtils]: 69: Hoare triple {23689#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {23688#true} is VALID [2018-11-23 12:30:43,058 INFO L273 TraceCheckUtils]: 70: Hoare triple {23688#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {23688#true} is VALID [2018-11-23 12:30:43,058 INFO L273 TraceCheckUtils]: 71: Hoare triple {23688#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23688#true} is VALID [2018-11-23 12:30:43,058 INFO L273 TraceCheckUtils]: 72: Hoare triple {23688#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23688#true} is VALID [2018-11-23 12:30:43,058 INFO L273 TraceCheckUtils]: 73: Hoare triple {23688#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23688#true} is VALID [2018-11-23 12:30:43,058 INFO L273 TraceCheckUtils]: 74: Hoare triple {23688#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23688#true} is VALID [2018-11-23 12:30:43,058 INFO L273 TraceCheckUtils]: 75: Hoare triple {23688#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23688#true} is VALID [2018-11-23 12:30:43,058 INFO L273 TraceCheckUtils]: 76: Hoare triple {23688#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23688#true} is VALID [2018-11-23 12:30:43,058 INFO L273 TraceCheckUtils]: 77: Hoare triple {23688#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23688#true} is VALID [2018-11-23 12:30:43,059 INFO L273 TraceCheckUtils]: 78: Hoare triple {23688#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23688#true} is VALID [2018-11-23 12:30:43,059 INFO L273 TraceCheckUtils]: 79: Hoare triple {23688#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23688#true} is VALID [2018-11-23 12:30:43,059 INFO L273 TraceCheckUtils]: 80: Hoare triple {23688#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23688#true} is VALID [2018-11-23 12:30:43,059 INFO L273 TraceCheckUtils]: 81: Hoare triple {23688#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23688#true} is VALID [2018-11-23 12:30:43,059 INFO L273 TraceCheckUtils]: 82: Hoare triple {23688#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23688#true} is VALID [2018-11-23 12:30:43,059 INFO L273 TraceCheckUtils]: 83: Hoare triple {23688#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23688#true} is VALID [2018-11-23 12:30:43,059 INFO L273 TraceCheckUtils]: 84: Hoare triple {23688#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23688#true} is VALID [2018-11-23 12:30:43,059 INFO L273 TraceCheckUtils]: 85: Hoare triple {23688#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23688#true} is VALID [2018-11-23 12:30:43,059 INFO L273 TraceCheckUtils]: 86: Hoare triple {23688#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23688#true} is VALID [2018-11-23 12:30:43,060 INFO L273 TraceCheckUtils]: 87: Hoare triple {23688#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23688#true} is VALID [2018-11-23 12:30:43,060 INFO L273 TraceCheckUtils]: 88: Hoare triple {23688#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23688#true} is VALID [2018-11-23 12:30:43,060 INFO L273 TraceCheckUtils]: 89: Hoare triple {23688#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23688#true} is VALID [2018-11-23 12:30:43,060 INFO L273 TraceCheckUtils]: 90: Hoare triple {23688#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23688#true} is VALID [2018-11-23 12:30:43,060 INFO L273 TraceCheckUtils]: 91: Hoare triple {23688#true} assume !(~i~0 < 100000); {23688#true} is VALID [2018-11-23 12:30:43,060 INFO L273 TraceCheckUtils]: 92: Hoare triple {23688#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {23688#true} is VALID [2018-11-23 12:30:43,060 INFO L273 TraceCheckUtils]: 93: Hoare triple {23688#true} assume true; {23688#true} is VALID [2018-11-23 12:30:43,060 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {23688#true} {23689#false} #70#return; {23689#false} is VALID [2018-11-23 12:30:43,060 INFO L273 TraceCheckUtils]: 95: Hoare triple {23689#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {23689#false} is VALID [2018-11-23 12:30:43,060 INFO L256 TraceCheckUtils]: 96: Hoare triple {23689#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {23688#true} is VALID [2018-11-23 12:30:43,061 INFO L273 TraceCheckUtils]: 97: Hoare triple {23688#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {23688#true} is VALID [2018-11-23 12:30:43,061 INFO L273 TraceCheckUtils]: 98: Hoare triple {23688#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23688#true} is VALID [2018-11-23 12:30:43,061 INFO L273 TraceCheckUtils]: 99: Hoare triple {23688#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23688#true} is VALID [2018-11-23 12:30:43,061 INFO L273 TraceCheckUtils]: 100: Hoare triple {23688#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23688#true} is VALID [2018-11-23 12:30:43,061 INFO L273 TraceCheckUtils]: 101: Hoare triple {23688#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23688#true} is VALID [2018-11-23 12:30:43,061 INFO L273 TraceCheckUtils]: 102: Hoare triple {23688#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23688#true} is VALID [2018-11-23 12:30:43,061 INFO L273 TraceCheckUtils]: 103: Hoare triple {23688#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23688#true} is VALID [2018-11-23 12:30:43,062 INFO L273 TraceCheckUtils]: 104: Hoare triple {23688#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23688#true} is VALID [2018-11-23 12:30:43,062 INFO L273 TraceCheckUtils]: 105: Hoare triple {23688#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23688#true} is VALID [2018-11-23 12:30:43,062 INFO L273 TraceCheckUtils]: 106: Hoare triple {23688#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23688#true} is VALID [2018-11-23 12:30:43,062 INFO L273 TraceCheckUtils]: 107: Hoare triple {23688#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23688#true} is VALID [2018-11-23 12:30:43,062 INFO L273 TraceCheckUtils]: 108: Hoare triple {23688#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23688#true} is VALID [2018-11-23 12:30:43,063 INFO L273 TraceCheckUtils]: 109: Hoare triple {23688#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23688#true} is VALID [2018-11-23 12:30:43,063 INFO L273 TraceCheckUtils]: 110: Hoare triple {23688#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23688#true} is VALID [2018-11-23 12:30:43,063 INFO L273 TraceCheckUtils]: 111: Hoare triple {23688#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23688#true} is VALID [2018-11-23 12:30:43,063 INFO L273 TraceCheckUtils]: 112: Hoare triple {23688#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23688#true} is VALID [2018-11-23 12:30:43,063 INFO L273 TraceCheckUtils]: 113: Hoare triple {23688#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23688#true} is VALID [2018-11-23 12:30:43,063 INFO L273 TraceCheckUtils]: 114: Hoare triple {23688#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23688#true} is VALID [2018-11-23 12:30:43,063 INFO L273 TraceCheckUtils]: 115: Hoare triple {23688#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23688#true} is VALID [2018-11-23 12:30:43,063 INFO L273 TraceCheckUtils]: 116: Hoare triple {23688#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23688#true} is VALID [2018-11-23 12:30:43,064 INFO L273 TraceCheckUtils]: 117: Hoare triple {23688#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23688#true} is VALID [2018-11-23 12:30:43,064 INFO L273 TraceCheckUtils]: 118: Hoare triple {23688#true} assume !(~i~0 < 100000); {23688#true} is VALID [2018-11-23 12:30:43,064 INFO L273 TraceCheckUtils]: 119: Hoare triple {23688#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {23688#true} is VALID [2018-11-23 12:30:43,064 INFO L273 TraceCheckUtils]: 120: Hoare triple {23688#true} assume true; {23688#true} is VALID [2018-11-23 12:30:43,064 INFO L268 TraceCheckUtils]: 121: Hoare quadruple {23688#true} {23689#false} #72#return; {23689#false} is VALID [2018-11-23 12:30:43,064 INFO L273 TraceCheckUtils]: 122: Hoare triple {23689#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {23689#false} is VALID [2018-11-23 12:30:43,064 INFO L273 TraceCheckUtils]: 123: Hoare triple {23689#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23689#false} is VALID [2018-11-23 12:30:43,064 INFO L273 TraceCheckUtils]: 124: Hoare triple {23689#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23689#false} is VALID [2018-11-23 12:30:43,064 INFO L273 TraceCheckUtils]: 125: Hoare triple {23689#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23689#false} is VALID [2018-11-23 12:30:43,065 INFO L273 TraceCheckUtils]: 126: Hoare triple {23689#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23689#false} is VALID [2018-11-23 12:30:43,065 INFO L273 TraceCheckUtils]: 127: Hoare triple {23689#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23689#false} is VALID [2018-11-23 12:30:43,065 INFO L273 TraceCheckUtils]: 128: Hoare triple {23689#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23689#false} is VALID [2018-11-23 12:30:43,065 INFO L273 TraceCheckUtils]: 129: Hoare triple {23689#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23689#false} is VALID [2018-11-23 12:30:43,065 INFO L273 TraceCheckUtils]: 130: Hoare triple {23689#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23689#false} is VALID [2018-11-23 12:30:43,065 INFO L273 TraceCheckUtils]: 131: Hoare triple {23689#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23689#false} is VALID [2018-11-23 12:30:43,065 INFO L273 TraceCheckUtils]: 132: Hoare triple {23689#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23689#false} is VALID [2018-11-23 12:30:43,065 INFO L273 TraceCheckUtils]: 133: Hoare triple {23689#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23689#false} is VALID [2018-11-23 12:30:43,065 INFO L273 TraceCheckUtils]: 134: Hoare triple {23689#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23689#false} is VALID [2018-11-23 12:30:43,065 INFO L273 TraceCheckUtils]: 135: Hoare triple {23689#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23689#false} is VALID [2018-11-23 12:30:43,066 INFO L273 TraceCheckUtils]: 136: Hoare triple {23689#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23689#false} is VALID [2018-11-23 12:30:43,066 INFO L273 TraceCheckUtils]: 137: Hoare triple {23689#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23689#false} is VALID [2018-11-23 12:30:43,066 INFO L273 TraceCheckUtils]: 138: Hoare triple {23689#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23689#false} is VALID [2018-11-23 12:30:43,066 INFO L273 TraceCheckUtils]: 139: Hoare triple {23689#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23689#false} is VALID [2018-11-23 12:30:43,066 INFO L273 TraceCheckUtils]: 140: Hoare triple {23689#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23689#false} is VALID [2018-11-23 12:30:43,066 INFO L273 TraceCheckUtils]: 141: Hoare triple {23689#false} assume !(~i~2 < 99999); {23689#false} is VALID [2018-11-23 12:30:43,066 INFO L273 TraceCheckUtils]: 142: Hoare triple {23689#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {23689#false} is VALID [2018-11-23 12:30:43,066 INFO L256 TraceCheckUtils]: 143: Hoare triple {23689#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {23688#true} is VALID [2018-11-23 12:30:43,066 INFO L273 TraceCheckUtils]: 144: Hoare triple {23688#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {23688#true} is VALID [2018-11-23 12:30:43,066 INFO L273 TraceCheckUtils]: 145: Hoare triple {23688#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23688#true} is VALID [2018-11-23 12:30:43,067 INFO L273 TraceCheckUtils]: 146: Hoare triple {23688#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23688#true} is VALID [2018-11-23 12:30:43,067 INFO L273 TraceCheckUtils]: 147: Hoare triple {23688#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23688#true} is VALID [2018-11-23 12:30:43,067 INFO L273 TraceCheckUtils]: 148: Hoare triple {23688#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23688#true} is VALID [2018-11-23 12:30:43,067 INFO L273 TraceCheckUtils]: 149: Hoare triple {23688#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23688#true} is VALID [2018-11-23 12:30:43,067 INFO L273 TraceCheckUtils]: 150: Hoare triple {23688#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23688#true} is VALID [2018-11-23 12:30:43,067 INFO L273 TraceCheckUtils]: 151: Hoare triple {23688#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23688#true} is VALID [2018-11-23 12:30:43,067 INFO L273 TraceCheckUtils]: 152: Hoare triple {23688#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23688#true} is VALID [2018-11-23 12:30:43,067 INFO L273 TraceCheckUtils]: 153: Hoare triple {23688#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23688#true} is VALID [2018-11-23 12:30:43,067 INFO L273 TraceCheckUtils]: 154: Hoare triple {23688#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23688#true} is VALID [2018-11-23 12:30:43,068 INFO L273 TraceCheckUtils]: 155: Hoare triple {23688#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23688#true} is VALID [2018-11-23 12:30:43,068 INFO L273 TraceCheckUtils]: 156: Hoare triple {23688#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23688#true} is VALID [2018-11-23 12:30:43,068 INFO L273 TraceCheckUtils]: 157: Hoare triple {23688#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23688#true} is VALID [2018-11-23 12:30:43,068 INFO L273 TraceCheckUtils]: 158: Hoare triple {23688#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23688#true} is VALID [2018-11-23 12:30:43,068 INFO L273 TraceCheckUtils]: 159: Hoare triple {23688#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23688#true} is VALID [2018-11-23 12:30:43,068 INFO L273 TraceCheckUtils]: 160: Hoare triple {23688#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23688#true} is VALID [2018-11-23 12:30:43,068 INFO L273 TraceCheckUtils]: 161: Hoare triple {23688#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23688#true} is VALID [2018-11-23 12:30:43,068 INFO L273 TraceCheckUtils]: 162: Hoare triple {23688#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23688#true} is VALID [2018-11-23 12:30:43,068 INFO L273 TraceCheckUtils]: 163: Hoare triple {23688#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23688#true} is VALID [2018-11-23 12:30:43,069 INFO L273 TraceCheckUtils]: 164: Hoare triple {23688#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23688#true} is VALID [2018-11-23 12:30:43,069 INFO L273 TraceCheckUtils]: 165: Hoare triple {23688#true} assume !(~i~0 < 100000); {23688#true} is VALID [2018-11-23 12:30:43,069 INFO L273 TraceCheckUtils]: 166: Hoare triple {23688#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {23688#true} is VALID [2018-11-23 12:30:43,069 INFO L273 TraceCheckUtils]: 167: Hoare triple {23688#true} assume true; {23688#true} is VALID [2018-11-23 12:30:43,069 INFO L268 TraceCheckUtils]: 168: Hoare quadruple {23688#true} {23689#false} #74#return; {23689#false} is VALID [2018-11-23 12:30:43,069 INFO L273 TraceCheckUtils]: 169: Hoare triple {23689#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {23689#false} is VALID [2018-11-23 12:30:43,069 INFO L273 TraceCheckUtils]: 170: Hoare triple {23689#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {23689#false} is VALID [2018-11-23 12:30:43,069 INFO L273 TraceCheckUtils]: 171: Hoare triple {23689#false} assume !false; {23689#false} is VALID [2018-11-23 12:30:43,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2017 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2018-11-23 12:30:43,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:30:43,083 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 12:30:43,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:30:43,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:43,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:43,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:30:44,450 INFO L256 TraceCheckUtils]: 0: Hoare triple {23688#true} call ULTIMATE.init(); {23688#true} is VALID [2018-11-23 12:30:44,450 INFO L273 TraceCheckUtils]: 1: Hoare triple {23688#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23688#true} is VALID [2018-11-23 12:30:44,450 INFO L273 TraceCheckUtils]: 2: Hoare triple {23688#true} assume true; {23688#true} is VALID [2018-11-23 12:30:44,451 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23688#true} {23688#true} #66#return; {23688#true} is VALID [2018-11-23 12:30:44,451 INFO L256 TraceCheckUtils]: 4: Hoare triple {23688#true} call #t~ret13 := main(); {23688#true} is VALID [2018-11-23 12:30:44,451 INFO L273 TraceCheckUtils]: 5: Hoare triple {23688#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {23740#(<= main_~i~1 0)} is VALID [2018-11-23 12:30:44,451 INFO L273 TraceCheckUtils]: 6: Hoare triple {23740#(<= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23740#(<= main_~i~1 0)} is VALID [2018-11-23 12:30:44,452 INFO L273 TraceCheckUtils]: 7: Hoare triple {23740#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23691#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:44,452 INFO L273 TraceCheckUtils]: 8: Hoare triple {23691#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23691#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:44,453 INFO L273 TraceCheckUtils]: 9: Hoare triple {23691#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23692#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:44,453 INFO L273 TraceCheckUtils]: 10: Hoare triple {23692#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23692#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:44,454 INFO L273 TraceCheckUtils]: 11: Hoare triple {23692#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23693#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:44,455 INFO L273 TraceCheckUtils]: 12: Hoare triple {23693#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23693#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:44,455 INFO L273 TraceCheckUtils]: 13: Hoare triple {23693#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23694#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:44,456 INFO L273 TraceCheckUtils]: 14: Hoare triple {23694#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23694#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:44,457 INFO L273 TraceCheckUtils]: 15: Hoare triple {23694#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23695#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:44,457 INFO L273 TraceCheckUtils]: 16: Hoare triple {23695#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23695#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:44,458 INFO L273 TraceCheckUtils]: 17: Hoare triple {23695#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23696#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:44,458 INFO L273 TraceCheckUtils]: 18: Hoare triple {23696#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23696#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:44,459 INFO L273 TraceCheckUtils]: 19: Hoare triple {23696#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23697#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:44,460 INFO L273 TraceCheckUtils]: 20: Hoare triple {23697#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23697#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:44,460 INFO L273 TraceCheckUtils]: 21: Hoare triple {23697#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23698#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:44,461 INFO L273 TraceCheckUtils]: 22: Hoare triple {23698#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23698#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:44,462 INFO L273 TraceCheckUtils]: 23: Hoare triple {23698#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23699#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:44,462 INFO L273 TraceCheckUtils]: 24: Hoare triple {23699#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23699#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:44,463 INFO L273 TraceCheckUtils]: 25: Hoare triple {23699#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23700#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:44,463 INFO L273 TraceCheckUtils]: 26: Hoare triple {23700#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23700#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:44,464 INFO L273 TraceCheckUtils]: 27: Hoare triple {23700#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23701#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:44,465 INFO L273 TraceCheckUtils]: 28: Hoare triple {23701#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23701#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:44,465 INFO L273 TraceCheckUtils]: 29: Hoare triple {23701#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23702#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:44,466 INFO L273 TraceCheckUtils]: 30: Hoare triple {23702#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23702#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:44,467 INFO L273 TraceCheckUtils]: 31: Hoare triple {23702#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23703#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:44,467 INFO L273 TraceCheckUtils]: 32: Hoare triple {23703#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23703#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:44,468 INFO L273 TraceCheckUtils]: 33: Hoare triple {23703#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23704#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:44,468 INFO L273 TraceCheckUtils]: 34: Hoare triple {23704#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23704#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:44,469 INFO L273 TraceCheckUtils]: 35: Hoare triple {23704#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23705#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:44,470 INFO L273 TraceCheckUtils]: 36: Hoare triple {23705#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23705#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:44,470 INFO L273 TraceCheckUtils]: 37: Hoare triple {23705#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23706#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:44,471 INFO L273 TraceCheckUtils]: 38: Hoare triple {23706#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23706#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:44,472 INFO L273 TraceCheckUtils]: 39: Hoare triple {23706#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23707#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:44,472 INFO L273 TraceCheckUtils]: 40: Hoare triple {23707#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23707#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:44,473 INFO L273 TraceCheckUtils]: 41: Hoare triple {23707#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23708#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:44,473 INFO L273 TraceCheckUtils]: 42: Hoare triple {23708#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23708#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:44,474 INFO L273 TraceCheckUtils]: 43: Hoare triple {23708#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23709#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:44,475 INFO L273 TraceCheckUtils]: 44: Hoare triple {23709#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23709#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:44,475 INFO L273 TraceCheckUtils]: 45: Hoare triple {23709#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23710#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:44,476 INFO L273 TraceCheckUtils]: 46: Hoare triple {23710#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23710#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:44,477 INFO L273 TraceCheckUtils]: 47: Hoare triple {23710#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23711#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:44,477 INFO L273 TraceCheckUtils]: 48: Hoare triple {23711#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23711#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:44,478 INFO L273 TraceCheckUtils]: 49: Hoare triple {23711#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23712#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:44,479 INFO L273 TraceCheckUtils]: 50: Hoare triple {23712#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23712#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:44,479 INFO L273 TraceCheckUtils]: 51: Hoare triple {23712#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23713#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:44,480 INFO L273 TraceCheckUtils]: 52: Hoare triple {23713#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23713#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:44,481 INFO L273 TraceCheckUtils]: 53: Hoare triple {23713#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23714#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:44,481 INFO L273 TraceCheckUtils]: 54: Hoare triple {23714#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23714#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:44,482 INFO L273 TraceCheckUtils]: 55: Hoare triple {23714#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23715#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:44,482 INFO L273 TraceCheckUtils]: 56: Hoare triple {23715#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23715#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:44,483 INFO L273 TraceCheckUtils]: 57: Hoare triple {23715#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23716#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:44,484 INFO L273 TraceCheckUtils]: 58: Hoare triple {23716#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23716#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:44,484 INFO L273 TraceCheckUtils]: 59: Hoare triple {23716#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23717#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:44,485 INFO L273 TraceCheckUtils]: 60: Hoare triple {23717#(<= main_~i~1 27)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23717#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:44,485 INFO L273 TraceCheckUtils]: 61: Hoare triple {23717#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23718#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:44,486 INFO L273 TraceCheckUtils]: 62: Hoare triple {23718#(<= main_~i~1 28)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23718#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:44,487 INFO L273 TraceCheckUtils]: 63: Hoare triple {23718#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23719#(<= main_~i~1 29)} is VALID [2018-11-23 12:30:44,487 INFO L273 TraceCheckUtils]: 64: Hoare triple {23719#(<= main_~i~1 29)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23719#(<= main_~i~1 29)} is VALID [2018-11-23 12:30:44,488 INFO L273 TraceCheckUtils]: 65: Hoare triple {23719#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23720#(<= main_~i~1 30)} is VALID [2018-11-23 12:30:44,489 INFO L273 TraceCheckUtils]: 66: Hoare triple {23720#(<= main_~i~1 30)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23720#(<= main_~i~1 30)} is VALID [2018-11-23 12:30:44,489 INFO L273 TraceCheckUtils]: 67: Hoare triple {23720#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23721#(<= main_~i~1 31)} is VALID [2018-11-23 12:30:44,490 INFO L273 TraceCheckUtils]: 68: Hoare triple {23721#(<= main_~i~1 31)} assume !(~i~1 < 100000); {23689#false} is VALID [2018-11-23 12:30:44,490 INFO L256 TraceCheckUtils]: 69: Hoare triple {23689#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {23689#false} is VALID [2018-11-23 12:30:44,490 INFO L273 TraceCheckUtils]: 70: Hoare triple {23689#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {23689#false} is VALID [2018-11-23 12:30:44,491 INFO L273 TraceCheckUtils]: 71: Hoare triple {23689#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23689#false} is VALID [2018-11-23 12:30:44,491 INFO L273 TraceCheckUtils]: 72: Hoare triple {23689#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23689#false} is VALID [2018-11-23 12:30:44,491 INFO L273 TraceCheckUtils]: 73: Hoare triple {23689#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23689#false} is VALID [2018-11-23 12:30:44,491 INFO L273 TraceCheckUtils]: 74: Hoare triple {23689#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23689#false} is VALID [2018-11-23 12:30:44,491 INFO L273 TraceCheckUtils]: 75: Hoare triple {23689#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23689#false} is VALID [2018-11-23 12:30:44,491 INFO L273 TraceCheckUtils]: 76: Hoare triple {23689#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23689#false} is VALID [2018-11-23 12:30:44,492 INFO L273 TraceCheckUtils]: 77: Hoare triple {23689#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23689#false} is VALID [2018-11-23 12:30:44,492 INFO L273 TraceCheckUtils]: 78: Hoare triple {23689#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23689#false} is VALID [2018-11-23 12:30:44,492 INFO L273 TraceCheckUtils]: 79: Hoare triple {23689#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23689#false} is VALID [2018-11-23 12:30:44,492 INFO L273 TraceCheckUtils]: 80: Hoare triple {23689#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23689#false} is VALID [2018-11-23 12:30:44,492 INFO L273 TraceCheckUtils]: 81: Hoare triple {23689#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23689#false} is VALID [2018-11-23 12:30:44,493 INFO L273 TraceCheckUtils]: 82: Hoare triple {23689#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23689#false} is VALID [2018-11-23 12:30:44,493 INFO L273 TraceCheckUtils]: 83: Hoare triple {23689#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23689#false} is VALID [2018-11-23 12:30:44,493 INFO L273 TraceCheckUtils]: 84: Hoare triple {23689#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23689#false} is VALID [2018-11-23 12:30:44,493 INFO L273 TraceCheckUtils]: 85: Hoare triple {23689#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23689#false} is VALID [2018-11-23 12:30:44,493 INFO L273 TraceCheckUtils]: 86: Hoare triple {23689#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23689#false} is VALID [2018-11-23 12:30:44,493 INFO L273 TraceCheckUtils]: 87: Hoare triple {23689#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23689#false} is VALID [2018-11-23 12:30:44,494 INFO L273 TraceCheckUtils]: 88: Hoare triple {23689#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23689#false} is VALID [2018-11-23 12:30:44,494 INFO L273 TraceCheckUtils]: 89: Hoare triple {23689#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23689#false} is VALID [2018-11-23 12:30:44,494 INFO L273 TraceCheckUtils]: 90: Hoare triple {23689#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23689#false} is VALID [2018-11-23 12:30:44,494 INFO L273 TraceCheckUtils]: 91: Hoare triple {23689#false} assume !(~i~0 < 100000); {23689#false} is VALID [2018-11-23 12:30:44,494 INFO L273 TraceCheckUtils]: 92: Hoare triple {23689#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {23689#false} is VALID [2018-11-23 12:30:44,495 INFO L273 TraceCheckUtils]: 93: Hoare triple {23689#false} assume true; {23689#false} is VALID [2018-11-23 12:30:44,495 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {23689#false} {23689#false} #70#return; {23689#false} is VALID [2018-11-23 12:30:44,495 INFO L273 TraceCheckUtils]: 95: Hoare triple {23689#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {23689#false} is VALID [2018-11-23 12:30:44,495 INFO L256 TraceCheckUtils]: 96: Hoare triple {23689#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {23689#false} is VALID [2018-11-23 12:30:44,495 INFO L273 TraceCheckUtils]: 97: Hoare triple {23689#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {23689#false} is VALID [2018-11-23 12:30:44,495 INFO L273 TraceCheckUtils]: 98: Hoare triple {23689#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23689#false} is VALID [2018-11-23 12:30:44,495 INFO L273 TraceCheckUtils]: 99: Hoare triple {23689#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23689#false} is VALID [2018-11-23 12:30:44,495 INFO L273 TraceCheckUtils]: 100: Hoare triple {23689#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23689#false} is VALID [2018-11-23 12:30:44,495 INFO L273 TraceCheckUtils]: 101: Hoare triple {23689#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23689#false} is VALID [2018-11-23 12:30:44,495 INFO L273 TraceCheckUtils]: 102: Hoare triple {23689#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23689#false} is VALID [2018-11-23 12:30:44,496 INFO L273 TraceCheckUtils]: 103: Hoare triple {23689#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23689#false} is VALID [2018-11-23 12:30:44,496 INFO L273 TraceCheckUtils]: 104: Hoare triple {23689#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23689#false} is VALID [2018-11-23 12:30:44,496 INFO L273 TraceCheckUtils]: 105: Hoare triple {23689#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23689#false} is VALID [2018-11-23 12:30:44,496 INFO L273 TraceCheckUtils]: 106: Hoare triple {23689#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23689#false} is VALID [2018-11-23 12:30:44,496 INFO L273 TraceCheckUtils]: 107: Hoare triple {23689#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23689#false} is VALID [2018-11-23 12:30:44,496 INFO L273 TraceCheckUtils]: 108: Hoare triple {23689#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23689#false} is VALID [2018-11-23 12:30:44,496 INFO L273 TraceCheckUtils]: 109: Hoare triple {23689#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23689#false} is VALID [2018-11-23 12:30:44,496 INFO L273 TraceCheckUtils]: 110: Hoare triple {23689#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23689#false} is VALID [2018-11-23 12:30:44,496 INFO L273 TraceCheckUtils]: 111: Hoare triple {23689#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23689#false} is VALID [2018-11-23 12:30:44,497 INFO L273 TraceCheckUtils]: 112: Hoare triple {23689#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23689#false} is VALID [2018-11-23 12:30:44,497 INFO L273 TraceCheckUtils]: 113: Hoare triple {23689#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23689#false} is VALID [2018-11-23 12:30:44,497 INFO L273 TraceCheckUtils]: 114: Hoare triple {23689#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23689#false} is VALID [2018-11-23 12:30:44,497 INFO L273 TraceCheckUtils]: 115: Hoare triple {23689#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23689#false} is VALID [2018-11-23 12:30:44,497 INFO L273 TraceCheckUtils]: 116: Hoare triple {23689#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23689#false} is VALID [2018-11-23 12:30:44,497 INFO L273 TraceCheckUtils]: 117: Hoare triple {23689#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23689#false} is VALID [2018-11-23 12:30:44,497 INFO L273 TraceCheckUtils]: 118: Hoare triple {23689#false} assume !(~i~0 < 100000); {23689#false} is VALID [2018-11-23 12:30:44,497 INFO L273 TraceCheckUtils]: 119: Hoare triple {23689#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {23689#false} is VALID [2018-11-23 12:30:44,497 INFO L273 TraceCheckUtils]: 120: Hoare triple {23689#false} assume true; {23689#false} is VALID [2018-11-23 12:30:44,497 INFO L268 TraceCheckUtils]: 121: Hoare quadruple {23689#false} {23689#false} #72#return; {23689#false} is VALID [2018-11-23 12:30:44,498 INFO L273 TraceCheckUtils]: 122: Hoare triple {23689#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {23689#false} is VALID [2018-11-23 12:30:44,498 INFO L273 TraceCheckUtils]: 123: Hoare triple {23689#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23689#false} is VALID [2018-11-23 12:30:44,498 INFO L273 TraceCheckUtils]: 124: Hoare triple {23689#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23689#false} is VALID [2018-11-23 12:30:44,498 INFO L273 TraceCheckUtils]: 125: Hoare triple {23689#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23689#false} is VALID [2018-11-23 12:30:44,498 INFO L273 TraceCheckUtils]: 126: Hoare triple {23689#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23689#false} is VALID [2018-11-23 12:30:44,498 INFO L273 TraceCheckUtils]: 127: Hoare triple {23689#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23689#false} is VALID [2018-11-23 12:30:44,498 INFO L273 TraceCheckUtils]: 128: Hoare triple {23689#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23689#false} is VALID [2018-11-23 12:30:44,498 INFO L273 TraceCheckUtils]: 129: Hoare triple {23689#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23689#false} is VALID [2018-11-23 12:30:44,498 INFO L273 TraceCheckUtils]: 130: Hoare triple {23689#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23689#false} is VALID [2018-11-23 12:30:44,498 INFO L273 TraceCheckUtils]: 131: Hoare triple {23689#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23689#false} is VALID [2018-11-23 12:30:44,499 INFO L273 TraceCheckUtils]: 132: Hoare triple {23689#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23689#false} is VALID [2018-11-23 12:30:44,499 INFO L273 TraceCheckUtils]: 133: Hoare triple {23689#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23689#false} is VALID [2018-11-23 12:30:44,499 INFO L273 TraceCheckUtils]: 134: Hoare triple {23689#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23689#false} is VALID [2018-11-23 12:30:44,499 INFO L273 TraceCheckUtils]: 135: Hoare triple {23689#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23689#false} is VALID [2018-11-23 12:30:44,499 INFO L273 TraceCheckUtils]: 136: Hoare triple {23689#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23689#false} is VALID [2018-11-23 12:30:44,499 INFO L273 TraceCheckUtils]: 137: Hoare triple {23689#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23689#false} is VALID [2018-11-23 12:30:44,499 INFO L273 TraceCheckUtils]: 138: Hoare triple {23689#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23689#false} is VALID [2018-11-23 12:30:44,499 INFO L273 TraceCheckUtils]: 139: Hoare triple {23689#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23689#false} is VALID [2018-11-23 12:30:44,499 INFO L273 TraceCheckUtils]: 140: Hoare triple {23689#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23689#false} is VALID [2018-11-23 12:30:44,500 INFO L273 TraceCheckUtils]: 141: Hoare triple {23689#false} assume !(~i~2 < 99999); {23689#false} is VALID [2018-11-23 12:30:44,500 INFO L273 TraceCheckUtils]: 142: Hoare triple {23689#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {23689#false} is VALID [2018-11-23 12:30:44,500 INFO L256 TraceCheckUtils]: 143: Hoare triple {23689#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {23689#false} is VALID [2018-11-23 12:30:44,500 INFO L273 TraceCheckUtils]: 144: Hoare triple {23689#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {23689#false} is VALID [2018-11-23 12:30:44,500 INFO L273 TraceCheckUtils]: 145: Hoare triple {23689#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23689#false} is VALID [2018-11-23 12:30:44,500 INFO L273 TraceCheckUtils]: 146: Hoare triple {23689#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23689#false} is VALID [2018-11-23 12:30:44,500 INFO L273 TraceCheckUtils]: 147: Hoare triple {23689#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23689#false} is VALID [2018-11-23 12:30:44,500 INFO L273 TraceCheckUtils]: 148: Hoare triple {23689#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23689#false} is VALID [2018-11-23 12:30:44,500 INFO L273 TraceCheckUtils]: 149: Hoare triple {23689#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23689#false} is VALID [2018-11-23 12:30:44,501 INFO L273 TraceCheckUtils]: 150: Hoare triple {23689#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23689#false} is VALID [2018-11-23 12:30:44,501 INFO L273 TraceCheckUtils]: 151: Hoare triple {23689#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23689#false} is VALID [2018-11-23 12:30:44,501 INFO L273 TraceCheckUtils]: 152: Hoare triple {23689#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23689#false} is VALID [2018-11-23 12:30:44,501 INFO L273 TraceCheckUtils]: 153: Hoare triple {23689#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23689#false} is VALID [2018-11-23 12:30:44,501 INFO L273 TraceCheckUtils]: 154: Hoare triple {23689#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23689#false} is VALID [2018-11-23 12:30:44,501 INFO L273 TraceCheckUtils]: 155: Hoare triple {23689#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23689#false} is VALID [2018-11-23 12:30:44,502 INFO L273 TraceCheckUtils]: 156: Hoare triple {23689#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23689#false} is VALID [2018-11-23 12:30:44,502 INFO L273 TraceCheckUtils]: 157: Hoare triple {23689#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23689#false} is VALID [2018-11-23 12:30:44,502 INFO L273 TraceCheckUtils]: 158: Hoare triple {23689#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23689#false} is VALID [2018-11-23 12:30:44,502 INFO L273 TraceCheckUtils]: 159: Hoare triple {23689#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23689#false} is VALID [2018-11-23 12:30:44,502 INFO L273 TraceCheckUtils]: 160: Hoare triple {23689#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23689#false} is VALID [2018-11-23 12:30:44,502 INFO L273 TraceCheckUtils]: 161: Hoare triple {23689#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23689#false} is VALID [2018-11-23 12:30:44,503 INFO L273 TraceCheckUtils]: 162: Hoare triple {23689#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23689#false} is VALID [2018-11-23 12:30:44,503 INFO L273 TraceCheckUtils]: 163: Hoare triple {23689#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23689#false} is VALID [2018-11-23 12:30:44,503 INFO L273 TraceCheckUtils]: 164: Hoare triple {23689#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23689#false} is VALID [2018-11-23 12:30:44,503 INFO L273 TraceCheckUtils]: 165: Hoare triple {23689#false} assume !(~i~0 < 100000); {23689#false} is VALID [2018-11-23 12:30:44,503 INFO L273 TraceCheckUtils]: 166: Hoare triple {23689#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {23689#false} is VALID [2018-11-23 12:30:44,503 INFO L273 TraceCheckUtils]: 167: Hoare triple {23689#false} assume true; {23689#false} is VALID [2018-11-23 12:30:44,503 INFO L268 TraceCheckUtils]: 168: Hoare quadruple {23689#false} {23689#false} #74#return; {23689#false} is VALID [2018-11-23 12:30:44,504 INFO L273 TraceCheckUtils]: 169: Hoare triple {23689#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {23689#false} is VALID [2018-11-23 12:30:44,504 INFO L273 TraceCheckUtils]: 170: Hoare triple {23689#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {23689#false} is VALID [2018-11-23 12:30:44,504 INFO L273 TraceCheckUtils]: 171: Hoare triple {23689#false} assume !false; {23689#false} is VALID [2018-11-23 12:30:44,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2017 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2018-11-23 12:30:44,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:30:44,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2018-11-23 12:30:44,552 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 172 [2018-11-23 12:30:44,552 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:30:44,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-23 12:30:44,906 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:30:44,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-23 12:30:44,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-23 12:30:44,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:30:44,907 INFO L87 Difference]: Start difference. First operand 123 states and 127 transitions. Second operand 35 states. [2018-11-23 12:30:45,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:45,886 INFO L93 Difference]: Finished difference Result 180 states and 188 transitions. [2018-11-23 12:30:45,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 12:30:45,886 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 172 [2018-11-23 12:30:45,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:30:45,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:30:45,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 116 transitions. [2018-11-23 12:30:45,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:30:45,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 116 transitions. [2018-11-23 12:30:45,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 116 transitions. [2018-11-23 12:30:46,042 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:30:46,045 INFO L225 Difference]: With dead ends: 180 [2018-11-23 12:30:46,045 INFO L226 Difference]: Without dead ends: 126 [2018-11-23 12:30:46,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:30:46,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-23 12:30:46,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2018-11-23 12:30:46,093 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:30:46,093 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand 125 states. [2018-11-23 12:30:46,093 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 125 states. [2018-11-23 12:30:46,093 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 125 states. [2018-11-23 12:30:46,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:46,095 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2018-11-23 12:30:46,096 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2018-11-23 12:30:46,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:46,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:46,096 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 126 states. [2018-11-23 12:30:46,096 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 126 states. [2018-11-23 12:30:46,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:46,098 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2018-11-23 12:30:46,098 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2018-11-23 12:30:46,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:46,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:46,098 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:30:46,098 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:30:46,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-23 12:30:46,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2018-11-23 12:30:46,100 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 172 [2018-11-23 12:30:46,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:30:46,100 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2018-11-23 12:30:46,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-23 12:30:46,100 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-11-23 12:30:46,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-23 12:30:46,101 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:30:46,101 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 30, 30, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:30:46,101 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:30:46,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:30:46,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1172060325, now seen corresponding path program 32 times [2018-11-23 12:30:46,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:30:46,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:30:46,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:46,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:30:46,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:46,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:46,800 INFO L256 TraceCheckUtils]: 0: Hoare triple {24944#true} call ULTIMATE.init(); {24944#true} is VALID [2018-11-23 12:30:46,800 INFO L273 TraceCheckUtils]: 1: Hoare triple {24944#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24944#true} is VALID [2018-11-23 12:30:46,801 INFO L273 TraceCheckUtils]: 2: Hoare triple {24944#true} assume true; {24944#true} is VALID [2018-11-23 12:30:46,801 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24944#true} {24944#true} #66#return; {24944#true} is VALID [2018-11-23 12:30:46,801 INFO L256 TraceCheckUtils]: 4: Hoare triple {24944#true} call #t~ret13 := main(); {24944#true} is VALID [2018-11-23 12:30:46,802 INFO L273 TraceCheckUtils]: 5: Hoare triple {24944#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {24946#(= main_~i~1 0)} is VALID [2018-11-23 12:30:46,802 INFO L273 TraceCheckUtils]: 6: Hoare triple {24946#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24946#(= main_~i~1 0)} is VALID [2018-11-23 12:30:46,803 INFO L273 TraceCheckUtils]: 7: Hoare triple {24946#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24947#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:46,803 INFO L273 TraceCheckUtils]: 8: Hoare triple {24947#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24947#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:46,803 INFO L273 TraceCheckUtils]: 9: Hoare triple {24947#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24948#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:46,804 INFO L273 TraceCheckUtils]: 10: Hoare triple {24948#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24948#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:46,804 INFO L273 TraceCheckUtils]: 11: Hoare triple {24948#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24949#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:46,804 INFO L273 TraceCheckUtils]: 12: Hoare triple {24949#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24949#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:46,805 INFO L273 TraceCheckUtils]: 13: Hoare triple {24949#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24950#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:46,805 INFO L273 TraceCheckUtils]: 14: Hoare triple {24950#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24950#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:46,806 INFO L273 TraceCheckUtils]: 15: Hoare triple {24950#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24951#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:46,806 INFO L273 TraceCheckUtils]: 16: Hoare triple {24951#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24951#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:46,807 INFO L273 TraceCheckUtils]: 17: Hoare triple {24951#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24952#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:46,808 INFO L273 TraceCheckUtils]: 18: Hoare triple {24952#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24952#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:46,808 INFO L273 TraceCheckUtils]: 19: Hoare triple {24952#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24953#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:46,809 INFO L273 TraceCheckUtils]: 20: Hoare triple {24953#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24953#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:46,810 INFO L273 TraceCheckUtils]: 21: Hoare triple {24953#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24954#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:46,810 INFO L273 TraceCheckUtils]: 22: Hoare triple {24954#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24954#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:46,811 INFO L273 TraceCheckUtils]: 23: Hoare triple {24954#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24955#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:46,811 INFO L273 TraceCheckUtils]: 24: Hoare triple {24955#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24955#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:46,812 INFO L273 TraceCheckUtils]: 25: Hoare triple {24955#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24956#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:46,813 INFO L273 TraceCheckUtils]: 26: Hoare triple {24956#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24956#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:46,813 INFO L273 TraceCheckUtils]: 27: Hoare triple {24956#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24957#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:46,814 INFO L273 TraceCheckUtils]: 28: Hoare triple {24957#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24957#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:46,814 INFO L273 TraceCheckUtils]: 29: Hoare triple {24957#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24958#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:46,815 INFO L273 TraceCheckUtils]: 30: Hoare triple {24958#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24958#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:46,816 INFO L273 TraceCheckUtils]: 31: Hoare triple {24958#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24959#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:46,816 INFO L273 TraceCheckUtils]: 32: Hoare triple {24959#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24959#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:46,817 INFO L273 TraceCheckUtils]: 33: Hoare triple {24959#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24960#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:46,817 INFO L273 TraceCheckUtils]: 34: Hoare triple {24960#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24960#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:46,818 INFO L273 TraceCheckUtils]: 35: Hoare triple {24960#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24961#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:46,819 INFO L273 TraceCheckUtils]: 36: Hoare triple {24961#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24961#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:46,819 INFO L273 TraceCheckUtils]: 37: Hoare triple {24961#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24962#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:46,820 INFO L273 TraceCheckUtils]: 38: Hoare triple {24962#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24962#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:46,821 INFO L273 TraceCheckUtils]: 39: Hoare triple {24962#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24963#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:46,821 INFO L273 TraceCheckUtils]: 40: Hoare triple {24963#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24963#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:46,822 INFO L273 TraceCheckUtils]: 41: Hoare triple {24963#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24964#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:46,822 INFO L273 TraceCheckUtils]: 42: Hoare triple {24964#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24964#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:46,823 INFO L273 TraceCheckUtils]: 43: Hoare triple {24964#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24965#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:46,824 INFO L273 TraceCheckUtils]: 44: Hoare triple {24965#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24965#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:46,824 INFO L273 TraceCheckUtils]: 45: Hoare triple {24965#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24966#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:46,825 INFO L273 TraceCheckUtils]: 46: Hoare triple {24966#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24966#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:46,826 INFO L273 TraceCheckUtils]: 47: Hoare triple {24966#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24967#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:46,826 INFO L273 TraceCheckUtils]: 48: Hoare triple {24967#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24967#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:46,827 INFO L273 TraceCheckUtils]: 49: Hoare triple {24967#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24968#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:46,827 INFO L273 TraceCheckUtils]: 50: Hoare triple {24968#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24968#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:46,828 INFO L273 TraceCheckUtils]: 51: Hoare triple {24968#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24969#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:46,829 INFO L273 TraceCheckUtils]: 52: Hoare triple {24969#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24969#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:46,829 INFO L273 TraceCheckUtils]: 53: Hoare triple {24969#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24970#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:46,830 INFO L273 TraceCheckUtils]: 54: Hoare triple {24970#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24970#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:46,831 INFO L273 TraceCheckUtils]: 55: Hoare triple {24970#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24971#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:46,831 INFO L273 TraceCheckUtils]: 56: Hoare triple {24971#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24971#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:46,832 INFO L273 TraceCheckUtils]: 57: Hoare triple {24971#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24972#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:46,832 INFO L273 TraceCheckUtils]: 58: Hoare triple {24972#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24972#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:46,833 INFO L273 TraceCheckUtils]: 59: Hoare triple {24972#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24973#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:46,834 INFO L273 TraceCheckUtils]: 60: Hoare triple {24973#(<= main_~i~1 27)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24973#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:46,834 INFO L273 TraceCheckUtils]: 61: Hoare triple {24973#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24974#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:46,835 INFO L273 TraceCheckUtils]: 62: Hoare triple {24974#(<= main_~i~1 28)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24974#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:46,836 INFO L273 TraceCheckUtils]: 63: Hoare triple {24974#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24975#(<= main_~i~1 29)} is VALID [2018-11-23 12:30:46,836 INFO L273 TraceCheckUtils]: 64: Hoare triple {24975#(<= main_~i~1 29)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24975#(<= main_~i~1 29)} is VALID [2018-11-23 12:30:46,837 INFO L273 TraceCheckUtils]: 65: Hoare triple {24975#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24976#(<= main_~i~1 30)} is VALID [2018-11-23 12:30:46,837 INFO L273 TraceCheckUtils]: 66: Hoare triple {24976#(<= main_~i~1 30)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24976#(<= main_~i~1 30)} is VALID [2018-11-23 12:30:46,838 INFO L273 TraceCheckUtils]: 67: Hoare triple {24976#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24977#(<= main_~i~1 31)} is VALID [2018-11-23 12:30:46,839 INFO L273 TraceCheckUtils]: 68: Hoare triple {24977#(<= main_~i~1 31)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24977#(<= main_~i~1 31)} is VALID [2018-11-23 12:30:46,839 INFO L273 TraceCheckUtils]: 69: Hoare triple {24977#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24978#(<= main_~i~1 32)} is VALID [2018-11-23 12:30:46,840 INFO L273 TraceCheckUtils]: 70: Hoare triple {24978#(<= main_~i~1 32)} assume !(~i~1 < 100000); {24945#false} is VALID [2018-11-23 12:30:46,840 INFO L256 TraceCheckUtils]: 71: Hoare triple {24945#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {24944#true} is VALID [2018-11-23 12:30:46,840 INFO L273 TraceCheckUtils]: 72: Hoare triple {24944#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {24944#true} is VALID [2018-11-23 12:30:46,841 INFO L273 TraceCheckUtils]: 73: Hoare triple {24944#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24944#true} is VALID [2018-11-23 12:30:46,841 INFO L273 TraceCheckUtils]: 74: Hoare triple {24944#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24944#true} is VALID [2018-11-23 12:30:46,841 INFO L273 TraceCheckUtils]: 75: Hoare triple {24944#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24944#true} is VALID [2018-11-23 12:30:46,841 INFO L273 TraceCheckUtils]: 76: Hoare triple {24944#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24944#true} is VALID [2018-11-23 12:30:46,841 INFO L273 TraceCheckUtils]: 77: Hoare triple {24944#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24944#true} is VALID [2018-11-23 12:30:46,841 INFO L273 TraceCheckUtils]: 78: Hoare triple {24944#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24944#true} is VALID [2018-11-23 12:30:46,842 INFO L273 TraceCheckUtils]: 79: Hoare triple {24944#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24944#true} is VALID [2018-11-23 12:30:46,842 INFO L273 TraceCheckUtils]: 80: Hoare triple {24944#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24944#true} is VALID [2018-11-23 12:30:46,842 INFO L273 TraceCheckUtils]: 81: Hoare triple {24944#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24944#true} is VALID [2018-11-23 12:30:46,842 INFO L273 TraceCheckUtils]: 82: Hoare triple {24944#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24944#true} is VALID [2018-11-23 12:30:46,842 INFO L273 TraceCheckUtils]: 83: Hoare triple {24944#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24944#true} is VALID [2018-11-23 12:30:46,842 INFO L273 TraceCheckUtils]: 84: Hoare triple {24944#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24944#true} is VALID [2018-11-23 12:30:46,843 INFO L273 TraceCheckUtils]: 85: Hoare triple {24944#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24944#true} is VALID [2018-11-23 12:30:46,843 INFO L273 TraceCheckUtils]: 86: Hoare triple {24944#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24944#true} is VALID [2018-11-23 12:30:46,843 INFO L273 TraceCheckUtils]: 87: Hoare triple {24944#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24944#true} is VALID [2018-11-23 12:30:46,843 INFO L273 TraceCheckUtils]: 88: Hoare triple {24944#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24944#true} is VALID [2018-11-23 12:30:46,843 INFO L273 TraceCheckUtils]: 89: Hoare triple {24944#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24944#true} is VALID [2018-11-23 12:30:46,844 INFO L273 TraceCheckUtils]: 90: Hoare triple {24944#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24944#true} is VALID [2018-11-23 12:30:46,844 INFO L273 TraceCheckUtils]: 91: Hoare triple {24944#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24944#true} is VALID [2018-11-23 12:30:46,844 INFO L273 TraceCheckUtils]: 92: Hoare triple {24944#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24944#true} is VALID [2018-11-23 12:30:46,844 INFO L273 TraceCheckUtils]: 93: Hoare triple {24944#true} assume !(~i~0 < 100000); {24944#true} is VALID [2018-11-23 12:30:46,844 INFO L273 TraceCheckUtils]: 94: Hoare triple {24944#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {24944#true} is VALID [2018-11-23 12:30:46,844 INFO L273 TraceCheckUtils]: 95: Hoare triple {24944#true} assume true; {24944#true} is VALID [2018-11-23 12:30:46,844 INFO L268 TraceCheckUtils]: 96: Hoare quadruple {24944#true} {24945#false} #70#return; {24945#false} is VALID [2018-11-23 12:30:46,844 INFO L273 TraceCheckUtils]: 97: Hoare triple {24945#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {24945#false} is VALID [2018-11-23 12:30:46,845 INFO L256 TraceCheckUtils]: 98: Hoare triple {24945#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {24944#true} is VALID [2018-11-23 12:30:46,845 INFO L273 TraceCheckUtils]: 99: Hoare triple {24944#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {24944#true} is VALID [2018-11-23 12:30:46,845 INFO L273 TraceCheckUtils]: 100: Hoare triple {24944#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24944#true} is VALID [2018-11-23 12:30:46,845 INFO L273 TraceCheckUtils]: 101: Hoare triple {24944#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24944#true} is VALID [2018-11-23 12:30:46,845 INFO L273 TraceCheckUtils]: 102: Hoare triple {24944#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24944#true} is VALID [2018-11-23 12:30:46,845 INFO L273 TraceCheckUtils]: 103: Hoare triple {24944#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24944#true} is VALID [2018-11-23 12:30:46,845 INFO L273 TraceCheckUtils]: 104: Hoare triple {24944#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24944#true} is VALID [2018-11-23 12:30:46,845 INFO L273 TraceCheckUtils]: 105: Hoare triple {24944#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24944#true} is VALID [2018-11-23 12:30:46,845 INFO L273 TraceCheckUtils]: 106: Hoare triple {24944#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24944#true} is VALID [2018-11-23 12:30:46,845 INFO L273 TraceCheckUtils]: 107: Hoare triple {24944#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24944#true} is VALID [2018-11-23 12:30:46,846 INFO L273 TraceCheckUtils]: 108: Hoare triple {24944#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24944#true} is VALID [2018-11-23 12:30:46,846 INFO L273 TraceCheckUtils]: 109: Hoare triple {24944#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24944#true} is VALID [2018-11-23 12:30:46,846 INFO L273 TraceCheckUtils]: 110: Hoare triple {24944#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24944#true} is VALID [2018-11-23 12:30:46,846 INFO L273 TraceCheckUtils]: 111: Hoare triple {24944#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24944#true} is VALID [2018-11-23 12:30:46,846 INFO L273 TraceCheckUtils]: 112: Hoare triple {24944#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24944#true} is VALID [2018-11-23 12:30:46,846 INFO L273 TraceCheckUtils]: 113: Hoare triple {24944#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24944#true} is VALID [2018-11-23 12:30:46,846 INFO L273 TraceCheckUtils]: 114: Hoare triple {24944#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24944#true} is VALID [2018-11-23 12:30:46,846 INFO L273 TraceCheckUtils]: 115: Hoare triple {24944#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24944#true} is VALID [2018-11-23 12:30:46,846 INFO L273 TraceCheckUtils]: 116: Hoare triple {24944#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24944#true} is VALID [2018-11-23 12:30:46,847 INFO L273 TraceCheckUtils]: 117: Hoare triple {24944#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24944#true} is VALID [2018-11-23 12:30:46,847 INFO L273 TraceCheckUtils]: 118: Hoare triple {24944#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24944#true} is VALID [2018-11-23 12:30:46,847 INFO L273 TraceCheckUtils]: 119: Hoare triple {24944#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24944#true} is VALID [2018-11-23 12:30:46,847 INFO L273 TraceCheckUtils]: 120: Hoare triple {24944#true} assume !(~i~0 < 100000); {24944#true} is VALID [2018-11-23 12:30:46,847 INFO L273 TraceCheckUtils]: 121: Hoare triple {24944#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {24944#true} is VALID [2018-11-23 12:30:46,847 INFO L273 TraceCheckUtils]: 122: Hoare triple {24944#true} assume true; {24944#true} is VALID [2018-11-23 12:30:46,847 INFO L268 TraceCheckUtils]: 123: Hoare quadruple {24944#true} {24945#false} #72#return; {24945#false} is VALID [2018-11-23 12:30:46,847 INFO L273 TraceCheckUtils]: 124: Hoare triple {24945#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {24945#false} is VALID [2018-11-23 12:30:46,847 INFO L273 TraceCheckUtils]: 125: Hoare triple {24945#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {24945#false} is VALID [2018-11-23 12:30:46,847 INFO L273 TraceCheckUtils]: 126: Hoare triple {24945#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {24945#false} is VALID [2018-11-23 12:30:46,848 INFO L273 TraceCheckUtils]: 127: Hoare triple {24945#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {24945#false} is VALID [2018-11-23 12:30:46,848 INFO L273 TraceCheckUtils]: 128: Hoare triple {24945#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {24945#false} is VALID [2018-11-23 12:30:46,848 INFO L273 TraceCheckUtils]: 129: Hoare triple {24945#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {24945#false} is VALID [2018-11-23 12:30:46,848 INFO L273 TraceCheckUtils]: 130: Hoare triple {24945#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {24945#false} is VALID [2018-11-23 12:30:46,848 INFO L273 TraceCheckUtils]: 131: Hoare triple {24945#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {24945#false} is VALID [2018-11-23 12:30:46,848 INFO L273 TraceCheckUtils]: 132: Hoare triple {24945#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {24945#false} is VALID [2018-11-23 12:30:46,848 INFO L273 TraceCheckUtils]: 133: Hoare triple {24945#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {24945#false} is VALID [2018-11-23 12:30:46,848 INFO L273 TraceCheckUtils]: 134: Hoare triple {24945#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {24945#false} is VALID [2018-11-23 12:30:46,848 INFO L273 TraceCheckUtils]: 135: Hoare triple {24945#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {24945#false} is VALID [2018-11-23 12:30:46,848 INFO L273 TraceCheckUtils]: 136: Hoare triple {24945#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {24945#false} is VALID [2018-11-23 12:30:46,849 INFO L273 TraceCheckUtils]: 137: Hoare triple {24945#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {24945#false} is VALID [2018-11-23 12:30:46,849 INFO L273 TraceCheckUtils]: 138: Hoare triple {24945#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {24945#false} is VALID [2018-11-23 12:30:46,849 INFO L273 TraceCheckUtils]: 139: Hoare triple {24945#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {24945#false} is VALID [2018-11-23 12:30:46,849 INFO L273 TraceCheckUtils]: 140: Hoare triple {24945#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {24945#false} is VALID [2018-11-23 12:30:46,849 INFO L273 TraceCheckUtils]: 141: Hoare triple {24945#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {24945#false} is VALID [2018-11-23 12:30:46,849 INFO L273 TraceCheckUtils]: 142: Hoare triple {24945#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {24945#false} is VALID [2018-11-23 12:30:46,849 INFO L273 TraceCheckUtils]: 143: Hoare triple {24945#false} assume !(~i~2 < 99999); {24945#false} is VALID [2018-11-23 12:30:46,849 INFO L273 TraceCheckUtils]: 144: Hoare triple {24945#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {24945#false} is VALID [2018-11-23 12:30:46,849 INFO L256 TraceCheckUtils]: 145: Hoare triple {24945#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {24944#true} is VALID [2018-11-23 12:30:46,850 INFO L273 TraceCheckUtils]: 146: Hoare triple {24944#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {24944#true} is VALID [2018-11-23 12:30:46,850 INFO L273 TraceCheckUtils]: 147: Hoare triple {24944#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24944#true} is VALID [2018-11-23 12:30:46,850 INFO L273 TraceCheckUtils]: 148: Hoare triple {24944#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24944#true} is VALID [2018-11-23 12:30:46,850 INFO L273 TraceCheckUtils]: 149: Hoare triple {24944#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24944#true} is VALID [2018-11-23 12:30:46,850 INFO L273 TraceCheckUtils]: 150: Hoare triple {24944#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24944#true} is VALID [2018-11-23 12:30:46,850 INFO L273 TraceCheckUtils]: 151: Hoare triple {24944#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24944#true} is VALID [2018-11-23 12:30:46,850 INFO L273 TraceCheckUtils]: 152: Hoare triple {24944#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24944#true} is VALID [2018-11-23 12:30:46,850 INFO L273 TraceCheckUtils]: 153: Hoare triple {24944#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24944#true} is VALID [2018-11-23 12:30:46,850 INFO L273 TraceCheckUtils]: 154: Hoare triple {24944#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24944#true} is VALID [2018-11-23 12:30:46,850 INFO L273 TraceCheckUtils]: 155: Hoare triple {24944#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24944#true} is VALID [2018-11-23 12:30:46,851 INFO L273 TraceCheckUtils]: 156: Hoare triple {24944#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24944#true} is VALID [2018-11-23 12:30:46,851 INFO L273 TraceCheckUtils]: 157: Hoare triple {24944#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24944#true} is VALID [2018-11-23 12:30:46,851 INFO L273 TraceCheckUtils]: 158: Hoare triple {24944#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24944#true} is VALID [2018-11-23 12:30:46,851 INFO L273 TraceCheckUtils]: 159: Hoare triple {24944#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24944#true} is VALID [2018-11-23 12:30:46,851 INFO L273 TraceCheckUtils]: 160: Hoare triple {24944#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24944#true} is VALID [2018-11-23 12:30:46,851 INFO L273 TraceCheckUtils]: 161: Hoare triple {24944#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24944#true} is VALID [2018-11-23 12:30:46,851 INFO L273 TraceCheckUtils]: 162: Hoare triple {24944#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24944#true} is VALID [2018-11-23 12:30:46,851 INFO L273 TraceCheckUtils]: 163: Hoare triple {24944#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24944#true} is VALID [2018-11-23 12:30:46,851 INFO L273 TraceCheckUtils]: 164: Hoare triple {24944#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24944#true} is VALID [2018-11-23 12:30:46,851 INFO L273 TraceCheckUtils]: 165: Hoare triple {24944#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24944#true} is VALID [2018-11-23 12:30:46,852 INFO L273 TraceCheckUtils]: 166: Hoare triple {24944#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24944#true} is VALID [2018-11-23 12:30:46,852 INFO L273 TraceCheckUtils]: 167: Hoare triple {24944#true} assume !(~i~0 < 100000); {24944#true} is VALID [2018-11-23 12:30:46,852 INFO L273 TraceCheckUtils]: 168: Hoare triple {24944#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {24944#true} is VALID [2018-11-23 12:30:46,852 INFO L273 TraceCheckUtils]: 169: Hoare triple {24944#true} assume true; {24944#true} is VALID [2018-11-23 12:30:46,852 INFO L268 TraceCheckUtils]: 170: Hoare quadruple {24944#true} {24945#false} #74#return; {24945#false} is VALID [2018-11-23 12:30:46,852 INFO L273 TraceCheckUtils]: 171: Hoare triple {24945#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {24945#false} is VALID [2018-11-23 12:30:46,852 INFO L273 TraceCheckUtils]: 172: Hoare triple {24945#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {24945#false} is VALID [2018-11-23 12:30:46,852 INFO L273 TraceCheckUtils]: 173: Hoare triple {24945#false} assume !false; {24945#false} is VALID [2018-11-23 12:30:46,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2018-11-23 12:30:46,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:30:46,866 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 12:30:46,874 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:30:46,947 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:30:46,947 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:30:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:47,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:30:47,292 INFO L256 TraceCheckUtils]: 0: Hoare triple {24944#true} call ULTIMATE.init(); {24944#true} is VALID [2018-11-23 12:30:47,292 INFO L273 TraceCheckUtils]: 1: Hoare triple {24944#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24944#true} is VALID [2018-11-23 12:30:47,292 INFO L273 TraceCheckUtils]: 2: Hoare triple {24944#true} assume true; {24944#true} is VALID [2018-11-23 12:30:47,292 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24944#true} {24944#true} #66#return; {24944#true} is VALID [2018-11-23 12:30:47,293 INFO L256 TraceCheckUtils]: 4: Hoare triple {24944#true} call #t~ret13 := main(); {24944#true} is VALID [2018-11-23 12:30:47,293 INFO L273 TraceCheckUtils]: 5: Hoare triple {24944#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {24997#(<= main_~i~1 0)} is VALID [2018-11-23 12:30:47,294 INFO L273 TraceCheckUtils]: 6: Hoare triple {24997#(<= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24997#(<= main_~i~1 0)} is VALID [2018-11-23 12:30:47,294 INFO L273 TraceCheckUtils]: 7: Hoare triple {24997#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24947#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:47,295 INFO L273 TraceCheckUtils]: 8: Hoare triple {24947#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24947#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:47,295 INFO L273 TraceCheckUtils]: 9: Hoare triple {24947#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24948#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:47,295 INFO L273 TraceCheckUtils]: 10: Hoare triple {24948#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24948#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:47,296 INFO L273 TraceCheckUtils]: 11: Hoare triple {24948#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24949#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:47,296 INFO L273 TraceCheckUtils]: 12: Hoare triple {24949#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24949#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:47,297 INFO L273 TraceCheckUtils]: 13: Hoare triple {24949#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24950#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:47,297 INFO L273 TraceCheckUtils]: 14: Hoare triple {24950#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24950#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:47,298 INFO L273 TraceCheckUtils]: 15: Hoare triple {24950#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24951#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:47,298 INFO L273 TraceCheckUtils]: 16: Hoare triple {24951#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24951#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:47,299 INFO L273 TraceCheckUtils]: 17: Hoare triple {24951#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24952#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:47,299 INFO L273 TraceCheckUtils]: 18: Hoare triple {24952#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24952#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:47,300 INFO L273 TraceCheckUtils]: 19: Hoare triple {24952#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24953#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:47,301 INFO L273 TraceCheckUtils]: 20: Hoare triple {24953#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24953#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:47,301 INFO L273 TraceCheckUtils]: 21: Hoare triple {24953#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24954#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:47,302 INFO L273 TraceCheckUtils]: 22: Hoare triple {24954#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24954#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:47,303 INFO L273 TraceCheckUtils]: 23: Hoare triple {24954#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24955#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:47,303 INFO L273 TraceCheckUtils]: 24: Hoare triple {24955#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24955#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:47,304 INFO L273 TraceCheckUtils]: 25: Hoare triple {24955#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24956#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:47,304 INFO L273 TraceCheckUtils]: 26: Hoare triple {24956#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24956#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:47,305 INFO L273 TraceCheckUtils]: 27: Hoare triple {24956#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24957#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:47,306 INFO L273 TraceCheckUtils]: 28: Hoare triple {24957#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24957#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:47,306 INFO L273 TraceCheckUtils]: 29: Hoare triple {24957#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24958#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:47,307 INFO L273 TraceCheckUtils]: 30: Hoare triple {24958#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24958#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:47,308 INFO L273 TraceCheckUtils]: 31: Hoare triple {24958#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24959#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:47,308 INFO L273 TraceCheckUtils]: 32: Hoare triple {24959#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24959#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:47,309 INFO L273 TraceCheckUtils]: 33: Hoare triple {24959#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24960#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:47,309 INFO L273 TraceCheckUtils]: 34: Hoare triple {24960#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24960#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:47,310 INFO L273 TraceCheckUtils]: 35: Hoare triple {24960#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24961#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:47,311 INFO L273 TraceCheckUtils]: 36: Hoare triple {24961#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24961#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:47,311 INFO L273 TraceCheckUtils]: 37: Hoare triple {24961#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24962#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:47,312 INFO L273 TraceCheckUtils]: 38: Hoare triple {24962#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24962#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:47,313 INFO L273 TraceCheckUtils]: 39: Hoare triple {24962#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24963#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:47,313 INFO L273 TraceCheckUtils]: 40: Hoare triple {24963#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24963#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:47,314 INFO L273 TraceCheckUtils]: 41: Hoare triple {24963#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24964#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:47,314 INFO L273 TraceCheckUtils]: 42: Hoare triple {24964#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24964#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:47,315 INFO L273 TraceCheckUtils]: 43: Hoare triple {24964#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24965#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:47,316 INFO L273 TraceCheckUtils]: 44: Hoare triple {24965#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24965#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:47,316 INFO L273 TraceCheckUtils]: 45: Hoare triple {24965#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24966#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:47,317 INFO L273 TraceCheckUtils]: 46: Hoare triple {24966#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24966#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:47,318 INFO L273 TraceCheckUtils]: 47: Hoare triple {24966#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24967#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:47,318 INFO L273 TraceCheckUtils]: 48: Hoare triple {24967#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24967#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:47,319 INFO L273 TraceCheckUtils]: 49: Hoare triple {24967#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24968#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:47,319 INFO L273 TraceCheckUtils]: 50: Hoare triple {24968#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24968#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:47,320 INFO L273 TraceCheckUtils]: 51: Hoare triple {24968#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24969#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:47,321 INFO L273 TraceCheckUtils]: 52: Hoare triple {24969#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24969#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:47,321 INFO L273 TraceCheckUtils]: 53: Hoare triple {24969#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24970#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:47,322 INFO L273 TraceCheckUtils]: 54: Hoare triple {24970#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24970#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:47,323 INFO L273 TraceCheckUtils]: 55: Hoare triple {24970#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24971#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:47,323 INFO L273 TraceCheckUtils]: 56: Hoare triple {24971#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24971#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:47,324 INFO L273 TraceCheckUtils]: 57: Hoare triple {24971#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24972#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:47,324 INFO L273 TraceCheckUtils]: 58: Hoare triple {24972#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24972#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:47,325 INFO L273 TraceCheckUtils]: 59: Hoare triple {24972#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24973#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:47,326 INFO L273 TraceCheckUtils]: 60: Hoare triple {24973#(<= main_~i~1 27)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24973#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:47,326 INFO L273 TraceCheckUtils]: 61: Hoare triple {24973#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24974#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:47,327 INFO L273 TraceCheckUtils]: 62: Hoare triple {24974#(<= main_~i~1 28)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24974#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:47,328 INFO L273 TraceCheckUtils]: 63: Hoare triple {24974#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24975#(<= main_~i~1 29)} is VALID [2018-11-23 12:30:47,328 INFO L273 TraceCheckUtils]: 64: Hoare triple {24975#(<= main_~i~1 29)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24975#(<= main_~i~1 29)} is VALID [2018-11-23 12:30:47,329 INFO L273 TraceCheckUtils]: 65: Hoare triple {24975#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24976#(<= main_~i~1 30)} is VALID [2018-11-23 12:30:47,329 INFO L273 TraceCheckUtils]: 66: Hoare triple {24976#(<= main_~i~1 30)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24976#(<= main_~i~1 30)} is VALID [2018-11-23 12:30:47,330 INFO L273 TraceCheckUtils]: 67: Hoare triple {24976#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24977#(<= main_~i~1 31)} is VALID [2018-11-23 12:30:47,331 INFO L273 TraceCheckUtils]: 68: Hoare triple {24977#(<= main_~i~1 31)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24977#(<= main_~i~1 31)} is VALID [2018-11-23 12:30:47,331 INFO L273 TraceCheckUtils]: 69: Hoare triple {24977#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24978#(<= main_~i~1 32)} is VALID [2018-11-23 12:30:47,332 INFO L273 TraceCheckUtils]: 70: Hoare triple {24978#(<= main_~i~1 32)} assume !(~i~1 < 100000); {24945#false} is VALID [2018-11-23 12:30:47,332 INFO L256 TraceCheckUtils]: 71: Hoare triple {24945#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {24945#false} is VALID [2018-11-23 12:30:47,332 INFO L273 TraceCheckUtils]: 72: Hoare triple {24945#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {24945#false} is VALID [2018-11-23 12:30:47,332 INFO L273 TraceCheckUtils]: 73: Hoare triple {24945#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24945#false} is VALID [2018-11-23 12:30:47,333 INFO L273 TraceCheckUtils]: 74: Hoare triple {24945#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24945#false} is VALID [2018-11-23 12:30:47,333 INFO L273 TraceCheckUtils]: 75: Hoare triple {24945#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24945#false} is VALID [2018-11-23 12:30:47,333 INFO L273 TraceCheckUtils]: 76: Hoare triple {24945#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24945#false} is VALID [2018-11-23 12:30:47,333 INFO L273 TraceCheckUtils]: 77: Hoare triple {24945#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24945#false} is VALID [2018-11-23 12:30:47,333 INFO L273 TraceCheckUtils]: 78: Hoare triple {24945#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24945#false} is VALID [2018-11-23 12:30:47,334 INFO L273 TraceCheckUtils]: 79: Hoare triple {24945#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24945#false} is VALID [2018-11-23 12:30:47,334 INFO L273 TraceCheckUtils]: 80: Hoare triple {24945#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24945#false} is VALID [2018-11-23 12:30:47,334 INFO L273 TraceCheckUtils]: 81: Hoare triple {24945#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24945#false} is VALID [2018-11-23 12:30:47,334 INFO L273 TraceCheckUtils]: 82: Hoare triple {24945#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24945#false} is VALID [2018-11-23 12:30:47,334 INFO L273 TraceCheckUtils]: 83: Hoare triple {24945#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24945#false} is VALID [2018-11-23 12:30:47,334 INFO L273 TraceCheckUtils]: 84: Hoare triple {24945#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24945#false} is VALID [2018-11-23 12:30:47,335 INFO L273 TraceCheckUtils]: 85: Hoare triple {24945#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24945#false} is VALID [2018-11-23 12:30:47,335 INFO L273 TraceCheckUtils]: 86: Hoare triple {24945#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24945#false} is VALID [2018-11-23 12:30:47,335 INFO L273 TraceCheckUtils]: 87: Hoare triple {24945#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24945#false} is VALID [2018-11-23 12:30:47,335 INFO L273 TraceCheckUtils]: 88: Hoare triple {24945#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24945#false} is VALID [2018-11-23 12:30:47,335 INFO L273 TraceCheckUtils]: 89: Hoare triple {24945#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24945#false} is VALID [2018-11-23 12:30:47,335 INFO L273 TraceCheckUtils]: 90: Hoare triple {24945#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24945#false} is VALID [2018-11-23 12:30:47,335 INFO L273 TraceCheckUtils]: 91: Hoare triple {24945#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24945#false} is VALID [2018-11-23 12:30:47,335 INFO L273 TraceCheckUtils]: 92: Hoare triple {24945#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24945#false} is VALID [2018-11-23 12:30:47,336 INFO L273 TraceCheckUtils]: 93: Hoare triple {24945#false} assume !(~i~0 < 100000); {24945#false} is VALID [2018-11-23 12:30:47,336 INFO L273 TraceCheckUtils]: 94: Hoare triple {24945#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {24945#false} is VALID [2018-11-23 12:30:47,336 INFO L273 TraceCheckUtils]: 95: Hoare triple {24945#false} assume true; {24945#false} is VALID [2018-11-23 12:30:47,336 INFO L268 TraceCheckUtils]: 96: Hoare quadruple {24945#false} {24945#false} #70#return; {24945#false} is VALID [2018-11-23 12:30:47,336 INFO L273 TraceCheckUtils]: 97: Hoare triple {24945#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {24945#false} is VALID [2018-11-23 12:30:47,336 INFO L256 TraceCheckUtils]: 98: Hoare triple {24945#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {24945#false} is VALID [2018-11-23 12:30:47,336 INFO L273 TraceCheckUtils]: 99: Hoare triple {24945#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {24945#false} is VALID [2018-11-23 12:30:47,336 INFO L273 TraceCheckUtils]: 100: Hoare triple {24945#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24945#false} is VALID [2018-11-23 12:30:47,336 INFO L273 TraceCheckUtils]: 101: Hoare triple {24945#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24945#false} is VALID [2018-11-23 12:30:47,337 INFO L273 TraceCheckUtils]: 102: Hoare triple {24945#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24945#false} is VALID [2018-11-23 12:30:47,337 INFO L273 TraceCheckUtils]: 103: Hoare triple {24945#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24945#false} is VALID [2018-11-23 12:30:47,337 INFO L273 TraceCheckUtils]: 104: Hoare triple {24945#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24945#false} is VALID [2018-11-23 12:30:47,337 INFO L273 TraceCheckUtils]: 105: Hoare triple {24945#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24945#false} is VALID [2018-11-23 12:30:47,337 INFO L273 TraceCheckUtils]: 106: Hoare triple {24945#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24945#false} is VALID [2018-11-23 12:30:47,337 INFO L273 TraceCheckUtils]: 107: Hoare triple {24945#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24945#false} is VALID [2018-11-23 12:30:47,337 INFO L273 TraceCheckUtils]: 108: Hoare triple {24945#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24945#false} is VALID [2018-11-23 12:30:47,337 INFO L273 TraceCheckUtils]: 109: Hoare triple {24945#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24945#false} is VALID [2018-11-23 12:30:47,337 INFO L273 TraceCheckUtils]: 110: Hoare triple {24945#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24945#false} is VALID [2018-11-23 12:30:47,337 INFO L273 TraceCheckUtils]: 111: Hoare triple {24945#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24945#false} is VALID [2018-11-23 12:30:47,338 INFO L273 TraceCheckUtils]: 112: Hoare triple {24945#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24945#false} is VALID [2018-11-23 12:30:47,338 INFO L273 TraceCheckUtils]: 113: Hoare triple {24945#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24945#false} is VALID [2018-11-23 12:30:47,338 INFO L273 TraceCheckUtils]: 114: Hoare triple {24945#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24945#false} is VALID [2018-11-23 12:30:47,338 INFO L273 TraceCheckUtils]: 115: Hoare triple {24945#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24945#false} is VALID [2018-11-23 12:30:47,338 INFO L273 TraceCheckUtils]: 116: Hoare triple {24945#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24945#false} is VALID [2018-11-23 12:30:47,338 INFO L273 TraceCheckUtils]: 117: Hoare triple {24945#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24945#false} is VALID [2018-11-23 12:30:47,338 INFO L273 TraceCheckUtils]: 118: Hoare triple {24945#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24945#false} is VALID [2018-11-23 12:30:47,338 INFO L273 TraceCheckUtils]: 119: Hoare triple {24945#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24945#false} is VALID [2018-11-23 12:30:47,338 INFO L273 TraceCheckUtils]: 120: Hoare triple {24945#false} assume !(~i~0 < 100000); {24945#false} is VALID [2018-11-23 12:30:47,338 INFO L273 TraceCheckUtils]: 121: Hoare triple {24945#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {24945#false} is VALID [2018-11-23 12:30:47,339 INFO L273 TraceCheckUtils]: 122: Hoare triple {24945#false} assume true; {24945#false} is VALID [2018-11-23 12:30:47,339 INFO L268 TraceCheckUtils]: 123: Hoare quadruple {24945#false} {24945#false} #72#return; {24945#false} is VALID [2018-11-23 12:30:47,339 INFO L273 TraceCheckUtils]: 124: Hoare triple {24945#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {24945#false} is VALID [2018-11-23 12:30:47,339 INFO L273 TraceCheckUtils]: 125: Hoare triple {24945#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {24945#false} is VALID [2018-11-23 12:30:47,339 INFO L273 TraceCheckUtils]: 126: Hoare triple {24945#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {24945#false} is VALID [2018-11-23 12:30:47,339 INFO L273 TraceCheckUtils]: 127: Hoare triple {24945#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {24945#false} is VALID [2018-11-23 12:30:47,339 INFO L273 TraceCheckUtils]: 128: Hoare triple {24945#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {24945#false} is VALID [2018-11-23 12:30:47,339 INFO L273 TraceCheckUtils]: 129: Hoare triple {24945#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {24945#false} is VALID [2018-11-23 12:30:47,339 INFO L273 TraceCheckUtils]: 130: Hoare triple {24945#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {24945#false} is VALID [2018-11-23 12:30:47,339 INFO L273 TraceCheckUtils]: 131: Hoare triple {24945#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {24945#false} is VALID [2018-11-23 12:30:47,340 INFO L273 TraceCheckUtils]: 132: Hoare triple {24945#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {24945#false} is VALID [2018-11-23 12:30:47,340 INFO L273 TraceCheckUtils]: 133: Hoare triple {24945#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {24945#false} is VALID [2018-11-23 12:30:47,340 INFO L273 TraceCheckUtils]: 134: Hoare triple {24945#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {24945#false} is VALID [2018-11-23 12:30:47,340 INFO L273 TraceCheckUtils]: 135: Hoare triple {24945#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {24945#false} is VALID [2018-11-23 12:30:47,340 INFO L273 TraceCheckUtils]: 136: Hoare triple {24945#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {24945#false} is VALID [2018-11-23 12:30:47,340 INFO L273 TraceCheckUtils]: 137: Hoare triple {24945#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {24945#false} is VALID [2018-11-23 12:30:47,340 INFO L273 TraceCheckUtils]: 138: Hoare triple {24945#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {24945#false} is VALID [2018-11-23 12:30:47,340 INFO L273 TraceCheckUtils]: 139: Hoare triple {24945#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {24945#false} is VALID [2018-11-23 12:30:47,340 INFO L273 TraceCheckUtils]: 140: Hoare triple {24945#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {24945#false} is VALID [2018-11-23 12:30:47,340 INFO L273 TraceCheckUtils]: 141: Hoare triple {24945#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {24945#false} is VALID [2018-11-23 12:30:47,341 INFO L273 TraceCheckUtils]: 142: Hoare triple {24945#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {24945#false} is VALID [2018-11-23 12:30:47,341 INFO L273 TraceCheckUtils]: 143: Hoare triple {24945#false} assume !(~i~2 < 99999); {24945#false} is VALID [2018-11-23 12:30:47,341 INFO L273 TraceCheckUtils]: 144: Hoare triple {24945#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {24945#false} is VALID [2018-11-23 12:30:47,341 INFO L256 TraceCheckUtils]: 145: Hoare triple {24945#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {24945#false} is VALID [2018-11-23 12:30:47,341 INFO L273 TraceCheckUtils]: 146: Hoare triple {24945#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {24945#false} is VALID [2018-11-23 12:30:47,341 INFO L273 TraceCheckUtils]: 147: Hoare triple {24945#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24945#false} is VALID [2018-11-23 12:30:47,341 INFO L273 TraceCheckUtils]: 148: Hoare triple {24945#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24945#false} is VALID [2018-11-23 12:30:47,341 INFO L273 TraceCheckUtils]: 149: Hoare triple {24945#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24945#false} is VALID [2018-11-23 12:30:47,341 INFO L273 TraceCheckUtils]: 150: Hoare triple {24945#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24945#false} is VALID [2018-11-23 12:30:47,342 INFO L273 TraceCheckUtils]: 151: Hoare triple {24945#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24945#false} is VALID [2018-11-23 12:30:47,342 INFO L273 TraceCheckUtils]: 152: Hoare triple {24945#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24945#false} is VALID [2018-11-23 12:30:47,342 INFO L273 TraceCheckUtils]: 153: Hoare triple {24945#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24945#false} is VALID [2018-11-23 12:30:47,342 INFO L273 TraceCheckUtils]: 154: Hoare triple {24945#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24945#false} is VALID [2018-11-23 12:30:47,342 INFO L273 TraceCheckUtils]: 155: Hoare triple {24945#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24945#false} is VALID [2018-11-23 12:30:47,342 INFO L273 TraceCheckUtils]: 156: Hoare triple {24945#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24945#false} is VALID [2018-11-23 12:30:47,342 INFO L273 TraceCheckUtils]: 157: Hoare triple {24945#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24945#false} is VALID [2018-11-23 12:30:47,342 INFO L273 TraceCheckUtils]: 158: Hoare triple {24945#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24945#false} is VALID [2018-11-23 12:30:47,342 INFO L273 TraceCheckUtils]: 159: Hoare triple {24945#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24945#false} is VALID [2018-11-23 12:30:47,342 INFO L273 TraceCheckUtils]: 160: Hoare triple {24945#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24945#false} is VALID [2018-11-23 12:30:47,343 INFO L273 TraceCheckUtils]: 161: Hoare triple {24945#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24945#false} is VALID [2018-11-23 12:30:47,343 INFO L273 TraceCheckUtils]: 162: Hoare triple {24945#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24945#false} is VALID [2018-11-23 12:30:47,343 INFO L273 TraceCheckUtils]: 163: Hoare triple {24945#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24945#false} is VALID [2018-11-23 12:30:47,343 INFO L273 TraceCheckUtils]: 164: Hoare triple {24945#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24945#false} is VALID [2018-11-23 12:30:47,343 INFO L273 TraceCheckUtils]: 165: Hoare triple {24945#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24945#false} is VALID [2018-11-23 12:30:47,343 INFO L273 TraceCheckUtils]: 166: Hoare triple {24945#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24945#false} is VALID [2018-11-23 12:30:47,343 INFO L273 TraceCheckUtils]: 167: Hoare triple {24945#false} assume !(~i~0 < 100000); {24945#false} is VALID [2018-11-23 12:30:47,343 INFO L273 TraceCheckUtils]: 168: Hoare triple {24945#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {24945#false} is VALID [2018-11-23 12:30:47,343 INFO L273 TraceCheckUtils]: 169: Hoare triple {24945#false} assume true; {24945#false} is VALID [2018-11-23 12:30:47,344 INFO L268 TraceCheckUtils]: 170: Hoare quadruple {24945#false} {24945#false} #74#return; {24945#false} is VALID [2018-11-23 12:30:47,344 INFO L273 TraceCheckUtils]: 171: Hoare triple {24945#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {24945#false} is VALID [2018-11-23 12:30:47,344 INFO L273 TraceCheckUtils]: 172: Hoare triple {24945#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {24945#false} is VALID [2018-11-23 12:30:47,344 INFO L273 TraceCheckUtils]: 173: Hoare triple {24945#false} assume !false; {24945#false} is VALID [2018-11-23 12:30:47,358 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2018-11-23 12:30:47,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:30:47,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2018-11-23 12:30:47,378 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 174 [2018-11-23 12:30:47,378 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:30:47,378 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-23 12:30:47,557 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:30:47,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-23 12:30:47,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-23 12:30:47,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 12:30:47,558 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand 36 states. [2018-11-23 12:30:48,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:48,336 INFO L93 Difference]: Finished difference Result 182 states and 190 transitions. [2018-11-23 12:30:48,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 12:30:48,336 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 174 [2018-11-23 12:30:48,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:30:48,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:30:48,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 118 transitions. [2018-11-23 12:30:48,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:30:48,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 118 transitions. [2018-11-23 12:30:48,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 118 transitions. [2018-11-23 12:30:48,454 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:30:48,456 INFO L225 Difference]: With dead ends: 182 [2018-11-23 12:30:48,457 INFO L226 Difference]: Without dead ends: 128 [2018-11-23 12:30:48,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 12:30:48,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-23 12:30:48,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2018-11-23 12:30:48,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:30:48,504 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand 127 states. [2018-11-23 12:30:48,504 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 127 states. [2018-11-23 12:30:48,504 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 127 states. [2018-11-23 12:30:48,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:48,506 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2018-11-23 12:30:48,506 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 132 transitions. [2018-11-23 12:30:48,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:48,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:48,507 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 128 states. [2018-11-23 12:30:48,507 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 128 states. [2018-11-23 12:30:48,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:48,509 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2018-11-23 12:30:48,509 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 132 transitions. [2018-11-23 12:30:48,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:48,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:48,510 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:30:48,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:30:48,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-23 12:30:48,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 131 transitions. [2018-11-23 12:30:48,511 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 131 transitions. Word has length 174 [2018-11-23 12:30:48,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:30:48,512 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 131 transitions. [2018-11-23 12:30:48,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-23 12:30:48,512 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2018-11-23 12:30:48,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-23 12:30:48,512 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:30:48,513 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 30, 30, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:30:48,513 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:30:48,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:30:48,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1616125561, now seen corresponding path program 33 times [2018-11-23 12:30:48,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:30:48,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:30:48,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:48,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:30:48,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:48,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:49,479 INFO L256 TraceCheckUtils]: 0: Hoare triple {26217#true} call ULTIMATE.init(); {26217#true} is VALID [2018-11-23 12:30:49,479 INFO L273 TraceCheckUtils]: 1: Hoare triple {26217#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26217#true} is VALID [2018-11-23 12:30:49,479 INFO L273 TraceCheckUtils]: 2: Hoare triple {26217#true} assume true; {26217#true} is VALID [2018-11-23 12:30:49,479 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26217#true} {26217#true} #66#return; {26217#true} is VALID [2018-11-23 12:30:49,480 INFO L256 TraceCheckUtils]: 4: Hoare triple {26217#true} call #t~ret13 := main(); {26217#true} is VALID [2018-11-23 12:30:49,480 INFO L273 TraceCheckUtils]: 5: Hoare triple {26217#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {26219#(= main_~i~1 0)} is VALID [2018-11-23 12:30:49,481 INFO L273 TraceCheckUtils]: 6: Hoare triple {26219#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26219#(= main_~i~1 0)} is VALID [2018-11-23 12:30:49,481 INFO L273 TraceCheckUtils]: 7: Hoare triple {26219#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26220#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:49,482 INFO L273 TraceCheckUtils]: 8: Hoare triple {26220#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26220#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:49,482 INFO L273 TraceCheckUtils]: 9: Hoare triple {26220#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26221#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:49,483 INFO L273 TraceCheckUtils]: 10: Hoare triple {26221#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26221#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:49,483 INFO L273 TraceCheckUtils]: 11: Hoare triple {26221#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26222#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:49,484 INFO L273 TraceCheckUtils]: 12: Hoare triple {26222#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26222#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:49,484 INFO L273 TraceCheckUtils]: 13: Hoare triple {26222#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26223#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:49,484 INFO L273 TraceCheckUtils]: 14: Hoare triple {26223#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26223#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:49,485 INFO L273 TraceCheckUtils]: 15: Hoare triple {26223#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26224#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:49,486 INFO L273 TraceCheckUtils]: 16: Hoare triple {26224#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26224#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:49,486 INFO L273 TraceCheckUtils]: 17: Hoare triple {26224#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26225#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:49,487 INFO L273 TraceCheckUtils]: 18: Hoare triple {26225#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26225#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:49,488 INFO L273 TraceCheckUtils]: 19: Hoare triple {26225#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26226#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:49,488 INFO L273 TraceCheckUtils]: 20: Hoare triple {26226#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26226#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:49,489 INFO L273 TraceCheckUtils]: 21: Hoare triple {26226#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26227#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:49,489 INFO L273 TraceCheckUtils]: 22: Hoare triple {26227#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26227#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:49,490 INFO L273 TraceCheckUtils]: 23: Hoare triple {26227#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26228#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:49,491 INFO L273 TraceCheckUtils]: 24: Hoare triple {26228#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26228#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:49,491 INFO L273 TraceCheckUtils]: 25: Hoare triple {26228#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26229#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:49,492 INFO L273 TraceCheckUtils]: 26: Hoare triple {26229#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26229#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:49,492 INFO L273 TraceCheckUtils]: 27: Hoare triple {26229#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26230#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:49,493 INFO L273 TraceCheckUtils]: 28: Hoare triple {26230#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26230#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:49,494 INFO L273 TraceCheckUtils]: 29: Hoare triple {26230#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26231#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:49,494 INFO L273 TraceCheckUtils]: 30: Hoare triple {26231#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26231#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:49,495 INFO L273 TraceCheckUtils]: 31: Hoare triple {26231#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26232#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:49,495 INFO L273 TraceCheckUtils]: 32: Hoare triple {26232#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26232#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:49,496 INFO L273 TraceCheckUtils]: 33: Hoare triple {26232#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26233#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:49,497 INFO L273 TraceCheckUtils]: 34: Hoare triple {26233#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26233#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:49,497 INFO L273 TraceCheckUtils]: 35: Hoare triple {26233#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26234#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:49,498 INFO L273 TraceCheckUtils]: 36: Hoare triple {26234#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26234#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:49,499 INFO L273 TraceCheckUtils]: 37: Hoare triple {26234#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26235#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:49,499 INFO L273 TraceCheckUtils]: 38: Hoare triple {26235#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26235#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:49,500 INFO L273 TraceCheckUtils]: 39: Hoare triple {26235#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26236#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:49,500 INFO L273 TraceCheckUtils]: 40: Hoare triple {26236#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26236#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:49,501 INFO L273 TraceCheckUtils]: 41: Hoare triple {26236#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26237#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:49,502 INFO L273 TraceCheckUtils]: 42: Hoare triple {26237#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26237#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:49,502 INFO L273 TraceCheckUtils]: 43: Hoare triple {26237#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26238#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:49,503 INFO L273 TraceCheckUtils]: 44: Hoare triple {26238#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26238#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:49,504 INFO L273 TraceCheckUtils]: 45: Hoare triple {26238#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26239#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:49,504 INFO L273 TraceCheckUtils]: 46: Hoare triple {26239#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26239#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:49,505 INFO L273 TraceCheckUtils]: 47: Hoare triple {26239#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26240#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:49,505 INFO L273 TraceCheckUtils]: 48: Hoare triple {26240#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26240#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:49,506 INFO L273 TraceCheckUtils]: 49: Hoare triple {26240#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:49,507 INFO L273 TraceCheckUtils]: 50: Hoare triple {26241#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:49,507 INFO L273 TraceCheckUtils]: 51: Hoare triple {26241#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26242#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:49,508 INFO L273 TraceCheckUtils]: 52: Hoare triple {26242#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26242#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:49,509 INFO L273 TraceCheckUtils]: 53: Hoare triple {26242#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26243#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:49,509 INFO L273 TraceCheckUtils]: 54: Hoare triple {26243#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26243#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:49,510 INFO L273 TraceCheckUtils]: 55: Hoare triple {26243#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26244#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:49,510 INFO L273 TraceCheckUtils]: 56: Hoare triple {26244#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26244#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:49,511 INFO L273 TraceCheckUtils]: 57: Hoare triple {26244#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26245#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:49,512 INFO L273 TraceCheckUtils]: 58: Hoare triple {26245#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26245#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:49,512 INFO L273 TraceCheckUtils]: 59: Hoare triple {26245#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26246#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:49,513 INFO L273 TraceCheckUtils]: 60: Hoare triple {26246#(<= main_~i~1 27)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26246#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:49,514 INFO L273 TraceCheckUtils]: 61: Hoare triple {26246#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26247#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:49,514 INFO L273 TraceCheckUtils]: 62: Hoare triple {26247#(<= main_~i~1 28)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26247#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:49,515 INFO L273 TraceCheckUtils]: 63: Hoare triple {26247#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26248#(<= main_~i~1 29)} is VALID [2018-11-23 12:30:49,515 INFO L273 TraceCheckUtils]: 64: Hoare triple {26248#(<= main_~i~1 29)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26248#(<= main_~i~1 29)} is VALID [2018-11-23 12:30:49,516 INFO L273 TraceCheckUtils]: 65: Hoare triple {26248#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26249#(<= main_~i~1 30)} is VALID [2018-11-23 12:30:49,516 INFO L273 TraceCheckUtils]: 66: Hoare triple {26249#(<= main_~i~1 30)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26249#(<= main_~i~1 30)} is VALID [2018-11-23 12:30:49,517 INFO L273 TraceCheckUtils]: 67: Hoare triple {26249#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26250#(<= main_~i~1 31)} is VALID [2018-11-23 12:30:49,518 INFO L273 TraceCheckUtils]: 68: Hoare triple {26250#(<= main_~i~1 31)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26250#(<= main_~i~1 31)} is VALID [2018-11-23 12:30:49,518 INFO L273 TraceCheckUtils]: 69: Hoare triple {26250#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26251#(<= main_~i~1 32)} is VALID [2018-11-23 12:30:49,519 INFO L273 TraceCheckUtils]: 70: Hoare triple {26251#(<= main_~i~1 32)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26251#(<= main_~i~1 32)} is VALID [2018-11-23 12:30:49,520 INFO L273 TraceCheckUtils]: 71: Hoare triple {26251#(<= main_~i~1 32)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26252#(<= main_~i~1 33)} is VALID [2018-11-23 12:30:49,520 INFO L273 TraceCheckUtils]: 72: Hoare triple {26252#(<= main_~i~1 33)} assume !(~i~1 < 100000); {26218#false} is VALID [2018-11-23 12:30:49,521 INFO L256 TraceCheckUtils]: 73: Hoare triple {26218#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {26217#true} is VALID [2018-11-23 12:30:49,521 INFO L273 TraceCheckUtils]: 74: Hoare triple {26217#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {26217#true} is VALID [2018-11-23 12:30:49,521 INFO L273 TraceCheckUtils]: 75: Hoare triple {26217#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26217#true} is VALID [2018-11-23 12:30:49,521 INFO L273 TraceCheckUtils]: 76: Hoare triple {26217#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26217#true} is VALID [2018-11-23 12:30:49,521 INFO L273 TraceCheckUtils]: 77: Hoare triple {26217#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26217#true} is VALID [2018-11-23 12:30:49,522 INFO L273 TraceCheckUtils]: 78: Hoare triple {26217#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26217#true} is VALID [2018-11-23 12:30:49,522 INFO L273 TraceCheckUtils]: 79: Hoare triple {26217#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26217#true} is VALID [2018-11-23 12:30:49,522 INFO L273 TraceCheckUtils]: 80: Hoare triple {26217#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26217#true} is VALID [2018-11-23 12:30:49,522 INFO L273 TraceCheckUtils]: 81: Hoare triple {26217#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26217#true} is VALID [2018-11-23 12:30:49,522 INFO L273 TraceCheckUtils]: 82: Hoare triple {26217#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26217#true} is VALID [2018-11-23 12:30:49,522 INFO L273 TraceCheckUtils]: 83: Hoare triple {26217#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26217#true} is VALID [2018-11-23 12:30:49,523 INFO L273 TraceCheckUtils]: 84: Hoare triple {26217#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26217#true} is VALID [2018-11-23 12:30:49,523 INFO L273 TraceCheckUtils]: 85: Hoare triple {26217#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26217#true} is VALID [2018-11-23 12:30:49,523 INFO L273 TraceCheckUtils]: 86: Hoare triple {26217#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26217#true} is VALID [2018-11-23 12:30:49,523 INFO L273 TraceCheckUtils]: 87: Hoare triple {26217#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26217#true} is VALID [2018-11-23 12:30:49,523 INFO L273 TraceCheckUtils]: 88: Hoare triple {26217#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26217#true} is VALID [2018-11-23 12:30:49,523 INFO L273 TraceCheckUtils]: 89: Hoare triple {26217#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26217#true} is VALID [2018-11-23 12:30:49,524 INFO L273 TraceCheckUtils]: 90: Hoare triple {26217#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26217#true} is VALID [2018-11-23 12:30:49,524 INFO L273 TraceCheckUtils]: 91: Hoare triple {26217#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26217#true} is VALID [2018-11-23 12:30:49,524 INFO L273 TraceCheckUtils]: 92: Hoare triple {26217#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26217#true} is VALID [2018-11-23 12:30:49,524 INFO L273 TraceCheckUtils]: 93: Hoare triple {26217#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26217#true} is VALID [2018-11-23 12:30:49,524 INFO L273 TraceCheckUtils]: 94: Hoare triple {26217#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26217#true} is VALID [2018-11-23 12:30:49,524 INFO L273 TraceCheckUtils]: 95: Hoare triple {26217#true} assume !(~i~0 < 100000); {26217#true} is VALID [2018-11-23 12:30:49,524 INFO L273 TraceCheckUtils]: 96: Hoare triple {26217#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {26217#true} is VALID [2018-11-23 12:30:49,525 INFO L273 TraceCheckUtils]: 97: Hoare triple {26217#true} assume true; {26217#true} is VALID [2018-11-23 12:30:49,525 INFO L268 TraceCheckUtils]: 98: Hoare quadruple {26217#true} {26218#false} #70#return; {26218#false} is VALID [2018-11-23 12:30:49,525 INFO L273 TraceCheckUtils]: 99: Hoare triple {26218#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {26218#false} is VALID [2018-11-23 12:30:49,525 INFO L256 TraceCheckUtils]: 100: Hoare triple {26218#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {26217#true} is VALID [2018-11-23 12:30:49,525 INFO L273 TraceCheckUtils]: 101: Hoare triple {26217#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {26217#true} is VALID [2018-11-23 12:30:49,525 INFO L273 TraceCheckUtils]: 102: Hoare triple {26217#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26217#true} is VALID [2018-11-23 12:30:49,525 INFO L273 TraceCheckUtils]: 103: Hoare triple {26217#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26217#true} is VALID [2018-11-23 12:30:49,525 INFO L273 TraceCheckUtils]: 104: Hoare triple {26217#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26217#true} is VALID [2018-11-23 12:30:49,525 INFO L273 TraceCheckUtils]: 105: Hoare triple {26217#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26217#true} is VALID [2018-11-23 12:30:49,525 INFO L273 TraceCheckUtils]: 106: Hoare triple {26217#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26217#true} is VALID [2018-11-23 12:30:49,526 INFO L273 TraceCheckUtils]: 107: Hoare triple {26217#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26217#true} is VALID [2018-11-23 12:30:49,526 INFO L273 TraceCheckUtils]: 108: Hoare triple {26217#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26217#true} is VALID [2018-11-23 12:30:49,526 INFO L273 TraceCheckUtils]: 109: Hoare triple {26217#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26217#true} is VALID [2018-11-23 12:30:49,526 INFO L273 TraceCheckUtils]: 110: Hoare triple {26217#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26217#true} is VALID [2018-11-23 12:30:49,526 INFO L273 TraceCheckUtils]: 111: Hoare triple {26217#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26217#true} is VALID [2018-11-23 12:30:49,526 INFO L273 TraceCheckUtils]: 112: Hoare triple {26217#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26217#true} is VALID [2018-11-23 12:30:49,526 INFO L273 TraceCheckUtils]: 113: Hoare triple {26217#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26217#true} is VALID [2018-11-23 12:30:49,526 INFO L273 TraceCheckUtils]: 114: Hoare triple {26217#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26217#true} is VALID [2018-11-23 12:30:49,526 INFO L273 TraceCheckUtils]: 115: Hoare triple {26217#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26217#true} is VALID [2018-11-23 12:30:49,526 INFO L273 TraceCheckUtils]: 116: Hoare triple {26217#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26217#true} is VALID [2018-11-23 12:30:49,527 INFO L273 TraceCheckUtils]: 117: Hoare triple {26217#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26217#true} is VALID [2018-11-23 12:30:49,527 INFO L273 TraceCheckUtils]: 118: Hoare triple {26217#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26217#true} is VALID [2018-11-23 12:30:49,527 INFO L273 TraceCheckUtils]: 119: Hoare triple {26217#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26217#true} is VALID [2018-11-23 12:30:49,527 INFO L273 TraceCheckUtils]: 120: Hoare triple {26217#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26217#true} is VALID [2018-11-23 12:30:49,527 INFO L273 TraceCheckUtils]: 121: Hoare triple {26217#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26217#true} is VALID [2018-11-23 12:30:49,527 INFO L273 TraceCheckUtils]: 122: Hoare triple {26217#true} assume !(~i~0 < 100000); {26217#true} is VALID [2018-11-23 12:30:49,527 INFO L273 TraceCheckUtils]: 123: Hoare triple {26217#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {26217#true} is VALID [2018-11-23 12:30:49,527 INFO L273 TraceCheckUtils]: 124: Hoare triple {26217#true} assume true; {26217#true} is VALID [2018-11-23 12:30:49,527 INFO L268 TraceCheckUtils]: 125: Hoare quadruple {26217#true} {26218#false} #72#return; {26218#false} is VALID [2018-11-23 12:30:49,528 INFO L273 TraceCheckUtils]: 126: Hoare triple {26218#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {26218#false} is VALID [2018-11-23 12:30:49,528 INFO L273 TraceCheckUtils]: 127: Hoare triple {26218#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26218#false} is VALID [2018-11-23 12:30:49,528 INFO L273 TraceCheckUtils]: 128: Hoare triple {26218#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26218#false} is VALID [2018-11-23 12:30:49,528 INFO L273 TraceCheckUtils]: 129: Hoare triple {26218#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26218#false} is VALID [2018-11-23 12:30:49,528 INFO L273 TraceCheckUtils]: 130: Hoare triple {26218#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26218#false} is VALID [2018-11-23 12:30:49,528 INFO L273 TraceCheckUtils]: 131: Hoare triple {26218#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26218#false} is VALID [2018-11-23 12:30:49,528 INFO L273 TraceCheckUtils]: 132: Hoare triple {26218#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26218#false} is VALID [2018-11-23 12:30:49,528 INFO L273 TraceCheckUtils]: 133: Hoare triple {26218#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26218#false} is VALID [2018-11-23 12:30:49,528 INFO L273 TraceCheckUtils]: 134: Hoare triple {26218#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26218#false} is VALID [2018-11-23 12:30:49,528 INFO L273 TraceCheckUtils]: 135: Hoare triple {26218#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26218#false} is VALID [2018-11-23 12:30:49,529 INFO L273 TraceCheckUtils]: 136: Hoare triple {26218#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26218#false} is VALID [2018-11-23 12:30:49,529 INFO L273 TraceCheckUtils]: 137: Hoare triple {26218#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26218#false} is VALID [2018-11-23 12:30:49,529 INFO L273 TraceCheckUtils]: 138: Hoare triple {26218#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26218#false} is VALID [2018-11-23 12:30:49,529 INFO L273 TraceCheckUtils]: 139: Hoare triple {26218#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26218#false} is VALID [2018-11-23 12:30:49,529 INFO L273 TraceCheckUtils]: 140: Hoare triple {26218#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26218#false} is VALID [2018-11-23 12:30:49,529 INFO L273 TraceCheckUtils]: 141: Hoare triple {26218#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26218#false} is VALID [2018-11-23 12:30:49,529 INFO L273 TraceCheckUtils]: 142: Hoare triple {26218#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26218#false} is VALID [2018-11-23 12:30:49,529 INFO L273 TraceCheckUtils]: 143: Hoare triple {26218#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26218#false} is VALID [2018-11-23 12:30:49,529 INFO L273 TraceCheckUtils]: 144: Hoare triple {26218#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26218#false} is VALID [2018-11-23 12:30:49,529 INFO L273 TraceCheckUtils]: 145: Hoare triple {26218#false} assume !(~i~2 < 99999); {26218#false} is VALID [2018-11-23 12:30:49,530 INFO L273 TraceCheckUtils]: 146: Hoare triple {26218#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {26218#false} is VALID [2018-11-23 12:30:49,530 INFO L256 TraceCheckUtils]: 147: Hoare triple {26218#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {26217#true} is VALID [2018-11-23 12:30:49,530 INFO L273 TraceCheckUtils]: 148: Hoare triple {26217#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {26217#true} is VALID [2018-11-23 12:30:49,530 INFO L273 TraceCheckUtils]: 149: Hoare triple {26217#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26217#true} is VALID [2018-11-23 12:30:49,530 INFO L273 TraceCheckUtils]: 150: Hoare triple {26217#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26217#true} is VALID [2018-11-23 12:30:49,530 INFO L273 TraceCheckUtils]: 151: Hoare triple {26217#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26217#true} is VALID [2018-11-23 12:30:49,530 INFO L273 TraceCheckUtils]: 152: Hoare triple {26217#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26217#true} is VALID [2018-11-23 12:30:49,530 INFO L273 TraceCheckUtils]: 153: Hoare triple {26217#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26217#true} is VALID [2018-11-23 12:30:49,530 INFO L273 TraceCheckUtils]: 154: Hoare triple {26217#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26217#true} is VALID [2018-11-23 12:30:49,530 INFO L273 TraceCheckUtils]: 155: Hoare triple {26217#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26217#true} is VALID [2018-11-23 12:30:49,531 INFO L273 TraceCheckUtils]: 156: Hoare triple {26217#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26217#true} is VALID [2018-11-23 12:30:49,531 INFO L273 TraceCheckUtils]: 157: Hoare triple {26217#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26217#true} is VALID [2018-11-23 12:30:49,531 INFO L273 TraceCheckUtils]: 158: Hoare triple {26217#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26217#true} is VALID [2018-11-23 12:30:49,531 INFO L273 TraceCheckUtils]: 159: Hoare triple {26217#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26217#true} is VALID [2018-11-23 12:30:49,531 INFO L273 TraceCheckUtils]: 160: Hoare triple {26217#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26217#true} is VALID [2018-11-23 12:30:49,531 INFO L273 TraceCheckUtils]: 161: Hoare triple {26217#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26217#true} is VALID [2018-11-23 12:30:49,531 INFO L273 TraceCheckUtils]: 162: Hoare triple {26217#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26217#true} is VALID [2018-11-23 12:30:49,531 INFO L273 TraceCheckUtils]: 163: Hoare triple {26217#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26217#true} is VALID [2018-11-23 12:30:49,531 INFO L273 TraceCheckUtils]: 164: Hoare triple {26217#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26217#true} is VALID [2018-11-23 12:30:49,531 INFO L273 TraceCheckUtils]: 165: Hoare triple {26217#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26217#true} is VALID [2018-11-23 12:30:49,532 INFO L273 TraceCheckUtils]: 166: Hoare triple {26217#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26217#true} is VALID [2018-11-23 12:30:49,532 INFO L273 TraceCheckUtils]: 167: Hoare triple {26217#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26217#true} is VALID [2018-11-23 12:30:49,532 INFO L273 TraceCheckUtils]: 168: Hoare triple {26217#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26217#true} is VALID [2018-11-23 12:30:49,532 INFO L273 TraceCheckUtils]: 169: Hoare triple {26217#true} assume !(~i~0 < 100000); {26217#true} is VALID [2018-11-23 12:30:49,532 INFO L273 TraceCheckUtils]: 170: Hoare triple {26217#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {26217#true} is VALID [2018-11-23 12:30:49,532 INFO L273 TraceCheckUtils]: 171: Hoare triple {26217#true} assume true; {26217#true} is VALID [2018-11-23 12:30:49,532 INFO L268 TraceCheckUtils]: 172: Hoare quadruple {26217#true} {26218#false} #74#return; {26218#false} is VALID [2018-11-23 12:30:49,532 INFO L273 TraceCheckUtils]: 173: Hoare triple {26218#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {26218#false} is VALID [2018-11-23 12:30:49,532 INFO L273 TraceCheckUtils]: 174: Hoare triple {26218#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {26218#false} is VALID [2018-11-23 12:30:49,533 INFO L273 TraceCheckUtils]: 175: Hoare triple {26218#false} assume !false; {26218#false} is VALID [2018-11-23 12:30:49,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2018-11-23 12:30:49,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:30:49,571 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 12:30:49,579 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:30:50,095 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-23 12:30:50,096 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:30:50,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:50,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:30:50,648 INFO L256 TraceCheckUtils]: 0: Hoare triple {26217#true} call ULTIMATE.init(); {26217#true} is VALID [2018-11-23 12:30:50,648 INFO L273 TraceCheckUtils]: 1: Hoare triple {26217#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26217#true} is VALID [2018-11-23 12:30:50,648 INFO L273 TraceCheckUtils]: 2: Hoare triple {26217#true} assume true; {26217#true} is VALID [2018-11-23 12:30:50,648 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26217#true} {26217#true} #66#return; {26217#true} is VALID [2018-11-23 12:30:50,649 INFO L256 TraceCheckUtils]: 4: Hoare triple {26217#true} call #t~ret13 := main(); {26217#true} is VALID [2018-11-23 12:30:50,649 INFO L273 TraceCheckUtils]: 5: Hoare triple {26217#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {26217#true} is VALID [2018-11-23 12:30:50,649 INFO L273 TraceCheckUtils]: 6: Hoare triple {26217#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26217#true} is VALID [2018-11-23 12:30:50,649 INFO L273 TraceCheckUtils]: 7: Hoare triple {26217#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26217#true} is VALID [2018-11-23 12:30:50,649 INFO L273 TraceCheckUtils]: 8: Hoare triple {26217#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26217#true} is VALID [2018-11-23 12:30:50,649 INFO L273 TraceCheckUtils]: 9: Hoare triple {26217#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26217#true} is VALID [2018-11-23 12:30:50,649 INFO L273 TraceCheckUtils]: 10: Hoare triple {26217#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26217#true} is VALID [2018-11-23 12:30:50,650 INFO L273 TraceCheckUtils]: 11: Hoare triple {26217#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26217#true} is VALID [2018-11-23 12:30:50,650 INFO L273 TraceCheckUtils]: 12: Hoare triple {26217#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26217#true} is VALID [2018-11-23 12:30:50,650 INFO L273 TraceCheckUtils]: 13: Hoare triple {26217#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26217#true} is VALID [2018-11-23 12:30:50,650 INFO L273 TraceCheckUtils]: 14: Hoare triple {26217#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26217#true} is VALID [2018-11-23 12:30:50,650 INFO L273 TraceCheckUtils]: 15: Hoare triple {26217#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26217#true} is VALID [2018-11-23 12:30:50,650 INFO L273 TraceCheckUtils]: 16: Hoare triple {26217#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26217#true} is VALID [2018-11-23 12:30:50,650 INFO L273 TraceCheckUtils]: 17: Hoare triple {26217#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26217#true} is VALID [2018-11-23 12:30:50,650 INFO L273 TraceCheckUtils]: 18: Hoare triple {26217#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26217#true} is VALID [2018-11-23 12:30:50,650 INFO L273 TraceCheckUtils]: 19: Hoare triple {26217#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26217#true} is VALID [2018-11-23 12:30:50,650 INFO L273 TraceCheckUtils]: 20: Hoare triple {26217#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26217#true} is VALID [2018-11-23 12:30:50,651 INFO L273 TraceCheckUtils]: 21: Hoare triple {26217#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26217#true} is VALID [2018-11-23 12:30:50,651 INFO L273 TraceCheckUtils]: 22: Hoare triple {26217#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26217#true} is VALID [2018-11-23 12:30:50,651 INFO L273 TraceCheckUtils]: 23: Hoare triple {26217#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26217#true} is VALID [2018-11-23 12:30:50,651 INFO L273 TraceCheckUtils]: 24: Hoare triple {26217#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26217#true} is VALID [2018-11-23 12:30:50,651 INFO L273 TraceCheckUtils]: 25: Hoare triple {26217#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26217#true} is VALID [2018-11-23 12:30:50,651 INFO L273 TraceCheckUtils]: 26: Hoare triple {26217#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26217#true} is VALID [2018-11-23 12:30:50,651 INFO L273 TraceCheckUtils]: 27: Hoare triple {26217#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26217#true} is VALID [2018-11-23 12:30:50,651 INFO L273 TraceCheckUtils]: 28: Hoare triple {26217#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26217#true} is VALID [2018-11-23 12:30:50,651 INFO L273 TraceCheckUtils]: 29: Hoare triple {26217#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26217#true} is VALID [2018-11-23 12:30:50,651 INFO L273 TraceCheckUtils]: 30: Hoare triple {26217#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26217#true} is VALID [2018-11-23 12:30:50,652 INFO L273 TraceCheckUtils]: 31: Hoare triple {26217#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26217#true} is VALID [2018-11-23 12:30:50,652 INFO L273 TraceCheckUtils]: 32: Hoare triple {26217#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26217#true} is VALID [2018-11-23 12:30:50,652 INFO L273 TraceCheckUtils]: 33: Hoare triple {26217#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26217#true} is VALID [2018-11-23 12:30:50,652 INFO L273 TraceCheckUtils]: 34: Hoare triple {26217#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26217#true} is VALID [2018-11-23 12:30:50,652 INFO L273 TraceCheckUtils]: 35: Hoare triple {26217#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26217#true} is VALID [2018-11-23 12:30:50,652 INFO L273 TraceCheckUtils]: 36: Hoare triple {26217#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26217#true} is VALID [2018-11-23 12:30:50,652 INFO L273 TraceCheckUtils]: 37: Hoare triple {26217#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26217#true} is VALID [2018-11-23 12:30:50,652 INFO L273 TraceCheckUtils]: 38: Hoare triple {26217#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26217#true} is VALID [2018-11-23 12:30:50,652 INFO L273 TraceCheckUtils]: 39: Hoare triple {26217#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26217#true} is VALID [2018-11-23 12:30:50,653 INFO L273 TraceCheckUtils]: 40: Hoare triple {26217#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26217#true} is VALID [2018-11-23 12:30:50,653 INFO L273 TraceCheckUtils]: 41: Hoare triple {26217#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26217#true} is VALID [2018-11-23 12:30:50,653 INFO L273 TraceCheckUtils]: 42: Hoare triple {26217#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26217#true} is VALID [2018-11-23 12:30:50,653 INFO L273 TraceCheckUtils]: 43: Hoare triple {26217#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26217#true} is VALID [2018-11-23 12:30:50,653 INFO L273 TraceCheckUtils]: 44: Hoare triple {26217#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26217#true} is VALID [2018-11-23 12:30:50,653 INFO L273 TraceCheckUtils]: 45: Hoare triple {26217#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26217#true} is VALID [2018-11-23 12:30:50,653 INFO L273 TraceCheckUtils]: 46: Hoare triple {26217#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26217#true} is VALID [2018-11-23 12:30:50,653 INFO L273 TraceCheckUtils]: 47: Hoare triple {26217#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26217#true} is VALID [2018-11-23 12:30:50,653 INFO L273 TraceCheckUtils]: 48: Hoare triple {26217#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26217#true} is VALID [2018-11-23 12:30:50,653 INFO L273 TraceCheckUtils]: 49: Hoare triple {26217#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26217#true} is VALID [2018-11-23 12:30:50,654 INFO L273 TraceCheckUtils]: 50: Hoare triple {26217#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26217#true} is VALID [2018-11-23 12:30:50,654 INFO L273 TraceCheckUtils]: 51: Hoare triple {26217#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26217#true} is VALID [2018-11-23 12:30:50,654 INFO L273 TraceCheckUtils]: 52: Hoare triple {26217#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26217#true} is VALID [2018-11-23 12:30:50,654 INFO L273 TraceCheckUtils]: 53: Hoare triple {26217#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26217#true} is VALID [2018-11-23 12:30:50,654 INFO L273 TraceCheckUtils]: 54: Hoare triple {26217#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26217#true} is VALID [2018-11-23 12:30:50,654 INFO L273 TraceCheckUtils]: 55: Hoare triple {26217#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26217#true} is VALID [2018-11-23 12:30:50,654 INFO L273 TraceCheckUtils]: 56: Hoare triple {26217#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26217#true} is VALID [2018-11-23 12:30:50,654 INFO L273 TraceCheckUtils]: 57: Hoare triple {26217#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26217#true} is VALID [2018-11-23 12:30:50,654 INFO L273 TraceCheckUtils]: 58: Hoare triple {26217#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26217#true} is VALID [2018-11-23 12:30:50,654 INFO L273 TraceCheckUtils]: 59: Hoare triple {26217#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26217#true} is VALID [2018-11-23 12:30:50,655 INFO L273 TraceCheckUtils]: 60: Hoare triple {26217#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26217#true} is VALID [2018-11-23 12:30:50,655 INFO L273 TraceCheckUtils]: 61: Hoare triple {26217#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26217#true} is VALID [2018-11-23 12:30:50,655 INFO L273 TraceCheckUtils]: 62: Hoare triple {26217#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26217#true} is VALID [2018-11-23 12:30:50,655 INFO L273 TraceCheckUtils]: 63: Hoare triple {26217#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26217#true} is VALID [2018-11-23 12:30:50,655 INFO L273 TraceCheckUtils]: 64: Hoare triple {26217#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26217#true} is VALID [2018-11-23 12:30:50,655 INFO L273 TraceCheckUtils]: 65: Hoare triple {26217#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26217#true} is VALID [2018-11-23 12:30:50,655 INFO L273 TraceCheckUtils]: 66: Hoare triple {26217#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26217#true} is VALID [2018-11-23 12:30:50,655 INFO L273 TraceCheckUtils]: 67: Hoare triple {26217#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26217#true} is VALID [2018-11-23 12:30:50,655 INFO L273 TraceCheckUtils]: 68: Hoare triple {26217#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26217#true} is VALID [2018-11-23 12:30:50,655 INFO L273 TraceCheckUtils]: 69: Hoare triple {26217#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26217#true} is VALID [2018-11-23 12:30:50,656 INFO L273 TraceCheckUtils]: 70: Hoare triple {26217#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26217#true} is VALID [2018-11-23 12:30:50,656 INFO L273 TraceCheckUtils]: 71: Hoare triple {26217#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26217#true} is VALID [2018-11-23 12:30:50,656 INFO L273 TraceCheckUtils]: 72: Hoare triple {26217#true} assume !(~i~1 < 100000); {26217#true} is VALID [2018-11-23 12:30:50,656 INFO L256 TraceCheckUtils]: 73: Hoare triple {26217#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {26217#true} is VALID [2018-11-23 12:30:50,656 INFO L273 TraceCheckUtils]: 74: Hoare triple {26217#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {26217#true} is VALID [2018-11-23 12:30:50,656 INFO L273 TraceCheckUtils]: 75: Hoare triple {26217#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26217#true} is VALID [2018-11-23 12:30:50,656 INFO L273 TraceCheckUtils]: 76: Hoare triple {26217#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26217#true} is VALID [2018-11-23 12:30:50,656 INFO L273 TraceCheckUtils]: 77: Hoare triple {26217#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26217#true} is VALID [2018-11-23 12:30:50,656 INFO L273 TraceCheckUtils]: 78: Hoare triple {26217#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26217#true} is VALID [2018-11-23 12:30:50,656 INFO L273 TraceCheckUtils]: 79: Hoare triple {26217#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26217#true} is VALID [2018-11-23 12:30:50,657 INFO L273 TraceCheckUtils]: 80: Hoare triple {26217#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26217#true} is VALID [2018-11-23 12:30:50,657 INFO L273 TraceCheckUtils]: 81: Hoare triple {26217#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26217#true} is VALID [2018-11-23 12:30:50,657 INFO L273 TraceCheckUtils]: 82: Hoare triple {26217#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26217#true} is VALID [2018-11-23 12:30:50,657 INFO L273 TraceCheckUtils]: 83: Hoare triple {26217#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26217#true} is VALID [2018-11-23 12:30:50,657 INFO L273 TraceCheckUtils]: 84: Hoare triple {26217#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26217#true} is VALID [2018-11-23 12:30:50,657 INFO L273 TraceCheckUtils]: 85: Hoare triple {26217#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26217#true} is VALID [2018-11-23 12:30:50,657 INFO L273 TraceCheckUtils]: 86: Hoare triple {26217#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26217#true} is VALID [2018-11-23 12:30:50,657 INFO L273 TraceCheckUtils]: 87: Hoare triple {26217#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26217#true} is VALID [2018-11-23 12:30:50,657 INFO L273 TraceCheckUtils]: 88: Hoare triple {26217#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26217#true} is VALID [2018-11-23 12:30:50,657 INFO L273 TraceCheckUtils]: 89: Hoare triple {26217#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26217#true} is VALID [2018-11-23 12:30:50,658 INFO L273 TraceCheckUtils]: 90: Hoare triple {26217#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26217#true} is VALID [2018-11-23 12:30:50,658 INFO L273 TraceCheckUtils]: 91: Hoare triple {26217#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26217#true} is VALID [2018-11-23 12:30:50,658 INFO L273 TraceCheckUtils]: 92: Hoare triple {26217#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26217#true} is VALID [2018-11-23 12:30:50,658 INFO L273 TraceCheckUtils]: 93: Hoare triple {26217#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26217#true} is VALID [2018-11-23 12:30:50,658 INFO L273 TraceCheckUtils]: 94: Hoare triple {26217#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26217#true} is VALID [2018-11-23 12:30:50,658 INFO L273 TraceCheckUtils]: 95: Hoare triple {26217#true} assume !(~i~0 < 100000); {26217#true} is VALID [2018-11-23 12:30:50,658 INFO L273 TraceCheckUtils]: 96: Hoare triple {26217#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {26217#true} is VALID [2018-11-23 12:30:50,658 INFO L273 TraceCheckUtils]: 97: Hoare triple {26217#true} assume true; {26217#true} is VALID [2018-11-23 12:30:50,658 INFO L268 TraceCheckUtils]: 98: Hoare quadruple {26217#true} {26217#true} #70#return; {26217#true} is VALID [2018-11-23 12:30:50,659 INFO L273 TraceCheckUtils]: 99: Hoare triple {26217#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {26217#true} is VALID [2018-11-23 12:30:50,659 INFO L256 TraceCheckUtils]: 100: Hoare triple {26217#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {26217#true} is VALID [2018-11-23 12:30:50,659 INFO L273 TraceCheckUtils]: 101: Hoare triple {26217#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {26217#true} is VALID [2018-11-23 12:30:50,659 INFO L273 TraceCheckUtils]: 102: Hoare triple {26217#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26217#true} is VALID [2018-11-23 12:30:50,659 INFO L273 TraceCheckUtils]: 103: Hoare triple {26217#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26217#true} is VALID [2018-11-23 12:30:50,659 INFO L273 TraceCheckUtils]: 104: Hoare triple {26217#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26217#true} is VALID [2018-11-23 12:30:50,659 INFO L273 TraceCheckUtils]: 105: Hoare triple {26217#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26217#true} is VALID [2018-11-23 12:30:50,659 INFO L273 TraceCheckUtils]: 106: Hoare triple {26217#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26217#true} is VALID [2018-11-23 12:30:50,659 INFO L273 TraceCheckUtils]: 107: Hoare triple {26217#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26217#true} is VALID [2018-11-23 12:30:50,659 INFO L273 TraceCheckUtils]: 108: Hoare triple {26217#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26217#true} is VALID [2018-11-23 12:30:50,660 INFO L273 TraceCheckUtils]: 109: Hoare triple {26217#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26217#true} is VALID [2018-11-23 12:30:50,660 INFO L273 TraceCheckUtils]: 110: Hoare triple {26217#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26217#true} is VALID [2018-11-23 12:30:50,660 INFO L273 TraceCheckUtils]: 111: Hoare triple {26217#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26217#true} is VALID [2018-11-23 12:30:50,660 INFO L273 TraceCheckUtils]: 112: Hoare triple {26217#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26217#true} is VALID [2018-11-23 12:30:50,660 INFO L273 TraceCheckUtils]: 113: Hoare triple {26217#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26217#true} is VALID [2018-11-23 12:30:50,660 INFO L273 TraceCheckUtils]: 114: Hoare triple {26217#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26217#true} is VALID [2018-11-23 12:30:50,660 INFO L273 TraceCheckUtils]: 115: Hoare triple {26217#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26217#true} is VALID [2018-11-23 12:30:50,660 INFO L273 TraceCheckUtils]: 116: Hoare triple {26217#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26217#true} is VALID [2018-11-23 12:30:50,660 INFO L273 TraceCheckUtils]: 117: Hoare triple {26217#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26217#true} is VALID [2018-11-23 12:30:50,660 INFO L273 TraceCheckUtils]: 118: Hoare triple {26217#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26217#true} is VALID [2018-11-23 12:30:50,661 INFO L273 TraceCheckUtils]: 119: Hoare triple {26217#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26217#true} is VALID [2018-11-23 12:30:50,661 INFO L273 TraceCheckUtils]: 120: Hoare triple {26217#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26217#true} is VALID [2018-11-23 12:30:50,661 INFO L273 TraceCheckUtils]: 121: Hoare triple {26217#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26217#true} is VALID [2018-11-23 12:30:50,661 INFO L273 TraceCheckUtils]: 122: Hoare triple {26217#true} assume !(~i~0 < 100000); {26217#true} is VALID [2018-11-23 12:30:50,661 INFO L273 TraceCheckUtils]: 123: Hoare triple {26217#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {26217#true} is VALID [2018-11-23 12:30:50,661 INFO L273 TraceCheckUtils]: 124: Hoare triple {26217#true} assume true; {26217#true} is VALID [2018-11-23 12:30:50,661 INFO L268 TraceCheckUtils]: 125: Hoare quadruple {26217#true} {26217#true} #72#return; {26217#true} is VALID [2018-11-23 12:30:50,666 INFO L273 TraceCheckUtils]: 126: Hoare triple {26217#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {26634#(<= main_~i~2 0)} is VALID [2018-11-23 12:30:50,666 INFO L273 TraceCheckUtils]: 127: Hoare triple {26634#(<= main_~i~2 0)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26634#(<= main_~i~2 0)} is VALID [2018-11-23 12:30:50,667 INFO L273 TraceCheckUtils]: 128: Hoare triple {26634#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26641#(<= main_~i~2 1)} is VALID [2018-11-23 12:30:50,667 INFO L273 TraceCheckUtils]: 129: Hoare triple {26641#(<= main_~i~2 1)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26641#(<= main_~i~2 1)} is VALID [2018-11-23 12:30:50,667 INFO L273 TraceCheckUtils]: 130: Hoare triple {26641#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26648#(<= main_~i~2 2)} is VALID [2018-11-23 12:30:50,668 INFO L273 TraceCheckUtils]: 131: Hoare triple {26648#(<= main_~i~2 2)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26648#(<= main_~i~2 2)} is VALID [2018-11-23 12:30:50,668 INFO L273 TraceCheckUtils]: 132: Hoare triple {26648#(<= main_~i~2 2)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26655#(<= main_~i~2 3)} is VALID [2018-11-23 12:30:50,668 INFO L273 TraceCheckUtils]: 133: Hoare triple {26655#(<= main_~i~2 3)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26655#(<= main_~i~2 3)} is VALID [2018-11-23 12:30:50,669 INFO L273 TraceCheckUtils]: 134: Hoare triple {26655#(<= main_~i~2 3)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26662#(<= main_~i~2 4)} is VALID [2018-11-23 12:30:50,669 INFO L273 TraceCheckUtils]: 135: Hoare triple {26662#(<= main_~i~2 4)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26662#(<= main_~i~2 4)} is VALID [2018-11-23 12:30:50,670 INFO L273 TraceCheckUtils]: 136: Hoare triple {26662#(<= main_~i~2 4)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26669#(<= main_~i~2 5)} is VALID [2018-11-23 12:30:50,670 INFO L273 TraceCheckUtils]: 137: Hoare triple {26669#(<= main_~i~2 5)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26669#(<= main_~i~2 5)} is VALID [2018-11-23 12:30:50,670 INFO L273 TraceCheckUtils]: 138: Hoare triple {26669#(<= main_~i~2 5)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26676#(<= main_~i~2 6)} is VALID [2018-11-23 12:30:50,671 INFO L273 TraceCheckUtils]: 139: Hoare triple {26676#(<= main_~i~2 6)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26676#(<= main_~i~2 6)} is VALID [2018-11-23 12:30:50,672 INFO L273 TraceCheckUtils]: 140: Hoare triple {26676#(<= main_~i~2 6)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26683#(<= main_~i~2 7)} is VALID [2018-11-23 12:30:50,672 INFO L273 TraceCheckUtils]: 141: Hoare triple {26683#(<= main_~i~2 7)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26683#(<= main_~i~2 7)} is VALID [2018-11-23 12:30:50,673 INFO L273 TraceCheckUtils]: 142: Hoare triple {26683#(<= main_~i~2 7)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26690#(<= main_~i~2 8)} is VALID [2018-11-23 12:30:50,673 INFO L273 TraceCheckUtils]: 143: Hoare triple {26690#(<= main_~i~2 8)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26690#(<= main_~i~2 8)} is VALID [2018-11-23 12:30:50,674 INFO L273 TraceCheckUtils]: 144: Hoare triple {26690#(<= main_~i~2 8)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26697#(<= main_~i~2 9)} is VALID [2018-11-23 12:30:50,675 INFO L273 TraceCheckUtils]: 145: Hoare triple {26697#(<= main_~i~2 9)} assume !(~i~2 < 99999); {26218#false} is VALID [2018-11-23 12:30:50,675 INFO L273 TraceCheckUtils]: 146: Hoare triple {26218#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {26218#false} is VALID [2018-11-23 12:30:50,675 INFO L256 TraceCheckUtils]: 147: Hoare triple {26218#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {26218#false} is VALID [2018-11-23 12:30:50,675 INFO L273 TraceCheckUtils]: 148: Hoare triple {26218#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {26218#false} is VALID [2018-11-23 12:30:50,675 INFO L273 TraceCheckUtils]: 149: Hoare triple {26218#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26218#false} is VALID [2018-11-23 12:30:50,676 INFO L273 TraceCheckUtils]: 150: Hoare triple {26218#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26218#false} is VALID [2018-11-23 12:30:50,676 INFO L273 TraceCheckUtils]: 151: Hoare triple {26218#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26218#false} is VALID [2018-11-23 12:30:50,676 INFO L273 TraceCheckUtils]: 152: Hoare triple {26218#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26218#false} is VALID [2018-11-23 12:30:50,676 INFO L273 TraceCheckUtils]: 153: Hoare triple {26218#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26218#false} is VALID [2018-11-23 12:30:50,676 INFO L273 TraceCheckUtils]: 154: Hoare triple {26218#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26218#false} is VALID [2018-11-23 12:30:50,677 INFO L273 TraceCheckUtils]: 155: Hoare triple {26218#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26218#false} is VALID [2018-11-23 12:30:50,677 INFO L273 TraceCheckUtils]: 156: Hoare triple {26218#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26218#false} is VALID [2018-11-23 12:30:50,677 INFO L273 TraceCheckUtils]: 157: Hoare triple {26218#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26218#false} is VALID [2018-11-23 12:30:50,677 INFO L273 TraceCheckUtils]: 158: Hoare triple {26218#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26218#false} is VALID [2018-11-23 12:30:50,677 INFO L273 TraceCheckUtils]: 159: Hoare triple {26218#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26218#false} is VALID [2018-11-23 12:30:50,677 INFO L273 TraceCheckUtils]: 160: Hoare triple {26218#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26218#false} is VALID [2018-11-23 12:30:50,678 INFO L273 TraceCheckUtils]: 161: Hoare triple {26218#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26218#false} is VALID [2018-11-23 12:30:50,678 INFO L273 TraceCheckUtils]: 162: Hoare triple {26218#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26218#false} is VALID [2018-11-23 12:30:50,678 INFO L273 TraceCheckUtils]: 163: Hoare triple {26218#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26218#false} is VALID [2018-11-23 12:30:50,678 INFO L273 TraceCheckUtils]: 164: Hoare triple {26218#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26218#false} is VALID [2018-11-23 12:30:50,678 INFO L273 TraceCheckUtils]: 165: Hoare triple {26218#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26218#false} is VALID [2018-11-23 12:30:50,678 INFO L273 TraceCheckUtils]: 166: Hoare triple {26218#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26218#false} is VALID [2018-11-23 12:30:50,678 INFO L273 TraceCheckUtils]: 167: Hoare triple {26218#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26218#false} is VALID [2018-11-23 12:30:50,679 INFO L273 TraceCheckUtils]: 168: Hoare triple {26218#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26218#false} is VALID [2018-11-23 12:30:50,679 INFO L273 TraceCheckUtils]: 169: Hoare triple {26218#false} assume !(~i~0 < 100000); {26218#false} is VALID [2018-11-23 12:30:50,679 INFO L273 TraceCheckUtils]: 170: Hoare triple {26218#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {26218#false} is VALID [2018-11-23 12:30:50,679 INFO L273 TraceCheckUtils]: 171: Hoare triple {26218#false} assume true; {26218#false} is VALID [2018-11-23 12:30:50,679 INFO L268 TraceCheckUtils]: 172: Hoare quadruple {26218#false} {26218#false} #74#return; {26218#false} is VALID [2018-11-23 12:30:50,679 INFO L273 TraceCheckUtils]: 173: Hoare triple {26218#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {26218#false} is VALID [2018-11-23 12:30:50,679 INFO L273 TraceCheckUtils]: 174: Hoare triple {26218#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {26218#false} is VALID [2018-11-23 12:30:50,679 INFO L273 TraceCheckUtils]: 175: Hoare triple {26218#false} assume !false; {26218#false} is VALID [2018-11-23 12:30:50,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 450 proven. 81 refuted. 0 times theorem prover too weak. 1614 trivial. 0 not checked. [2018-11-23 12:30:50,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:30:50,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 12] total 46 [2018-11-23 12:30:50,712 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 176 [2018-11-23 12:30:50,712 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:30:50,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states. [2018-11-23 12:30:50,843 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:30:50,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-23 12:30:50,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-23 12:30:50,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=695, Invalid=1375, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 12:30:50,845 INFO L87 Difference]: Start difference. First operand 127 states and 131 transitions. Second operand 46 states. [2018-11-23 12:30:51,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:51,510 INFO L93 Difference]: Finished difference Result 187 states and 196 transitions. [2018-11-23 12:30:51,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-23 12:30:51,510 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 176 [2018-11-23 12:30:51,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:30:51,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:30:51,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 141 transitions. [2018-11-23 12:30:51,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:30:51,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 141 transitions. [2018-11-23 12:30:51,512 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states and 141 transitions. [2018-11-23 12:30:51,653 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:30:51,655 INFO L225 Difference]: With dead ends: 187 [2018-11-23 12:30:51,655 INFO L226 Difference]: Without dead ends: 133 [2018-11-23 12:30:51,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=695, Invalid=1375, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 12:30:51,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-23 12:30:52,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-11-23 12:30:52,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:30:52,014 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand 131 states. [2018-11-23 12:30:52,014 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 131 states. [2018-11-23 12:30:52,014 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 131 states. [2018-11-23 12:30:52,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:52,017 INFO L93 Difference]: Finished difference Result 133 states and 137 transitions. [2018-11-23 12:30:52,017 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2018-11-23 12:30:52,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:52,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:52,017 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand 133 states. [2018-11-23 12:30:52,017 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 133 states. [2018-11-23 12:30:52,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:52,019 INFO L93 Difference]: Finished difference Result 133 states and 137 transitions. [2018-11-23 12:30:52,019 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2018-11-23 12:30:52,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:52,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:52,020 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:30:52,020 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:30:52,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-23 12:30:52,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 135 transitions. [2018-11-23 12:30:52,022 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 135 transitions. Word has length 176 [2018-11-23 12:30:52,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:30:52,022 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 135 transitions. [2018-11-23 12:30:52,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-23 12:30:52,022 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2018-11-23 12:30:52,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-23 12:30:52,023 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:30:52,023 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 30, 30, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:30:52,023 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:30:52,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:30:52,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1166888473, now seen corresponding path program 34 times [2018-11-23 12:30:52,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:30:52,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:30:52,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:52,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:30:52,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:52,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:53,169 INFO L256 TraceCheckUtils]: 0: Hoare triple {27529#true} call ULTIMATE.init(); {27529#true} is VALID [2018-11-23 12:30:53,169 INFO L273 TraceCheckUtils]: 1: Hoare triple {27529#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27529#true} is VALID [2018-11-23 12:30:53,169 INFO L273 TraceCheckUtils]: 2: Hoare triple {27529#true} assume true; {27529#true} is VALID [2018-11-23 12:30:53,169 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27529#true} {27529#true} #66#return; {27529#true} is VALID [2018-11-23 12:30:53,169 INFO L256 TraceCheckUtils]: 4: Hoare triple {27529#true} call #t~ret13 := main(); {27529#true} is VALID [2018-11-23 12:30:53,170 INFO L273 TraceCheckUtils]: 5: Hoare triple {27529#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {27531#(= main_~i~1 0)} is VALID [2018-11-23 12:30:53,170 INFO L273 TraceCheckUtils]: 6: Hoare triple {27531#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27531#(= main_~i~1 0)} is VALID [2018-11-23 12:30:53,171 INFO L273 TraceCheckUtils]: 7: Hoare triple {27531#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27532#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:53,172 INFO L273 TraceCheckUtils]: 8: Hoare triple {27532#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27532#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:53,172 INFO L273 TraceCheckUtils]: 9: Hoare triple {27532#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27533#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:53,173 INFO L273 TraceCheckUtils]: 10: Hoare triple {27533#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27533#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:53,174 INFO L273 TraceCheckUtils]: 11: Hoare triple {27533#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27534#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:53,174 INFO L273 TraceCheckUtils]: 12: Hoare triple {27534#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27534#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:53,175 INFO L273 TraceCheckUtils]: 13: Hoare triple {27534#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27535#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:53,175 INFO L273 TraceCheckUtils]: 14: Hoare triple {27535#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27535#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:53,176 INFO L273 TraceCheckUtils]: 15: Hoare triple {27535#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27536#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:53,177 INFO L273 TraceCheckUtils]: 16: Hoare triple {27536#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27536#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:53,177 INFO L273 TraceCheckUtils]: 17: Hoare triple {27536#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27537#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:53,178 INFO L273 TraceCheckUtils]: 18: Hoare triple {27537#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27537#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:53,179 INFO L273 TraceCheckUtils]: 19: Hoare triple {27537#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27538#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:53,179 INFO L273 TraceCheckUtils]: 20: Hoare triple {27538#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27538#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:53,180 INFO L273 TraceCheckUtils]: 21: Hoare triple {27538#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27539#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:53,180 INFO L273 TraceCheckUtils]: 22: Hoare triple {27539#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27539#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:53,181 INFO L273 TraceCheckUtils]: 23: Hoare triple {27539#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27540#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:53,182 INFO L273 TraceCheckUtils]: 24: Hoare triple {27540#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27540#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:53,182 INFO L273 TraceCheckUtils]: 25: Hoare triple {27540#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27541#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:53,183 INFO L273 TraceCheckUtils]: 26: Hoare triple {27541#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27541#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:53,184 INFO L273 TraceCheckUtils]: 27: Hoare triple {27541#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27542#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:53,184 INFO L273 TraceCheckUtils]: 28: Hoare triple {27542#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27542#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:53,185 INFO L273 TraceCheckUtils]: 29: Hoare triple {27542#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27543#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:53,185 INFO L273 TraceCheckUtils]: 30: Hoare triple {27543#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27543#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:53,186 INFO L273 TraceCheckUtils]: 31: Hoare triple {27543#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27544#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:53,187 INFO L273 TraceCheckUtils]: 32: Hoare triple {27544#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27544#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:53,187 INFO L273 TraceCheckUtils]: 33: Hoare triple {27544#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27545#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:53,188 INFO L273 TraceCheckUtils]: 34: Hoare triple {27545#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27545#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:53,189 INFO L273 TraceCheckUtils]: 35: Hoare triple {27545#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27546#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:53,189 INFO L273 TraceCheckUtils]: 36: Hoare triple {27546#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27546#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:53,190 INFO L273 TraceCheckUtils]: 37: Hoare triple {27546#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27547#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:53,190 INFO L273 TraceCheckUtils]: 38: Hoare triple {27547#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27547#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:53,191 INFO L273 TraceCheckUtils]: 39: Hoare triple {27547#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27548#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:53,192 INFO L273 TraceCheckUtils]: 40: Hoare triple {27548#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27548#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:53,192 INFO L273 TraceCheckUtils]: 41: Hoare triple {27548#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27549#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:53,193 INFO L273 TraceCheckUtils]: 42: Hoare triple {27549#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27549#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:53,194 INFO L273 TraceCheckUtils]: 43: Hoare triple {27549#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27550#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:53,194 INFO L273 TraceCheckUtils]: 44: Hoare triple {27550#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27550#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:53,195 INFO L273 TraceCheckUtils]: 45: Hoare triple {27550#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27551#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:53,195 INFO L273 TraceCheckUtils]: 46: Hoare triple {27551#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27551#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:53,196 INFO L273 TraceCheckUtils]: 47: Hoare triple {27551#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27552#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:53,197 INFO L273 TraceCheckUtils]: 48: Hoare triple {27552#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27552#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:53,197 INFO L273 TraceCheckUtils]: 49: Hoare triple {27552#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:53,198 INFO L273 TraceCheckUtils]: 50: Hoare triple {27553#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:53,199 INFO L273 TraceCheckUtils]: 51: Hoare triple {27553#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27554#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:53,199 INFO L273 TraceCheckUtils]: 52: Hoare triple {27554#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27554#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:53,200 INFO L273 TraceCheckUtils]: 53: Hoare triple {27554#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27555#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:53,200 INFO L273 TraceCheckUtils]: 54: Hoare triple {27555#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27555#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:53,201 INFO L273 TraceCheckUtils]: 55: Hoare triple {27555#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27556#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:53,202 INFO L273 TraceCheckUtils]: 56: Hoare triple {27556#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27556#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:53,202 INFO L273 TraceCheckUtils]: 57: Hoare triple {27556#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27557#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:53,203 INFO L273 TraceCheckUtils]: 58: Hoare triple {27557#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27557#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:53,204 INFO L273 TraceCheckUtils]: 59: Hoare triple {27557#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27558#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:53,204 INFO L273 TraceCheckUtils]: 60: Hoare triple {27558#(<= main_~i~1 27)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27558#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:53,205 INFO L273 TraceCheckUtils]: 61: Hoare triple {27558#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27559#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:53,205 INFO L273 TraceCheckUtils]: 62: Hoare triple {27559#(<= main_~i~1 28)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27559#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:53,206 INFO L273 TraceCheckUtils]: 63: Hoare triple {27559#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27560#(<= main_~i~1 29)} is VALID [2018-11-23 12:30:53,207 INFO L273 TraceCheckUtils]: 64: Hoare triple {27560#(<= main_~i~1 29)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27560#(<= main_~i~1 29)} is VALID [2018-11-23 12:30:53,207 INFO L273 TraceCheckUtils]: 65: Hoare triple {27560#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27561#(<= main_~i~1 30)} is VALID [2018-11-23 12:30:53,208 INFO L273 TraceCheckUtils]: 66: Hoare triple {27561#(<= main_~i~1 30)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27561#(<= main_~i~1 30)} is VALID [2018-11-23 12:30:53,209 INFO L273 TraceCheckUtils]: 67: Hoare triple {27561#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27562#(<= main_~i~1 31)} is VALID [2018-11-23 12:30:53,209 INFO L273 TraceCheckUtils]: 68: Hoare triple {27562#(<= main_~i~1 31)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27562#(<= main_~i~1 31)} is VALID [2018-11-23 12:30:53,210 INFO L273 TraceCheckUtils]: 69: Hoare triple {27562#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27563#(<= main_~i~1 32)} is VALID [2018-11-23 12:30:53,210 INFO L273 TraceCheckUtils]: 70: Hoare triple {27563#(<= main_~i~1 32)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27563#(<= main_~i~1 32)} is VALID [2018-11-23 12:30:53,211 INFO L273 TraceCheckUtils]: 71: Hoare triple {27563#(<= main_~i~1 32)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27564#(<= main_~i~1 33)} is VALID [2018-11-23 12:30:53,212 INFO L273 TraceCheckUtils]: 72: Hoare triple {27564#(<= main_~i~1 33)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27564#(<= main_~i~1 33)} is VALID [2018-11-23 12:30:53,212 INFO L273 TraceCheckUtils]: 73: Hoare triple {27564#(<= main_~i~1 33)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27565#(<= main_~i~1 34)} is VALID [2018-11-23 12:30:53,213 INFO L273 TraceCheckUtils]: 74: Hoare triple {27565#(<= main_~i~1 34)} assume !(~i~1 < 100000); {27530#false} is VALID [2018-11-23 12:30:53,213 INFO L256 TraceCheckUtils]: 75: Hoare triple {27530#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {27529#true} is VALID [2018-11-23 12:30:53,213 INFO L273 TraceCheckUtils]: 76: Hoare triple {27529#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {27529#true} is VALID [2018-11-23 12:30:53,214 INFO L273 TraceCheckUtils]: 77: Hoare triple {27529#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27529#true} is VALID [2018-11-23 12:30:53,214 INFO L273 TraceCheckUtils]: 78: Hoare triple {27529#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27529#true} is VALID [2018-11-23 12:30:53,214 INFO L273 TraceCheckUtils]: 79: Hoare triple {27529#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27529#true} is VALID [2018-11-23 12:30:53,214 INFO L273 TraceCheckUtils]: 80: Hoare triple {27529#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27529#true} is VALID [2018-11-23 12:30:53,214 INFO L273 TraceCheckUtils]: 81: Hoare triple {27529#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27529#true} is VALID [2018-11-23 12:30:53,215 INFO L273 TraceCheckUtils]: 82: Hoare triple {27529#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27529#true} is VALID [2018-11-23 12:30:53,215 INFO L273 TraceCheckUtils]: 83: Hoare triple {27529#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27529#true} is VALID [2018-11-23 12:30:53,215 INFO L273 TraceCheckUtils]: 84: Hoare triple {27529#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27529#true} is VALID [2018-11-23 12:30:53,215 INFO L273 TraceCheckUtils]: 85: Hoare triple {27529#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27529#true} is VALID [2018-11-23 12:30:53,215 INFO L273 TraceCheckUtils]: 86: Hoare triple {27529#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27529#true} is VALID [2018-11-23 12:30:53,215 INFO L273 TraceCheckUtils]: 87: Hoare triple {27529#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27529#true} is VALID [2018-11-23 12:30:53,216 INFO L273 TraceCheckUtils]: 88: Hoare triple {27529#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27529#true} is VALID [2018-11-23 12:30:53,216 INFO L273 TraceCheckUtils]: 89: Hoare triple {27529#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27529#true} is VALID [2018-11-23 12:30:53,216 INFO L273 TraceCheckUtils]: 90: Hoare triple {27529#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27529#true} is VALID [2018-11-23 12:30:53,216 INFO L273 TraceCheckUtils]: 91: Hoare triple {27529#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27529#true} is VALID [2018-11-23 12:30:53,216 INFO L273 TraceCheckUtils]: 92: Hoare triple {27529#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27529#true} is VALID [2018-11-23 12:30:53,216 INFO L273 TraceCheckUtils]: 93: Hoare triple {27529#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27529#true} is VALID [2018-11-23 12:30:53,217 INFO L273 TraceCheckUtils]: 94: Hoare triple {27529#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27529#true} is VALID [2018-11-23 12:30:53,217 INFO L273 TraceCheckUtils]: 95: Hoare triple {27529#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27529#true} is VALID [2018-11-23 12:30:53,217 INFO L273 TraceCheckUtils]: 96: Hoare triple {27529#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27529#true} is VALID [2018-11-23 12:30:53,217 INFO L273 TraceCheckUtils]: 97: Hoare triple {27529#true} assume !(~i~0 < 100000); {27529#true} is VALID [2018-11-23 12:30:53,217 INFO L273 TraceCheckUtils]: 98: Hoare triple {27529#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {27529#true} is VALID [2018-11-23 12:30:53,217 INFO L273 TraceCheckUtils]: 99: Hoare triple {27529#true} assume true; {27529#true} is VALID [2018-11-23 12:30:53,217 INFO L268 TraceCheckUtils]: 100: Hoare quadruple {27529#true} {27530#false} #70#return; {27530#false} is VALID [2018-11-23 12:30:53,218 INFO L273 TraceCheckUtils]: 101: Hoare triple {27530#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {27530#false} is VALID [2018-11-23 12:30:53,218 INFO L256 TraceCheckUtils]: 102: Hoare triple {27530#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {27529#true} is VALID [2018-11-23 12:30:53,218 INFO L273 TraceCheckUtils]: 103: Hoare triple {27529#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {27529#true} is VALID [2018-11-23 12:30:53,218 INFO L273 TraceCheckUtils]: 104: Hoare triple {27529#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27529#true} is VALID [2018-11-23 12:30:53,218 INFO L273 TraceCheckUtils]: 105: Hoare triple {27529#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27529#true} is VALID [2018-11-23 12:30:53,218 INFO L273 TraceCheckUtils]: 106: Hoare triple {27529#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27529#true} is VALID [2018-11-23 12:30:53,218 INFO L273 TraceCheckUtils]: 107: Hoare triple {27529#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27529#true} is VALID [2018-11-23 12:30:53,218 INFO L273 TraceCheckUtils]: 108: Hoare triple {27529#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27529#true} is VALID [2018-11-23 12:30:53,218 INFO L273 TraceCheckUtils]: 109: Hoare triple {27529#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27529#true} is VALID [2018-11-23 12:30:53,218 INFO L273 TraceCheckUtils]: 110: Hoare triple {27529#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27529#true} is VALID [2018-11-23 12:30:53,219 INFO L273 TraceCheckUtils]: 111: Hoare triple {27529#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27529#true} is VALID [2018-11-23 12:30:53,219 INFO L273 TraceCheckUtils]: 112: Hoare triple {27529#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27529#true} is VALID [2018-11-23 12:30:53,219 INFO L273 TraceCheckUtils]: 113: Hoare triple {27529#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27529#true} is VALID [2018-11-23 12:30:53,219 INFO L273 TraceCheckUtils]: 114: Hoare triple {27529#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27529#true} is VALID [2018-11-23 12:30:53,219 INFO L273 TraceCheckUtils]: 115: Hoare triple {27529#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27529#true} is VALID [2018-11-23 12:30:53,219 INFO L273 TraceCheckUtils]: 116: Hoare triple {27529#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27529#true} is VALID [2018-11-23 12:30:53,219 INFO L273 TraceCheckUtils]: 117: Hoare triple {27529#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27529#true} is VALID [2018-11-23 12:30:53,219 INFO L273 TraceCheckUtils]: 118: Hoare triple {27529#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27529#true} is VALID [2018-11-23 12:30:53,219 INFO L273 TraceCheckUtils]: 119: Hoare triple {27529#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27529#true} is VALID [2018-11-23 12:30:53,219 INFO L273 TraceCheckUtils]: 120: Hoare triple {27529#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27529#true} is VALID [2018-11-23 12:30:53,220 INFO L273 TraceCheckUtils]: 121: Hoare triple {27529#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27529#true} is VALID [2018-11-23 12:30:53,220 INFO L273 TraceCheckUtils]: 122: Hoare triple {27529#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27529#true} is VALID [2018-11-23 12:30:53,220 INFO L273 TraceCheckUtils]: 123: Hoare triple {27529#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27529#true} is VALID [2018-11-23 12:30:53,220 INFO L273 TraceCheckUtils]: 124: Hoare triple {27529#true} assume !(~i~0 < 100000); {27529#true} is VALID [2018-11-23 12:30:53,220 INFO L273 TraceCheckUtils]: 125: Hoare triple {27529#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {27529#true} is VALID [2018-11-23 12:30:53,220 INFO L273 TraceCheckUtils]: 126: Hoare triple {27529#true} assume true; {27529#true} is VALID [2018-11-23 12:30:53,220 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {27529#true} {27530#false} #72#return; {27530#false} is VALID [2018-11-23 12:30:53,220 INFO L273 TraceCheckUtils]: 128: Hoare triple {27530#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {27530#false} is VALID [2018-11-23 12:30:53,220 INFO L273 TraceCheckUtils]: 129: Hoare triple {27530#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27530#false} is VALID [2018-11-23 12:30:53,221 INFO L273 TraceCheckUtils]: 130: Hoare triple {27530#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27530#false} is VALID [2018-11-23 12:30:53,221 INFO L273 TraceCheckUtils]: 131: Hoare triple {27530#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27530#false} is VALID [2018-11-23 12:30:53,221 INFO L273 TraceCheckUtils]: 132: Hoare triple {27530#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27530#false} is VALID [2018-11-23 12:30:53,221 INFO L273 TraceCheckUtils]: 133: Hoare triple {27530#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27530#false} is VALID [2018-11-23 12:30:53,221 INFO L273 TraceCheckUtils]: 134: Hoare triple {27530#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27530#false} is VALID [2018-11-23 12:30:53,221 INFO L273 TraceCheckUtils]: 135: Hoare triple {27530#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27530#false} is VALID [2018-11-23 12:30:53,221 INFO L273 TraceCheckUtils]: 136: Hoare triple {27530#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27530#false} is VALID [2018-11-23 12:30:53,221 INFO L273 TraceCheckUtils]: 137: Hoare triple {27530#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27530#false} is VALID [2018-11-23 12:30:53,221 INFO L273 TraceCheckUtils]: 138: Hoare triple {27530#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27530#false} is VALID [2018-11-23 12:30:53,221 INFO L273 TraceCheckUtils]: 139: Hoare triple {27530#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27530#false} is VALID [2018-11-23 12:30:53,222 INFO L273 TraceCheckUtils]: 140: Hoare triple {27530#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27530#false} is VALID [2018-11-23 12:30:53,222 INFO L273 TraceCheckUtils]: 141: Hoare triple {27530#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27530#false} is VALID [2018-11-23 12:30:53,222 INFO L273 TraceCheckUtils]: 142: Hoare triple {27530#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27530#false} is VALID [2018-11-23 12:30:53,222 INFO L273 TraceCheckUtils]: 143: Hoare triple {27530#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27530#false} is VALID [2018-11-23 12:30:53,222 INFO L273 TraceCheckUtils]: 144: Hoare triple {27530#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27530#false} is VALID [2018-11-23 12:30:53,222 INFO L273 TraceCheckUtils]: 145: Hoare triple {27530#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27530#false} is VALID [2018-11-23 12:30:53,222 INFO L273 TraceCheckUtils]: 146: Hoare triple {27530#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27530#false} is VALID [2018-11-23 12:30:53,222 INFO L273 TraceCheckUtils]: 147: Hoare triple {27530#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27530#false} is VALID [2018-11-23 12:30:53,222 INFO L273 TraceCheckUtils]: 148: Hoare triple {27530#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27530#false} is VALID [2018-11-23 12:30:53,223 INFO L273 TraceCheckUtils]: 149: Hoare triple {27530#false} assume !(~i~2 < 99999); {27530#false} is VALID [2018-11-23 12:30:53,223 INFO L273 TraceCheckUtils]: 150: Hoare triple {27530#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {27530#false} is VALID [2018-11-23 12:30:53,223 INFO L256 TraceCheckUtils]: 151: Hoare triple {27530#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {27529#true} is VALID [2018-11-23 12:30:53,223 INFO L273 TraceCheckUtils]: 152: Hoare triple {27529#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {27529#true} is VALID [2018-11-23 12:30:53,223 INFO L273 TraceCheckUtils]: 153: Hoare triple {27529#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27529#true} is VALID [2018-11-23 12:30:53,223 INFO L273 TraceCheckUtils]: 154: Hoare triple {27529#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27529#true} is VALID [2018-11-23 12:30:53,223 INFO L273 TraceCheckUtils]: 155: Hoare triple {27529#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27529#true} is VALID [2018-11-23 12:30:53,223 INFO L273 TraceCheckUtils]: 156: Hoare triple {27529#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27529#true} is VALID [2018-11-23 12:30:53,223 INFO L273 TraceCheckUtils]: 157: Hoare triple {27529#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27529#true} is VALID [2018-11-23 12:30:53,223 INFO L273 TraceCheckUtils]: 158: Hoare triple {27529#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27529#true} is VALID [2018-11-23 12:30:53,224 INFO L273 TraceCheckUtils]: 159: Hoare triple {27529#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27529#true} is VALID [2018-11-23 12:30:53,224 INFO L273 TraceCheckUtils]: 160: Hoare triple {27529#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27529#true} is VALID [2018-11-23 12:30:53,224 INFO L273 TraceCheckUtils]: 161: Hoare triple {27529#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27529#true} is VALID [2018-11-23 12:30:53,224 INFO L273 TraceCheckUtils]: 162: Hoare triple {27529#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27529#true} is VALID [2018-11-23 12:30:53,224 INFO L273 TraceCheckUtils]: 163: Hoare triple {27529#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27529#true} is VALID [2018-11-23 12:30:53,224 INFO L273 TraceCheckUtils]: 164: Hoare triple {27529#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27529#true} is VALID [2018-11-23 12:30:53,224 INFO L273 TraceCheckUtils]: 165: Hoare triple {27529#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27529#true} is VALID [2018-11-23 12:30:53,224 INFO L273 TraceCheckUtils]: 166: Hoare triple {27529#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27529#true} is VALID [2018-11-23 12:30:53,224 INFO L273 TraceCheckUtils]: 167: Hoare triple {27529#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27529#true} is VALID [2018-11-23 12:30:53,224 INFO L273 TraceCheckUtils]: 168: Hoare triple {27529#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27529#true} is VALID [2018-11-23 12:30:53,225 INFO L273 TraceCheckUtils]: 169: Hoare triple {27529#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27529#true} is VALID [2018-11-23 12:30:53,225 INFO L273 TraceCheckUtils]: 170: Hoare triple {27529#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27529#true} is VALID [2018-11-23 12:30:53,225 INFO L273 TraceCheckUtils]: 171: Hoare triple {27529#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27529#true} is VALID [2018-11-23 12:30:53,225 INFO L273 TraceCheckUtils]: 172: Hoare triple {27529#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27529#true} is VALID [2018-11-23 12:30:53,225 INFO L273 TraceCheckUtils]: 173: Hoare triple {27529#true} assume !(~i~0 < 100000); {27529#true} is VALID [2018-11-23 12:30:53,225 INFO L273 TraceCheckUtils]: 174: Hoare triple {27529#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {27529#true} is VALID [2018-11-23 12:30:53,225 INFO L273 TraceCheckUtils]: 175: Hoare triple {27529#true} assume true; {27529#true} is VALID [2018-11-23 12:30:53,225 INFO L268 TraceCheckUtils]: 176: Hoare quadruple {27529#true} {27530#false} #74#return; {27530#false} is VALID [2018-11-23 12:30:53,225 INFO L273 TraceCheckUtils]: 177: Hoare triple {27530#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {27530#false} is VALID [2018-11-23 12:30:53,226 INFO L273 TraceCheckUtils]: 178: Hoare triple {27530#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {27530#false} is VALID [2018-11-23 12:30:53,226 INFO L273 TraceCheckUtils]: 179: Hoare triple {27530#false} assume !false; {27530#false} is VALID [2018-11-23 12:30:53,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2231 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 1075 trivial. 0 not checked. [2018-11-23 12:30:53,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:30:53,241 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 12:30:53,252 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:30:53,329 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:30:53,329 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:30:53,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:53,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:30:53,749 INFO L256 TraceCheckUtils]: 0: Hoare triple {27529#true} call ULTIMATE.init(); {27529#true} is VALID [2018-11-23 12:30:53,750 INFO L273 TraceCheckUtils]: 1: Hoare triple {27529#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27529#true} is VALID [2018-11-23 12:30:53,750 INFO L273 TraceCheckUtils]: 2: Hoare triple {27529#true} assume true; {27529#true} is VALID [2018-11-23 12:30:53,750 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27529#true} {27529#true} #66#return; {27529#true} is VALID [2018-11-23 12:30:53,750 INFO L256 TraceCheckUtils]: 4: Hoare triple {27529#true} call #t~ret13 := main(); {27529#true} is VALID [2018-11-23 12:30:53,751 INFO L273 TraceCheckUtils]: 5: Hoare triple {27529#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {27529#true} is VALID [2018-11-23 12:30:53,751 INFO L273 TraceCheckUtils]: 6: Hoare triple {27529#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27529#true} is VALID [2018-11-23 12:30:53,751 INFO L273 TraceCheckUtils]: 7: Hoare triple {27529#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27529#true} is VALID [2018-11-23 12:30:53,751 INFO L273 TraceCheckUtils]: 8: Hoare triple {27529#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27529#true} is VALID [2018-11-23 12:30:53,751 INFO L273 TraceCheckUtils]: 9: Hoare triple {27529#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27529#true} is VALID [2018-11-23 12:30:53,751 INFO L273 TraceCheckUtils]: 10: Hoare triple {27529#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27529#true} is VALID [2018-11-23 12:30:53,751 INFO L273 TraceCheckUtils]: 11: Hoare triple {27529#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27529#true} is VALID [2018-11-23 12:30:53,752 INFO L273 TraceCheckUtils]: 12: Hoare triple {27529#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27529#true} is VALID [2018-11-23 12:30:53,752 INFO L273 TraceCheckUtils]: 13: Hoare triple {27529#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27529#true} is VALID [2018-11-23 12:30:53,752 INFO L273 TraceCheckUtils]: 14: Hoare triple {27529#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27529#true} is VALID [2018-11-23 12:30:53,752 INFO L273 TraceCheckUtils]: 15: Hoare triple {27529#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27529#true} is VALID [2018-11-23 12:30:53,752 INFO L273 TraceCheckUtils]: 16: Hoare triple {27529#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27529#true} is VALID [2018-11-23 12:30:53,752 INFO L273 TraceCheckUtils]: 17: Hoare triple {27529#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27529#true} is VALID [2018-11-23 12:30:53,752 INFO L273 TraceCheckUtils]: 18: Hoare triple {27529#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27529#true} is VALID [2018-11-23 12:30:53,752 INFO L273 TraceCheckUtils]: 19: Hoare triple {27529#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27529#true} is VALID [2018-11-23 12:30:53,752 INFO L273 TraceCheckUtils]: 20: Hoare triple {27529#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27529#true} is VALID [2018-11-23 12:30:53,752 INFO L273 TraceCheckUtils]: 21: Hoare triple {27529#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27529#true} is VALID [2018-11-23 12:30:53,753 INFO L273 TraceCheckUtils]: 22: Hoare triple {27529#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27529#true} is VALID [2018-11-23 12:30:53,753 INFO L273 TraceCheckUtils]: 23: Hoare triple {27529#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27529#true} is VALID [2018-11-23 12:30:53,753 INFO L273 TraceCheckUtils]: 24: Hoare triple {27529#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27529#true} is VALID [2018-11-23 12:30:53,753 INFO L273 TraceCheckUtils]: 25: Hoare triple {27529#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27529#true} is VALID [2018-11-23 12:30:53,753 INFO L273 TraceCheckUtils]: 26: Hoare triple {27529#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27529#true} is VALID [2018-11-23 12:30:53,753 INFO L273 TraceCheckUtils]: 27: Hoare triple {27529#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27529#true} is VALID [2018-11-23 12:30:53,753 INFO L273 TraceCheckUtils]: 28: Hoare triple {27529#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27529#true} is VALID [2018-11-23 12:30:53,753 INFO L273 TraceCheckUtils]: 29: Hoare triple {27529#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27529#true} is VALID [2018-11-23 12:30:53,753 INFO L273 TraceCheckUtils]: 30: Hoare triple {27529#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27529#true} is VALID [2018-11-23 12:30:53,753 INFO L273 TraceCheckUtils]: 31: Hoare triple {27529#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27529#true} is VALID [2018-11-23 12:30:53,754 INFO L273 TraceCheckUtils]: 32: Hoare triple {27529#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27529#true} is VALID [2018-11-23 12:30:53,754 INFO L273 TraceCheckUtils]: 33: Hoare triple {27529#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27529#true} is VALID [2018-11-23 12:30:53,754 INFO L273 TraceCheckUtils]: 34: Hoare triple {27529#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27529#true} is VALID [2018-11-23 12:30:53,754 INFO L273 TraceCheckUtils]: 35: Hoare triple {27529#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27529#true} is VALID [2018-11-23 12:30:53,754 INFO L273 TraceCheckUtils]: 36: Hoare triple {27529#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27529#true} is VALID [2018-11-23 12:30:53,754 INFO L273 TraceCheckUtils]: 37: Hoare triple {27529#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27529#true} is VALID [2018-11-23 12:30:53,754 INFO L273 TraceCheckUtils]: 38: Hoare triple {27529#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27529#true} is VALID [2018-11-23 12:30:53,754 INFO L273 TraceCheckUtils]: 39: Hoare triple {27529#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27529#true} is VALID [2018-11-23 12:30:53,754 INFO L273 TraceCheckUtils]: 40: Hoare triple {27529#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27529#true} is VALID [2018-11-23 12:30:53,754 INFO L273 TraceCheckUtils]: 41: Hoare triple {27529#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27529#true} is VALID [2018-11-23 12:30:53,755 INFO L273 TraceCheckUtils]: 42: Hoare triple {27529#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27529#true} is VALID [2018-11-23 12:30:53,755 INFO L273 TraceCheckUtils]: 43: Hoare triple {27529#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27529#true} is VALID [2018-11-23 12:30:53,755 INFO L273 TraceCheckUtils]: 44: Hoare triple {27529#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27529#true} is VALID [2018-11-23 12:30:53,755 INFO L273 TraceCheckUtils]: 45: Hoare triple {27529#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27529#true} is VALID [2018-11-23 12:30:53,755 INFO L273 TraceCheckUtils]: 46: Hoare triple {27529#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27529#true} is VALID [2018-11-23 12:30:53,755 INFO L273 TraceCheckUtils]: 47: Hoare triple {27529#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27529#true} is VALID [2018-11-23 12:30:53,755 INFO L273 TraceCheckUtils]: 48: Hoare triple {27529#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27529#true} is VALID [2018-11-23 12:30:53,755 INFO L273 TraceCheckUtils]: 49: Hoare triple {27529#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27529#true} is VALID [2018-11-23 12:30:53,755 INFO L273 TraceCheckUtils]: 50: Hoare triple {27529#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27529#true} is VALID [2018-11-23 12:30:53,756 INFO L273 TraceCheckUtils]: 51: Hoare triple {27529#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27529#true} is VALID [2018-11-23 12:30:53,756 INFO L273 TraceCheckUtils]: 52: Hoare triple {27529#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27529#true} is VALID [2018-11-23 12:30:53,756 INFO L273 TraceCheckUtils]: 53: Hoare triple {27529#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27529#true} is VALID [2018-11-23 12:30:53,756 INFO L273 TraceCheckUtils]: 54: Hoare triple {27529#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27529#true} is VALID [2018-11-23 12:30:53,756 INFO L273 TraceCheckUtils]: 55: Hoare triple {27529#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27529#true} is VALID [2018-11-23 12:30:53,756 INFO L273 TraceCheckUtils]: 56: Hoare triple {27529#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27529#true} is VALID [2018-11-23 12:30:53,756 INFO L273 TraceCheckUtils]: 57: Hoare triple {27529#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27529#true} is VALID [2018-11-23 12:30:53,756 INFO L273 TraceCheckUtils]: 58: Hoare triple {27529#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27529#true} is VALID [2018-11-23 12:30:53,756 INFO L273 TraceCheckUtils]: 59: Hoare triple {27529#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27529#true} is VALID [2018-11-23 12:30:53,756 INFO L273 TraceCheckUtils]: 60: Hoare triple {27529#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27529#true} is VALID [2018-11-23 12:30:53,757 INFO L273 TraceCheckUtils]: 61: Hoare triple {27529#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27529#true} is VALID [2018-11-23 12:30:53,757 INFO L273 TraceCheckUtils]: 62: Hoare triple {27529#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27529#true} is VALID [2018-11-23 12:30:53,757 INFO L273 TraceCheckUtils]: 63: Hoare triple {27529#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27529#true} is VALID [2018-11-23 12:30:53,757 INFO L273 TraceCheckUtils]: 64: Hoare triple {27529#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27529#true} is VALID [2018-11-23 12:30:53,757 INFO L273 TraceCheckUtils]: 65: Hoare triple {27529#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27529#true} is VALID [2018-11-23 12:30:53,757 INFO L273 TraceCheckUtils]: 66: Hoare triple {27529#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27529#true} is VALID [2018-11-23 12:30:53,757 INFO L273 TraceCheckUtils]: 67: Hoare triple {27529#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27529#true} is VALID [2018-11-23 12:30:53,757 INFO L273 TraceCheckUtils]: 68: Hoare triple {27529#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27529#true} is VALID [2018-11-23 12:30:53,757 INFO L273 TraceCheckUtils]: 69: Hoare triple {27529#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27529#true} is VALID [2018-11-23 12:30:53,757 INFO L273 TraceCheckUtils]: 70: Hoare triple {27529#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27529#true} is VALID [2018-11-23 12:30:53,758 INFO L273 TraceCheckUtils]: 71: Hoare triple {27529#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27529#true} is VALID [2018-11-23 12:30:53,758 INFO L273 TraceCheckUtils]: 72: Hoare triple {27529#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27529#true} is VALID [2018-11-23 12:30:53,758 INFO L273 TraceCheckUtils]: 73: Hoare triple {27529#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27529#true} is VALID [2018-11-23 12:30:53,758 INFO L273 TraceCheckUtils]: 74: Hoare triple {27529#true} assume !(~i~1 < 100000); {27529#true} is VALID [2018-11-23 12:30:53,758 INFO L256 TraceCheckUtils]: 75: Hoare triple {27529#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {27529#true} is VALID [2018-11-23 12:30:53,758 INFO L273 TraceCheckUtils]: 76: Hoare triple {27529#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {27529#true} is VALID [2018-11-23 12:30:53,758 INFO L273 TraceCheckUtils]: 77: Hoare triple {27529#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27529#true} is VALID [2018-11-23 12:30:53,758 INFO L273 TraceCheckUtils]: 78: Hoare triple {27529#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27529#true} is VALID [2018-11-23 12:30:53,758 INFO L273 TraceCheckUtils]: 79: Hoare triple {27529#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27529#true} is VALID [2018-11-23 12:30:53,758 INFO L273 TraceCheckUtils]: 80: Hoare triple {27529#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27529#true} is VALID [2018-11-23 12:30:53,759 INFO L273 TraceCheckUtils]: 81: Hoare triple {27529#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27529#true} is VALID [2018-11-23 12:30:53,759 INFO L273 TraceCheckUtils]: 82: Hoare triple {27529#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27529#true} is VALID [2018-11-23 12:30:53,759 INFO L273 TraceCheckUtils]: 83: Hoare triple {27529#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27529#true} is VALID [2018-11-23 12:30:53,759 INFO L273 TraceCheckUtils]: 84: Hoare triple {27529#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27529#true} is VALID [2018-11-23 12:30:53,759 INFO L273 TraceCheckUtils]: 85: Hoare triple {27529#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27529#true} is VALID [2018-11-23 12:30:53,759 INFO L273 TraceCheckUtils]: 86: Hoare triple {27529#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27529#true} is VALID [2018-11-23 12:30:53,759 INFO L273 TraceCheckUtils]: 87: Hoare triple {27529#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27529#true} is VALID [2018-11-23 12:30:53,759 INFO L273 TraceCheckUtils]: 88: Hoare triple {27529#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27529#true} is VALID [2018-11-23 12:30:53,759 INFO L273 TraceCheckUtils]: 89: Hoare triple {27529#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27529#true} is VALID [2018-11-23 12:30:53,759 INFO L273 TraceCheckUtils]: 90: Hoare triple {27529#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27529#true} is VALID [2018-11-23 12:30:53,760 INFO L273 TraceCheckUtils]: 91: Hoare triple {27529#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27529#true} is VALID [2018-11-23 12:30:53,760 INFO L273 TraceCheckUtils]: 92: Hoare triple {27529#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27529#true} is VALID [2018-11-23 12:30:53,760 INFO L273 TraceCheckUtils]: 93: Hoare triple {27529#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27529#true} is VALID [2018-11-23 12:30:53,760 INFO L273 TraceCheckUtils]: 94: Hoare triple {27529#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27529#true} is VALID [2018-11-23 12:30:53,760 INFO L273 TraceCheckUtils]: 95: Hoare triple {27529#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27529#true} is VALID [2018-11-23 12:30:53,760 INFO L273 TraceCheckUtils]: 96: Hoare triple {27529#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27529#true} is VALID [2018-11-23 12:30:53,760 INFO L273 TraceCheckUtils]: 97: Hoare triple {27529#true} assume !(~i~0 < 100000); {27529#true} is VALID [2018-11-23 12:30:53,760 INFO L273 TraceCheckUtils]: 98: Hoare triple {27529#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {27529#true} is VALID [2018-11-23 12:30:53,760 INFO L273 TraceCheckUtils]: 99: Hoare triple {27529#true} assume true; {27529#true} is VALID [2018-11-23 12:30:53,760 INFO L268 TraceCheckUtils]: 100: Hoare quadruple {27529#true} {27529#true} #70#return; {27529#true} is VALID [2018-11-23 12:30:53,761 INFO L273 TraceCheckUtils]: 101: Hoare triple {27529#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {27529#true} is VALID [2018-11-23 12:30:53,761 INFO L256 TraceCheckUtils]: 102: Hoare triple {27529#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {27529#true} is VALID [2018-11-23 12:30:53,761 INFO L273 TraceCheckUtils]: 103: Hoare triple {27529#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {27529#true} is VALID [2018-11-23 12:30:53,761 INFO L273 TraceCheckUtils]: 104: Hoare triple {27529#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27529#true} is VALID [2018-11-23 12:30:53,761 INFO L273 TraceCheckUtils]: 105: Hoare triple {27529#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27529#true} is VALID [2018-11-23 12:30:53,761 INFO L273 TraceCheckUtils]: 106: Hoare triple {27529#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27529#true} is VALID [2018-11-23 12:30:53,761 INFO L273 TraceCheckUtils]: 107: Hoare triple {27529#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27529#true} is VALID [2018-11-23 12:30:53,761 INFO L273 TraceCheckUtils]: 108: Hoare triple {27529#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27529#true} is VALID [2018-11-23 12:30:53,761 INFO L273 TraceCheckUtils]: 109: Hoare triple {27529#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27529#true} is VALID [2018-11-23 12:30:53,761 INFO L273 TraceCheckUtils]: 110: Hoare triple {27529#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27529#true} is VALID [2018-11-23 12:30:53,762 INFO L273 TraceCheckUtils]: 111: Hoare triple {27529#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27529#true} is VALID [2018-11-23 12:30:53,762 INFO L273 TraceCheckUtils]: 112: Hoare triple {27529#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27529#true} is VALID [2018-11-23 12:30:53,762 INFO L273 TraceCheckUtils]: 113: Hoare triple {27529#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27529#true} is VALID [2018-11-23 12:30:53,762 INFO L273 TraceCheckUtils]: 114: Hoare triple {27529#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27529#true} is VALID [2018-11-23 12:30:53,762 INFO L273 TraceCheckUtils]: 115: Hoare triple {27529#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27529#true} is VALID [2018-11-23 12:30:53,762 INFO L273 TraceCheckUtils]: 116: Hoare triple {27529#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27529#true} is VALID [2018-11-23 12:30:53,762 INFO L273 TraceCheckUtils]: 117: Hoare triple {27529#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27529#true} is VALID [2018-11-23 12:30:53,762 INFO L273 TraceCheckUtils]: 118: Hoare triple {27529#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27529#true} is VALID [2018-11-23 12:30:53,762 INFO L273 TraceCheckUtils]: 119: Hoare triple {27529#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27529#true} is VALID [2018-11-23 12:30:53,762 INFO L273 TraceCheckUtils]: 120: Hoare triple {27529#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27529#true} is VALID [2018-11-23 12:30:53,763 INFO L273 TraceCheckUtils]: 121: Hoare triple {27529#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27529#true} is VALID [2018-11-23 12:30:53,763 INFO L273 TraceCheckUtils]: 122: Hoare triple {27529#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27529#true} is VALID [2018-11-23 12:30:53,763 INFO L273 TraceCheckUtils]: 123: Hoare triple {27529#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27529#true} is VALID [2018-11-23 12:30:53,763 INFO L273 TraceCheckUtils]: 124: Hoare triple {27529#true} assume !(~i~0 < 100000); {27529#true} is VALID [2018-11-23 12:30:53,763 INFO L273 TraceCheckUtils]: 125: Hoare triple {27529#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {27529#true} is VALID [2018-11-23 12:30:53,763 INFO L273 TraceCheckUtils]: 126: Hoare triple {27529#true} assume true; {27529#true} is VALID [2018-11-23 12:30:53,763 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {27529#true} {27529#true} #72#return; {27529#true} is VALID [2018-11-23 12:30:53,764 INFO L273 TraceCheckUtils]: 128: Hoare triple {27529#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {27953#(<= main_~i~2 0)} is VALID [2018-11-23 12:30:53,764 INFO L273 TraceCheckUtils]: 129: Hoare triple {27953#(<= main_~i~2 0)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27953#(<= main_~i~2 0)} is VALID [2018-11-23 12:30:53,765 INFO L273 TraceCheckUtils]: 130: Hoare triple {27953#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27960#(<= main_~i~2 1)} is VALID [2018-11-23 12:30:53,765 INFO L273 TraceCheckUtils]: 131: Hoare triple {27960#(<= main_~i~2 1)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27960#(<= main_~i~2 1)} is VALID [2018-11-23 12:30:53,765 INFO L273 TraceCheckUtils]: 132: Hoare triple {27960#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27967#(<= main_~i~2 2)} is VALID [2018-11-23 12:30:53,766 INFO L273 TraceCheckUtils]: 133: Hoare triple {27967#(<= main_~i~2 2)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27967#(<= main_~i~2 2)} is VALID [2018-11-23 12:30:53,766 INFO L273 TraceCheckUtils]: 134: Hoare triple {27967#(<= main_~i~2 2)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27974#(<= main_~i~2 3)} is VALID [2018-11-23 12:30:53,767 INFO L273 TraceCheckUtils]: 135: Hoare triple {27974#(<= main_~i~2 3)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27974#(<= main_~i~2 3)} is VALID [2018-11-23 12:30:53,767 INFO L273 TraceCheckUtils]: 136: Hoare triple {27974#(<= main_~i~2 3)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27981#(<= main_~i~2 4)} is VALID [2018-11-23 12:30:53,768 INFO L273 TraceCheckUtils]: 137: Hoare triple {27981#(<= main_~i~2 4)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27981#(<= main_~i~2 4)} is VALID [2018-11-23 12:30:53,769 INFO L273 TraceCheckUtils]: 138: Hoare triple {27981#(<= main_~i~2 4)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27988#(<= main_~i~2 5)} is VALID [2018-11-23 12:30:53,770 INFO L273 TraceCheckUtils]: 139: Hoare triple {27988#(<= main_~i~2 5)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27988#(<= main_~i~2 5)} is VALID [2018-11-23 12:30:53,770 INFO L273 TraceCheckUtils]: 140: Hoare triple {27988#(<= main_~i~2 5)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27995#(<= main_~i~2 6)} is VALID [2018-11-23 12:30:53,771 INFO L273 TraceCheckUtils]: 141: Hoare triple {27995#(<= main_~i~2 6)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27995#(<= main_~i~2 6)} is VALID [2018-11-23 12:30:53,772 INFO L273 TraceCheckUtils]: 142: Hoare triple {27995#(<= main_~i~2 6)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28002#(<= main_~i~2 7)} is VALID [2018-11-23 12:30:53,772 INFO L273 TraceCheckUtils]: 143: Hoare triple {28002#(<= main_~i~2 7)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28002#(<= main_~i~2 7)} is VALID [2018-11-23 12:30:53,773 INFO L273 TraceCheckUtils]: 144: Hoare triple {28002#(<= main_~i~2 7)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28009#(<= main_~i~2 8)} is VALID [2018-11-23 12:30:53,773 INFO L273 TraceCheckUtils]: 145: Hoare triple {28009#(<= main_~i~2 8)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28009#(<= main_~i~2 8)} is VALID [2018-11-23 12:30:53,774 INFO L273 TraceCheckUtils]: 146: Hoare triple {28009#(<= main_~i~2 8)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28016#(<= main_~i~2 9)} is VALID [2018-11-23 12:30:53,775 INFO L273 TraceCheckUtils]: 147: Hoare triple {28016#(<= main_~i~2 9)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28016#(<= main_~i~2 9)} is VALID [2018-11-23 12:30:53,775 INFO L273 TraceCheckUtils]: 148: Hoare triple {28016#(<= main_~i~2 9)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28023#(<= main_~i~2 10)} is VALID [2018-11-23 12:30:53,776 INFO L273 TraceCheckUtils]: 149: Hoare triple {28023#(<= main_~i~2 10)} assume !(~i~2 < 99999); {27530#false} is VALID [2018-11-23 12:30:53,776 INFO L273 TraceCheckUtils]: 150: Hoare triple {27530#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {27530#false} is VALID [2018-11-23 12:30:53,776 INFO L256 TraceCheckUtils]: 151: Hoare triple {27530#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {27530#false} is VALID [2018-11-23 12:30:53,777 INFO L273 TraceCheckUtils]: 152: Hoare triple {27530#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {27530#false} is VALID [2018-11-23 12:30:53,777 INFO L273 TraceCheckUtils]: 153: Hoare triple {27530#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27530#false} is VALID [2018-11-23 12:30:53,777 INFO L273 TraceCheckUtils]: 154: Hoare triple {27530#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27530#false} is VALID [2018-11-23 12:30:53,777 INFO L273 TraceCheckUtils]: 155: Hoare triple {27530#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27530#false} is VALID [2018-11-23 12:30:53,777 INFO L273 TraceCheckUtils]: 156: Hoare triple {27530#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27530#false} is VALID [2018-11-23 12:30:53,777 INFO L273 TraceCheckUtils]: 157: Hoare triple {27530#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27530#false} is VALID [2018-11-23 12:30:53,778 INFO L273 TraceCheckUtils]: 158: Hoare triple {27530#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27530#false} is VALID [2018-11-23 12:30:53,778 INFO L273 TraceCheckUtils]: 159: Hoare triple {27530#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27530#false} is VALID [2018-11-23 12:30:53,778 INFO L273 TraceCheckUtils]: 160: Hoare triple {27530#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27530#false} is VALID [2018-11-23 12:30:53,778 INFO L273 TraceCheckUtils]: 161: Hoare triple {27530#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27530#false} is VALID [2018-11-23 12:30:53,778 INFO L273 TraceCheckUtils]: 162: Hoare triple {27530#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27530#false} is VALID [2018-11-23 12:30:53,778 INFO L273 TraceCheckUtils]: 163: Hoare triple {27530#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27530#false} is VALID [2018-11-23 12:30:53,778 INFO L273 TraceCheckUtils]: 164: Hoare triple {27530#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27530#false} is VALID [2018-11-23 12:30:53,779 INFO L273 TraceCheckUtils]: 165: Hoare triple {27530#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27530#false} is VALID [2018-11-23 12:30:53,779 INFO L273 TraceCheckUtils]: 166: Hoare triple {27530#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27530#false} is VALID [2018-11-23 12:30:53,779 INFO L273 TraceCheckUtils]: 167: Hoare triple {27530#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27530#false} is VALID [2018-11-23 12:30:53,779 INFO L273 TraceCheckUtils]: 168: Hoare triple {27530#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27530#false} is VALID [2018-11-23 12:30:53,779 INFO L273 TraceCheckUtils]: 169: Hoare triple {27530#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27530#false} is VALID [2018-11-23 12:30:53,779 INFO L273 TraceCheckUtils]: 170: Hoare triple {27530#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27530#false} is VALID [2018-11-23 12:30:53,779 INFO L273 TraceCheckUtils]: 171: Hoare triple {27530#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27530#false} is VALID [2018-11-23 12:30:53,779 INFO L273 TraceCheckUtils]: 172: Hoare triple {27530#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27530#false} is VALID [2018-11-23 12:30:53,779 INFO L273 TraceCheckUtils]: 173: Hoare triple {27530#false} assume !(~i~0 < 100000); {27530#false} is VALID [2018-11-23 12:30:53,779 INFO L273 TraceCheckUtils]: 174: Hoare triple {27530#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {27530#false} is VALID [2018-11-23 12:30:53,780 INFO L273 TraceCheckUtils]: 175: Hoare triple {27530#false} assume true; {27530#false} is VALID [2018-11-23 12:30:53,780 INFO L268 TraceCheckUtils]: 176: Hoare quadruple {27530#false} {27530#false} #74#return; {27530#false} is VALID [2018-11-23 12:30:53,780 INFO L273 TraceCheckUtils]: 177: Hoare triple {27530#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {27530#false} is VALID [2018-11-23 12:30:53,780 INFO L273 TraceCheckUtils]: 178: Hoare triple {27530#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {27530#false} is VALID [2018-11-23 12:30:53,780 INFO L273 TraceCheckUtils]: 179: Hoare triple {27530#false} assume !false; {27530#false} is VALID [2018-11-23 12:30:53,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2231 backedges. 450 proven. 100 refuted. 0 times theorem prover too weak. 1681 trivial. 0 not checked. [2018-11-23 12:30:53,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:30:53,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 13] total 48 [2018-11-23 12:30:53,812 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 180 [2018-11-23 12:30:53,812 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:30:53,812 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 12:30:53,952 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:30:53,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 12:30:53,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 12:30:53,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=743, Invalid=1513, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 12:30:53,954 INFO L87 Difference]: Start difference. First operand 131 states and 135 transitions. Second operand 48 states. [2018-11-23 12:30:55,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:55,251 INFO L93 Difference]: Finished difference Result 193 states and 202 transitions. [2018-11-23 12:30:55,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 12:30:55,251 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 180 [2018-11-23 12:30:55,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:30:55,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:30:55,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 145 transitions. [2018-11-23 12:30:55,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:30:55,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 145 transitions. [2018-11-23 12:30:55,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 145 transitions. [2018-11-23 12:30:55,715 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:30:55,718 INFO L225 Difference]: With dead ends: 193 [2018-11-23 12:30:55,718 INFO L226 Difference]: Without dead ends: 137 [2018-11-23 12:30:55,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=743, Invalid=1513, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 12:30:55,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-11-23 12:30:55,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2018-11-23 12:30:55,821 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:30:55,821 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand 135 states. [2018-11-23 12:30:55,821 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 135 states. [2018-11-23 12:30:55,821 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 135 states. [2018-11-23 12:30:55,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:55,824 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2018-11-23 12:30:55,824 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 141 transitions. [2018-11-23 12:30:55,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:55,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:55,824 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand 137 states. [2018-11-23 12:30:55,825 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 137 states. [2018-11-23 12:30:55,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:30:55,827 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2018-11-23 12:30:55,827 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 141 transitions. [2018-11-23 12:30:55,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:30:55,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:30:55,828 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:30:55,828 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:30:55,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-23 12:30:55,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 139 transitions. [2018-11-23 12:30:55,830 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 139 transitions. Word has length 180 [2018-11-23 12:30:55,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:30:55,830 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 139 transitions. [2018-11-23 12:30:55,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 12:30:55,831 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2018-11-23 12:30:55,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-23 12:30:55,831 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:30:55,832 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 30, 30, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:30:55,832 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:30:55,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:30:55,832 INFO L82 PathProgramCache]: Analyzing trace with hash 11282759, now seen corresponding path program 35 times [2018-11-23 12:30:55,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:30:55,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:30:55,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:55,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:30:55,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:30:55,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:30:56,676 INFO L256 TraceCheckUtils]: 0: Hoare triple {28878#true} call ULTIMATE.init(); {28878#true} is VALID [2018-11-23 12:30:56,676 INFO L273 TraceCheckUtils]: 1: Hoare triple {28878#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28878#true} is VALID [2018-11-23 12:30:56,677 INFO L273 TraceCheckUtils]: 2: Hoare triple {28878#true} assume true; {28878#true} is VALID [2018-11-23 12:30:56,677 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28878#true} {28878#true} #66#return; {28878#true} is VALID [2018-11-23 12:30:56,677 INFO L256 TraceCheckUtils]: 4: Hoare triple {28878#true} call #t~ret13 := main(); {28878#true} is VALID [2018-11-23 12:30:56,677 INFO L273 TraceCheckUtils]: 5: Hoare triple {28878#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {28880#(= main_~i~1 0)} is VALID [2018-11-23 12:30:56,678 INFO L273 TraceCheckUtils]: 6: Hoare triple {28880#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28880#(= main_~i~1 0)} is VALID [2018-11-23 12:30:56,678 INFO L273 TraceCheckUtils]: 7: Hoare triple {28880#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28881#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:56,679 INFO L273 TraceCheckUtils]: 8: Hoare triple {28881#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28881#(<= main_~i~1 1)} is VALID [2018-11-23 12:30:56,679 INFO L273 TraceCheckUtils]: 9: Hoare triple {28881#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28882#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:56,679 INFO L273 TraceCheckUtils]: 10: Hoare triple {28882#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28882#(<= main_~i~1 2)} is VALID [2018-11-23 12:30:56,680 INFO L273 TraceCheckUtils]: 11: Hoare triple {28882#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28883#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:56,680 INFO L273 TraceCheckUtils]: 12: Hoare triple {28883#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28883#(<= main_~i~1 3)} is VALID [2018-11-23 12:30:56,680 INFO L273 TraceCheckUtils]: 13: Hoare triple {28883#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28884#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:56,681 INFO L273 TraceCheckUtils]: 14: Hoare triple {28884#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28884#(<= main_~i~1 4)} is VALID [2018-11-23 12:30:56,682 INFO L273 TraceCheckUtils]: 15: Hoare triple {28884#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28885#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:56,682 INFO L273 TraceCheckUtils]: 16: Hoare triple {28885#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28885#(<= main_~i~1 5)} is VALID [2018-11-23 12:30:56,683 INFO L273 TraceCheckUtils]: 17: Hoare triple {28885#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28886#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:56,683 INFO L273 TraceCheckUtils]: 18: Hoare triple {28886#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28886#(<= main_~i~1 6)} is VALID [2018-11-23 12:30:56,684 INFO L273 TraceCheckUtils]: 19: Hoare triple {28886#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28887#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:56,685 INFO L273 TraceCheckUtils]: 20: Hoare triple {28887#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28887#(<= main_~i~1 7)} is VALID [2018-11-23 12:30:56,685 INFO L273 TraceCheckUtils]: 21: Hoare triple {28887#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28888#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:56,686 INFO L273 TraceCheckUtils]: 22: Hoare triple {28888#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28888#(<= main_~i~1 8)} is VALID [2018-11-23 12:30:56,687 INFO L273 TraceCheckUtils]: 23: Hoare triple {28888#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28889#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:56,687 INFO L273 TraceCheckUtils]: 24: Hoare triple {28889#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28889#(<= main_~i~1 9)} is VALID [2018-11-23 12:30:56,688 INFO L273 TraceCheckUtils]: 25: Hoare triple {28889#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28890#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:56,688 INFO L273 TraceCheckUtils]: 26: Hoare triple {28890#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28890#(<= main_~i~1 10)} is VALID [2018-11-23 12:30:56,689 INFO L273 TraceCheckUtils]: 27: Hoare triple {28890#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28891#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:56,690 INFO L273 TraceCheckUtils]: 28: Hoare triple {28891#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28891#(<= main_~i~1 11)} is VALID [2018-11-23 12:30:56,690 INFO L273 TraceCheckUtils]: 29: Hoare triple {28891#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28892#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:56,691 INFO L273 TraceCheckUtils]: 30: Hoare triple {28892#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28892#(<= main_~i~1 12)} is VALID [2018-11-23 12:30:56,692 INFO L273 TraceCheckUtils]: 31: Hoare triple {28892#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28893#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:56,692 INFO L273 TraceCheckUtils]: 32: Hoare triple {28893#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28893#(<= main_~i~1 13)} is VALID [2018-11-23 12:30:56,693 INFO L273 TraceCheckUtils]: 33: Hoare triple {28893#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28894#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:56,693 INFO L273 TraceCheckUtils]: 34: Hoare triple {28894#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28894#(<= main_~i~1 14)} is VALID [2018-11-23 12:30:56,694 INFO L273 TraceCheckUtils]: 35: Hoare triple {28894#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28895#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:56,695 INFO L273 TraceCheckUtils]: 36: Hoare triple {28895#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28895#(<= main_~i~1 15)} is VALID [2018-11-23 12:30:56,695 INFO L273 TraceCheckUtils]: 37: Hoare triple {28895#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28896#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:56,696 INFO L273 TraceCheckUtils]: 38: Hoare triple {28896#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28896#(<= main_~i~1 16)} is VALID [2018-11-23 12:30:56,697 INFO L273 TraceCheckUtils]: 39: Hoare triple {28896#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28897#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:56,697 INFO L273 TraceCheckUtils]: 40: Hoare triple {28897#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28897#(<= main_~i~1 17)} is VALID [2018-11-23 12:30:56,698 INFO L273 TraceCheckUtils]: 41: Hoare triple {28897#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28898#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:56,698 INFO L273 TraceCheckUtils]: 42: Hoare triple {28898#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28898#(<= main_~i~1 18)} is VALID [2018-11-23 12:30:56,699 INFO L273 TraceCheckUtils]: 43: Hoare triple {28898#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28899#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:56,700 INFO L273 TraceCheckUtils]: 44: Hoare triple {28899#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28899#(<= main_~i~1 19)} is VALID [2018-11-23 12:30:56,700 INFO L273 TraceCheckUtils]: 45: Hoare triple {28899#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28900#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:56,701 INFO L273 TraceCheckUtils]: 46: Hoare triple {28900#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28900#(<= main_~i~1 20)} is VALID [2018-11-23 12:30:56,702 INFO L273 TraceCheckUtils]: 47: Hoare triple {28900#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28901#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:56,702 INFO L273 TraceCheckUtils]: 48: Hoare triple {28901#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28901#(<= main_~i~1 21)} is VALID [2018-11-23 12:30:56,703 INFO L273 TraceCheckUtils]: 49: Hoare triple {28901#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:56,703 INFO L273 TraceCheckUtils]: 50: Hoare triple {28902#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#(<= main_~i~1 22)} is VALID [2018-11-23 12:30:56,704 INFO L273 TraceCheckUtils]: 51: Hoare triple {28902#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28903#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:56,705 INFO L273 TraceCheckUtils]: 52: Hoare triple {28903#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28903#(<= main_~i~1 23)} is VALID [2018-11-23 12:30:56,705 INFO L273 TraceCheckUtils]: 53: Hoare triple {28903#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28904#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:56,706 INFO L273 TraceCheckUtils]: 54: Hoare triple {28904#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28904#(<= main_~i~1 24)} is VALID [2018-11-23 12:30:56,707 INFO L273 TraceCheckUtils]: 55: Hoare triple {28904#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28905#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:56,707 INFO L273 TraceCheckUtils]: 56: Hoare triple {28905#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28905#(<= main_~i~1 25)} is VALID [2018-11-23 12:30:56,708 INFO L273 TraceCheckUtils]: 57: Hoare triple {28905#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28906#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:56,708 INFO L273 TraceCheckUtils]: 58: Hoare triple {28906#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28906#(<= main_~i~1 26)} is VALID [2018-11-23 12:30:56,709 INFO L273 TraceCheckUtils]: 59: Hoare triple {28906#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28907#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:56,710 INFO L273 TraceCheckUtils]: 60: Hoare triple {28907#(<= main_~i~1 27)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28907#(<= main_~i~1 27)} is VALID [2018-11-23 12:30:56,710 INFO L273 TraceCheckUtils]: 61: Hoare triple {28907#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28908#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:56,711 INFO L273 TraceCheckUtils]: 62: Hoare triple {28908#(<= main_~i~1 28)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28908#(<= main_~i~1 28)} is VALID [2018-11-23 12:30:56,712 INFO L273 TraceCheckUtils]: 63: Hoare triple {28908#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28909#(<= main_~i~1 29)} is VALID [2018-11-23 12:30:56,712 INFO L273 TraceCheckUtils]: 64: Hoare triple {28909#(<= main_~i~1 29)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28909#(<= main_~i~1 29)} is VALID [2018-11-23 12:30:56,713 INFO L273 TraceCheckUtils]: 65: Hoare triple {28909#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28910#(<= main_~i~1 30)} is VALID [2018-11-23 12:30:56,713 INFO L273 TraceCheckUtils]: 66: Hoare triple {28910#(<= main_~i~1 30)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28910#(<= main_~i~1 30)} is VALID [2018-11-23 12:30:56,714 INFO L273 TraceCheckUtils]: 67: Hoare triple {28910#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28911#(<= main_~i~1 31)} is VALID [2018-11-23 12:30:56,715 INFO L273 TraceCheckUtils]: 68: Hoare triple {28911#(<= main_~i~1 31)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28911#(<= main_~i~1 31)} is VALID [2018-11-23 12:30:56,715 INFO L273 TraceCheckUtils]: 69: Hoare triple {28911#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28912#(<= main_~i~1 32)} is VALID [2018-11-23 12:30:56,716 INFO L273 TraceCheckUtils]: 70: Hoare triple {28912#(<= main_~i~1 32)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28912#(<= main_~i~1 32)} is VALID [2018-11-23 12:30:56,716 INFO L273 TraceCheckUtils]: 71: Hoare triple {28912#(<= main_~i~1 32)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28913#(<= main_~i~1 33)} is VALID [2018-11-23 12:30:56,717 INFO L273 TraceCheckUtils]: 72: Hoare triple {28913#(<= main_~i~1 33)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28913#(<= main_~i~1 33)} is VALID [2018-11-23 12:30:56,718 INFO L273 TraceCheckUtils]: 73: Hoare triple {28913#(<= main_~i~1 33)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28914#(<= main_~i~1 34)} is VALID [2018-11-23 12:30:56,718 INFO L273 TraceCheckUtils]: 74: Hoare triple {28914#(<= main_~i~1 34)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28914#(<= main_~i~1 34)} is VALID [2018-11-23 12:30:56,719 INFO L273 TraceCheckUtils]: 75: Hoare triple {28914#(<= main_~i~1 34)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28915#(<= main_~i~1 35)} is VALID [2018-11-23 12:30:56,720 INFO L273 TraceCheckUtils]: 76: Hoare triple {28915#(<= main_~i~1 35)} assume !(~i~1 < 100000); {28879#false} is VALID [2018-11-23 12:30:56,720 INFO L256 TraceCheckUtils]: 77: Hoare triple {28879#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {28878#true} is VALID [2018-11-23 12:30:56,720 INFO L273 TraceCheckUtils]: 78: Hoare triple {28878#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {28878#true} is VALID [2018-11-23 12:30:56,720 INFO L273 TraceCheckUtils]: 79: Hoare triple {28878#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28878#true} is VALID [2018-11-23 12:30:56,720 INFO L273 TraceCheckUtils]: 80: Hoare triple {28878#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28878#true} is VALID [2018-11-23 12:30:56,721 INFO L273 TraceCheckUtils]: 81: Hoare triple {28878#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28878#true} is VALID [2018-11-23 12:30:56,721 INFO L273 TraceCheckUtils]: 82: Hoare triple {28878#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28878#true} is VALID [2018-11-23 12:30:56,721 INFO L273 TraceCheckUtils]: 83: Hoare triple {28878#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28878#true} is VALID [2018-11-23 12:30:56,721 INFO L273 TraceCheckUtils]: 84: Hoare triple {28878#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28878#true} is VALID [2018-11-23 12:30:56,721 INFO L273 TraceCheckUtils]: 85: Hoare triple {28878#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28878#true} is VALID [2018-11-23 12:30:56,721 INFO L273 TraceCheckUtils]: 86: Hoare triple {28878#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28878#true} is VALID [2018-11-23 12:30:56,722 INFO L273 TraceCheckUtils]: 87: Hoare triple {28878#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28878#true} is VALID [2018-11-23 12:30:56,722 INFO L273 TraceCheckUtils]: 88: Hoare triple {28878#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28878#true} is VALID [2018-11-23 12:30:56,722 INFO L273 TraceCheckUtils]: 89: Hoare triple {28878#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28878#true} is VALID [2018-11-23 12:30:56,722 INFO L273 TraceCheckUtils]: 90: Hoare triple {28878#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28878#true} is VALID [2018-11-23 12:30:56,722 INFO L273 TraceCheckUtils]: 91: Hoare triple {28878#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28878#true} is VALID [2018-11-23 12:30:56,723 INFO L273 TraceCheckUtils]: 92: Hoare triple {28878#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28878#true} is VALID [2018-11-23 12:30:56,723 INFO L273 TraceCheckUtils]: 93: Hoare triple {28878#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28878#true} is VALID [2018-11-23 12:30:56,723 INFO L273 TraceCheckUtils]: 94: Hoare triple {28878#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28878#true} is VALID [2018-11-23 12:30:56,723 INFO L273 TraceCheckUtils]: 95: Hoare triple {28878#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28878#true} is VALID [2018-11-23 12:30:56,723 INFO L273 TraceCheckUtils]: 96: Hoare triple {28878#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28878#true} is VALID [2018-11-23 12:30:56,723 INFO L273 TraceCheckUtils]: 97: Hoare triple {28878#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28878#true} is VALID [2018-11-23 12:30:56,723 INFO L273 TraceCheckUtils]: 98: Hoare triple {28878#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28878#true} is VALID [2018-11-23 12:30:56,723 INFO L273 TraceCheckUtils]: 99: Hoare triple {28878#true} assume !(~i~0 < 100000); {28878#true} is VALID [2018-11-23 12:30:56,723 INFO L273 TraceCheckUtils]: 100: Hoare triple {28878#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {28878#true} is VALID [2018-11-23 12:30:56,724 INFO L273 TraceCheckUtils]: 101: Hoare triple {28878#true} assume true; {28878#true} is VALID [2018-11-23 12:30:56,724 INFO L268 TraceCheckUtils]: 102: Hoare quadruple {28878#true} {28879#false} #70#return; {28879#false} is VALID [2018-11-23 12:30:56,724 INFO L273 TraceCheckUtils]: 103: Hoare triple {28879#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {28879#false} is VALID [2018-11-23 12:30:56,724 INFO L256 TraceCheckUtils]: 104: Hoare triple {28879#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {28878#true} is VALID [2018-11-23 12:30:56,724 INFO L273 TraceCheckUtils]: 105: Hoare triple {28878#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {28878#true} is VALID [2018-11-23 12:30:56,724 INFO L273 TraceCheckUtils]: 106: Hoare triple {28878#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28878#true} is VALID [2018-11-23 12:30:56,724 INFO L273 TraceCheckUtils]: 107: Hoare triple {28878#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28878#true} is VALID [2018-11-23 12:30:56,724 INFO L273 TraceCheckUtils]: 108: Hoare triple {28878#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28878#true} is VALID [2018-11-23 12:30:56,724 INFO L273 TraceCheckUtils]: 109: Hoare triple {28878#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28878#true} is VALID [2018-11-23 12:30:56,725 INFO L273 TraceCheckUtils]: 110: Hoare triple {28878#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28878#true} is VALID [2018-11-23 12:30:56,725 INFO L273 TraceCheckUtils]: 111: Hoare triple {28878#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28878#true} is VALID [2018-11-23 12:30:56,725 INFO L273 TraceCheckUtils]: 112: Hoare triple {28878#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28878#true} is VALID [2018-11-23 12:30:56,725 INFO L273 TraceCheckUtils]: 113: Hoare triple {28878#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28878#true} is VALID [2018-11-23 12:30:56,725 INFO L273 TraceCheckUtils]: 114: Hoare triple {28878#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28878#true} is VALID [2018-11-23 12:30:56,725 INFO L273 TraceCheckUtils]: 115: Hoare triple {28878#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28878#true} is VALID [2018-11-23 12:30:56,725 INFO L273 TraceCheckUtils]: 116: Hoare triple {28878#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28878#true} is VALID [2018-11-23 12:30:56,725 INFO L273 TraceCheckUtils]: 117: Hoare triple {28878#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28878#true} is VALID [2018-11-23 12:30:56,725 INFO L273 TraceCheckUtils]: 118: Hoare triple {28878#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28878#true} is VALID [2018-11-23 12:30:56,725 INFO L273 TraceCheckUtils]: 119: Hoare triple {28878#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28878#true} is VALID [2018-11-23 12:30:56,726 INFO L273 TraceCheckUtils]: 120: Hoare triple {28878#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28878#true} is VALID [2018-11-23 12:30:56,726 INFO L273 TraceCheckUtils]: 121: Hoare triple {28878#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28878#true} is VALID [2018-11-23 12:30:56,726 INFO L273 TraceCheckUtils]: 122: Hoare triple {28878#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28878#true} is VALID [2018-11-23 12:30:56,726 INFO L273 TraceCheckUtils]: 123: Hoare triple {28878#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28878#true} is VALID [2018-11-23 12:30:56,726 INFO L273 TraceCheckUtils]: 124: Hoare triple {28878#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28878#true} is VALID [2018-11-23 12:30:56,726 INFO L273 TraceCheckUtils]: 125: Hoare triple {28878#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28878#true} is VALID [2018-11-23 12:30:56,726 INFO L273 TraceCheckUtils]: 126: Hoare triple {28878#true} assume !(~i~0 < 100000); {28878#true} is VALID [2018-11-23 12:30:56,726 INFO L273 TraceCheckUtils]: 127: Hoare triple {28878#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {28878#true} is VALID [2018-11-23 12:30:56,726 INFO L273 TraceCheckUtils]: 128: Hoare triple {28878#true} assume true; {28878#true} is VALID [2018-11-23 12:30:56,726 INFO L268 TraceCheckUtils]: 129: Hoare quadruple {28878#true} {28879#false} #72#return; {28879#false} is VALID [2018-11-23 12:30:56,727 INFO L273 TraceCheckUtils]: 130: Hoare triple {28879#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {28879#false} is VALID [2018-11-23 12:30:56,727 INFO L273 TraceCheckUtils]: 131: Hoare triple {28879#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28879#false} is VALID [2018-11-23 12:30:56,727 INFO L273 TraceCheckUtils]: 132: Hoare triple {28879#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28879#false} is VALID [2018-11-23 12:30:56,727 INFO L273 TraceCheckUtils]: 133: Hoare triple {28879#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28879#false} is VALID [2018-11-23 12:30:56,727 INFO L273 TraceCheckUtils]: 134: Hoare triple {28879#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28879#false} is VALID [2018-11-23 12:30:56,727 INFO L273 TraceCheckUtils]: 135: Hoare triple {28879#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28879#false} is VALID [2018-11-23 12:30:56,727 INFO L273 TraceCheckUtils]: 136: Hoare triple {28879#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28879#false} is VALID [2018-11-23 12:30:56,727 INFO L273 TraceCheckUtils]: 137: Hoare triple {28879#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28879#false} is VALID [2018-11-23 12:30:56,727 INFO L273 TraceCheckUtils]: 138: Hoare triple {28879#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28879#false} is VALID [2018-11-23 12:30:56,728 INFO L273 TraceCheckUtils]: 139: Hoare triple {28879#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28879#false} is VALID [2018-11-23 12:30:56,728 INFO L273 TraceCheckUtils]: 140: Hoare triple {28879#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28879#false} is VALID [2018-11-23 12:30:56,728 INFO L273 TraceCheckUtils]: 141: Hoare triple {28879#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28879#false} is VALID [2018-11-23 12:30:56,728 INFO L273 TraceCheckUtils]: 142: Hoare triple {28879#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28879#false} is VALID [2018-11-23 12:30:56,728 INFO L273 TraceCheckUtils]: 143: Hoare triple {28879#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28879#false} is VALID [2018-11-23 12:30:56,728 INFO L273 TraceCheckUtils]: 144: Hoare triple {28879#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28879#false} is VALID [2018-11-23 12:30:56,728 INFO L273 TraceCheckUtils]: 145: Hoare triple {28879#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28879#false} is VALID [2018-11-23 12:30:56,728 INFO L273 TraceCheckUtils]: 146: Hoare triple {28879#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28879#false} is VALID [2018-11-23 12:30:56,728 INFO L273 TraceCheckUtils]: 147: Hoare triple {28879#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28879#false} is VALID [2018-11-23 12:30:56,728 INFO L273 TraceCheckUtils]: 148: Hoare triple {28879#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28879#false} is VALID [2018-11-23 12:30:56,729 INFO L273 TraceCheckUtils]: 149: Hoare triple {28879#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28879#false} is VALID [2018-11-23 12:30:56,729 INFO L273 TraceCheckUtils]: 150: Hoare triple {28879#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28879#false} is VALID [2018-11-23 12:30:56,729 INFO L273 TraceCheckUtils]: 151: Hoare triple {28879#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28879#false} is VALID [2018-11-23 12:30:56,729 INFO L273 TraceCheckUtils]: 152: Hoare triple {28879#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28879#false} is VALID [2018-11-23 12:30:56,729 INFO L273 TraceCheckUtils]: 153: Hoare triple {28879#false} assume !(~i~2 < 99999); {28879#false} is VALID [2018-11-23 12:30:56,729 INFO L273 TraceCheckUtils]: 154: Hoare triple {28879#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {28879#false} is VALID [2018-11-23 12:30:56,729 INFO L256 TraceCheckUtils]: 155: Hoare triple {28879#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {28878#true} is VALID [2018-11-23 12:30:56,729 INFO L273 TraceCheckUtils]: 156: Hoare triple {28878#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {28878#true} is VALID [2018-11-23 12:30:56,729 INFO L273 TraceCheckUtils]: 157: Hoare triple {28878#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28878#true} is VALID [2018-11-23 12:30:56,729 INFO L273 TraceCheckUtils]: 158: Hoare triple {28878#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28878#true} is VALID [2018-11-23 12:30:56,730 INFO L273 TraceCheckUtils]: 159: Hoare triple {28878#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28878#true} is VALID [2018-11-23 12:30:56,730 INFO L273 TraceCheckUtils]: 160: Hoare triple {28878#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28878#true} is VALID [2018-11-23 12:30:56,730 INFO L273 TraceCheckUtils]: 161: Hoare triple {28878#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28878#true} is VALID [2018-11-23 12:30:56,730 INFO L273 TraceCheckUtils]: 162: Hoare triple {28878#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28878#true} is VALID [2018-11-23 12:30:56,730 INFO L273 TraceCheckUtils]: 163: Hoare triple {28878#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28878#true} is VALID [2018-11-23 12:30:56,730 INFO L273 TraceCheckUtils]: 164: Hoare triple {28878#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28878#true} is VALID [2018-11-23 12:30:56,730 INFO L273 TraceCheckUtils]: 165: Hoare triple {28878#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28878#true} is VALID [2018-11-23 12:30:56,730 INFO L273 TraceCheckUtils]: 166: Hoare triple {28878#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28878#true} is VALID [2018-11-23 12:30:56,730 INFO L273 TraceCheckUtils]: 167: Hoare triple {28878#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28878#true} is VALID [2018-11-23 12:30:56,730 INFO L273 TraceCheckUtils]: 168: Hoare triple {28878#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28878#true} is VALID [2018-11-23 12:30:56,731 INFO L273 TraceCheckUtils]: 169: Hoare triple {28878#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28878#true} is VALID [2018-11-23 12:30:56,731 INFO L273 TraceCheckUtils]: 170: Hoare triple {28878#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28878#true} is VALID [2018-11-23 12:30:56,731 INFO L273 TraceCheckUtils]: 171: Hoare triple {28878#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28878#true} is VALID [2018-11-23 12:30:56,731 INFO L273 TraceCheckUtils]: 172: Hoare triple {28878#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28878#true} is VALID [2018-11-23 12:30:56,731 INFO L273 TraceCheckUtils]: 173: Hoare triple {28878#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28878#true} is VALID [2018-11-23 12:30:56,731 INFO L273 TraceCheckUtils]: 174: Hoare triple {28878#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28878#true} is VALID [2018-11-23 12:30:56,731 INFO L273 TraceCheckUtils]: 175: Hoare triple {28878#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28878#true} is VALID [2018-11-23 12:30:56,731 INFO L273 TraceCheckUtils]: 176: Hoare triple {28878#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28878#true} is VALID [2018-11-23 12:30:56,731 INFO L273 TraceCheckUtils]: 177: Hoare triple {28878#true} assume !(~i~0 < 100000); {28878#true} is VALID [2018-11-23 12:30:56,732 INFO L273 TraceCheckUtils]: 178: Hoare triple {28878#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {28878#true} is VALID [2018-11-23 12:30:56,732 INFO L273 TraceCheckUtils]: 179: Hoare triple {28878#true} assume true; {28878#true} is VALID [2018-11-23 12:30:56,732 INFO L268 TraceCheckUtils]: 180: Hoare quadruple {28878#true} {28879#false} #74#return; {28879#false} is VALID [2018-11-23 12:30:56,732 INFO L273 TraceCheckUtils]: 181: Hoare triple {28879#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {28879#false} is VALID [2018-11-23 12:30:56,732 INFO L273 TraceCheckUtils]: 182: Hoare triple {28879#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {28879#false} is VALID [2018-11-23 12:30:56,732 INFO L273 TraceCheckUtils]: 183: Hoare triple {28879#false} assume !false; {28879#false} is VALID [2018-11-23 12:30:56,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2321 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1096 trivial. 0 not checked. [2018-11-23 12:30:56,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:30:56,747 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 12:30:56,756 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:31:39,025 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 35 check-sat command(s) [2018-11-23 12:31:39,025 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:31:39,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:31:39,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:31:39,575 INFO L256 TraceCheckUtils]: 0: Hoare triple {28878#true} call ULTIMATE.init(); {28878#true} is VALID [2018-11-23 12:31:39,576 INFO L273 TraceCheckUtils]: 1: Hoare triple {28878#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28878#true} is VALID [2018-11-23 12:31:39,576 INFO L273 TraceCheckUtils]: 2: Hoare triple {28878#true} assume true; {28878#true} is VALID [2018-11-23 12:31:39,576 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28878#true} {28878#true} #66#return; {28878#true} is VALID [2018-11-23 12:31:39,576 INFO L256 TraceCheckUtils]: 4: Hoare triple {28878#true} call #t~ret13 := main(); {28878#true} is VALID [2018-11-23 12:31:39,576 INFO L273 TraceCheckUtils]: 5: Hoare triple {28878#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {28878#true} is VALID [2018-11-23 12:31:39,577 INFO L273 TraceCheckUtils]: 6: Hoare triple {28878#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28878#true} is VALID [2018-11-23 12:31:39,577 INFO L273 TraceCheckUtils]: 7: Hoare triple {28878#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28878#true} is VALID [2018-11-23 12:31:39,577 INFO L273 TraceCheckUtils]: 8: Hoare triple {28878#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28878#true} is VALID [2018-11-23 12:31:39,577 INFO L273 TraceCheckUtils]: 9: Hoare triple {28878#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28878#true} is VALID [2018-11-23 12:31:39,577 INFO L273 TraceCheckUtils]: 10: Hoare triple {28878#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28878#true} is VALID [2018-11-23 12:31:39,578 INFO L273 TraceCheckUtils]: 11: Hoare triple {28878#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28878#true} is VALID [2018-11-23 12:31:39,578 INFO L273 TraceCheckUtils]: 12: Hoare triple {28878#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28878#true} is VALID [2018-11-23 12:31:39,578 INFO L273 TraceCheckUtils]: 13: Hoare triple {28878#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28878#true} is VALID [2018-11-23 12:31:39,578 INFO L273 TraceCheckUtils]: 14: Hoare triple {28878#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28878#true} is VALID [2018-11-23 12:31:39,578 INFO L273 TraceCheckUtils]: 15: Hoare triple {28878#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28878#true} is VALID [2018-11-23 12:31:39,578 INFO L273 TraceCheckUtils]: 16: Hoare triple {28878#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28878#true} is VALID [2018-11-23 12:31:39,578 INFO L273 TraceCheckUtils]: 17: Hoare triple {28878#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28878#true} is VALID [2018-11-23 12:31:39,578 INFO L273 TraceCheckUtils]: 18: Hoare triple {28878#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28878#true} is VALID [2018-11-23 12:31:39,578 INFO L273 TraceCheckUtils]: 19: Hoare triple {28878#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28878#true} is VALID [2018-11-23 12:31:39,579 INFO L273 TraceCheckUtils]: 20: Hoare triple {28878#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28878#true} is VALID [2018-11-23 12:31:39,579 INFO L273 TraceCheckUtils]: 21: Hoare triple {28878#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28878#true} is VALID [2018-11-23 12:31:39,579 INFO L273 TraceCheckUtils]: 22: Hoare triple {28878#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28878#true} is VALID [2018-11-23 12:31:39,579 INFO L273 TraceCheckUtils]: 23: Hoare triple {28878#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28878#true} is VALID [2018-11-23 12:31:39,579 INFO L273 TraceCheckUtils]: 24: Hoare triple {28878#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28878#true} is VALID [2018-11-23 12:31:39,579 INFO L273 TraceCheckUtils]: 25: Hoare triple {28878#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28878#true} is VALID [2018-11-23 12:31:39,579 INFO L273 TraceCheckUtils]: 26: Hoare triple {28878#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28878#true} is VALID [2018-11-23 12:31:39,579 INFO L273 TraceCheckUtils]: 27: Hoare triple {28878#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28878#true} is VALID [2018-11-23 12:31:39,579 INFO L273 TraceCheckUtils]: 28: Hoare triple {28878#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28878#true} is VALID [2018-11-23 12:31:39,579 INFO L273 TraceCheckUtils]: 29: Hoare triple {28878#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28878#true} is VALID [2018-11-23 12:31:39,580 INFO L273 TraceCheckUtils]: 30: Hoare triple {28878#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28878#true} is VALID [2018-11-23 12:31:39,580 INFO L273 TraceCheckUtils]: 31: Hoare triple {28878#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28878#true} is VALID [2018-11-23 12:31:39,580 INFO L273 TraceCheckUtils]: 32: Hoare triple {28878#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28878#true} is VALID [2018-11-23 12:31:39,580 INFO L273 TraceCheckUtils]: 33: Hoare triple {28878#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28878#true} is VALID [2018-11-23 12:31:39,580 INFO L273 TraceCheckUtils]: 34: Hoare triple {28878#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28878#true} is VALID [2018-11-23 12:31:39,580 INFO L273 TraceCheckUtils]: 35: Hoare triple {28878#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28878#true} is VALID [2018-11-23 12:31:39,580 INFO L273 TraceCheckUtils]: 36: Hoare triple {28878#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28878#true} is VALID [2018-11-23 12:31:39,580 INFO L273 TraceCheckUtils]: 37: Hoare triple {28878#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28878#true} is VALID [2018-11-23 12:31:39,580 INFO L273 TraceCheckUtils]: 38: Hoare triple {28878#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28878#true} is VALID [2018-11-23 12:31:39,580 INFO L273 TraceCheckUtils]: 39: Hoare triple {28878#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28878#true} is VALID [2018-11-23 12:31:39,581 INFO L273 TraceCheckUtils]: 40: Hoare triple {28878#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28878#true} is VALID [2018-11-23 12:31:39,581 INFO L273 TraceCheckUtils]: 41: Hoare triple {28878#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28878#true} is VALID [2018-11-23 12:31:39,581 INFO L273 TraceCheckUtils]: 42: Hoare triple {28878#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28878#true} is VALID [2018-11-23 12:31:39,581 INFO L273 TraceCheckUtils]: 43: Hoare triple {28878#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28878#true} is VALID [2018-11-23 12:31:39,581 INFO L273 TraceCheckUtils]: 44: Hoare triple {28878#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28878#true} is VALID [2018-11-23 12:31:39,581 INFO L273 TraceCheckUtils]: 45: Hoare triple {28878#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28878#true} is VALID [2018-11-23 12:31:39,581 INFO L273 TraceCheckUtils]: 46: Hoare triple {28878#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28878#true} is VALID [2018-11-23 12:31:39,581 INFO L273 TraceCheckUtils]: 47: Hoare triple {28878#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28878#true} is VALID [2018-11-23 12:31:39,581 INFO L273 TraceCheckUtils]: 48: Hoare triple {28878#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28878#true} is VALID [2018-11-23 12:31:39,581 INFO L273 TraceCheckUtils]: 49: Hoare triple {28878#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28878#true} is VALID [2018-11-23 12:31:39,582 INFO L273 TraceCheckUtils]: 50: Hoare triple {28878#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28878#true} is VALID [2018-11-23 12:31:39,582 INFO L273 TraceCheckUtils]: 51: Hoare triple {28878#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28878#true} is VALID [2018-11-23 12:31:39,582 INFO L273 TraceCheckUtils]: 52: Hoare triple {28878#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28878#true} is VALID [2018-11-23 12:31:39,582 INFO L273 TraceCheckUtils]: 53: Hoare triple {28878#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28878#true} is VALID [2018-11-23 12:31:39,582 INFO L273 TraceCheckUtils]: 54: Hoare triple {28878#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28878#true} is VALID [2018-11-23 12:31:39,582 INFO L273 TraceCheckUtils]: 55: Hoare triple {28878#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28878#true} is VALID [2018-11-23 12:31:39,582 INFO L273 TraceCheckUtils]: 56: Hoare triple {28878#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28878#true} is VALID [2018-11-23 12:31:39,582 INFO L273 TraceCheckUtils]: 57: Hoare triple {28878#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28878#true} is VALID [2018-11-23 12:31:39,582 INFO L273 TraceCheckUtils]: 58: Hoare triple {28878#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28878#true} is VALID [2018-11-23 12:31:39,583 INFO L273 TraceCheckUtils]: 59: Hoare triple {28878#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28878#true} is VALID [2018-11-23 12:31:39,583 INFO L273 TraceCheckUtils]: 60: Hoare triple {28878#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28878#true} is VALID [2018-11-23 12:31:39,583 INFO L273 TraceCheckUtils]: 61: Hoare triple {28878#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28878#true} is VALID [2018-11-23 12:31:39,583 INFO L273 TraceCheckUtils]: 62: Hoare triple {28878#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28878#true} is VALID [2018-11-23 12:31:39,583 INFO L273 TraceCheckUtils]: 63: Hoare triple {28878#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28878#true} is VALID [2018-11-23 12:31:39,583 INFO L273 TraceCheckUtils]: 64: Hoare triple {28878#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28878#true} is VALID [2018-11-23 12:31:39,583 INFO L273 TraceCheckUtils]: 65: Hoare triple {28878#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28878#true} is VALID [2018-11-23 12:31:39,583 INFO L273 TraceCheckUtils]: 66: Hoare triple {28878#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28878#true} is VALID [2018-11-23 12:31:39,583 INFO L273 TraceCheckUtils]: 67: Hoare triple {28878#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28878#true} is VALID [2018-11-23 12:31:39,583 INFO L273 TraceCheckUtils]: 68: Hoare triple {28878#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28878#true} is VALID [2018-11-23 12:31:39,584 INFO L273 TraceCheckUtils]: 69: Hoare triple {28878#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28878#true} is VALID [2018-11-23 12:31:39,584 INFO L273 TraceCheckUtils]: 70: Hoare triple {28878#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28878#true} is VALID [2018-11-23 12:31:39,584 INFO L273 TraceCheckUtils]: 71: Hoare triple {28878#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28878#true} is VALID [2018-11-23 12:31:39,584 INFO L273 TraceCheckUtils]: 72: Hoare triple {28878#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28878#true} is VALID [2018-11-23 12:31:39,584 INFO L273 TraceCheckUtils]: 73: Hoare triple {28878#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28878#true} is VALID [2018-11-23 12:31:39,584 INFO L273 TraceCheckUtils]: 74: Hoare triple {28878#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28878#true} is VALID [2018-11-23 12:31:39,584 INFO L273 TraceCheckUtils]: 75: Hoare triple {28878#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28878#true} is VALID [2018-11-23 12:31:39,584 INFO L273 TraceCheckUtils]: 76: Hoare triple {28878#true} assume !(~i~1 < 100000); {28878#true} is VALID [2018-11-23 12:31:39,584 INFO L256 TraceCheckUtils]: 77: Hoare triple {28878#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {28878#true} is VALID [2018-11-23 12:31:39,585 INFO L273 TraceCheckUtils]: 78: Hoare triple {28878#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {29153#(<= xor_~i~0 1)} is VALID [2018-11-23 12:31:39,585 INFO L273 TraceCheckUtils]: 79: Hoare triple {29153#(<= xor_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29153#(<= xor_~i~0 1)} is VALID [2018-11-23 12:31:39,586 INFO L273 TraceCheckUtils]: 80: Hoare triple {29153#(<= xor_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29160#(<= xor_~i~0 2)} is VALID [2018-11-23 12:31:39,586 INFO L273 TraceCheckUtils]: 81: Hoare triple {29160#(<= xor_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29160#(<= xor_~i~0 2)} is VALID [2018-11-23 12:31:39,586 INFO L273 TraceCheckUtils]: 82: Hoare triple {29160#(<= xor_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29167#(<= xor_~i~0 3)} is VALID [2018-11-23 12:31:39,587 INFO L273 TraceCheckUtils]: 83: Hoare triple {29167#(<= xor_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29167#(<= xor_~i~0 3)} is VALID [2018-11-23 12:31:39,587 INFO L273 TraceCheckUtils]: 84: Hoare triple {29167#(<= xor_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29174#(<= xor_~i~0 4)} is VALID [2018-11-23 12:31:39,587 INFO L273 TraceCheckUtils]: 85: Hoare triple {29174#(<= xor_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29174#(<= xor_~i~0 4)} is VALID [2018-11-23 12:31:39,588 INFO L273 TraceCheckUtils]: 86: Hoare triple {29174#(<= xor_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29181#(<= xor_~i~0 5)} is VALID [2018-11-23 12:31:39,588 INFO L273 TraceCheckUtils]: 87: Hoare triple {29181#(<= xor_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29181#(<= xor_~i~0 5)} is VALID [2018-11-23 12:31:39,589 INFO L273 TraceCheckUtils]: 88: Hoare triple {29181#(<= xor_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29188#(<= xor_~i~0 6)} is VALID [2018-11-23 12:31:39,589 INFO L273 TraceCheckUtils]: 89: Hoare triple {29188#(<= xor_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29188#(<= xor_~i~0 6)} is VALID [2018-11-23 12:31:39,590 INFO L273 TraceCheckUtils]: 90: Hoare triple {29188#(<= xor_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29195#(<= xor_~i~0 7)} is VALID [2018-11-23 12:31:39,591 INFO L273 TraceCheckUtils]: 91: Hoare triple {29195#(<= xor_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29195#(<= xor_~i~0 7)} is VALID [2018-11-23 12:31:39,591 INFO L273 TraceCheckUtils]: 92: Hoare triple {29195#(<= xor_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29202#(<= xor_~i~0 8)} is VALID [2018-11-23 12:31:39,592 INFO L273 TraceCheckUtils]: 93: Hoare triple {29202#(<= xor_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29202#(<= xor_~i~0 8)} is VALID [2018-11-23 12:31:39,593 INFO L273 TraceCheckUtils]: 94: Hoare triple {29202#(<= xor_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29209#(<= xor_~i~0 9)} is VALID [2018-11-23 12:31:39,593 INFO L273 TraceCheckUtils]: 95: Hoare triple {29209#(<= xor_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29209#(<= xor_~i~0 9)} is VALID [2018-11-23 12:31:39,594 INFO L273 TraceCheckUtils]: 96: Hoare triple {29209#(<= xor_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29216#(<= xor_~i~0 10)} is VALID [2018-11-23 12:31:39,594 INFO L273 TraceCheckUtils]: 97: Hoare triple {29216#(<= xor_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {29216#(<= xor_~i~0 10)} is VALID [2018-11-23 12:31:39,595 INFO L273 TraceCheckUtils]: 98: Hoare triple {29216#(<= xor_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29223#(<= xor_~i~0 11)} is VALID [2018-11-23 12:31:39,596 INFO L273 TraceCheckUtils]: 99: Hoare triple {29223#(<= xor_~i~0 11)} assume !(~i~0 < 100000); {28879#false} is VALID [2018-11-23 12:31:39,596 INFO L273 TraceCheckUtils]: 100: Hoare triple {28879#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {28879#false} is VALID [2018-11-23 12:31:39,596 INFO L273 TraceCheckUtils]: 101: Hoare triple {28879#false} assume true; {28879#false} is VALID [2018-11-23 12:31:39,596 INFO L268 TraceCheckUtils]: 102: Hoare quadruple {28879#false} {28878#true} #70#return; {28879#false} is VALID [2018-11-23 12:31:39,596 INFO L273 TraceCheckUtils]: 103: Hoare triple {28879#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {28879#false} is VALID [2018-11-23 12:31:39,597 INFO L256 TraceCheckUtils]: 104: Hoare triple {28879#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {28879#false} is VALID [2018-11-23 12:31:39,597 INFO L273 TraceCheckUtils]: 105: Hoare triple {28879#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {28879#false} is VALID [2018-11-23 12:31:39,597 INFO L273 TraceCheckUtils]: 106: Hoare triple {28879#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28879#false} is VALID [2018-11-23 12:31:39,597 INFO L273 TraceCheckUtils]: 107: Hoare triple {28879#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28879#false} is VALID [2018-11-23 12:31:39,597 INFO L273 TraceCheckUtils]: 108: Hoare triple {28879#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28879#false} is VALID [2018-11-23 12:31:39,598 INFO L273 TraceCheckUtils]: 109: Hoare triple {28879#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28879#false} is VALID [2018-11-23 12:31:39,598 INFO L273 TraceCheckUtils]: 110: Hoare triple {28879#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28879#false} is VALID [2018-11-23 12:31:39,598 INFO L273 TraceCheckUtils]: 111: Hoare triple {28879#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28879#false} is VALID [2018-11-23 12:31:39,598 INFO L273 TraceCheckUtils]: 112: Hoare triple {28879#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28879#false} is VALID [2018-11-23 12:31:39,598 INFO L273 TraceCheckUtils]: 113: Hoare triple {28879#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28879#false} is VALID [2018-11-23 12:31:39,598 INFO L273 TraceCheckUtils]: 114: Hoare triple {28879#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28879#false} is VALID [2018-11-23 12:31:39,599 INFO L273 TraceCheckUtils]: 115: Hoare triple {28879#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28879#false} is VALID [2018-11-23 12:31:39,599 INFO L273 TraceCheckUtils]: 116: Hoare triple {28879#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28879#false} is VALID [2018-11-23 12:31:39,599 INFO L273 TraceCheckUtils]: 117: Hoare triple {28879#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28879#false} is VALID [2018-11-23 12:31:39,599 INFO L273 TraceCheckUtils]: 118: Hoare triple {28879#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28879#false} is VALID [2018-11-23 12:31:39,599 INFO L273 TraceCheckUtils]: 119: Hoare triple {28879#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28879#false} is VALID [2018-11-23 12:31:39,599 INFO L273 TraceCheckUtils]: 120: Hoare triple {28879#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28879#false} is VALID [2018-11-23 12:31:39,599 INFO L273 TraceCheckUtils]: 121: Hoare triple {28879#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28879#false} is VALID [2018-11-23 12:31:39,599 INFO L273 TraceCheckUtils]: 122: Hoare triple {28879#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28879#false} is VALID [2018-11-23 12:31:39,599 INFO L273 TraceCheckUtils]: 123: Hoare triple {28879#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28879#false} is VALID [2018-11-23 12:31:39,600 INFO L273 TraceCheckUtils]: 124: Hoare triple {28879#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28879#false} is VALID [2018-11-23 12:31:39,600 INFO L273 TraceCheckUtils]: 125: Hoare triple {28879#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28879#false} is VALID [2018-11-23 12:31:39,600 INFO L273 TraceCheckUtils]: 126: Hoare triple {28879#false} assume !(~i~0 < 100000); {28879#false} is VALID [2018-11-23 12:31:39,600 INFO L273 TraceCheckUtils]: 127: Hoare triple {28879#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {28879#false} is VALID [2018-11-23 12:31:39,600 INFO L273 TraceCheckUtils]: 128: Hoare triple {28879#false} assume true; {28879#false} is VALID [2018-11-23 12:31:39,600 INFO L268 TraceCheckUtils]: 129: Hoare quadruple {28879#false} {28879#false} #72#return; {28879#false} is VALID [2018-11-23 12:31:39,600 INFO L273 TraceCheckUtils]: 130: Hoare triple {28879#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {28879#false} is VALID [2018-11-23 12:31:39,600 INFO L273 TraceCheckUtils]: 131: Hoare triple {28879#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28879#false} is VALID [2018-11-23 12:31:39,600 INFO L273 TraceCheckUtils]: 132: Hoare triple {28879#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28879#false} is VALID [2018-11-23 12:31:39,600 INFO L273 TraceCheckUtils]: 133: Hoare triple {28879#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28879#false} is VALID [2018-11-23 12:31:39,601 INFO L273 TraceCheckUtils]: 134: Hoare triple {28879#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28879#false} is VALID [2018-11-23 12:31:39,601 INFO L273 TraceCheckUtils]: 135: Hoare triple {28879#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28879#false} is VALID [2018-11-23 12:31:39,601 INFO L273 TraceCheckUtils]: 136: Hoare triple {28879#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28879#false} is VALID [2018-11-23 12:31:39,601 INFO L273 TraceCheckUtils]: 137: Hoare triple {28879#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28879#false} is VALID [2018-11-23 12:31:39,601 INFO L273 TraceCheckUtils]: 138: Hoare triple {28879#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28879#false} is VALID [2018-11-23 12:31:39,601 INFO L273 TraceCheckUtils]: 139: Hoare triple {28879#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28879#false} is VALID [2018-11-23 12:31:39,601 INFO L273 TraceCheckUtils]: 140: Hoare triple {28879#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28879#false} is VALID [2018-11-23 12:31:39,601 INFO L273 TraceCheckUtils]: 141: Hoare triple {28879#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28879#false} is VALID [2018-11-23 12:31:39,601 INFO L273 TraceCheckUtils]: 142: Hoare triple {28879#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28879#false} is VALID [2018-11-23 12:31:39,602 INFO L273 TraceCheckUtils]: 143: Hoare triple {28879#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28879#false} is VALID [2018-11-23 12:31:39,602 INFO L273 TraceCheckUtils]: 144: Hoare triple {28879#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28879#false} is VALID [2018-11-23 12:31:39,602 INFO L273 TraceCheckUtils]: 145: Hoare triple {28879#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28879#false} is VALID [2018-11-23 12:31:39,602 INFO L273 TraceCheckUtils]: 146: Hoare triple {28879#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28879#false} is VALID [2018-11-23 12:31:39,602 INFO L273 TraceCheckUtils]: 147: Hoare triple {28879#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28879#false} is VALID [2018-11-23 12:31:39,602 INFO L273 TraceCheckUtils]: 148: Hoare triple {28879#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28879#false} is VALID [2018-11-23 12:31:39,602 INFO L273 TraceCheckUtils]: 149: Hoare triple {28879#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28879#false} is VALID [2018-11-23 12:31:39,602 INFO L273 TraceCheckUtils]: 150: Hoare triple {28879#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28879#false} is VALID [2018-11-23 12:31:39,602 INFO L273 TraceCheckUtils]: 151: Hoare triple {28879#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28879#false} is VALID [2018-11-23 12:31:39,602 INFO L273 TraceCheckUtils]: 152: Hoare triple {28879#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28879#false} is VALID [2018-11-23 12:31:39,603 INFO L273 TraceCheckUtils]: 153: Hoare triple {28879#false} assume !(~i~2 < 99999); {28879#false} is VALID [2018-11-23 12:31:39,603 INFO L273 TraceCheckUtils]: 154: Hoare triple {28879#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {28879#false} is VALID [2018-11-23 12:31:39,603 INFO L256 TraceCheckUtils]: 155: Hoare triple {28879#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {28879#false} is VALID [2018-11-23 12:31:39,603 INFO L273 TraceCheckUtils]: 156: Hoare triple {28879#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {28879#false} is VALID [2018-11-23 12:31:39,603 INFO L273 TraceCheckUtils]: 157: Hoare triple {28879#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28879#false} is VALID [2018-11-23 12:31:39,603 INFO L273 TraceCheckUtils]: 158: Hoare triple {28879#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28879#false} is VALID [2018-11-23 12:31:39,603 INFO L273 TraceCheckUtils]: 159: Hoare triple {28879#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28879#false} is VALID [2018-11-23 12:31:39,603 INFO L273 TraceCheckUtils]: 160: Hoare triple {28879#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28879#false} is VALID [2018-11-23 12:31:39,603 INFO L273 TraceCheckUtils]: 161: Hoare triple {28879#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28879#false} is VALID [2018-11-23 12:31:39,603 INFO L273 TraceCheckUtils]: 162: Hoare triple {28879#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28879#false} is VALID [2018-11-23 12:31:39,604 INFO L273 TraceCheckUtils]: 163: Hoare triple {28879#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28879#false} is VALID [2018-11-23 12:31:39,604 INFO L273 TraceCheckUtils]: 164: Hoare triple {28879#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28879#false} is VALID [2018-11-23 12:31:39,604 INFO L273 TraceCheckUtils]: 165: Hoare triple {28879#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28879#false} is VALID [2018-11-23 12:31:39,604 INFO L273 TraceCheckUtils]: 166: Hoare triple {28879#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28879#false} is VALID [2018-11-23 12:31:39,604 INFO L273 TraceCheckUtils]: 167: Hoare triple {28879#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28879#false} is VALID [2018-11-23 12:31:39,604 INFO L273 TraceCheckUtils]: 168: Hoare triple {28879#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28879#false} is VALID [2018-11-23 12:31:39,604 INFO L273 TraceCheckUtils]: 169: Hoare triple {28879#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28879#false} is VALID [2018-11-23 12:31:39,604 INFO L273 TraceCheckUtils]: 170: Hoare triple {28879#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28879#false} is VALID [2018-11-23 12:31:39,604 INFO L273 TraceCheckUtils]: 171: Hoare triple {28879#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28879#false} is VALID [2018-11-23 12:31:39,604 INFO L273 TraceCheckUtils]: 172: Hoare triple {28879#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28879#false} is VALID [2018-11-23 12:31:39,605 INFO L273 TraceCheckUtils]: 173: Hoare triple {28879#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28879#false} is VALID [2018-11-23 12:31:39,605 INFO L273 TraceCheckUtils]: 174: Hoare triple {28879#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28879#false} is VALID [2018-11-23 12:31:39,605 INFO L273 TraceCheckUtils]: 175: Hoare triple {28879#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {28879#false} is VALID [2018-11-23 12:31:39,605 INFO L273 TraceCheckUtils]: 176: Hoare triple {28879#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28879#false} is VALID [2018-11-23 12:31:39,605 INFO L273 TraceCheckUtils]: 177: Hoare triple {28879#false} assume !(~i~0 < 100000); {28879#false} is VALID [2018-11-23 12:31:39,605 INFO L273 TraceCheckUtils]: 178: Hoare triple {28879#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {28879#false} is VALID [2018-11-23 12:31:39,605 INFO L273 TraceCheckUtils]: 179: Hoare triple {28879#false} assume true; {28879#false} is VALID [2018-11-23 12:31:39,605 INFO L268 TraceCheckUtils]: 180: Hoare quadruple {28879#false} {28879#false} #74#return; {28879#false} is VALID [2018-11-23 12:31:39,605 INFO L273 TraceCheckUtils]: 181: Hoare triple {28879#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {28879#false} is VALID [2018-11-23 12:31:39,605 INFO L273 TraceCheckUtils]: 182: Hoare triple {28879#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {28879#false} is VALID [2018-11-23 12:31:39,606 INFO L273 TraceCheckUtils]: 183: Hoare triple {28879#false} assume !false; {28879#false} is VALID [2018-11-23 12:31:39,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2321 backedges. 444 proven. 100 refuted. 0 times theorem prover too weak. 1777 trivial. 0 not checked. [2018-11-23 12:31:39,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:31:39,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 13] total 49 [2018-11-23 12:31:39,644 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 184 [2018-11-23 12:31:39,645 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:31:39,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states. [2018-11-23 12:31:39,772 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:31:39,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-23 12:31:39,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-23 12:31:39,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=1572, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 12:31:39,774 INFO L87 Difference]: Start difference. First operand 135 states and 139 transitions. Second operand 49 states. [2018-11-23 12:31:41,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:31:41,002 INFO L93 Difference]: Finished difference Result 199 states and 211 transitions. [2018-11-23 12:31:41,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-23 12:31:41,002 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 184 [2018-11-23 12:31:41,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:31:41,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:31:41,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 150 transitions. [2018-11-23 12:31:41,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:31:41,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 150 transitions. [2018-11-23 12:31:41,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states and 150 transitions. [2018-11-23 12:31:41,160 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:31:41,162 INFO L225 Difference]: With dead ends: 199 [2018-11-23 12:31:41,163 INFO L226 Difference]: Without dead ends: 141 [2018-11-23 12:31:41,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=780, Invalid=1572, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 12:31:41,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-23 12:31:41,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2018-11-23 12:31:41,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:31:41,225 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand 139 states. [2018-11-23 12:31:41,225 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand 139 states. [2018-11-23 12:31:41,225 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 139 states. [2018-11-23 12:31:41,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:31:41,228 INFO L93 Difference]: Finished difference Result 141 states and 145 transitions. [2018-11-23 12:31:41,228 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 145 transitions. [2018-11-23 12:31:41,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:31:41,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:31:41,229 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand 141 states. [2018-11-23 12:31:41,229 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 141 states. [2018-11-23 12:31:41,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:31:41,232 INFO L93 Difference]: Finished difference Result 141 states and 145 transitions. [2018-11-23 12:31:41,232 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 145 transitions. [2018-11-23 12:31:41,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:31:41,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:31:41,232 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:31:41,232 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:31:41,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-23 12:31:41,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 143 transitions. [2018-11-23 12:31:41,235 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 143 transitions. Word has length 184 [2018-11-23 12:31:41,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:31:41,235 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 143 transitions. [2018-11-23 12:31:41,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-23 12:31:41,236 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 143 transitions. [2018-11-23 12:31:41,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-11-23 12:31:41,236 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:31:41,237 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 33, 33, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:31:41,237 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:31:41,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:31:41,237 INFO L82 PathProgramCache]: Analyzing trace with hash -964866553, now seen corresponding path program 36 times [2018-11-23 12:31:41,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:31:41,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:31:41,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:31:41,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:31:41,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:31:41,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:31:42,435 INFO L256 TraceCheckUtils]: 0: Hoare triple {30263#true} call ULTIMATE.init(); {30263#true} is VALID [2018-11-23 12:31:42,435 INFO L273 TraceCheckUtils]: 1: Hoare triple {30263#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {30263#true} is VALID [2018-11-23 12:31:42,435 INFO L273 TraceCheckUtils]: 2: Hoare triple {30263#true} assume true; {30263#true} is VALID [2018-11-23 12:31:42,435 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30263#true} {30263#true} #66#return; {30263#true} is VALID [2018-11-23 12:31:42,436 INFO L256 TraceCheckUtils]: 4: Hoare triple {30263#true} call #t~ret13 := main(); {30263#true} is VALID [2018-11-23 12:31:42,436 INFO L273 TraceCheckUtils]: 5: Hoare triple {30263#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {30265#(= main_~i~1 0)} is VALID [2018-11-23 12:31:42,436 INFO L273 TraceCheckUtils]: 6: Hoare triple {30265#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30265#(= main_~i~1 0)} is VALID [2018-11-23 12:31:42,437 INFO L273 TraceCheckUtils]: 7: Hoare triple {30265#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30266#(<= main_~i~1 1)} is VALID [2018-11-23 12:31:42,437 INFO L273 TraceCheckUtils]: 8: Hoare triple {30266#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30266#(<= main_~i~1 1)} is VALID [2018-11-23 12:31:42,438 INFO L273 TraceCheckUtils]: 9: Hoare triple {30266#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30267#(<= main_~i~1 2)} is VALID [2018-11-23 12:31:42,438 INFO L273 TraceCheckUtils]: 10: Hoare triple {30267#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30267#(<= main_~i~1 2)} is VALID [2018-11-23 12:31:42,438 INFO L273 TraceCheckUtils]: 11: Hoare triple {30267#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30268#(<= main_~i~1 3)} is VALID [2018-11-23 12:31:42,439 INFO L273 TraceCheckUtils]: 12: Hoare triple {30268#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30268#(<= main_~i~1 3)} is VALID [2018-11-23 12:31:42,439 INFO L273 TraceCheckUtils]: 13: Hoare triple {30268#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30269#(<= main_~i~1 4)} is VALID [2018-11-23 12:31:42,439 INFO L273 TraceCheckUtils]: 14: Hoare triple {30269#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30269#(<= main_~i~1 4)} is VALID [2018-11-23 12:31:42,440 INFO L273 TraceCheckUtils]: 15: Hoare triple {30269#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30270#(<= main_~i~1 5)} is VALID [2018-11-23 12:31:42,441 INFO L273 TraceCheckUtils]: 16: Hoare triple {30270#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30270#(<= main_~i~1 5)} is VALID [2018-11-23 12:31:42,441 INFO L273 TraceCheckUtils]: 17: Hoare triple {30270#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30271#(<= main_~i~1 6)} is VALID [2018-11-23 12:31:42,442 INFO L273 TraceCheckUtils]: 18: Hoare triple {30271#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30271#(<= main_~i~1 6)} is VALID [2018-11-23 12:31:42,442 INFO L273 TraceCheckUtils]: 19: Hoare triple {30271#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30272#(<= main_~i~1 7)} is VALID [2018-11-23 12:31:42,443 INFO L273 TraceCheckUtils]: 20: Hoare triple {30272#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30272#(<= main_~i~1 7)} is VALID [2018-11-23 12:31:42,444 INFO L273 TraceCheckUtils]: 21: Hoare triple {30272#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30273#(<= main_~i~1 8)} is VALID [2018-11-23 12:31:42,444 INFO L273 TraceCheckUtils]: 22: Hoare triple {30273#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30273#(<= main_~i~1 8)} is VALID [2018-11-23 12:31:42,445 INFO L273 TraceCheckUtils]: 23: Hoare triple {30273#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30274#(<= main_~i~1 9)} is VALID [2018-11-23 12:31:42,445 INFO L273 TraceCheckUtils]: 24: Hoare triple {30274#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30274#(<= main_~i~1 9)} is VALID [2018-11-23 12:31:42,446 INFO L273 TraceCheckUtils]: 25: Hoare triple {30274#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30275#(<= main_~i~1 10)} is VALID [2018-11-23 12:31:42,446 INFO L273 TraceCheckUtils]: 26: Hoare triple {30275#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30275#(<= main_~i~1 10)} is VALID [2018-11-23 12:31:42,447 INFO L273 TraceCheckUtils]: 27: Hoare triple {30275#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30276#(<= main_~i~1 11)} is VALID [2018-11-23 12:31:42,447 INFO L273 TraceCheckUtils]: 28: Hoare triple {30276#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30276#(<= main_~i~1 11)} is VALID [2018-11-23 12:31:42,448 INFO L273 TraceCheckUtils]: 29: Hoare triple {30276#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30277#(<= main_~i~1 12)} is VALID [2018-11-23 12:31:42,449 INFO L273 TraceCheckUtils]: 30: Hoare triple {30277#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30277#(<= main_~i~1 12)} is VALID [2018-11-23 12:31:42,449 INFO L273 TraceCheckUtils]: 31: Hoare triple {30277#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30278#(<= main_~i~1 13)} is VALID [2018-11-23 12:31:42,450 INFO L273 TraceCheckUtils]: 32: Hoare triple {30278#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30278#(<= main_~i~1 13)} is VALID [2018-11-23 12:31:42,450 INFO L273 TraceCheckUtils]: 33: Hoare triple {30278#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30279#(<= main_~i~1 14)} is VALID [2018-11-23 12:31:42,451 INFO L273 TraceCheckUtils]: 34: Hoare triple {30279#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30279#(<= main_~i~1 14)} is VALID [2018-11-23 12:31:42,452 INFO L273 TraceCheckUtils]: 35: Hoare triple {30279#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30280#(<= main_~i~1 15)} is VALID [2018-11-23 12:31:42,452 INFO L273 TraceCheckUtils]: 36: Hoare triple {30280#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30280#(<= main_~i~1 15)} is VALID [2018-11-23 12:31:42,453 INFO L273 TraceCheckUtils]: 37: Hoare triple {30280#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30281#(<= main_~i~1 16)} is VALID [2018-11-23 12:31:42,453 INFO L273 TraceCheckUtils]: 38: Hoare triple {30281#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30281#(<= main_~i~1 16)} is VALID [2018-11-23 12:31:42,454 INFO L273 TraceCheckUtils]: 39: Hoare triple {30281#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30282#(<= main_~i~1 17)} is VALID [2018-11-23 12:31:42,454 INFO L273 TraceCheckUtils]: 40: Hoare triple {30282#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30282#(<= main_~i~1 17)} is VALID [2018-11-23 12:31:42,455 INFO L273 TraceCheckUtils]: 41: Hoare triple {30282#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30283#(<= main_~i~1 18)} is VALID [2018-11-23 12:31:42,456 INFO L273 TraceCheckUtils]: 42: Hoare triple {30283#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30283#(<= main_~i~1 18)} is VALID [2018-11-23 12:31:42,456 INFO L273 TraceCheckUtils]: 43: Hoare triple {30283#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30284#(<= main_~i~1 19)} is VALID [2018-11-23 12:31:42,457 INFO L273 TraceCheckUtils]: 44: Hoare triple {30284#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30284#(<= main_~i~1 19)} is VALID [2018-11-23 12:31:42,457 INFO L273 TraceCheckUtils]: 45: Hoare triple {30284#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30285#(<= main_~i~1 20)} is VALID [2018-11-23 12:31:42,458 INFO L273 TraceCheckUtils]: 46: Hoare triple {30285#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30285#(<= main_~i~1 20)} is VALID [2018-11-23 12:31:42,459 INFO L273 TraceCheckUtils]: 47: Hoare triple {30285#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30286#(<= main_~i~1 21)} is VALID [2018-11-23 12:31:42,459 INFO L273 TraceCheckUtils]: 48: Hoare triple {30286#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30286#(<= main_~i~1 21)} is VALID [2018-11-23 12:31:42,460 INFO L273 TraceCheckUtils]: 49: Hoare triple {30286#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#(<= main_~i~1 22)} is VALID [2018-11-23 12:31:42,460 INFO L273 TraceCheckUtils]: 50: Hoare triple {30287#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#(<= main_~i~1 22)} is VALID [2018-11-23 12:31:42,461 INFO L273 TraceCheckUtils]: 51: Hoare triple {30287#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30288#(<= main_~i~1 23)} is VALID [2018-11-23 12:31:42,461 INFO L273 TraceCheckUtils]: 52: Hoare triple {30288#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30288#(<= main_~i~1 23)} is VALID [2018-11-23 12:31:42,462 INFO L273 TraceCheckUtils]: 53: Hoare triple {30288#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30289#(<= main_~i~1 24)} is VALID [2018-11-23 12:31:42,463 INFO L273 TraceCheckUtils]: 54: Hoare triple {30289#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30289#(<= main_~i~1 24)} is VALID [2018-11-23 12:31:42,463 INFO L273 TraceCheckUtils]: 55: Hoare triple {30289#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30290#(<= main_~i~1 25)} is VALID [2018-11-23 12:31:42,464 INFO L273 TraceCheckUtils]: 56: Hoare triple {30290#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30290#(<= main_~i~1 25)} is VALID [2018-11-23 12:31:42,465 INFO L273 TraceCheckUtils]: 57: Hoare triple {30290#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30291#(<= main_~i~1 26)} is VALID [2018-11-23 12:31:42,465 INFO L273 TraceCheckUtils]: 58: Hoare triple {30291#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30291#(<= main_~i~1 26)} is VALID [2018-11-23 12:31:42,466 INFO L273 TraceCheckUtils]: 59: Hoare triple {30291#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30292#(<= main_~i~1 27)} is VALID [2018-11-23 12:31:42,466 INFO L273 TraceCheckUtils]: 60: Hoare triple {30292#(<= main_~i~1 27)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30292#(<= main_~i~1 27)} is VALID [2018-11-23 12:31:42,467 INFO L273 TraceCheckUtils]: 61: Hoare triple {30292#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30293#(<= main_~i~1 28)} is VALID [2018-11-23 12:31:42,467 INFO L273 TraceCheckUtils]: 62: Hoare triple {30293#(<= main_~i~1 28)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30293#(<= main_~i~1 28)} is VALID [2018-11-23 12:31:42,468 INFO L273 TraceCheckUtils]: 63: Hoare triple {30293#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30294#(<= main_~i~1 29)} is VALID [2018-11-23 12:31:42,469 INFO L273 TraceCheckUtils]: 64: Hoare triple {30294#(<= main_~i~1 29)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30294#(<= main_~i~1 29)} is VALID [2018-11-23 12:31:42,469 INFO L273 TraceCheckUtils]: 65: Hoare triple {30294#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30295#(<= main_~i~1 30)} is VALID [2018-11-23 12:31:42,470 INFO L273 TraceCheckUtils]: 66: Hoare triple {30295#(<= main_~i~1 30)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30295#(<= main_~i~1 30)} is VALID [2018-11-23 12:31:42,471 INFO L273 TraceCheckUtils]: 67: Hoare triple {30295#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30296#(<= main_~i~1 31)} is VALID [2018-11-23 12:31:42,471 INFO L273 TraceCheckUtils]: 68: Hoare triple {30296#(<= main_~i~1 31)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30296#(<= main_~i~1 31)} is VALID [2018-11-23 12:31:42,472 INFO L273 TraceCheckUtils]: 69: Hoare triple {30296#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30297#(<= main_~i~1 32)} is VALID [2018-11-23 12:31:42,472 INFO L273 TraceCheckUtils]: 70: Hoare triple {30297#(<= main_~i~1 32)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30297#(<= main_~i~1 32)} is VALID [2018-11-23 12:31:42,473 INFO L273 TraceCheckUtils]: 71: Hoare triple {30297#(<= main_~i~1 32)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30298#(<= main_~i~1 33)} is VALID [2018-11-23 12:31:42,474 INFO L273 TraceCheckUtils]: 72: Hoare triple {30298#(<= main_~i~1 33)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30298#(<= main_~i~1 33)} is VALID [2018-11-23 12:31:42,474 INFO L273 TraceCheckUtils]: 73: Hoare triple {30298#(<= main_~i~1 33)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30299#(<= main_~i~1 34)} is VALID [2018-11-23 12:31:42,475 INFO L273 TraceCheckUtils]: 74: Hoare triple {30299#(<= main_~i~1 34)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30299#(<= main_~i~1 34)} is VALID [2018-11-23 12:31:42,475 INFO L273 TraceCheckUtils]: 75: Hoare triple {30299#(<= main_~i~1 34)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30300#(<= main_~i~1 35)} is VALID [2018-11-23 12:31:42,476 INFO L273 TraceCheckUtils]: 76: Hoare triple {30300#(<= main_~i~1 35)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30300#(<= main_~i~1 35)} is VALID [2018-11-23 12:31:42,477 INFO L273 TraceCheckUtils]: 77: Hoare triple {30300#(<= main_~i~1 35)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30301#(<= main_~i~1 36)} is VALID [2018-11-23 12:31:42,477 INFO L273 TraceCheckUtils]: 78: Hoare triple {30301#(<= main_~i~1 36)} assume !(~i~1 < 100000); {30264#false} is VALID [2018-11-23 12:31:42,478 INFO L256 TraceCheckUtils]: 79: Hoare triple {30264#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {30263#true} is VALID [2018-11-23 12:31:42,478 INFO L273 TraceCheckUtils]: 80: Hoare triple {30263#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {30263#true} is VALID [2018-11-23 12:31:42,478 INFO L273 TraceCheckUtils]: 81: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:42,478 INFO L273 TraceCheckUtils]: 82: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:42,478 INFO L273 TraceCheckUtils]: 83: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:42,479 INFO L273 TraceCheckUtils]: 84: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:42,479 INFO L273 TraceCheckUtils]: 85: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:42,479 INFO L273 TraceCheckUtils]: 86: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:42,479 INFO L273 TraceCheckUtils]: 87: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:42,479 INFO L273 TraceCheckUtils]: 88: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:42,479 INFO L273 TraceCheckUtils]: 89: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:42,479 INFO L273 TraceCheckUtils]: 90: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:42,480 INFO L273 TraceCheckUtils]: 91: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:42,480 INFO L273 TraceCheckUtils]: 92: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:42,480 INFO L273 TraceCheckUtils]: 93: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:42,480 INFO L273 TraceCheckUtils]: 94: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:42,480 INFO L273 TraceCheckUtils]: 95: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:42,480 INFO L273 TraceCheckUtils]: 96: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:42,480 INFO L273 TraceCheckUtils]: 97: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:42,480 INFO L273 TraceCheckUtils]: 98: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:42,480 INFO L273 TraceCheckUtils]: 99: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:42,480 INFO L273 TraceCheckUtils]: 100: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:42,481 INFO L273 TraceCheckUtils]: 101: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:42,481 INFO L273 TraceCheckUtils]: 102: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:42,481 INFO L273 TraceCheckUtils]: 103: Hoare triple {30263#true} assume !(~i~0 < 100000); {30263#true} is VALID [2018-11-23 12:31:42,481 INFO L273 TraceCheckUtils]: 104: Hoare triple {30263#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {30263#true} is VALID [2018-11-23 12:31:42,481 INFO L273 TraceCheckUtils]: 105: Hoare triple {30263#true} assume true; {30263#true} is VALID [2018-11-23 12:31:42,481 INFO L268 TraceCheckUtils]: 106: Hoare quadruple {30263#true} {30264#false} #70#return; {30264#false} is VALID [2018-11-23 12:31:42,481 INFO L273 TraceCheckUtils]: 107: Hoare triple {30264#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {30264#false} is VALID [2018-11-23 12:31:42,481 INFO L256 TraceCheckUtils]: 108: Hoare triple {30264#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {30263#true} is VALID [2018-11-23 12:31:42,481 INFO L273 TraceCheckUtils]: 109: Hoare triple {30263#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {30263#true} is VALID [2018-11-23 12:31:42,481 INFO L273 TraceCheckUtils]: 110: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:42,482 INFO L273 TraceCheckUtils]: 111: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:42,482 INFO L273 TraceCheckUtils]: 112: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:42,482 INFO L273 TraceCheckUtils]: 113: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:42,482 INFO L273 TraceCheckUtils]: 114: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:42,482 INFO L273 TraceCheckUtils]: 115: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:42,482 INFO L273 TraceCheckUtils]: 116: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:42,482 INFO L273 TraceCheckUtils]: 117: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:42,482 INFO L273 TraceCheckUtils]: 118: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:42,482 INFO L273 TraceCheckUtils]: 119: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:42,483 INFO L273 TraceCheckUtils]: 120: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:42,483 INFO L273 TraceCheckUtils]: 121: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:42,483 INFO L273 TraceCheckUtils]: 122: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:42,483 INFO L273 TraceCheckUtils]: 123: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:42,483 INFO L273 TraceCheckUtils]: 124: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:42,483 INFO L273 TraceCheckUtils]: 125: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:42,483 INFO L273 TraceCheckUtils]: 126: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:42,483 INFO L273 TraceCheckUtils]: 127: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:42,483 INFO L273 TraceCheckUtils]: 128: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:42,483 INFO L273 TraceCheckUtils]: 129: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:42,484 INFO L273 TraceCheckUtils]: 130: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:42,484 INFO L273 TraceCheckUtils]: 131: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:42,484 INFO L273 TraceCheckUtils]: 132: Hoare triple {30263#true} assume !(~i~0 < 100000); {30263#true} is VALID [2018-11-23 12:31:42,484 INFO L273 TraceCheckUtils]: 133: Hoare triple {30263#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {30263#true} is VALID [2018-11-23 12:31:42,484 INFO L273 TraceCheckUtils]: 134: Hoare triple {30263#true} assume true; {30263#true} is VALID [2018-11-23 12:31:42,484 INFO L268 TraceCheckUtils]: 135: Hoare quadruple {30263#true} {30264#false} #72#return; {30264#false} is VALID [2018-11-23 12:31:42,484 INFO L273 TraceCheckUtils]: 136: Hoare triple {30264#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {30264#false} is VALID [2018-11-23 12:31:42,484 INFO L273 TraceCheckUtils]: 137: Hoare triple {30264#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30264#false} is VALID [2018-11-23 12:31:42,484 INFO L273 TraceCheckUtils]: 138: Hoare triple {30264#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30264#false} is VALID [2018-11-23 12:31:42,484 INFO L273 TraceCheckUtils]: 139: Hoare triple {30264#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30264#false} is VALID [2018-11-23 12:31:42,485 INFO L273 TraceCheckUtils]: 140: Hoare triple {30264#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30264#false} is VALID [2018-11-23 12:31:42,485 INFO L273 TraceCheckUtils]: 141: Hoare triple {30264#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30264#false} is VALID [2018-11-23 12:31:42,485 INFO L273 TraceCheckUtils]: 142: Hoare triple {30264#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30264#false} is VALID [2018-11-23 12:31:42,485 INFO L273 TraceCheckUtils]: 143: Hoare triple {30264#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30264#false} is VALID [2018-11-23 12:31:42,485 INFO L273 TraceCheckUtils]: 144: Hoare triple {30264#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30264#false} is VALID [2018-11-23 12:31:42,485 INFO L273 TraceCheckUtils]: 145: Hoare triple {30264#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30264#false} is VALID [2018-11-23 12:31:42,485 INFO L273 TraceCheckUtils]: 146: Hoare triple {30264#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30264#false} is VALID [2018-11-23 12:31:42,485 INFO L273 TraceCheckUtils]: 147: Hoare triple {30264#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30264#false} is VALID [2018-11-23 12:31:42,485 INFO L273 TraceCheckUtils]: 148: Hoare triple {30264#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30264#false} is VALID [2018-11-23 12:31:42,485 INFO L273 TraceCheckUtils]: 149: Hoare triple {30264#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30264#false} is VALID [2018-11-23 12:31:42,486 INFO L273 TraceCheckUtils]: 150: Hoare triple {30264#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30264#false} is VALID [2018-11-23 12:31:42,486 INFO L273 TraceCheckUtils]: 151: Hoare triple {30264#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30264#false} is VALID [2018-11-23 12:31:42,486 INFO L273 TraceCheckUtils]: 152: Hoare triple {30264#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30264#false} is VALID [2018-11-23 12:31:42,486 INFO L273 TraceCheckUtils]: 153: Hoare triple {30264#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30264#false} is VALID [2018-11-23 12:31:42,486 INFO L273 TraceCheckUtils]: 154: Hoare triple {30264#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30264#false} is VALID [2018-11-23 12:31:42,486 INFO L273 TraceCheckUtils]: 155: Hoare triple {30264#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30264#false} is VALID [2018-11-23 12:31:42,486 INFO L273 TraceCheckUtils]: 156: Hoare triple {30264#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30264#false} is VALID [2018-11-23 12:31:42,486 INFO L273 TraceCheckUtils]: 157: Hoare triple {30264#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30264#false} is VALID [2018-11-23 12:31:42,486 INFO L273 TraceCheckUtils]: 158: Hoare triple {30264#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30264#false} is VALID [2018-11-23 12:31:42,486 INFO L273 TraceCheckUtils]: 159: Hoare triple {30264#false} assume !(~i~2 < 99999); {30264#false} is VALID [2018-11-23 12:31:42,487 INFO L273 TraceCheckUtils]: 160: Hoare triple {30264#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {30264#false} is VALID [2018-11-23 12:31:42,487 INFO L256 TraceCheckUtils]: 161: Hoare triple {30264#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {30263#true} is VALID [2018-11-23 12:31:42,487 INFO L273 TraceCheckUtils]: 162: Hoare triple {30263#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {30263#true} is VALID [2018-11-23 12:31:42,487 INFO L273 TraceCheckUtils]: 163: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:42,487 INFO L273 TraceCheckUtils]: 164: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:42,487 INFO L273 TraceCheckUtils]: 165: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:42,487 INFO L273 TraceCheckUtils]: 166: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:42,487 INFO L273 TraceCheckUtils]: 167: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:42,487 INFO L273 TraceCheckUtils]: 168: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:42,488 INFO L273 TraceCheckUtils]: 169: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:42,488 INFO L273 TraceCheckUtils]: 170: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:42,488 INFO L273 TraceCheckUtils]: 171: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:42,488 INFO L273 TraceCheckUtils]: 172: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:42,488 INFO L273 TraceCheckUtils]: 173: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:42,488 INFO L273 TraceCheckUtils]: 174: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:42,488 INFO L273 TraceCheckUtils]: 175: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:42,488 INFO L273 TraceCheckUtils]: 176: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:42,488 INFO L273 TraceCheckUtils]: 177: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:42,488 INFO L273 TraceCheckUtils]: 178: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:42,489 INFO L273 TraceCheckUtils]: 179: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:42,489 INFO L273 TraceCheckUtils]: 180: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:42,489 INFO L273 TraceCheckUtils]: 181: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:42,489 INFO L273 TraceCheckUtils]: 182: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:42,489 INFO L273 TraceCheckUtils]: 183: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:42,489 INFO L273 TraceCheckUtils]: 184: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:42,489 INFO L273 TraceCheckUtils]: 185: Hoare triple {30263#true} assume !(~i~0 < 100000); {30263#true} is VALID [2018-11-23 12:31:42,489 INFO L273 TraceCheckUtils]: 186: Hoare triple {30263#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {30263#true} is VALID [2018-11-23 12:31:42,489 INFO L273 TraceCheckUtils]: 187: Hoare triple {30263#true} assume true; {30263#true} is VALID [2018-11-23 12:31:42,489 INFO L268 TraceCheckUtils]: 188: Hoare quadruple {30263#true} {30264#false} #74#return; {30264#false} is VALID [2018-11-23 12:31:42,490 INFO L273 TraceCheckUtils]: 189: Hoare triple {30264#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {30264#false} is VALID [2018-11-23 12:31:42,490 INFO L273 TraceCheckUtils]: 190: Hoare triple {30264#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {30264#false} is VALID [2018-11-23 12:31:42,490 INFO L273 TraceCheckUtils]: 191: Hoare triple {30264#false} assume !false; {30264#false} is VALID [2018-11-23 12:31:42,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2587 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 1291 trivial. 0 not checked. [2018-11-23 12:31:42,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:31:42,506 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 12:31:42,517 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:31:44,629 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2018-11-23 12:31:44,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:31:44,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:31:44,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:31:45,066 INFO L256 TraceCheckUtils]: 0: Hoare triple {30263#true} call ULTIMATE.init(); {30263#true} is VALID [2018-11-23 12:31:45,066 INFO L273 TraceCheckUtils]: 1: Hoare triple {30263#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {30263#true} is VALID [2018-11-23 12:31:45,066 INFO L273 TraceCheckUtils]: 2: Hoare triple {30263#true} assume true; {30263#true} is VALID [2018-11-23 12:31:45,067 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30263#true} {30263#true} #66#return; {30263#true} is VALID [2018-11-23 12:31:45,067 INFO L256 TraceCheckUtils]: 4: Hoare triple {30263#true} call #t~ret13 := main(); {30263#true} is VALID [2018-11-23 12:31:45,067 INFO L273 TraceCheckUtils]: 5: Hoare triple {30263#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {30263#true} is VALID [2018-11-23 12:31:45,067 INFO L273 TraceCheckUtils]: 6: Hoare triple {30263#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30263#true} is VALID [2018-11-23 12:31:45,067 INFO L273 TraceCheckUtils]: 7: Hoare triple {30263#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30263#true} is VALID [2018-11-23 12:31:45,067 INFO L273 TraceCheckUtils]: 8: Hoare triple {30263#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30263#true} is VALID [2018-11-23 12:31:45,068 INFO L273 TraceCheckUtils]: 9: Hoare triple {30263#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30263#true} is VALID [2018-11-23 12:31:45,068 INFO L273 TraceCheckUtils]: 10: Hoare triple {30263#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30263#true} is VALID [2018-11-23 12:31:45,068 INFO L273 TraceCheckUtils]: 11: Hoare triple {30263#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30263#true} is VALID [2018-11-23 12:31:45,068 INFO L273 TraceCheckUtils]: 12: Hoare triple {30263#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30263#true} is VALID [2018-11-23 12:31:45,068 INFO L273 TraceCheckUtils]: 13: Hoare triple {30263#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30263#true} is VALID [2018-11-23 12:31:45,068 INFO L273 TraceCheckUtils]: 14: Hoare triple {30263#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30263#true} is VALID [2018-11-23 12:31:45,068 INFO L273 TraceCheckUtils]: 15: Hoare triple {30263#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30263#true} is VALID [2018-11-23 12:31:45,069 INFO L273 TraceCheckUtils]: 16: Hoare triple {30263#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30263#true} is VALID [2018-11-23 12:31:45,069 INFO L273 TraceCheckUtils]: 17: Hoare triple {30263#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30263#true} is VALID [2018-11-23 12:31:45,069 INFO L273 TraceCheckUtils]: 18: Hoare triple {30263#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30263#true} is VALID [2018-11-23 12:31:45,069 INFO L273 TraceCheckUtils]: 19: Hoare triple {30263#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30263#true} is VALID [2018-11-23 12:31:45,069 INFO L273 TraceCheckUtils]: 20: Hoare triple {30263#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30263#true} is VALID [2018-11-23 12:31:45,069 INFO L273 TraceCheckUtils]: 21: Hoare triple {30263#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30263#true} is VALID [2018-11-23 12:31:45,069 INFO L273 TraceCheckUtils]: 22: Hoare triple {30263#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30263#true} is VALID [2018-11-23 12:31:45,069 INFO L273 TraceCheckUtils]: 23: Hoare triple {30263#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30263#true} is VALID [2018-11-23 12:31:45,069 INFO L273 TraceCheckUtils]: 24: Hoare triple {30263#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30263#true} is VALID [2018-11-23 12:31:45,069 INFO L273 TraceCheckUtils]: 25: Hoare triple {30263#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30263#true} is VALID [2018-11-23 12:31:45,070 INFO L273 TraceCheckUtils]: 26: Hoare triple {30263#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30263#true} is VALID [2018-11-23 12:31:45,070 INFO L273 TraceCheckUtils]: 27: Hoare triple {30263#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30263#true} is VALID [2018-11-23 12:31:45,070 INFO L273 TraceCheckUtils]: 28: Hoare triple {30263#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30263#true} is VALID [2018-11-23 12:31:45,070 INFO L273 TraceCheckUtils]: 29: Hoare triple {30263#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30263#true} is VALID [2018-11-23 12:31:45,070 INFO L273 TraceCheckUtils]: 30: Hoare triple {30263#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30263#true} is VALID [2018-11-23 12:31:45,070 INFO L273 TraceCheckUtils]: 31: Hoare triple {30263#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30263#true} is VALID [2018-11-23 12:31:45,070 INFO L273 TraceCheckUtils]: 32: Hoare triple {30263#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30263#true} is VALID [2018-11-23 12:31:45,070 INFO L273 TraceCheckUtils]: 33: Hoare triple {30263#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30263#true} is VALID [2018-11-23 12:31:45,070 INFO L273 TraceCheckUtils]: 34: Hoare triple {30263#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30263#true} is VALID [2018-11-23 12:31:45,070 INFO L273 TraceCheckUtils]: 35: Hoare triple {30263#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30263#true} is VALID [2018-11-23 12:31:45,071 INFO L273 TraceCheckUtils]: 36: Hoare triple {30263#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30263#true} is VALID [2018-11-23 12:31:45,071 INFO L273 TraceCheckUtils]: 37: Hoare triple {30263#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30263#true} is VALID [2018-11-23 12:31:45,071 INFO L273 TraceCheckUtils]: 38: Hoare triple {30263#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30263#true} is VALID [2018-11-23 12:31:45,071 INFO L273 TraceCheckUtils]: 39: Hoare triple {30263#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30263#true} is VALID [2018-11-23 12:31:45,071 INFO L273 TraceCheckUtils]: 40: Hoare triple {30263#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30263#true} is VALID [2018-11-23 12:31:45,071 INFO L273 TraceCheckUtils]: 41: Hoare triple {30263#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30263#true} is VALID [2018-11-23 12:31:45,071 INFO L273 TraceCheckUtils]: 42: Hoare triple {30263#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30263#true} is VALID [2018-11-23 12:31:45,071 INFO L273 TraceCheckUtils]: 43: Hoare triple {30263#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30263#true} is VALID [2018-11-23 12:31:45,071 INFO L273 TraceCheckUtils]: 44: Hoare triple {30263#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30263#true} is VALID [2018-11-23 12:31:45,071 INFO L273 TraceCheckUtils]: 45: Hoare triple {30263#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30263#true} is VALID [2018-11-23 12:31:45,072 INFO L273 TraceCheckUtils]: 46: Hoare triple {30263#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30263#true} is VALID [2018-11-23 12:31:45,072 INFO L273 TraceCheckUtils]: 47: Hoare triple {30263#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30263#true} is VALID [2018-11-23 12:31:45,072 INFO L273 TraceCheckUtils]: 48: Hoare triple {30263#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30263#true} is VALID [2018-11-23 12:31:45,072 INFO L273 TraceCheckUtils]: 49: Hoare triple {30263#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30263#true} is VALID [2018-11-23 12:31:45,072 INFO L273 TraceCheckUtils]: 50: Hoare triple {30263#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30263#true} is VALID [2018-11-23 12:31:45,072 INFO L273 TraceCheckUtils]: 51: Hoare triple {30263#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30263#true} is VALID [2018-11-23 12:31:45,072 INFO L273 TraceCheckUtils]: 52: Hoare triple {30263#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30263#true} is VALID [2018-11-23 12:31:45,072 INFO L273 TraceCheckUtils]: 53: Hoare triple {30263#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30263#true} is VALID [2018-11-23 12:31:45,072 INFO L273 TraceCheckUtils]: 54: Hoare triple {30263#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30263#true} is VALID [2018-11-23 12:31:45,072 INFO L273 TraceCheckUtils]: 55: Hoare triple {30263#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30263#true} is VALID [2018-11-23 12:31:45,073 INFO L273 TraceCheckUtils]: 56: Hoare triple {30263#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30263#true} is VALID [2018-11-23 12:31:45,073 INFO L273 TraceCheckUtils]: 57: Hoare triple {30263#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30263#true} is VALID [2018-11-23 12:31:45,073 INFO L273 TraceCheckUtils]: 58: Hoare triple {30263#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30263#true} is VALID [2018-11-23 12:31:45,073 INFO L273 TraceCheckUtils]: 59: Hoare triple {30263#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30263#true} is VALID [2018-11-23 12:31:45,073 INFO L273 TraceCheckUtils]: 60: Hoare triple {30263#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30263#true} is VALID [2018-11-23 12:31:45,073 INFO L273 TraceCheckUtils]: 61: Hoare triple {30263#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30263#true} is VALID [2018-11-23 12:31:45,073 INFO L273 TraceCheckUtils]: 62: Hoare triple {30263#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30263#true} is VALID [2018-11-23 12:31:45,073 INFO L273 TraceCheckUtils]: 63: Hoare triple {30263#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30263#true} is VALID [2018-11-23 12:31:45,073 INFO L273 TraceCheckUtils]: 64: Hoare triple {30263#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30263#true} is VALID [2018-11-23 12:31:45,073 INFO L273 TraceCheckUtils]: 65: Hoare triple {30263#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30263#true} is VALID [2018-11-23 12:31:45,074 INFO L273 TraceCheckUtils]: 66: Hoare triple {30263#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30263#true} is VALID [2018-11-23 12:31:45,074 INFO L273 TraceCheckUtils]: 67: Hoare triple {30263#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30263#true} is VALID [2018-11-23 12:31:45,074 INFO L273 TraceCheckUtils]: 68: Hoare triple {30263#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30263#true} is VALID [2018-11-23 12:31:45,074 INFO L273 TraceCheckUtils]: 69: Hoare triple {30263#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30263#true} is VALID [2018-11-23 12:31:45,074 INFO L273 TraceCheckUtils]: 70: Hoare triple {30263#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30263#true} is VALID [2018-11-23 12:31:45,074 INFO L273 TraceCheckUtils]: 71: Hoare triple {30263#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30263#true} is VALID [2018-11-23 12:31:45,074 INFO L273 TraceCheckUtils]: 72: Hoare triple {30263#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30263#true} is VALID [2018-11-23 12:31:45,074 INFO L273 TraceCheckUtils]: 73: Hoare triple {30263#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30263#true} is VALID [2018-11-23 12:31:45,074 INFO L273 TraceCheckUtils]: 74: Hoare triple {30263#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30263#true} is VALID [2018-11-23 12:31:45,075 INFO L273 TraceCheckUtils]: 75: Hoare triple {30263#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30263#true} is VALID [2018-11-23 12:31:45,075 INFO L273 TraceCheckUtils]: 76: Hoare triple {30263#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30263#true} is VALID [2018-11-23 12:31:45,075 INFO L273 TraceCheckUtils]: 77: Hoare triple {30263#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30263#true} is VALID [2018-11-23 12:31:45,075 INFO L273 TraceCheckUtils]: 78: Hoare triple {30263#true} assume !(~i~1 < 100000); {30263#true} is VALID [2018-11-23 12:31:45,075 INFO L256 TraceCheckUtils]: 79: Hoare triple {30263#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {30263#true} is VALID [2018-11-23 12:31:45,075 INFO L273 TraceCheckUtils]: 80: Hoare triple {30263#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {30263#true} is VALID [2018-11-23 12:31:45,075 INFO L273 TraceCheckUtils]: 81: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:45,075 INFO L273 TraceCheckUtils]: 82: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:45,075 INFO L273 TraceCheckUtils]: 83: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:45,075 INFO L273 TraceCheckUtils]: 84: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:45,076 INFO L273 TraceCheckUtils]: 85: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:45,076 INFO L273 TraceCheckUtils]: 86: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:45,076 INFO L273 TraceCheckUtils]: 87: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:45,076 INFO L273 TraceCheckUtils]: 88: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:45,076 INFO L273 TraceCheckUtils]: 89: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:45,076 INFO L273 TraceCheckUtils]: 90: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:45,076 INFO L273 TraceCheckUtils]: 91: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:45,076 INFO L273 TraceCheckUtils]: 92: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:45,076 INFO L273 TraceCheckUtils]: 93: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:45,076 INFO L273 TraceCheckUtils]: 94: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:45,077 INFO L273 TraceCheckUtils]: 95: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:45,077 INFO L273 TraceCheckUtils]: 96: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:45,077 INFO L273 TraceCheckUtils]: 97: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:45,077 INFO L273 TraceCheckUtils]: 98: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:45,077 INFO L273 TraceCheckUtils]: 99: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:45,077 INFO L273 TraceCheckUtils]: 100: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:45,077 INFO L273 TraceCheckUtils]: 101: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:45,077 INFO L273 TraceCheckUtils]: 102: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:45,077 INFO L273 TraceCheckUtils]: 103: Hoare triple {30263#true} assume !(~i~0 < 100000); {30263#true} is VALID [2018-11-23 12:31:45,077 INFO L273 TraceCheckUtils]: 104: Hoare triple {30263#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {30263#true} is VALID [2018-11-23 12:31:45,078 INFO L273 TraceCheckUtils]: 105: Hoare triple {30263#true} assume true; {30263#true} is VALID [2018-11-23 12:31:45,078 INFO L268 TraceCheckUtils]: 106: Hoare quadruple {30263#true} {30263#true} #70#return; {30263#true} is VALID [2018-11-23 12:31:45,078 INFO L273 TraceCheckUtils]: 107: Hoare triple {30263#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {30263#true} is VALID [2018-11-23 12:31:45,078 INFO L256 TraceCheckUtils]: 108: Hoare triple {30263#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {30263#true} is VALID [2018-11-23 12:31:45,078 INFO L273 TraceCheckUtils]: 109: Hoare triple {30263#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {30263#true} is VALID [2018-11-23 12:31:45,078 INFO L273 TraceCheckUtils]: 110: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:45,078 INFO L273 TraceCheckUtils]: 111: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:45,078 INFO L273 TraceCheckUtils]: 112: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:45,078 INFO L273 TraceCheckUtils]: 113: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:45,078 INFO L273 TraceCheckUtils]: 114: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:45,079 INFO L273 TraceCheckUtils]: 115: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:45,079 INFO L273 TraceCheckUtils]: 116: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:45,079 INFO L273 TraceCheckUtils]: 117: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:45,079 INFO L273 TraceCheckUtils]: 118: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:45,079 INFO L273 TraceCheckUtils]: 119: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:45,079 INFO L273 TraceCheckUtils]: 120: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:45,079 INFO L273 TraceCheckUtils]: 121: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:45,079 INFO L273 TraceCheckUtils]: 122: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:45,079 INFO L273 TraceCheckUtils]: 123: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:45,079 INFO L273 TraceCheckUtils]: 124: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:45,080 INFO L273 TraceCheckUtils]: 125: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:45,080 INFO L273 TraceCheckUtils]: 126: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:45,080 INFO L273 TraceCheckUtils]: 127: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:45,080 INFO L273 TraceCheckUtils]: 128: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:45,080 INFO L273 TraceCheckUtils]: 129: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:45,080 INFO L273 TraceCheckUtils]: 130: Hoare triple {30263#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30263#true} is VALID [2018-11-23 12:31:45,080 INFO L273 TraceCheckUtils]: 131: Hoare triple {30263#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#true} is VALID [2018-11-23 12:31:45,080 INFO L273 TraceCheckUtils]: 132: Hoare triple {30263#true} assume !(~i~0 < 100000); {30263#true} is VALID [2018-11-23 12:31:45,080 INFO L273 TraceCheckUtils]: 133: Hoare triple {30263#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {30263#true} is VALID [2018-11-23 12:31:45,080 INFO L273 TraceCheckUtils]: 134: Hoare triple {30263#true} assume true; {30263#true} is VALID [2018-11-23 12:31:45,081 INFO L268 TraceCheckUtils]: 135: Hoare quadruple {30263#true} {30263#true} #72#return; {30263#true} is VALID [2018-11-23 12:31:45,081 INFO L273 TraceCheckUtils]: 136: Hoare triple {30263#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {30263#true} is VALID [2018-11-23 12:31:45,081 INFO L273 TraceCheckUtils]: 137: Hoare triple {30263#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30263#true} is VALID [2018-11-23 12:31:45,081 INFO L273 TraceCheckUtils]: 138: Hoare triple {30263#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30263#true} is VALID [2018-11-23 12:31:45,081 INFO L273 TraceCheckUtils]: 139: Hoare triple {30263#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30263#true} is VALID [2018-11-23 12:31:45,081 INFO L273 TraceCheckUtils]: 140: Hoare triple {30263#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30263#true} is VALID [2018-11-23 12:31:45,081 INFO L273 TraceCheckUtils]: 141: Hoare triple {30263#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30263#true} is VALID [2018-11-23 12:31:45,081 INFO L273 TraceCheckUtils]: 142: Hoare triple {30263#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30263#true} is VALID [2018-11-23 12:31:45,081 INFO L273 TraceCheckUtils]: 143: Hoare triple {30263#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30263#true} is VALID [2018-11-23 12:31:45,081 INFO L273 TraceCheckUtils]: 144: Hoare triple {30263#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30263#true} is VALID [2018-11-23 12:31:45,082 INFO L273 TraceCheckUtils]: 145: Hoare triple {30263#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30263#true} is VALID [2018-11-23 12:31:45,082 INFO L273 TraceCheckUtils]: 146: Hoare triple {30263#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30263#true} is VALID [2018-11-23 12:31:45,082 INFO L273 TraceCheckUtils]: 147: Hoare triple {30263#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30263#true} is VALID [2018-11-23 12:31:45,082 INFO L273 TraceCheckUtils]: 148: Hoare triple {30263#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30263#true} is VALID [2018-11-23 12:31:45,082 INFO L273 TraceCheckUtils]: 149: Hoare triple {30263#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30263#true} is VALID [2018-11-23 12:31:45,082 INFO L273 TraceCheckUtils]: 150: Hoare triple {30263#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30263#true} is VALID [2018-11-23 12:31:45,082 INFO L273 TraceCheckUtils]: 151: Hoare triple {30263#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30263#true} is VALID [2018-11-23 12:31:45,082 INFO L273 TraceCheckUtils]: 152: Hoare triple {30263#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30263#true} is VALID [2018-11-23 12:31:45,082 INFO L273 TraceCheckUtils]: 153: Hoare triple {30263#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30263#true} is VALID [2018-11-23 12:31:45,082 INFO L273 TraceCheckUtils]: 154: Hoare triple {30263#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30263#true} is VALID [2018-11-23 12:31:45,083 INFO L273 TraceCheckUtils]: 155: Hoare triple {30263#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30263#true} is VALID [2018-11-23 12:31:45,083 INFO L273 TraceCheckUtils]: 156: Hoare triple {30263#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30263#true} is VALID [2018-11-23 12:31:45,083 INFO L273 TraceCheckUtils]: 157: Hoare triple {30263#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30263#true} is VALID [2018-11-23 12:31:45,083 INFO L273 TraceCheckUtils]: 158: Hoare triple {30263#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30263#true} is VALID [2018-11-23 12:31:45,083 INFO L273 TraceCheckUtils]: 159: Hoare triple {30263#true} assume !(~i~2 < 99999); {30263#true} is VALID [2018-11-23 12:31:45,083 INFO L273 TraceCheckUtils]: 160: Hoare triple {30263#true} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {30263#true} is VALID [2018-11-23 12:31:45,083 INFO L256 TraceCheckUtils]: 161: Hoare triple {30263#true} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {30263#true} is VALID [2018-11-23 12:31:45,084 INFO L273 TraceCheckUtils]: 162: Hoare triple {30263#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {30791#(<= xor_~i~0 1)} is VALID [2018-11-23 12:31:45,086 INFO L273 TraceCheckUtils]: 163: Hoare triple {30791#(<= xor_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30791#(<= xor_~i~0 1)} is VALID [2018-11-23 12:31:45,086 INFO L273 TraceCheckUtils]: 164: Hoare triple {30791#(<= xor_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30798#(<= xor_~i~0 2)} is VALID [2018-11-23 12:31:45,087 INFO L273 TraceCheckUtils]: 165: Hoare triple {30798#(<= xor_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30798#(<= xor_~i~0 2)} is VALID [2018-11-23 12:31:45,088 INFO L273 TraceCheckUtils]: 166: Hoare triple {30798#(<= xor_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30805#(<= xor_~i~0 3)} is VALID [2018-11-23 12:31:45,089 INFO L273 TraceCheckUtils]: 167: Hoare triple {30805#(<= xor_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30805#(<= xor_~i~0 3)} is VALID [2018-11-23 12:31:45,089 INFO L273 TraceCheckUtils]: 168: Hoare triple {30805#(<= xor_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30812#(<= xor_~i~0 4)} is VALID [2018-11-23 12:31:45,091 INFO L273 TraceCheckUtils]: 169: Hoare triple {30812#(<= xor_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30812#(<= xor_~i~0 4)} is VALID [2018-11-23 12:31:45,091 INFO L273 TraceCheckUtils]: 170: Hoare triple {30812#(<= xor_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30819#(<= xor_~i~0 5)} is VALID [2018-11-23 12:31:45,092 INFO L273 TraceCheckUtils]: 171: Hoare triple {30819#(<= xor_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30819#(<= xor_~i~0 5)} is VALID [2018-11-23 12:31:45,093 INFO L273 TraceCheckUtils]: 172: Hoare triple {30819#(<= xor_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30826#(<= xor_~i~0 6)} is VALID [2018-11-23 12:31:45,093 INFO L273 TraceCheckUtils]: 173: Hoare triple {30826#(<= xor_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30826#(<= xor_~i~0 6)} is VALID [2018-11-23 12:31:45,094 INFO L273 TraceCheckUtils]: 174: Hoare triple {30826#(<= xor_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30833#(<= xor_~i~0 7)} is VALID [2018-11-23 12:31:45,094 INFO L273 TraceCheckUtils]: 175: Hoare triple {30833#(<= xor_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30833#(<= xor_~i~0 7)} is VALID [2018-11-23 12:31:45,095 INFO L273 TraceCheckUtils]: 176: Hoare triple {30833#(<= xor_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30840#(<= xor_~i~0 8)} is VALID [2018-11-23 12:31:45,095 INFO L273 TraceCheckUtils]: 177: Hoare triple {30840#(<= xor_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30840#(<= xor_~i~0 8)} is VALID [2018-11-23 12:31:45,096 INFO L273 TraceCheckUtils]: 178: Hoare triple {30840#(<= xor_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30847#(<= xor_~i~0 9)} is VALID [2018-11-23 12:31:45,096 INFO L273 TraceCheckUtils]: 179: Hoare triple {30847#(<= xor_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30847#(<= xor_~i~0 9)} is VALID [2018-11-23 12:31:45,097 INFO L273 TraceCheckUtils]: 180: Hoare triple {30847#(<= xor_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30854#(<= xor_~i~0 10)} is VALID [2018-11-23 12:31:45,098 INFO L273 TraceCheckUtils]: 181: Hoare triple {30854#(<= xor_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30854#(<= xor_~i~0 10)} is VALID [2018-11-23 12:31:45,098 INFO L273 TraceCheckUtils]: 182: Hoare triple {30854#(<= xor_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30861#(<= xor_~i~0 11)} is VALID [2018-11-23 12:31:45,099 INFO L273 TraceCheckUtils]: 183: Hoare triple {30861#(<= xor_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {30861#(<= xor_~i~0 11)} is VALID [2018-11-23 12:31:45,100 INFO L273 TraceCheckUtils]: 184: Hoare triple {30861#(<= xor_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30868#(<= xor_~i~0 12)} is VALID [2018-11-23 12:31:45,100 INFO L273 TraceCheckUtils]: 185: Hoare triple {30868#(<= xor_~i~0 12)} assume !(~i~0 < 100000); {30264#false} is VALID [2018-11-23 12:31:45,100 INFO L273 TraceCheckUtils]: 186: Hoare triple {30264#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {30264#false} is VALID [2018-11-23 12:31:45,101 INFO L273 TraceCheckUtils]: 187: Hoare triple {30264#false} assume true; {30264#false} is VALID [2018-11-23 12:31:45,101 INFO L268 TraceCheckUtils]: 188: Hoare quadruple {30264#false} {30263#true} #74#return; {30264#false} is VALID [2018-11-23 12:31:45,101 INFO L273 TraceCheckUtils]: 189: Hoare triple {30264#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {30264#false} is VALID [2018-11-23 12:31:45,101 INFO L273 TraceCheckUtils]: 190: Hoare triple {30264#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {30264#false} is VALID [2018-11-23 12:31:45,101 INFO L273 TraceCheckUtils]: 191: Hoare triple {30264#false} assume !false; {30264#false} is VALID [2018-11-23 12:31:45,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2587 backedges. 536 proven. 121 refuted. 0 times theorem prover too weak. 1930 trivial. 0 not checked. [2018-11-23 12:31:45,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:31:45,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 14] total 51 [2018-11-23 12:31:45,137 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 192 [2018-11-23 12:31:45,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:31:45,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states. [2018-11-23 12:31:45,269 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:31:45,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-23 12:31:45,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-23 12:31:45,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=831, Invalid=1719, Unknown=0, NotChecked=0, Total=2550 [2018-11-23 12:31:45,271 INFO L87 Difference]: Start difference. First operand 139 states and 143 transitions. Second operand 51 states. [2018-11-23 12:31:46,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:31:46,629 INFO L93 Difference]: Finished difference Result 205 states and 217 transitions. [2018-11-23 12:31:46,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-23 12:31:46,629 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 192 [2018-11-23 12:31:46,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:31:46,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:31:46,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 154 transitions. [2018-11-23 12:31:46,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:31:46,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 154 transitions. [2018-11-23 12:31:46,632 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states and 154 transitions. [2018-11-23 12:31:46,786 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:31:46,789 INFO L225 Difference]: With dead ends: 205 [2018-11-23 12:31:46,789 INFO L226 Difference]: Without dead ends: 145 [2018-11-23 12:31:46,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=831, Invalid=1719, Unknown=0, NotChecked=0, Total=2550 [2018-11-23 12:31:46,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-11-23 12:31:46,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2018-11-23 12:31:46,841 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:31:46,841 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand 143 states. [2018-11-23 12:31:46,841 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand 143 states. [2018-11-23 12:31:46,841 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 143 states. [2018-11-23 12:31:46,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:31:46,844 INFO L93 Difference]: Finished difference Result 145 states and 149 transitions. [2018-11-23 12:31:46,844 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2018-11-23 12:31:46,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:31:46,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:31:46,844 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand 145 states. [2018-11-23 12:31:46,844 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 145 states. [2018-11-23 12:31:46,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:31:46,847 INFO L93 Difference]: Finished difference Result 145 states and 149 transitions. [2018-11-23 12:31:46,847 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2018-11-23 12:31:46,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:31:46,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:31:46,847 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:31:46,847 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:31:46,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-23 12:31:46,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 147 transitions. [2018-11-23 12:31:46,850 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 147 transitions. Word has length 192 [2018-11-23 12:31:46,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:31:46,850 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 147 transitions. [2018-11-23 12:31:46,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-23 12:31:46,850 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 147 transitions. [2018-11-23 12:31:46,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-11-23 12:31:46,851 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:31:46,852 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:31:46,852 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:31:46,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:31:46,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1360846649, now seen corresponding path program 37 times [2018-11-23 12:31:46,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:31:46,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:31:46,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:31:46,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:31:46,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:31:46,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:31:47,698 INFO L256 TraceCheckUtils]: 0: Hoare triple {31697#true} call ULTIMATE.init(); {31697#true} is VALID [2018-11-23 12:31:47,698 INFO L273 TraceCheckUtils]: 1: Hoare triple {31697#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {31697#true} is VALID [2018-11-23 12:31:47,698 INFO L273 TraceCheckUtils]: 2: Hoare triple {31697#true} assume true; {31697#true} is VALID [2018-11-23 12:31:47,698 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31697#true} {31697#true} #66#return; {31697#true} is VALID [2018-11-23 12:31:47,698 INFO L256 TraceCheckUtils]: 4: Hoare triple {31697#true} call #t~ret13 := main(); {31697#true} is VALID [2018-11-23 12:31:47,699 INFO L273 TraceCheckUtils]: 5: Hoare triple {31697#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {31699#(= main_~i~1 0)} is VALID [2018-11-23 12:31:47,699 INFO L273 TraceCheckUtils]: 6: Hoare triple {31699#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31699#(= main_~i~1 0)} is VALID [2018-11-23 12:31:47,700 INFO L273 TraceCheckUtils]: 7: Hoare triple {31699#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31700#(<= main_~i~1 1)} is VALID [2018-11-23 12:31:47,700 INFO L273 TraceCheckUtils]: 8: Hoare triple {31700#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31700#(<= main_~i~1 1)} is VALID [2018-11-23 12:31:47,701 INFO L273 TraceCheckUtils]: 9: Hoare triple {31700#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31701#(<= main_~i~1 2)} is VALID [2018-11-23 12:31:47,701 INFO L273 TraceCheckUtils]: 10: Hoare triple {31701#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31701#(<= main_~i~1 2)} is VALID [2018-11-23 12:31:47,701 INFO L273 TraceCheckUtils]: 11: Hoare triple {31701#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31702#(<= main_~i~1 3)} is VALID [2018-11-23 12:31:47,702 INFO L273 TraceCheckUtils]: 12: Hoare triple {31702#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31702#(<= main_~i~1 3)} is VALID [2018-11-23 12:31:47,702 INFO L273 TraceCheckUtils]: 13: Hoare triple {31702#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31703#(<= main_~i~1 4)} is VALID [2018-11-23 12:31:47,702 INFO L273 TraceCheckUtils]: 14: Hoare triple {31703#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31703#(<= main_~i~1 4)} is VALID [2018-11-23 12:31:47,703 INFO L273 TraceCheckUtils]: 15: Hoare triple {31703#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31704#(<= main_~i~1 5)} is VALID [2018-11-23 12:31:47,704 INFO L273 TraceCheckUtils]: 16: Hoare triple {31704#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31704#(<= main_~i~1 5)} is VALID [2018-11-23 12:31:47,704 INFO L273 TraceCheckUtils]: 17: Hoare triple {31704#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31705#(<= main_~i~1 6)} is VALID [2018-11-23 12:31:47,705 INFO L273 TraceCheckUtils]: 18: Hoare triple {31705#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31705#(<= main_~i~1 6)} is VALID [2018-11-23 12:31:47,706 INFO L273 TraceCheckUtils]: 19: Hoare triple {31705#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31706#(<= main_~i~1 7)} is VALID [2018-11-23 12:31:47,706 INFO L273 TraceCheckUtils]: 20: Hoare triple {31706#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31706#(<= main_~i~1 7)} is VALID [2018-11-23 12:31:47,707 INFO L273 TraceCheckUtils]: 21: Hoare triple {31706#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31707#(<= main_~i~1 8)} is VALID [2018-11-23 12:31:47,707 INFO L273 TraceCheckUtils]: 22: Hoare triple {31707#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31707#(<= main_~i~1 8)} is VALID [2018-11-23 12:31:47,708 INFO L273 TraceCheckUtils]: 23: Hoare triple {31707#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31708#(<= main_~i~1 9)} is VALID [2018-11-23 12:31:47,709 INFO L273 TraceCheckUtils]: 24: Hoare triple {31708#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31708#(<= main_~i~1 9)} is VALID [2018-11-23 12:31:47,709 INFO L273 TraceCheckUtils]: 25: Hoare triple {31708#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31709#(<= main_~i~1 10)} is VALID [2018-11-23 12:31:47,710 INFO L273 TraceCheckUtils]: 26: Hoare triple {31709#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31709#(<= main_~i~1 10)} is VALID [2018-11-23 12:31:47,710 INFO L273 TraceCheckUtils]: 27: Hoare triple {31709#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31710#(<= main_~i~1 11)} is VALID [2018-11-23 12:31:47,711 INFO L273 TraceCheckUtils]: 28: Hoare triple {31710#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31710#(<= main_~i~1 11)} is VALID [2018-11-23 12:31:47,712 INFO L273 TraceCheckUtils]: 29: Hoare triple {31710#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31711#(<= main_~i~1 12)} is VALID [2018-11-23 12:31:47,712 INFO L273 TraceCheckUtils]: 30: Hoare triple {31711#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31711#(<= main_~i~1 12)} is VALID [2018-11-23 12:31:47,713 INFO L273 TraceCheckUtils]: 31: Hoare triple {31711#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31712#(<= main_~i~1 13)} is VALID [2018-11-23 12:31:47,713 INFO L273 TraceCheckUtils]: 32: Hoare triple {31712#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31712#(<= main_~i~1 13)} is VALID [2018-11-23 12:31:47,714 INFO L273 TraceCheckUtils]: 33: Hoare triple {31712#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31713#(<= main_~i~1 14)} is VALID [2018-11-23 12:31:47,714 INFO L273 TraceCheckUtils]: 34: Hoare triple {31713#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31713#(<= main_~i~1 14)} is VALID [2018-11-23 12:31:47,715 INFO L273 TraceCheckUtils]: 35: Hoare triple {31713#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31714#(<= main_~i~1 15)} is VALID [2018-11-23 12:31:47,716 INFO L273 TraceCheckUtils]: 36: Hoare triple {31714#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31714#(<= main_~i~1 15)} is VALID [2018-11-23 12:31:47,716 INFO L273 TraceCheckUtils]: 37: Hoare triple {31714#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31715#(<= main_~i~1 16)} is VALID [2018-11-23 12:31:47,717 INFO L273 TraceCheckUtils]: 38: Hoare triple {31715#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31715#(<= main_~i~1 16)} is VALID [2018-11-23 12:31:47,717 INFO L273 TraceCheckUtils]: 39: Hoare triple {31715#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31716#(<= main_~i~1 17)} is VALID [2018-11-23 12:31:47,718 INFO L273 TraceCheckUtils]: 40: Hoare triple {31716#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31716#(<= main_~i~1 17)} is VALID [2018-11-23 12:31:47,718 INFO L273 TraceCheckUtils]: 41: Hoare triple {31716#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31717#(<= main_~i~1 18)} is VALID [2018-11-23 12:31:47,719 INFO L273 TraceCheckUtils]: 42: Hoare triple {31717#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31717#(<= main_~i~1 18)} is VALID [2018-11-23 12:31:47,720 INFO L273 TraceCheckUtils]: 43: Hoare triple {31717#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31718#(<= main_~i~1 19)} is VALID [2018-11-23 12:31:47,720 INFO L273 TraceCheckUtils]: 44: Hoare triple {31718#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31718#(<= main_~i~1 19)} is VALID [2018-11-23 12:31:47,721 INFO L273 TraceCheckUtils]: 45: Hoare triple {31718#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31719#(<= main_~i~1 20)} is VALID [2018-11-23 12:31:47,721 INFO L273 TraceCheckUtils]: 46: Hoare triple {31719#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31719#(<= main_~i~1 20)} is VALID [2018-11-23 12:31:47,722 INFO L273 TraceCheckUtils]: 47: Hoare triple {31719#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31720#(<= main_~i~1 21)} is VALID [2018-11-23 12:31:47,722 INFO L273 TraceCheckUtils]: 48: Hoare triple {31720#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31720#(<= main_~i~1 21)} is VALID [2018-11-23 12:31:47,723 INFO L273 TraceCheckUtils]: 49: Hoare triple {31720#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31721#(<= main_~i~1 22)} is VALID [2018-11-23 12:31:47,724 INFO L273 TraceCheckUtils]: 50: Hoare triple {31721#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31721#(<= main_~i~1 22)} is VALID [2018-11-23 12:31:47,724 INFO L273 TraceCheckUtils]: 51: Hoare triple {31721#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31722#(<= main_~i~1 23)} is VALID [2018-11-23 12:31:47,725 INFO L273 TraceCheckUtils]: 52: Hoare triple {31722#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31722#(<= main_~i~1 23)} is VALID [2018-11-23 12:31:47,725 INFO L273 TraceCheckUtils]: 53: Hoare triple {31722#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31723#(<= main_~i~1 24)} is VALID [2018-11-23 12:31:47,726 INFO L273 TraceCheckUtils]: 54: Hoare triple {31723#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31723#(<= main_~i~1 24)} is VALID [2018-11-23 12:31:47,727 INFO L273 TraceCheckUtils]: 55: Hoare triple {31723#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31724#(<= main_~i~1 25)} is VALID [2018-11-23 12:31:47,727 INFO L273 TraceCheckUtils]: 56: Hoare triple {31724#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31724#(<= main_~i~1 25)} is VALID [2018-11-23 12:31:47,728 INFO L273 TraceCheckUtils]: 57: Hoare triple {31724#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31725#(<= main_~i~1 26)} is VALID [2018-11-23 12:31:47,728 INFO L273 TraceCheckUtils]: 58: Hoare triple {31725#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31725#(<= main_~i~1 26)} is VALID [2018-11-23 12:31:47,729 INFO L273 TraceCheckUtils]: 59: Hoare triple {31725#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31726#(<= main_~i~1 27)} is VALID [2018-11-23 12:31:47,729 INFO L273 TraceCheckUtils]: 60: Hoare triple {31726#(<= main_~i~1 27)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31726#(<= main_~i~1 27)} is VALID [2018-11-23 12:31:47,730 INFO L273 TraceCheckUtils]: 61: Hoare triple {31726#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31727#(<= main_~i~1 28)} is VALID [2018-11-23 12:31:47,731 INFO L273 TraceCheckUtils]: 62: Hoare triple {31727#(<= main_~i~1 28)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31727#(<= main_~i~1 28)} is VALID [2018-11-23 12:31:47,731 INFO L273 TraceCheckUtils]: 63: Hoare triple {31727#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31728#(<= main_~i~1 29)} is VALID [2018-11-23 12:31:47,732 INFO L273 TraceCheckUtils]: 64: Hoare triple {31728#(<= main_~i~1 29)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31728#(<= main_~i~1 29)} is VALID [2018-11-23 12:31:47,732 INFO L273 TraceCheckUtils]: 65: Hoare triple {31728#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31729#(<= main_~i~1 30)} is VALID [2018-11-23 12:31:47,733 INFO L273 TraceCheckUtils]: 66: Hoare triple {31729#(<= main_~i~1 30)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31729#(<= main_~i~1 30)} is VALID [2018-11-23 12:31:47,734 INFO L273 TraceCheckUtils]: 67: Hoare triple {31729#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31730#(<= main_~i~1 31)} is VALID [2018-11-23 12:31:47,734 INFO L273 TraceCheckUtils]: 68: Hoare triple {31730#(<= main_~i~1 31)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31730#(<= main_~i~1 31)} is VALID [2018-11-23 12:31:47,735 INFO L273 TraceCheckUtils]: 69: Hoare triple {31730#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31731#(<= main_~i~1 32)} is VALID [2018-11-23 12:31:47,735 INFO L273 TraceCheckUtils]: 70: Hoare triple {31731#(<= main_~i~1 32)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31731#(<= main_~i~1 32)} is VALID [2018-11-23 12:31:47,736 INFO L273 TraceCheckUtils]: 71: Hoare triple {31731#(<= main_~i~1 32)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31732#(<= main_~i~1 33)} is VALID [2018-11-23 12:31:47,736 INFO L273 TraceCheckUtils]: 72: Hoare triple {31732#(<= main_~i~1 33)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31732#(<= main_~i~1 33)} is VALID [2018-11-23 12:31:47,737 INFO L273 TraceCheckUtils]: 73: Hoare triple {31732#(<= main_~i~1 33)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31733#(<= main_~i~1 34)} is VALID [2018-11-23 12:31:47,737 INFO L273 TraceCheckUtils]: 74: Hoare triple {31733#(<= main_~i~1 34)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31733#(<= main_~i~1 34)} is VALID [2018-11-23 12:31:47,738 INFO L273 TraceCheckUtils]: 75: Hoare triple {31733#(<= main_~i~1 34)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31734#(<= main_~i~1 35)} is VALID [2018-11-23 12:31:47,739 INFO L273 TraceCheckUtils]: 76: Hoare triple {31734#(<= main_~i~1 35)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31734#(<= main_~i~1 35)} is VALID [2018-11-23 12:31:47,739 INFO L273 TraceCheckUtils]: 77: Hoare triple {31734#(<= main_~i~1 35)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31735#(<= main_~i~1 36)} is VALID [2018-11-23 12:31:47,740 INFO L273 TraceCheckUtils]: 78: Hoare triple {31735#(<= main_~i~1 36)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31735#(<= main_~i~1 36)} is VALID [2018-11-23 12:31:47,740 INFO L273 TraceCheckUtils]: 79: Hoare triple {31735#(<= main_~i~1 36)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31736#(<= main_~i~1 37)} is VALID [2018-11-23 12:31:47,741 INFO L273 TraceCheckUtils]: 80: Hoare triple {31736#(<= main_~i~1 37)} assume !(~i~1 < 100000); {31698#false} is VALID [2018-11-23 12:31:47,741 INFO L256 TraceCheckUtils]: 81: Hoare triple {31698#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {31697#true} is VALID [2018-11-23 12:31:47,741 INFO L273 TraceCheckUtils]: 82: Hoare triple {31697#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {31697#true} is VALID [2018-11-23 12:31:47,742 INFO L273 TraceCheckUtils]: 83: Hoare triple {31697#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31697#true} is VALID [2018-11-23 12:31:47,742 INFO L273 TraceCheckUtils]: 84: Hoare triple {31697#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31697#true} is VALID [2018-11-23 12:31:47,742 INFO L273 TraceCheckUtils]: 85: Hoare triple {31697#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31697#true} is VALID [2018-11-23 12:31:47,742 INFO L273 TraceCheckUtils]: 86: Hoare triple {31697#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31697#true} is VALID [2018-11-23 12:31:47,742 INFO L273 TraceCheckUtils]: 87: Hoare triple {31697#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31697#true} is VALID [2018-11-23 12:31:47,743 INFO L273 TraceCheckUtils]: 88: Hoare triple {31697#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31697#true} is VALID [2018-11-23 12:31:47,743 INFO L273 TraceCheckUtils]: 89: Hoare triple {31697#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31697#true} is VALID [2018-11-23 12:31:47,743 INFO L273 TraceCheckUtils]: 90: Hoare triple {31697#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31697#true} is VALID [2018-11-23 12:31:47,743 INFO L273 TraceCheckUtils]: 91: Hoare triple {31697#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31697#true} is VALID [2018-11-23 12:31:47,743 INFO L273 TraceCheckUtils]: 92: Hoare triple {31697#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31697#true} is VALID [2018-11-23 12:31:47,743 INFO L273 TraceCheckUtils]: 93: Hoare triple {31697#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31697#true} is VALID [2018-11-23 12:31:47,744 INFO L273 TraceCheckUtils]: 94: Hoare triple {31697#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31697#true} is VALID [2018-11-23 12:31:47,744 INFO L273 TraceCheckUtils]: 95: Hoare triple {31697#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31697#true} is VALID [2018-11-23 12:31:47,744 INFO L273 TraceCheckUtils]: 96: Hoare triple {31697#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31697#true} is VALID [2018-11-23 12:31:47,744 INFO L273 TraceCheckUtils]: 97: Hoare triple {31697#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31697#true} is VALID [2018-11-23 12:31:47,744 INFO L273 TraceCheckUtils]: 98: Hoare triple {31697#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31697#true} is VALID [2018-11-23 12:31:47,744 INFO L273 TraceCheckUtils]: 99: Hoare triple {31697#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31697#true} is VALID [2018-11-23 12:31:47,744 INFO L273 TraceCheckUtils]: 100: Hoare triple {31697#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31697#true} is VALID [2018-11-23 12:31:47,745 INFO L273 TraceCheckUtils]: 101: Hoare triple {31697#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31697#true} is VALID [2018-11-23 12:31:47,745 INFO L273 TraceCheckUtils]: 102: Hoare triple {31697#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31697#true} is VALID [2018-11-23 12:31:47,745 INFO L273 TraceCheckUtils]: 103: Hoare triple {31697#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31697#true} is VALID [2018-11-23 12:31:47,745 INFO L273 TraceCheckUtils]: 104: Hoare triple {31697#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31697#true} is VALID [2018-11-23 12:31:47,745 INFO L273 TraceCheckUtils]: 105: Hoare triple {31697#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31697#true} is VALID [2018-11-23 12:31:47,745 INFO L273 TraceCheckUtils]: 106: Hoare triple {31697#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31697#true} is VALID [2018-11-23 12:31:47,745 INFO L273 TraceCheckUtils]: 107: Hoare triple {31697#true} assume !(~i~0 < 100000); {31697#true} is VALID [2018-11-23 12:31:47,746 INFO L273 TraceCheckUtils]: 108: Hoare triple {31697#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {31697#true} is VALID [2018-11-23 12:31:47,746 INFO L273 TraceCheckUtils]: 109: Hoare triple {31697#true} assume true; {31697#true} is VALID [2018-11-23 12:31:47,746 INFO L268 TraceCheckUtils]: 110: Hoare quadruple {31697#true} {31698#false} #70#return; {31698#false} is VALID [2018-11-23 12:31:47,746 INFO L273 TraceCheckUtils]: 111: Hoare triple {31698#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {31698#false} is VALID [2018-11-23 12:31:47,746 INFO L256 TraceCheckUtils]: 112: Hoare triple {31698#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {31697#true} is VALID [2018-11-23 12:31:47,746 INFO L273 TraceCheckUtils]: 113: Hoare triple {31697#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {31697#true} is VALID [2018-11-23 12:31:47,746 INFO L273 TraceCheckUtils]: 114: Hoare triple {31697#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31697#true} is VALID [2018-11-23 12:31:47,746 INFO L273 TraceCheckUtils]: 115: Hoare triple {31697#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31697#true} is VALID [2018-11-23 12:31:47,746 INFO L273 TraceCheckUtils]: 116: Hoare triple {31697#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31697#true} is VALID [2018-11-23 12:31:47,747 INFO L273 TraceCheckUtils]: 117: Hoare triple {31697#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31697#true} is VALID [2018-11-23 12:31:47,747 INFO L273 TraceCheckUtils]: 118: Hoare triple {31697#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31697#true} is VALID [2018-11-23 12:31:47,747 INFO L273 TraceCheckUtils]: 119: Hoare triple {31697#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31697#true} is VALID [2018-11-23 12:31:47,747 INFO L273 TraceCheckUtils]: 120: Hoare triple {31697#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31697#true} is VALID [2018-11-23 12:31:47,747 INFO L273 TraceCheckUtils]: 121: Hoare triple {31697#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31697#true} is VALID [2018-11-23 12:31:47,747 INFO L273 TraceCheckUtils]: 122: Hoare triple {31697#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31697#true} is VALID [2018-11-23 12:31:47,747 INFO L273 TraceCheckUtils]: 123: Hoare triple {31697#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31697#true} is VALID [2018-11-23 12:31:47,747 INFO L273 TraceCheckUtils]: 124: Hoare triple {31697#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31697#true} is VALID [2018-11-23 12:31:47,747 INFO L273 TraceCheckUtils]: 125: Hoare triple {31697#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31697#true} is VALID [2018-11-23 12:31:47,747 INFO L273 TraceCheckUtils]: 126: Hoare triple {31697#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31697#true} is VALID [2018-11-23 12:31:47,748 INFO L273 TraceCheckUtils]: 127: Hoare triple {31697#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31697#true} is VALID [2018-11-23 12:31:47,748 INFO L273 TraceCheckUtils]: 128: Hoare triple {31697#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31697#true} is VALID [2018-11-23 12:31:47,748 INFO L273 TraceCheckUtils]: 129: Hoare triple {31697#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31697#true} is VALID [2018-11-23 12:31:47,748 INFO L273 TraceCheckUtils]: 130: Hoare triple {31697#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31697#true} is VALID [2018-11-23 12:31:47,748 INFO L273 TraceCheckUtils]: 131: Hoare triple {31697#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31697#true} is VALID [2018-11-23 12:31:47,748 INFO L273 TraceCheckUtils]: 132: Hoare triple {31697#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31697#true} is VALID [2018-11-23 12:31:47,748 INFO L273 TraceCheckUtils]: 133: Hoare triple {31697#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31697#true} is VALID [2018-11-23 12:31:47,748 INFO L273 TraceCheckUtils]: 134: Hoare triple {31697#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31697#true} is VALID [2018-11-23 12:31:47,748 INFO L273 TraceCheckUtils]: 135: Hoare triple {31697#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31697#true} is VALID [2018-11-23 12:31:47,748 INFO L273 TraceCheckUtils]: 136: Hoare triple {31697#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31697#true} is VALID [2018-11-23 12:31:47,749 INFO L273 TraceCheckUtils]: 137: Hoare triple {31697#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31697#true} is VALID [2018-11-23 12:31:47,749 INFO L273 TraceCheckUtils]: 138: Hoare triple {31697#true} assume !(~i~0 < 100000); {31697#true} is VALID [2018-11-23 12:31:47,749 INFO L273 TraceCheckUtils]: 139: Hoare triple {31697#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {31697#true} is VALID [2018-11-23 12:31:47,749 INFO L273 TraceCheckUtils]: 140: Hoare triple {31697#true} assume true; {31697#true} is VALID [2018-11-23 12:31:47,749 INFO L268 TraceCheckUtils]: 141: Hoare quadruple {31697#true} {31698#false} #72#return; {31698#false} is VALID [2018-11-23 12:31:47,749 INFO L273 TraceCheckUtils]: 142: Hoare triple {31698#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {31698#false} is VALID [2018-11-23 12:31:47,749 INFO L273 TraceCheckUtils]: 143: Hoare triple {31698#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31698#false} is VALID [2018-11-23 12:31:47,749 INFO L273 TraceCheckUtils]: 144: Hoare triple {31698#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31698#false} is VALID [2018-11-23 12:31:47,749 INFO L273 TraceCheckUtils]: 145: Hoare triple {31698#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31698#false} is VALID [2018-11-23 12:31:47,749 INFO L273 TraceCheckUtils]: 146: Hoare triple {31698#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31698#false} is VALID [2018-11-23 12:31:47,750 INFO L273 TraceCheckUtils]: 147: Hoare triple {31698#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31698#false} is VALID [2018-11-23 12:31:47,750 INFO L273 TraceCheckUtils]: 148: Hoare triple {31698#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31698#false} is VALID [2018-11-23 12:31:47,750 INFO L273 TraceCheckUtils]: 149: Hoare triple {31698#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31698#false} is VALID [2018-11-23 12:31:47,750 INFO L273 TraceCheckUtils]: 150: Hoare triple {31698#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31698#false} is VALID [2018-11-23 12:31:47,750 INFO L273 TraceCheckUtils]: 151: Hoare triple {31698#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31698#false} is VALID [2018-11-23 12:31:47,750 INFO L273 TraceCheckUtils]: 152: Hoare triple {31698#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31698#false} is VALID [2018-11-23 12:31:47,750 INFO L273 TraceCheckUtils]: 153: Hoare triple {31698#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31698#false} is VALID [2018-11-23 12:31:47,750 INFO L273 TraceCheckUtils]: 154: Hoare triple {31698#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31698#false} is VALID [2018-11-23 12:31:47,750 INFO L273 TraceCheckUtils]: 155: Hoare triple {31698#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31698#false} is VALID [2018-11-23 12:31:47,750 INFO L273 TraceCheckUtils]: 156: Hoare triple {31698#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31698#false} is VALID [2018-11-23 12:31:47,751 INFO L273 TraceCheckUtils]: 157: Hoare triple {31698#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31698#false} is VALID [2018-11-23 12:31:47,751 INFO L273 TraceCheckUtils]: 158: Hoare triple {31698#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31698#false} is VALID [2018-11-23 12:31:47,751 INFO L273 TraceCheckUtils]: 159: Hoare triple {31698#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31698#false} is VALID [2018-11-23 12:31:47,751 INFO L273 TraceCheckUtils]: 160: Hoare triple {31698#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31698#false} is VALID [2018-11-23 12:31:47,751 INFO L273 TraceCheckUtils]: 161: Hoare triple {31698#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31698#false} is VALID [2018-11-23 12:31:47,751 INFO L273 TraceCheckUtils]: 162: Hoare triple {31698#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31698#false} is VALID [2018-11-23 12:31:47,751 INFO L273 TraceCheckUtils]: 163: Hoare triple {31698#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31698#false} is VALID [2018-11-23 12:31:47,751 INFO L273 TraceCheckUtils]: 164: Hoare triple {31698#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31698#false} is VALID [2018-11-23 12:31:47,751 INFO L273 TraceCheckUtils]: 165: Hoare triple {31698#false} assume !(~i~2 < 99999); {31698#false} is VALID [2018-11-23 12:31:47,751 INFO L273 TraceCheckUtils]: 166: Hoare triple {31698#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {31698#false} is VALID [2018-11-23 12:31:47,752 INFO L256 TraceCheckUtils]: 167: Hoare triple {31698#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {31697#true} is VALID [2018-11-23 12:31:47,752 INFO L273 TraceCheckUtils]: 168: Hoare triple {31697#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {31697#true} is VALID [2018-11-23 12:31:47,752 INFO L273 TraceCheckUtils]: 169: Hoare triple {31697#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31697#true} is VALID [2018-11-23 12:31:47,752 INFO L273 TraceCheckUtils]: 170: Hoare triple {31697#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31697#true} is VALID [2018-11-23 12:31:47,752 INFO L273 TraceCheckUtils]: 171: Hoare triple {31697#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31697#true} is VALID [2018-11-23 12:31:47,752 INFO L273 TraceCheckUtils]: 172: Hoare triple {31697#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31697#true} is VALID [2018-11-23 12:31:47,752 INFO L273 TraceCheckUtils]: 173: Hoare triple {31697#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31697#true} is VALID [2018-11-23 12:31:47,752 INFO L273 TraceCheckUtils]: 174: Hoare triple {31697#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31697#true} is VALID [2018-11-23 12:31:47,752 INFO L273 TraceCheckUtils]: 175: Hoare triple {31697#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31697#true} is VALID [2018-11-23 12:31:47,753 INFO L273 TraceCheckUtils]: 176: Hoare triple {31697#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31697#true} is VALID [2018-11-23 12:31:47,753 INFO L273 TraceCheckUtils]: 177: Hoare triple {31697#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31697#true} is VALID [2018-11-23 12:31:47,753 INFO L273 TraceCheckUtils]: 178: Hoare triple {31697#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31697#true} is VALID [2018-11-23 12:31:47,753 INFO L273 TraceCheckUtils]: 179: Hoare triple {31697#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31697#true} is VALID [2018-11-23 12:31:47,753 INFO L273 TraceCheckUtils]: 180: Hoare triple {31697#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31697#true} is VALID [2018-11-23 12:31:47,753 INFO L273 TraceCheckUtils]: 181: Hoare triple {31697#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31697#true} is VALID [2018-11-23 12:31:47,753 INFO L273 TraceCheckUtils]: 182: Hoare triple {31697#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31697#true} is VALID [2018-11-23 12:31:47,753 INFO L273 TraceCheckUtils]: 183: Hoare triple {31697#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31697#true} is VALID [2018-11-23 12:31:47,753 INFO L273 TraceCheckUtils]: 184: Hoare triple {31697#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31697#true} is VALID [2018-11-23 12:31:47,753 INFO L273 TraceCheckUtils]: 185: Hoare triple {31697#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31697#true} is VALID [2018-11-23 12:31:47,754 INFO L273 TraceCheckUtils]: 186: Hoare triple {31697#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31697#true} is VALID [2018-11-23 12:31:47,754 INFO L273 TraceCheckUtils]: 187: Hoare triple {31697#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31697#true} is VALID [2018-11-23 12:31:47,754 INFO L273 TraceCheckUtils]: 188: Hoare triple {31697#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31697#true} is VALID [2018-11-23 12:31:47,754 INFO L273 TraceCheckUtils]: 189: Hoare triple {31697#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31697#true} is VALID [2018-11-23 12:31:47,754 INFO L273 TraceCheckUtils]: 190: Hoare triple {31697#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31697#true} is VALID [2018-11-23 12:31:47,754 INFO L273 TraceCheckUtils]: 191: Hoare triple {31697#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31697#true} is VALID [2018-11-23 12:31:47,754 INFO L273 TraceCheckUtils]: 192: Hoare triple {31697#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31697#true} is VALID [2018-11-23 12:31:47,754 INFO L273 TraceCheckUtils]: 193: Hoare triple {31697#true} assume !(~i~0 < 100000); {31697#true} is VALID [2018-11-23 12:31:47,754 INFO L273 TraceCheckUtils]: 194: Hoare triple {31697#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {31697#true} is VALID [2018-11-23 12:31:47,754 INFO L273 TraceCheckUtils]: 195: Hoare triple {31697#true} assume true; {31697#true} is VALID [2018-11-23 12:31:47,755 INFO L268 TraceCheckUtils]: 196: Hoare quadruple {31697#true} {31698#false} #74#return; {31698#false} is VALID [2018-11-23 12:31:47,755 INFO L273 TraceCheckUtils]: 197: Hoare triple {31698#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {31698#false} is VALID [2018-11-23 12:31:47,755 INFO L273 TraceCheckUtils]: 198: Hoare triple {31698#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {31698#false} is VALID [2018-11-23 12:31:47,755 INFO L273 TraceCheckUtils]: 199: Hoare triple {31698#false} assume !false; {31698#false} is VALID [2018-11-23 12:31:47,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2018-11-23 12:31:47,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:31:47,772 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 12:31:47,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:31:47,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:31:47,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:31:47,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:31:48,185 INFO L256 TraceCheckUtils]: 0: Hoare triple {31697#true} call ULTIMATE.init(); {31697#true} is VALID [2018-11-23 12:31:48,185 INFO L273 TraceCheckUtils]: 1: Hoare triple {31697#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {31697#true} is VALID [2018-11-23 12:31:48,185 INFO L273 TraceCheckUtils]: 2: Hoare triple {31697#true} assume true; {31697#true} is VALID [2018-11-23 12:31:48,186 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31697#true} {31697#true} #66#return; {31697#true} is VALID [2018-11-23 12:31:48,186 INFO L256 TraceCheckUtils]: 4: Hoare triple {31697#true} call #t~ret13 := main(); {31697#true} is VALID [2018-11-23 12:31:48,187 INFO L273 TraceCheckUtils]: 5: Hoare triple {31697#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {31755#(<= main_~i~1 0)} is VALID [2018-11-23 12:31:48,187 INFO L273 TraceCheckUtils]: 6: Hoare triple {31755#(<= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31755#(<= main_~i~1 0)} is VALID [2018-11-23 12:31:48,188 INFO L273 TraceCheckUtils]: 7: Hoare triple {31755#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31700#(<= main_~i~1 1)} is VALID [2018-11-23 12:31:48,188 INFO L273 TraceCheckUtils]: 8: Hoare triple {31700#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31700#(<= main_~i~1 1)} is VALID [2018-11-23 12:31:48,188 INFO L273 TraceCheckUtils]: 9: Hoare triple {31700#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31701#(<= main_~i~1 2)} is VALID [2018-11-23 12:31:48,189 INFO L273 TraceCheckUtils]: 10: Hoare triple {31701#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31701#(<= main_~i~1 2)} is VALID [2018-11-23 12:31:48,189 INFO L273 TraceCheckUtils]: 11: Hoare triple {31701#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31702#(<= main_~i~1 3)} is VALID [2018-11-23 12:31:48,189 INFO L273 TraceCheckUtils]: 12: Hoare triple {31702#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31702#(<= main_~i~1 3)} is VALID [2018-11-23 12:31:48,190 INFO L273 TraceCheckUtils]: 13: Hoare triple {31702#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31703#(<= main_~i~1 4)} is VALID [2018-11-23 12:31:48,191 INFO L273 TraceCheckUtils]: 14: Hoare triple {31703#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31703#(<= main_~i~1 4)} is VALID [2018-11-23 12:31:48,191 INFO L273 TraceCheckUtils]: 15: Hoare triple {31703#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31704#(<= main_~i~1 5)} is VALID [2018-11-23 12:31:48,192 INFO L273 TraceCheckUtils]: 16: Hoare triple {31704#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31704#(<= main_~i~1 5)} is VALID [2018-11-23 12:31:48,192 INFO L273 TraceCheckUtils]: 17: Hoare triple {31704#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31705#(<= main_~i~1 6)} is VALID [2018-11-23 12:31:48,193 INFO L273 TraceCheckUtils]: 18: Hoare triple {31705#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31705#(<= main_~i~1 6)} is VALID [2018-11-23 12:31:48,194 INFO L273 TraceCheckUtils]: 19: Hoare triple {31705#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31706#(<= main_~i~1 7)} is VALID [2018-11-23 12:31:48,194 INFO L273 TraceCheckUtils]: 20: Hoare triple {31706#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31706#(<= main_~i~1 7)} is VALID [2018-11-23 12:31:48,195 INFO L273 TraceCheckUtils]: 21: Hoare triple {31706#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31707#(<= main_~i~1 8)} is VALID [2018-11-23 12:31:48,195 INFO L273 TraceCheckUtils]: 22: Hoare triple {31707#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31707#(<= main_~i~1 8)} is VALID [2018-11-23 12:31:48,196 INFO L273 TraceCheckUtils]: 23: Hoare triple {31707#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31708#(<= main_~i~1 9)} is VALID [2018-11-23 12:31:48,196 INFO L273 TraceCheckUtils]: 24: Hoare triple {31708#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31708#(<= main_~i~1 9)} is VALID [2018-11-23 12:31:48,197 INFO L273 TraceCheckUtils]: 25: Hoare triple {31708#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31709#(<= main_~i~1 10)} is VALID [2018-11-23 12:31:48,198 INFO L273 TraceCheckUtils]: 26: Hoare triple {31709#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31709#(<= main_~i~1 10)} is VALID [2018-11-23 12:31:48,198 INFO L273 TraceCheckUtils]: 27: Hoare triple {31709#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31710#(<= main_~i~1 11)} is VALID [2018-11-23 12:31:48,199 INFO L273 TraceCheckUtils]: 28: Hoare triple {31710#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31710#(<= main_~i~1 11)} is VALID [2018-11-23 12:31:48,200 INFO L273 TraceCheckUtils]: 29: Hoare triple {31710#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31711#(<= main_~i~1 12)} is VALID [2018-11-23 12:31:48,200 INFO L273 TraceCheckUtils]: 30: Hoare triple {31711#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31711#(<= main_~i~1 12)} is VALID [2018-11-23 12:31:48,201 INFO L273 TraceCheckUtils]: 31: Hoare triple {31711#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31712#(<= main_~i~1 13)} is VALID [2018-11-23 12:31:48,201 INFO L273 TraceCheckUtils]: 32: Hoare triple {31712#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31712#(<= main_~i~1 13)} is VALID [2018-11-23 12:31:48,202 INFO L273 TraceCheckUtils]: 33: Hoare triple {31712#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31713#(<= main_~i~1 14)} is VALID [2018-11-23 12:31:48,203 INFO L273 TraceCheckUtils]: 34: Hoare triple {31713#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31713#(<= main_~i~1 14)} is VALID [2018-11-23 12:31:48,203 INFO L273 TraceCheckUtils]: 35: Hoare triple {31713#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31714#(<= main_~i~1 15)} is VALID [2018-11-23 12:31:48,204 INFO L273 TraceCheckUtils]: 36: Hoare triple {31714#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31714#(<= main_~i~1 15)} is VALID [2018-11-23 12:31:48,205 INFO L273 TraceCheckUtils]: 37: Hoare triple {31714#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31715#(<= main_~i~1 16)} is VALID [2018-11-23 12:31:48,205 INFO L273 TraceCheckUtils]: 38: Hoare triple {31715#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31715#(<= main_~i~1 16)} is VALID [2018-11-23 12:31:48,206 INFO L273 TraceCheckUtils]: 39: Hoare triple {31715#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31716#(<= main_~i~1 17)} is VALID [2018-11-23 12:31:48,206 INFO L273 TraceCheckUtils]: 40: Hoare triple {31716#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31716#(<= main_~i~1 17)} is VALID [2018-11-23 12:31:48,207 INFO L273 TraceCheckUtils]: 41: Hoare triple {31716#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31717#(<= main_~i~1 18)} is VALID [2018-11-23 12:31:48,207 INFO L273 TraceCheckUtils]: 42: Hoare triple {31717#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31717#(<= main_~i~1 18)} is VALID [2018-11-23 12:31:48,208 INFO L273 TraceCheckUtils]: 43: Hoare triple {31717#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31718#(<= main_~i~1 19)} is VALID [2018-11-23 12:31:48,209 INFO L273 TraceCheckUtils]: 44: Hoare triple {31718#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31718#(<= main_~i~1 19)} is VALID [2018-11-23 12:31:48,209 INFO L273 TraceCheckUtils]: 45: Hoare triple {31718#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31719#(<= main_~i~1 20)} is VALID [2018-11-23 12:31:48,210 INFO L273 TraceCheckUtils]: 46: Hoare triple {31719#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31719#(<= main_~i~1 20)} is VALID [2018-11-23 12:31:48,211 INFO L273 TraceCheckUtils]: 47: Hoare triple {31719#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31720#(<= main_~i~1 21)} is VALID [2018-11-23 12:31:48,211 INFO L273 TraceCheckUtils]: 48: Hoare triple {31720#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31720#(<= main_~i~1 21)} is VALID [2018-11-23 12:31:48,212 INFO L273 TraceCheckUtils]: 49: Hoare triple {31720#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31721#(<= main_~i~1 22)} is VALID [2018-11-23 12:31:48,212 INFO L273 TraceCheckUtils]: 50: Hoare triple {31721#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31721#(<= main_~i~1 22)} is VALID [2018-11-23 12:31:48,213 INFO L273 TraceCheckUtils]: 51: Hoare triple {31721#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31722#(<= main_~i~1 23)} is VALID [2018-11-23 12:31:48,214 INFO L273 TraceCheckUtils]: 52: Hoare triple {31722#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31722#(<= main_~i~1 23)} is VALID [2018-11-23 12:31:48,214 INFO L273 TraceCheckUtils]: 53: Hoare triple {31722#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31723#(<= main_~i~1 24)} is VALID [2018-11-23 12:31:48,215 INFO L273 TraceCheckUtils]: 54: Hoare triple {31723#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31723#(<= main_~i~1 24)} is VALID [2018-11-23 12:31:48,216 INFO L273 TraceCheckUtils]: 55: Hoare triple {31723#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31724#(<= main_~i~1 25)} is VALID [2018-11-23 12:31:48,216 INFO L273 TraceCheckUtils]: 56: Hoare triple {31724#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31724#(<= main_~i~1 25)} is VALID [2018-11-23 12:31:48,217 INFO L273 TraceCheckUtils]: 57: Hoare triple {31724#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31725#(<= main_~i~1 26)} is VALID [2018-11-23 12:31:48,217 INFO L273 TraceCheckUtils]: 58: Hoare triple {31725#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31725#(<= main_~i~1 26)} is VALID [2018-11-23 12:31:48,218 INFO L273 TraceCheckUtils]: 59: Hoare triple {31725#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31726#(<= main_~i~1 27)} is VALID [2018-11-23 12:31:48,219 INFO L273 TraceCheckUtils]: 60: Hoare triple {31726#(<= main_~i~1 27)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31726#(<= main_~i~1 27)} is VALID [2018-11-23 12:31:48,219 INFO L273 TraceCheckUtils]: 61: Hoare triple {31726#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31727#(<= main_~i~1 28)} is VALID [2018-11-23 12:31:48,220 INFO L273 TraceCheckUtils]: 62: Hoare triple {31727#(<= main_~i~1 28)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31727#(<= main_~i~1 28)} is VALID [2018-11-23 12:31:48,221 INFO L273 TraceCheckUtils]: 63: Hoare triple {31727#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31728#(<= main_~i~1 29)} is VALID [2018-11-23 12:31:48,221 INFO L273 TraceCheckUtils]: 64: Hoare triple {31728#(<= main_~i~1 29)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31728#(<= main_~i~1 29)} is VALID [2018-11-23 12:31:48,222 INFO L273 TraceCheckUtils]: 65: Hoare triple {31728#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31729#(<= main_~i~1 30)} is VALID [2018-11-23 12:31:48,222 INFO L273 TraceCheckUtils]: 66: Hoare triple {31729#(<= main_~i~1 30)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31729#(<= main_~i~1 30)} is VALID [2018-11-23 12:31:48,223 INFO L273 TraceCheckUtils]: 67: Hoare triple {31729#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31730#(<= main_~i~1 31)} is VALID [2018-11-23 12:31:48,224 INFO L273 TraceCheckUtils]: 68: Hoare triple {31730#(<= main_~i~1 31)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31730#(<= main_~i~1 31)} is VALID [2018-11-23 12:31:48,224 INFO L273 TraceCheckUtils]: 69: Hoare triple {31730#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31731#(<= main_~i~1 32)} is VALID [2018-11-23 12:31:48,225 INFO L273 TraceCheckUtils]: 70: Hoare triple {31731#(<= main_~i~1 32)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31731#(<= main_~i~1 32)} is VALID [2018-11-23 12:31:48,225 INFO L273 TraceCheckUtils]: 71: Hoare triple {31731#(<= main_~i~1 32)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31732#(<= main_~i~1 33)} is VALID [2018-11-23 12:31:48,226 INFO L273 TraceCheckUtils]: 72: Hoare triple {31732#(<= main_~i~1 33)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31732#(<= main_~i~1 33)} is VALID [2018-11-23 12:31:48,227 INFO L273 TraceCheckUtils]: 73: Hoare triple {31732#(<= main_~i~1 33)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31733#(<= main_~i~1 34)} is VALID [2018-11-23 12:31:48,227 INFO L273 TraceCheckUtils]: 74: Hoare triple {31733#(<= main_~i~1 34)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31733#(<= main_~i~1 34)} is VALID [2018-11-23 12:31:48,228 INFO L273 TraceCheckUtils]: 75: Hoare triple {31733#(<= main_~i~1 34)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31734#(<= main_~i~1 35)} is VALID [2018-11-23 12:31:48,228 INFO L273 TraceCheckUtils]: 76: Hoare triple {31734#(<= main_~i~1 35)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31734#(<= main_~i~1 35)} is VALID [2018-11-23 12:31:48,229 INFO L273 TraceCheckUtils]: 77: Hoare triple {31734#(<= main_~i~1 35)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31735#(<= main_~i~1 36)} is VALID [2018-11-23 12:31:48,229 INFO L273 TraceCheckUtils]: 78: Hoare triple {31735#(<= main_~i~1 36)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31735#(<= main_~i~1 36)} is VALID [2018-11-23 12:31:48,230 INFO L273 TraceCheckUtils]: 79: Hoare triple {31735#(<= main_~i~1 36)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31736#(<= main_~i~1 37)} is VALID [2018-11-23 12:31:48,231 INFO L273 TraceCheckUtils]: 80: Hoare triple {31736#(<= main_~i~1 37)} assume !(~i~1 < 100000); {31698#false} is VALID [2018-11-23 12:31:48,231 INFO L256 TraceCheckUtils]: 81: Hoare triple {31698#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {31698#false} is VALID [2018-11-23 12:31:48,231 INFO L273 TraceCheckUtils]: 82: Hoare triple {31698#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {31698#false} is VALID [2018-11-23 12:31:48,231 INFO L273 TraceCheckUtils]: 83: Hoare triple {31698#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31698#false} is VALID [2018-11-23 12:31:48,231 INFO L273 TraceCheckUtils]: 84: Hoare triple {31698#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31698#false} is VALID [2018-11-23 12:31:48,232 INFO L273 TraceCheckUtils]: 85: Hoare triple {31698#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31698#false} is VALID [2018-11-23 12:31:48,232 INFO L273 TraceCheckUtils]: 86: Hoare triple {31698#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31698#false} is VALID [2018-11-23 12:31:48,232 INFO L273 TraceCheckUtils]: 87: Hoare triple {31698#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31698#false} is VALID [2018-11-23 12:31:48,232 INFO L273 TraceCheckUtils]: 88: Hoare triple {31698#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31698#false} is VALID [2018-11-23 12:31:48,232 INFO L273 TraceCheckUtils]: 89: Hoare triple {31698#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31698#false} is VALID [2018-11-23 12:31:48,232 INFO L273 TraceCheckUtils]: 90: Hoare triple {31698#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31698#false} is VALID [2018-11-23 12:31:48,233 INFO L273 TraceCheckUtils]: 91: Hoare triple {31698#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31698#false} is VALID [2018-11-23 12:31:48,233 INFO L273 TraceCheckUtils]: 92: Hoare triple {31698#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31698#false} is VALID [2018-11-23 12:31:48,233 INFO L273 TraceCheckUtils]: 93: Hoare triple {31698#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31698#false} is VALID [2018-11-23 12:31:48,233 INFO L273 TraceCheckUtils]: 94: Hoare triple {31698#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31698#false} is VALID [2018-11-23 12:31:48,233 INFO L273 TraceCheckUtils]: 95: Hoare triple {31698#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31698#false} is VALID [2018-11-23 12:31:48,233 INFO L273 TraceCheckUtils]: 96: Hoare triple {31698#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31698#false} is VALID [2018-11-23 12:31:48,233 INFO L273 TraceCheckUtils]: 97: Hoare triple {31698#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31698#false} is VALID [2018-11-23 12:31:48,234 INFO L273 TraceCheckUtils]: 98: Hoare triple {31698#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31698#false} is VALID [2018-11-23 12:31:48,234 INFO L273 TraceCheckUtils]: 99: Hoare triple {31698#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31698#false} is VALID [2018-11-23 12:31:48,234 INFO L273 TraceCheckUtils]: 100: Hoare triple {31698#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31698#false} is VALID [2018-11-23 12:31:48,234 INFO L273 TraceCheckUtils]: 101: Hoare triple {31698#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31698#false} is VALID [2018-11-23 12:31:48,234 INFO L273 TraceCheckUtils]: 102: Hoare triple {31698#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31698#false} is VALID [2018-11-23 12:31:48,234 INFO L273 TraceCheckUtils]: 103: Hoare triple {31698#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31698#false} is VALID [2018-11-23 12:31:48,234 INFO L273 TraceCheckUtils]: 104: Hoare triple {31698#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31698#false} is VALID [2018-11-23 12:31:48,234 INFO L273 TraceCheckUtils]: 105: Hoare triple {31698#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31698#false} is VALID [2018-11-23 12:31:48,234 INFO L273 TraceCheckUtils]: 106: Hoare triple {31698#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31698#false} is VALID [2018-11-23 12:31:48,234 INFO L273 TraceCheckUtils]: 107: Hoare triple {31698#false} assume !(~i~0 < 100000); {31698#false} is VALID [2018-11-23 12:31:48,235 INFO L273 TraceCheckUtils]: 108: Hoare triple {31698#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {31698#false} is VALID [2018-11-23 12:31:48,235 INFO L273 TraceCheckUtils]: 109: Hoare triple {31698#false} assume true; {31698#false} is VALID [2018-11-23 12:31:48,235 INFO L268 TraceCheckUtils]: 110: Hoare quadruple {31698#false} {31698#false} #70#return; {31698#false} is VALID [2018-11-23 12:31:48,235 INFO L273 TraceCheckUtils]: 111: Hoare triple {31698#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {31698#false} is VALID [2018-11-23 12:31:48,235 INFO L256 TraceCheckUtils]: 112: Hoare triple {31698#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {31698#false} is VALID [2018-11-23 12:31:48,235 INFO L273 TraceCheckUtils]: 113: Hoare triple {31698#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {31698#false} is VALID [2018-11-23 12:31:48,235 INFO L273 TraceCheckUtils]: 114: Hoare triple {31698#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31698#false} is VALID [2018-11-23 12:31:48,235 INFO L273 TraceCheckUtils]: 115: Hoare triple {31698#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31698#false} is VALID [2018-11-23 12:31:48,235 INFO L273 TraceCheckUtils]: 116: Hoare triple {31698#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31698#false} is VALID [2018-11-23 12:31:48,235 INFO L273 TraceCheckUtils]: 117: Hoare triple {31698#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31698#false} is VALID [2018-11-23 12:31:48,236 INFO L273 TraceCheckUtils]: 118: Hoare triple {31698#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31698#false} is VALID [2018-11-23 12:31:48,236 INFO L273 TraceCheckUtils]: 119: Hoare triple {31698#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31698#false} is VALID [2018-11-23 12:31:48,236 INFO L273 TraceCheckUtils]: 120: Hoare triple {31698#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31698#false} is VALID [2018-11-23 12:31:48,236 INFO L273 TraceCheckUtils]: 121: Hoare triple {31698#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31698#false} is VALID [2018-11-23 12:31:48,236 INFO L273 TraceCheckUtils]: 122: Hoare triple {31698#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31698#false} is VALID [2018-11-23 12:31:48,236 INFO L273 TraceCheckUtils]: 123: Hoare triple {31698#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31698#false} is VALID [2018-11-23 12:31:48,236 INFO L273 TraceCheckUtils]: 124: Hoare triple {31698#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31698#false} is VALID [2018-11-23 12:31:48,236 INFO L273 TraceCheckUtils]: 125: Hoare triple {31698#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31698#false} is VALID [2018-11-23 12:31:48,236 INFO L273 TraceCheckUtils]: 126: Hoare triple {31698#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31698#false} is VALID [2018-11-23 12:31:48,236 INFO L273 TraceCheckUtils]: 127: Hoare triple {31698#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31698#false} is VALID [2018-11-23 12:31:48,237 INFO L273 TraceCheckUtils]: 128: Hoare triple {31698#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31698#false} is VALID [2018-11-23 12:31:48,237 INFO L273 TraceCheckUtils]: 129: Hoare triple {31698#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31698#false} is VALID [2018-11-23 12:31:48,237 INFO L273 TraceCheckUtils]: 130: Hoare triple {31698#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31698#false} is VALID [2018-11-23 12:31:48,237 INFO L273 TraceCheckUtils]: 131: Hoare triple {31698#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31698#false} is VALID [2018-11-23 12:31:48,237 INFO L273 TraceCheckUtils]: 132: Hoare triple {31698#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31698#false} is VALID [2018-11-23 12:31:48,237 INFO L273 TraceCheckUtils]: 133: Hoare triple {31698#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31698#false} is VALID [2018-11-23 12:31:48,237 INFO L273 TraceCheckUtils]: 134: Hoare triple {31698#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31698#false} is VALID [2018-11-23 12:31:48,237 INFO L273 TraceCheckUtils]: 135: Hoare triple {31698#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31698#false} is VALID [2018-11-23 12:31:48,237 INFO L273 TraceCheckUtils]: 136: Hoare triple {31698#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31698#false} is VALID [2018-11-23 12:31:48,237 INFO L273 TraceCheckUtils]: 137: Hoare triple {31698#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31698#false} is VALID [2018-11-23 12:31:48,238 INFO L273 TraceCheckUtils]: 138: Hoare triple {31698#false} assume !(~i~0 < 100000); {31698#false} is VALID [2018-11-23 12:31:48,238 INFO L273 TraceCheckUtils]: 139: Hoare triple {31698#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {31698#false} is VALID [2018-11-23 12:31:48,238 INFO L273 TraceCheckUtils]: 140: Hoare triple {31698#false} assume true; {31698#false} is VALID [2018-11-23 12:31:48,238 INFO L268 TraceCheckUtils]: 141: Hoare quadruple {31698#false} {31698#false} #72#return; {31698#false} is VALID [2018-11-23 12:31:48,238 INFO L273 TraceCheckUtils]: 142: Hoare triple {31698#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {31698#false} is VALID [2018-11-23 12:31:48,238 INFO L273 TraceCheckUtils]: 143: Hoare triple {31698#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31698#false} is VALID [2018-11-23 12:31:48,238 INFO L273 TraceCheckUtils]: 144: Hoare triple {31698#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31698#false} is VALID [2018-11-23 12:31:48,238 INFO L273 TraceCheckUtils]: 145: Hoare triple {31698#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31698#false} is VALID [2018-11-23 12:31:48,238 INFO L273 TraceCheckUtils]: 146: Hoare triple {31698#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31698#false} is VALID [2018-11-23 12:31:48,239 INFO L273 TraceCheckUtils]: 147: Hoare triple {31698#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31698#false} is VALID [2018-11-23 12:31:48,239 INFO L273 TraceCheckUtils]: 148: Hoare triple {31698#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31698#false} is VALID [2018-11-23 12:31:48,239 INFO L273 TraceCheckUtils]: 149: Hoare triple {31698#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31698#false} is VALID [2018-11-23 12:31:48,239 INFO L273 TraceCheckUtils]: 150: Hoare triple {31698#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31698#false} is VALID [2018-11-23 12:31:48,239 INFO L273 TraceCheckUtils]: 151: Hoare triple {31698#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31698#false} is VALID [2018-11-23 12:31:48,239 INFO L273 TraceCheckUtils]: 152: Hoare triple {31698#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31698#false} is VALID [2018-11-23 12:31:48,239 INFO L273 TraceCheckUtils]: 153: Hoare triple {31698#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31698#false} is VALID [2018-11-23 12:31:48,239 INFO L273 TraceCheckUtils]: 154: Hoare triple {31698#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31698#false} is VALID [2018-11-23 12:31:48,239 INFO L273 TraceCheckUtils]: 155: Hoare triple {31698#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31698#false} is VALID [2018-11-23 12:31:48,239 INFO L273 TraceCheckUtils]: 156: Hoare triple {31698#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31698#false} is VALID [2018-11-23 12:31:48,240 INFO L273 TraceCheckUtils]: 157: Hoare triple {31698#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31698#false} is VALID [2018-11-23 12:31:48,240 INFO L273 TraceCheckUtils]: 158: Hoare triple {31698#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31698#false} is VALID [2018-11-23 12:31:48,240 INFO L273 TraceCheckUtils]: 159: Hoare triple {31698#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31698#false} is VALID [2018-11-23 12:31:48,240 INFO L273 TraceCheckUtils]: 160: Hoare triple {31698#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31698#false} is VALID [2018-11-23 12:31:48,240 INFO L273 TraceCheckUtils]: 161: Hoare triple {31698#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31698#false} is VALID [2018-11-23 12:31:48,240 INFO L273 TraceCheckUtils]: 162: Hoare triple {31698#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31698#false} is VALID [2018-11-23 12:31:48,240 INFO L273 TraceCheckUtils]: 163: Hoare triple {31698#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31698#false} is VALID [2018-11-23 12:31:48,240 INFO L273 TraceCheckUtils]: 164: Hoare triple {31698#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31698#false} is VALID [2018-11-23 12:31:48,240 INFO L273 TraceCheckUtils]: 165: Hoare triple {31698#false} assume !(~i~2 < 99999); {31698#false} is VALID [2018-11-23 12:31:48,240 INFO L273 TraceCheckUtils]: 166: Hoare triple {31698#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {31698#false} is VALID [2018-11-23 12:31:48,241 INFO L256 TraceCheckUtils]: 167: Hoare triple {31698#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {31698#false} is VALID [2018-11-23 12:31:48,241 INFO L273 TraceCheckUtils]: 168: Hoare triple {31698#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {31698#false} is VALID [2018-11-23 12:31:48,241 INFO L273 TraceCheckUtils]: 169: Hoare triple {31698#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31698#false} is VALID [2018-11-23 12:31:48,241 INFO L273 TraceCheckUtils]: 170: Hoare triple {31698#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31698#false} is VALID [2018-11-23 12:31:48,241 INFO L273 TraceCheckUtils]: 171: Hoare triple {31698#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31698#false} is VALID [2018-11-23 12:31:48,241 INFO L273 TraceCheckUtils]: 172: Hoare triple {31698#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31698#false} is VALID [2018-11-23 12:31:48,241 INFO L273 TraceCheckUtils]: 173: Hoare triple {31698#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31698#false} is VALID [2018-11-23 12:31:48,241 INFO L273 TraceCheckUtils]: 174: Hoare triple {31698#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31698#false} is VALID [2018-11-23 12:31:48,241 INFO L273 TraceCheckUtils]: 175: Hoare triple {31698#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31698#false} is VALID [2018-11-23 12:31:48,241 INFO L273 TraceCheckUtils]: 176: Hoare triple {31698#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31698#false} is VALID [2018-11-23 12:31:48,242 INFO L273 TraceCheckUtils]: 177: Hoare triple {31698#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31698#false} is VALID [2018-11-23 12:31:48,242 INFO L273 TraceCheckUtils]: 178: Hoare triple {31698#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31698#false} is VALID [2018-11-23 12:31:48,242 INFO L273 TraceCheckUtils]: 179: Hoare triple {31698#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31698#false} is VALID [2018-11-23 12:31:48,242 INFO L273 TraceCheckUtils]: 180: Hoare triple {31698#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31698#false} is VALID [2018-11-23 12:31:48,242 INFO L273 TraceCheckUtils]: 181: Hoare triple {31698#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31698#false} is VALID [2018-11-23 12:31:48,242 INFO L273 TraceCheckUtils]: 182: Hoare triple {31698#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31698#false} is VALID [2018-11-23 12:31:48,242 INFO L273 TraceCheckUtils]: 183: Hoare triple {31698#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31698#false} is VALID [2018-11-23 12:31:48,242 INFO L273 TraceCheckUtils]: 184: Hoare triple {31698#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31698#false} is VALID [2018-11-23 12:31:48,242 INFO L273 TraceCheckUtils]: 185: Hoare triple {31698#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31698#false} is VALID [2018-11-23 12:31:48,242 INFO L273 TraceCheckUtils]: 186: Hoare triple {31698#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31698#false} is VALID [2018-11-23 12:31:48,243 INFO L273 TraceCheckUtils]: 187: Hoare triple {31698#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31698#false} is VALID [2018-11-23 12:31:48,243 INFO L273 TraceCheckUtils]: 188: Hoare triple {31698#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31698#false} is VALID [2018-11-23 12:31:48,243 INFO L273 TraceCheckUtils]: 189: Hoare triple {31698#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31698#false} is VALID [2018-11-23 12:31:48,243 INFO L273 TraceCheckUtils]: 190: Hoare triple {31698#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31698#false} is VALID [2018-11-23 12:31:48,243 INFO L273 TraceCheckUtils]: 191: Hoare triple {31698#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {31698#false} is VALID [2018-11-23 12:31:48,243 INFO L273 TraceCheckUtils]: 192: Hoare triple {31698#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31698#false} is VALID [2018-11-23 12:31:48,243 INFO L273 TraceCheckUtils]: 193: Hoare triple {31698#false} assume !(~i~0 < 100000); {31698#false} is VALID [2018-11-23 12:31:48,243 INFO L273 TraceCheckUtils]: 194: Hoare triple {31698#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {31698#false} is VALID [2018-11-23 12:31:48,243 INFO L273 TraceCheckUtils]: 195: Hoare triple {31698#false} assume true; {31698#false} is VALID [2018-11-23 12:31:48,243 INFO L268 TraceCheckUtils]: 196: Hoare quadruple {31698#false} {31698#false} #74#return; {31698#false} is VALID [2018-11-23 12:31:48,244 INFO L273 TraceCheckUtils]: 197: Hoare triple {31698#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {31698#false} is VALID [2018-11-23 12:31:48,244 INFO L273 TraceCheckUtils]: 198: Hoare triple {31698#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {31698#false} is VALID [2018-11-23 12:31:48,244 INFO L273 TraceCheckUtils]: 199: Hoare triple {31698#false} assume !false; {31698#false} is VALID [2018-11-23 12:31:48,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2018-11-23 12:31:48,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:31:48,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2018-11-23 12:31:48,281 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 200 [2018-11-23 12:31:48,281 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:31:48,282 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states. [2018-11-23 12:31:48,396 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:31:48,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-23 12:31:48,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-23 12:31:48,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 12:31:48,398 INFO L87 Difference]: Start difference. First operand 143 states and 147 transitions. Second operand 41 states. [2018-11-23 12:31:49,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:31:49,609 INFO L93 Difference]: Finished difference Result 208 states and 216 transitions. [2018-11-23 12:31:49,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-23 12:31:49,610 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 200 [2018-11-23 12:31:49,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:31:49,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:31:49,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 128 transitions. [2018-11-23 12:31:49,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:31:49,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 128 transitions. [2018-11-23 12:31:49,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 128 transitions. [2018-11-23 12:31:49,741 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:31:49,744 INFO L225 Difference]: With dead ends: 208 [2018-11-23 12:31:49,744 INFO L226 Difference]: Without dead ends: 146 [2018-11-23 12:31:49,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 12:31:49,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-23 12:31:49,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2018-11-23 12:31:49,832 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:31:49,832 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand 145 states. [2018-11-23 12:31:49,832 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 145 states. [2018-11-23 12:31:49,832 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 145 states. [2018-11-23 12:31:49,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:31:49,835 INFO L93 Difference]: Finished difference Result 146 states and 150 transitions. [2018-11-23 12:31:49,835 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 150 transitions. [2018-11-23 12:31:49,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:31:49,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:31:49,835 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand 146 states. [2018-11-23 12:31:49,836 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 146 states. [2018-11-23 12:31:49,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:31:49,837 INFO L93 Difference]: Finished difference Result 146 states and 150 transitions. [2018-11-23 12:31:49,837 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 150 transitions. [2018-11-23 12:31:49,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:31:49,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:31:49,838 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:31:49,838 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:31:49,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-23 12:31:49,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 149 transitions. [2018-11-23 12:31:49,840 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 149 transitions. Word has length 200 [2018-11-23 12:31:49,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:31:49,840 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 149 transitions. [2018-11-23 12:31:49,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-23 12:31:49,840 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2018-11-23 12:31:49,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-23 12:31:49,841 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:31:49,841 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 36, 36, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:31:49,841 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:31:49,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:31:49,842 INFO L82 PathProgramCache]: Analyzing trace with hash 545362729, now seen corresponding path program 38 times [2018-11-23 12:31:49,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:31:49,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:31:49,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:31:49,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:31:49,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:31:49,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:31:51,621 INFO L256 TraceCheckUtils]: 0: Hoare triple {33155#true} call ULTIMATE.init(); {33155#true} is VALID [2018-11-23 12:31:51,622 INFO L273 TraceCheckUtils]: 1: Hoare triple {33155#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {33155#true} is VALID [2018-11-23 12:31:51,622 INFO L273 TraceCheckUtils]: 2: Hoare triple {33155#true} assume true; {33155#true} is VALID [2018-11-23 12:31:51,622 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33155#true} {33155#true} #66#return; {33155#true} is VALID [2018-11-23 12:31:51,622 INFO L256 TraceCheckUtils]: 4: Hoare triple {33155#true} call #t~ret13 := main(); {33155#true} is VALID [2018-11-23 12:31:51,623 INFO L273 TraceCheckUtils]: 5: Hoare triple {33155#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {33157#(= main_~i~1 0)} is VALID [2018-11-23 12:31:51,623 INFO L273 TraceCheckUtils]: 6: Hoare triple {33157#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33157#(= main_~i~1 0)} is VALID [2018-11-23 12:31:51,624 INFO L273 TraceCheckUtils]: 7: Hoare triple {33157#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33158#(<= main_~i~1 1)} is VALID [2018-11-23 12:31:51,625 INFO L273 TraceCheckUtils]: 8: Hoare triple {33158#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33158#(<= main_~i~1 1)} is VALID [2018-11-23 12:31:51,625 INFO L273 TraceCheckUtils]: 9: Hoare triple {33158#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33159#(<= main_~i~1 2)} is VALID [2018-11-23 12:31:51,626 INFO L273 TraceCheckUtils]: 10: Hoare triple {33159#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33159#(<= main_~i~1 2)} is VALID [2018-11-23 12:31:51,626 INFO L273 TraceCheckUtils]: 11: Hoare triple {33159#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33160#(<= main_~i~1 3)} is VALID [2018-11-23 12:31:51,627 INFO L273 TraceCheckUtils]: 12: Hoare triple {33160#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33160#(<= main_~i~1 3)} is VALID [2018-11-23 12:31:51,628 INFO L273 TraceCheckUtils]: 13: Hoare triple {33160#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33161#(<= main_~i~1 4)} is VALID [2018-11-23 12:31:51,628 INFO L273 TraceCheckUtils]: 14: Hoare triple {33161#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33161#(<= main_~i~1 4)} is VALID [2018-11-23 12:31:51,629 INFO L273 TraceCheckUtils]: 15: Hoare triple {33161#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33162#(<= main_~i~1 5)} is VALID [2018-11-23 12:31:51,629 INFO L273 TraceCheckUtils]: 16: Hoare triple {33162#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33162#(<= main_~i~1 5)} is VALID [2018-11-23 12:31:51,630 INFO L273 TraceCheckUtils]: 17: Hoare triple {33162#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33163#(<= main_~i~1 6)} is VALID [2018-11-23 12:31:51,630 INFO L273 TraceCheckUtils]: 18: Hoare triple {33163#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33163#(<= main_~i~1 6)} is VALID [2018-11-23 12:31:51,631 INFO L273 TraceCheckUtils]: 19: Hoare triple {33163#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33164#(<= main_~i~1 7)} is VALID [2018-11-23 12:31:51,632 INFO L273 TraceCheckUtils]: 20: Hoare triple {33164#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33164#(<= main_~i~1 7)} is VALID [2018-11-23 12:31:51,632 INFO L273 TraceCheckUtils]: 21: Hoare triple {33164#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33165#(<= main_~i~1 8)} is VALID [2018-11-23 12:31:51,633 INFO L273 TraceCheckUtils]: 22: Hoare triple {33165#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33165#(<= main_~i~1 8)} is VALID [2018-11-23 12:31:51,634 INFO L273 TraceCheckUtils]: 23: Hoare triple {33165#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33166#(<= main_~i~1 9)} is VALID [2018-11-23 12:31:51,634 INFO L273 TraceCheckUtils]: 24: Hoare triple {33166#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33166#(<= main_~i~1 9)} is VALID [2018-11-23 12:31:51,635 INFO L273 TraceCheckUtils]: 25: Hoare triple {33166#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33167#(<= main_~i~1 10)} is VALID [2018-11-23 12:31:51,635 INFO L273 TraceCheckUtils]: 26: Hoare triple {33167#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33167#(<= main_~i~1 10)} is VALID [2018-11-23 12:31:51,636 INFO L273 TraceCheckUtils]: 27: Hoare triple {33167#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33168#(<= main_~i~1 11)} is VALID [2018-11-23 12:31:51,637 INFO L273 TraceCheckUtils]: 28: Hoare triple {33168#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33168#(<= main_~i~1 11)} is VALID [2018-11-23 12:31:51,637 INFO L273 TraceCheckUtils]: 29: Hoare triple {33168#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33169#(<= main_~i~1 12)} is VALID [2018-11-23 12:31:51,638 INFO L273 TraceCheckUtils]: 30: Hoare triple {33169#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33169#(<= main_~i~1 12)} is VALID [2018-11-23 12:31:51,639 INFO L273 TraceCheckUtils]: 31: Hoare triple {33169#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33170#(<= main_~i~1 13)} is VALID [2018-11-23 12:31:51,639 INFO L273 TraceCheckUtils]: 32: Hoare triple {33170#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33170#(<= main_~i~1 13)} is VALID [2018-11-23 12:31:51,640 INFO L273 TraceCheckUtils]: 33: Hoare triple {33170#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33171#(<= main_~i~1 14)} is VALID [2018-11-23 12:31:51,640 INFO L273 TraceCheckUtils]: 34: Hoare triple {33171#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33171#(<= main_~i~1 14)} is VALID [2018-11-23 12:31:51,641 INFO L273 TraceCheckUtils]: 35: Hoare triple {33171#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33172#(<= main_~i~1 15)} is VALID [2018-11-23 12:31:51,641 INFO L273 TraceCheckUtils]: 36: Hoare triple {33172#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33172#(<= main_~i~1 15)} is VALID [2018-11-23 12:31:51,642 INFO L273 TraceCheckUtils]: 37: Hoare triple {33172#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33173#(<= main_~i~1 16)} is VALID [2018-11-23 12:31:51,643 INFO L273 TraceCheckUtils]: 38: Hoare triple {33173#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33173#(<= main_~i~1 16)} is VALID [2018-11-23 12:31:51,643 INFO L273 TraceCheckUtils]: 39: Hoare triple {33173#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33174#(<= main_~i~1 17)} is VALID [2018-11-23 12:31:51,644 INFO L273 TraceCheckUtils]: 40: Hoare triple {33174#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33174#(<= main_~i~1 17)} is VALID [2018-11-23 12:31:51,645 INFO L273 TraceCheckUtils]: 41: Hoare triple {33174#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33175#(<= main_~i~1 18)} is VALID [2018-11-23 12:31:51,645 INFO L273 TraceCheckUtils]: 42: Hoare triple {33175#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33175#(<= main_~i~1 18)} is VALID [2018-11-23 12:31:51,646 INFO L273 TraceCheckUtils]: 43: Hoare triple {33175#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33176#(<= main_~i~1 19)} is VALID [2018-11-23 12:31:51,646 INFO L273 TraceCheckUtils]: 44: Hoare triple {33176#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33176#(<= main_~i~1 19)} is VALID [2018-11-23 12:31:51,647 INFO L273 TraceCheckUtils]: 45: Hoare triple {33176#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33177#(<= main_~i~1 20)} is VALID [2018-11-23 12:31:51,648 INFO L273 TraceCheckUtils]: 46: Hoare triple {33177#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33177#(<= main_~i~1 20)} is VALID [2018-11-23 12:31:51,648 INFO L273 TraceCheckUtils]: 47: Hoare triple {33177#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33178#(<= main_~i~1 21)} is VALID [2018-11-23 12:31:51,649 INFO L273 TraceCheckUtils]: 48: Hoare triple {33178#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33178#(<= main_~i~1 21)} is VALID [2018-11-23 12:31:51,650 INFO L273 TraceCheckUtils]: 49: Hoare triple {33178#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33179#(<= main_~i~1 22)} is VALID [2018-11-23 12:31:51,650 INFO L273 TraceCheckUtils]: 50: Hoare triple {33179#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33179#(<= main_~i~1 22)} is VALID [2018-11-23 12:31:51,651 INFO L273 TraceCheckUtils]: 51: Hoare triple {33179#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33180#(<= main_~i~1 23)} is VALID [2018-11-23 12:31:51,651 INFO L273 TraceCheckUtils]: 52: Hoare triple {33180#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33180#(<= main_~i~1 23)} is VALID [2018-11-23 12:31:51,652 INFO L273 TraceCheckUtils]: 53: Hoare triple {33180#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33181#(<= main_~i~1 24)} is VALID [2018-11-23 12:31:51,653 INFO L273 TraceCheckUtils]: 54: Hoare triple {33181#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33181#(<= main_~i~1 24)} is VALID [2018-11-23 12:31:51,653 INFO L273 TraceCheckUtils]: 55: Hoare triple {33181#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33182#(<= main_~i~1 25)} is VALID [2018-11-23 12:31:51,654 INFO L273 TraceCheckUtils]: 56: Hoare triple {33182#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33182#(<= main_~i~1 25)} is VALID [2018-11-23 12:31:51,654 INFO L273 TraceCheckUtils]: 57: Hoare triple {33182#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33183#(<= main_~i~1 26)} is VALID [2018-11-23 12:31:51,655 INFO L273 TraceCheckUtils]: 58: Hoare triple {33183#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33183#(<= main_~i~1 26)} is VALID [2018-11-23 12:31:51,656 INFO L273 TraceCheckUtils]: 59: Hoare triple {33183#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33184#(<= main_~i~1 27)} is VALID [2018-11-23 12:31:51,656 INFO L273 TraceCheckUtils]: 60: Hoare triple {33184#(<= main_~i~1 27)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33184#(<= main_~i~1 27)} is VALID [2018-11-23 12:31:51,657 INFO L273 TraceCheckUtils]: 61: Hoare triple {33184#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33185#(<= main_~i~1 28)} is VALID [2018-11-23 12:31:51,657 INFO L273 TraceCheckUtils]: 62: Hoare triple {33185#(<= main_~i~1 28)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33185#(<= main_~i~1 28)} is VALID [2018-11-23 12:31:51,658 INFO L273 TraceCheckUtils]: 63: Hoare triple {33185#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33186#(<= main_~i~1 29)} is VALID [2018-11-23 12:31:51,659 INFO L273 TraceCheckUtils]: 64: Hoare triple {33186#(<= main_~i~1 29)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33186#(<= main_~i~1 29)} is VALID [2018-11-23 12:31:51,659 INFO L273 TraceCheckUtils]: 65: Hoare triple {33186#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33187#(<= main_~i~1 30)} is VALID [2018-11-23 12:31:51,660 INFO L273 TraceCheckUtils]: 66: Hoare triple {33187#(<= main_~i~1 30)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33187#(<= main_~i~1 30)} is VALID [2018-11-23 12:31:51,661 INFO L273 TraceCheckUtils]: 67: Hoare triple {33187#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33188#(<= main_~i~1 31)} is VALID [2018-11-23 12:31:51,661 INFO L273 TraceCheckUtils]: 68: Hoare triple {33188#(<= main_~i~1 31)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33188#(<= main_~i~1 31)} is VALID [2018-11-23 12:31:51,662 INFO L273 TraceCheckUtils]: 69: Hoare triple {33188#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33189#(<= main_~i~1 32)} is VALID [2018-11-23 12:31:51,662 INFO L273 TraceCheckUtils]: 70: Hoare triple {33189#(<= main_~i~1 32)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33189#(<= main_~i~1 32)} is VALID [2018-11-23 12:31:51,663 INFO L273 TraceCheckUtils]: 71: Hoare triple {33189#(<= main_~i~1 32)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33190#(<= main_~i~1 33)} is VALID [2018-11-23 12:31:51,664 INFO L273 TraceCheckUtils]: 72: Hoare triple {33190#(<= main_~i~1 33)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33190#(<= main_~i~1 33)} is VALID [2018-11-23 12:31:51,664 INFO L273 TraceCheckUtils]: 73: Hoare triple {33190#(<= main_~i~1 33)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33191#(<= main_~i~1 34)} is VALID [2018-11-23 12:31:51,665 INFO L273 TraceCheckUtils]: 74: Hoare triple {33191#(<= main_~i~1 34)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33191#(<= main_~i~1 34)} is VALID [2018-11-23 12:31:51,665 INFO L273 TraceCheckUtils]: 75: Hoare triple {33191#(<= main_~i~1 34)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33192#(<= main_~i~1 35)} is VALID [2018-11-23 12:31:51,666 INFO L273 TraceCheckUtils]: 76: Hoare triple {33192#(<= main_~i~1 35)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33192#(<= main_~i~1 35)} is VALID [2018-11-23 12:31:51,667 INFO L273 TraceCheckUtils]: 77: Hoare triple {33192#(<= main_~i~1 35)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33193#(<= main_~i~1 36)} is VALID [2018-11-23 12:31:51,667 INFO L273 TraceCheckUtils]: 78: Hoare triple {33193#(<= main_~i~1 36)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33193#(<= main_~i~1 36)} is VALID [2018-11-23 12:31:51,668 INFO L273 TraceCheckUtils]: 79: Hoare triple {33193#(<= main_~i~1 36)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33194#(<= main_~i~1 37)} is VALID [2018-11-23 12:31:51,668 INFO L273 TraceCheckUtils]: 80: Hoare triple {33194#(<= main_~i~1 37)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33194#(<= main_~i~1 37)} is VALID [2018-11-23 12:31:51,669 INFO L273 TraceCheckUtils]: 81: Hoare triple {33194#(<= main_~i~1 37)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33195#(<= main_~i~1 38)} is VALID [2018-11-23 12:31:51,670 INFO L273 TraceCheckUtils]: 82: Hoare triple {33195#(<= main_~i~1 38)} assume !(~i~1 < 100000); {33156#false} is VALID [2018-11-23 12:31:51,670 INFO L256 TraceCheckUtils]: 83: Hoare triple {33156#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {33155#true} is VALID [2018-11-23 12:31:51,670 INFO L273 TraceCheckUtils]: 84: Hoare triple {33155#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {33155#true} is VALID [2018-11-23 12:31:51,670 INFO L273 TraceCheckUtils]: 85: Hoare triple {33155#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33155#true} is VALID [2018-11-23 12:31:51,671 INFO L273 TraceCheckUtils]: 86: Hoare triple {33155#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33155#true} is VALID [2018-11-23 12:31:51,671 INFO L273 TraceCheckUtils]: 87: Hoare triple {33155#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33155#true} is VALID [2018-11-23 12:31:51,671 INFO L273 TraceCheckUtils]: 88: Hoare triple {33155#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33155#true} is VALID [2018-11-23 12:31:51,671 INFO L273 TraceCheckUtils]: 89: Hoare triple {33155#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33155#true} is VALID [2018-11-23 12:31:51,671 INFO L273 TraceCheckUtils]: 90: Hoare triple {33155#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33155#true} is VALID [2018-11-23 12:31:51,672 INFO L273 TraceCheckUtils]: 91: Hoare triple {33155#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33155#true} is VALID [2018-11-23 12:31:51,672 INFO L273 TraceCheckUtils]: 92: Hoare triple {33155#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33155#true} is VALID [2018-11-23 12:31:51,672 INFO L273 TraceCheckUtils]: 93: Hoare triple {33155#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33155#true} is VALID [2018-11-23 12:31:51,672 INFO L273 TraceCheckUtils]: 94: Hoare triple {33155#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33155#true} is VALID [2018-11-23 12:31:51,672 INFO L273 TraceCheckUtils]: 95: Hoare triple {33155#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33155#true} is VALID [2018-11-23 12:31:51,672 INFO L273 TraceCheckUtils]: 96: Hoare triple {33155#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33155#true} is VALID [2018-11-23 12:31:51,673 INFO L273 TraceCheckUtils]: 97: Hoare triple {33155#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33155#true} is VALID [2018-11-23 12:31:51,673 INFO L273 TraceCheckUtils]: 98: Hoare triple {33155#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33155#true} is VALID [2018-11-23 12:31:51,673 INFO L273 TraceCheckUtils]: 99: Hoare triple {33155#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33155#true} is VALID [2018-11-23 12:31:51,673 INFO L273 TraceCheckUtils]: 100: Hoare triple {33155#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33155#true} is VALID [2018-11-23 12:31:51,673 INFO L273 TraceCheckUtils]: 101: Hoare triple {33155#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33155#true} is VALID [2018-11-23 12:31:51,673 INFO L273 TraceCheckUtils]: 102: Hoare triple {33155#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33155#true} is VALID [2018-11-23 12:31:51,674 INFO L273 TraceCheckUtils]: 103: Hoare triple {33155#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33155#true} is VALID [2018-11-23 12:31:51,674 INFO L273 TraceCheckUtils]: 104: Hoare triple {33155#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33155#true} is VALID [2018-11-23 12:31:51,674 INFO L273 TraceCheckUtils]: 105: Hoare triple {33155#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33155#true} is VALID [2018-11-23 12:31:51,674 INFO L273 TraceCheckUtils]: 106: Hoare triple {33155#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33155#true} is VALID [2018-11-23 12:31:51,674 INFO L273 TraceCheckUtils]: 107: Hoare triple {33155#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33155#true} is VALID [2018-11-23 12:31:51,674 INFO L273 TraceCheckUtils]: 108: Hoare triple {33155#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33155#true} is VALID [2018-11-23 12:31:51,675 INFO L273 TraceCheckUtils]: 109: Hoare triple {33155#true} assume !(~i~0 < 100000); {33155#true} is VALID [2018-11-23 12:31:51,675 INFO L273 TraceCheckUtils]: 110: Hoare triple {33155#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {33155#true} is VALID [2018-11-23 12:31:51,675 INFO L273 TraceCheckUtils]: 111: Hoare triple {33155#true} assume true; {33155#true} is VALID [2018-11-23 12:31:51,675 INFO L268 TraceCheckUtils]: 112: Hoare quadruple {33155#true} {33156#false} #70#return; {33156#false} is VALID [2018-11-23 12:31:51,675 INFO L273 TraceCheckUtils]: 113: Hoare triple {33156#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {33156#false} is VALID [2018-11-23 12:31:51,675 INFO L256 TraceCheckUtils]: 114: Hoare triple {33156#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {33155#true} is VALID [2018-11-23 12:31:51,675 INFO L273 TraceCheckUtils]: 115: Hoare triple {33155#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {33155#true} is VALID [2018-11-23 12:31:51,675 INFO L273 TraceCheckUtils]: 116: Hoare triple {33155#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33155#true} is VALID [2018-11-23 12:31:51,675 INFO L273 TraceCheckUtils]: 117: Hoare triple {33155#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33155#true} is VALID [2018-11-23 12:31:51,676 INFO L273 TraceCheckUtils]: 118: Hoare triple {33155#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33155#true} is VALID [2018-11-23 12:31:51,676 INFO L273 TraceCheckUtils]: 119: Hoare triple {33155#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33155#true} is VALID [2018-11-23 12:31:51,676 INFO L273 TraceCheckUtils]: 120: Hoare triple {33155#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33155#true} is VALID [2018-11-23 12:31:51,676 INFO L273 TraceCheckUtils]: 121: Hoare triple {33155#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33155#true} is VALID [2018-11-23 12:31:51,676 INFO L273 TraceCheckUtils]: 122: Hoare triple {33155#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33155#true} is VALID [2018-11-23 12:31:51,676 INFO L273 TraceCheckUtils]: 123: Hoare triple {33155#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33155#true} is VALID [2018-11-23 12:31:51,676 INFO L273 TraceCheckUtils]: 124: Hoare triple {33155#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33155#true} is VALID [2018-11-23 12:31:51,676 INFO L273 TraceCheckUtils]: 125: Hoare triple {33155#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33155#true} is VALID [2018-11-23 12:31:51,676 INFO L273 TraceCheckUtils]: 126: Hoare triple {33155#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33155#true} is VALID [2018-11-23 12:31:51,677 INFO L273 TraceCheckUtils]: 127: Hoare triple {33155#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33155#true} is VALID [2018-11-23 12:31:51,677 INFO L273 TraceCheckUtils]: 128: Hoare triple {33155#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33155#true} is VALID [2018-11-23 12:31:51,677 INFO L273 TraceCheckUtils]: 129: Hoare triple {33155#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33155#true} is VALID [2018-11-23 12:31:51,677 INFO L273 TraceCheckUtils]: 130: Hoare triple {33155#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33155#true} is VALID [2018-11-23 12:31:51,677 INFO L273 TraceCheckUtils]: 131: Hoare triple {33155#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33155#true} is VALID [2018-11-23 12:31:51,677 INFO L273 TraceCheckUtils]: 132: Hoare triple {33155#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33155#true} is VALID [2018-11-23 12:31:51,677 INFO L273 TraceCheckUtils]: 133: Hoare triple {33155#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33155#true} is VALID [2018-11-23 12:31:51,677 INFO L273 TraceCheckUtils]: 134: Hoare triple {33155#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33155#true} is VALID [2018-11-23 12:31:51,677 INFO L273 TraceCheckUtils]: 135: Hoare triple {33155#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33155#true} is VALID [2018-11-23 12:31:51,677 INFO L273 TraceCheckUtils]: 136: Hoare triple {33155#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33155#true} is VALID [2018-11-23 12:31:51,678 INFO L273 TraceCheckUtils]: 137: Hoare triple {33155#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33155#true} is VALID [2018-11-23 12:31:51,678 INFO L273 TraceCheckUtils]: 138: Hoare triple {33155#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33155#true} is VALID [2018-11-23 12:31:51,678 INFO L273 TraceCheckUtils]: 139: Hoare triple {33155#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33155#true} is VALID [2018-11-23 12:31:51,678 INFO L273 TraceCheckUtils]: 140: Hoare triple {33155#true} assume !(~i~0 < 100000); {33155#true} is VALID [2018-11-23 12:31:51,678 INFO L273 TraceCheckUtils]: 141: Hoare triple {33155#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {33155#true} is VALID [2018-11-23 12:31:51,678 INFO L273 TraceCheckUtils]: 142: Hoare triple {33155#true} assume true; {33155#true} is VALID [2018-11-23 12:31:51,678 INFO L268 TraceCheckUtils]: 143: Hoare quadruple {33155#true} {33156#false} #72#return; {33156#false} is VALID [2018-11-23 12:31:51,678 INFO L273 TraceCheckUtils]: 144: Hoare triple {33156#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {33156#false} is VALID [2018-11-23 12:31:51,678 INFO L273 TraceCheckUtils]: 145: Hoare triple {33156#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33156#false} is VALID [2018-11-23 12:31:51,678 INFO L273 TraceCheckUtils]: 146: Hoare triple {33156#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33156#false} is VALID [2018-11-23 12:31:51,679 INFO L273 TraceCheckUtils]: 147: Hoare triple {33156#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33156#false} is VALID [2018-11-23 12:31:51,679 INFO L273 TraceCheckUtils]: 148: Hoare triple {33156#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33156#false} is VALID [2018-11-23 12:31:51,679 INFO L273 TraceCheckUtils]: 149: Hoare triple {33156#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33156#false} is VALID [2018-11-23 12:31:51,679 INFO L273 TraceCheckUtils]: 150: Hoare triple {33156#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33156#false} is VALID [2018-11-23 12:31:51,679 INFO L273 TraceCheckUtils]: 151: Hoare triple {33156#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33156#false} is VALID [2018-11-23 12:31:51,679 INFO L273 TraceCheckUtils]: 152: Hoare triple {33156#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33156#false} is VALID [2018-11-23 12:31:51,679 INFO L273 TraceCheckUtils]: 153: Hoare triple {33156#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33156#false} is VALID [2018-11-23 12:31:51,679 INFO L273 TraceCheckUtils]: 154: Hoare triple {33156#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33156#false} is VALID [2018-11-23 12:31:51,679 INFO L273 TraceCheckUtils]: 155: Hoare triple {33156#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33156#false} is VALID [2018-11-23 12:31:51,679 INFO L273 TraceCheckUtils]: 156: Hoare triple {33156#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33156#false} is VALID [2018-11-23 12:31:51,680 INFO L273 TraceCheckUtils]: 157: Hoare triple {33156#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33156#false} is VALID [2018-11-23 12:31:51,680 INFO L273 TraceCheckUtils]: 158: Hoare triple {33156#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33156#false} is VALID [2018-11-23 12:31:51,680 INFO L273 TraceCheckUtils]: 159: Hoare triple {33156#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33156#false} is VALID [2018-11-23 12:31:51,680 INFO L273 TraceCheckUtils]: 160: Hoare triple {33156#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33156#false} is VALID [2018-11-23 12:31:51,680 INFO L273 TraceCheckUtils]: 161: Hoare triple {33156#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33156#false} is VALID [2018-11-23 12:31:51,680 INFO L273 TraceCheckUtils]: 162: Hoare triple {33156#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33156#false} is VALID [2018-11-23 12:31:51,680 INFO L273 TraceCheckUtils]: 163: Hoare triple {33156#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33156#false} is VALID [2018-11-23 12:31:51,680 INFO L273 TraceCheckUtils]: 164: Hoare triple {33156#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33156#false} is VALID [2018-11-23 12:31:51,680 INFO L273 TraceCheckUtils]: 165: Hoare triple {33156#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33156#false} is VALID [2018-11-23 12:31:51,680 INFO L273 TraceCheckUtils]: 166: Hoare triple {33156#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33156#false} is VALID [2018-11-23 12:31:51,681 INFO L273 TraceCheckUtils]: 167: Hoare triple {33156#false} assume !(~i~2 < 99999); {33156#false} is VALID [2018-11-23 12:31:51,681 INFO L273 TraceCheckUtils]: 168: Hoare triple {33156#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {33156#false} is VALID [2018-11-23 12:31:51,681 INFO L256 TraceCheckUtils]: 169: Hoare triple {33156#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {33155#true} is VALID [2018-11-23 12:31:51,681 INFO L273 TraceCheckUtils]: 170: Hoare triple {33155#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {33155#true} is VALID [2018-11-23 12:31:51,681 INFO L273 TraceCheckUtils]: 171: Hoare triple {33155#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33155#true} is VALID [2018-11-23 12:31:51,681 INFO L273 TraceCheckUtils]: 172: Hoare triple {33155#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33155#true} is VALID [2018-11-23 12:31:51,681 INFO L273 TraceCheckUtils]: 173: Hoare triple {33155#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33155#true} is VALID [2018-11-23 12:31:51,681 INFO L273 TraceCheckUtils]: 174: Hoare triple {33155#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33155#true} is VALID [2018-11-23 12:31:51,681 INFO L273 TraceCheckUtils]: 175: Hoare triple {33155#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33155#true} is VALID [2018-11-23 12:31:51,682 INFO L273 TraceCheckUtils]: 176: Hoare triple {33155#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33155#true} is VALID [2018-11-23 12:31:51,682 INFO L273 TraceCheckUtils]: 177: Hoare triple {33155#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33155#true} is VALID [2018-11-23 12:31:51,682 INFO L273 TraceCheckUtils]: 178: Hoare triple {33155#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33155#true} is VALID [2018-11-23 12:31:51,682 INFO L273 TraceCheckUtils]: 179: Hoare triple {33155#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33155#true} is VALID [2018-11-23 12:31:51,682 INFO L273 TraceCheckUtils]: 180: Hoare triple {33155#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33155#true} is VALID [2018-11-23 12:31:51,682 INFO L273 TraceCheckUtils]: 181: Hoare triple {33155#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33155#true} is VALID [2018-11-23 12:31:51,682 INFO L273 TraceCheckUtils]: 182: Hoare triple {33155#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33155#true} is VALID [2018-11-23 12:31:51,682 INFO L273 TraceCheckUtils]: 183: Hoare triple {33155#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33155#true} is VALID [2018-11-23 12:31:51,682 INFO L273 TraceCheckUtils]: 184: Hoare triple {33155#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33155#true} is VALID [2018-11-23 12:31:51,682 INFO L273 TraceCheckUtils]: 185: Hoare triple {33155#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33155#true} is VALID [2018-11-23 12:31:51,683 INFO L273 TraceCheckUtils]: 186: Hoare triple {33155#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33155#true} is VALID [2018-11-23 12:31:51,683 INFO L273 TraceCheckUtils]: 187: Hoare triple {33155#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33155#true} is VALID [2018-11-23 12:31:51,683 INFO L273 TraceCheckUtils]: 188: Hoare triple {33155#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33155#true} is VALID [2018-11-23 12:31:51,683 INFO L273 TraceCheckUtils]: 189: Hoare triple {33155#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33155#true} is VALID [2018-11-23 12:31:51,683 INFO L273 TraceCheckUtils]: 190: Hoare triple {33155#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33155#true} is VALID [2018-11-23 12:31:51,683 INFO L273 TraceCheckUtils]: 191: Hoare triple {33155#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33155#true} is VALID [2018-11-23 12:31:51,683 INFO L273 TraceCheckUtils]: 192: Hoare triple {33155#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33155#true} is VALID [2018-11-23 12:31:51,683 INFO L273 TraceCheckUtils]: 193: Hoare triple {33155#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33155#true} is VALID [2018-11-23 12:31:51,683 INFO L273 TraceCheckUtils]: 194: Hoare triple {33155#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33155#true} is VALID [2018-11-23 12:31:51,683 INFO L273 TraceCheckUtils]: 195: Hoare triple {33155#true} assume !(~i~0 < 100000); {33155#true} is VALID [2018-11-23 12:31:51,684 INFO L273 TraceCheckUtils]: 196: Hoare triple {33155#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {33155#true} is VALID [2018-11-23 12:31:51,684 INFO L273 TraceCheckUtils]: 197: Hoare triple {33155#true} assume true; {33155#true} is VALID [2018-11-23 12:31:51,684 INFO L268 TraceCheckUtils]: 198: Hoare quadruple {33155#true} {33156#false} #74#return; {33156#false} is VALID [2018-11-23 12:31:51,684 INFO L273 TraceCheckUtils]: 199: Hoare triple {33156#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {33156#false} is VALID [2018-11-23 12:31:51,684 INFO L273 TraceCheckUtils]: 200: Hoare triple {33156#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {33156#false} is VALID [2018-11-23 12:31:51,684 INFO L273 TraceCheckUtils]: 201: Hoare triple {33156#false} assume !false; {33156#false} is VALID [2018-11-23 12:31:51,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2948 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2018-11-23 12:31:51,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:31:51,702 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 12:31:51,710 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:31:51,799 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:31:51,799 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:31:51,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:31:51,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:31:53,091 INFO L256 TraceCheckUtils]: 0: Hoare triple {33155#true} call ULTIMATE.init(); {33155#true} is VALID [2018-11-23 12:31:53,091 INFO L273 TraceCheckUtils]: 1: Hoare triple {33155#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {33155#true} is VALID [2018-11-23 12:31:53,091 INFO L273 TraceCheckUtils]: 2: Hoare triple {33155#true} assume true; {33155#true} is VALID [2018-11-23 12:31:53,092 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33155#true} {33155#true} #66#return; {33155#true} is VALID [2018-11-23 12:31:53,092 INFO L256 TraceCheckUtils]: 4: Hoare triple {33155#true} call #t~ret13 := main(); {33155#true} is VALID [2018-11-23 12:31:53,092 INFO L273 TraceCheckUtils]: 5: Hoare triple {33155#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {33214#(<= main_~i~1 0)} is VALID [2018-11-23 12:31:53,093 INFO L273 TraceCheckUtils]: 6: Hoare triple {33214#(<= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33214#(<= main_~i~1 0)} is VALID [2018-11-23 12:31:53,094 INFO L273 TraceCheckUtils]: 7: Hoare triple {33214#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33158#(<= main_~i~1 1)} is VALID [2018-11-23 12:31:53,094 INFO L273 TraceCheckUtils]: 8: Hoare triple {33158#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33158#(<= main_~i~1 1)} is VALID [2018-11-23 12:31:53,095 INFO L273 TraceCheckUtils]: 9: Hoare triple {33158#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33159#(<= main_~i~1 2)} is VALID [2018-11-23 12:31:53,095 INFO L273 TraceCheckUtils]: 10: Hoare triple {33159#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33159#(<= main_~i~1 2)} is VALID [2018-11-23 12:31:53,096 INFO L273 TraceCheckUtils]: 11: Hoare triple {33159#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33160#(<= main_~i~1 3)} is VALID [2018-11-23 12:31:53,096 INFO L273 TraceCheckUtils]: 12: Hoare triple {33160#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33160#(<= main_~i~1 3)} is VALID [2018-11-23 12:31:53,097 INFO L273 TraceCheckUtils]: 13: Hoare triple {33160#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33161#(<= main_~i~1 4)} is VALID [2018-11-23 12:31:53,098 INFO L273 TraceCheckUtils]: 14: Hoare triple {33161#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33161#(<= main_~i~1 4)} is VALID [2018-11-23 12:31:53,098 INFO L273 TraceCheckUtils]: 15: Hoare triple {33161#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33162#(<= main_~i~1 5)} is VALID [2018-11-23 12:31:53,099 INFO L273 TraceCheckUtils]: 16: Hoare triple {33162#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33162#(<= main_~i~1 5)} is VALID [2018-11-23 12:31:53,100 INFO L273 TraceCheckUtils]: 17: Hoare triple {33162#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33163#(<= main_~i~1 6)} is VALID [2018-11-23 12:31:53,100 INFO L273 TraceCheckUtils]: 18: Hoare triple {33163#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33163#(<= main_~i~1 6)} is VALID [2018-11-23 12:31:53,101 INFO L273 TraceCheckUtils]: 19: Hoare triple {33163#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33164#(<= main_~i~1 7)} is VALID [2018-11-23 12:31:53,101 INFO L273 TraceCheckUtils]: 20: Hoare triple {33164#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33164#(<= main_~i~1 7)} is VALID [2018-11-23 12:31:53,102 INFO L273 TraceCheckUtils]: 21: Hoare triple {33164#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33165#(<= main_~i~1 8)} is VALID [2018-11-23 12:31:53,102 INFO L273 TraceCheckUtils]: 22: Hoare triple {33165#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33165#(<= main_~i~1 8)} is VALID [2018-11-23 12:31:53,103 INFO L273 TraceCheckUtils]: 23: Hoare triple {33165#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33166#(<= main_~i~1 9)} is VALID [2018-11-23 12:31:53,104 INFO L273 TraceCheckUtils]: 24: Hoare triple {33166#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33166#(<= main_~i~1 9)} is VALID [2018-11-23 12:31:53,104 INFO L273 TraceCheckUtils]: 25: Hoare triple {33166#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33167#(<= main_~i~1 10)} is VALID [2018-11-23 12:31:53,105 INFO L273 TraceCheckUtils]: 26: Hoare triple {33167#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33167#(<= main_~i~1 10)} is VALID [2018-11-23 12:31:53,106 INFO L273 TraceCheckUtils]: 27: Hoare triple {33167#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33168#(<= main_~i~1 11)} is VALID [2018-11-23 12:31:53,106 INFO L273 TraceCheckUtils]: 28: Hoare triple {33168#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33168#(<= main_~i~1 11)} is VALID [2018-11-23 12:31:53,107 INFO L273 TraceCheckUtils]: 29: Hoare triple {33168#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33169#(<= main_~i~1 12)} is VALID [2018-11-23 12:31:53,107 INFO L273 TraceCheckUtils]: 30: Hoare triple {33169#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33169#(<= main_~i~1 12)} is VALID [2018-11-23 12:31:53,108 INFO L273 TraceCheckUtils]: 31: Hoare triple {33169#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33170#(<= main_~i~1 13)} is VALID [2018-11-23 12:31:53,108 INFO L273 TraceCheckUtils]: 32: Hoare triple {33170#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33170#(<= main_~i~1 13)} is VALID [2018-11-23 12:31:53,109 INFO L273 TraceCheckUtils]: 33: Hoare triple {33170#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33171#(<= main_~i~1 14)} is VALID [2018-11-23 12:31:53,110 INFO L273 TraceCheckUtils]: 34: Hoare triple {33171#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33171#(<= main_~i~1 14)} is VALID [2018-11-23 12:31:53,110 INFO L273 TraceCheckUtils]: 35: Hoare triple {33171#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33172#(<= main_~i~1 15)} is VALID [2018-11-23 12:31:53,111 INFO L273 TraceCheckUtils]: 36: Hoare triple {33172#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33172#(<= main_~i~1 15)} is VALID [2018-11-23 12:31:53,111 INFO L273 TraceCheckUtils]: 37: Hoare triple {33172#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33173#(<= main_~i~1 16)} is VALID [2018-11-23 12:31:53,112 INFO L273 TraceCheckUtils]: 38: Hoare triple {33173#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33173#(<= main_~i~1 16)} is VALID [2018-11-23 12:31:53,113 INFO L273 TraceCheckUtils]: 39: Hoare triple {33173#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33174#(<= main_~i~1 17)} is VALID [2018-11-23 12:31:53,113 INFO L273 TraceCheckUtils]: 40: Hoare triple {33174#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33174#(<= main_~i~1 17)} is VALID [2018-11-23 12:31:53,114 INFO L273 TraceCheckUtils]: 41: Hoare triple {33174#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33175#(<= main_~i~1 18)} is VALID [2018-11-23 12:31:53,114 INFO L273 TraceCheckUtils]: 42: Hoare triple {33175#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33175#(<= main_~i~1 18)} is VALID [2018-11-23 12:31:53,115 INFO L273 TraceCheckUtils]: 43: Hoare triple {33175#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33176#(<= main_~i~1 19)} is VALID [2018-11-23 12:31:53,115 INFO L273 TraceCheckUtils]: 44: Hoare triple {33176#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33176#(<= main_~i~1 19)} is VALID [2018-11-23 12:31:53,116 INFO L273 TraceCheckUtils]: 45: Hoare triple {33176#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33177#(<= main_~i~1 20)} is VALID [2018-11-23 12:31:53,117 INFO L273 TraceCheckUtils]: 46: Hoare triple {33177#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33177#(<= main_~i~1 20)} is VALID [2018-11-23 12:31:53,117 INFO L273 TraceCheckUtils]: 47: Hoare triple {33177#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33178#(<= main_~i~1 21)} is VALID [2018-11-23 12:31:53,118 INFO L273 TraceCheckUtils]: 48: Hoare triple {33178#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33178#(<= main_~i~1 21)} is VALID [2018-11-23 12:31:53,118 INFO L273 TraceCheckUtils]: 49: Hoare triple {33178#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33179#(<= main_~i~1 22)} is VALID [2018-11-23 12:31:53,119 INFO L273 TraceCheckUtils]: 50: Hoare triple {33179#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33179#(<= main_~i~1 22)} is VALID [2018-11-23 12:31:53,120 INFO L273 TraceCheckUtils]: 51: Hoare triple {33179#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33180#(<= main_~i~1 23)} is VALID [2018-11-23 12:31:53,120 INFO L273 TraceCheckUtils]: 52: Hoare triple {33180#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33180#(<= main_~i~1 23)} is VALID [2018-11-23 12:31:53,121 INFO L273 TraceCheckUtils]: 53: Hoare triple {33180#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33181#(<= main_~i~1 24)} is VALID [2018-11-23 12:31:53,121 INFO L273 TraceCheckUtils]: 54: Hoare triple {33181#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33181#(<= main_~i~1 24)} is VALID [2018-11-23 12:31:53,122 INFO L273 TraceCheckUtils]: 55: Hoare triple {33181#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33182#(<= main_~i~1 25)} is VALID [2018-11-23 12:31:53,122 INFO L273 TraceCheckUtils]: 56: Hoare triple {33182#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33182#(<= main_~i~1 25)} is VALID [2018-11-23 12:31:53,123 INFO L273 TraceCheckUtils]: 57: Hoare triple {33182#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33183#(<= main_~i~1 26)} is VALID [2018-11-23 12:31:53,124 INFO L273 TraceCheckUtils]: 58: Hoare triple {33183#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33183#(<= main_~i~1 26)} is VALID [2018-11-23 12:31:53,124 INFO L273 TraceCheckUtils]: 59: Hoare triple {33183#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33184#(<= main_~i~1 27)} is VALID [2018-11-23 12:31:53,125 INFO L273 TraceCheckUtils]: 60: Hoare triple {33184#(<= main_~i~1 27)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33184#(<= main_~i~1 27)} is VALID [2018-11-23 12:31:53,125 INFO L273 TraceCheckUtils]: 61: Hoare triple {33184#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33185#(<= main_~i~1 28)} is VALID [2018-11-23 12:31:53,126 INFO L273 TraceCheckUtils]: 62: Hoare triple {33185#(<= main_~i~1 28)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33185#(<= main_~i~1 28)} is VALID [2018-11-23 12:31:53,127 INFO L273 TraceCheckUtils]: 63: Hoare triple {33185#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33186#(<= main_~i~1 29)} is VALID [2018-11-23 12:31:53,127 INFO L273 TraceCheckUtils]: 64: Hoare triple {33186#(<= main_~i~1 29)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33186#(<= main_~i~1 29)} is VALID [2018-11-23 12:31:53,128 INFO L273 TraceCheckUtils]: 65: Hoare triple {33186#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33187#(<= main_~i~1 30)} is VALID [2018-11-23 12:31:53,128 INFO L273 TraceCheckUtils]: 66: Hoare triple {33187#(<= main_~i~1 30)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33187#(<= main_~i~1 30)} is VALID [2018-11-23 12:31:53,129 INFO L273 TraceCheckUtils]: 67: Hoare triple {33187#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33188#(<= main_~i~1 31)} is VALID [2018-11-23 12:31:53,130 INFO L273 TraceCheckUtils]: 68: Hoare triple {33188#(<= main_~i~1 31)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33188#(<= main_~i~1 31)} is VALID [2018-11-23 12:31:53,130 INFO L273 TraceCheckUtils]: 69: Hoare triple {33188#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33189#(<= main_~i~1 32)} is VALID [2018-11-23 12:31:53,131 INFO L273 TraceCheckUtils]: 70: Hoare triple {33189#(<= main_~i~1 32)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33189#(<= main_~i~1 32)} is VALID [2018-11-23 12:31:53,131 INFO L273 TraceCheckUtils]: 71: Hoare triple {33189#(<= main_~i~1 32)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33190#(<= main_~i~1 33)} is VALID [2018-11-23 12:31:53,132 INFO L273 TraceCheckUtils]: 72: Hoare triple {33190#(<= main_~i~1 33)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33190#(<= main_~i~1 33)} is VALID [2018-11-23 12:31:53,133 INFO L273 TraceCheckUtils]: 73: Hoare triple {33190#(<= main_~i~1 33)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33191#(<= main_~i~1 34)} is VALID [2018-11-23 12:31:53,133 INFO L273 TraceCheckUtils]: 74: Hoare triple {33191#(<= main_~i~1 34)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33191#(<= main_~i~1 34)} is VALID [2018-11-23 12:31:53,134 INFO L273 TraceCheckUtils]: 75: Hoare triple {33191#(<= main_~i~1 34)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33192#(<= main_~i~1 35)} is VALID [2018-11-23 12:31:53,134 INFO L273 TraceCheckUtils]: 76: Hoare triple {33192#(<= main_~i~1 35)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33192#(<= main_~i~1 35)} is VALID [2018-11-23 12:31:53,135 INFO L273 TraceCheckUtils]: 77: Hoare triple {33192#(<= main_~i~1 35)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33193#(<= main_~i~1 36)} is VALID [2018-11-23 12:31:53,136 INFO L273 TraceCheckUtils]: 78: Hoare triple {33193#(<= main_~i~1 36)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33193#(<= main_~i~1 36)} is VALID [2018-11-23 12:31:53,136 INFO L273 TraceCheckUtils]: 79: Hoare triple {33193#(<= main_~i~1 36)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33194#(<= main_~i~1 37)} is VALID [2018-11-23 12:31:53,137 INFO L273 TraceCheckUtils]: 80: Hoare triple {33194#(<= main_~i~1 37)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33194#(<= main_~i~1 37)} is VALID [2018-11-23 12:31:53,137 INFO L273 TraceCheckUtils]: 81: Hoare triple {33194#(<= main_~i~1 37)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33195#(<= main_~i~1 38)} is VALID [2018-11-23 12:31:53,138 INFO L273 TraceCheckUtils]: 82: Hoare triple {33195#(<= main_~i~1 38)} assume !(~i~1 < 100000); {33156#false} is VALID [2018-11-23 12:31:53,138 INFO L256 TraceCheckUtils]: 83: Hoare triple {33156#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {33156#false} is VALID [2018-11-23 12:31:53,138 INFO L273 TraceCheckUtils]: 84: Hoare triple {33156#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {33156#false} is VALID [2018-11-23 12:31:53,139 INFO L273 TraceCheckUtils]: 85: Hoare triple {33156#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33156#false} is VALID [2018-11-23 12:31:53,139 INFO L273 TraceCheckUtils]: 86: Hoare triple {33156#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33156#false} is VALID [2018-11-23 12:31:53,139 INFO L273 TraceCheckUtils]: 87: Hoare triple {33156#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33156#false} is VALID [2018-11-23 12:31:53,139 INFO L273 TraceCheckUtils]: 88: Hoare triple {33156#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33156#false} is VALID [2018-11-23 12:31:53,139 INFO L273 TraceCheckUtils]: 89: Hoare triple {33156#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33156#false} is VALID [2018-11-23 12:31:53,140 INFO L273 TraceCheckUtils]: 90: Hoare triple {33156#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33156#false} is VALID [2018-11-23 12:31:53,140 INFO L273 TraceCheckUtils]: 91: Hoare triple {33156#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33156#false} is VALID [2018-11-23 12:31:53,140 INFO L273 TraceCheckUtils]: 92: Hoare triple {33156#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33156#false} is VALID [2018-11-23 12:31:53,140 INFO L273 TraceCheckUtils]: 93: Hoare triple {33156#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33156#false} is VALID [2018-11-23 12:31:53,140 INFO L273 TraceCheckUtils]: 94: Hoare triple {33156#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33156#false} is VALID [2018-11-23 12:31:53,140 INFO L273 TraceCheckUtils]: 95: Hoare triple {33156#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33156#false} is VALID [2018-11-23 12:31:53,140 INFO L273 TraceCheckUtils]: 96: Hoare triple {33156#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33156#false} is VALID [2018-11-23 12:31:53,141 INFO L273 TraceCheckUtils]: 97: Hoare triple {33156#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33156#false} is VALID [2018-11-23 12:31:53,141 INFO L273 TraceCheckUtils]: 98: Hoare triple {33156#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33156#false} is VALID [2018-11-23 12:31:53,141 INFO L273 TraceCheckUtils]: 99: Hoare triple {33156#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33156#false} is VALID [2018-11-23 12:31:53,141 INFO L273 TraceCheckUtils]: 100: Hoare triple {33156#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33156#false} is VALID [2018-11-23 12:31:53,141 INFO L273 TraceCheckUtils]: 101: Hoare triple {33156#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33156#false} is VALID [2018-11-23 12:31:53,141 INFO L273 TraceCheckUtils]: 102: Hoare triple {33156#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33156#false} is VALID [2018-11-23 12:31:53,142 INFO L273 TraceCheckUtils]: 103: Hoare triple {33156#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33156#false} is VALID [2018-11-23 12:31:53,142 INFO L273 TraceCheckUtils]: 104: Hoare triple {33156#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33156#false} is VALID [2018-11-23 12:31:53,142 INFO L273 TraceCheckUtils]: 105: Hoare triple {33156#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33156#false} is VALID [2018-11-23 12:31:53,142 INFO L273 TraceCheckUtils]: 106: Hoare triple {33156#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33156#false} is VALID [2018-11-23 12:31:53,142 INFO L273 TraceCheckUtils]: 107: Hoare triple {33156#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33156#false} is VALID [2018-11-23 12:31:53,142 INFO L273 TraceCheckUtils]: 108: Hoare triple {33156#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33156#false} is VALID [2018-11-23 12:31:53,143 INFO L273 TraceCheckUtils]: 109: Hoare triple {33156#false} assume !(~i~0 < 100000); {33156#false} is VALID [2018-11-23 12:31:53,143 INFO L273 TraceCheckUtils]: 110: Hoare triple {33156#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {33156#false} is VALID [2018-11-23 12:31:53,143 INFO L273 TraceCheckUtils]: 111: Hoare triple {33156#false} assume true; {33156#false} is VALID [2018-11-23 12:31:53,143 INFO L268 TraceCheckUtils]: 112: Hoare quadruple {33156#false} {33156#false} #70#return; {33156#false} is VALID [2018-11-23 12:31:53,143 INFO L273 TraceCheckUtils]: 113: Hoare triple {33156#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {33156#false} is VALID [2018-11-23 12:31:53,143 INFO L256 TraceCheckUtils]: 114: Hoare triple {33156#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {33156#false} is VALID [2018-11-23 12:31:53,143 INFO L273 TraceCheckUtils]: 115: Hoare triple {33156#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {33156#false} is VALID [2018-11-23 12:31:53,143 INFO L273 TraceCheckUtils]: 116: Hoare triple {33156#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33156#false} is VALID [2018-11-23 12:31:53,143 INFO L273 TraceCheckUtils]: 117: Hoare triple {33156#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33156#false} is VALID [2018-11-23 12:31:53,143 INFO L273 TraceCheckUtils]: 118: Hoare triple {33156#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33156#false} is VALID [2018-11-23 12:31:53,144 INFO L273 TraceCheckUtils]: 119: Hoare triple {33156#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33156#false} is VALID [2018-11-23 12:31:53,144 INFO L273 TraceCheckUtils]: 120: Hoare triple {33156#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33156#false} is VALID [2018-11-23 12:31:53,144 INFO L273 TraceCheckUtils]: 121: Hoare triple {33156#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33156#false} is VALID [2018-11-23 12:31:53,144 INFO L273 TraceCheckUtils]: 122: Hoare triple {33156#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33156#false} is VALID [2018-11-23 12:31:53,144 INFO L273 TraceCheckUtils]: 123: Hoare triple {33156#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33156#false} is VALID [2018-11-23 12:31:53,144 INFO L273 TraceCheckUtils]: 124: Hoare triple {33156#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33156#false} is VALID [2018-11-23 12:31:53,144 INFO L273 TraceCheckUtils]: 125: Hoare triple {33156#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33156#false} is VALID [2018-11-23 12:31:53,144 INFO L273 TraceCheckUtils]: 126: Hoare triple {33156#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33156#false} is VALID [2018-11-23 12:31:53,144 INFO L273 TraceCheckUtils]: 127: Hoare triple {33156#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33156#false} is VALID [2018-11-23 12:31:53,144 INFO L273 TraceCheckUtils]: 128: Hoare triple {33156#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33156#false} is VALID [2018-11-23 12:31:53,145 INFO L273 TraceCheckUtils]: 129: Hoare triple {33156#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33156#false} is VALID [2018-11-23 12:31:53,145 INFO L273 TraceCheckUtils]: 130: Hoare triple {33156#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33156#false} is VALID [2018-11-23 12:31:53,145 INFO L273 TraceCheckUtils]: 131: Hoare triple {33156#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33156#false} is VALID [2018-11-23 12:31:53,145 INFO L273 TraceCheckUtils]: 132: Hoare triple {33156#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33156#false} is VALID [2018-11-23 12:31:53,145 INFO L273 TraceCheckUtils]: 133: Hoare triple {33156#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33156#false} is VALID [2018-11-23 12:31:53,145 INFO L273 TraceCheckUtils]: 134: Hoare triple {33156#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33156#false} is VALID [2018-11-23 12:31:53,145 INFO L273 TraceCheckUtils]: 135: Hoare triple {33156#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33156#false} is VALID [2018-11-23 12:31:53,145 INFO L273 TraceCheckUtils]: 136: Hoare triple {33156#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33156#false} is VALID [2018-11-23 12:31:53,145 INFO L273 TraceCheckUtils]: 137: Hoare triple {33156#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33156#false} is VALID [2018-11-23 12:31:53,145 INFO L273 TraceCheckUtils]: 138: Hoare triple {33156#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33156#false} is VALID [2018-11-23 12:31:53,146 INFO L273 TraceCheckUtils]: 139: Hoare triple {33156#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33156#false} is VALID [2018-11-23 12:31:53,146 INFO L273 TraceCheckUtils]: 140: Hoare triple {33156#false} assume !(~i~0 < 100000); {33156#false} is VALID [2018-11-23 12:31:53,146 INFO L273 TraceCheckUtils]: 141: Hoare triple {33156#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {33156#false} is VALID [2018-11-23 12:31:53,146 INFO L273 TraceCheckUtils]: 142: Hoare triple {33156#false} assume true; {33156#false} is VALID [2018-11-23 12:31:53,146 INFO L268 TraceCheckUtils]: 143: Hoare quadruple {33156#false} {33156#false} #72#return; {33156#false} is VALID [2018-11-23 12:31:53,146 INFO L273 TraceCheckUtils]: 144: Hoare triple {33156#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {33156#false} is VALID [2018-11-23 12:31:53,146 INFO L273 TraceCheckUtils]: 145: Hoare triple {33156#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33156#false} is VALID [2018-11-23 12:31:53,146 INFO L273 TraceCheckUtils]: 146: Hoare triple {33156#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33156#false} is VALID [2018-11-23 12:31:53,146 INFO L273 TraceCheckUtils]: 147: Hoare triple {33156#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33156#false} is VALID [2018-11-23 12:31:53,147 INFO L273 TraceCheckUtils]: 148: Hoare triple {33156#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33156#false} is VALID [2018-11-23 12:31:53,147 INFO L273 TraceCheckUtils]: 149: Hoare triple {33156#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33156#false} is VALID [2018-11-23 12:31:53,147 INFO L273 TraceCheckUtils]: 150: Hoare triple {33156#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33156#false} is VALID [2018-11-23 12:31:53,147 INFO L273 TraceCheckUtils]: 151: Hoare triple {33156#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33156#false} is VALID [2018-11-23 12:31:53,147 INFO L273 TraceCheckUtils]: 152: Hoare triple {33156#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33156#false} is VALID [2018-11-23 12:31:53,147 INFO L273 TraceCheckUtils]: 153: Hoare triple {33156#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33156#false} is VALID [2018-11-23 12:31:53,147 INFO L273 TraceCheckUtils]: 154: Hoare triple {33156#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33156#false} is VALID [2018-11-23 12:31:53,147 INFO L273 TraceCheckUtils]: 155: Hoare triple {33156#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33156#false} is VALID [2018-11-23 12:31:53,147 INFO L273 TraceCheckUtils]: 156: Hoare triple {33156#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33156#false} is VALID [2018-11-23 12:31:53,147 INFO L273 TraceCheckUtils]: 157: Hoare triple {33156#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33156#false} is VALID [2018-11-23 12:31:53,147 INFO L273 TraceCheckUtils]: 158: Hoare triple {33156#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33156#false} is VALID [2018-11-23 12:31:53,148 INFO L273 TraceCheckUtils]: 159: Hoare triple {33156#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33156#false} is VALID [2018-11-23 12:31:53,148 INFO L273 TraceCheckUtils]: 160: Hoare triple {33156#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33156#false} is VALID [2018-11-23 12:31:53,148 INFO L273 TraceCheckUtils]: 161: Hoare triple {33156#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33156#false} is VALID [2018-11-23 12:31:53,148 INFO L273 TraceCheckUtils]: 162: Hoare triple {33156#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33156#false} is VALID [2018-11-23 12:31:53,148 INFO L273 TraceCheckUtils]: 163: Hoare triple {33156#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33156#false} is VALID [2018-11-23 12:31:53,148 INFO L273 TraceCheckUtils]: 164: Hoare triple {33156#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33156#false} is VALID [2018-11-23 12:31:53,148 INFO L273 TraceCheckUtils]: 165: Hoare triple {33156#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33156#false} is VALID [2018-11-23 12:31:53,148 INFO L273 TraceCheckUtils]: 166: Hoare triple {33156#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33156#false} is VALID [2018-11-23 12:31:53,148 INFO L273 TraceCheckUtils]: 167: Hoare triple {33156#false} assume !(~i~2 < 99999); {33156#false} is VALID [2018-11-23 12:31:53,148 INFO L273 TraceCheckUtils]: 168: Hoare triple {33156#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {33156#false} is VALID [2018-11-23 12:31:53,148 INFO L256 TraceCheckUtils]: 169: Hoare triple {33156#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {33156#false} is VALID [2018-11-23 12:31:53,149 INFO L273 TraceCheckUtils]: 170: Hoare triple {33156#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {33156#false} is VALID [2018-11-23 12:31:53,149 INFO L273 TraceCheckUtils]: 171: Hoare triple {33156#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33156#false} is VALID [2018-11-23 12:31:53,149 INFO L273 TraceCheckUtils]: 172: Hoare triple {33156#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33156#false} is VALID [2018-11-23 12:31:53,149 INFO L273 TraceCheckUtils]: 173: Hoare triple {33156#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33156#false} is VALID [2018-11-23 12:31:53,149 INFO L273 TraceCheckUtils]: 174: Hoare triple {33156#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33156#false} is VALID [2018-11-23 12:31:53,149 INFO L273 TraceCheckUtils]: 175: Hoare triple {33156#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33156#false} is VALID [2018-11-23 12:31:53,149 INFO L273 TraceCheckUtils]: 176: Hoare triple {33156#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33156#false} is VALID [2018-11-23 12:31:53,149 INFO L273 TraceCheckUtils]: 177: Hoare triple {33156#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33156#false} is VALID [2018-11-23 12:31:53,149 INFO L273 TraceCheckUtils]: 178: Hoare triple {33156#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33156#false} is VALID [2018-11-23 12:31:53,149 INFO L273 TraceCheckUtils]: 179: Hoare triple {33156#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33156#false} is VALID [2018-11-23 12:31:53,149 INFO L273 TraceCheckUtils]: 180: Hoare triple {33156#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33156#false} is VALID [2018-11-23 12:31:53,150 INFO L273 TraceCheckUtils]: 181: Hoare triple {33156#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33156#false} is VALID [2018-11-23 12:31:53,150 INFO L273 TraceCheckUtils]: 182: Hoare triple {33156#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33156#false} is VALID [2018-11-23 12:31:53,150 INFO L273 TraceCheckUtils]: 183: Hoare triple {33156#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33156#false} is VALID [2018-11-23 12:31:53,150 INFO L273 TraceCheckUtils]: 184: Hoare triple {33156#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33156#false} is VALID [2018-11-23 12:31:53,150 INFO L273 TraceCheckUtils]: 185: Hoare triple {33156#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33156#false} is VALID [2018-11-23 12:31:53,150 INFO L273 TraceCheckUtils]: 186: Hoare triple {33156#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33156#false} is VALID [2018-11-23 12:31:53,150 INFO L273 TraceCheckUtils]: 187: Hoare triple {33156#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33156#false} is VALID [2018-11-23 12:31:53,150 INFO L273 TraceCheckUtils]: 188: Hoare triple {33156#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33156#false} is VALID [2018-11-23 12:31:53,150 INFO L273 TraceCheckUtils]: 189: Hoare triple {33156#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33156#false} is VALID [2018-11-23 12:31:53,150 INFO L273 TraceCheckUtils]: 190: Hoare triple {33156#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33156#false} is VALID [2018-11-23 12:31:53,150 INFO L273 TraceCheckUtils]: 191: Hoare triple {33156#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33156#false} is VALID [2018-11-23 12:31:53,151 INFO L273 TraceCheckUtils]: 192: Hoare triple {33156#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33156#false} is VALID [2018-11-23 12:31:53,151 INFO L273 TraceCheckUtils]: 193: Hoare triple {33156#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {33156#false} is VALID [2018-11-23 12:31:53,151 INFO L273 TraceCheckUtils]: 194: Hoare triple {33156#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33156#false} is VALID [2018-11-23 12:31:53,151 INFO L273 TraceCheckUtils]: 195: Hoare triple {33156#false} assume !(~i~0 < 100000); {33156#false} is VALID [2018-11-23 12:31:53,151 INFO L273 TraceCheckUtils]: 196: Hoare triple {33156#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {33156#false} is VALID [2018-11-23 12:31:53,151 INFO L273 TraceCheckUtils]: 197: Hoare triple {33156#false} assume true; {33156#false} is VALID [2018-11-23 12:31:53,151 INFO L268 TraceCheckUtils]: 198: Hoare quadruple {33156#false} {33156#false} #74#return; {33156#false} is VALID [2018-11-23 12:31:53,151 INFO L273 TraceCheckUtils]: 199: Hoare triple {33156#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {33156#false} is VALID [2018-11-23 12:31:53,151 INFO L273 TraceCheckUtils]: 200: Hoare triple {33156#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {33156#false} is VALID [2018-11-23 12:31:53,151 INFO L273 TraceCheckUtils]: 201: Hoare triple {33156#false} assume !false; {33156#false} is VALID [2018-11-23 12:31:53,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2948 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2018-11-23 12:31:53,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:31:53,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2018-11-23 12:31:53,185 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 202 [2018-11-23 12:31:53,186 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:31:53,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 12:31:53,297 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:31:53,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 12:31:53,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 12:31:53,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:31:53,298 INFO L87 Difference]: Start difference. First operand 145 states and 149 transitions. Second operand 42 states. [2018-11-23 12:31:54,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:31:54,549 INFO L93 Difference]: Finished difference Result 210 states and 218 transitions. [2018-11-23 12:31:54,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-23 12:31:54,549 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 202 [2018-11-23 12:31:54,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:31:54,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:31:54,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 130 transitions. [2018-11-23 12:31:54,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:31:54,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 130 transitions. [2018-11-23 12:31:54,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 130 transitions. [2018-11-23 12:31:54,673 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:31:54,676 INFO L225 Difference]: With dead ends: 210 [2018-11-23 12:31:54,676 INFO L226 Difference]: Without dead ends: 148 [2018-11-23 12:31:54,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:31:54,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-23 12:31:54,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2018-11-23 12:31:54,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:31:54,787 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand 147 states. [2018-11-23 12:31:54,787 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand 147 states. [2018-11-23 12:31:54,787 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 147 states. [2018-11-23 12:31:54,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:31:54,790 INFO L93 Difference]: Finished difference Result 148 states and 152 transitions. [2018-11-23 12:31:54,790 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 152 transitions. [2018-11-23 12:31:54,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:31:54,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:31:54,790 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand 148 states. [2018-11-23 12:31:54,790 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 148 states. [2018-11-23 12:31:54,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:31:54,793 INFO L93 Difference]: Finished difference Result 148 states and 152 transitions. [2018-11-23 12:31:54,793 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 152 transitions. [2018-11-23 12:31:54,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:31:54,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:31:54,794 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:31:54,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:31:54,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-23 12:31:54,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 151 transitions. [2018-11-23 12:31:54,797 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 151 transitions. Word has length 202 [2018-11-23 12:31:54,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:31:54,797 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 151 transitions. [2018-11-23 12:31:54,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 12:31:54,797 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 151 transitions. [2018-11-23 12:31:54,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-23 12:31:54,798 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:31:54,799 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 36, 36, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:31:54,799 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:31:54,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:31:54,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1538460405, now seen corresponding path program 39 times [2018-11-23 12:31:54,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:31:54,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:31:54,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:31:54,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:31:54,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:31:54,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:31:55,716 INFO L256 TraceCheckUtils]: 0: Hoare triple {34630#true} call ULTIMATE.init(); {34630#true} is VALID [2018-11-23 12:31:55,716 INFO L273 TraceCheckUtils]: 1: Hoare triple {34630#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {34630#true} is VALID [2018-11-23 12:31:55,716 INFO L273 TraceCheckUtils]: 2: Hoare triple {34630#true} assume true; {34630#true} is VALID [2018-11-23 12:31:55,716 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34630#true} {34630#true} #66#return; {34630#true} is VALID [2018-11-23 12:31:55,717 INFO L256 TraceCheckUtils]: 4: Hoare triple {34630#true} call #t~ret13 := main(); {34630#true} is VALID [2018-11-23 12:31:55,717 INFO L273 TraceCheckUtils]: 5: Hoare triple {34630#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {34632#(= main_~i~1 0)} is VALID [2018-11-23 12:31:55,717 INFO L273 TraceCheckUtils]: 6: Hoare triple {34632#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34632#(= main_~i~1 0)} is VALID [2018-11-23 12:31:55,718 INFO L273 TraceCheckUtils]: 7: Hoare triple {34632#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34633#(<= main_~i~1 1)} is VALID [2018-11-23 12:31:55,718 INFO L273 TraceCheckUtils]: 8: Hoare triple {34633#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34633#(<= main_~i~1 1)} is VALID [2018-11-23 12:31:55,719 INFO L273 TraceCheckUtils]: 9: Hoare triple {34633#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34634#(<= main_~i~1 2)} is VALID [2018-11-23 12:31:55,719 INFO L273 TraceCheckUtils]: 10: Hoare triple {34634#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34634#(<= main_~i~1 2)} is VALID [2018-11-23 12:31:55,719 INFO L273 TraceCheckUtils]: 11: Hoare triple {34634#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34635#(<= main_~i~1 3)} is VALID [2018-11-23 12:31:55,720 INFO L273 TraceCheckUtils]: 12: Hoare triple {34635#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34635#(<= main_~i~1 3)} is VALID [2018-11-23 12:31:55,720 INFO L273 TraceCheckUtils]: 13: Hoare triple {34635#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34636#(<= main_~i~1 4)} is VALID [2018-11-23 12:31:55,720 INFO L273 TraceCheckUtils]: 14: Hoare triple {34636#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34636#(<= main_~i~1 4)} is VALID [2018-11-23 12:31:55,721 INFO L273 TraceCheckUtils]: 15: Hoare triple {34636#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34637#(<= main_~i~1 5)} is VALID [2018-11-23 12:31:55,722 INFO L273 TraceCheckUtils]: 16: Hoare triple {34637#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34637#(<= main_~i~1 5)} is VALID [2018-11-23 12:31:55,722 INFO L273 TraceCheckUtils]: 17: Hoare triple {34637#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34638#(<= main_~i~1 6)} is VALID [2018-11-23 12:31:55,723 INFO L273 TraceCheckUtils]: 18: Hoare triple {34638#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34638#(<= main_~i~1 6)} is VALID [2018-11-23 12:31:55,723 INFO L273 TraceCheckUtils]: 19: Hoare triple {34638#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34639#(<= main_~i~1 7)} is VALID [2018-11-23 12:31:55,724 INFO L273 TraceCheckUtils]: 20: Hoare triple {34639#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34639#(<= main_~i~1 7)} is VALID [2018-11-23 12:31:55,725 INFO L273 TraceCheckUtils]: 21: Hoare triple {34639#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34640#(<= main_~i~1 8)} is VALID [2018-11-23 12:31:55,725 INFO L273 TraceCheckUtils]: 22: Hoare triple {34640#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34640#(<= main_~i~1 8)} is VALID [2018-11-23 12:31:55,726 INFO L273 TraceCheckUtils]: 23: Hoare triple {34640#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34641#(<= main_~i~1 9)} is VALID [2018-11-23 12:31:55,726 INFO L273 TraceCheckUtils]: 24: Hoare triple {34641#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34641#(<= main_~i~1 9)} is VALID [2018-11-23 12:31:55,727 INFO L273 TraceCheckUtils]: 25: Hoare triple {34641#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34642#(<= main_~i~1 10)} is VALID [2018-11-23 12:31:55,727 INFO L273 TraceCheckUtils]: 26: Hoare triple {34642#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34642#(<= main_~i~1 10)} is VALID [2018-11-23 12:31:55,728 INFO L273 TraceCheckUtils]: 27: Hoare triple {34642#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34643#(<= main_~i~1 11)} is VALID [2018-11-23 12:31:55,729 INFO L273 TraceCheckUtils]: 28: Hoare triple {34643#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34643#(<= main_~i~1 11)} is VALID [2018-11-23 12:31:55,729 INFO L273 TraceCheckUtils]: 29: Hoare triple {34643#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34644#(<= main_~i~1 12)} is VALID [2018-11-23 12:31:55,730 INFO L273 TraceCheckUtils]: 30: Hoare triple {34644#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34644#(<= main_~i~1 12)} is VALID [2018-11-23 12:31:55,730 INFO L273 TraceCheckUtils]: 31: Hoare triple {34644#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34645#(<= main_~i~1 13)} is VALID [2018-11-23 12:31:55,731 INFO L273 TraceCheckUtils]: 32: Hoare triple {34645#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34645#(<= main_~i~1 13)} is VALID [2018-11-23 12:31:55,732 INFO L273 TraceCheckUtils]: 33: Hoare triple {34645#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34646#(<= main_~i~1 14)} is VALID [2018-11-23 12:31:55,732 INFO L273 TraceCheckUtils]: 34: Hoare triple {34646#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34646#(<= main_~i~1 14)} is VALID [2018-11-23 12:31:55,733 INFO L273 TraceCheckUtils]: 35: Hoare triple {34646#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34647#(<= main_~i~1 15)} is VALID [2018-11-23 12:31:55,733 INFO L273 TraceCheckUtils]: 36: Hoare triple {34647#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34647#(<= main_~i~1 15)} is VALID [2018-11-23 12:31:55,734 INFO L273 TraceCheckUtils]: 37: Hoare triple {34647#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34648#(<= main_~i~1 16)} is VALID [2018-11-23 12:31:55,734 INFO L273 TraceCheckUtils]: 38: Hoare triple {34648#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34648#(<= main_~i~1 16)} is VALID [2018-11-23 12:31:55,735 INFO L273 TraceCheckUtils]: 39: Hoare triple {34648#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34649#(<= main_~i~1 17)} is VALID [2018-11-23 12:31:55,735 INFO L273 TraceCheckUtils]: 40: Hoare triple {34649#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34649#(<= main_~i~1 17)} is VALID [2018-11-23 12:31:55,736 INFO L273 TraceCheckUtils]: 41: Hoare triple {34649#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34650#(<= main_~i~1 18)} is VALID [2018-11-23 12:31:55,737 INFO L273 TraceCheckUtils]: 42: Hoare triple {34650#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34650#(<= main_~i~1 18)} is VALID [2018-11-23 12:31:55,737 INFO L273 TraceCheckUtils]: 43: Hoare triple {34650#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34651#(<= main_~i~1 19)} is VALID [2018-11-23 12:31:55,738 INFO L273 TraceCheckUtils]: 44: Hoare triple {34651#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34651#(<= main_~i~1 19)} is VALID [2018-11-23 12:31:55,738 INFO L273 TraceCheckUtils]: 45: Hoare triple {34651#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34652#(<= main_~i~1 20)} is VALID [2018-11-23 12:31:55,739 INFO L273 TraceCheckUtils]: 46: Hoare triple {34652#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34652#(<= main_~i~1 20)} is VALID [2018-11-23 12:31:55,740 INFO L273 TraceCheckUtils]: 47: Hoare triple {34652#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34653#(<= main_~i~1 21)} is VALID [2018-11-23 12:31:55,740 INFO L273 TraceCheckUtils]: 48: Hoare triple {34653#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34653#(<= main_~i~1 21)} is VALID [2018-11-23 12:31:55,741 INFO L273 TraceCheckUtils]: 49: Hoare triple {34653#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#(<= main_~i~1 22)} is VALID [2018-11-23 12:31:55,741 INFO L273 TraceCheckUtils]: 50: Hoare triple {34654#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#(<= main_~i~1 22)} is VALID [2018-11-23 12:31:55,742 INFO L273 TraceCheckUtils]: 51: Hoare triple {34654#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34655#(<= main_~i~1 23)} is VALID [2018-11-23 12:31:55,742 INFO L273 TraceCheckUtils]: 52: Hoare triple {34655#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34655#(<= main_~i~1 23)} is VALID [2018-11-23 12:31:55,743 INFO L273 TraceCheckUtils]: 53: Hoare triple {34655#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34656#(<= main_~i~1 24)} is VALID [2018-11-23 12:31:55,744 INFO L273 TraceCheckUtils]: 54: Hoare triple {34656#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34656#(<= main_~i~1 24)} is VALID [2018-11-23 12:31:55,744 INFO L273 TraceCheckUtils]: 55: Hoare triple {34656#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34657#(<= main_~i~1 25)} is VALID [2018-11-23 12:31:55,745 INFO L273 TraceCheckUtils]: 56: Hoare triple {34657#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34657#(<= main_~i~1 25)} is VALID [2018-11-23 12:31:55,745 INFO L273 TraceCheckUtils]: 57: Hoare triple {34657#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34658#(<= main_~i~1 26)} is VALID [2018-11-23 12:31:55,746 INFO L273 TraceCheckUtils]: 58: Hoare triple {34658#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34658#(<= main_~i~1 26)} is VALID [2018-11-23 12:31:55,747 INFO L273 TraceCheckUtils]: 59: Hoare triple {34658#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34659#(<= main_~i~1 27)} is VALID [2018-11-23 12:31:55,747 INFO L273 TraceCheckUtils]: 60: Hoare triple {34659#(<= main_~i~1 27)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34659#(<= main_~i~1 27)} is VALID [2018-11-23 12:31:55,748 INFO L273 TraceCheckUtils]: 61: Hoare triple {34659#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34660#(<= main_~i~1 28)} is VALID [2018-11-23 12:31:55,748 INFO L273 TraceCheckUtils]: 62: Hoare triple {34660#(<= main_~i~1 28)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34660#(<= main_~i~1 28)} is VALID [2018-11-23 12:31:55,749 INFO L273 TraceCheckUtils]: 63: Hoare triple {34660#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34661#(<= main_~i~1 29)} is VALID [2018-11-23 12:31:55,749 INFO L273 TraceCheckUtils]: 64: Hoare triple {34661#(<= main_~i~1 29)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34661#(<= main_~i~1 29)} is VALID [2018-11-23 12:31:55,750 INFO L273 TraceCheckUtils]: 65: Hoare triple {34661#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34662#(<= main_~i~1 30)} is VALID [2018-11-23 12:31:55,751 INFO L273 TraceCheckUtils]: 66: Hoare triple {34662#(<= main_~i~1 30)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34662#(<= main_~i~1 30)} is VALID [2018-11-23 12:31:55,751 INFO L273 TraceCheckUtils]: 67: Hoare triple {34662#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34663#(<= main_~i~1 31)} is VALID [2018-11-23 12:31:55,752 INFO L273 TraceCheckUtils]: 68: Hoare triple {34663#(<= main_~i~1 31)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34663#(<= main_~i~1 31)} is VALID [2018-11-23 12:31:55,752 INFO L273 TraceCheckUtils]: 69: Hoare triple {34663#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34664#(<= main_~i~1 32)} is VALID [2018-11-23 12:31:55,753 INFO L273 TraceCheckUtils]: 70: Hoare triple {34664#(<= main_~i~1 32)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34664#(<= main_~i~1 32)} is VALID [2018-11-23 12:31:55,754 INFO L273 TraceCheckUtils]: 71: Hoare triple {34664#(<= main_~i~1 32)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34665#(<= main_~i~1 33)} is VALID [2018-11-23 12:31:55,754 INFO L273 TraceCheckUtils]: 72: Hoare triple {34665#(<= main_~i~1 33)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34665#(<= main_~i~1 33)} is VALID [2018-11-23 12:31:55,755 INFO L273 TraceCheckUtils]: 73: Hoare triple {34665#(<= main_~i~1 33)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34666#(<= main_~i~1 34)} is VALID [2018-11-23 12:31:55,755 INFO L273 TraceCheckUtils]: 74: Hoare triple {34666#(<= main_~i~1 34)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34666#(<= main_~i~1 34)} is VALID [2018-11-23 12:31:55,756 INFO L273 TraceCheckUtils]: 75: Hoare triple {34666#(<= main_~i~1 34)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34667#(<= main_~i~1 35)} is VALID [2018-11-23 12:31:55,756 INFO L273 TraceCheckUtils]: 76: Hoare triple {34667#(<= main_~i~1 35)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34667#(<= main_~i~1 35)} is VALID [2018-11-23 12:31:55,757 INFO L273 TraceCheckUtils]: 77: Hoare triple {34667#(<= main_~i~1 35)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34668#(<= main_~i~1 36)} is VALID [2018-11-23 12:31:55,757 INFO L273 TraceCheckUtils]: 78: Hoare triple {34668#(<= main_~i~1 36)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34668#(<= main_~i~1 36)} is VALID [2018-11-23 12:31:55,758 INFO L273 TraceCheckUtils]: 79: Hoare triple {34668#(<= main_~i~1 36)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34669#(<= main_~i~1 37)} is VALID [2018-11-23 12:31:55,759 INFO L273 TraceCheckUtils]: 80: Hoare triple {34669#(<= main_~i~1 37)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34669#(<= main_~i~1 37)} is VALID [2018-11-23 12:31:55,759 INFO L273 TraceCheckUtils]: 81: Hoare triple {34669#(<= main_~i~1 37)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34670#(<= main_~i~1 38)} is VALID [2018-11-23 12:31:55,760 INFO L273 TraceCheckUtils]: 82: Hoare triple {34670#(<= main_~i~1 38)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34670#(<= main_~i~1 38)} is VALID [2018-11-23 12:31:55,760 INFO L273 TraceCheckUtils]: 83: Hoare triple {34670#(<= main_~i~1 38)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34671#(<= main_~i~1 39)} is VALID [2018-11-23 12:31:55,761 INFO L273 TraceCheckUtils]: 84: Hoare triple {34671#(<= main_~i~1 39)} assume !(~i~1 < 100000); {34631#false} is VALID [2018-11-23 12:31:55,761 INFO L256 TraceCheckUtils]: 85: Hoare triple {34631#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {34630#true} is VALID [2018-11-23 12:31:55,761 INFO L273 TraceCheckUtils]: 86: Hoare triple {34630#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {34630#true} is VALID [2018-11-23 12:31:55,762 INFO L273 TraceCheckUtils]: 87: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:55,762 INFO L273 TraceCheckUtils]: 88: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:55,762 INFO L273 TraceCheckUtils]: 89: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:55,762 INFO L273 TraceCheckUtils]: 90: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:55,762 INFO L273 TraceCheckUtils]: 91: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:55,762 INFO L273 TraceCheckUtils]: 92: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:55,763 INFO L273 TraceCheckUtils]: 93: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:55,763 INFO L273 TraceCheckUtils]: 94: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:55,763 INFO L273 TraceCheckUtils]: 95: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:55,763 INFO L273 TraceCheckUtils]: 96: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:55,763 INFO L273 TraceCheckUtils]: 97: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:55,763 INFO L273 TraceCheckUtils]: 98: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:55,764 INFO L273 TraceCheckUtils]: 99: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:55,764 INFO L273 TraceCheckUtils]: 100: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:55,764 INFO L273 TraceCheckUtils]: 101: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:55,764 INFO L273 TraceCheckUtils]: 102: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:55,764 INFO L273 TraceCheckUtils]: 103: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:55,764 INFO L273 TraceCheckUtils]: 104: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:55,764 INFO L273 TraceCheckUtils]: 105: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:55,764 INFO L273 TraceCheckUtils]: 106: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:55,764 INFO L273 TraceCheckUtils]: 107: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:55,764 INFO L273 TraceCheckUtils]: 108: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:55,765 INFO L273 TraceCheckUtils]: 109: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:55,765 INFO L273 TraceCheckUtils]: 110: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:55,765 INFO L273 TraceCheckUtils]: 111: Hoare triple {34630#true} assume !(~i~0 < 100000); {34630#true} is VALID [2018-11-23 12:31:55,765 INFO L273 TraceCheckUtils]: 112: Hoare triple {34630#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {34630#true} is VALID [2018-11-23 12:31:55,765 INFO L273 TraceCheckUtils]: 113: Hoare triple {34630#true} assume true; {34630#true} is VALID [2018-11-23 12:31:55,765 INFO L268 TraceCheckUtils]: 114: Hoare quadruple {34630#true} {34631#false} #70#return; {34631#false} is VALID [2018-11-23 12:31:55,765 INFO L273 TraceCheckUtils]: 115: Hoare triple {34631#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {34631#false} is VALID [2018-11-23 12:31:55,765 INFO L256 TraceCheckUtils]: 116: Hoare triple {34631#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {34630#true} is VALID [2018-11-23 12:31:55,765 INFO L273 TraceCheckUtils]: 117: Hoare triple {34630#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {34630#true} is VALID [2018-11-23 12:31:55,766 INFO L273 TraceCheckUtils]: 118: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:55,766 INFO L273 TraceCheckUtils]: 119: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:55,766 INFO L273 TraceCheckUtils]: 120: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:55,766 INFO L273 TraceCheckUtils]: 121: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:55,766 INFO L273 TraceCheckUtils]: 122: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:55,766 INFO L273 TraceCheckUtils]: 123: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:55,766 INFO L273 TraceCheckUtils]: 124: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:55,766 INFO L273 TraceCheckUtils]: 125: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:55,766 INFO L273 TraceCheckUtils]: 126: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:55,766 INFO L273 TraceCheckUtils]: 127: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:55,767 INFO L273 TraceCheckUtils]: 128: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:55,767 INFO L273 TraceCheckUtils]: 129: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:55,767 INFO L273 TraceCheckUtils]: 130: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:55,767 INFO L273 TraceCheckUtils]: 131: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:55,767 INFO L273 TraceCheckUtils]: 132: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:55,767 INFO L273 TraceCheckUtils]: 133: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:55,767 INFO L273 TraceCheckUtils]: 134: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:55,767 INFO L273 TraceCheckUtils]: 135: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:55,767 INFO L273 TraceCheckUtils]: 136: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:55,767 INFO L273 TraceCheckUtils]: 137: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:55,768 INFO L273 TraceCheckUtils]: 138: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:55,768 INFO L273 TraceCheckUtils]: 139: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:55,768 INFO L273 TraceCheckUtils]: 140: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:55,768 INFO L273 TraceCheckUtils]: 141: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:55,768 INFO L273 TraceCheckUtils]: 142: Hoare triple {34630#true} assume !(~i~0 < 100000); {34630#true} is VALID [2018-11-23 12:31:55,768 INFO L273 TraceCheckUtils]: 143: Hoare triple {34630#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {34630#true} is VALID [2018-11-23 12:31:55,768 INFO L273 TraceCheckUtils]: 144: Hoare triple {34630#true} assume true; {34630#true} is VALID [2018-11-23 12:31:55,768 INFO L268 TraceCheckUtils]: 145: Hoare quadruple {34630#true} {34631#false} #72#return; {34631#false} is VALID [2018-11-23 12:31:55,768 INFO L273 TraceCheckUtils]: 146: Hoare triple {34631#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {34631#false} is VALID [2018-11-23 12:31:55,768 INFO L273 TraceCheckUtils]: 147: Hoare triple {34631#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34631#false} is VALID [2018-11-23 12:31:55,769 INFO L273 TraceCheckUtils]: 148: Hoare triple {34631#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34631#false} is VALID [2018-11-23 12:31:55,769 INFO L273 TraceCheckUtils]: 149: Hoare triple {34631#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34631#false} is VALID [2018-11-23 12:31:55,769 INFO L273 TraceCheckUtils]: 150: Hoare triple {34631#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34631#false} is VALID [2018-11-23 12:31:55,769 INFO L273 TraceCheckUtils]: 151: Hoare triple {34631#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34631#false} is VALID [2018-11-23 12:31:55,769 INFO L273 TraceCheckUtils]: 152: Hoare triple {34631#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34631#false} is VALID [2018-11-23 12:31:55,769 INFO L273 TraceCheckUtils]: 153: Hoare triple {34631#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34631#false} is VALID [2018-11-23 12:31:55,769 INFO L273 TraceCheckUtils]: 154: Hoare triple {34631#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34631#false} is VALID [2018-11-23 12:31:55,769 INFO L273 TraceCheckUtils]: 155: Hoare triple {34631#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34631#false} is VALID [2018-11-23 12:31:55,769 INFO L273 TraceCheckUtils]: 156: Hoare triple {34631#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34631#false} is VALID [2018-11-23 12:31:55,770 INFO L273 TraceCheckUtils]: 157: Hoare triple {34631#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34631#false} is VALID [2018-11-23 12:31:55,770 INFO L273 TraceCheckUtils]: 158: Hoare triple {34631#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34631#false} is VALID [2018-11-23 12:31:55,770 INFO L273 TraceCheckUtils]: 159: Hoare triple {34631#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34631#false} is VALID [2018-11-23 12:31:55,770 INFO L273 TraceCheckUtils]: 160: Hoare triple {34631#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34631#false} is VALID [2018-11-23 12:31:55,770 INFO L273 TraceCheckUtils]: 161: Hoare triple {34631#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34631#false} is VALID [2018-11-23 12:31:55,770 INFO L273 TraceCheckUtils]: 162: Hoare triple {34631#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34631#false} is VALID [2018-11-23 12:31:55,770 INFO L273 TraceCheckUtils]: 163: Hoare triple {34631#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34631#false} is VALID [2018-11-23 12:31:55,770 INFO L273 TraceCheckUtils]: 164: Hoare triple {34631#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34631#false} is VALID [2018-11-23 12:31:55,770 INFO L273 TraceCheckUtils]: 165: Hoare triple {34631#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34631#false} is VALID [2018-11-23 12:31:55,770 INFO L273 TraceCheckUtils]: 166: Hoare triple {34631#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34631#false} is VALID [2018-11-23 12:31:55,771 INFO L273 TraceCheckUtils]: 167: Hoare triple {34631#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34631#false} is VALID [2018-11-23 12:31:55,771 INFO L273 TraceCheckUtils]: 168: Hoare triple {34631#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34631#false} is VALID [2018-11-23 12:31:55,771 INFO L273 TraceCheckUtils]: 169: Hoare triple {34631#false} assume !(~i~2 < 99999); {34631#false} is VALID [2018-11-23 12:31:55,771 INFO L273 TraceCheckUtils]: 170: Hoare triple {34631#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {34631#false} is VALID [2018-11-23 12:31:55,771 INFO L256 TraceCheckUtils]: 171: Hoare triple {34631#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {34630#true} is VALID [2018-11-23 12:31:55,771 INFO L273 TraceCheckUtils]: 172: Hoare triple {34630#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {34630#true} is VALID [2018-11-23 12:31:55,771 INFO L273 TraceCheckUtils]: 173: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:55,771 INFO L273 TraceCheckUtils]: 174: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:55,771 INFO L273 TraceCheckUtils]: 175: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:55,771 INFO L273 TraceCheckUtils]: 176: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:55,772 INFO L273 TraceCheckUtils]: 177: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:55,772 INFO L273 TraceCheckUtils]: 178: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:55,772 INFO L273 TraceCheckUtils]: 179: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:55,772 INFO L273 TraceCheckUtils]: 180: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:55,772 INFO L273 TraceCheckUtils]: 181: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:55,772 INFO L273 TraceCheckUtils]: 182: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:55,772 INFO L273 TraceCheckUtils]: 183: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:55,772 INFO L273 TraceCheckUtils]: 184: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:55,772 INFO L273 TraceCheckUtils]: 185: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:55,773 INFO L273 TraceCheckUtils]: 186: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:55,773 INFO L273 TraceCheckUtils]: 187: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:55,773 INFO L273 TraceCheckUtils]: 188: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:55,773 INFO L273 TraceCheckUtils]: 189: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:55,773 INFO L273 TraceCheckUtils]: 190: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:55,773 INFO L273 TraceCheckUtils]: 191: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:55,773 INFO L273 TraceCheckUtils]: 192: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:55,773 INFO L273 TraceCheckUtils]: 193: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:55,773 INFO L273 TraceCheckUtils]: 194: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:55,773 INFO L273 TraceCheckUtils]: 195: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:55,774 INFO L273 TraceCheckUtils]: 196: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:55,774 INFO L273 TraceCheckUtils]: 197: Hoare triple {34630#true} assume !(~i~0 < 100000); {34630#true} is VALID [2018-11-23 12:31:55,774 INFO L273 TraceCheckUtils]: 198: Hoare triple {34630#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {34630#true} is VALID [2018-11-23 12:31:55,774 INFO L273 TraceCheckUtils]: 199: Hoare triple {34630#true} assume true; {34630#true} is VALID [2018-11-23 12:31:55,774 INFO L268 TraceCheckUtils]: 200: Hoare quadruple {34630#true} {34631#false} #74#return; {34631#false} is VALID [2018-11-23 12:31:55,774 INFO L273 TraceCheckUtils]: 201: Hoare triple {34631#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {34631#false} is VALID [2018-11-23 12:31:55,774 INFO L273 TraceCheckUtils]: 202: Hoare triple {34631#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {34631#false} is VALID [2018-11-23 12:31:55,774 INFO L273 TraceCheckUtils]: 203: Hoare triple {34631#false} assume !false; {34631#false} is VALID [2018-11-23 12:31:55,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2018-11-23 12:31:55,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:31:55,792 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:31:55,801 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:31:57,226 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-11-23 12:31:57,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:31:57,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:31:57,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:31:58,528 INFO L256 TraceCheckUtils]: 0: Hoare triple {34630#true} call ULTIMATE.init(); {34630#true} is VALID [2018-11-23 12:31:58,529 INFO L273 TraceCheckUtils]: 1: Hoare triple {34630#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {34630#true} is VALID [2018-11-23 12:31:58,529 INFO L273 TraceCheckUtils]: 2: Hoare triple {34630#true} assume true; {34630#true} is VALID [2018-11-23 12:31:58,529 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34630#true} {34630#true} #66#return; {34630#true} is VALID [2018-11-23 12:31:58,529 INFO L256 TraceCheckUtils]: 4: Hoare triple {34630#true} call #t~ret13 := main(); {34630#true} is VALID [2018-11-23 12:31:58,529 INFO L273 TraceCheckUtils]: 5: Hoare triple {34630#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {34630#true} is VALID [2018-11-23 12:31:58,529 INFO L273 TraceCheckUtils]: 6: Hoare triple {34630#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34630#true} is VALID [2018-11-23 12:31:58,530 INFO L273 TraceCheckUtils]: 7: Hoare triple {34630#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34630#true} is VALID [2018-11-23 12:31:58,530 INFO L273 TraceCheckUtils]: 8: Hoare triple {34630#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34630#true} is VALID [2018-11-23 12:31:58,530 INFO L273 TraceCheckUtils]: 9: Hoare triple {34630#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34630#true} is VALID [2018-11-23 12:31:58,530 INFO L273 TraceCheckUtils]: 10: Hoare triple {34630#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34630#true} is VALID [2018-11-23 12:31:58,530 INFO L273 TraceCheckUtils]: 11: Hoare triple {34630#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34630#true} is VALID [2018-11-23 12:31:58,530 INFO L273 TraceCheckUtils]: 12: Hoare triple {34630#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34630#true} is VALID [2018-11-23 12:31:58,531 INFO L273 TraceCheckUtils]: 13: Hoare triple {34630#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34630#true} is VALID [2018-11-23 12:31:58,531 INFO L273 TraceCheckUtils]: 14: Hoare triple {34630#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34630#true} is VALID [2018-11-23 12:31:58,531 INFO L273 TraceCheckUtils]: 15: Hoare triple {34630#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34630#true} is VALID [2018-11-23 12:31:58,531 INFO L273 TraceCheckUtils]: 16: Hoare triple {34630#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34630#true} is VALID [2018-11-23 12:31:58,531 INFO L273 TraceCheckUtils]: 17: Hoare triple {34630#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34630#true} is VALID [2018-11-23 12:31:58,531 INFO L273 TraceCheckUtils]: 18: Hoare triple {34630#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34630#true} is VALID [2018-11-23 12:31:58,531 INFO L273 TraceCheckUtils]: 19: Hoare triple {34630#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34630#true} is VALID [2018-11-23 12:31:58,531 INFO L273 TraceCheckUtils]: 20: Hoare triple {34630#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34630#true} is VALID [2018-11-23 12:31:58,531 INFO L273 TraceCheckUtils]: 21: Hoare triple {34630#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34630#true} is VALID [2018-11-23 12:31:58,532 INFO L273 TraceCheckUtils]: 22: Hoare triple {34630#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34630#true} is VALID [2018-11-23 12:31:58,532 INFO L273 TraceCheckUtils]: 23: Hoare triple {34630#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34630#true} is VALID [2018-11-23 12:31:58,532 INFO L273 TraceCheckUtils]: 24: Hoare triple {34630#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34630#true} is VALID [2018-11-23 12:31:58,532 INFO L273 TraceCheckUtils]: 25: Hoare triple {34630#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34630#true} is VALID [2018-11-23 12:31:58,532 INFO L273 TraceCheckUtils]: 26: Hoare triple {34630#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34630#true} is VALID [2018-11-23 12:31:58,532 INFO L273 TraceCheckUtils]: 27: Hoare triple {34630#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34630#true} is VALID [2018-11-23 12:31:58,532 INFO L273 TraceCheckUtils]: 28: Hoare triple {34630#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34630#true} is VALID [2018-11-23 12:31:58,532 INFO L273 TraceCheckUtils]: 29: Hoare triple {34630#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34630#true} is VALID [2018-11-23 12:31:58,532 INFO L273 TraceCheckUtils]: 30: Hoare triple {34630#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34630#true} is VALID [2018-11-23 12:31:58,532 INFO L273 TraceCheckUtils]: 31: Hoare triple {34630#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34630#true} is VALID [2018-11-23 12:31:58,533 INFO L273 TraceCheckUtils]: 32: Hoare triple {34630#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34630#true} is VALID [2018-11-23 12:31:58,533 INFO L273 TraceCheckUtils]: 33: Hoare triple {34630#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34630#true} is VALID [2018-11-23 12:31:58,533 INFO L273 TraceCheckUtils]: 34: Hoare triple {34630#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34630#true} is VALID [2018-11-23 12:31:58,533 INFO L273 TraceCheckUtils]: 35: Hoare triple {34630#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34630#true} is VALID [2018-11-23 12:31:58,533 INFO L273 TraceCheckUtils]: 36: Hoare triple {34630#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34630#true} is VALID [2018-11-23 12:31:58,533 INFO L273 TraceCheckUtils]: 37: Hoare triple {34630#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34630#true} is VALID [2018-11-23 12:31:58,533 INFO L273 TraceCheckUtils]: 38: Hoare triple {34630#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34630#true} is VALID [2018-11-23 12:31:58,533 INFO L273 TraceCheckUtils]: 39: Hoare triple {34630#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34630#true} is VALID [2018-11-23 12:31:58,533 INFO L273 TraceCheckUtils]: 40: Hoare triple {34630#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34630#true} is VALID [2018-11-23 12:31:58,533 INFO L273 TraceCheckUtils]: 41: Hoare triple {34630#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34630#true} is VALID [2018-11-23 12:31:58,534 INFO L273 TraceCheckUtils]: 42: Hoare triple {34630#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34630#true} is VALID [2018-11-23 12:31:58,534 INFO L273 TraceCheckUtils]: 43: Hoare triple {34630#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34630#true} is VALID [2018-11-23 12:31:58,534 INFO L273 TraceCheckUtils]: 44: Hoare triple {34630#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34630#true} is VALID [2018-11-23 12:31:58,534 INFO L273 TraceCheckUtils]: 45: Hoare triple {34630#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34630#true} is VALID [2018-11-23 12:31:58,534 INFO L273 TraceCheckUtils]: 46: Hoare triple {34630#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34630#true} is VALID [2018-11-23 12:31:58,534 INFO L273 TraceCheckUtils]: 47: Hoare triple {34630#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34630#true} is VALID [2018-11-23 12:31:58,534 INFO L273 TraceCheckUtils]: 48: Hoare triple {34630#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34630#true} is VALID [2018-11-23 12:31:58,534 INFO L273 TraceCheckUtils]: 49: Hoare triple {34630#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34630#true} is VALID [2018-11-23 12:31:58,534 INFO L273 TraceCheckUtils]: 50: Hoare triple {34630#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34630#true} is VALID [2018-11-23 12:31:58,534 INFO L273 TraceCheckUtils]: 51: Hoare triple {34630#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34630#true} is VALID [2018-11-23 12:31:58,535 INFO L273 TraceCheckUtils]: 52: Hoare triple {34630#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34630#true} is VALID [2018-11-23 12:31:58,535 INFO L273 TraceCheckUtils]: 53: Hoare triple {34630#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34630#true} is VALID [2018-11-23 12:31:58,535 INFO L273 TraceCheckUtils]: 54: Hoare triple {34630#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34630#true} is VALID [2018-11-23 12:31:58,535 INFO L273 TraceCheckUtils]: 55: Hoare triple {34630#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34630#true} is VALID [2018-11-23 12:31:58,535 INFO L273 TraceCheckUtils]: 56: Hoare triple {34630#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34630#true} is VALID [2018-11-23 12:31:58,535 INFO L273 TraceCheckUtils]: 57: Hoare triple {34630#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34630#true} is VALID [2018-11-23 12:31:58,535 INFO L273 TraceCheckUtils]: 58: Hoare triple {34630#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34630#true} is VALID [2018-11-23 12:31:58,535 INFO L273 TraceCheckUtils]: 59: Hoare triple {34630#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34630#true} is VALID [2018-11-23 12:31:58,535 INFO L273 TraceCheckUtils]: 60: Hoare triple {34630#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34630#true} is VALID [2018-11-23 12:31:58,535 INFO L273 TraceCheckUtils]: 61: Hoare triple {34630#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34630#true} is VALID [2018-11-23 12:31:58,536 INFO L273 TraceCheckUtils]: 62: Hoare triple {34630#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34630#true} is VALID [2018-11-23 12:31:58,536 INFO L273 TraceCheckUtils]: 63: Hoare triple {34630#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34630#true} is VALID [2018-11-23 12:31:58,536 INFO L273 TraceCheckUtils]: 64: Hoare triple {34630#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34630#true} is VALID [2018-11-23 12:31:58,536 INFO L273 TraceCheckUtils]: 65: Hoare triple {34630#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34630#true} is VALID [2018-11-23 12:31:58,536 INFO L273 TraceCheckUtils]: 66: Hoare triple {34630#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34630#true} is VALID [2018-11-23 12:31:58,536 INFO L273 TraceCheckUtils]: 67: Hoare triple {34630#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34630#true} is VALID [2018-11-23 12:31:58,536 INFO L273 TraceCheckUtils]: 68: Hoare triple {34630#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34630#true} is VALID [2018-11-23 12:31:58,536 INFO L273 TraceCheckUtils]: 69: Hoare triple {34630#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34630#true} is VALID [2018-11-23 12:31:58,536 INFO L273 TraceCheckUtils]: 70: Hoare triple {34630#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34630#true} is VALID [2018-11-23 12:31:58,536 INFO L273 TraceCheckUtils]: 71: Hoare triple {34630#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34630#true} is VALID [2018-11-23 12:31:58,537 INFO L273 TraceCheckUtils]: 72: Hoare triple {34630#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34630#true} is VALID [2018-11-23 12:31:58,537 INFO L273 TraceCheckUtils]: 73: Hoare triple {34630#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34630#true} is VALID [2018-11-23 12:31:58,537 INFO L273 TraceCheckUtils]: 74: Hoare triple {34630#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34630#true} is VALID [2018-11-23 12:31:58,537 INFO L273 TraceCheckUtils]: 75: Hoare triple {34630#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34630#true} is VALID [2018-11-23 12:31:58,537 INFO L273 TraceCheckUtils]: 76: Hoare triple {34630#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34630#true} is VALID [2018-11-23 12:31:58,537 INFO L273 TraceCheckUtils]: 77: Hoare triple {34630#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34630#true} is VALID [2018-11-23 12:31:58,537 INFO L273 TraceCheckUtils]: 78: Hoare triple {34630#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34630#true} is VALID [2018-11-23 12:31:58,537 INFO L273 TraceCheckUtils]: 79: Hoare triple {34630#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34630#true} is VALID [2018-11-23 12:31:58,537 INFO L273 TraceCheckUtils]: 80: Hoare triple {34630#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34630#true} is VALID [2018-11-23 12:31:58,537 INFO L273 TraceCheckUtils]: 81: Hoare triple {34630#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34630#true} is VALID [2018-11-23 12:31:58,538 INFO L273 TraceCheckUtils]: 82: Hoare triple {34630#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34630#true} is VALID [2018-11-23 12:31:58,538 INFO L273 TraceCheckUtils]: 83: Hoare triple {34630#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34630#true} is VALID [2018-11-23 12:31:58,538 INFO L273 TraceCheckUtils]: 84: Hoare triple {34630#true} assume !(~i~1 < 100000); {34630#true} is VALID [2018-11-23 12:31:58,538 INFO L256 TraceCheckUtils]: 85: Hoare triple {34630#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {34630#true} is VALID [2018-11-23 12:31:58,538 INFO L273 TraceCheckUtils]: 86: Hoare triple {34630#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {34630#true} is VALID [2018-11-23 12:31:58,538 INFO L273 TraceCheckUtils]: 87: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:58,538 INFO L273 TraceCheckUtils]: 88: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:58,538 INFO L273 TraceCheckUtils]: 89: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:58,538 INFO L273 TraceCheckUtils]: 90: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:58,538 INFO L273 TraceCheckUtils]: 91: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:58,539 INFO L273 TraceCheckUtils]: 92: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:58,539 INFO L273 TraceCheckUtils]: 93: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:58,539 INFO L273 TraceCheckUtils]: 94: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:58,539 INFO L273 TraceCheckUtils]: 95: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:58,539 INFO L273 TraceCheckUtils]: 96: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:58,539 INFO L273 TraceCheckUtils]: 97: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:58,539 INFO L273 TraceCheckUtils]: 98: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:58,539 INFO L273 TraceCheckUtils]: 99: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:58,539 INFO L273 TraceCheckUtils]: 100: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:58,539 INFO L273 TraceCheckUtils]: 101: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:58,540 INFO L273 TraceCheckUtils]: 102: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:58,540 INFO L273 TraceCheckUtils]: 103: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:58,540 INFO L273 TraceCheckUtils]: 104: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:58,540 INFO L273 TraceCheckUtils]: 105: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:58,540 INFO L273 TraceCheckUtils]: 106: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:58,540 INFO L273 TraceCheckUtils]: 107: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:58,540 INFO L273 TraceCheckUtils]: 108: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:58,540 INFO L273 TraceCheckUtils]: 109: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:58,540 INFO L273 TraceCheckUtils]: 110: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:58,540 INFO L273 TraceCheckUtils]: 111: Hoare triple {34630#true} assume !(~i~0 < 100000); {34630#true} is VALID [2018-11-23 12:31:58,541 INFO L273 TraceCheckUtils]: 112: Hoare triple {34630#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {34630#true} is VALID [2018-11-23 12:31:58,541 INFO L273 TraceCheckUtils]: 113: Hoare triple {34630#true} assume true; {34630#true} is VALID [2018-11-23 12:31:58,541 INFO L268 TraceCheckUtils]: 114: Hoare quadruple {34630#true} {34630#true} #70#return; {34630#true} is VALID [2018-11-23 12:31:58,541 INFO L273 TraceCheckUtils]: 115: Hoare triple {34630#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {34630#true} is VALID [2018-11-23 12:31:58,541 INFO L256 TraceCheckUtils]: 116: Hoare triple {34630#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {34630#true} is VALID [2018-11-23 12:31:58,541 INFO L273 TraceCheckUtils]: 117: Hoare triple {34630#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {34630#true} is VALID [2018-11-23 12:31:58,541 INFO L273 TraceCheckUtils]: 118: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:58,541 INFO L273 TraceCheckUtils]: 119: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:58,541 INFO L273 TraceCheckUtils]: 120: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:58,541 INFO L273 TraceCheckUtils]: 121: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:58,542 INFO L273 TraceCheckUtils]: 122: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:58,542 INFO L273 TraceCheckUtils]: 123: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:58,542 INFO L273 TraceCheckUtils]: 124: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:58,542 INFO L273 TraceCheckUtils]: 125: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:58,542 INFO L273 TraceCheckUtils]: 126: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:58,542 INFO L273 TraceCheckUtils]: 127: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:58,542 INFO L273 TraceCheckUtils]: 128: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:58,542 INFO L273 TraceCheckUtils]: 129: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:58,542 INFO L273 TraceCheckUtils]: 130: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:58,542 INFO L273 TraceCheckUtils]: 131: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:58,543 INFO L273 TraceCheckUtils]: 132: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:58,543 INFO L273 TraceCheckUtils]: 133: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:58,543 INFO L273 TraceCheckUtils]: 134: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:58,543 INFO L273 TraceCheckUtils]: 135: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:58,543 INFO L273 TraceCheckUtils]: 136: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:58,543 INFO L273 TraceCheckUtils]: 137: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:58,543 INFO L273 TraceCheckUtils]: 138: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:58,543 INFO L273 TraceCheckUtils]: 139: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:58,543 INFO L273 TraceCheckUtils]: 140: Hoare triple {34630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {34630#true} is VALID [2018-11-23 12:31:58,544 INFO L273 TraceCheckUtils]: 141: Hoare triple {34630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34630#true} is VALID [2018-11-23 12:31:58,544 INFO L273 TraceCheckUtils]: 142: Hoare triple {34630#true} assume !(~i~0 < 100000); {34630#true} is VALID [2018-11-23 12:31:58,544 INFO L273 TraceCheckUtils]: 143: Hoare triple {34630#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {34630#true} is VALID [2018-11-23 12:31:58,544 INFO L273 TraceCheckUtils]: 144: Hoare triple {34630#true} assume true; {34630#true} is VALID [2018-11-23 12:31:58,544 INFO L268 TraceCheckUtils]: 145: Hoare quadruple {34630#true} {34630#true} #72#return; {34630#true} is VALID [2018-11-23 12:31:58,544 INFO L273 TraceCheckUtils]: 146: Hoare triple {34630#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {34630#true} is VALID [2018-11-23 12:31:58,544 INFO L273 TraceCheckUtils]: 147: Hoare triple {34630#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34630#true} is VALID [2018-11-23 12:31:58,544 INFO L273 TraceCheckUtils]: 148: Hoare triple {34630#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34630#true} is VALID [2018-11-23 12:31:58,544 INFO L273 TraceCheckUtils]: 149: Hoare triple {34630#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34630#true} is VALID [2018-11-23 12:31:58,544 INFO L273 TraceCheckUtils]: 150: Hoare triple {34630#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34630#true} is VALID [2018-11-23 12:31:58,545 INFO L273 TraceCheckUtils]: 151: Hoare triple {34630#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34630#true} is VALID [2018-11-23 12:31:58,545 INFO L273 TraceCheckUtils]: 152: Hoare triple {34630#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34630#true} is VALID [2018-11-23 12:31:58,545 INFO L273 TraceCheckUtils]: 153: Hoare triple {34630#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34630#true} is VALID [2018-11-23 12:31:58,545 INFO L273 TraceCheckUtils]: 154: Hoare triple {34630#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34630#true} is VALID [2018-11-23 12:31:58,545 INFO L273 TraceCheckUtils]: 155: Hoare triple {34630#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34630#true} is VALID [2018-11-23 12:31:58,545 INFO L273 TraceCheckUtils]: 156: Hoare triple {34630#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34630#true} is VALID [2018-11-23 12:31:58,545 INFO L273 TraceCheckUtils]: 157: Hoare triple {34630#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34630#true} is VALID [2018-11-23 12:31:58,545 INFO L273 TraceCheckUtils]: 158: Hoare triple {34630#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34630#true} is VALID [2018-11-23 12:31:58,545 INFO L273 TraceCheckUtils]: 159: Hoare triple {34630#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34630#true} is VALID [2018-11-23 12:31:58,545 INFO L273 TraceCheckUtils]: 160: Hoare triple {34630#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34630#true} is VALID [2018-11-23 12:31:58,546 INFO L273 TraceCheckUtils]: 161: Hoare triple {34630#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34630#true} is VALID [2018-11-23 12:31:58,546 INFO L273 TraceCheckUtils]: 162: Hoare triple {34630#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34630#true} is VALID [2018-11-23 12:31:58,546 INFO L273 TraceCheckUtils]: 163: Hoare triple {34630#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34630#true} is VALID [2018-11-23 12:31:58,546 INFO L273 TraceCheckUtils]: 164: Hoare triple {34630#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34630#true} is VALID [2018-11-23 12:31:58,546 INFO L273 TraceCheckUtils]: 165: Hoare triple {34630#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34630#true} is VALID [2018-11-23 12:31:58,546 INFO L273 TraceCheckUtils]: 166: Hoare triple {34630#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34630#true} is VALID [2018-11-23 12:31:58,546 INFO L273 TraceCheckUtils]: 167: Hoare triple {34630#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34630#true} is VALID [2018-11-23 12:31:58,546 INFO L273 TraceCheckUtils]: 168: Hoare triple {34630#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34630#true} is VALID [2018-11-23 12:31:58,546 INFO L273 TraceCheckUtils]: 169: Hoare triple {34630#true} assume !(~i~2 < 99999); {34630#true} is VALID [2018-11-23 12:31:58,546 INFO L273 TraceCheckUtils]: 170: Hoare triple {34630#true} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {34630#true} is VALID [2018-11-23 12:31:58,547 INFO L256 TraceCheckUtils]: 171: Hoare triple {34630#true} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {34630#true} is VALID [2018-11-23 12:31:58,547 INFO L273 TraceCheckUtils]: 172: Hoare triple {34630#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {35191#(<= xor_~i~0 1)} is VALID [2018-11-23 12:31:58,547 INFO L273 TraceCheckUtils]: 173: Hoare triple {35191#(<= xor_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {35191#(<= xor_~i~0 1)} is VALID [2018-11-23 12:31:58,548 INFO L273 TraceCheckUtils]: 174: Hoare triple {35191#(<= xor_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35198#(<= xor_~i~0 2)} is VALID [2018-11-23 12:31:58,548 INFO L273 TraceCheckUtils]: 175: Hoare triple {35198#(<= xor_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {35198#(<= xor_~i~0 2)} is VALID [2018-11-23 12:31:58,549 INFO L273 TraceCheckUtils]: 176: Hoare triple {35198#(<= xor_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35205#(<= xor_~i~0 3)} is VALID [2018-11-23 12:31:58,549 INFO L273 TraceCheckUtils]: 177: Hoare triple {35205#(<= xor_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {35205#(<= xor_~i~0 3)} is VALID [2018-11-23 12:31:58,549 INFO L273 TraceCheckUtils]: 178: Hoare triple {35205#(<= xor_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35212#(<= xor_~i~0 4)} is VALID [2018-11-23 12:31:58,550 INFO L273 TraceCheckUtils]: 179: Hoare triple {35212#(<= xor_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {35212#(<= xor_~i~0 4)} is VALID [2018-11-23 12:31:58,550 INFO L273 TraceCheckUtils]: 180: Hoare triple {35212#(<= xor_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35219#(<= xor_~i~0 5)} is VALID [2018-11-23 12:31:58,551 INFO L273 TraceCheckUtils]: 181: Hoare triple {35219#(<= xor_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {35219#(<= xor_~i~0 5)} is VALID [2018-11-23 12:31:58,552 INFO L273 TraceCheckUtils]: 182: Hoare triple {35219#(<= xor_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35226#(<= xor_~i~0 6)} is VALID [2018-11-23 12:31:58,552 INFO L273 TraceCheckUtils]: 183: Hoare triple {35226#(<= xor_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {35226#(<= xor_~i~0 6)} is VALID [2018-11-23 12:31:58,553 INFO L273 TraceCheckUtils]: 184: Hoare triple {35226#(<= xor_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35233#(<= xor_~i~0 7)} is VALID [2018-11-23 12:31:58,553 INFO L273 TraceCheckUtils]: 185: Hoare triple {35233#(<= xor_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {35233#(<= xor_~i~0 7)} is VALID [2018-11-23 12:31:58,554 INFO L273 TraceCheckUtils]: 186: Hoare triple {35233#(<= xor_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35240#(<= xor_~i~0 8)} is VALID [2018-11-23 12:31:58,555 INFO L273 TraceCheckUtils]: 187: Hoare triple {35240#(<= xor_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {35240#(<= xor_~i~0 8)} is VALID [2018-11-23 12:31:58,555 INFO L273 TraceCheckUtils]: 188: Hoare triple {35240#(<= xor_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35247#(<= xor_~i~0 9)} is VALID [2018-11-23 12:31:58,556 INFO L273 TraceCheckUtils]: 189: Hoare triple {35247#(<= xor_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {35247#(<= xor_~i~0 9)} is VALID [2018-11-23 12:31:58,557 INFO L273 TraceCheckUtils]: 190: Hoare triple {35247#(<= xor_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35254#(<= xor_~i~0 10)} is VALID [2018-11-23 12:31:58,557 INFO L273 TraceCheckUtils]: 191: Hoare triple {35254#(<= xor_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {35254#(<= xor_~i~0 10)} is VALID [2018-11-23 12:31:58,558 INFO L273 TraceCheckUtils]: 192: Hoare triple {35254#(<= xor_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35261#(<= xor_~i~0 11)} is VALID [2018-11-23 12:31:58,558 INFO L273 TraceCheckUtils]: 193: Hoare triple {35261#(<= xor_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {35261#(<= xor_~i~0 11)} is VALID [2018-11-23 12:31:58,559 INFO L273 TraceCheckUtils]: 194: Hoare triple {35261#(<= xor_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35268#(<= xor_~i~0 12)} is VALID [2018-11-23 12:31:58,559 INFO L273 TraceCheckUtils]: 195: Hoare triple {35268#(<= xor_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {35268#(<= xor_~i~0 12)} is VALID [2018-11-23 12:31:58,560 INFO L273 TraceCheckUtils]: 196: Hoare triple {35268#(<= xor_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35275#(<= xor_~i~0 13)} is VALID [2018-11-23 12:31:58,561 INFO L273 TraceCheckUtils]: 197: Hoare triple {35275#(<= xor_~i~0 13)} assume !(~i~0 < 100000); {34631#false} is VALID [2018-11-23 12:31:58,561 INFO L273 TraceCheckUtils]: 198: Hoare triple {34631#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {34631#false} is VALID [2018-11-23 12:31:58,561 INFO L273 TraceCheckUtils]: 199: Hoare triple {34631#false} assume true; {34631#false} is VALID [2018-11-23 12:31:58,561 INFO L268 TraceCheckUtils]: 200: Hoare quadruple {34631#false} {34630#true} #74#return; {34631#false} is VALID [2018-11-23 12:31:58,562 INFO L273 TraceCheckUtils]: 201: Hoare triple {34631#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {34631#false} is VALID [2018-11-23 12:31:58,562 INFO L273 TraceCheckUtils]: 202: Hoare triple {34631#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {34631#false} is VALID [2018-11-23 12:31:58,562 INFO L273 TraceCheckUtils]: 203: Hoare triple {34631#false} assume !false; {34631#false} is VALID [2018-11-23 12:31:58,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 632 proven. 144 refuted. 0 times theorem prover too weak. 2249 trivial. 0 not checked. [2018-11-23 12:31:58,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:31:58,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 15] total 55 [2018-11-23 12:31:58,598 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 204 [2018-11-23 12:31:58,599 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:31:58,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states. [2018-11-23 12:31:58,764 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:31:58,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-11-23 12:31:58,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-11-23 12:31:58,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=965, Invalid=2005, Unknown=0, NotChecked=0, Total=2970 [2018-11-23 12:31:58,766 INFO L87 Difference]: Start difference. First operand 147 states and 151 transitions. Second operand 55 states. [2018-11-23 12:32:00,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:32:00,402 INFO L93 Difference]: Finished difference Result 215 states and 227 transitions. [2018-11-23 12:32:00,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-23 12:32:00,402 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 204 [2018-11-23 12:32:00,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:32:00,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 12:32:00,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 162 transitions. [2018-11-23 12:32:00,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 12:32:00,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 162 transitions. [2018-11-23 12:32:00,405 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states and 162 transitions. [2018-11-23 12:32:00,593 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:32:00,596 INFO L225 Difference]: With dead ends: 215 [2018-11-23 12:32:00,596 INFO L226 Difference]: Without dead ends: 153 [2018-11-23 12:32:00,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=965, Invalid=2005, Unknown=0, NotChecked=0, Total=2970 [2018-11-23 12:32:00,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-11-23 12:32:00,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2018-11-23 12:32:00,647 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:32:00,647 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand 151 states. [2018-11-23 12:32:00,647 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 151 states. [2018-11-23 12:32:00,647 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 151 states. [2018-11-23 12:32:00,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:32:00,652 INFO L93 Difference]: Finished difference Result 153 states and 157 transitions. [2018-11-23 12:32:00,652 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2018-11-23 12:32:00,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:32:00,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:32:00,653 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand 153 states. [2018-11-23 12:32:00,653 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 153 states. [2018-11-23 12:32:00,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:32:00,655 INFO L93 Difference]: Finished difference Result 153 states and 157 transitions. [2018-11-23 12:32:00,655 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2018-11-23 12:32:00,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:32:00,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:32:00,655 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:32:00,656 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:32:00,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-11-23 12:32:00,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 155 transitions. [2018-11-23 12:32:00,658 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 155 transitions. Word has length 204 [2018-11-23 12:32:00,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:32:00,658 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 155 transitions. [2018-11-23 12:32:00,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-11-23 12:32:00,658 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 155 transitions. [2018-11-23 12:32:00,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-11-23 12:32:00,659 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:32:00,659 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:32:00,659 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:32:00,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:32:00,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1307046347, now seen corresponding path program 40 times [2018-11-23 12:32:00,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:32:00,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:32:00,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:32:00,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:32:00,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:32:00,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:32:01,622 INFO L256 TraceCheckUtils]: 0: Hoare triple {36147#true} call ULTIMATE.init(); {36147#true} is VALID [2018-11-23 12:32:01,622 INFO L273 TraceCheckUtils]: 1: Hoare triple {36147#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {36147#true} is VALID [2018-11-23 12:32:01,622 INFO L273 TraceCheckUtils]: 2: Hoare triple {36147#true} assume true; {36147#true} is VALID [2018-11-23 12:32:01,623 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36147#true} {36147#true} #66#return; {36147#true} is VALID [2018-11-23 12:32:01,623 INFO L256 TraceCheckUtils]: 4: Hoare triple {36147#true} call #t~ret13 := main(); {36147#true} is VALID [2018-11-23 12:32:01,624 INFO L273 TraceCheckUtils]: 5: Hoare triple {36147#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {36149#(= main_~i~1 0)} is VALID [2018-11-23 12:32:01,624 INFO L273 TraceCheckUtils]: 6: Hoare triple {36149#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36149#(= main_~i~1 0)} is VALID [2018-11-23 12:32:01,625 INFO L273 TraceCheckUtils]: 7: Hoare triple {36149#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36150#(<= main_~i~1 1)} is VALID [2018-11-23 12:32:01,625 INFO L273 TraceCheckUtils]: 8: Hoare triple {36150#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36150#(<= main_~i~1 1)} is VALID [2018-11-23 12:32:01,626 INFO L273 TraceCheckUtils]: 9: Hoare triple {36150#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36151#(<= main_~i~1 2)} is VALID [2018-11-23 12:32:01,626 INFO L273 TraceCheckUtils]: 10: Hoare triple {36151#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36151#(<= main_~i~1 2)} is VALID [2018-11-23 12:32:01,626 INFO L273 TraceCheckUtils]: 11: Hoare triple {36151#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36152#(<= main_~i~1 3)} is VALID [2018-11-23 12:32:01,627 INFO L273 TraceCheckUtils]: 12: Hoare triple {36152#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36152#(<= main_~i~1 3)} is VALID [2018-11-23 12:32:01,628 INFO L273 TraceCheckUtils]: 13: Hoare triple {36152#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36153#(<= main_~i~1 4)} is VALID [2018-11-23 12:32:01,628 INFO L273 TraceCheckUtils]: 14: Hoare triple {36153#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36153#(<= main_~i~1 4)} is VALID [2018-11-23 12:32:01,629 INFO L273 TraceCheckUtils]: 15: Hoare triple {36153#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36154#(<= main_~i~1 5)} is VALID [2018-11-23 12:32:01,629 INFO L273 TraceCheckUtils]: 16: Hoare triple {36154#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36154#(<= main_~i~1 5)} is VALID [2018-11-23 12:32:01,630 INFO L273 TraceCheckUtils]: 17: Hoare triple {36154#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36155#(<= main_~i~1 6)} is VALID [2018-11-23 12:32:01,630 INFO L273 TraceCheckUtils]: 18: Hoare triple {36155#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36155#(<= main_~i~1 6)} is VALID [2018-11-23 12:32:01,631 INFO L273 TraceCheckUtils]: 19: Hoare triple {36155#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36156#(<= main_~i~1 7)} is VALID [2018-11-23 12:32:01,632 INFO L273 TraceCheckUtils]: 20: Hoare triple {36156#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36156#(<= main_~i~1 7)} is VALID [2018-11-23 12:32:01,632 INFO L273 TraceCheckUtils]: 21: Hoare triple {36156#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36157#(<= main_~i~1 8)} is VALID [2018-11-23 12:32:01,633 INFO L273 TraceCheckUtils]: 22: Hoare triple {36157#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36157#(<= main_~i~1 8)} is VALID [2018-11-23 12:32:01,633 INFO L273 TraceCheckUtils]: 23: Hoare triple {36157#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36158#(<= main_~i~1 9)} is VALID [2018-11-23 12:32:01,634 INFO L273 TraceCheckUtils]: 24: Hoare triple {36158#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36158#(<= main_~i~1 9)} is VALID [2018-11-23 12:32:01,635 INFO L273 TraceCheckUtils]: 25: Hoare triple {36158#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36159#(<= main_~i~1 10)} is VALID [2018-11-23 12:32:01,635 INFO L273 TraceCheckUtils]: 26: Hoare triple {36159#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36159#(<= main_~i~1 10)} is VALID [2018-11-23 12:32:01,636 INFO L273 TraceCheckUtils]: 27: Hoare triple {36159#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36160#(<= main_~i~1 11)} is VALID [2018-11-23 12:32:01,636 INFO L273 TraceCheckUtils]: 28: Hoare triple {36160#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36160#(<= main_~i~1 11)} is VALID [2018-11-23 12:32:01,637 INFO L273 TraceCheckUtils]: 29: Hoare triple {36160#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36161#(<= main_~i~1 12)} is VALID [2018-11-23 12:32:01,637 INFO L273 TraceCheckUtils]: 30: Hoare triple {36161#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36161#(<= main_~i~1 12)} is VALID [2018-11-23 12:32:01,638 INFO L273 TraceCheckUtils]: 31: Hoare triple {36161#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36162#(<= main_~i~1 13)} is VALID [2018-11-23 12:32:01,639 INFO L273 TraceCheckUtils]: 32: Hoare triple {36162#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36162#(<= main_~i~1 13)} is VALID [2018-11-23 12:32:01,639 INFO L273 TraceCheckUtils]: 33: Hoare triple {36162#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36163#(<= main_~i~1 14)} is VALID [2018-11-23 12:32:01,640 INFO L273 TraceCheckUtils]: 34: Hoare triple {36163#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36163#(<= main_~i~1 14)} is VALID [2018-11-23 12:32:01,640 INFO L273 TraceCheckUtils]: 35: Hoare triple {36163#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36164#(<= main_~i~1 15)} is VALID [2018-11-23 12:32:01,641 INFO L273 TraceCheckUtils]: 36: Hoare triple {36164#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36164#(<= main_~i~1 15)} is VALID [2018-11-23 12:32:01,642 INFO L273 TraceCheckUtils]: 37: Hoare triple {36164#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36165#(<= main_~i~1 16)} is VALID [2018-11-23 12:32:01,642 INFO L273 TraceCheckUtils]: 38: Hoare triple {36165#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36165#(<= main_~i~1 16)} is VALID [2018-11-23 12:32:01,643 INFO L273 TraceCheckUtils]: 39: Hoare triple {36165#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36166#(<= main_~i~1 17)} is VALID [2018-11-23 12:32:01,643 INFO L273 TraceCheckUtils]: 40: Hoare triple {36166#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36166#(<= main_~i~1 17)} is VALID [2018-11-23 12:32:01,644 INFO L273 TraceCheckUtils]: 41: Hoare triple {36166#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36167#(<= main_~i~1 18)} is VALID [2018-11-23 12:32:01,644 INFO L273 TraceCheckUtils]: 42: Hoare triple {36167#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36167#(<= main_~i~1 18)} is VALID [2018-11-23 12:32:01,645 INFO L273 TraceCheckUtils]: 43: Hoare triple {36167#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36168#(<= main_~i~1 19)} is VALID [2018-11-23 12:32:01,646 INFO L273 TraceCheckUtils]: 44: Hoare triple {36168#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36168#(<= main_~i~1 19)} is VALID [2018-11-23 12:32:01,646 INFO L273 TraceCheckUtils]: 45: Hoare triple {36168#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36169#(<= main_~i~1 20)} is VALID [2018-11-23 12:32:01,647 INFO L273 TraceCheckUtils]: 46: Hoare triple {36169#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36169#(<= main_~i~1 20)} is VALID [2018-11-23 12:32:01,647 INFO L273 TraceCheckUtils]: 47: Hoare triple {36169#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36170#(<= main_~i~1 21)} is VALID [2018-11-23 12:32:01,648 INFO L273 TraceCheckUtils]: 48: Hoare triple {36170#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36170#(<= main_~i~1 21)} is VALID [2018-11-23 12:32:01,649 INFO L273 TraceCheckUtils]: 49: Hoare triple {36170#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36171#(<= main_~i~1 22)} is VALID [2018-11-23 12:32:01,649 INFO L273 TraceCheckUtils]: 50: Hoare triple {36171#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36171#(<= main_~i~1 22)} is VALID [2018-11-23 12:32:01,650 INFO L273 TraceCheckUtils]: 51: Hoare triple {36171#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36172#(<= main_~i~1 23)} is VALID [2018-11-23 12:32:01,650 INFO L273 TraceCheckUtils]: 52: Hoare triple {36172#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36172#(<= main_~i~1 23)} is VALID [2018-11-23 12:32:01,651 INFO L273 TraceCheckUtils]: 53: Hoare triple {36172#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36173#(<= main_~i~1 24)} is VALID [2018-11-23 12:32:01,651 INFO L273 TraceCheckUtils]: 54: Hoare triple {36173#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36173#(<= main_~i~1 24)} is VALID [2018-11-23 12:32:01,652 INFO L273 TraceCheckUtils]: 55: Hoare triple {36173#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36174#(<= main_~i~1 25)} is VALID [2018-11-23 12:32:01,653 INFO L273 TraceCheckUtils]: 56: Hoare triple {36174#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36174#(<= main_~i~1 25)} is VALID [2018-11-23 12:32:01,653 INFO L273 TraceCheckUtils]: 57: Hoare triple {36174#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36175#(<= main_~i~1 26)} is VALID [2018-11-23 12:32:01,654 INFO L273 TraceCheckUtils]: 58: Hoare triple {36175#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36175#(<= main_~i~1 26)} is VALID [2018-11-23 12:32:01,655 INFO L273 TraceCheckUtils]: 59: Hoare triple {36175#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36176#(<= main_~i~1 27)} is VALID [2018-11-23 12:32:01,655 INFO L273 TraceCheckUtils]: 60: Hoare triple {36176#(<= main_~i~1 27)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36176#(<= main_~i~1 27)} is VALID [2018-11-23 12:32:01,656 INFO L273 TraceCheckUtils]: 61: Hoare triple {36176#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36177#(<= main_~i~1 28)} is VALID [2018-11-23 12:32:01,656 INFO L273 TraceCheckUtils]: 62: Hoare triple {36177#(<= main_~i~1 28)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36177#(<= main_~i~1 28)} is VALID [2018-11-23 12:32:01,657 INFO L273 TraceCheckUtils]: 63: Hoare triple {36177#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36178#(<= main_~i~1 29)} is VALID [2018-11-23 12:32:01,657 INFO L273 TraceCheckUtils]: 64: Hoare triple {36178#(<= main_~i~1 29)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36178#(<= main_~i~1 29)} is VALID [2018-11-23 12:32:01,658 INFO L273 TraceCheckUtils]: 65: Hoare triple {36178#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36179#(<= main_~i~1 30)} is VALID [2018-11-23 12:32:01,658 INFO L273 TraceCheckUtils]: 66: Hoare triple {36179#(<= main_~i~1 30)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36179#(<= main_~i~1 30)} is VALID [2018-11-23 12:32:01,659 INFO L273 TraceCheckUtils]: 67: Hoare triple {36179#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36180#(<= main_~i~1 31)} is VALID [2018-11-23 12:32:01,660 INFO L273 TraceCheckUtils]: 68: Hoare triple {36180#(<= main_~i~1 31)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36180#(<= main_~i~1 31)} is VALID [2018-11-23 12:32:01,660 INFO L273 TraceCheckUtils]: 69: Hoare triple {36180#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36181#(<= main_~i~1 32)} is VALID [2018-11-23 12:32:01,661 INFO L273 TraceCheckUtils]: 70: Hoare triple {36181#(<= main_~i~1 32)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36181#(<= main_~i~1 32)} is VALID [2018-11-23 12:32:01,661 INFO L273 TraceCheckUtils]: 71: Hoare triple {36181#(<= main_~i~1 32)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36182#(<= main_~i~1 33)} is VALID [2018-11-23 12:32:01,662 INFO L273 TraceCheckUtils]: 72: Hoare triple {36182#(<= main_~i~1 33)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36182#(<= main_~i~1 33)} is VALID [2018-11-23 12:32:01,663 INFO L273 TraceCheckUtils]: 73: Hoare triple {36182#(<= main_~i~1 33)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36183#(<= main_~i~1 34)} is VALID [2018-11-23 12:32:01,663 INFO L273 TraceCheckUtils]: 74: Hoare triple {36183#(<= main_~i~1 34)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36183#(<= main_~i~1 34)} is VALID [2018-11-23 12:32:01,664 INFO L273 TraceCheckUtils]: 75: Hoare triple {36183#(<= main_~i~1 34)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36184#(<= main_~i~1 35)} is VALID [2018-11-23 12:32:01,664 INFO L273 TraceCheckUtils]: 76: Hoare triple {36184#(<= main_~i~1 35)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36184#(<= main_~i~1 35)} is VALID [2018-11-23 12:32:01,665 INFO L273 TraceCheckUtils]: 77: Hoare triple {36184#(<= main_~i~1 35)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36185#(<= main_~i~1 36)} is VALID [2018-11-23 12:32:01,665 INFO L273 TraceCheckUtils]: 78: Hoare triple {36185#(<= main_~i~1 36)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36185#(<= main_~i~1 36)} is VALID [2018-11-23 12:32:01,666 INFO L273 TraceCheckUtils]: 79: Hoare triple {36185#(<= main_~i~1 36)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36186#(<= main_~i~1 37)} is VALID [2018-11-23 12:32:01,667 INFO L273 TraceCheckUtils]: 80: Hoare triple {36186#(<= main_~i~1 37)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36186#(<= main_~i~1 37)} is VALID [2018-11-23 12:32:01,667 INFO L273 TraceCheckUtils]: 81: Hoare triple {36186#(<= main_~i~1 37)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36187#(<= main_~i~1 38)} is VALID [2018-11-23 12:32:01,668 INFO L273 TraceCheckUtils]: 82: Hoare triple {36187#(<= main_~i~1 38)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36187#(<= main_~i~1 38)} is VALID [2018-11-23 12:32:01,668 INFO L273 TraceCheckUtils]: 83: Hoare triple {36187#(<= main_~i~1 38)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36188#(<= main_~i~1 39)} is VALID [2018-11-23 12:32:01,669 INFO L273 TraceCheckUtils]: 84: Hoare triple {36188#(<= main_~i~1 39)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36188#(<= main_~i~1 39)} is VALID [2018-11-23 12:32:01,670 INFO L273 TraceCheckUtils]: 85: Hoare triple {36188#(<= main_~i~1 39)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36189#(<= main_~i~1 40)} is VALID [2018-11-23 12:32:01,670 INFO L273 TraceCheckUtils]: 86: Hoare triple {36189#(<= main_~i~1 40)} assume !(~i~1 < 100000); {36148#false} is VALID [2018-11-23 12:32:01,670 INFO L256 TraceCheckUtils]: 87: Hoare triple {36148#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {36147#true} is VALID [2018-11-23 12:32:01,671 INFO L273 TraceCheckUtils]: 88: Hoare triple {36147#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {36147#true} is VALID [2018-11-23 12:32:01,671 INFO L273 TraceCheckUtils]: 89: Hoare triple {36147#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36147#true} is VALID [2018-11-23 12:32:01,671 INFO L273 TraceCheckUtils]: 90: Hoare triple {36147#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36147#true} is VALID [2018-11-23 12:32:01,671 INFO L273 TraceCheckUtils]: 91: Hoare triple {36147#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36147#true} is VALID [2018-11-23 12:32:01,671 INFO L273 TraceCheckUtils]: 92: Hoare triple {36147#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36147#true} is VALID [2018-11-23 12:32:01,671 INFO L273 TraceCheckUtils]: 93: Hoare triple {36147#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36147#true} is VALID [2018-11-23 12:32:01,672 INFO L273 TraceCheckUtils]: 94: Hoare triple {36147#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36147#true} is VALID [2018-11-23 12:32:01,672 INFO L273 TraceCheckUtils]: 95: Hoare triple {36147#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36147#true} is VALID [2018-11-23 12:32:01,672 INFO L273 TraceCheckUtils]: 96: Hoare triple {36147#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36147#true} is VALID [2018-11-23 12:32:01,672 INFO L273 TraceCheckUtils]: 97: Hoare triple {36147#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36147#true} is VALID [2018-11-23 12:32:01,672 INFO L273 TraceCheckUtils]: 98: Hoare triple {36147#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36147#true} is VALID [2018-11-23 12:32:01,672 INFO L273 TraceCheckUtils]: 99: Hoare triple {36147#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36147#true} is VALID [2018-11-23 12:32:01,673 INFO L273 TraceCheckUtils]: 100: Hoare triple {36147#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36147#true} is VALID [2018-11-23 12:32:01,673 INFO L273 TraceCheckUtils]: 101: Hoare triple {36147#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36147#true} is VALID [2018-11-23 12:32:01,673 INFO L273 TraceCheckUtils]: 102: Hoare triple {36147#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36147#true} is VALID [2018-11-23 12:32:01,673 INFO L273 TraceCheckUtils]: 103: Hoare triple {36147#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36147#true} is VALID [2018-11-23 12:32:01,673 INFO L273 TraceCheckUtils]: 104: Hoare triple {36147#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36147#true} is VALID [2018-11-23 12:32:01,673 INFO L273 TraceCheckUtils]: 105: Hoare triple {36147#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36147#true} is VALID [2018-11-23 12:32:01,674 INFO L273 TraceCheckUtils]: 106: Hoare triple {36147#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36147#true} is VALID [2018-11-23 12:32:01,674 INFO L273 TraceCheckUtils]: 107: Hoare triple {36147#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36147#true} is VALID [2018-11-23 12:32:01,674 INFO L273 TraceCheckUtils]: 108: Hoare triple {36147#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36147#true} is VALID [2018-11-23 12:32:01,674 INFO L273 TraceCheckUtils]: 109: Hoare triple {36147#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36147#true} is VALID [2018-11-23 12:32:01,674 INFO L273 TraceCheckUtils]: 110: Hoare triple {36147#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36147#true} is VALID [2018-11-23 12:32:01,674 INFO L273 TraceCheckUtils]: 111: Hoare triple {36147#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36147#true} is VALID [2018-11-23 12:32:01,674 INFO L273 TraceCheckUtils]: 112: Hoare triple {36147#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36147#true} is VALID [2018-11-23 12:32:01,675 INFO L273 TraceCheckUtils]: 113: Hoare triple {36147#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36147#true} is VALID [2018-11-23 12:32:01,675 INFO L273 TraceCheckUtils]: 114: Hoare triple {36147#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36147#true} is VALID [2018-11-23 12:32:01,675 INFO L273 TraceCheckUtils]: 115: Hoare triple {36147#true} assume !(~i~0 < 100000); {36147#true} is VALID [2018-11-23 12:32:01,675 INFO L273 TraceCheckUtils]: 116: Hoare triple {36147#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {36147#true} is VALID [2018-11-23 12:32:01,675 INFO L273 TraceCheckUtils]: 117: Hoare triple {36147#true} assume true; {36147#true} is VALID [2018-11-23 12:32:01,675 INFO L268 TraceCheckUtils]: 118: Hoare quadruple {36147#true} {36148#false} #70#return; {36148#false} is VALID [2018-11-23 12:32:01,675 INFO L273 TraceCheckUtils]: 119: Hoare triple {36148#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {36148#false} is VALID [2018-11-23 12:32:01,675 INFO L256 TraceCheckUtils]: 120: Hoare triple {36148#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {36147#true} is VALID [2018-11-23 12:32:01,675 INFO L273 TraceCheckUtils]: 121: Hoare triple {36147#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {36147#true} is VALID [2018-11-23 12:32:01,676 INFO L273 TraceCheckUtils]: 122: Hoare triple {36147#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36147#true} is VALID [2018-11-23 12:32:01,676 INFO L273 TraceCheckUtils]: 123: Hoare triple {36147#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36147#true} is VALID [2018-11-23 12:32:01,676 INFO L273 TraceCheckUtils]: 124: Hoare triple {36147#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36147#true} is VALID [2018-11-23 12:32:01,676 INFO L273 TraceCheckUtils]: 125: Hoare triple {36147#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36147#true} is VALID [2018-11-23 12:32:01,676 INFO L273 TraceCheckUtils]: 126: Hoare triple {36147#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36147#true} is VALID [2018-11-23 12:32:01,676 INFO L273 TraceCheckUtils]: 127: Hoare triple {36147#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36147#true} is VALID [2018-11-23 12:32:01,676 INFO L273 TraceCheckUtils]: 128: Hoare triple {36147#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36147#true} is VALID [2018-11-23 12:32:01,676 INFO L273 TraceCheckUtils]: 129: Hoare triple {36147#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36147#true} is VALID [2018-11-23 12:32:01,676 INFO L273 TraceCheckUtils]: 130: Hoare triple {36147#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36147#true} is VALID [2018-11-23 12:32:01,676 INFO L273 TraceCheckUtils]: 131: Hoare triple {36147#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36147#true} is VALID [2018-11-23 12:32:01,677 INFO L273 TraceCheckUtils]: 132: Hoare triple {36147#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36147#true} is VALID [2018-11-23 12:32:01,677 INFO L273 TraceCheckUtils]: 133: Hoare triple {36147#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36147#true} is VALID [2018-11-23 12:32:01,677 INFO L273 TraceCheckUtils]: 134: Hoare triple {36147#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36147#true} is VALID [2018-11-23 12:32:01,677 INFO L273 TraceCheckUtils]: 135: Hoare triple {36147#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36147#true} is VALID [2018-11-23 12:32:01,677 INFO L273 TraceCheckUtils]: 136: Hoare triple {36147#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36147#true} is VALID [2018-11-23 12:32:01,677 INFO L273 TraceCheckUtils]: 137: Hoare triple {36147#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36147#true} is VALID [2018-11-23 12:32:01,677 INFO L273 TraceCheckUtils]: 138: Hoare triple {36147#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36147#true} is VALID [2018-11-23 12:32:01,677 INFO L273 TraceCheckUtils]: 139: Hoare triple {36147#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36147#true} is VALID [2018-11-23 12:32:01,677 INFO L273 TraceCheckUtils]: 140: Hoare triple {36147#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36147#true} is VALID [2018-11-23 12:32:01,677 INFO L273 TraceCheckUtils]: 141: Hoare triple {36147#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36147#true} is VALID [2018-11-23 12:32:01,678 INFO L273 TraceCheckUtils]: 142: Hoare triple {36147#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36147#true} is VALID [2018-11-23 12:32:01,678 INFO L273 TraceCheckUtils]: 143: Hoare triple {36147#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36147#true} is VALID [2018-11-23 12:32:01,678 INFO L273 TraceCheckUtils]: 144: Hoare triple {36147#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36147#true} is VALID [2018-11-23 12:32:01,678 INFO L273 TraceCheckUtils]: 145: Hoare triple {36147#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36147#true} is VALID [2018-11-23 12:32:01,678 INFO L273 TraceCheckUtils]: 146: Hoare triple {36147#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36147#true} is VALID [2018-11-23 12:32:01,678 INFO L273 TraceCheckUtils]: 147: Hoare triple {36147#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36147#true} is VALID [2018-11-23 12:32:01,678 INFO L273 TraceCheckUtils]: 148: Hoare triple {36147#true} assume !(~i~0 < 100000); {36147#true} is VALID [2018-11-23 12:32:01,678 INFO L273 TraceCheckUtils]: 149: Hoare triple {36147#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {36147#true} is VALID [2018-11-23 12:32:01,678 INFO L273 TraceCheckUtils]: 150: Hoare triple {36147#true} assume true; {36147#true} is VALID [2018-11-23 12:32:01,678 INFO L268 TraceCheckUtils]: 151: Hoare quadruple {36147#true} {36148#false} #72#return; {36148#false} is VALID [2018-11-23 12:32:01,679 INFO L273 TraceCheckUtils]: 152: Hoare triple {36148#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {36148#false} is VALID [2018-11-23 12:32:01,679 INFO L273 TraceCheckUtils]: 153: Hoare triple {36148#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36148#false} is VALID [2018-11-23 12:32:01,679 INFO L273 TraceCheckUtils]: 154: Hoare triple {36148#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36148#false} is VALID [2018-11-23 12:32:01,679 INFO L273 TraceCheckUtils]: 155: Hoare triple {36148#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36148#false} is VALID [2018-11-23 12:32:01,679 INFO L273 TraceCheckUtils]: 156: Hoare triple {36148#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36148#false} is VALID [2018-11-23 12:32:01,679 INFO L273 TraceCheckUtils]: 157: Hoare triple {36148#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36148#false} is VALID [2018-11-23 12:32:01,679 INFO L273 TraceCheckUtils]: 158: Hoare triple {36148#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36148#false} is VALID [2018-11-23 12:32:01,679 INFO L273 TraceCheckUtils]: 159: Hoare triple {36148#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36148#false} is VALID [2018-11-23 12:32:01,679 INFO L273 TraceCheckUtils]: 160: Hoare triple {36148#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36148#false} is VALID [2018-11-23 12:32:01,680 INFO L273 TraceCheckUtils]: 161: Hoare triple {36148#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36148#false} is VALID [2018-11-23 12:32:01,680 INFO L273 TraceCheckUtils]: 162: Hoare triple {36148#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36148#false} is VALID [2018-11-23 12:32:01,680 INFO L273 TraceCheckUtils]: 163: Hoare triple {36148#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36148#false} is VALID [2018-11-23 12:32:01,680 INFO L273 TraceCheckUtils]: 164: Hoare triple {36148#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36148#false} is VALID [2018-11-23 12:32:01,680 INFO L273 TraceCheckUtils]: 165: Hoare triple {36148#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36148#false} is VALID [2018-11-23 12:32:01,680 INFO L273 TraceCheckUtils]: 166: Hoare triple {36148#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36148#false} is VALID [2018-11-23 12:32:01,680 INFO L273 TraceCheckUtils]: 167: Hoare triple {36148#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36148#false} is VALID [2018-11-23 12:32:01,680 INFO L273 TraceCheckUtils]: 168: Hoare triple {36148#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36148#false} is VALID [2018-11-23 12:32:01,680 INFO L273 TraceCheckUtils]: 169: Hoare triple {36148#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36148#false} is VALID [2018-11-23 12:32:01,680 INFO L273 TraceCheckUtils]: 170: Hoare triple {36148#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36148#false} is VALID [2018-11-23 12:32:01,681 INFO L273 TraceCheckUtils]: 171: Hoare triple {36148#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36148#false} is VALID [2018-11-23 12:32:01,681 INFO L273 TraceCheckUtils]: 172: Hoare triple {36148#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36148#false} is VALID [2018-11-23 12:32:01,681 INFO L273 TraceCheckUtils]: 173: Hoare triple {36148#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36148#false} is VALID [2018-11-23 12:32:01,681 INFO L273 TraceCheckUtils]: 174: Hoare triple {36148#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36148#false} is VALID [2018-11-23 12:32:01,681 INFO L273 TraceCheckUtils]: 175: Hoare triple {36148#false} assume !(~i~2 < 99999); {36148#false} is VALID [2018-11-23 12:32:01,681 INFO L273 TraceCheckUtils]: 176: Hoare triple {36148#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {36148#false} is VALID [2018-11-23 12:32:01,681 INFO L256 TraceCheckUtils]: 177: Hoare triple {36148#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {36147#true} is VALID [2018-11-23 12:32:01,681 INFO L273 TraceCheckUtils]: 178: Hoare triple {36147#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {36147#true} is VALID [2018-11-23 12:32:01,681 INFO L273 TraceCheckUtils]: 179: Hoare triple {36147#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36147#true} is VALID [2018-11-23 12:32:01,681 INFO L273 TraceCheckUtils]: 180: Hoare triple {36147#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36147#true} is VALID [2018-11-23 12:32:01,682 INFO L273 TraceCheckUtils]: 181: Hoare triple {36147#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36147#true} is VALID [2018-11-23 12:32:01,682 INFO L273 TraceCheckUtils]: 182: Hoare triple {36147#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36147#true} is VALID [2018-11-23 12:32:01,682 INFO L273 TraceCheckUtils]: 183: Hoare triple {36147#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36147#true} is VALID [2018-11-23 12:32:01,682 INFO L273 TraceCheckUtils]: 184: Hoare triple {36147#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36147#true} is VALID [2018-11-23 12:32:01,682 INFO L273 TraceCheckUtils]: 185: Hoare triple {36147#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36147#true} is VALID [2018-11-23 12:32:01,682 INFO L273 TraceCheckUtils]: 186: Hoare triple {36147#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36147#true} is VALID [2018-11-23 12:32:01,682 INFO L273 TraceCheckUtils]: 187: Hoare triple {36147#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36147#true} is VALID [2018-11-23 12:32:01,682 INFO L273 TraceCheckUtils]: 188: Hoare triple {36147#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36147#true} is VALID [2018-11-23 12:32:01,682 INFO L273 TraceCheckUtils]: 189: Hoare triple {36147#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36147#true} is VALID [2018-11-23 12:32:01,682 INFO L273 TraceCheckUtils]: 190: Hoare triple {36147#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36147#true} is VALID [2018-11-23 12:32:01,683 INFO L273 TraceCheckUtils]: 191: Hoare triple {36147#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36147#true} is VALID [2018-11-23 12:32:01,683 INFO L273 TraceCheckUtils]: 192: Hoare triple {36147#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36147#true} is VALID [2018-11-23 12:32:01,683 INFO L273 TraceCheckUtils]: 193: Hoare triple {36147#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36147#true} is VALID [2018-11-23 12:32:01,683 INFO L273 TraceCheckUtils]: 194: Hoare triple {36147#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36147#true} is VALID [2018-11-23 12:32:01,683 INFO L273 TraceCheckUtils]: 195: Hoare triple {36147#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36147#true} is VALID [2018-11-23 12:32:01,683 INFO L273 TraceCheckUtils]: 196: Hoare triple {36147#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36147#true} is VALID [2018-11-23 12:32:01,683 INFO L273 TraceCheckUtils]: 197: Hoare triple {36147#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36147#true} is VALID [2018-11-23 12:32:01,683 INFO L273 TraceCheckUtils]: 198: Hoare triple {36147#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36147#true} is VALID [2018-11-23 12:32:01,683 INFO L273 TraceCheckUtils]: 199: Hoare triple {36147#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36147#true} is VALID [2018-11-23 12:32:01,683 INFO L273 TraceCheckUtils]: 200: Hoare triple {36147#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36147#true} is VALID [2018-11-23 12:32:01,684 INFO L273 TraceCheckUtils]: 201: Hoare triple {36147#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36147#true} is VALID [2018-11-23 12:32:01,684 INFO L273 TraceCheckUtils]: 202: Hoare triple {36147#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36147#true} is VALID [2018-11-23 12:32:01,684 INFO L273 TraceCheckUtils]: 203: Hoare triple {36147#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36147#true} is VALID [2018-11-23 12:32:01,684 INFO L273 TraceCheckUtils]: 204: Hoare triple {36147#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36147#true} is VALID [2018-11-23 12:32:01,684 INFO L273 TraceCheckUtils]: 205: Hoare triple {36147#true} assume !(~i~0 < 100000); {36147#true} is VALID [2018-11-23 12:32:01,684 INFO L273 TraceCheckUtils]: 206: Hoare triple {36147#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {36147#true} is VALID [2018-11-23 12:32:01,684 INFO L273 TraceCheckUtils]: 207: Hoare triple {36147#true} assume true; {36147#true} is VALID [2018-11-23 12:32:01,684 INFO L268 TraceCheckUtils]: 208: Hoare quadruple {36147#true} {36148#false} #74#return; {36148#false} is VALID [2018-11-23 12:32:01,684 INFO L273 TraceCheckUtils]: 209: Hoare triple {36148#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {36148#false} is VALID [2018-11-23 12:32:01,684 INFO L273 TraceCheckUtils]: 210: Hoare triple {36148#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {36148#false} is VALID [2018-11-23 12:32:01,685 INFO L273 TraceCheckUtils]: 211: Hoare triple {36148#false} assume !false; {36148#false} is VALID [2018-11-23 12:32:01,704 INFO L134 CoverageAnalysis]: Checked inductivity of 3335 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 1735 trivial. 0 not checked. [2018-11-23 12:32:01,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:32:01,704 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:32:01,712 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:32:01,797 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:32:01,797 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:32:01,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:32:01,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:32:02,153 INFO L256 TraceCheckUtils]: 0: Hoare triple {36147#true} call ULTIMATE.init(); {36147#true} is VALID [2018-11-23 12:32:02,153 INFO L273 TraceCheckUtils]: 1: Hoare triple {36147#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {36147#true} is VALID [2018-11-23 12:32:02,154 INFO L273 TraceCheckUtils]: 2: Hoare triple {36147#true} assume true; {36147#true} is VALID [2018-11-23 12:32:02,154 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36147#true} {36147#true} #66#return; {36147#true} is VALID [2018-11-23 12:32:02,154 INFO L256 TraceCheckUtils]: 4: Hoare triple {36147#true} call #t~ret13 := main(); {36147#true} is VALID [2018-11-23 12:32:02,155 INFO L273 TraceCheckUtils]: 5: Hoare triple {36147#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {36208#(<= main_~i~1 0)} is VALID [2018-11-23 12:32:02,155 INFO L273 TraceCheckUtils]: 6: Hoare triple {36208#(<= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36208#(<= main_~i~1 0)} is VALID [2018-11-23 12:32:02,156 INFO L273 TraceCheckUtils]: 7: Hoare triple {36208#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36150#(<= main_~i~1 1)} is VALID [2018-11-23 12:32:02,156 INFO L273 TraceCheckUtils]: 8: Hoare triple {36150#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36150#(<= main_~i~1 1)} is VALID [2018-11-23 12:32:02,157 INFO L273 TraceCheckUtils]: 9: Hoare triple {36150#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36151#(<= main_~i~1 2)} is VALID [2018-11-23 12:32:02,157 INFO L273 TraceCheckUtils]: 10: Hoare triple {36151#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36151#(<= main_~i~1 2)} is VALID [2018-11-23 12:32:02,157 INFO L273 TraceCheckUtils]: 11: Hoare triple {36151#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36152#(<= main_~i~1 3)} is VALID [2018-11-23 12:32:02,158 INFO L273 TraceCheckUtils]: 12: Hoare triple {36152#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36152#(<= main_~i~1 3)} is VALID [2018-11-23 12:32:02,158 INFO L273 TraceCheckUtils]: 13: Hoare triple {36152#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36153#(<= main_~i~1 4)} is VALID [2018-11-23 12:32:02,159 INFO L273 TraceCheckUtils]: 14: Hoare triple {36153#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36153#(<= main_~i~1 4)} is VALID [2018-11-23 12:32:02,159 INFO L273 TraceCheckUtils]: 15: Hoare triple {36153#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36154#(<= main_~i~1 5)} is VALID [2018-11-23 12:32:02,160 INFO L273 TraceCheckUtils]: 16: Hoare triple {36154#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36154#(<= main_~i~1 5)} is VALID [2018-11-23 12:32:02,161 INFO L273 TraceCheckUtils]: 17: Hoare triple {36154#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36155#(<= main_~i~1 6)} is VALID [2018-11-23 12:32:02,161 INFO L273 TraceCheckUtils]: 18: Hoare triple {36155#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36155#(<= main_~i~1 6)} is VALID [2018-11-23 12:32:02,162 INFO L273 TraceCheckUtils]: 19: Hoare triple {36155#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36156#(<= main_~i~1 7)} is VALID [2018-11-23 12:32:02,162 INFO L273 TraceCheckUtils]: 20: Hoare triple {36156#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36156#(<= main_~i~1 7)} is VALID [2018-11-23 12:32:02,163 INFO L273 TraceCheckUtils]: 21: Hoare triple {36156#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36157#(<= main_~i~1 8)} is VALID [2018-11-23 12:32:02,163 INFO L273 TraceCheckUtils]: 22: Hoare triple {36157#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36157#(<= main_~i~1 8)} is VALID [2018-11-23 12:32:02,164 INFO L273 TraceCheckUtils]: 23: Hoare triple {36157#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36158#(<= main_~i~1 9)} is VALID [2018-11-23 12:32:02,165 INFO L273 TraceCheckUtils]: 24: Hoare triple {36158#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36158#(<= main_~i~1 9)} is VALID [2018-11-23 12:32:02,165 INFO L273 TraceCheckUtils]: 25: Hoare triple {36158#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36159#(<= main_~i~1 10)} is VALID [2018-11-23 12:32:02,166 INFO L273 TraceCheckUtils]: 26: Hoare triple {36159#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36159#(<= main_~i~1 10)} is VALID [2018-11-23 12:32:02,166 INFO L273 TraceCheckUtils]: 27: Hoare triple {36159#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36160#(<= main_~i~1 11)} is VALID [2018-11-23 12:32:02,167 INFO L273 TraceCheckUtils]: 28: Hoare triple {36160#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36160#(<= main_~i~1 11)} is VALID [2018-11-23 12:32:02,168 INFO L273 TraceCheckUtils]: 29: Hoare triple {36160#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36161#(<= main_~i~1 12)} is VALID [2018-11-23 12:32:02,168 INFO L273 TraceCheckUtils]: 30: Hoare triple {36161#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36161#(<= main_~i~1 12)} is VALID [2018-11-23 12:32:02,169 INFO L273 TraceCheckUtils]: 31: Hoare triple {36161#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36162#(<= main_~i~1 13)} is VALID [2018-11-23 12:32:02,169 INFO L273 TraceCheckUtils]: 32: Hoare triple {36162#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36162#(<= main_~i~1 13)} is VALID [2018-11-23 12:32:02,170 INFO L273 TraceCheckUtils]: 33: Hoare triple {36162#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36163#(<= main_~i~1 14)} is VALID [2018-11-23 12:32:02,171 INFO L273 TraceCheckUtils]: 34: Hoare triple {36163#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36163#(<= main_~i~1 14)} is VALID [2018-11-23 12:32:02,171 INFO L273 TraceCheckUtils]: 35: Hoare triple {36163#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36164#(<= main_~i~1 15)} is VALID [2018-11-23 12:32:02,172 INFO L273 TraceCheckUtils]: 36: Hoare triple {36164#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36164#(<= main_~i~1 15)} is VALID [2018-11-23 12:32:02,172 INFO L273 TraceCheckUtils]: 37: Hoare triple {36164#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36165#(<= main_~i~1 16)} is VALID [2018-11-23 12:32:02,173 INFO L273 TraceCheckUtils]: 38: Hoare triple {36165#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36165#(<= main_~i~1 16)} is VALID [2018-11-23 12:32:02,173 INFO L273 TraceCheckUtils]: 39: Hoare triple {36165#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36166#(<= main_~i~1 17)} is VALID [2018-11-23 12:32:02,174 INFO L273 TraceCheckUtils]: 40: Hoare triple {36166#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36166#(<= main_~i~1 17)} is VALID [2018-11-23 12:32:02,175 INFO L273 TraceCheckUtils]: 41: Hoare triple {36166#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36167#(<= main_~i~1 18)} is VALID [2018-11-23 12:32:02,175 INFO L273 TraceCheckUtils]: 42: Hoare triple {36167#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36167#(<= main_~i~1 18)} is VALID [2018-11-23 12:32:02,176 INFO L273 TraceCheckUtils]: 43: Hoare triple {36167#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36168#(<= main_~i~1 19)} is VALID [2018-11-23 12:32:02,176 INFO L273 TraceCheckUtils]: 44: Hoare triple {36168#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36168#(<= main_~i~1 19)} is VALID [2018-11-23 12:32:02,177 INFO L273 TraceCheckUtils]: 45: Hoare triple {36168#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36169#(<= main_~i~1 20)} is VALID [2018-11-23 12:32:02,177 INFO L273 TraceCheckUtils]: 46: Hoare triple {36169#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36169#(<= main_~i~1 20)} is VALID [2018-11-23 12:32:02,178 INFO L273 TraceCheckUtils]: 47: Hoare triple {36169#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36170#(<= main_~i~1 21)} is VALID [2018-11-23 12:32:02,179 INFO L273 TraceCheckUtils]: 48: Hoare triple {36170#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36170#(<= main_~i~1 21)} is VALID [2018-11-23 12:32:02,179 INFO L273 TraceCheckUtils]: 49: Hoare triple {36170#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36171#(<= main_~i~1 22)} is VALID [2018-11-23 12:32:02,180 INFO L273 TraceCheckUtils]: 50: Hoare triple {36171#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36171#(<= main_~i~1 22)} is VALID [2018-11-23 12:32:02,180 INFO L273 TraceCheckUtils]: 51: Hoare triple {36171#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36172#(<= main_~i~1 23)} is VALID [2018-11-23 12:32:02,181 INFO L273 TraceCheckUtils]: 52: Hoare triple {36172#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36172#(<= main_~i~1 23)} is VALID [2018-11-23 12:32:02,182 INFO L273 TraceCheckUtils]: 53: Hoare triple {36172#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36173#(<= main_~i~1 24)} is VALID [2018-11-23 12:32:02,182 INFO L273 TraceCheckUtils]: 54: Hoare triple {36173#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36173#(<= main_~i~1 24)} is VALID [2018-11-23 12:32:02,183 INFO L273 TraceCheckUtils]: 55: Hoare triple {36173#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36174#(<= main_~i~1 25)} is VALID [2018-11-23 12:32:02,183 INFO L273 TraceCheckUtils]: 56: Hoare triple {36174#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36174#(<= main_~i~1 25)} is VALID [2018-11-23 12:32:02,184 INFO L273 TraceCheckUtils]: 57: Hoare triple {36174#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36175#(<= main_~i~1 26)} is VALID [2018-11-23 12:32:02,185 INFO L273 TraceCheckUtils]: 58: Hoare triple {36175#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36175#(<= main_~i~1 26)} is VALID [2018-11-23 12:32:02,185 INFO L273 TraceCheckUtils]: 59: Hoare triple {36175#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36176#(<= main_~i~1 27)} is VALID [2018-11-23 12:32:02,186 INFO L273 TraceCheckUtils]: 60: Hoare triple {36176#(<= main_~i~1 27)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36176#(<= main_~i~1 27)} is VALID [2018-11-23 12:32:02,187 INFO L273 TraceCheckUtils]: 61: Hoare triple {36176#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36177#(<= main_~i~1 28)} is VALID [2018-11-23 12:32:02,187 INFO L273 TraceCheckUtils]: 62: Hoare triple {36177#(<= main_~i~1 28)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36177#(<= main_~i~1 28)} is VALID [2018-11-23 12:32:02,188 INFO L273 TraceCheckUtils]: 63: Hoare triple {36177#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36178#(<= main_~i~1 29)} is VALID [2018-11-23 12:32:02,188 INFO L273 TraceCheckUtils]: 64: Hoare triple {36178#(<= main_~i~1 29)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36178#(<= main_~i~1 29)} is VALID [2018-11-23 12:32:02,189 INFO L273 TraceCheckUtils]: 65: Hoare triple {36178#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36179#(<= main_~i~1 30)} is VALID [2018-11-23 12:32:02,189 INFO L273 TraceCheckUtils]: 66: Hoare triple {36179#(<= main_~i~1 30)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36179#(<= main_~i~1 30)} is VALID [2018-11-23 12:32:02,190 INFO L273 TraceCheckUtils]: 67: Hoare triple {36179#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36180#(<= main_~i~1 31)} is VALID [2018-11-23 12:32:02,191 INFO L273 TraceCheckUtils]: 68: Hoare triple {36180#(<= main_~i~1 31)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36180#(<= main_~i~1 31)} is VALID [2018-11-23 12:32:02,191 INFO L273 TraceCheckUtils]: 69: Hoare triple {36180#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36181#(<= main_~i~1 32)} is VALID [2018-11-23 12:32:02,192 INFO L273 TraceCheckUtils]: 70: Hoare triple {36181#(<= main_~i~1 32)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36181#(<= main_~i~1 32)} is VALID [2018-11-23 12:32:02,192 INFO L273 TraceCheckUtils]: 71: Hoare triple {36181#(<= main_~i~1 32)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36182#(<= main_~i~1 33)} is VALID [2018-11-23 12:32:02,193 INFO L273 TraceCheckUtils]: 72: Hoare triple {36182#(<= main_~i~1 33)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36182#(<= main_~i~1 33)} is VALID [2018-11-23 12:32:02,194 INFO L273 TraceCheckUtils]: 73: Hoare triple {36182#(<= main_~i~1 33)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36183#(<= main_~i~1 34)} is VALID [2018-11-23 12:32:02,194 INFO L273 TraceCheckUtils]: 74: Hoare triple {36183#(<= main_~i~1 34)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36183#(<= main_~i~1 34)} is VALID [2018-11-23 12:32:02,195 INFO L273 TraceCheckUtils]: 75: Hoare triple {36183#(<= main_~i~1 34)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36184#(<= main_~i~1 35)} is VALID [2018-11-23 12:32:02,195 INFO L273 TraceCheckUtils]: 76: Hoare triple {36184#(<= main_~i~1 35)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36184#(<= main_~i~1 35)} is VALID [2018-11-23 12:32:02,196 INFO L273 TraceCheckUtils]: 77: Hoare triple {36184#(<= main_~i~1 35)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36185#(<= main_~i~1 36)} is VALID [2018-11-23 12:32:02,196 INFO L273 TraceCheckUtils]: 78: Hoare triple {36185#(<= main_~i~1 36)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36185#(<= main_~i~1 36)} is VALID [2018-11-23 12:32:02,197 INFO L273 TraceCheckUtils]: 79: Hoare triple {36185#(<= main_~i~1 36)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36186#(<= main_~i~1 37)} is VALID [2018-11-23 12:32:02,198 INFO L273 TraceCheckUtils]: 80: Hoare triple {36186#(<= main_~i~1 37)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36186#(<= main_~i~1 37)} is VALID [2018-11-23 12:32:02,198 INFO L273 TraceCheckUtils]: 81: Hoare triple {36186#(<= main_~i~1 37)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36187#(<= main_~i~1 38)} is VALID [2018-11-23 12:32:02,199 INFO L273 TraceCheckUtils]: 82: Hoare triple {36187#(<= main_~i~1 38)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36187#(<= main_~i~1 38)} is VALID [2018-11-23 12:32:02,200 INFO L273 TraceCheckUtils]: 83: Hoare triple {36187#(<= main_~i~1 38)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36188#(<= main_~i~1 39)} is VALID [2018-11-23 12:32:02,200 INFO L273 TraceCheckUtils]: 84: Hoare triple {36188#(<= main_~i~1 39)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36188#(<= main_~i~1 39)} is VALID [2018-11-23 12:32:02,201 INFO L273 TraceCheckUtils]: 85: Hoare triple {36188#(<= main_~i~1 39)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36189#(<= main_~i~1 40)} is VALID [2018-11-23 12:32:02,201 INFO L273 TraceCheckUtils]: 86: Hoare triple {36189#(<= main_~i~1 40)} assume !(~i~1 < 100000); {36148#false} is VALID [2018-11-23 12:32:02,202 INFO L256 TraceCheckUtils]: 87: Hoare triple {36148#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {36148#false} is VALID [2018-11-23 12:32:02,202 INFO L273 TraceCheckUtils]: 88: Hoare triple {36148#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {36148#false} is VALID [2018-11-23 12:32:02,202 INFO L273 TraceCheckUtils]: 89: Hoare triple {36148#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36148#false} is VALID [2018-11-23 12:32:02,202 INFO L273 TraceCheckUtils]: 90: Hoare triple {36148#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36148#false} is VALID [2018-11-23 12:32:02,202 INFO L273 TraceCheckUtils]: 91: Hoare triple {36148#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36148#false} is VALID [2018-11-23 12:32:02,202 INFO L273 TraceCheckUtils]: 92: Hoare triple {36148#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36148#false} is VALID [2018-11-23 12:32:02,203 INFO L273 TraceCheckUtils]: 93: Hoare triple {36148#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36148#false} is VALID [2018-11-23 12:32:02,203 INFO L273 TraceCheckUtils]: 94: Hoare triple {36148#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36148#false} is VALID [2018-11-23 12:32:02,203 INFO L273 TraceCheckUtils]: 95: Hoare triple {36148#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36148#false} is VALID [2018-11-23 12:32:02,203 INFO L273 TraceCheckUtils]: 96: Hoare triple {36148#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36148#false} is VALID [2018-11-23 12:32:02,203 INFO L273 TraceCheckUtils]: 97: Hoare triple {36148#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36148#false} is VALID [2018-11-23 12:32:02,203 INFO L273 TraceCheckUtils]: 98: Hoare triple {36148#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36148#false} is VALID [2018-11-23 12:32:02,204 INFO L273 TraceCheckUtils]: 99: Hoare triple {36148#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36148#false} is VALID [2018-11-23 12:32:02,204 INFO L273 TraceCheckUtils]: 100: Hoare triple {36148#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36148#false} is VALID [2018-11-23 12:32:02,204 INFO L273 TraceCheckUtils]: 101: Hoare triple {36148#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36148#false} is VALID [2018-11-23 12:32:02,204 INFO L273 TraceCheckUtils]: 102: Hoare triple {36148#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36148#false} is VALID [2018-11-23 12:32:02,204 INFO L273 TraceCheckUtils]: 103: Hoare triple {36148#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36148#false} is VALID [2018-11-23 12:32:02,204 INFO L273 TraceCheckUtils]: 104: Hoare triple {36148#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36148#false} is VALID [2018-11-23 12:32:02,205 INFO L273 TraceCheckUtils]: 105: Hoare triple {36148#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36148#false} is VALID [2018-11-23 12:32:02,205 INFO L273 TraceCheckUtils]: 106: Hoare triple {36148#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36148#false} is VALID [2018-11-23 12:32:02,205 INFO L273 TraceCheckUtils]: 107: Hoare triple {36148#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36148#false} is VALID [2018-11-23 12:32:02,205 INFO L273 TraceCheckUtils]: 108: Hoare triple {36148#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36148#false} is VALID [2018-11-23 12:32:02,205 INFO L273 TraceCheckUtils]: 109: Hoare triple {36148#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36148#false} is VALID [2018-11-23 12:32:02,205 INFO L273 TraceCheckUtils]: 110: Hoare triple {36148#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36148#false} is VALID [2018-11-23 12:32:02,205 INFO L273 TraceCheckUtils]: 111: Hoare triple {36148#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36148#false} is VALID [2018-11-23 12:32:02,205 INFO L273 TraceCheckUtils]: 112: Hoare triple {36148#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36148#false} is VALID [2018-11-23 12:32:02,205 INFO L273 TraceCheckUtils]: 113: Hoare triple {36148#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36148#false} is VALID [2018-11-23 12:32:02,206 INFO L273 TraceCheckUtils]: 114: Hoare triple {36148#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36148#false} is VALID [2018-11-23 12:32:02,206 INFO L273 TraceCheckUtils]: 115: Hoare triple {36148#false} assume !(~i~0 < 100000); {36148#false} is VALID [2018-11-23 12:32:02,206 INFO L273 TraceCheckUtils]: 116: Hoare triple {36148#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {36148#false} is VALID [2018-11-23 12:32:02,206 INFO L273 TraceCheckUtils]: 117: Hoare triple {36148#false} assume true; {36148#false} is VALID [2018-11-23 12:32:02,206 INFO L268 TraceCheckUtils]: 118: Hoare quadruple {36148#false} {36148#false} #70#return; {36148#false} is VALID [2018-11-23 12:32:02,206 INFO L273 TraceCheckUtils]: 119: Hoare triple {36148#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {36148#false} is VALID [2018-11-23 12:32:02,206 INFO L256 TraceCheckUtils]: 120: Hoare triple {36148#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {36148#false} is VALID [2018-11-23 12:32:02,206 INFO L273 TraceCheckUtils]: 121: Hoare triple {36148#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {36148#false} is VALID [2018-11-23 12:32:02,206 INFO L273 TraceCheckUtils]: 122: Hoare triple {36148#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36148#false} is VALID [2018-11-23 12:32:02,206 INFO L273 TraceCheckUtils]: 123: Hoare triple {36148#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36148#false} is VALID [2018-11-23 12:32:02,207 INFO L273 TraceCheckUtils]: 124: Hoare triple {36148#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36148#false} is VALID [2018-11-23 12:32:02,207 INFO L273 TraceCheckUtils]: 125: Hoare triple {36148#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36148#false} is VALID [2018-11-23 12:32:02,207 INFO L273 TraceCheckUtils]: 126: Hoare triple {36148#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36148#false} is VALID [2018-11-23 12:32:02,207 INFO L273 TraceCheckUtils]: 127: Hoare triple {36148#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36148#false} is VALID [2018-11-23 12:32:02,207 INFO L273 TraceCheckUtils]: 128: Hoare triple {36148#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36148#false} is VALID [2018-11-23 12:32:02,207 INFO L273 TraceCheckUtils]: 129: Hoare triple {36148#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36148#false} is VALID [2018-11-23 12:32:02,207 INFO L273 TraceCheckUtils]: 130: Hoare triple {36148#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36148#false} is VALID [2018-11-23 12:32:02,207 INFO L273 TraceCheckUtils]: 131: Hoare triple {36148#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36148#false} is VALID [2018-11-23 12:32:02,207 INFO L273 TraceCheckUtils]: 132: Hoare triple {36148#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36148#false} is VALID [2018-11-23 12:32:02,207 INFO L273 TraceCheckUtils]: 133: Hoare triple {36148#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36148#false} is VALID [2018-11-23 12:32:02,208 INFO L273 TraceCheckUtils]: 134: Hoare triple {36148#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36148#false} is VALID [2018-11-23 12:32:02,208 INFO L273 TraceCheckUtils]: 135: Hoare triple {36148#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36148#false} is VALID [2018-11-23 12:32:02,208 INFO L273 TraceCheckUtils]: 136: Hoare triple {36148#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36148#false} is VALID [2018-11-23 12:32:02,208 INFO L273 TraceCheckUtils]: 137: Hoare triple {36148#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36148#false} is VALID [2018-11-23 12:32:02,208 INFO L273 TraceCheckUtils]: 138: Hoare triple {36148#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36148#false} is VALID [2018-11-23 12:32:02,208 INFO L273 TraceCheckUtils]: 139: Hoare triple {36148#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36148#false} is VALID [2018-11-23 12:32:02,208 INFO L273 TraceCheckUtils]: 140: Hoare triple {36148#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36148#false} is VALID [2018-11-23 12:32:02,208 INFO L273 TraceCheckUtils]: 141: Hoare triple {36148#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36148#false} is VALID [2018-11-23 12:32:02,208 INFO L273 TraceCheckUtils]: 142: Hoare triple {36148#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36148#false} is VALID [2018-11-23 12:32:02,208 INFO L273 TraceCheckUtils]: 143: Hoare triple {36148#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36148#false} is VALID [2018-11-23 12:32:02,209 INFO L273 TraceCheckUtils]: 144: Hoare triple {36148#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36148#false} is VALID [2018-11-23 12:32:02,209 INFO L273 TraceCheckUtils]: 145: Hoare triple {36148#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36148#false} is VALID [2018-11-23 12:32:02,209 INFO L273 TraceCheckUtils]: 146: Hoare triple {36148#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36148#false} is VALID [2018-11-23 12:32:02,209 INFO L273 TraceCheckUtils]: 147: Hoare triple {36148#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36148#false} is VALID [2018-11-23 12:32:02,209 INFO L273 TraceCheckUtils]: 148: Hoare triple {36148#false} assume !(~i~0 < 100000); {36148#false} is VALID [2018-11-23 12:32:02,209 INFO L273 TraceCheckUtils]: 149: Hoare triple {36148#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {36148#false} is VALID [2018-11-23 12:32:02,209 INFO L273 TraceCheckUtils]: 150: Hoare triple {36148#false} assume true; {36148#false} is VALID [2018-11-23 12:32:02,209 INFO L268 TraceCheckUtils]: 151: Hoare quadruple {36148#false} {36148#false} #72#return; {36148#false} is VALID [2018-11-23 12:32:02,209 INFO L273 TraceCheckUtils]: 152: Hoare triple {36148#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {36148#false} is VALID [2018-11-23 12:32:02,209 INFO L273 TraceCheckUtils]: 153: Hoare triple {36148#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36148#false} is VALID [2018-11-23 12:32:02,210 INFO L273 TraceCheckUtils]: 154: Hoare triple {36148#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36148#false} is VALID [2018-11-23 12:32:02,210 INFO L273 TraceCheckUtils]: 155: Hoare triple {36148#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36148#false} is VALID [2018-11-23 12:32:02,210 INFO L273 TraceCheckUtils]: 156: Hoare triple {36148#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36148#false} is VALID [2018-11-23 12:32:02,210 INFO L273 TraceCheckUtils]: 157: Hoare triple {36148#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36148#false} is VALID [2018-11-23 12:32:02,210 INFO L273 TraceCheckUtils]: 158: Hoare triple {36148#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36148#false} is VALID [2018-11-23 12:32:02,210 INFO L273 TraceCheckUtils]: 159: Hoare triple {36148#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36148#false} is VALID [2018-11-23 12:32:02,210 INFO L273 TraceCheckUtils]: 160: Hoare triple {36148#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36148#false} is VALID [2018-11-23 12:32:02,210 INFO L273 TraceCheckUtils]: 161: Hoare triple {36148#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36148#false} is VALID [2018-11-23 12:32:02,210 INFO L273 TraceCheckUtils]: 162: Hoare triple {36148#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36148#false} is VALID [2018-11-23 12:32:02,210 INFO L273 TraceCheckUtils]: 163: Hoare triple {36148#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36148#false} is VALID [2018-11-23 12:32:02,211 INFO L273 TraceCheckUtils]: 164: Hoare triple {36148#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36148#false} is VALID [2018-11-23 12:32:02,211 INFO L273 TraceCheckUtils]: 165: Hoare triple {36148#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36148#false} is VALID [2018-11-23 12:32:02,211 INFO L273 TraceCheckUtils]: 166: Hoare triple {36148#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36148#false} is VALID [2018-11-23 12:32:02,211 INFO L273 TraceCheckUtils]: 167: Hoare triple {36148#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36148#false} is VALID [2018-11-23 12:32:02,211 INFO L273 TraceCheckUtils]: 168: Hoare triple {36148#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36148#false} is VALID [2018-11-23 12:32:02,211 INFO L273 TraceCheckUtils]: 169: Hoare triple {36148#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36148#false} is VALID [2018-11-23 12:32:02,211 INFO L273 TraceCheckUtils]: 170: Hoare triple {36148#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36148#false} is VALID [2018-11-23 12:32:02,211 INFO L273 TraceCheckUtils]: 171: Hoare triple {36148#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36148#false} is VALID [2018-11-23 12:32:02,211 INFO L273 TraceCheckUtils]: 172: Hoare triple {36148#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36148#false} is VALID [2018-11-23 12:32:02,212 INFO L273 TraceCheckUtils]: 173: Hoare triple {36148#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36148#false} is VALID [2018-11-23 12:32:02,212 INFO L273 TraceCheckUtils]: 174: Hoare triple {36148#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36148#false} is VALID [2018-11-23 12:32:02,212 INFO L273 TraceCheckUtils]: 175: Hoare triple {36148#false} assume !(~i~2 < 99999); {36148#false} is VALID [2018-11-23 12:32:02,212 INFO L273 TraceCheckUtils]: 176: Hoare triple {36148#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {36148#false} is VALID [2018-11-23 12:32:02,212 INFO L256 TraceCheckUtils]: 177: Hoare triple {36148#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {36148#false} is VALID [2018-11-23 12:32:02,212 INFO L273 TraceCheckUtils]: 178: Hoare triple {36148#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {36148#false} is VALID [2018-11-23 12:32:02,212 INFO L273 TraceCheckUtils]: 179: Hoare triple {36148#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36148#false} is VALID [2018-11-23 12:32:02,212 INFO L273 TraceCheckUtils]: 180: Hoare triple {36148#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36148#false} is VALID [2018-11-23 12:32:02,212 INFO L273 TraceCheckUtils]: 181: Hoare triple {36148#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36148#false} is VALID [2018-11-23 12:32:02,212 INFO L273 TraceCheckUtils]: 182: Hoare triple {36148#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36148#false} is VALID [2018-11-23 12:32:02,213 INFO L273 TraceCheckUtils]: 183: Hoare triple {36148#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36148#false} is VALID [2018-11-23 12:32:02,213 INFO L273 TraceCheckUtils]: 184: Hoare triple {36148#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36148#false} is VALID [2018-11-23 12:32:02,213 INFO L273 TraceCheckUtils]: 185: Hoare triple {36148#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36148#false} is VALID [2018-11-23 12:32:02,213 INFO L273 TraceCheckUtils]: 186: Hoare triple {36148#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36148#false} is VALID [2018-11-23 12:32:02,213 INFO L273 TraceCheckUtils]: 187: Hoare triple {36148#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36148#false} is VALID [2018-11-23 12:32:02,213 INFO L273 TraceCheckUtils]: 188: Hoare triple {36148#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36148#false} is VALID [2018-11-23 12:32:02,213 INFO L273 TraceCheckUtils]: 189: Hoare triple {36148#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36148#false} is VALID [2018-11-23 12:32:02,213 INFO L273 TraceCheckUtils]: 190: Hoare triple {36148#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36148#false} is VALID [2018-11-23 12:32:02,213 INFO L273 TraceCheckUtils]: 191: Hoare triple {36148#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36148#false} is VALID [2018-11-23 12:32:02,213 INFO L273 TraceCheckUtils]: 192: Hoare triple {36148#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36148#false} is VALID [2018-11-23 12:32:02,214 INFO L273 TraceCheckUtils]: 193: Hoare triple {36148#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36148#false} is VALID [2018-11-23 12:32:02,214 INFO L273 TraceCheckUtils]: 194: Hoare triple {36148#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36148#false} is VALID [2018-11-23 12:32:02,214 INFO L273 TraceCheckUtils]: 195: Hoare triple {36148#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36148#false} is VALID [2018-11-23 12:32:02,214 INFO L273 TraceCheckUtils]: 196: Hoare triple {36148#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36148#false} is VALID [2018-11-23 12:32:02,214 INFO L273 TraceCheckUtils]: 197: Hoare triple {36148#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36148#false} is VALID [2018-11-23 12:32:02,214 INFO L273 TraceCheckUtils]: 198: Hoare triple {36148#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36148#false} is VALID [2018-11-23 12:32:02,214 INFO L273 TraceCheckUtils]: 199: Hoare triple {36148#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36148#false} is VALID [2018-11-23 12:32:02,214 INFO L273 TraceCheckUtils]: 200: Hoare triple {36148#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36148#false} is VALID [2018-11-23 12:32:02,214 INFO L273 TraceCheckUtils]: 201: Hoare triple {36148#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36148#false} is VALID [2018-11-23 12:32:02,214 INFO L273 TraceCheckUtils]: 202: Hoare triple {36148#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36148#false} is VALID [2018-11-23 12:32:02,215 INFO L273 TraceCheckUtils]: 203: Hoare triple {36148#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {36148#false} is VALID [2018-11-23 12:32:02,215 INFO L273 TraceCheckUtils]: 204: Hoare triple {36148#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36148#false} is VALID [2018-11-23 12:32:02,215 INFO L273 TraceCheckUtils]: 205: Hoare triple {36148#false} assume !(~i~0 < 100000); {36148#false} is VALID [2018-11-23 12:32:02,215 INFO L273 TraceCheckUtils]: 206: Hoare triple {36148#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {36148#false} is VALID [2018-11-23 12:32:02,215 INFO L273 TraceCheckUtils]: 207: Hoare triple {36148#false} assume true; {36148#false} is VALID [2018-11-23 12:32:02,215 INFO L268 TraceCheckUtils]: 208: Hoare quadruple {36148#false} {36148#false} #74#return; {36148#false} is VALID [2018-11-23 12:32:02,215 INFO L273 TraceCheckUtils]: 209: Hoare triple {36148#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {36148#false} is VALID [2018-11-23 12:32:02,215 INFO L273 TraceCheckUtils]: 210: Hoare triple {36148#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {36148#false} is VALID [2018-11-23 12:32:02,215 INFO L273 TraceCheckUtils]: 211: Hoare triple {36148#false} assume !false; {36148#false} is VALID [2018-11-23 12:32:02,236 INFO L134 CoverageAnalysis]: Checked inductivity of 3335 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 1735 trivial. 0 not checked. [2018-11-23 12:32:02,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:32:02,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2018-11-23 12:32:02,264 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 212 [2018-11-23 12:32:02,265 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:32:02,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states. [2018-11-23 12:32:02,452 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:32:02,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-23 12:32:02,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-23 12:32:02,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 12:32:02,453 INFO L87 Difference]: Start difference. First operand 151 states and 155 transitions. Second operand 44 states. [2018-11-23 12:32:03,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:32:03,335 INFO L93 Difference]: Finished difference Result 218 states and 226 transitions. [2018-11-23 12:32:03,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-23 12:32:03,335 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 212 [2018-11-23 12:32:03,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:32:03,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 12:32:03,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 134 transitions. [2018-11-23 12:32:03,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 12:32:03,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 134 transitions. [2018-11-23 12:32:03,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 134 transitions. [2018-11-23 12:32:03,460 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:32:03,464 INFO L225 Difference]: With dead ends: 218 [2018-11-23 12:32:03,464 INFO L226 Difference]: Without dead ends: 154 [2018-11-23 12:32:03,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 12:32:03,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-11-23 12:32:03,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2018-11-23 12:32:03,521 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:32:03,521 INFO L82 GeneralOperation]: Start isEquivalent. First operand 154 states. Second operand 153 states. [2018-11-23 12:32:03,521 INFO L74 IsIncluded]: Start isIncluded. First operand 154 states. Second operand 153 states. [2018-11-23 12:32:03,521 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 153 states. [2018-11-23 12:32:03,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:32:03,523 INFO L93 Difference]: Finished difference Result 154 states and 158 transitions. [2018-11-23 12:32:03,523 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 158 transitions. [2018-11-23 12:32:03,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:32:03,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:32:03,524 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 154 states. [2018-11-23 12:32:03,524 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 154 states. [2018-11-23 12:32:03,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:32:03,526 INFO L93 Difference]: Finished difference Result 154 states and 158 transitions. [2018-11-23 12:32:03,526 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 158 transitions. [2018-11-23 12:32:03,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:32:03,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:32:03,527 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:32:03,527 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:32:03,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-11-23 12:32:03,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 157 transitions. [2018-11-23 12:32:03,530 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 157 transitions. Word has length 212 [2018-11-23 12:32:03,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:32:03,530 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 157 transitions. [2018-11-23 12:32:03,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-23 12:32:03,530 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2018-11-23 12:32:03,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-11-23 12:32:03,531 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:32:03,531 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 39, 39, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:32:03,532 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:32:03,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:32:03,532 INFO L82 PathProgramCache]: Analyzing trace with hash -376184531, now seen corresponding path program 41 times [2018-11-23 12:32:03,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:32:03,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:32:03,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:32:03,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:32:03,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:32:03,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:32:04,791 INFO L256 TraceCheckUtils]: 0: Hoare triple {37687#true} call ULTIMATE.init(); {37687#true} is VALID [2018-11-23 12:32:04,791 INFO L273 TraceCheckUtils]: 1: Hoare triple {37687#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {37687#true} is VALID [2018-11-23 12:32:04,791 INFO L273 TraceCheckUtils]: 2: Hoare triple {37687#true} assume true; {37687#true} is VALID [2018-11-23 12:32:04,791 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37687#true} {37687#true} #66#return; {37687#true} is VALID [2018-11-23 12:32:04,791 INFO L256 TraceCheckUtils]: 4: Hoare triple {37687#true} call #t~ret13 := main(); {37687#true} is VALID [2018-11-23 12:32:04,792 INFO L273 TraceCheckUtils]: 5: Hoare triple {37687#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {37689#(= main_~i~1 0)} is VALID [2018-11-23 12:32:04,792 INFO L273 TraceCheckUtils]: 6: Hoare triple {37689#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37689#(= main_~i~1 0)} is VALID [2018-11-23 12:32:04,793 INFO L273 TraceCheckUtils]: 7: Hoare triple {37689#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37690#(<= main_~i~1 1)} is VALID [2018-11-23 12:32:04,794 INFO L273 TraceCheckUtils]: 8: Hoare triple {37690#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37690#(<= main_~i~1 1)} is VALID [2018-11-23 12:32:04,794 INFO L273 TraceCheckUtils]: 9: Hoare triple {37690#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37691#(<= main_~i~1 2)} is VALID [2018-11-23 12:32:04,795 INFO L273 TraceCheckUtils]: 10: Hoare triple {37691#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37691#(<= main_~i~1 2)} is VALID [2018-11-23 12:32:04,796 INFO L273 TraceCheckUtils]: 11: Hoare triple {37691#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37692#(<= main_~i~1 3)} is VALID [2018-11-23 12:32:04,796 INFO L273 TraceCheckUtils]: 12: Hoare triple {37692#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37692#(<= main_~i~1 3)} is VALID [2018-11-23 12:32:04,797 INFO L273 TraceCheckUtils]: 13: Hoare triple {37692#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37693#(<= main_~i~1 4)} is VALID [2018-11-23 12:32:04,798 INFO L273 TraceCheckUtils]: 14: Hoare triple {37693#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37693#(<= main_~i~1 4)} is VALID [2018-11-23 12:32:04,798 INFO L273 TraceCheckUtils]: 15: Hoare triple {37693#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37694#(<= main_~i~1 5)} is VALID [2018-11-23 12:32:04,799 INFO L273 TraceCheckUtils]: 16: Hoare triple {37694#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37694#(<= main_~i~1 5)} is VALID [2018-11-23 12:32:04,799 INFO L273 TraceCheckUtils]: 17: Hoare triple {37694#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37695#(<= main_~i~1 6)} is VALID [2018-11-23 12:32:04,800 INFO L273 TraceCheckUtils]: 18: Hoare triple {37695#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37695#(<= main_~i~1 6)} is VALID [2018-11-23 12:32:04,801 INFO L273 TraceCheckUtils]: 19: Hoare triple {37695#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37696#(<= main_~i~1 7)} is VALID [2018-11-23 12:32:04,801 INFO L273 TraceCheckUtils]: 20: Hoare triple {37696#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37696#(<= main_~i~1 7)} is VALID [2018-11-23 12:32:04,802 INFO L273 TraceCheckUtils]: 21: Hoare triple {37696#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37697#(<= main_~i~1 8)} is VALID [2018-11-23 12:32:04,802 INFO L273 TraceCheckUtils]: 22: Hoare triple {37697#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37697#(<= main_~i~1 8)} is VALID [2018-11-23 12:32:04,803 INFO L273 TraceCheckUtils]: 23: Hoare triple {37697#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37698#(<= main_~i~1 9)} is VALID [2018-11-23 12:32:04,804 INFO L273 TraceCheckUtils]: 24: Hoare triple {37698#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37698#(<= main_~i~1 9)} is VALID [2018-11-23 12:32:04,804 INFO L273 TraceCheckUtils]: 25: Hoare triple {37698#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37699#(<= main_~i~1 10)} is VALID [2018-11-23 12:32:04,805 INFO L273 TraceCheckUtils]: 26: Hoare triple {37699#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37699#(<= main_~i~1 10)} is VALID [2018-11-23 12:32:04,806 INFO L273 TraceCheckUtils]: 27: Hoare triple {37699#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37700#(<= main_~i~1 11)} is VALID [2018-11-23 12:32:04,806 INFO L273 TraceCheckUtils]: 28: Hoare triple {37700#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37700#(<= main_~i~1 11)} is VALID [2018-11-23 12:32:04,807 INFO L273 TraceCheckUtils]: 29: Hoare triple {37700#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37701#(<= main_~i~1 12)} is VALID [2018-11-23 12:32:04,807 INFO L273 TraceCheckUtils]: 30: Hoare triple {37701#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37701#(<= main_~i~1 12)} is VALID [2018-11-23 12:32:04,808 INFO L273 TraceCheckUtils]: 31: Hoare triple {37701#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37702#(<= main_~i~1 13)} is VALID [2018-11-23 12:32:04,809 INFO L273 TraceCheckUtils]: 32: Hoare triple {37702#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37702#(<= main_~i~1 13)} is VALID [2018-11-23 12:32:04,809 INFO L273 TraceCheckUtils]: 33: Hoare triple {37702#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37703#(<= main_~i~1 14)} is VALID [2018-11-23 12:32:04,810 INFO L273 TraceCheckUtils]: 34: Hoare triple {37703#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37703#(<= main_~i~1 14)} is VALID [2018-11-23 12:32:04,811 INFO L273 TraceCheckUtils]: 35: Hoare triple {37703#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37704#(<= main_~i~1 15)} is VALID [2018-11-23 12:32:04,811 INFO L273 TraceCheckUtils]: 36: Hoare triple {37704#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37704#(<= main_~i~1 15)} is VALID [2018-11-23 12:32:04,812 INFO L273 TraceCheckUtils]: 37: Hoare triple {37704#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37705#(<= main_~i~1 16)} is VALID [2018-11-23 12:32:04,812 INFO L273 TraceCheckUtils]: 38: Hoare triple {37705#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37705#(<= main_~i~1 16)} is VALID [2018-11-23 12:32:04,813 INFO L273 TraceCheckUtils]: 39: Hoare triple {37705#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37706#(<= main_~i~1 17)} is VALID [2018-11-23 12:32:04,814 INFO L273 TraceCheckUtils]: 40: Hoare triple {37706#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37706#(<= main_~i~1 17)} is VALID [2018-11-23 12:32:04,814 INFO L273 TraceCheckUtils]: 41: Hoare triple {37706#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37707#(<= main_~i~1 18)} is VALID [2018-11-23 12:32:04,815 INFO L273 TraceCheckUtils]: 42: Hoare triple {37707#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37707#(<= main_~i~1 18)} is VALID [2018-11-23 12:32:04,816 INFO L273 TraceCheckUtils]: 43: Hoare triple {37707#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37708#(<= main_~i~1 19)} is VALID [2018-11-23 12:32:04,816 INFO L273 TraceCheckUtils]: 44: Hoare triple {37708#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37708#(<= main_~i~1 19)} is VALID [2018-11-23 12:32:04,817 INFO L273 TraceCheckUtils]: 45: Hoare triple {37708#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37709#(<= main_~i~1 20)} is VALID [2018-11-23 12:32:04,817 INFO L273 TraceCheckUtils]: 46: Hoare triple {37709#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37709#(<= main_~i~1 20)} is VALID [2018-11-23 12:32:04,818 INFO L273 TraceCheckUtils]: 47: Hoare triple {37709#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37710#(<= main_~i~1 21)} is VALID [2018-11-23 12:32:04,819 INFO L273 TraceCheckUtils]: 48: Hoare triple {37710#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37710#(<= main_~i~1 21)} is VALID [2018-11-23 12:32:04,819 INFO L273 TraceCheckUtils]: 49: Hoare triple {37710#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37711#(<= main_~i~1 22)} is VALID [2018-11-23 12:32:04,820 INFO L273 TraceCheckUtils]: 50: Hoare triple {37711#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37711#(<= main_~i~1 22)} is VALID [2018-11-23 12:32:04,821 INFO L273 TraceCheckUtils]: 51: Hoare triple {37711#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37712#(<= main_~i~1 23)} is VALID [2018-11-23 12:32:04,821 INFO L273 TraceCheckUtils]: 52: Hoare triple {37712#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37712#(<= main_~i~1 23)} is VALID [2018-11-23 12:32:04,822 INFO L273 TraceCheckUtils]: 53: Hoare triple {37712#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37713#(<= main_~i~1 24)} is VALID [2018-11-23 12:32:04,822 INFO L273 TraceCheckUtils]: 54: Hoare triple {37713#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37713#(<= main_~i~1 24)} is VALID [2018-11-23 12:32:04,823 INFO L273 TraceCheckUtils]: 55: Hoare triple {37713#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37714#(<= main_~i~1 25)} is VALID [2018-11-23 12:32:04,824 INFO L273 TraceCheckUtils]: 56: Hoare triple {37714#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37714#(<= main_~i~1 25)} is VALID [2018-11-23 12:32:04,824 INFO L273 TraceCheckUtils]: 57: Hoare triple {37714#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37715#(<= main_~i~1 26)} is VALID [2018-11-23 12:32:04,825 INFO L273 TraceCheckUtils]: 58: Hoare triple {37715#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37715#(<= main_~i~1 26)} is VALID [2018-11-23 12:32:04,826 INFO L273 TraceCheckUtils]: 59: Hoare triple {37715#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37716#(<= main_~i~1 27)} is VALID [2018-11-23 12:32:04,826 INFO L273 TraceCheckUtils]: 60: Hoare triple {37716#(<= main_~i~1 27)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37716#(<= main_~i~1 27)} is VALID [2018-11-23 12:32:04,827 INFO L273 TraceCheckUtils]: 61: Hoare triple {37716#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37717#(<= main_~i~1 28)} is VALID [2018-11-23 12:32:04,827 INFO L273 TraceCheckUtils]: 62: Hoare triple {37717#(<= main_~i~1 28)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37717#(<= main_~i~1 28)} is VALID [2018-11-23 12:32:04,828 INFO L273 TraceCheckUtils]: 63: Hoare triple {37717#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37718#(<= main_~i~1 29)} is VALID [2018-11-23 12:32:04,829 INFO L273 TraceCheckUtils]: 64: Hoare triple {37718#(<= main_~i~1 29)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37718#(<= main_~i~1 29)} is VALID [2018-11-23 12:32:04,829 INFO L273 TraceCheckUtils]: 65: Hoare triple {37718#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37719#(<= main_~i~1 30)} is VALID [2018-11-23 12:32:04,830 INFO L273 TraceCheckUtils]: 66: Hoare triple {37719#(<= main_~i~1 30)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37719#(<= main_~i~1 30)} is VALID [2018-11-23 12:32:04,830 INFO L273 TraceCheckUtils]: 67: Hoare triple {37719#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37720#(<= main_~i~1 31)} is VALID [2018-11-23 12:32:04,831 INFO L273 TraceCheckUtils]: 68: Hoare triple {37720#(<= main_~i~1 31)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37720#(<= main_~i~1 31)} is VALID [2018-11-23 12:32:04,832 INFO L273 TraceCheckUtils]: 69: Hoare triple {37720#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37721#(<= main_~i~1 32)} is VALID [2018-11-23 12:32:04,832 INFO L273 TraceCheckUtils]: 70: Hoare triple {37721#(<= main_~i~1 32)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37721#(<= main_~i~1 32)} is VALID [2018-11-23 12:32:04,833 INFO L273 TraceCheckUtils]: 71: Hoare triple {37721#(<= main_~i~1 32)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37722#(<= main_~i~1 33)} is VALID [2018-11-23 12:32:04,833 INFO L273 TraceCheckUtils]: 72: Hoare triple {37722#(<= main_~i~1 33)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37722#(<= main_~i~1 33)} is VALID [2018-11-23 12:32:04,834 INFO L273 TraceCheckUtils]: 73: Hoare triple {37722#(<= main_~i~1 33)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37723#(<= main_~i~1 34)} is VALID [2018-11-23 12:32:04,835 INFO L273 TraceCheckUtils]: 74: Hoare triple {37723#(<= main_~i~1 34)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37723#(<= main_~i~1 34)} is VALID [2018-11-23 12:32:04,835 INFO L273 TraceCheckUtils]: 75: Hoare triple {37723#(<= main_~i~1 34)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37724#(<= main_~i~1 35)} is VALID [2018-11-23 12:32:04,836 INFO L273 TraceCheckUtils]: 76: Hoare triple {37724#(<= main_~i~1 35)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37724#(<= main_~i~1 35)} is VALID [2018-11-23 12:32:04,837 INFO L273 TraceCheckUtils]: 77: Hoare triple {37724#(<= main_~i~1 35)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37725#(<= main_~i~1 36)} is VALID [2018-11-23 12:32:04,837 INFO L273 TraceCheckUtils]: 78: Hoare triple {37725#(<= main_~i~1 36)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37725#(<= main_~i~1 36)} is VALID [2018-11-23 12:32:04,838 INFO L273 TraceCheckUtils]: 79: Hoare triple {37725#(<= main_~i~1 36)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37726#(<= main_~i~1 37)} is VALID [2018-11-23 12:32:04,838 INFO L273 TraceCheckUtils]: 80: Hoare triple {37726#(<= main_~i~1 37)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37726#(<= main_~i~1 37)} is VALID [2018-11-23 12:32:04,839 INFO L273 TraceCheckUtils]: 81: Hoare triple {37726#(<= main_~i~1 37)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37727#(<= main_~i~1 38)} is VALID [2018-11-23 12:32:04,840 INFO L273 TraceCheckUtils]: 82: Hoare triple {37727#(<= main_~i~1 38)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37727#(<= main_~i~1 38)} is VALID [2018-11-23 12:32:04,840 INFO L273 TraceCheckUtils]: 83: Hoare triple {37727#(<= main_~i~1 38)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37728#(<= main_~i~1 39)} is VALID [2018-11-23 12:32:04,841 INFO L273 TraceCheckUtils]: 84: Hoare triple {37728#(<= main_~i~1 39)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37728#(<= main_~i~1 39)} is VALID [2018-11-23 12:32:04,841 INFO L273 TraceCheckUtils]: 85: Hoare triple {37728#(<= main_~i~1 39)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37729#(<= main_~i~1 40)} is VALID [2018-11-23 12:32:04,842 INFO L273 TraceCheckUtils]: 86: Hoare triple {37729#(<= main_~i~1 40)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37729#(<= main_~i~1 40)} is VALID [2018-11-23 12:32:04,843 INFO L273 TraceCheckUtils]: 87: Hoare triple {37729#(<= main_~i~1 40)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37730#(<= main_~i~1 41)} is VALID [2018-11-23 12:32:04,843 INFO L273 TraceCheckUtils]: 88: Hoare triple {37730#(<= main_~i~1 41)} assume !(~i~1 < 100000); {37688#false} is VALID [2018-11-23 12:32:04,844 INFO L256 TraceCheckUtils]: 89: Hoare triple {37688#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {37687#true} is VALID [2018-11-23 12:32:04,844 INFO L273 TraceCheckUtils]: 90: Hoare triple {37687#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {37687#true} is VALID [2018-11-23 12:32:04,844 INFO L273 TraceCheckUtils]: 91: Hoare triple {37687#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {37687#true} is VALID [2018-11-23 12:32:04,844 INFO L273 TraceCheckUtils]: 92: Hoare triple {37687#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37687#true} is VALID [2018-11-23 12:32:04,844 INFO L273 TraceCheckUtils]: 93: Hoare triple {37687#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {37687#true} is VALID [2018-11-23 12:32:04,844 INFO L273 TraceCheckUtils]: 94: Hoare triple {37687#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37687#true} is VALID [2018-11-23 12:32:04,845 INFO L273 TraceCheckUtils]: 95: Hoare triple {37687#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {37687#true} is VALID [2018-11-23 12:32:04,845 INFO L273 TraceCheckUtils]: 96: Hoare triple {37687#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37687#true} is VALID [2018-11-23 12:32:04,845 INFO L273 TraceCheckUtils]: 97: Hoare triple {37687#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {37687#true} is VALID [2018-11-23 12:32:04,845 INFO L273 TraceCheckUtils]: 98: Hoare triple {37687#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37687#true} is VALID [2018-11-23 12:32:04,845 INFO L273 TraceCheckUtils]: 99: Hoare triple {37687#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {37687#true} is VALID [2018-11-23 12:32:04,845 INFO L273 TraceCheckUtils]: 100: Hoare triple {37687#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37687#true} is VALID [2018-11-23 12:32:04,846 INFO L273 TraceCheckUtils]: 101: Hoare triple {37687#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {37687#true} is VALID [2018-11-23 12:32:04,846 INFO L273 TraceCheckUtils]: 102: Hoare triple {37687#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37687#true} is VALID [2018-11-23 12:32:04,846 INFO L273 TraceCheckUtils]: 103: Hoare triple {37687#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {37687#true} is VALID [2018-11-23 12:32:04,846 INFO L273 TraceCheckUtils]: 104: Hoare triple {37687#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37687#true} is VALID [2018-11-23 12:32:04,846 INFO L273 TraceCheckUtils]: 105: Hoare triple {37687#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {37687#true} is VALID [2018-11-23 12:32:04,847 INFO L273 TraceCheckUtils]: 106: Hoare triple {37687#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37687#true} is VALID [2018-11-23 12:32:04,847 INFO L273 TraceCheckUtils]: 107: Hoare triple {37687#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {37687#true} is VALID [2018-11-23 12:32:04,847 INFO L273 TraceCheckUtils]: 108: Hoare triple {37687#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37687#true} is VALID [2018-11-23 12:32:04,847 INFO L273 TraceCheckUtils]: 109: Hoare triple {37687#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {37687#true} is VALID [2018-11-23 12:32:04,847 INFO L273 TraceCheckUtils]: 110: Hoare triple {37687#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37687#true} is VALID [2018-11-23 12:32:04,847 INFO L273 TraceCheckUtils]: 111: Hoare triple {37687#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {37687#true} is VALID [2018-11-23 12:32:04,847 INFO L273 TraceCheckUtils]: 112: Hoare triple {37687#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37687#true} is VALID [2018-11-23 12:32:04,847 INFO L273 TraceCheckUtils]: 113: Hoare triple {37687#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {37687#true} is VALID [2018-11-23 12:32:04,847 INFO L273 TraceCheckUtils]: 114: Hoare triple {37687#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37687#true} is VALID [2018-11-23 12:32:04,847 INFO L273 TraceCheckUtils]: 115: Hoare triple {37687#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {37687#true} is VALID [2018-11-23 12:32:04,848 INFO L273 TraceCheckUtils]: 116: Hoare triple {37687#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37687#true} is VALID [2018-11-23 12:32:04,848 INFO L273 TraceCheckUtils]: 117: Hoare triple {37687#true} assume !(~i~0 < 100000); {37687#true} is VALID [2018-11-23 12:32:04,848 INFO L273 TraceCheckUtils]: 118: Hoare triple {37687#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {37687#true} is VALID [2018-11-23 12:32:04,848 INFO L273 TraceCheckUtils]: 119: Hoare triple {37687#true} assume true; {37687#true} is VALID [2018-11-23 12:32:04,848 INFO L268 TraceCheckUtils]: 120: Hoare quadruple {37687#true} {37688#false} #70#return; {37688#false} is VALID [2018-11-23 12:32:04,848 INFO L273 TraceCheckUtils]: 121: Hoare triple {37688#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {37688#false} is VALID [2018-11-23 12:32:04,848 INFO L256 TraceCheckUtils]: 122: Hoare triple {37688#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {37687#true} is VALID [2018-11-23 12:32:04,848 INFO L273 TraceCheckUtils]: 123: Hoare triple {37687#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {37687#true} is VALID [2018-11-23 12:32:04,848 INFO L273 TraceCheckUtils]: 124: Hoare triple {37687#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {37687#true} is VALID [2018-11-23 12:32:04,848 INFO L273 TraceCheckUtils]: 125: Hoare triple {37687#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37687#true} is VALID [2018-11-23 12:32:04,849 INFO L273 TraceCheckUtils]: 126: Hoare triple {37687#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {37687#true} is VALID [2018-11-23 12:32:04,849 INFO L273 TraceCheckUtils]: 127: Hoare triple {37687#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37687#true} is VALID [2018-11-23 12:32:04,849 INFO L273 TraceCheckUtils]: 128: Hoare triple {37687#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {37687#true} is VALID [2018-11-23 12:32:04,849 INFO L273 TraceCheckUtils]: 129: Hoare triple {37687#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37687#true} is VALID [2018-11-23 12:32:04,849 INFO L273 TraceCheckUtils]: 130: Hoare triple {37687#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {37687#true} is VALID [2018-11-23 12:32:04,849 INFO L273 TraceCheckUtils]: 131: Hoare triple {37687#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37687#true} is VALID [2018-11-23 12:32:04,849 INFO L273 TraceCheckUtils]: 132: Hoare triple {37687#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {37687#true} is VALID [2018-11-23 12:32:04,849 INFO L273 TraceCheckUtils]: 133: Hoare triple {37687#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37687#true} is VALID [2018-11-23 12:32:04,849 INFO L273 TraceCheckUtils]: 134: Hoare triple {37687#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {37687#true} is VALID [2018-11-23 12:32:04,850 INFO L273 TraceCheckUtils]: 135: Hoare triple {37687#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37687#true} is VALID [2018-11-23 12:32:04,850 INFO L273 TraceCheckUtils]: 136: Hoare triple {37687#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {37687#true} is VALID [2018-11-23 12:32:04,850 INFO L273 TraceCheckUtils]: 137: Hoare triple {37687#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37687#true} is VALID [2018-11-23 12:32:04,850 INFO L273 TraceCheckUtils]: 138: Hoare triple {37687#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {37687#true} is VALID [2018-11-23 12:32:04,850 INFO L273 TraceCheckUtils]: 139: Hoare triple {37687#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37687#true} is VALID [2018-11-23 12:32:04,850 INFO L273 TraceCheckUtils]: 140: Hoare triple {37687#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {37687#true} is VALID [2018-11-23 12:32:04,850 INFO L273 TraceCheckUtils]: 141: Hoare triple {37687#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37687#true} is VALID [2018-11-23 12:32:04,850 INFO L273 TraceCheckUtils]: 142: Hoare triple {37687#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {37687#true} is VALID [2018-11-23 12:32:04,850 INFO L273 TraceCheckUtils]: 143: Hoare triple {37687#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37687#true} is VALID [2018-11-23 12:32:04,850 INFO L273 TraceCheckUtils]: 144: Hoare triple {37687#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {37687#true} is VALID [2018-11-23 12:32:04,851 INFO L273 TraceCheckUtils]: 145: Hoare triple {37687#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37687#true} is VALID [2018-11-23 12:32:04,851 INFO L273 TraceCheckUtils]: 146: Hoare triple {37687#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {37687#true} is VALID [2018-11-23 12:32:04,851 INFO L273 TraceCheckUtils]: 147: Hoare triple {37687#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37687#true} is VALID [2018-11-23 12:32:04,851 INFO L273 TraceCheckUtils]: 148: Hoare triple {37687#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {37687#true} is VALID [2018-11-23 12:32:04,851 INFO L273 TraceCheckUtils]: 149: Hoare triple {37687#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37687#true} is VALID [2018-11-23 12:32:04,851 INFO L273 TraceCheckUtils]: 150: Hoare triple {37687#true} assume !(~i~0 < 100000); {37687#true} is VALID [2018-11-23 12:32:04,851 INFO L273 TraceCheckUtils]: 151: Hoare triple {37687#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {37687#true} is VALID [2018-11-23 12:32:04,851 INFO L273 TraceCheckUtils]: 152: Hoare triple {37687#true} assume true; {37687#true} is VALID [2018-11-23 12:32:04,851 INFO L268 TraceCheckUtils]: 153: Hoare quadruple {37687#true} {37688#false} #72#return; {37688#false} is VALID [2018-11-23 12:32:04,851 INFO L273 TraceCheckUtils]: 154: Hoare triple {37688#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {37688#false} is VALID [2018-11-23 12:32:04,852 INFO L273 TraceCheckUtils]: 155: Hoare triple {37688#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {37688#false} is VALID [2018-11-23 12:32:04,852 INFO L273 TraceCheckUtils]: 156: Hoare triple {37688#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {37688#false} is VALID [2018-11-23 12:32:04,852 INFO L273 TraceCheckUtils]: 157: Hoare triple {37688#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {37688#false} is VALID [2018-11-23 12:32:04,852 INFO L273 TraceCheckUtils]: 158: Hoare triple {37688#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {37688#false} is VALID [2018-11-23 12:32:04,852 INFO L273 TraceCheckUtils]: 159: Hoare triple {37688#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {37688#false} is VALID [2018-11-23 12:32:04,852 INFO L273 TraceCheckUtils]: 160: Hoare triple {37688#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {37688#false} is VALID [2018-11-23 12:32:04,852 INFO L273 TraceCheckUtils]: 161: Hoare triple {37688#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {37688#false} is VALID [2018-11-23 12:32:04,852 INFO L273 TraceCheckUtils]: 162: Hoare triple {37688#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {37688#false} is VALID [2018-11-23 12:32:04,852 INFO L273 TraceCheckUtils]: 163: Hoare triple {37688#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {37688#false} is VALID [2018-11-23 12:32:04,852 INFO L273 TraceCheckUtils]: 164: Hoare triple {37688#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {37688#false} is VALID [2018-11-23 12:32:04,853 INFO L273 TraceCheckUtils]: 165: Hoare triple {37688#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {37688#false} is VALID [2018-11-23 12:32:04,853 INFO L273 TraceCheckUtils]: 166: Hoare triple {37688#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {37688#false} is VALID [2018-11-23 12:32:04,853 INFO L273 TraceCheckUtils]: 167: Hoare triple {37688#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {37688#false} is VALID [2018-11-23 12:32:04,853 INFO L273 TraceCheckUtils]: 168: Hoare triple {37688#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {37688#false} is VALID [2018-11-23 12:32:04,853 INFO L273 TraceCheckUtils]: 169: Hoare triple {37688#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {37688#false} is VALID [2018-11-23 12:32:04,853 INFO L273 TraceCheckUtils]: 170: Hoare triple {37688#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {37688#false} is VALID [2018-11-23 12:32:04,853 INFO L273 TraceCheckUtils]: 171: Hoare triple {37688#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {37688#false} is VALID [2018-11-23 12:32:04,853 INFO L273 TraceCheckUtils]: 172: Hoare triple {37688#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {37688#false} is VALID [2018-11-23 12:32:04,853 INFO L273 TraceCheckUtils]: 173: Hoare triple {37688#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {37688#false} is VALID [2018-11-23 12:32:04,853 INFO L273 TraceCheckUtils]: 174: Hoare triple {37688#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {37688#false} is VALID [2018-11-23 12:32:04,854 INFO L273 TraceCheckUtils]: 175: Hoare triple {37688#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {37688#false} is VALID [2018-11-23 12:32:04,854 INFO L273 TraceCheckUtils]: 176: Hoare triple {37688#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {37688#false} is VALID [2018-11-23 12:32:04,854 INFO L273 TraceCheckUtils]: 177: Hoare triple {37688#false} assume !(~i~2 < 99999); {37688#false} is VALID [2018-11-23 12:32:04,854 INFO L273 TraceCheckUtils]: 178: Hoare triple {37688#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {37688#false} is VALID [2018-11-23 12:32:04,854 INFO L256 TraceCheckUtils]: 179: Hoare triple {37688#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {37687#true} is VALID [2018-11-23 12:32:04,854 INFO L273 TraceCheckUtils]: 180: Hoare triple {37687#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {37687#true} is VALID [2018-11-23 12:32:04,854 INFO L273 TraceCheckUtils]: 181: Hoare triple {37687#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {37687#true} is VALID [2018-11-23 12:32:04,854 INFO L273 TraceCheckUtils]: 182: Hoare triple {37687#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37687#true} is VALID [2018-11-23 12:32:04,854 INFO L273 TraceCheckUtils]: 183: Hoare triple {37687#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {37687#true} is VALID [2018-11-23 12:32:04,854 INFO L273 TraceCheckUtils]: 184: Hoare triple {37687#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37687#true} is VALID [2018-11-23 12:32:04,855 INFO L273 TraceCheckUtils]: 185: Hoare triple {37687#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {37687#true} is VALID [2018-11-23 12:32:04,855 INFO L273 TraceCheckUtils]: 186: Hoare triple {37687#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37687#true} is VALID [2018-11-23 12:32:04,855 INFO L273 TraceCheckUtils]: 187: Hoare triple {37687#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {37687#true} is VALID [2018-11-23 12:32:04,855 INFO L273 TraceCheckUtils]: 188: Hoare triple {37687#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37687#true} is VALID [2018-11-23 12:32:04,855 INFO L273 TraceCheckUtils]: 189: Hoare triple {37687#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {37687#true} is VALID [2018-11-23 12:32:04,855 INFO L273 TraceCheckUtils]: 190: Hoare triple {37687#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37687#true} is VALID [2018-11-23 12:32:04,855 INFO L273 TraceCheckUtils]: 191: Hoare triple {37687#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {37687#true} is VALID [2018-11-23 12:32:04,855 INFO L273 TraceCheckUtils]: 192: Hoare triple {37687#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37687#true} is VALID [2018-11-23 12:32:04,855 INFO L273 TraceCheckUtils]: 193: Hoare triple {37687#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {37687#true} is VALID [2018-11-23 12:32:04,855 INFO L273 TraceCheckUtils]: 194: Hoare triple {37687#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37687#true} is VALID [2018-11-23 12:32:04,856 INFO L273 TraceCheckUtils]: 195: Hoare triple {37687#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {37687#true} is VALID [2018-11-23 12:32:04,856 INFO L273 TraceCheckUtils]: 196: Hoare triple {37687#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37687#true} is VALID [2018-11-23 12:32:04,856 INFO L273 TraceCheckUtils]: 197: Hoare triple {37687#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {37687#true} is VALID [2018-11-23 12:32:04,856 INFO L273 TraceCheckUtils]: 198: Hoare triple {37687#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37687#true} is VALID [2018-11-23 12:32:04,856 INFO L273 TraceCheckUtils]: 199: Hoare triple {37687#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {37687#true} is VALID [2018-11-23 12:32:04,856 INFO L273 TraceCheckUtils]: 200: Hoare triple {37687#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37687#true} is VALID [2018-11-23 12:32:04,856 INFO L273 TraceCheckUtils]: 201: Hoare triple {37687#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {37687#true} is VALID [2018-11-23 12:32:04,856 INFO L273 TraceCheckUtils]: 202: Hoare triple {37687#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37687#true} is VALID [2018-11-23 12:32:04,856 INFO L273 TraceCheckUtils]: 203: Hoare triple {37687#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {37687#true} is VALID [2018-11-23 12:32:04,856 INFO L273 TraceCheckUtils]: 204: Hoare triple {37687#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37687#true} is VALID [2018-11-23 12:32:04,857 INFO L273 TraceCheckUtils]: 205: Hoare triple {37687#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {37687#true} is VALID [2018-11-23 12:32:04,857 INFO L273 TraceCheckUtils]: 206: Hoare triple {37687#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37687#true} is VALID [2018-11-23 12:32:04,857 INFO L273 TraceCheckUtils]: 207: Hoare triple {37687#true} assume !(~i~0 < 100000); {37687#true} is VALID [2018-11-23 12:32:04,857 INFO L273 TraceCheckUtils]: 208: Hoare triple {37687#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {37687#true} is VALID [2018-11-23 12:32:04,857 INFO L273 TraceCheckUtils]: 209: Hoare triple {37687#true} assume true; {37687#true} is VALID [2018-11-23 12:32:04,857 INFO L268 TraceCheckUtils]: 210: Hoare quadruple {37687#true} {37688#false} #74#return; {37688#false} is VALID [2018-11-23 12:32:04,857 INFO L273 TraceCheckUtils]: 211: Hoare triple {37688#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {37688#false} is VALID [2018-11-23 12:32:04,857 INFO L273 TraceCheckUtils]: 212: Hoare triple {37688#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {37688#false} is VALID [2018-11-23 12:32:04,857 INFO L273 TraceCheckUtils]: 213: Hoare triple {37688#false} assume !false; {37688#false} is VALID [2018-11-23 12:32:04,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3416 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 1735 trivial. 0 not checked. [2018-11-23 12:32:04,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:32:04,877 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:32:04,885 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1