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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf -i ../../../trunk/examples/svcomp/array-crafted/xor4_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:56:20,186 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:56:20,189 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:56:20,204 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:56:20,205 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:56:20,206 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:56:20,208 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:56:20,210 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:56:20,213 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:56:20,214 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:56:20,216 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:56:20,216 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:56:20,217 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:56:20,218 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:56:20,219 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:56:20,220 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:56:20,221 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:56:20,223 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:56:20,225 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:56:20,227 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:56:20,228 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:56:20,229 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:56:20,232 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:56:20,232 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:56:20,232 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:56:20,236 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:56:20,238 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:56:20,242 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:56:20,243 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:56:20,245 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:56:20,246 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:56:20,246 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:56:20,246 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:56:20,247 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:56:20,248 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:56:20,249 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:56:20,249 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 18:56:20,278 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:56:20,278 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:56:20,280 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:56:20,280 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:56:20,281 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:56:20,281 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:56:20,281 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:56:20,281 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:56:20,281 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:56:20,282 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 18:56:20,282 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:56:20,282 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:56:20,282 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:56:20,283 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:56:20,283 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:56:20,283 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:56:20,283 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:56:20,283 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:56:20,284 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:56:20,284 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:56:20,284 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:56:20,284 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:56:20,284 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:56:20,284 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:56:20,287 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:56:20,287 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:56:20,287 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:56:20,287 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 18:56:20,287 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:56:20,288 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 18:56:20,288 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:56:20,342 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:56:20,360 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:56:20,364 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:56:20,365 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:56:20,366 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:56:20,367 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-14 18:56:20,433 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bb4b903b/cf25905853ff4f4fa8d95949d9d29879/FLAGdc165ec6d [2018-11-14 18:56:20,910 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:56:20,910 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/xor4_true-unreach-call.i [2018-11-14 18:56:20,916 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bb4b903b/cf25905853ff4f4fa8d95949d9d29879/FLAGdc165ec6d [2018-11-14 18:56:20,931 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bb4b903b/cf25905853ff4f4fa8d95949d9d29879 [2018-11-14 18:56:20,942 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:56:20,943 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:56:20,944 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:56:20,944 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:56:20,948 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:56:20,949 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:56:20" (1/1) ... [2018-11-14 18:56:20,952 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@421f2e66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:56:20, skipping insertion in model container [2018-11-14 18:56:20,952 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:56:20" (1/1) ... [2018-11-14 18:56:20,963 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:56:20,986 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:56:21,254 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:56:21,274 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:56:21,306 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:56:21,326 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:56:21,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:56:21 WrapperNode [2018-11-14 18:56:21,327 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:56:21,328 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:56:21,328 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:56:21,328 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:56:21,345 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:56:21" (1/1) ... [2018-11-14 18:56:21,345 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:56:21" (1/1) ... [2018-11-14 18:56:21,356 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:56:21" (1/1) ... [2018-11-14 18:56:21,357 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:56:21" (1/1) ... [2018-11-14 18:56:21,371 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:56:21" (1/1) ... [2018-11-14 18:56:21,378 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:56:21" (1/1) ... [2018-11-14 18:56:21,380 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:56:21" (1/1) ... [2018-11-14 18:56:21,382 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:56:21,383 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:56:21,383 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:56:21,383 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:56:21,384 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:56:21" (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-14 18:56:21,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:56:21,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:56:21,511 INFO L138 BoogieDeclarations]: Found implementation of procedure xor [2018-11-14 18:56:21,511 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:56:21,511 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:56:21,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 18:56:21,512 INFO L130 BoogieDeclarations]: Found specification of procedure xor [2018-11-14 18:56:21,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 18:56:21,512 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:56:21,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 18:56:21,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 18:56:21,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 18:56:21,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:56:21,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:56:21,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 18:56:22,268 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:56:22,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:56:22 BoogieIcfgContainer [2018-11-14 18:56:22,269 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:56:22,270 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:56:22,270 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:56:22,274 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:56:22,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:56:20" (1/3) ... [2018-11-14 18:56:22,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d965394 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:56:22, skipping insertion in model container [2018-11-14 18:56:22,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:56:21" (2/3) ... [2018-11-14 18:56:22,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d965394 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:56:22, skipping insertion in model container [2018-11-14 18:56:22,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:56:22" (3/3) ... [2018-11-14 18:56:22,277 INFO L112 eAbstractionObserver]: Analyzing ICFG xor4_true-unreach-call.i [2018-11-14 18:56:22,285 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:56:22,292 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:56:22,309 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:56:22,342 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:56:22,343 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:56:22,343 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:56:22,343 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:56:22,343 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:56:22,344 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:56:22,344 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:56:22,344 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:56:22,345 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:56:22,364 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-11-14 18:56:22,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 18:56:22,372 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:56:22,373 INFO L375 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-14 18:56:22,376 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:56:22,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:56:22,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1575634353, now seen corresponding path program 1 times [2018-11-14 18:56:22,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:56:22,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:56:22,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:56:22,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:56:22,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:56:22,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:56:22,596 INFO L256 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {37#true} is VALID [2018-11-14 18:56:22,600 INFO L273 TraceCheckUtils]: 1: Hoare triple {37#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {37#true} is VALID [2018-11-14 18:56:22,600 INFO L273 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-14 18:56:22,601 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #69#return; {37#true} is VALID [2018-11-14 18:56:22,601 INFO L256 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret13 := main(); {37#true} is VALID [2018-11-14 18:56:22,601 INFO L273 TraceCheckUtils]: 5: Hoare triple {37#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; {37#true} is VALID [2018-11-14 18:56:22,602 INFO L273 TraceCheckUtils]: 6: Hoare triple {37#true} assume !true; {38#false} is VALID [2018-11-14 18:56:22,603 INFO L256 TraceCheckUtils]: 7: Hoare triple {38#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {37#true} is VALID [2018-11-14 18:56:22,603 INFO L273 TraceCheckUtils]: 8: Hoare triple {37#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {37#true} is VALID [2018-11-14 18:56:22,603 INFO L273 TraceCheckUtils]: 9: Hoare triple {37#true} assume !true; {37#true} is VALID [2018-11-14 18:56:22,604 INFO L273 TraceCheckUtils]: 10: Hoare triple {37#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {37#true} is VALID [2018-11-14 18:56:22,604 INFO L273 TraceCheckUtils]: 11: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-14 18:56:22,604 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {37#true} {38#false} #73#return; {38#false} is VALID [2018-11-14 18:56:22,605 INFO L273 TraceCheckUtils]: 13: Hoare triple {38#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {38#false} is VALID [2018-11-14 18:56:22,605 INFO L256 TraceCheckUtils]: 14: Hoare triple {38#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {37#true} is VALID [2018-11-14 18:56:22,605 INFO L273 TraceCheckUtils]: 15: Hoare triple {37#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {37#true} is VALID [2018-11-14 18:56:22,606 INFO L273 TraceCheckUtils]: 16: Hoare triple {37#true} assume !true; {37#true} is VALID [2018-11-14 18:56:22,606 INFO L273 TraceCheckUtils]: 17: Hoare triple {37#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {37#true} is VALID [2018-11-14 18:56:22,606 INFO L273 TraceCheckUtils]: 18: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-14 18:56:22,607 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {37#true} {38#false} #75#return; {38#false} is VALID [2018-11-14 18:56:22,607 INFO L273 TraceCheckUtils]: 20: Hoare triple {38#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {38#false} is VALID [2018-11-14 18:56:22,607 INFO L273 TraceCheckUtils]: 21: Hoare triple {38#false} assume !true; {38#false} is VALID [2018-11-14 18:56:22,608 INFO L273 TraceCheckUtils]: 22: Hoare triple {38#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {38#false} is VALID [2018-11-14 18:56:22,608 INFO L256 TraceCheckUtils]: 23: Hoare triple {38#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {37#true} is VALID [2018-11-14 18:56:22,608 INFO L273 TraceCheckUtils]: 24: Hoare triple {37#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {37#true} is VALID [2018-11-14 18:56:22,609 INFO L273 TraceCheckUtils]: 25: Hoare triple {37#true} assume !true; {37#true} is VALID [2018-11-14 18:56:22,609 INFO L273 TraceCheckUtils]: 26: Hoare triple {37#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {37#true} is VALID [2018-11-14 18:56:22,609 INFO L273 TraceCheckUtils]: 27: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-14 18:56:22,610 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {37#true} {38#false} #77#return; {38#false} is VALID [2018-11-14 18:56:22,610 INFO L273 TraceCheckUtils]: 29: Hoare triple {38#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {38#false} is VALID [2018-11-14 18:56:22,610 INFO L273 TraceCheckUtils]: 30: Hoare triple {38#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {38#false} is VALID [2018-11-14 18:56:22,611 INFO L273 TraceCheckUtils]: 31: Hoare triple {38#false} assume !false; {38#false} is VALID [2018-11-14 18:56:22,617 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-14 18:56:22,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:56:22,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:56:22,626 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-14 18:56:22,636 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:56:22,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:56:22,890 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-14 18:56:22,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:56:22,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:56:22,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:56:22,902 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-11-14 18:56:23,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:23,055 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2018-11-14 18:56:23,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:56:23,056 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-14 18:56:23,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:56:23,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:56:23,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2018-11-14 18:56:23,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:56:23,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2018-11-14 18:56:23,076 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 76 transitions. [2018-11-14 18:56:23,347 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-14 18:56:23,358 INFO L225 Difference]: With dead ends: 59 [2018-11-14 18:56:23,359 INFO L226 Difference]: Without dead ends: 29 [2018-11-14 18:56:23,363 INFO L604 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-14 18:56:23,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-14 18:56:23,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-14 18:56:23,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:56:23,409 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-14 18:56:23,410 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-14 18:56:23,410 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-14 18:56:23,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:23,416 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-14 18:56:23,416 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-14 18:56:23,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:56:23,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:56:23,418 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-14 18:56:23,418 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-14 18:56:23,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:23,423 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-14 18:56:23,423 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-14 18:56:23,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:56:23,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:56:23,425 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:56:23,425 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:56:23,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 18:56:23,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-11-14 18:56:23,431 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 32 [2018-11-14 18:56:23,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:56:23,432 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-14 18:56:23,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:56:23,432 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-14 18:56:23,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-14 18:56:23,437 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:56:23,437 INFO L375 BasicCegarLoop]: trace histogram [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-14 18:56:23,437 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:56:23,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:56:23,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1963798480, now seen corresponding path program 1 times [2018-11-14 18:56:23,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:56:23,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:56:23,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:56:23,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:56:23,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:56:23,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:56:23,552 INFO L256 TraceCheckUtils]: 0: Hoare triple {215#true} call ULTIMATE.init(); {215#true} is VALID [2018-11-14 18:56:23,553 INFO L273 TraceCheckUtils]: 1: Hoare triple {215#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {215#true} is VALID [2018-11-14 18:56:23,553 INFO L273 TraceCheckUtils]: 2: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 18:56:23,553 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {215#true} {215#true} #69#return; {215#true} is VALID [2018-11-14 18:56:23,553 INFO L256 TraceCheckUtils]: 4: Hoare triple {215#true} call #t~ret13 := main(); {215#true} is VALID [2018-11-14 18:56:23,554 INFO L273 TraceCheckUtils]: 5: Hoare triple {215#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; {217#(= main_~i~1 0)} is VALID [2018-11-14 18:56:23,555 INFO L273 TraceCheckUtils]: 6: Hoare triple {217#(= main_~i~1 0)} assume true; {217#(= main_~i~1 0)} is VALID [2018-11-14 18:56:23,555 INFO L273 TraceCheckUtils]: 7: Hoare triple {217#(= main_~i~1 0)} assume !(~i~1 < 100000); {216#false} is VALID [2018-11-14 18:56:23,556 INFO L256 TraceCheckUtils]: 8: Hoare triple {216#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {215#true} is VALID [2018-11-14 18:56:23,556 INFO L273 TraceCheckUtils]: 9: Hoare triple {215#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {215#true} is VALID [2018-11-14 18:56:23,556 INFO L273 TraceCheckUtils]: 10: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 18:56:23,556 INFO L273 TraceCheckUtils]: 11: Hoare triple {215#true} assume !(~i~0 < 100000); {215#true} is VALID [2018-11-14 18:56:23,557 INFO L273 TraceCheckUtils]: 12: Hoare triple {215#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {215#true} is VALID [2018-11-14 18:56:23,557 INFO L273 TraceCheckUtils]: 13: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 18:56:23,557 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {215#true} {216#false} #73#return; {216#false} is VALID [2018-11-14 18:56:23,557 INFO L273 TraceCheckUtils]: 15: Hoare triple {216#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {216#false} is VALID [2018-11-14 18:56:23,558 INFO L256 TraceCheckUtils]: 16: Hoare triple {216#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {215#true} is VALID [2018-11-14 18:56:23,558 INFO L273 TraceCheckUtils]: 17: Hoare triple {215#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {215#true} is VALID [2018-11-14 18:56:23,558 INFO L273 TraceCheckUtils]: 18: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 18:56:23,558 INFO L273 TraceCheckUtils]: 19: Hoare triple {215#true} assume !(~i~0 < 100000); {215#true} is VALID [2018-11-14 18:56:23,559 INFO L273 TraceCheckUtils]: 20: Hoare triple {215#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {215#true} is VALID [2018-11-14 18:56:23,559 INFO L273 TraceCheckUtils]: 21: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 18:56:23,559 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {215#true} {216#false} #75#return; {216#false} is VALID [2018-11-14 18:56:23,560 INFO L273 TraceCheckUtils]: 23: Hoare triple {216#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {216#false} is VALID [2018-11-14 18:56:23,560 INFO L273 TraceCheckUtils]: 24: Hoare triple {216#false} assume true; {216#false} is VALID [2018-11-14 18:56:23,560 INFO L273 TraceCheckUtils]: 25: Hoare triple {216#false} assume !(~i~2 < 99999); {216#false} is VALID [2018-11-14 18:56:23,561 INFO L273 TraceCheckUtils]: 26: Hoare triple {216#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {216#false} is VALID [2018-11-14 18:56:23,561 INFO L256 TraceCheckUtils]: 27: Hoare triple {216#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {215#true} is VALID [2018-11-14 18:56:23,561 INFO L273 TraceCheckUtils]: 28: Hoare triple {215#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {215#true} is VALID [2018-11-14 18:56:23,562 INFO L273 TraceCheckUtils]: 29: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 18:56:23,562 INFO L273 TraceCheckUtils]: 30: Hoare triple {215#true} assume !(~i~0 < 100000); {215#true} is VALID [2018-11-14 18:56:23,562 INFO L273 TraceCheckUtils]: 31: Hoare triple {215#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {215#true} is VALID [2018-11-14 18:56:23,563 INFO L273 TraceCheckUtils]: 32: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 18:56:23,563 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {215#true} {216#false} #77#return; {216#false} is VALID [2018-11-14 18:56:23,563 INFO L273 TraceCheckUtils]: 34: Hoare triple {216#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {216#false} is VALID [2018-11-14 18:56:23,564 INFO L273 TraceCheckUtils]: 35: Hoare triple {216#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {216#false} is VALID [2018-11-14 18:56:23,564 INFO L273 TraceCheckUtils]: 36: Hoare triple {216#false} assume !false; {216#false} is VALID [2018-11-14 18:56:23,567 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-14 18:56:23,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:56:23,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:56:23,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-14 18:56:23,570 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:56:23,570 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:56:23,671 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:56:23,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:56:23,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:56:23,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:56:23,672 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 3 states. [2018-11-14 18:56:24,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:24,210 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-11-14 18:56:24,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:56:24,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-14 18:56:24,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:56:24,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:56:24,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2018-11-14 18:56:24,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:56:24,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2018-11-14 18:56:24,225 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 60 transitions. [2018-11-14 18:56:24,383 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-14 18:56:24,387 INFO L225 Difference]: With dead ends: 52 [2018-11-14 18:56:24,387 INFO L226 Difference]: Without dead ends: 32 [2018-11-14 18:56:24,389 INFO L604 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-14 18:56:24,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-14 18:56:24,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-14 18:56:24,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:56:24,413 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 31 states. [2018-11-14 18:56:24,413 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 31 states. [2018-11-14 18:56:24,413 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 31 states. [2018-11-14 18:56:24,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:24,417 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-14 18:56:24,417 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-14 18:56:24,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:56:24,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:56:24,418 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 32 states. [2018-11-14 18:56:24,418 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 32 states. [2018-11-14 18:56:24,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:24,422 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-14 18:56:24,422 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-14 18:56:24,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:56:24,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:56:24,423 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:56:24,423 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:56:24,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 18:56:24,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-14 18:56:24,426 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 37 [2018-11-14 18:56:24,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:56:24,426 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-14 18:56:24,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:56:24,427 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-14 18:56:24,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-14 18:56:24,428 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:56:24,429 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 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-14 18:56:24,429 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:56:24,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:56:24,429 INFO L82 PathProgramCache]: Analyzing trace with hash -600213610, now seen corresponding path program 1 times [2018-11-14 18:56:24,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:56:24,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:56:24,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:56:24,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:56:24,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:56:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:56:24,521 INFO L256 TraceCheckUtils]: 0: Hoare triple {397#true} call ULTIMATE.init(); {397#true} is VALID [2018-11-14 18:56:24,522 INFO L273 TraceCheckUtils]: 1: Hoare triple {397#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {397#true} is VALID [2018-11-14 18:56:24,522 INFO L273 TraceCheckUtils]: 2: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 18:56:24,523 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {397#true} {397#true} #69#return; {397#true} is VALID [2018-11-14 18:56:24,523 INFO L256 TraceCheckUtils]: 4: Hoare triple {397#true} call #t~ret13 := main(); {397#true} is VALID [2018-11-14 18:56:24,523 INFO L273 TraceCheckUtils]: 5: Hoare triple {397#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; {397#true} is VALID [2018-11-14 18:56:24,524 INFO L273 TraceCheckUtils]: 6: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 18:56:24,524 INFO L273 TraceCheckUtils]: 7: Hoare triple {397#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {397#true} is VALID [2018-11-14 18:56:24,524 INFO L273 TraceCheckUtils]: 8: Hoare triple {397#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {397#true} is VALID [2018-11-14 18:56:24,525 INFO L273 TraceCheckUtils]: 9: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 18:56:24,525 INFO L273 TraceCheckUtils]: 10: Hoare triple {397#true} assume !(~i~1 < 100000); {397#true} is VALID [2018-11-14 18:56:24,525 INFO L256 TraceCheckUtils]: 11: Hoare triple {397#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {397#true} is VALID [2018-11-14 18:56:24,526 INFO L273 TraceCheckUtils]: 12: Hoare triple {397#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {399#(= xor_~i~0 1)} is VALID [2018-11-14 18:56:24,527 INFO L273 TraceCheckUtils]: 13: Hoare triple {399#(= xor_~i~0 1)} assume true; {399#(= xor_~i~0 1)} is VALID [2018-11-14 18:56:24,529 INFO L273 TraceCheckUtils]: 14: Hoare triple {399#(= xor_~i~0 1)} assume !(~i~0 < 100000); {398#false} is VALID [2018-11-14 18:56:24,529 INFO L273 TraceCheckUtils]: 15: Hoare triple {398#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {398#false} is VALID [2018-11-14 18:56:24,529 INFO L273 TraceCheckUtils]: 16: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 18:56:24,530 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {398#false} {397#true} #73#return; {398#false} is VALID [2018-11-14 18:56:24,530 INFO L273 TraceCheckUtils]: 18: Hoare triple {398#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {398#false} is VALID [2018-11-14 18:56:24,530 INFO L256 TraceCheckUtils]: 19: Hoare triple {398#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {397#true} is VALID [2018-11-14 18:56:24,531 INFO L273 TraceCheckUtils]: 20: Hoare triple {397#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {397#true} is VALID [2018-11-14 18:56:24,531 INFO L273 TraceCheckUtils]: 21: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 18:56:24,532 INFO L273 TraceCheckUtils]: 22: Hoare triple {397#true} assume !(~i~0 < 100000); {397#true} is VALID [2018-11-14 18:56:24,532 INFO L273 TraceCheckUtils]: 23: Hoare triple {397#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {397#true} is VALID [2018-11-14 18:56:24,532 INFO L273 TraceCheckUtils]: 24: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 18:56:24,533 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {397#true} {398#false} #75#return; {398#false} is VALID [2018-11-14 18:56:24,533 INFO L273 TraceCheckUtils]: 26: Hoare triple {398#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {398#false} is VALID [2018-11-14 18:56:24,533 INFO L273 TraceCheckUtils]: 27: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 18:56:24,533 INFO L273 TraceCheckUtils]: 28: Hoare triple {398#false} assume !(~i~2 < 99999); {398#false} is VALID [2018-11-14 18:56:24,534 INFO L273 TraceCheckUtils]: 29: Hoare triple {398#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {398#false} is VALID [2018-11-14 18:56:24,534 INFO L256 TraceCheckUtils]: 30: Hoare triple {398#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {397#true} is VALID [2018-11-14 18:56:24,534 INFO L273 TraceCheckUtils]: 31: Hoare triple {397#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {397#true} is VALID [2018-11-14 18:56:24,535 INFO L273 TraceCheckUtils]: 32: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 18:56:24,535 INFO L273 TraceCheckUtils]: 33: Hoare triple {397#true} assume !(~i~0 < 100000); {397#true} is VALID [2018-11-14 18:56:24,535 INFO L273 TraceCheckUtils]: 34: Hoare triple {397#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {397#true} is VALID [2018-11-14 18:56:24,536 INFO L273 TraceCheckUtils]: 35: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 18:56:24,536 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {397#true} {398#false} #77#return; {398#false} is VALID [2018-11-14 18:56:24,536 INFO L273 TraceCheckUtils]: 37: Hoare triple {398#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {398#false} is VALID [2018-11-14 18:56:24,537 INFO L273 TraceCheckUtils]: 38: Hoare triple {398#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {398#false} is VALID [2018-11-14 18:56:24,537 INFO L273 TraceCheckUtils]: 39: Hoare triple {398#false} assume !false; {398#false} is VALID [2018-11-14 18:56:24,540 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-14 18:56:24,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:56:24,540 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-14 18:56:24,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:56:24,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:56:24,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:56:24,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:56:24,797 INFO L256 TraceCheckUtils]: 0: Hoare triple {397#true} call ULTIMATE.init(); {397#true} is VALID [2018-11-14 18:56:24,797 INFO L273 TraceCheckUtils]: 1: Hoare triple {397#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {397#true} is VALID [2018-11-14 18:56:24,798 INFO L273 TraceCheckUtils]: 2: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 18:56:24,798 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {397#true} {397#true} #69#return; {397#true} is VALID [2018-11-14 18:56:24,798 INFO L256 TraceCheckUtils]: 4: Hoare triple {397#true} call #t~ret13 := main(); {397#true} is VALID [2018-11-14 18:56:24,798 INFO L273 TraceCheckUtils]: 5: Hoare triple {397#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; {397#true} is VALID [2018-11-14 18:56:24,799 INFO L273 TraceCheckUtils]: 6: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 18:56:24,799 INFO L273 TraceCheckUtils]: 7: Hoare triple {397#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {397#true} is VALID [2018-11-14 18:56:24,799 INFO L273 TraceCheckUtils]: 8: Hoare triple {397#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {397#true} is VALID [2018-11-14 18:56:24,800 INFO L273 TraceCheckUtils]: 9: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 18:56:24,800 INFO L273 TraceCheckUtils]: 10: Hoare triple {397#true} assume !(~i~1 < 100000); {397#true} is VALID [2018-11-14 18:56:24,800 INFO L256 TraceCheckUtils]: 11: Hoare triple {397#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {397#true} is VALID [2018-11-14 18:56:24,815 INFO L273 TraceCheckUtils]: 12: Hoare triple {397#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {439#(<= xor_~i~0 1)} is VALID [2018-11-14 18:56:24,817 INFO L273 TraceCheckUtils]: 13: Hoare triple {439#(<= xor_~i~0 1)} assume true; {439#(<= xor_~i~0 1)} is VALID [2018-11-14 18:56:24,817 INFO L273 TraceCheckUtils]: 14: Hoare triple {439#(<= xor_~i~0 1)} assume !(~i~0 < 100000); {398#false} is VALID [2018-11-14 18:56:24,818 INFO L273 TraceCheckUtils]: 15: Hoare triple {398#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {398#false} is VALID [2018-11-14 18:56:24,818 INFO L273 TraceCheckUtils]: 16: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 18:56:24,818 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {398#false} {397#true} #73#return; {398#false} is VALID [2018-11-14 18:56:24,819 INFO L273 TraceCheckUtils]: 18: Hoare triple {398#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {398#false} is VALID [2018-11-14 18:56:24,819 INFO L256 TraceCheckUtils]: 19: Hoare triple {398#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {398#false} is VALID [2018-11-14 18:56:24,819 INFO L273 TraceCheckUtils]: 20: Hoare triple {398#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {398#false} is VALID [2018-11-14 18:56:24,820 INFO L273 TraceCheckUtils]: 21: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 18:56:24,820 INFO L273 TraceCheckUtils]: 22: Hoare triple {398#false} assume !(~i~0 < 100000); {398#false} is VALID [2018-11-14 18:56:24,820 INFO L273 TraceCheckUtils]: 23: Hoare triple {398#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {398#false} is VALID [2018-11-14 18:56:24,820 INFO L273 TraceCheckUtils]: 24: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 18:56:24,821 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {398#false} {398#false} #75#return; {398#false} is VALID [2018-11-14 18:56:24,821 INFO L273 TraceCheckUtils]: 26: Hoare triple {398#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {398#false} is VALID [2018-11-14 18:56:24,821 INFO L273 TraceCheckUtils]: 27: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 18:56:24,822 INFO L273 TraceCheckUtils]: 28: Hoare triple {398#false} assume !(~i~2 < 99999); {398#false} is VALID [2018-11-14 18:56:24,822 INFO L273 TraceCheckUtils]: 29: Hoare triple {398#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {398#false} is VALID [2018-11-14 18:56:24,822 INFO L256 TraceCheckUtils]: 30: Hoare triple {398#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {398#false} is VALID [2018-11-14 18:56:24,822 INFO L273 TraceCheckUtils]: 31: Hoare triple {398#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {398#false} is VALID [2018-11-14 18:56:24,823 INFO L273 TraceCheckUtils]: 32: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 18:56:24,823 INFO L273 TraceCheckUtils]: 33: Hoare triple {398#false} assume !(~i~0 < 100000); {398#false} is VALID [2018-11-14 18:56:24,823 INFO L273 TraceCheckUtils]: 34: Hoare triple {398#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {398#false} is VALID [2018-11-14 18:56:24,824 INFO L273 TraceCheckUtils]: 35: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 18:56:24,824 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {398#false} {398#false} #77#return; {398#false} is VALID [2018-11-14 18:56:24,824 INFO L273 TraceCheckUtils]: 37: Hoare triple {398#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {398#false} is VALID [2018-11-14 18:56:24,824 INFO L273 TraceCheckUtils]: 38: Hoare triple {398#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {398#false} is VALID [2018-11-14 18:56:24,825 INFO L273 TraceCheckUtils]: 39: Hoare triple {398#false} assume !false; {398#false} is VALID [2018-11-14 18:56:24,828 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-14 18:56:24,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 18:56:24,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-11-14 18:56:24,854 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-11-14 18:56:24,857 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:56:24,857 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 18:56:25,032 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:56:25,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 18:56:25,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 18:56:25,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:56:25,033 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 4 states. [2018-11-14 18:56:25,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:25,291 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2018-11-14 18:56:25,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:56:25,292 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-11-14 18:56:25,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:56:25,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:56:25,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2018-11-14 18:56:25,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:56:25,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2018-11-14 18:56:25,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2018-11-14 18:56:25,414 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-14 18:56:25,416 INFO L225 Difference]: With dead ends: 53 [2018-11-14 18:56:25,416 INFO L226 Difference]: Without dead ends: 34 [2018-11-14 18:56:25,417 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 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-14 18:56:25,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-14 18:56:25,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-14 18:56:25,433 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:56:25,434 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2018-11-14 18:56:25,434 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2018-11-14 18:56:25,435 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2018-11-14 18:56:25,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:25,438 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-14 18:56:25,438 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-14 18:56:25,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:56:25,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:56:25,439 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2018-11-14 18:56:25,439 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2018-11-14 18:56:25,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:25,442 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-14 18:56:25,442 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-14 18:56:25,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:56:25,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:56:25,443 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:56:25,444 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:56:25,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 18:56:25,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-14 18:56:25,446 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 40 [2018-11-14 18:56:25,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:56:25,446 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-14 18:56:25,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 18:56:25,447 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-14 18:56:25,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-14 18:56:25,448 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:56:25,449 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 2, 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-14 18:56:25,449 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:56:25,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:56:25,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1851573025, now seen corresponding path program 1 times [2018-11-14 18:56:25,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:56:25,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:56:25,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:56:25,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:56:25,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:56:25,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:56:25,588 INFO L256 TraceCheckUtils]: 0: Hoare triple {705#true} call ULTIMATE.init(); {705#true} is VALID [2018-11-14 18:56:25,589 INFO L273 TraceCheckUtils]: 1: Hoare triple {705#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {705#true} is VALID [2018-11-14 18:56:25,589 INFO L273 TraceCheckUtils]: 2: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 18:56:25,590 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {705#true} {705#true} #69#return; {705#true} is VALID [2018-11-14 18:56:25,590 INFO L256 TraceCheckUtils]: 4: Hoare triple {705#true} call #t~ret13 := main(); {705#true} is VALID [2018-11-14 18:56:25,591 INFO L273 TraceCheckUtils]: 5: Hoare triple {705#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; {705#true} is VALID [2018-11-14 18:56:25,591 INFO L273 TraceCheckUtils]: 6: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 18:56:25,592 INFO L273 TraceCheckUtils]: 7: Hoare triple {705#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {705#true} is VALID [2018-11-14 18:56:25,592 INFO L273 TraceCheckUtils]: 8: Hoare triple {705#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {705#true} is VALID [2018-11-14 18:56:25,592 INFO L273 TraceCheckUtils]: 9: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 18:56:25,593 INFO L273 TraceCheckUtils]: 10: Hoare triple {705#true} assume !(~i~1 < 100000); {705#true} is VALID [2018-11-14 18:56:25,593 INFO L256 TraceCheckUtils]: 11: Hoare triple {705#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {705#true} is VALID [2018-11-14 18:56:25,593 INFO L273 TraceCheckUtils]: 12: Hoare triple {705#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {705#true} is VALID [2018-11-14 18:56:25,594 INFO L273 TraceCheckUtils]: 13: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 18:56:25,594 INFO L273 TraceCheckUtils]: 14: Hoare triple {705#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {705#true} is VALID [2018-11-14 18:56:25,594 INFO L273 TraceCheckUtils]: 15: Hoare triple {705#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {705#true} is VALID [2018-11-14 18:56:25,594 INFO L273 TraceCheckUtils]: 16: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 18:56:25,595 INFO L273 TraceCheckUtils]: 17: Hoare triple {705#true} assume !(~i~0 < 100000); {705#true} is VALID [2018-11-14 18:56:25,595 INFO L273 TraceCheckUtils]: 18: Hoare triple {705#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {705#true} is VALID [2018-11-14 18:56:25,595 INFO L273 TraceCheckUtils]: 19: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 18:56:25,596 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {705#true} {705#true} #73#return; {705#true} is VALID [2018-11-14 18:56:25,596 INFO L273 TraceCheckUtils]: 21: Hoare triple {705#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {705#true} is VALID [2018-11-14 18:56:25,596 INFO L256 TraceCheckUtils]: 22: Hoare triple {705#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {705#true} is VALID [2018-11-14 18:56:25,596 INFO L273 TraceCheckUtils]: 23: Hoare triple {705#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {705#true} is VALID [2018-11-14 18:56:25,597 INFO L273 TraceCheckUtils]: 24: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 18:56:25,597 INFO L273 TraceCheckUtils]: 25: Hoare triple {705#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {705#true} is VALID [2018-11-14 18:56:25,597 INFO L273 TraceCheckUtils]: 26: Hoare triple {705#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {705#true} is VALID [2018-11-14 18:56:25,598 INFO L273 TraceCheckUtils]: 27: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 18:56:25,598 INFO L273 TraceCheckUtils]: 28: Hoare triple {705#true} assume !(~i~0 < 100000); {705#true} is VALID [2018-11-14 18:56:25,598 INFO L273 TraceCheckUtils]: 29: Hoare triple {705#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {705#true} is VALID [2018-11-14 18:56:25,598 INFO L273 TraceCheckUtils]: 30: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 18:56:25,599 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {705#true} {705#true} #75#return; {705#true} is VALID [2018-11-14 18:56:25,601 INFO L273 TraceCheckUtils]: 32: Hoare triple {705#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {707#(= main_~i~2 0)} is VALID [2018-11-14 18:56:25,601 INFO L273 TraceCheckUtils]: 33: Hoare triple {707#(= main_~i~2 0)} assume true; {707#(= main_~i~2 0)} is VALID [2018-11-14 18:56:25,603 INFO L273 TraceCheckUtils]: 34: Hoare triple {707#(= main_~i~2 0)} assume !(~i~2 < 99999); {706#false} is VALID [2018-11-14 18:56:25,603 INFO L273 TraceCheckUtils]: 35: Hoare triple {706#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {706#false} is VALID [2018-11-14 18:56:25,603 INFO L256 TraceCheckUtils]: 36: Hoare triple {706#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {705#true} is VALID [2018-11-14 18:56:25,603 INFO L273 TraceCheckUtils]: 37: Hoare triple {705#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {705#true} is VALID [2018-11-14 18:56:25,604 INFO L273 TraceCheckUtils]: 38: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 18:56:25,604 INFO L273 TraceCheckUtils]: 39: Hoare triple {705#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {705#true} is VALID [2018-11-14 18:56:25,604 INFO L273 TraceCheckUtils]: 40: Hoare triple {705#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {705#true} is VALID [2018-11-14 18:56:25,604 INFO L273 TraceCheckUtils]: 41: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 18:56:25,604 INFO L273 TraceCheckUtils]: 42: Hoare triple {705#true} assume !(~i~0 < 100000); {705#true} is VALID [2018-11-14 18:56:25,605 INFO L273 TraceCheckUtils]: 43: Hoare triple {705#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {705#true} is VALID [2018-11-14 18:56:25,605 INFO L273 TraceCheckUtils]: 44: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 18:56:25,605 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {705#true} {706#false} #77#return; {706#false} is VALID [2018-11-14 18:56:25,605 INFO L273 TraceCheckUtils]: 46: Hoare triple {706#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {706#false} is VALID [2018-11-14 18:56:25,606 INFO L273 TraceCheckUtils]: 47: Hoare triple {706#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {706#false} is VALID [2018-11-14 18:56:25,606 INFO L273 TraceCheckUtils]: 48: Hoare triple {706#false} assume !false; {706#false} is VALID [2018-11-14 18:56:25,609 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-14 18:56:25,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:56:25,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:56:25,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-11-14 18:56:25,611 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:56:25,611 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:56:25,670 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:56:25,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:56:25,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:56:25,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:56:25,671 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 3 states. [2018-11-14 18:56:25,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:25,798 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-11-14 18:56:25,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:56:25,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-11-14 18:56:25,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:56:25,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:56:25,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2018-11-14 18:56:25,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:56:25,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2018-11-14 18:56:25,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2018-11-14 18:56:25,913 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:56:25,915 INFO L225 Difference]: With dead ends: 51 [2018-11-14 18:56:25,915 INFO L226 Difference]: Without dead ends: 36 [2018-11-14 18:56:25,916 INFO L604 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-14 18:56:25,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-14 18:56:25,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-11-14 18:56:25,934 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:56:25,935 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 35 states. [2018-11-14 18:56:25,935 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 35 states. [2018-11-14 18:56:25,935 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 35 states. [2018-11-14 18:56:25,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:25,938 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-14 18:56:25,939 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-14 18:56:25,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:56:25,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:56:25,940 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 36 states. [2018-11-14 18:56:25,940 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 36 states. [2018-11-14 18:56:25,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:25,943 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-14 18:56:25,943 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-14 18:56:25,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:56:25,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:56:25,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:56:25,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:56:25,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 18:56:25,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-11-14 18:56:25,947 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 49 [2018-11-14 18:56:25,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:56:25,947 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-14 18:56:25,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:56:25,948 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-14 18:56:25,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-14 18:56:25,949 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:56:25,949 INFO L375 BasicCegarLoop]: trace histogram [6, 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, 1, 1] [2018-11-14 18:56:25,950 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:56:25,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:56:25,950 INFO L82 PathProgramCache]: Analyzing trace with hash -476474227, now seen corresponding path program 1 times [2018-11-14 18:56:25,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:56:25,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:56:25,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:56:25,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:56:25,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:56:25,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:56:26,059 INFO L256 TraceCheckUtils]: 0: Hoare triple {900#true} call ULTIMATE.init(); {900#true} is VALID [2018-11-14 18:56:26,060 INFO L273 TraceCheckUtils]: 1: Hoare triple {900#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {900#true} is VALID [2018-11-14 18:56:26,060 INFO L273 TraceCheckUtils]: 2: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 18:56:26,060 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {900#true} {900#true} #69#return; {900#true} is VALID [2018-11-14 18:56:26,061 INFO L256 TraceCheckUtils]: 4: Hoare triple {900#true} call #t~ret13 := main(); {900#true} is VALID [2018-11-14 18:56:26,066 INFO L273 TraceCheckUtils]: 5: Hoare triple {900#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; {902#(= main_~i~1 0)} is VALID [2018-11-14 18:56:26,067 INFO L273 TraceCheckUtils]: 6: Hoare triple {902#(= main_~i~1 0)} assume true; {902#(= main_~i~1 0)} is VALID [2018-11-14 18:56:26,067 INFO L273 TraceCheckUtils]: 7: Hoare triple {902#(= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {902#(= main_~i~1 0)} is VALID [2018-11-14 18:56:26,068 INFO L273 TraceCheckUtils]: 8: Hoare triple {902#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {903#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:26,069 INFO L273 TraceCheckUtils]: 9: Hoare triple {903#(<= main_~i~1 1)} assume true; {903#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:26,069 INFO L273 TraceCheckUtils]: 10: Hoare triple {903#(<= main_~i~1 1)} assume !(~i~1 < 100000); {901#false} is VALID [2018-11-14 18:56:26,069 INFO L256 TraceCheckUtils]: 11: Hoare triple {901#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {900#true} is VALID [2018-11-14 18:56:26,069 INFO L273 TraceCheckUtils]: 12: Hoare triple {900#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {900#true} is VALID [2018-11-14 18:56:26,070 INFO L273 TraceCheckUtils]: 13: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 18:56:26,070 INFO L273 TraceCheckUtils]: 14: Hoare triple {900#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {900#true} is VALID [2018-11-14 18:56:26,070 INFO L273 TraceCheckUtils]: 15: Hoare triple {900#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {900#true} is VALID [2018-11-14 18:56:26,071 INFO L273 TraceCheckUtils]: 16: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 18:56:26,071 INFO L273 TraceCheckUtils]: 17: Hoare triple {900#true} assume !(~i~0 < 100000); {900#true} is VALID [2018-11-14 18:56:26,071 INFO L273 TraceCheckUtils]: 18: Hoare triple {900#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {900#true} is VALID [2018-11-14 18:56:26,072 INFO L273 TraceCheckUtils]: 19: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 18:56:26,072 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {900#true} {901#false} #73#return; {901#false} is VALID [2018-11-14 18:56:26,072 INFO L273 TraceCheckUtils]: 21: Hoare triple {901#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {901#false} is VALID [2018-11-14 18:56:26,073 INFO L256 TraceCheckUtils]: 22: Hoare triple {901#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {900#true} is VALID [2018-11-14 18:56:26,073 INFO L273 TraceCheckUtils]: 23: Hoare triple {900#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {900#true} is VALID [2018-11-14 18:56:26,074 INFO L273 TraceCheckUtils]: 24: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 18:56:26,074 INFO L273 TraceCheckUtils]: 25: Hoare triple {900#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {900#true} is VALID [2018-11-14 18:56:26,074 INFO L273 TraceCheckUtils]: 26: Hoare triple {900#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {900#true} is VALID [2018-11-14 18:56:26,074 INFO L273 TraceCheckUtils]: 27: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 18:56:26,075 INFO L273 TraceCheckUtils]: 28: Hoare triple {900#true} assume !(~i~0 < 100000); {900#true} is VALID [2018-11-14 18:56:26,075 INFO L273 TraceCheckUtils]: 29: Hoare triple {900#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {900#true} is VALID [2018-11-14 18:56:26,075 INFO L273 TraceCheckUtils]: 30: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 18:56:26,076 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {900#true} {901#false} #75#return; {901#false} is VALID [2018-11-14 18:56:26,076 INFO L273 TraceCheckUtils]: 32: Hoare triple {901#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {901#false} is VALID [2018-11-14 18:56:26,076 INFO L273 TraceCheckUtils]: 33: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 18:56:26,076 INFO L273 TraceCheckUtils]: 34: Hoare triple {901#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {901#false} is VALID [2018-11-14 18:56:26,077 INFO L273 TraceCheckUtils]: 35: Hoare triple {901#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {901#false} is VALID [2018-11-14 18:56:26,077 INFO L273 TraceCheckUtils]: 36: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 18:56:26,077 INFO L273 TraceCheckUtils]: 37: Hoare triple {901#false} assume !(~i~2 < 99999); {901#false} is VALID [2018-11-14 18:56:26,077 INFO L273 TraceCheckUtils]: 38: Hoare triple {901#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {901#false} is VALID [2018-11-14 18:56:26,078 INFO L256 TraceCheckUtils]: 39: Hoare triple {901#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {900#true} is VALID [2018-11-14 18:56:26,078 INFO L273 TraceCheckUtils]: 40: Hoare triple {900#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {900#true} is VALID [2018-11-14 18:56:26,078 INFO L273 TraceCheckUtils]: 41: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 18:56:26,078 INFO L273 TraceCheckUtils]: 42: Hoare triple {900#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {900#true} is VALID [2018-11-14 18:56:26,079 INFO L273 TraceCheckUtils]: 43: Hoare triple {900#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {900#true} is VALID [2018-11-14 18:56:26,079 INFO L273 TraceCheckUtils]: 44: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 18:56:26,079 INFO L273 TraceCheckUtils]: 45: Hoare triple {900#true} assume !(~i~0 < 100000); {900#true} is VALID [2018-11-14 18:56:26,079 INFO L273 TraceCheckUtils]: 46: Hoare triple {900#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {900#true} is VALID [2018-11-14 18:56:26,079 INFO L273 TraceCheckUtils]: 47: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 18:56:26,080 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {900#true} {901#false} #77#return; {901#false} is VALID [2018-11-14 18:56:26,080 INFO L273 TraceCheckUtils]: 49: Hoare triple {901#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {901#false} is VALID [2018-11-14 18:56:26,080 INFO L273 TraceCheckUtils]: 50: Hoare triple {901#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {901#false} is VALID [2018-11-14 18:56:26,080 INFO L273 TraceCheckUtils]: 51: Hoare triple {901#false} assume !false; {901#false} is VALID [2018-11-14 18:56:26,084 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-14 18:56:26,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:56:26,084 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-14 18:56:26,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:56:26,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:56:26,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:56:26,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:56:26,487 INFO L256 TraceCheckUtils]: 0: Hoare triple {900#true} call ULTIMATE.init(); {900#true} is VALID [2018-11-14 18:56:26,487 INFO L273 TraceCheckUtils]: 1: Hoare triple {900#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {900#true} is VALID [2018-11-14 18:56:26,487 INFO L273 TraceCheckUtils]: 2: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 18:56:26,488 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {900#true} {900#true} #69#return; {900#true} is VALID [2018-11-14 18:56:26,488 INFO L256 TraceCheckUtils]: 4: Hoare triple {900#true} call #t~ret13 := main(); {900#true} is VALID [2018-11-14 18:56:26,492 INFO L273 TraceCheckUtils]: 5: Hoare triple {900#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; {922#(<= main_~i~1 0)} is VALID [2018-11-14 18:56:26,494 INFO L273 TraceCheckUtils]: 6: Hoare triple {922#(<= main_~i~1 0)} assume true; {922#(<= main_~i~1 0)} is VALID [2018-11-14 18:56:26,494 INFO L273 TraceCheckUtils]: 7: Hoare triple {922#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {922#(<= main_~i~1 0)} is VALID [2018-11-14 18:56:26,495 INFO L273 TraceCheckUtils]: 8: Hoare triple {922#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {903#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:26,496 INFO L273 TraceCheckUtils]: 9: Hoare triple {903#(<= main_~i~1 1)} assume true; {903#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:26,496 INFO L273 TraceCheckUtils]: 10: Hoare triple {903#(<= main_~i~1 1)} assume !(~i~1 < 100000); {901#false} is VALID [2018-11-14 18:56:26,496 INFO L256 TraceCheckUtils]: 11: Hoare triple {901#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {901#false} is VALID [2018-11-14 18:56:26,497 INFO L273 TraceCheckUtils]: 12: Hoare triple {901#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {901#false} is VALID [2018-11-14 18:56:26,497 INFO L273 TraceCheckUtils]: 13: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 18:56:26,497 INFO L273 TraceCheckUtils]: 14: Hoare triple {901#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {901#false} is VALID [2018-11-14 18:56:26,497 INFO L273 TraceCheckUtils]: 15: Hoare triple {901#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {901#false} is VALID [2018-11-14 18:56:26,498 INFO L273 TraceCheckUtils]: 16: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 18:56:26,498 INFO L273 TraceCheckUtils]: 17: Hoare triple {901#false} assume !(~i~0 < 100000); {901#false} is VALID [2018-11-14 18:56:26,498 INFO L273 TraceCheckUtils]: 18: Hoare triple {901#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {901#false} is VALID [2018-11-14 18:56:26,498 INFO L273 TraceCheckUtils]: 19: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 18:56:26,499 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {901#false} {901#false} #73#return; {901#false} is VALID [2018-11-14 18:56:26,499 INFO L273 TraceCheckUtils]: 21: Hoare triple {901#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {901#false} is VALID [2018-11-14 18:56:26,500 INFO L256 TraceCheckUtils]: 22: Hoare triple {901#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {901#false} is VALID [2018-11-14 18:56:26,500 INFO L273 TraceCheckUtils]: 23: Hoare triple {901#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {901#false} is VALID [2018-11-14 18:56:26,500 INFO L273 TraceCheckUtils]: 24: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 18:56:26,501 INFO L273 TraceCheckUtils]: 25: Hoare triple {901#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {901#false} is VALID [2018-11-14 18:56:26,501 INFO L273 TraceCheckUtils]: 26: Hoare triple {901#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {901#false} is VALID [2018-11-14 18:56:26,501 INFO L273 TraceCheckUtils]: 27: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 18:56:26,501 INFO L273 TraceCheckUtils]: 28: Hoare triple {901#false} assume !(~i~0 < 100000); {901#false} is VALID [2018-11-14 18:56:26,502 INFO L273 TraceCheckUtils]: 29: Hoare triple {901#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {901#false} is VALID [2018-11-14 18:56:26,502 INFO L273 TraceCheckUtils]: 30: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 18:56:26,502 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {901#false} {901#false} #75#return; {901#false} is VALID [2018-11-14 18:56:26,502 INFO L273 TraceCheckUtils]: 32: Hoare triple {901#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {901#false} is VALID [2018-11-14 18:56:26,503 INFO L273 TraceCheckUtils]: 33: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 18:56:26,503 INFO L273 TraceCheckUtils]: 34: Hoare triple {901#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {901#false} is VALID [2018-11-14 18:56:26,503 INFO L273 TraceCheckUtils]: 35: Hoare triple {901#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {901#false} is VALID [2018-11-14 18:56:26,503 INFO L273 TraceCheckUtils]: 36: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 18:56:26,504 INFO L273 TraceCheckUtils]: 37: Hoare triple {901#false} assume !(~i~2 < 99999); {901#false} is VALID [2018-11-14 18:56:26,504 INFO L273 TraceCheckUtils]: 38: Hoare triple {901#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {901#false} is VALID [2018-11-14 18:56:26,504 INFO L256 TraceCheckUtils]: 39: Hoare triple {901#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {901#false} is VALID [2018-11-14 18:56:26,504 INFO L273 TraceCheckUtils]: 40: Hoare triple {901#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {901#false} is VALID [2018-11-14 18:56:26,505 INFO L273 TraceCheckUtils]: 41: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 18:56:26,505 INFO L273 TraceCheckUtils]: 42: Hoare triple {901#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {901#false} is VALID [2018-11-14 18:56:26,505 INFO L273 TraceCheckUtils]: 43: Hoare triple {901#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {901#false} is VALID [2018-11-14 18:56:26,506 INFO L273 TraceCheckUtils]: 44: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 18:56:26,506 INFO L273 TraceCheckUtils]: 45: Hoare triple {901#false} assume !(~i~0 < 100000); {901#false} is VALID [2018-11-14 18:56:26,506 INFO L273 TraceCheckUtils]: 46: Hoare triple {901#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {901#false} is VALID [2018-11-14 18:56:26,506 INFO L273 TraceCheckUtils]: 47: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 18:56:26,507 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {901#false} {901#false} #77#return; {901#false} is VALID [2018-11-14 18:56:26,507 INFO L273 TraceCheckUtils]: 49: Hoare triple {901#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {901#false} is VALID [2018-11-14 18:56:26,507 INFO L273 TraceCheckUtils]: 50: Hoare triple {901#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {901#false} is VALID [2018-11-14 18:56:26,507 INFO L273 TraceCheckUtils]: 51: Hoare triple {901#false} assume !false; {901#false} is VALID [2018-11-14 18:56:26,511 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-14 18:56:26,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:56:26,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-14 18:56:26,543 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-11-14 18:56:26,544 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:56:26,544 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 18:56:26,628 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-14 18:56:26,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 18:56:26,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 18:56:26,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:56:26,629 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 5 states. [2018-11-14 18:56:26,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:26,770 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2018-11-14 18:56:26,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 18:56:26,770 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-11-14 18:56:26,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:56:26,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:56:26,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2018-11-14 18:56:26,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:56:26,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2018-11-14 18:56:26,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 63 transitions. [2018-11-14 18:56:26,978 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:56:26,981 INFO L225 Difference]: With dead ends: 63 [2018-11-14 18:56:26,981 INFO L226 Difference]: Without dead ends: 39 [2018-11-14 18:56:26,982 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 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-14 18:56:26,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-14 18:56:27,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-11-14 18:56:27,007 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:56:27,007 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 38 states. [2018-11-14 18:56:27,007 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 38 states. [2018-11-14 18:56:27,007 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 38 states. [2018-11-14 18:56:27,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:27,011 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-14 18:56:27,011 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-14 18:56:27,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:56:27,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:56:27,012 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 39 states. [2018-11-14 18:56:27,012 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 39 states. [2018-11-14 18:56:27,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:27,015 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-14 18:56:27,015 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-14 18:56:27,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:56:27,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:56:27,016 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:56:27,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:56:27,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 18:56:27,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-11-14 18:56:27,019 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 52 [2018-11-14 18:56:27,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:56:27,019 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-11-14 18:56:27,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 18:56:27,019 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-14 18:56:27,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-14 18:56:27,021 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:56:27,021 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 2, 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-14 18:56:27,021 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:56:27,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:56:27,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1438119929, now seen corresponding path program 2 times [2018-11-14 18:56:27,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:56:27,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:56:27,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:56:27,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:56:27,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:56:27,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:56:27,147 INFO L256 TraceCheckUtils]: 0: Hoare triple {1277#true} call ULTIMATE.init(); {1277#true} is VALID [2018-11-14 18:56:27,147 INFO L273 TraceCheckUtils]: 1: Hoare triple {1277#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1277#true} is VALID [2018-11-14 18:56:27,148 INFO L273 TraceCheckUtils]: 2: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 18:56:27,148 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1277#true} {1277#true} #69#return; {1277#true} is VALID [2018-11-14 18:56:27,148 INFO L256 TraceCheckUtils]: 4: Hoare triple {1277#true} call #t~ret13 := main(); {1277#true} is VALID [2018-11-14 18:56:27,149 INFO L273 TraceCheckUtils]: 5: Hoare triple {1277#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; {1279#(= main_~i~1 0)} is VALID [2018-11-14 18:56:27,150 INFO L273 TraceCheckUtils]: 6: Hoare triple {1279#(= main_~i~1 0)} assume true; {1279#(= main_~i~1 0)} is VALID [2018-11-14 18:56:27,151 INFO L273 TraceCheckUtils]: 7: Hoare triple {1279#(= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {1279#(= main_~i~1 0)} is VALID [2018-11-14 18:56:27,151 INFO L273 TraceCheckUtils]: 8: Hoare triple {1279#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {1280#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:27,154 INFO L273 TraceCheckUtils]: 9: Hoare triple {1280#(<= main_~i~1 1)} assume true; {1280#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:27,154 INFO L273 TraceCheckUtils]: 10: Hoare triple {1280#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {1280#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:27,157 INFO L273 TraceCheckUtils]: 11: Hoare triple {1280#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {1281#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:27,157 INFO L273 TraceCheckUtils]: 12: Hoare triple {1281#(<= main_~i~1 2)} assume true; {1281#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:27,159 INFO L273 TraceCheckUtils]: 13: Hoare triple {1281#(<= main_~i~1 2)} assume !(~i~1 < 100000); {1278#false} is VALID [2018-11-14 18:56:27,159 INFO L256 TraceCheckUtils]: 14: Hoare triple {1278#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {1277#true} is VALID [2018-11-14 18:56:27,159 INFO L273 TraceCheckUtils]: 15: Hoare triple {1277#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1277#true} is VALID [2018-11-14 18:56:27,159 INFO L273 TraceCheckUtils]: 16: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 18:56:27,159 INFO L273 TraceCheckUtils]: 17: Hoare triple {1277#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1277#true} is VALID [2018-11-14 18:56:27,160 INFO L273 TraceCheckUtils]: 18: Hoare triple {1277#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1277#true} is VALID [2018-11-14 18:56:27,160 INFO L273 TraceCheckUtils]: 19: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 18:56:27,160 INFO L273 TraceCheckUtils]: 20: Hoare triple {1277#true} assume !(~i~0 < 100000); {1277#true} is VALID [2018-11-14 18:56:27,160 INFO L273 TraceCheckUtils]: 21: Hoare triple {1277#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1277#true} is VALID [2018-11-14 18:56:27,160 INFO L273 TraceCheckUtils]: 22: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 18:56:27,161 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1277#true} {1278#false} #73#return; {1278#false} is VALID [2018-11-14 18:56:27,161 INFO L273 TraceCheckUtils]: 24: Hoare triple {1278#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {1278#false} is VALID [2018-11-14 18:56:27,161 INFO L256 TraceCheckUtils]: 25: Hoare triple {1278#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {1277#true} is VALID [2018-11-14 18:56:27,161 INFO L273 TraceCheckUtils]: 26: Hoare triple {1277#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1277#true} is VALID [2018-11-14 18:56:27,162 INFO L273 TraceCheckUtils]: 27: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 18:56:27,162 INFO L273 TraceCheckUtils]: 28: Hoare triple {1277#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1277#true} is VALID [2018-11-14 18:56:27,162 INFO L273 TraceCheckUtils]: 29: Hoare triple {1277#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1277#true} is VALID [2018-11-14 18:56:27,162 INFO L273 TraceCheckUtils]: 30: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 18:56:27,163 INFO L273 TraceCheckUtils]: 31: Hoare triple {1277#true} assume !(~i~0 < 100000); {1277#true} is VALID [2018-11-14 18:56:27,163 INFO L273 TraceCheckUtils]: 32: Hoare triple {1277#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1277#true} is VALID [2018-11-14 18:56:27,163 INFO L273 TraceCheckUtils]: 33: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 18:56:27,163 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {1277#true} {1278#false} #75#return; {1278#false} is VALID [2018-11-14 18:56:27,163 INFO L273 TraceCheckUtils]: 35: Hoare triple {1278#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {1278#false} is VALID [2018-11-14 18:56:27,163 INFO L273 TraceCheckUtils]: 36: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 18:56:27,164 INFO L273 TraceCheckUtils]: 37: Hoare triple {1278#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {1278#false} is VALID [2018-11-14 18:56:27,164 INFO L273 TraceCheckUtils]: 38: Hoare triple {1278#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {1278#false} is VALID [2018-11-14 18:56:27,164 INFO L273 TraceCheckUtils]: 39: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 18:56:27,164 INFO L273 TraceCheckUtils]: 40: Hoare triple {1278#false} assume !(~i~2 < 99999); {1278#false} is VALID [2018-11-14 18:56:27,164 INFO L273 TraceCheckUtils]: 41: Hoare triple {1278#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {1278#false} is VALID [2018-11-14 18:56:27,165 INFO L256 TraceCheckUtils]: 42: Hoare triple {1278#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {1277#true} is VALID [2018-11-14 18:56:27,165 INFO L273 TraceCheckUtils]: 43: Hoare triple {1277#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1277#true} is VALID [2018-11-14 18:56:27,165 INFO L273 TraceCheckUtils]: 44: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 18:56:27,165 INFO L273 TraceCheckUtils]: 45: Hoare triple {1277#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1277#true} is VALID [2018-11-14 18:56:27,165 INFO L273 TraceCheckUtils]: 46: Hoare triple {1277#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1277#true} is VALID [2018-11-14 18:56:27,165 INFO L273 TraceCheckUtils]: 47: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 18:56:27,166 INFO L273 TraceCheckUtils]: 48: Hoare triple {1277#true} assume !(~i~0 < 100000); {1277#true} is VALID [2018-11-14 18:56:27,166 INFO L273 TraceCheckUtils]: 49: Hoare triple {1277#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1277#true} is VALID [2018-11-14 18:56:27,166 INFO L273 TraceCheckUtils]: 50: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 18:56:27,166 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {1277#true} {1278#false} #77#return; {1278#false} is VALID [2018-11-14 18:56:27,167 INFO L273 TraceCheckUtils]: 52: Hoare triple {1278#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {1278#false} is VALID [2018-11-14 18:56:27,167 INFO L273 TraceCheckUtils]: 53: Hoare triple {1278#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {1278#false} is VALID [2018-11-14 18:56:27,167 INFO L273 TraceCheckUtils]: 54: Hoare triple {1278#false} assume !false; {1278#false} is VALID [2018-11-14 18:56:27,170 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-14 18:56:27,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:56:27,171 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-14 18:56:27,180 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:56:27,222 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:56:27,222 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:56:27,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:56:27,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:56:27,408 INFO L256 TraceCheckUtils]: 0: Hoare triple {1277#true} call ULTIMATE.init(); {1277#true} is VALID [2018-11-14 18:56:27,408 INFO L273 TraceCheckUtils]: 1: Hoare triple {1277#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1277#true} is VALID [2018-11-14 18:56:27,409 INFO L273 TraceCheckUtils]: 2: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 18:56:27,409 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1277#true} {1277#true} #69#return; {1277#true} is VALID [2018-11-14 18:56:27,410 INFO L256 TraceCheckUtils]: 4: Hoare triple {1277#true} call #t~ret13 := main(); {1277#true} is VALID [2018-11-14 18:56:27,417 INFO L273 TraceCheckUtils]: 5: Hoare triple {1277#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; {1300#(<= main_~i~1 0)} is VALID [2018-11-14 18:56:27,418 INFO L273 TraceCheckUtils]: 6: Hoare triple {1300#(<= main_~i~1 0)} assume true; {1300#(<= main_~i~1 0)} is VALID [2018-11-14 18:56:27,418 INFO L273 TraceCheckUtils]: 7: Hoare triple {1300#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {1300#(<= main_~i~1 0)} is VALID [2018-11-14 18:56:27,419 INFO L273 TraceCheckUtils]: 8: Hoare triple {1300#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {1280#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:27,419 INFO L273 TraceCheckUtils]: 9: Hoare triple {1280#(<= main_~i~1 1)} assume true; {1280#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:27,420 INFO L273 TraceCheckUtils]: 10: Hoare triple {1280#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {1280#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:27,420 INFO L273 TraceCheckUtils]: 11: Hoare triple {1280#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {1281#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:27,421 INFO L273 TraceCheckUtils]: 12: Hoare triple {1281#(<= main_~i~1 2)} assume true; {1281#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:27,422 INFO L273 TraceCheckUtils]: 13: Hoare triple {1281#(<= main_~i~1 2)} assume !(~i~1 < 100000); {1278#false} is VALID [2018-11-14 18:56:27,422 INFO L256 TraceCheckUtils]: 14: Hoare triple {1278#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {1278#false} is VALID [2018-11-14 18:56:27,422 INFO L273 TraceCheckUtils]: 15: Hoare triple {1278#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1278#false} is VALID [2018-11-14 18:56:27,422 INFO L273 TraceCheckUtils]: 16: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 18:56:27,423 INFO L273 TraceCheckUtils]: 17: Hoare triple {1278#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1278#false} is VALID [2018-11-14 18:56:27,423 INFO L273 TraceCheckUtils]: 18: Hoare triple {1278#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1278#false} is VALID [2018-11-14 18:56:27,423 INFO L273 TraceCheckUtils]: 19: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 18:56:27,424 INFO L273 TraceCheckUtils]: 20: Hoare triple {1278#false} assume !(~i~0 < 100000); {1278#false} is VALID [2018-11-14 18:56:27,424 INFO L273 TraceCheckUtils]: 21: Hoare triple {1278#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1278#false} is VALID [2018-11-14 18:56:27,424 INFO L273 TraceCheckUtils]: 22: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 18:56:27,425 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1278#false} {1278#false} #73#return; {1278#false} is VALID [2018-11-14 18:56:27,425 INFO L273 TraceCheckUtils]: 24: Hoare triple {1278#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {1278#false} is VALID [2018-11-14 18:56:27,426 INFO L256 TraceCheckUtils]: 25: Hoare triple {1278#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {1278#false} is VALID [2018-11-14 18:56:27,426 INFO L273 TraceCheckUtils]: 26: Hoare triple {1278#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1278#false} is VALID [2018-11-14 18:56:27,426 INFO L273 TraceCheckUtils]: 27: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 18:56:27,426 INFO L273 TraceCheckUtils]: 28: Hoare triple {1278#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1278#false} is VALID [2018-11-14 18:56:27,427 INFO L273 TraceCheckUtils]: 29: Hoare triple {1278#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1278#false} is VALID [2018-11-14 18:56:27,427 INFO L273 TraceCheckUtils]: 30: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 18:56:27,427 INFO L273 TraceCheckUtils]: 31: Hoare triple {1278#false} assume !(~i~0 < 100000); {1278#false} is VALID [2018-11-14 18:56:27,427 INFO L273 TraceCheckUtils]: 32: Hoare triple {1278#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1278#false} is VALID [2018-11-14 18:56:27,428 INFO L273 TraceCheckUtils]: 33: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 18:56:27,428 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {1278#false} {1278#false} #75#return; {1278#false} is VALID [2018-11-14 18:56:27,428 INFO L273 TraceCheckUtils]: 35: Hoare triple {1278#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {1278#false} is VALID [2018-11-14 18:56:27,428 INFO L273 TraceCheckUtils]: 36: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 18:56:27,429 INFO L273 TraceCheckUtils]: 37: Hoare triple {1278#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {1278#false} is VALID [2018-11-14 18:56:27,429 INFO L273 TraceCheckUtils]: 38: Hoare triple {1278#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {1278#false} is VALID [2018-11-14 18:56:27,429 INFO L273 TraceCheckUtils]: 39: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 18:56:27,429 INFO L273 TraceCheckUtils]: 40: Hoare triple {1278#false} assume !(~i~2 < 99999); {1278#false} is VALID [2018-11-14 18:56:27,430 INFO L273 TraceCheckUtils]: 41: Hoare triple {1278#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {1278#false} is VALID [2018-11-14 18:56:27,430 INFO L256 TraceCheckUtils]: 42: Hoare triple {1278#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {1278#false} is VALID [2018-11-14 18:56:27,430 INFO L273 TraceCheckUtils]: 43: Hoare triple {1278#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1278#false} is VALID [2018-11-14 18:56:27,430 INFO L273 TraceCheckUtils]: 44: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 18:56:27,430 INFO L273 TraceCheckUtils]: 45: Hoare triple {1278#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1278#false} is VALID [2018-11-14 18:56:27,430 INFO L273 TraceCheckUtils]: 46: Hoare triple {1278#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1278#false} is VALID [2018-11-14 18:56:27,431 INFO L273 TraceCheckUtils]: 47: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 18:56:27,431 INFO L273 TraceCheckUtils]: 48: Hoare triple {1278#false} assume !(~i~0 < 100000); {1278#false} is VALID [2018-11-14 18:56:27,431 INFO L273 TraceCheckUtils]: 49: Hoare triple {1278#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1278#false} is VALID [2018-11-14 18:56:27,431 INFO L273 TraceCheckUtils]: 50: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 18:56:27,431 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {1278#false} {1278#false} #77#return; {1278#false} is VALID [2018-11-14 18:56:27,431 INFO L273 TraceCheckUtils]: 52: Hoare triple {1278#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {1278#false} is VALID [2018-11-14 18:56:27,432 INFO L273 TraceCheckUtils]: 53: Hoare triple {1278#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {1278#false} is VALID [2018-11-14 18:56:27,432 INFO L273 TraceCheckUtils]: 54: Hoare triple {1278#false} assume !false; {1278#false} is VALID [2018-11-14 18:56:27,435 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-14 18:56:27,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:56:27,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-14 18:56:27,456 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-11-14 18:56:27,457 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:56:27,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 18:56:27,522 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-14 18:56:27,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 18:56:27,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 18:56:27,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:56:27,524 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 6 states. [2018-11-14 18:56:27,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:27,675 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2018-11-14 18:56:27,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 18:56:27,676 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-11-14 18:56:27,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:56:27,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:56:27,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2018-11-14 18:56:27,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:56:27,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2018-11-14 18:56:27,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 66 transitions. [2018-11-14 18:56:27,844 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:56:27,845 INFO L225 Difference]: With dead ends: 66 [2018-11-14 18:56:27,846 INFO L226 Difference]: Without dead ends: 42 [2018-11-14 18:56:27,847 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 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-14 18:56:27,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-14 18:56:27,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-11-14 18:56:27,900 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:56:27,900 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 41 states. [2018-11-14 18:56:27,900 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 41 states. [2018-11-14 18:56:27,900 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 41 states. [2018-11-14 18:56:27,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:27,903 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-11-14 18:56:27,903 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-14 18:56:27,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:56:27,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:56:27,904 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 42 states. [2018-11-14 18:56:27,904 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 42 states. [2018-11-14 18:56:27,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:27,907 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-11-14 18:56:27,907 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-14 18:56:27,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:56:27,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:56:27,908 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:56:27,908 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:56:27,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-14 18:56:27,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-11-14 18:56:27,910 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 55 [2018-11-14 18:56:27,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:56:27,910 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-11-14 18:56:27,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 18:56:27,911 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-14 18:56:27,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-14 18:56:27,912 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:56:27,912 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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-14 18:56:27,913 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:56:27,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:56:27,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1901603405, now seen corresponding path program 3 times [2018-11-14 18:56:27,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:56:27,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:56:27,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:56:27,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:56:27,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:56:27,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:56:28,081 INFO L256 TraceCheckUtils]: 0: Hoare triple {1678#true} call ULTIMATE.init(); {1678#true} is VALID [2018-11-14 18:56:28,081 INFO L273 TraceCheckUtils]: 1: Hoare triple {1678#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1678#true} is VALID [2018-11-14 18:56:28,082 INFO L273 TraceCheckUtils]: 2: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:56:28,082 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1678#true} {1678#true} #69#return; {1678#true} is VALID [2018-11-14 18:56:28,082 INFO L256 TraceCheckUtils]: 4: Hoare triple {1678#true} call #t~ret13 := main(); {1678#true} is VALID [2018-11-14 18:56:28,083 INFO L273 TraceCheckUtils]: 5: Hoare triple {1678#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; {1680#(= main_~i~1 0)} is VALID [2018-11-14 18:56:28,086 INFO L273 TraceCheckUtils]: 6: Hoare triple {1680#(= main_~i~1 0)} assume true; {1680#(= main_~i~1 0)} is VALID [2018-11-14 18:56:28,086 INFO L273 TraceCheckUtils]: 7: Hoare triple {1680#(= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {1680#(= main_~i~1 0)} is VALID [2018-11-14 18:56:28,088 INFO L273 TraceCheckUtils]: 8: Hoare triple {1680#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {1681#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:28,088 INFO L273 TraceCheckUtils]: 9: Hoare triple {1681#(<= main_~i~1 1)} assume true; {1681#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:28,090 INFO L273 TraceCheckUtils]: 10: Hoare triple {1681#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {1681#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:28,090 INFO L273 TraceCheckUtils]: 11: Hoare triple {1681#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {1682#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:28,092 INFO L273 TraceCheckUtils]: 12: Hoare triple {1682#(<= main_~i~1 2)} assume true; {1682#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:28,092 INFO L273 TraceCheckUtils]: 13: Hoare triple {1682#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {1682#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:28,094 INFO L273 TraceCheckUtils]: 14: Hoare triple {1682#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {1683#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:28,094 INFO L273 TraceCheckUtils]: 15: Hoare triple {1683#(<= main_~i~1 3)} assume true; {1683#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:28,096 INFO L273 TraceCheckUtils]: 16: Hoare triple {1683#(<= main_~i~1 3)} assume !(~i~1 < 100000); {1679#false} is VALID [2018-11-14 18:56:28,096 INFO L256 TraceCheckUtils]: 17: Hoare triple {1679#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {1678#true} is VALID [2018-11-14 18:56:28,096 INFO L273 TraceCheckUtils]: 18: Hoare triple {1678#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1678#true} is VALID [2018-11-14 18:56:28,096 INFO L273 TraceCheckUtils]: 19: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:56:28,096 INFO L273 TraceCheckUtils]: 20: Hoare triple {1678#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1678#true} is VALID [2018-11-14 18:56:28,097 INFO L273 TraceCheckUtils]: 21: Hoare triple {1678#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1678#true} is VALID [2018-11-14 18:56:28,097 INFO L273 TraceCheckUtils]: 22: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:56:28,097 INFO L273 TraceCheckUtils]: 23: Hoare triple {1678#true} assume !(~i~0 < 100000); {1678#true} is VALID [2018-11-14 18:56:28,097 INFO L273 TraceCheckUtils]: 24: Hoare triple {1678#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1678#true} is VALID [2018-11-14 18:56:28,097 INFO L273 TraceCheckUtils]: 25: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:56:28,098 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1678#true} {1679#false} #73#return; {1679#false} is VALID [2018-11-14 18:56:28,098 INFO L273 TraceCheckUtils]: 27: Hoare triple {1679#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {1679#false} is VALID [2018-11-14 18:56:28,098 INFO L256 TraceCheckUtils]: 28: Hoare triple {1679#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {1678#true} is VALID [2018-11-14 18:56:28,098 INFO L273 TraceCheckUtils]: 29: Hoare triple {1678#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1678#true} is VALID [2018-11-14 18:56:28,098 INFO L273 TraceCheckUtils]: 30: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:56:28,098 INFO L273 TraceCheckUtils]: 31: Hoare triple {1678#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1678#true} is VALID [2018-11-14 18:56:28,099 INFO L273 TraceCheckUtils]: 32: Hoare triple {1678#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1678#true} is VALID [2018-11-14 18:56:28,099 INFO L273 TraceCheckUtils]: 33: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:56:28,099 INFO L273 TraceCheckUtils]: 34: Hoare triple {1678#true} assume !(~i~0 < 100000); {1678#true} is VALID [2018-11-14 18:56:28,099 INFO L273 TraceCheckUtils]: 35: Hoare triple {1678#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1678#true} is VALID [2018-11-14 18:56:28,099 INFO L273 TraceCheckUtils]: 36: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:56:28,099 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {1678#true} {1679#false} #75#return; {1679#false} is VALID [2018-11-14 18:56:28,100 INFO L273 TraceCheckUtils]: 38: Hoare triple {1679#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {1679#false} is VALID [2018-11-14 18:56:28,100 INFO L273 TraceCheckUtils]: 39: Hoare triple {1679#false} assume true; {1679#false} is VALID [2018-11-14 18:56:28,100 INFO L273 TraceCheckUtils]: 40: Hoare triple {1679#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {1679#false} is VALID [2018-11-14 18:56:28,100 INFO L273 TraceCheckUtils]: 41: Hoare triple {1679#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {1679#false} is VALID [2018-11-14 18:56:28,100 INFO L273 TraceCheckUtils]: 42: Hoare triple {1679#false} assume true; {1679#false} is VALID [2018-11-14 18:56:28,100 INFO L273 TraceCheckUtils]: 43: Hoare triple {1679#false} assume !(~i~2 < 99999); {1679#false} is VALID [2018-11-14 18:56:28,101 INFO L273 TraceCheckUtils]: 44: Hoare triple {1679#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {1679#false} is VALID [2018-11-14 18:56:28,101 INFO L256 TraceCheckUtils]: 45: Hoare triple {1679#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {1678#true} is VALID [2018-11-14 18:56:28,101 INFO L273 TraceCheckUtils]: 46: Hoare triple {1678#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1678#true} is VALID [2018-11-14 18:56:28,101 INFO L273 TraceCheckUtils]: 47: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:56:28,101 INFO L273 TraceCheckUtils]: 48: Hoare triple {1678#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1678#true} is VALID [2018-11-14 18:56:28,101 INFO L273 TraceCheckUtils]: 49: Hoare triple {1678#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1678#true} is VALID [2018-11-14 18:56:28,102 INFO L273 TraceCheckUtils]: 50: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:56:28,102 INFO L273 TraceCheckUtils]: 51: Hoare triple {1678#true} assume !(~i~0 < 100000); {1678#true} is VALID [2018-11-14 18:56:28,102 INFO L273 TraceCheckUtils]: 52: Hoare triple {1678#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1678#true} is VALID [2018-11-14 18:56:28,102 INFO L273 TraceCheckUtils]: 53: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:56:28,102 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {1678#true} {1679#false} #77#return; {1679#false} is VALID [2018-11-14 18:56:28,102 INFO L273 TraceCheckUtils]: 55: Hoare triple {1679#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {1679#false} is VALID [2018-11-14 18:56:28,103 INFO L273 TraceCheckUtils]: 56: Hoare triple {1679#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {1679#false} is VALID [2018-11-14 18:56:28,103 INFO L273 TraceCheckUtils]: 57: Hoare triple {1679#false} assume !false; {1679#false} is VALID [2018-11-14 18:56:28,106 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-14 18:56:28,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:56:28,106 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-14 18:56:28,116 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:56:28,162 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-14 18:56:28,162 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:56:28,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:56:28,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:56:28,391 INFO L256 TraceCheckUtils]: 0: Hoare triple {1678#true} call ULTIMATE.init(); {1678#true} is VALID [2018-11-14 18:56:28,391 INFO L273 TraceCheckUtils]: 1: Hoare triple {1678#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1678#true} is VALID [2018-11-14 18:56:28,391 INFO L273 TraceCheckUtils]: 2: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:56:28,392 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1678#true} {1678#true} #69#return; {1678#true} is VALID [2018-11-14 18:56:28,392 INFO L256 TraceCheckUtils]: 4: Hoare triple {1678#true} call #t~ret13 := main(); {1678#true} is VALID [2018-11-14 18:56:28,392 INFO L273 TraceCheckUtils]: 5: Hoare triple {1678#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; {1678#true} is VALID [2018-11-14 18:56:28,393 INFO L273 TraceCheckUtils]: 6: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:56:28,393 INFO L273 TraceCheckUtils]: 7: Hoare triple {1678#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {1678#true} is VALID [2018-11-14 18:56:28,393 INFO L273 TraceCheckUtils]: 8: Hoare triple {1678#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {1678#true} is VALID [2018-11-14 18:56:28,393 INFO L273 TraceCheckUtils]: 9: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:56:28,393 INFO L273 TraceCheckUtils]: 10: Hoare triple {1678#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {1678#true} is VALID [2018-11-14 18:56:28,393 INFO L273 TraceCheckUtils]: 11: Hoare triple {1678#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {1678#true} is VALID [2018-11-14 18:56:28,394 INFO L273 TraceCheckUtils]: 12: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:56:28,394 INFO L273 TraceCheckUtils]: 13: Hoare triple {1678#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {1678#true} is VALID [2018-11-14 18:56:28,394 INFO L273 TraceCheckUtils]: 14: Hoare triple {1678#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {1678#true} is VALID [2018-11-14 18:56:28,394 INFO L273 TraceCheckUtils]: 15: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:56:28,394 INFO L273 TraceCheckUtils]: 16: Hoare triple {1678#true} assume !(~i~1 < 100000); {1678#true} is VALID [2018-11-14 18:56:28,394 INFO L256 TraceCheckUtils]: 17: Hoare triple {1678#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {1678#true} is VALID [2018-11-14 18:56:28,395 INFO L273 TraceCheckUtils]: 18: Hoare triple {1678#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1678#true} is VALID [2018-11-14 18:56:28,395 INFO L273 TraceCheckUtils]: 19: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:56:28,395 INFO L273 TraceCheckUtils]: 20: Hoare triple {1678#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1678#true} is VALID [2018-11-14 18:56:28,395 INFO L273 TraceCheckUtils]: 21: Hoare triple {1678#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1678#true} is VALID [2018-11-14 18:56:28,395 INFO L273 TraceCheckUtils]: 22: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:56:28,395 INFO L273 TraceCheckUtils]: 23: Hoare triple {1678#true} assume !(~i~0 < 100000); {1678#true} is VALID [2018-11-14 18:56:28,396 INFO L273 TraceCheckUtils]: 24: Hoare triple {1678#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1678#true} is VALID [2018-11-14 18:56:28,396 INFO L273 TraceCheckUtils]: 25: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:56:28,396 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1678#true} {1678#true} #73#return; {1678#true} is VALID [2018-11-14 18:56:28,396 INFO L273 TraceCheckUtils]: 27: Hoare triple {1678#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {1678#true} is VALID [2018-11-14 18:56:28,396 INFO L256 TraceCheckUtils]: 28: Hoare triple {1678#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {1678#true} is VALID [2018-11-14 18:56:28,396 INFO L273 TraceCheckUtils]: 29: Hoare triple {1678#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1678#true} is VALID [2018-11-14 18:56:28,397 INFO L273 TraceCheckUtils]: 30: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:56:28,397 INFO L273 TraceCheckUtils]: 31: Hoare triple {1678#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1678#true} is VALID [2018-11-14 18:56:28,397 INFO L273 TraceCheckUtils]: 32: Hoare triple {1678#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1678#true} is VALID [2018-11-14 18:56:28,397 INFO L273 TraceCheckUtils]: 33: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:56:28,397 INFO L273 TraceCheckUtils]: 34: Hoare triple {1678#true} assume !(~i~0 < 100000); {1678#true} is VALID [2018-11-14 18:56:28,397 INFO L273 TraceCheckUtils]: 35: Hoare triple {1678#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1678#true} is VALID [2018-11-14 18:56:28,398 INFO L273 TraceCheckUtils]: 36: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:56:28,398 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {1678#true} {1678#true} #75#return; {1678#true} is VALID [2018-11-14 18:56:28,398 INFO L273 TraceCheckUtils]: 38: Hoare triple {1678#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {1678#true} is VALID [2018-11-14 18:56:28,398 INFO L273 TraceCheckUtils]: 39: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:56:28,399 INFO L273 TraceCheckUtils]: 40: Hoare triple {1678#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {1678#true} is VALID [2018-11-14 18:56:28,399 INFO L273 TraceCheckUtils]: 41: Hoare triple {1678#true} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {1678#true} is VALID [2018-11-14 18:56:28,399 INFO L273 TraceCheckUtils]: 42: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 18:56:28,400 INFO L273 TraceCheckUtils]: 43: Hoare triple {1678#true} assume !(~i~2 < 99999); {1678#true} is VALID [2018-11-14 18:56:28,400 INFO L273 TraceCheckUtils]: 44: Hoare triple {1678#true} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {1678#true} is VALID [2018-11-14 18:56:28,400 INFO L256 TraceCheckUtils]: 45: Hoare triple {1678#true} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {1678#true} is VALID [2018-11-14 18:56:28,417 INFO L273 TraceCheckUtils]: 46: Hoare triple {1678#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1825#(<= xor_~i~0 1)} is VALID [2018-11-14 18:56:28,431 INFO L273 TraceCheckUtils]: 47: Hoare triple {1825#(<= xor_~i~0 1)} assume true; {1825#(<= xor_~i~0 1)} is VALID [2018-11-14 18:56:28,446 INFO L273 TraceCheckUtils]: 48: Hoare triple {1825#(<= xor_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1825#(<= xor_~i~0 1)} is VALID [2018-11-14 18:56:28,456 INFO L273 TraceCheckUtils]: 49: Hoare triple {1825#(<= xor_~i~0 1)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1835#(<= xor_~i~0 2)} is VALID [2018-11-14 18:56:28,457 INFO L273 TraceCheckUtils]: 50: Hoare triple {1835#(<= xor_~i~0 2)} assume true; {1835#(<= xor_~i~0 2)} is VALID [2018-11-14 18:56:28,459 INFO L273 TraceCheckUtils]: 51: Hoare triple {1835#(<= xor_~i~0 2)} assume !(~i~0 < 100000); {1679#false} is VALID [2018-11-14 18:56:28,459 INFO L273 TraceCheckUtils]: 52: Hoare triple {1679#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1679#false} is VALID [2018-11-14 18:56:28,459 INFO L273 TraceCheckUtils]: 53: Hoare triple {1679#false} assume true; {1679#false} is VALID [2018-11-14 18:56:28,459 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {1679#false} {1678#true} #77#return; {1679#false} is VALID [2018-11-14 18:56:28,459 INFO L273 TraceCheckUtils]: 55: Hoare triple {1679#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {1679#false} is VALID [2018-11-14 18:56:28,459 INFO L273 TraceCheckUtils]: 56: Hoare triple {1679#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {1679#false} is VALID [2018-11-14 18:56:28,460 INFO L273 TraceCheckUtils]: 57: Hoare triple {1679#false} assume !false; {1679#false} is VALID [2018-11-14 18:56:28,464 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-14 18:56:28,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:56:28,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-11-14 18:56:28,486 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2018-11-14 18:56:28,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:56:28,486 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 18:56:28,613 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:56:28,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 18:56:28,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 18:56:28,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-14 18:56:28,615 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 8 states. [2018-11-14 18:56:29,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:29,041 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2018-11-14 18:56:29,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 18:56:29,041 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2018-11-14 18:56:29,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:56:29,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 18:56:29,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2018-11-14 18:56:29,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 18:56:29,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2018-11-14 18:56:29,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 79 transitions. [2018-11-14 18:56:29,161 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-14 18:56:29,163 INFO L225 Difference]: With dead ends: 73 [2018-11-14 18:56:29,163 INFO L226 Difference]: Without dead ends: 49 [2018-11-14 18:56:29,165 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-14 18:56:29,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-14 18:56:29,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-11-14 18:56:29,186 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:56:29,187 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 47 states. [2018-11-14 18:56:29,187 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 47 states. [2018-11-14 18:56:29,187 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 47 states. [2018-11-14 18:56:29,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:29,189 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-14 18:56:29,189 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-14 18:56:29,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:56:29,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:56:29,190 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 49 states. [2018-11-14 18:56:29,191 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 49 states. [2018-11-14 18:56:29,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:29,193 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-14 18:56:29,193 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-14 18:56:29,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:56:29,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:56:29,194 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:56:29,194 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:56:29,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-14 18:56:29,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-11-14 18:56:29,197 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 58 [2018-11-14 18:56:29,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:56:29,197 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-11-14 18:56:29,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 18:56:29,197 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-14 18:56:29,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-14 18:56:29,198 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:56:29,199 INFO L375 BasicCegarLoop]: trace histogram [9, 6, 6, 5, 4, 4, 3, 3, 3, 3, 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-14 18:56:29,199 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:56:29,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:56:29,199 INFO L82 PathProgramCache]: Analyzing trace with hash -922884994, now seen corresponding path program 4 times [2018-11-14 18:56:29,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:56:29,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:56:29,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:56:29,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:56:29,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:56:29,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:56:29,363 INFO L256 TraceCheckUtils]: 0: Hoare triple {2121#true} call ULTIMATE.init(); {2121#true} is VALID [2018-11-14 18:56:29,364 INFO L273 TraceCheckUtils]: 1: Hoare triple {2121#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2121#true} is VALID [2018-11-14 18:56:29,364 INFO L273 TraceCheckUtils]: 2: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 18:56:29,365 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2121#true} {2121#true} #69#return; {2121#true} is VALID [2018-11-14 18:56:29,365 INFO L256 TraceCheckUtils]: 4: Hoare triple {2121#true} call #t~ret13 := main(); {2121#true} is VALID [2018-11-14 18:56:29,366 INFO L273 TraceCheckUtils]: 5: Hoare triple {2121#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; {2123#(= main_~i~1 0)} is VALID [2018-11-14 18:56:29,366 INFO L273 TraceCheckUtils]: 6: Hoare triple {2123#(= main_~i~1 0)} assume true; {2123#(= main_~i~1 0)} is VALID [2018-11-14 18:56:29,367 INFO L273 TraceCheckUtils]: 7: Hoare triple {2123#(= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {2123#(= main_~i~1 0)} is VALID [2018-11-14 18:56:29,367 INFO L273 TraceCheckUtils]: 8: Hoare triple {2123#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2124#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:29,368 INFO L273 TraceCheckUtils]: 9: Hoare triple {2124#(<= main_~i~1 1)} assume true; {2124#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:29,368 INFO L273 TraceCheckUtils]: 10: Hoare triple {2124#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {2124#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:29,368 INFO L273 TraceCheckUtils]: 11: Hoare triple {2124#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2125#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:29,369 INFO L273 TraceCheckUtils]: 12: Hoare triple {2125#(<= main_~i~1 2)} assume true; {2125#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:29,369 INFO L273 TraceCheckUtils]: 13: Hoare triple {2125#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {2125#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:29,370 INFO L273 TraceCheckUtils]: 14: Hoare triple {2125#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2126#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:29,371 INFO L273 TraceCheckUtils]: 15: Hoare triple {2126#(<= main_~i~1 3)} assume true; {2126#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:29,371 INFO L273 TraceCheckUtils]: 16: Hoare triple {2126#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {2126#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:29,372 INFO L273 TraceCheckUtils]: 17: Hoare triple {2126#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2127#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:29,373 INFO L273 TraceCheckUtils]: 18: Hoare triple {2127#(<= main_~i~1 4)} assume true; {2127#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:29,374 INFO L273 TraceCheckUtils]: 19: Hoare triple {2127#(<= main_~i~1 4)} assume !(~i~1 < 100000); {2122#false} is VALID [2018-11-14 18:56:29,374 INFO L256 TraceCheckUtils]: 20: Hoare triple {2122#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {2121#true} is VALID [2018-11-14 18:56:29,374 INFO L273 TraceCheckUtils]: 21: Hoare triple {2121#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2121#true} is VALID [2018-11-14 18:56:29,374 INFO L273 TraceCheckUtils]: 22: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 18:56:29,375 INFO L273 TraceCheckUtils]: 23: Hoare triple {2121#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2121#true} is VALID [2018-11-14 18:56:29,375 INFO L273 TraceCheckUtils]: 24: Hoare triple {2121#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2121#true} is VALID [2018-11-14 18:56:29,375 INFO L273 TraceCheckUtils]: 25: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 18:56:29,375 INFO L273 TraceCheckUtils]: 26: Hoare triple {2121#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2121#true} is VALID [2018-11-14 18:56:29,376 INFO L273 TraceCheckUtils]: 27: Hoare triple {2121#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2121#true} is VALID [2018-11-14 18:56:29,376 INFO L273 TraceCheckUtils]: 28: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 18:56:29,376 INFO L273 TraceCheckUtils]: 29: Hoare triple {2121#true} assume !(~i~0 < 100000); {2121#true} is VALID [2018-11-14 18:56:29,376 INFO L273 TraceCheckUtils]: 30: Hoare triple {2121#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2121#true} is VALID [2018-11-14 18:56:29,377 INFO L273 TraceCheckUtils]: 31: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 18:56:29,377 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {2121#true} {2122#false} #73#return; {2122#false} is VALID [2018-11-14 18:56:29,377 INFO L273 TraceCheckUtils]: 33: Hoare triple {2122#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {2122#false} is VALID [2018-11-14 18:56:29,377 INFO L256 TraceCheckUtils]: 34: Hoare triple {2122#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {2121#true} is VALID [2018-11-14 18:56:29,378 INFO L273 TraceCheckUtils]: 35: Hoare triple {2121#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2121#true} is VALID [2018-11-14 18:56:29,378 INFO L273 TraceCheckUtils]: 36: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 18:56:29,378 INFO L273 TraceCheckUtils]: 37: Hoare triple {2121#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2121#true} is VALID [2018-11-14 18:56:29,378 INFO L273 TraceCheckUtils]: 38: Hoare triple {2121#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2121#true} is VALID [2018-11-14 18:56:29,378 INFO L273 TraceCheckUtils]: 39: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 18:56:29,378 INFO L273 TraceCheckUtils]: 40: Hoare triple {2121#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2121#true} is VALID [2018-11-14 18:56:29,379 INFO L273 TraceCheckUtils]: 41: Hoare triple {2121#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2121#true} is VALID [2018-11-14 18:56:29,379 INFO L273 TraceCheckUtils]: 42: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 18:56:29,379 INFO L273 TraceCheckUtils]: 43: Hoare triple {2121#true} assume !(~i~0 < 100000); {2121#true} is VALID [2018-11-14 18:56:29,379 INFO L273 TraceCheckUtils]: 44: Hoare triple {2121#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2121#true} is VALID [2018-11-14 18:56:29,379 INFO L273 TraceCheckUtils]: 45: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 18:56:29,379 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {2121#true} {2122#false} #75#return; {2122#false} is VALID [2018-11-14 18:56:29,380 INFO L273 TraceCheckUtils]: 47: Hoare triple {2122#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {2122#false} is VALID [2018-11-14 18:56:29,380 INFO L273 TraceCheckUtils]: 48: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 18:56:29,380 INFO L273 TraceCheckUtils]: 49: Hoare triple {2122#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {2122#false} is VALID [2018-11-14 18:56:29,380 INFO L273 TraceCheckUtils]: 50: Hoare triple {2122#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {2122#false} is VALID [2018-11-14 18:56:29,380 INFO L273 TraceCheckUtils]: 51: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 18:56:29,380 INFO L273 TraceCheckUtils]: 52: Hoare triple {2122#false} assume !(~i~2 < 99999); {2122#false} is VALID [2018-11-14 18:56:29,380 INFO L273 TraceCheckUtils]: 53: Hoare triple {2122#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {2122#false} is VALID [2018-11-14 18:56:29,381 INFO L256 TraceCheckUtils]: 54: Hoare triple {2122#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {2121#true} is VALID [2018-11-14 18:56:29,381 INFO L273 TraceCheckUtils]: 55: Hoare triple {2121#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2121#true} is VALID [2018-11-14 18:56:29,381 INFO L273 TraceCheckUtils]: 56: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 18:56:29,381 INFO L273 TraceCheckUtils]: 57: Hoare triple {2121#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2121#true} is VALID [2018-11-14 18:56:29,381 INFO L273 TraceCheckUtils]: 58: Hoare triple {2121#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2121#true} is VALID [2018-11-14 18:56:29,381 INFO L273 TraceCheckUtils]: 59: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 18:56:29,382 INFO L273 TraceCheckUtils]: 60: Hoare triple {2121#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2121#true} is VALID [2018-11-14 18:56:29,382 INFO L273 TraceCheckUtils]: 61: Hoare triple {2121#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2121#true} is VALID [2018-11-14 18:56:29,382 INFO L273 TraceCheckUtils]: 62: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 18:56:29,382 INFO L273 TraceCheckUtils]: 63: Hoare triple {2121#true} assume !(~i~0 < 100000); {2121#true} is VALID [2018-11-14 18:56:29,382 INFO L273 TraceCheckUtils]: 64: Hoare triple {2121#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2121#true} is VALID [2018-11-14 18:56:29,382 INFO L273 TraceCheckUtils]: 65: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 18:56:29,383 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {2121#true} {2122#false} #77#return; {2122#false} is VALID [2018-11-14 18:56:29,383 INFO L273 TraceCheckUtils]: 67: Hoare triple {2122#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {2122#false} is VALID [2018-11-14 18:56:29,383 INFO L273 TraceCheckUtils]: 68: Hoare triple {2122#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {2122#false} is VALID [2018-11-14 18:56:29,383 INFO L273 TraceCheckUtils]: 69: Hoare triple {2122#false} assume !false; {2122#false} is VALID [2018-11-14 18:56:29,388 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-11-14 18:56:29,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:56:29,388 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-14 18:56:29,419 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:56:29,474 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:56:29,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:56:29,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:56:29,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:56:30,129 INFO L256 TraceCheckUtils]: 0: Hoare triple {2121#true} call ULTIMATE.init(); {2121#true} is VALID [2018-11-14 18:56:30,129 INFO L273 TraceCheckUtils]: 1: Hoare triple {2121#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2121#true} is VALID [2018-11-14 18:56:30,130 INFO L273 TraceCheckUtils]: 2: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 18:56:30,130 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2121#true} {2121#true} #69#return; {2121#true} is VALID [2018-11-14 18:56:30,130 INFO L256 TraceCheckUtils]: 4: Hoare triple {2121#true} call #t~ret13 := main(); {2121#true} is VALID [2018-11-14 18:56:30,131 INFO L273 TraceCheckUtils]: 5: Hoare triple {2121#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; {2146#(<= main_~i~1 0)} is VALID [2018-11-14 18:56:30,131 INFO L273 TraceCheckUtils]: 6: Hoare triple {2146#(<= main_~i~1 0)} assume true; {2146#(<= main_~i~1 0)} is VALID [2018-11-14 18:56:30,132 INFO L273 TraceCheckUtils]: 7: Hoare triple {2146#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {2146#(<= main_~i~1 0)} is VALID [2018-11-14 18:56:30,132 INFO L273 TraceCheckUtils]: 8: Hoare triple {2146#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2124#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:30,133 INFO L273 TraceCheckUtils]: 9: Hoare triple {2124#(<= main_~i~1 1)} assume true; {2124#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:30,133 INFO L273 TraceCheckUtils]: 10: Hoare triple {2124#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {2124#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:30,133 INFO L273 TraceCheckUtils]: 11: Hoare triple {2124#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2125#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:30,134 INFO L273 TraceCheckUtils]: 12: Hoare triple {2125#(<= main_~i~1 2)} assume true; {2125#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:30,134 INFO L273 TraceCheckUtils]: 13: Hoare triple {2125#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {2125#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:30,135 INFO L273 TraceCheckUtils]: 14: Hoare triple {2125#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2126#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:30,136 INFO L273 TraceCheckUtils]: 15: Hoare triple {2126#(<= main_~i~1 3)} assume true; {2126#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:30,136 INFO L273 TraceCheckUtils]: 16: Hoare triple {2126#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {2126#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:30,137 INFO L273 TraceCheckUtils]: 17: Hoare triple {2126#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2127#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:30,138 INFO L273 TraceCheckUtils]: 18: Hoare triple {2127#(<= main_~i~1 4)} assume true; {2127#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:30,138 INFO L273 TraceCheckUtils]: 19: Hoare triple {2127#(<= main_~i~1 4)} assume !(~i~1 < 100000); {2122#false} is VALID [2018-11-14 18:56:30,138 INFO L256 TraceCheckUtils]: 20: Hoare triple {2122#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {2122#false} is VALID [2018-11-14 18:56:30,139 INFO L273 TraceCheckUtils]: 21: Hoare triple {2122#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2122#false} is VALID [2018-11-14 18:56:30,139 INFO L273 TraceCheckUtils]: 22: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 18:56:30,139 INFO L273 TraceCheckUtils]: 23: Hoare triple {2122#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2122#false} is VALID [2018-11-14 18:56:30,139 INFO L273 TraceCheckUtils]: 24: Hoare triple {2122#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2122#false} is VALID [2018-11-14 18:56:30,139 INFO L273 TraceCheckUtils]: 25: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 18:56:30,140 INFO L273 TraceCheckUtils]: 26: Hoare triple {2122#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2122#false} is VALID [2018-11-14 18:56:30,140 INFO L273 TraceCheckUtils]: 27: Hoare triple {2122#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2122#false} is VALID [2018-11-14 18:56:30,140 INFO L273 TraceCheckUtils]: 28: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 18:56:30,140 INFO L273 TraceCheckUtils]: 29: Hoare triple {2122#false} assume !(~i~0 < 100000); {2122#false} is VALID [2018-11-14 18:56:30,140 INFO L273 TraceCheckUtils]: 30: Hoare triple {2122#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2122#false} is VALID [2018-11-14 18:56:30,141 INFO L273 TraceCheckUtils]: 31: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 18:56:30,141 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {2122#false} {2122#false} #73#return; {2122#false} is VALID [2018-11-14 18:56:30,141 INFO L273 TraceCheckUtils]: 33: Hoare triple {2122#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {2122#false} is VALID [2018-11-14 18:56:30,141 INFO L256 TraceCheckUtils]: 34: Hoare triple {2122#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {2122#false} is VALID [2018-11-14 18:56:30,142 INFO L273 TraceCheckUtils]: 35: Hoare triple {2122#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2122#false} is VALID [2018-11-14 18:56:30,142 INFO L273 TraceCheckUtils]: 36: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 18:56:30,142 INFO L273 TraceCheckUtils]: 37: Hoare triple {2122#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2122#false} is VALID [2018-11-14 18:56:30,142 INFO L273 TraceCheckUtils]: 38: Hoare triple {2122#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2122#false} is VALID [2018-11-14 18:56:30,142 INFO L273 TraceCheckUtils]: 39: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 18:56:30,143 INFO L273 TraceCheckUtils]: 40: Hoare triple {2122#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2122#false} is VALID [2018-11-14 18:56:30,143 INFO L273 TraceCheckUtils]: 41: Hoare triple {2122#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2122#false} is VALID [2018-11-14 18:56:30,143 INFO L273 TraceCheckUtils]: 42: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 18:56:30,143 INFO L273 TraceCheckUtils]: 43: Hoare triple {2122#false} assume !(~i~0 < 100000); {2122#false} is VALID [2018-11-14 18:56:30,143 INFO L273 TraceCheckUtils]: 44: Hoare triple {2122#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2122#false} is VALID [2018-11-14 18:56:30,144 INFO L273 TraceCheckUtils]: 45: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 18:56:30,144 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {2122#false} {2122#false} #75#return; {2122#false} is VALID [2018-11-14 18:56:30,144 INFO L273 TraceCheckUtils]: 47: Hoare triple {2122#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {2122#false} is VALID [2018-11-14 18:56:30,144 INFO L273 TraceCheckUtils]: 48: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 18:56:30,144 INFO L273 TraceCheckUtils]: 49: Hoare triple {2122#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {2122#false} is VALID [2018-11-14 18:56:30,144 INFO L273 TraceCheckUtils]: 50: Hoare triple {2122#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {2122#false} is VALID [2018-11-14 18:56:30,145 INFO L273 TraceCheckUtils]: 51: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 18:56:30,145 INFO L273 TraceCheckUtils]: 52: Hoare triple {2122#false} assume !(~i~2 < 99999); {2122#false} is VALID [2018-11-14 18:56:30,145 INFO L273 TraceCheckUtils]: 53: Hoare triple {2122#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {2122#false} is VALID [2018-11-14 18:56:30,145 INFO L256 TraceCheckUtils]: 54: Hoare triple {2122#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {2122#false} is VALID [2018-11-14 18:56:30,145 INFO L273 TraceCheckUtils]: 55: Hoare triple {2122#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2122#false} is VALID [2018-11-14 18:56:30,145 INFO L273 TraceCheckUtils]: 56: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 18:56:30,145 INFO L273 TraceCheckUtils]: 57: Hoare triple {2122#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2122#false} is VALID [2018-11-14 18:56:30,146 INFO L273 TraceCheckUtils]: 58: Hoare triple {2122#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2122#false} is VALID [2018-11-14 18:56:30,146 INFO L273 TraceCheckUtils]: 59: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 18:56:30,146 INFO L273 TraceCheckUtils]: 60: Hoare triple {2122#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2122#false} is VALID [2018-11-14 18:56:30,146 INFO L273 TraceCheckUtils]: 61: Hoare triple {2122#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2122#false} is VALID [2018-11-14 18:56:30,147 INFO L273 TraceCheckUtils]: 62: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 18:56:30,147 INFO L273 TraceCheckUtils]: 63: Hoare triple {2122#false} assume !(~i~0 < 100000); {2122#false} is VALID [2018-11-14 18:56:30,147 INFO L273 TraceCheckUtils]: 64: Hoare triple {2122#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2122#false} is VALID [2018-11-14 18:56:30,147 INFO L273 TraceCheckUtils]: 65: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 18:56:30,147 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {2122#false} {2122#false} #77#return; {2122#false} is VALID [2018-11-14 18:56:30,148 INFO L273 TraceCheckUtils]: 67: Hoare triple {2122#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {2122#false} is VALID [2018-11-14 18:56:30,148 INFO L273 TraceCheckUtils]: 68: Hoare triple {2122#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {2122#false} is VALID [2018-11-14 18:56:30,148 INFO L273 TraceCheckUtils]: 69: Hoare triple {2122#false} assume !false; {2122#false} is VALID [2018-11-14 18:56:30,154 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-11-14 18:56:30,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:56:30,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-14 18:56:30,179 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2018-11-14 18:56:30,180 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:56:30,181 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 18:56:30,277 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-14 18:56:30,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 18:56:30,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 18:56:30,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 18:56:30,278 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 8 states. [2018-11-14 18:56:30,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:30,501 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2018-11-14 18:56:30,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 18:56:30,501 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2018-11-14 18:56:30,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:56:30,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 18:56:30,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2018-11-14 18:56:30,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 18:56:30,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2018-11-14 18:56:30,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 72 transitions. [2018-11-14 18:56:30,615 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:56:30,617 INFO L225 Difference]: With dead ends: 78 [2018-11-14 18:56:30,617 INFO L226 Difference]: Without dead ends: 51 [2018-11-14 18:56:30,618 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 18:56:30,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-14 18:56:30,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-11-14 18:56:30,662 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:56:30,662 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 50 states. [2018-11-14 18:56:30,662 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 50 states. [2018-11-14 18:56:30,662 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 50 states. [2018-11-14 18:56:30,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:30,665 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-11-14 18:56:30,666 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-14 18:56:30,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:56:30,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:56:30,666 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 51 states. [2018-11-14 18:56:30,666 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 51 states. [2018-11-14 18:56:30,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:30,669 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-11-14 18:56:30,669 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-14 18:56:30,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:56:30,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:56:30,669 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:56:30,669 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:56:30,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-14 18:56:30,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-11-14 18:56:30,672 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 70 [2018-11-14 18:56:30,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:56:30,672 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-11-14 18:56:30,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 18:56:30,672 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-14 18:56:30,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-14 18:56:30,673 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:56:30,673 INFO L375 BasicCegarLoop]: trace histogram [9, 6, 6, 6, 5, 5, 3, 3, 3, 3, 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-14 18:56:30,673 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:56:30,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:56:30,674 INFO L82 PathProgramCache]: Analyzing trace with hash 222834040, now seen corresponding path program 5 times [2018-11-14 18:56:30,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:56:30,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:56:30,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:56:30,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:56:30,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:56:30,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:56:30,891 INFO L256 TraceCheckUtils]: 0: Hoare triple {2615#true} call ULTIMATE.init(); {2615#true} is VALID [2018-11-14 18:56:30,892 INFO L273 TraceCheckUtils]: 1: Hoare triple {2615#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2615#true} is VALID [2018-11-14 18:56:30,892 INFO L273 TraceCheckUtils]: 2: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 18:56:30,892 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2615#true} {2615#true} #69#return; {2615#true} is VALID [2018-11-14 18:56:30,892 INFO L256 TraceCheckUtils]: 4: Hoare triple {2615#true} call #t~ret13 := main(); {2615#true} is VALID [2018-11-14 18:56:30,893 INFO L273 TraceCheckUtils]: 5: Hoare triple {2615#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; {2617#(= main_~i~1 0)} is VALID [2018-11-14 18:56:30,893 INFO L273 TraceCheckUtils]: 6: Hoare triple {2617#(= main_~i~1 0)} assume true; {2617#(= main_~i~1 0)} is VALID [2018-11-14 18:56:30,894 INFO L273 TraceCheckUtils]: 7: Hoare triple {2617#(= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {2617#(= main_~i~1 0)} is VALID [2018-11-14 18:56:30,895 INFO L273 TraceCheckUtils]: 8: Hoare triple {2617#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2618#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:30,895 INFO L273 TraceCheckUtils]: 9: Hoare triple {2618#(<= main_~i~1 1)} assume true; {2618#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:30,896 INFO L273 TraceCheckUtils]: 10: Hoare triple {2618#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {2618#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:30,896 INFO L273 TraceCheckUtils]: 11: Hoare triple {2618#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2619#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:30,896 INFO L273 TraceCheckUtils]: 12: Hoare triple {2619#(<= main_~i~1 2)} assume true; {2619#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:30,897 INFO L273 TraceCheckUtils]: 13: Hoare triple {2619#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {2619#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:30,897 INFO L273 TraceCheckUtils]: 14: Hoare triple {2619#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2620#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:30,898 INFO L273 TraceCheckUtils]: 15: Hoare triple {2620#(<= main_~i~1 3)} assume true; {2620#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:30,898 INFO L273 TraceCheckUtils]: 16: Hoare triple {2620#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {2620#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:30,899 INFO L273 TraceCheckUtils]: 17: Hoare triple {2620#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2621#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:30,900 INFO L273 TraceCheckUtils]: 18: Hoare triple {2621#(<= main_~i~1 4)} assume true; {2621#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:30,900 INFO L273 TraceCheckUtils]: 19: Hoare triple {2621#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {2621#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:30,901 INFO L273 TraceCheckUtils]: 20: Hoare triple {2621#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2622#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:30,902 INFO L273 TraceCheckUtils]: 21: Hoare triple {2622#(<= main_~i~1 5)} assume true; {2622#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:30,902 INFO L273 TraceCheckUtils]: 22: Hoare triple {2622#(<= main_~i~1 5)} assume !(~i~1 < 100000); {2616#false} is VALID [2018-11-14 18:56:30,903 INFO L256 TraceCheckUtils]: 23: Hoare triple {2616#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {2615#true} is VALID [2018-11-14 18:56:30,903 INFO L273 TraceCheckUtils]: 24: Hoare triple {2615#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2615#true} is VALID [2018-11-14 18:56:30,903 INFO L273 TraceCheckUtils]: 25: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 18:56:30,903 INFO L273 TraceCheckUtils]: 26: Hoare triple {2615#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2615#true} is VALID [2018-11-14 18:56:30,904 INFO L273 TraceCheckUtils]: 27: Hoare triple {2615#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2615#true} is VALID [2018-11-14 18:56:30,904 INFO L273 TraceCheckUtils]: 28: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 18:56:30,904 INFO L273 TraceCheckUtils]: 29: Hoare triple {2615#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2615#true} is VALID [2018-11-14 18:56:30,904 INFO L273 TraceCheckUtils]: 30: Hoare triple {2615#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2615#true} is VALID [2018-11-14 18:56:30,904 INFO L273 TraceCheckUtils]: 31: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 18:56:30,904 INFO L273 TraceCheckUtils]: 32: Hoare triple {2615#true} assume !(~i~0 < 100000); {2615#true} is VALID [2018-11-14 18:56:30,905 INFO L273 TraceCheckUtils]: 33: Hoare triple {2615#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2615#true} is VALID [2018-11-14 18:56:30,905 INFO L273 TraceCheckUtils]: 34: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 18:56:30,905 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {2615#true} {2616#false} #73#return; {2616#false} is VALID [2018-11-14 18:56:30,905 INFO L273 TraceCheckUtils]: 36: Hoare triple {2616#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {2616#false} is VALID [2018-11-14 18:56:30,905 INFO L256 TraceCheckUtils]: 37: Hoare triple {2616#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {2615#true} is VALID [2018-11-14 18:56:30,905 INFO L273 TraceCheckUtils]: 38: Hoare triple {2615#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2615#true} is VALID [2018-11-14 18:56:30,905 INFO L273 TraceCheckUtils]: 39: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 18:56:30,905 INFO L273 TraceCheckUtils]: 40: Hoare triple {2615#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2615#true} is VALID [2018-11-14 18:56:30,906 INFO L273 TraceCheckUtils]: 41: Hoare triple {2615#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2615#true} is VALID [2018-11-14 18:56:30,906 INFO L273 TraceCheckUtils]: 42: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 18:56:30,906 INFO L273 TraceCheckUtils]: 43: Hoare triple {2615#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2615#true} is VALID [2018-11-14 18:56:30,906 INFO L273 TraceCheckUtils]: 44: Hoare triple {2615#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2615#true} is VALID [2018-11-14 18:56:30,906 INFO L273 TraceCheckUtils]: 45: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 18:56:30,906 INFO L273 TraceCheckUtils]: 46: Hoare triple {2615#true} assume !(~i~0 < 100000); {2615#true} is VALID [2018-11-14 18:56:30,906 INFO L273 TraceCheckUtils]: 47: Hoare triple {2615#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2615#true} is VALID [2018-11-14 18:56:30,906 INFO L273 TraceCheckUtils]: 48: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 18:56:30,907 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {2615#true} {2616#false} #75#return; {2616#false} is VALID [2018-11-14 18:56:30,907 INFO L273 TraceCheckUtils]: 50: Hoare triple {2616#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {2616#false} is VALID [2018-11-14 18:56:30,907 INFO L273 TraceCheckUtils]: 51: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 18:56:30,907 INFO L273 TraceCheckUtils]: 52: Hoare triple {2616#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {2616#false} is VALID [2018-11-14 18:56:30,907 INFO L273 TraceCheckUtils]: 53: Hoare triple {2616#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {2616#false} is VALID [2018-11-14 18:56:30,907 INFO L273 TraceCheckUtils]: 54: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 18:56:30,907 INFO L273 TraceCheckUtils]: 55: Hoare triple {2616#false} assume !(~i~2 < 99999); {2616#false} is VALID [2018-11-14 18:56:30,907 INFO L273 TraceCheckUtils]: 56: Hoare triple {2616#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {2616#false} is VALID [2018-11-14 18:56:30,907 INFO L256 TraceCheckUtils]: 57: Hoare triple {2616#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {2615#true} is VALID [2018-11-14 18:56:30,908 INFO L273 TraceCheckUtils]: 58: Hoare triple {2615#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2615#true} is VALID [2018-11-14 18:56:30,908 INFO L273 TraceCheckUtils]: 59: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 18:56:30,908 INFO L273 TraceCheckUtils]: 60: Hoare triple {2615#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2615#true} is VALID [2018-11-14 18:56:30,908 INFO L273 TraceCheckUtils]: 61: Hoare triple {2615#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2615#true} is VALID [2018-11-14 18:56:30,908 INFO L273 TraceCheckUtils]: 62: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 18:56:30,908 INFO L273 TraceCheckUtils]: 63: Hoare triple {2615#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2615#true} is VALID [2018-11-14 18:56:30,908 INFO L273 TraceCheckUtils]: 64: Hoare triple {2615#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2615#true} is VALID [2018-11-14 18:56:30,908 INFO L273 TraceCheckUtils]: 65: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 18:56:30,909 INFO L273 TraceCheckUtils]: 66: Hoare triple {2615#true} assume !(~i~0 < 100000); {2615#true} is VALID [2018-11-14 18:56:30,909 INFO L273 TraceCheckUtils]: 67: Hoare triple {2615#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2615#true} is VALID [2018-11-14 18:56:30,909 INFO L273 TraceCheckUtils]: 68: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 18:56:30,909 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {2615#true} {2616#false} #77#return; {2616#false} is VALID [2018-11-14 18:56:30,909 INFO L273 TraceCheckUtils]: 70: Hoare triple {2616#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {2616#false} is VALID [2018-11-14 18:56:30,909 INFO L273 TraceCheckUtils]: 71: Hoare triple {2616#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {2616#false} is VALID [2018-11-14 18:56:30,909 INFO L273 TraceCheckUtils]: 72: Hoare triple {2616#false} assume !false; {2616#false} is VALID [2018-11-14 18:56:30,912 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-11-14 18:56:30,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:56:30,912 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-14 18:56:30,923 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 18:56:30,997 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-14 18:56:30,997 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:56:31,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:56:31,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:56:31,185 INFO L256 TraceCheckUtils]: 0: Hoare triple {2615#true} call ULTIMATE.init(); {2615#true} is VALID [2018-11-14 18:56:31,185 INFO L273 TraceCheckUtils]: 1: Hoare triple {2615#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2615#true} is VALID [2018-11-14 18:56:31,186 INFO L273 TraceCheckUtils]: 2: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 18:56:31,186 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2615#true} {2615#true} #69#return; {2615#true} is VALID [2018-11-14 18:56:31,186 INFO L256 TraceCheckUtils]: 4: Hoare triple {2615#true} call #t~ret13 := main(); {2615#true} is VALID [2018-11-14 18:56:31,186 INFO L273 TraceCheckUtils]: 5: Hoare triple {2615#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; {2615#true} is VALID [2018-11-14 18:56:31,187 INFO L273 TraceCheckUtils]: 6: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 18:56:31,187 INFO L273 TraceCheckUtils]: 7: Hoare triple {2615#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2615#true} is VALID [2018-11-14 18:56:31,187 INFO L273 TraceCheckUtils]: 8: Hoare triple {2615#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2615#true} is VALID [2018-11-14 18:56:31,187 INFO L273 TraceCheckUtils]: 9: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 18:56:31,188 INFO L273 TraceCheckUtils]: 10: Hoare triple {2615#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2615#true} is VALID [2018-11-14 18:56:31,188 INFO L273 TraceCheckUtils]: 11: Hoare triple {2615#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2615#true} is VALID [2018-11-14 18:56:31,188 INFO L273 TraceCheckUtils]: 12: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 18:56:31,188 INFO L273 TraceCheckUtils]: 13: Hoare triple {2615#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2615#true} is VALID [2018-11-14 18:56:31,188 INFO L273 TraceCheckUtils]: 14: Hoare triple {2615#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2615#true} is VALID [2018-11-14 18:56:31,188 INFO L273 TraceCheckUtils]: 15: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 18:56:31,189 INFO L273 TraceCheckUtils]: 16: Hoare triple {2615#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2615#true} is VALID [2018-11-14 18:56:31,189 INFO L273 TraceCheckUtils]: 17: Hoare triple {2615#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2615#true} is VALID [2018-11-14 18:56:31,189 INFO L273 TraceCheckUtils]: 18: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 18:56:31,189 INFO L273 TraceCheckUtils]: 19: Hoare triple {2615#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2615#true} is VALID [2018-11-14 18:56:31,189 INFO L273 TraceCheckUtils]: 20: Hoare triple {2615#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2615#true} is VALID [2018-11-14 18:56:31,189 INFO L273 TraceCheckUtils]: 21: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 18:56:31,189 INFO L273 TraceCheckUtils]: 22: Hoare triple {2615#true} assume !(~i~1 < 100000); {2615#true} is VALID [2018-11-14 18:56:31,190 INFO L256 TraceCheckUtils]: 23: Hoare triple {2615#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {2615#true} is VALID [2018-11-14 18:56:31,190 INFO L273 TraceCheckUtils]: 24: Hoare triple {2615#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2698#(<= xor_~i~0 1)} is VALID [2018-11-14 18:56:31,191 INFO L273 TraceCheckUtils]: 25: Hoare triple {2698#(<= xor_~i~0 1)} assume true; {2698#(<= xor_~i~0 1)} is VALID [2018-11-14 18:56:31,191 INFO L273 TraceCheckUtils]: 26: Hoare triple {2698#(<= xor_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2698#(<= xor_~i~0 1)} is VALID [2018-11-14 18:56:31,192 INFO L273 TraceCheckUtils]: 27: Hoare triple {2698#(<= xor_~i~0 1)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2708#(<= xor_~i~0 2)} is VALID [2018-11-14 18:56:31,192 INFO L273 TraceCheckUtils]: 28: Hoare triple {2708#(<= xor_~i~0 2)} assume true; {2708#(<= xor_~i~0 2)} is VALID [2018-11-14 18:56:31,192 INFO L273 TraceCheckUtils]: 29: Hoare triple {2708#(<= xor_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2708#(<= xor_~i~0 2)} is VALID [2018-11-14 18:56:31,193 INFO L273 TraceCheckUtils]: 30: Hoare triple {2708#(<= xor_~i~0 2)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2718#(<= xor_~i~0 3)} is VALID [2018-11-14 18:56:31,193 INFO L273 TraceCheckUtils]: 31: Hoare triple {2718#(<= xor_~i~0 3)} assume true; {2718#(<= xor_~i~0 3)} is VALID [2018-11-14 18:56:31,194 INFO L273 TraceCheckUtils]: 32: Hoare triple {2718#(<= xor_~i~0 3)} assume !(~i~0 < 100000); {2616#false} is VALID [2018-11-14 18:56:31,194 INFO L273 TraceCheckUtils]: 33: Hoare triple {2616#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2616#false} is VALID [2018-11-14 18:56:31,194 INFO L273 TraceCheckUtils]: 34: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 18:56:31,195 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {2616#false} {2615#true} #73#return; {2616#false} is VALID [2018-11-14 18:56:31,195 INFO L273 TraceCheckUtils]: 36: Hoare triple {2616#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {2616#false} is VALID [2018-11-14 18:56:31,195 INFO L256 TraceCheckUtils]: 37: Hoare triple {2616#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {2616#false} is VALID [2018-11-14 18:56:31,196 INFO L273 TraceCheckUtils]: 38: Hoare triple {2616#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2616#false} is VALID [2018-11-14 18:56:31,196 INFO L273 TraceCheckUtils]: 39: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 18:56:31,196 INFO L273 TraceCheckUtils]: 40: Hoare triple {2616#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2616#false} is VALID [2018-11-14 18:56:31,197 INFO L273 TraceCheckUtils]: 41: Hoare triple {2616#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2616#false} is VALID [2018-11-14 18:56:31,197 INFO L273 TraceCheckUtils]: 42: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 18:56:31,197 INFO L273 TraceCheckUtils]: 43: Hoare triple {2616#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2616#false} is VALID [2018-11-14 18:56:31,198 INFO L273 TraceCheckUtils]: 44: Hoare triple {2616#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2616#false} is VALID [2018-11-14 18:56:31,198 INFO L273 TraceCheckUtils]: 45: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 18:56:31,198 INFO L273 TraceCheckUtils]: 46: Hoare triple {2616#false} assume !(~i~0 < 100000); {2616#false} is VALID [2018-11-14 18:56:31,198 INFO L273 TraceCheckUtils]: 47: Hoare triple {2616#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2616#false} is VALID [2018-11-14 18:56:31,199 INFO L273 TraceCheckUtils]: 48: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 18:56:31,199 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {2616#false} {2616#false} #75#return; {2616#false} is VALID [2018-11-14 18:56:31,199 INFO L273 TraceCheckUtils]: 50: Hoare triple {2616#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {2616#false} is VALID [2018-11-14 18:56:31,199 INFO L273 TraceCheckUtils]: 51: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 18:56:31,199 INFO L273 TraceCheckUtils]: 52: Hoare triple {2616#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {2616#false} is VALID [2018-11-14 18:56:31,200 INFO L273 TraceCheckUtils]: 53: Hoare triple {2616#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {2616#false} is VALID [2018-11-14 18:56:31,200 INFO L273 TraceCheckUtils]: 54: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 18:56:31,200 INFO L273 TraceCheckUtils]: 55: Hoare triple {2616#false} assume !(~i~2 < 99999); {2616#false} is VALID [2018-11-14 18:56:31,200 INFO L273 TraceCheckUtils]: 56: Hoare triple {2616#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {2616#false} is VALID [2018-11-14 18:56:31,201 INFO L256 TraceCheckUtils]: 57: Hoare triple {2616#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {2616#false} is VALID [2018-11-14 18:56:31,201 INFO L273 TraceCheckUtils]: 58: Hoare triple {2616#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2616#false} is VALID [2018-11-14 18:56:31,201 INFO L273 TraceCheckUtils]: 59: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 18:56:31,201 INFO L273 TraceCheckUtils]: 60: Hoare triple {2616#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2616#false} is VALID [2018-11-14 18:56:31,201 INFO L273 TraceCheckUtils]: 61: Hoare triple {2616#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2616#false} is VALID [2018-11-14 18:56:31,202 INFO L273 TraceCheckUtils]: 62: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 18:56:31,202 INFO L273 TraceCheckUtils]: 63: Hoare triple {2616#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2616#false} is VALID [2018-11-14 18:56:31,202 INFO L273 TraceCheckUtils]: 64: Hoare triple {2616#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2616#false} is VALID [2018-11-14 18:56:31,202 INFO L273 TraceCheckUtils]: 65: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 18:56:31,203 INFO L273 TraceCheckUtils]: 66: Hoare triple {2616#false} assume !(~i~0 < 100000); {2616#false} is VALID [2018-11-14 18:56:31,203 INFO L273 TraceCheckUtils]: 67: Hoare triple {2616#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2616#false} is VALID [2018-11-14 18:56:31,203 INFO L273 TraceCheckUtils]: 68: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 18:56:31,203 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {2616#false} {2616#false} #77#return; {2616#false} is VALID [2018-11-14 18:56:31,203 INFO L273 TraceCheckUtils]: 70: Hoare triple {2616#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {2616#false} is VALID [2018-11-14 18:56:31,204 INFO L273 TraceCheckUtils]: 71: Hoare triple {2616#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {2616#false} is VALID [2018-11-14 18:56:31,204 INFO L273 TraceCheckUtils]: 72: Hoare triple {2616#false} assume !false; {2616#false} is VALID [2018-11-14 18:56:31,208 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 46 proven. 7 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-11-14 18:56:31,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:56:31,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-11-14 18:56:31,240 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 73 [2018-11-14 18:56:31,241 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:56:31,241 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 18:56:31,402 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:56:31,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 18:56:31,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 18:56:31,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-14 18:56:31,403 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 11 states. [2018-11-14 18:56:32,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:32,166 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2018-11-14 18:56:32,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 18:56:32,166 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 73 [2018-11-14 18:56:32,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:56:32,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 18:56:32,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 88 transitions. [2018-11-14 18:56:32,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 18:56:32,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 88 transitions. [2018-11-14 18:56:32,170 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 88 transitions. [2018-11-14 18:56:32,252 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-14 18:56:32,253 INFO L225 Difference]: With dead ends: 85 [2018-11-14 18:56:32,254 INFO L226 Difference]: Without dead ends: 58 [2018-11-14 18:56:32,255 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 71 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-14 18:56:32,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-14 18:56:32,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-11-14 18:56:32,271 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:56:32,271 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 56 states. [2018-11-14 18:56:32,271 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 56 states. [2018-11-14 18:56:32,271 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 56 states. [2018-11-14 18:56:32,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:32,274 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-11-14 18:56:32,275 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-11-14 18:56:32,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:56:32,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:56:32,276 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 58 states. [2018-11-14 18:56:32,276 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 58 states. [2018-11-14 18:56:32,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:32,279 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-11-14 18:56:32,279 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-11-14 18:56:32,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:56:32,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:56:32,279 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:56:32,279 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:56:32,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-14 18:56:32,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-11-14 18:56:32,282 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 73 [2018-11-14 18:56:32,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:56:32,283 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-11-14 18:56:32,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 18:56:32,283 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-11-14 18:56:32,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-14 18:56:32,284 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:56:32,284 INFO L375 BasicCegarLoop]: trace histogram [12, 9, 9, 7, 6, 6, 3, 3, 3, 3, 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-14 18:56:32,284 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:56:32,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:56:32,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1472368537, now seen corresponding path program 6 times [2018-11-14 18:56:32,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:56:32,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:56:32,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:56:32,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:56:32,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:56:32,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:56:32,731 INFO L256 TraceCheckUtils]: 0: Hoare triple {3152#true} call ULTIMATE.init(); {3152#true} is VALID [2018-11-14 18:56:32,732 INFO L273 TraceCheckUtils]: 1: Hoare triple {3152#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3152#true} is VALID [2018-11-14 18:56:32,732 INFO L273 TraceCheckUtils]: 2: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:56:32,732 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3152#true} {3152#true} #69#return; {3152#true} is VALID [2018-11-14 18:56:32,732 INFO L256 TraceCheckUtils]: 4: Hoare triple {3152#true} call #t~ret13 := main(); {3152#true} is VALID [2018-11-14 18:56:32,733 INFO L273 TraceCheckUtils]: 5: Hoare triple {3152#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; {3154#(= main_~i~1 0)} is VALID [2018-11-14 18:56:32,734 INFO L273 TraceCheckUtils]: 6: Hoare triple {3154#(= main_~i~1 0)} assume true; {3154#(= main_~i~1 0)} is VALID [2018-11-14 18:56:32,734 INFO L273 TraceCheckUtils]: 7: Hoare triple {3154#(= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {3154#(= main_~i~1 0)} is VALID [2018-11-14 18:56:32,734 INFO L273 TraceCheckUtils]: 8: Hoare triple {3154#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3155#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:32,735 INFO L273 TraceCheckUtils]: 9: Hoare triple {3155#(<= main_~i~1 1)} assume true; {3155#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:32,735 INFO L273 TraceCheckUtils]: 10: Hoare triple {3155#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {3155#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:32,736 INFO L273 TraceCheckUtils]: 11: Hoare triple {3155#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3156#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:32,736 INFO L273 TraceCheckUtils]: 12: Hoare triple {3156#(<= main_~i~1 2)} assume true; {3156#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:32,737 INFO L273 TraceCheckUtils]: 13: Hoare triple {3156#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {3156#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:32,737 INFO L273 TraceCheckUtils]: 14: Hoare triple {3156#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3157#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:32,738 INFO L273 TraceCheckUtils]: 15: Hoare triple {3157#(<= main_~i~1 3)} assume true; {3157#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:32,738 INFO L273 TraceCheckUtils]: 16: Hoare triple {3157#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {3157#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:32,739 INFO L273 TraceCheckUtils]: 17: Hoare triple {3157#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3158#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:32,740 INFO L273 TraceCheckUtils]: 18: Hoare triple {3158#(<= main_~i~1 4)} assume true; {3158#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:32,740 INFO L273 TraceCheckUtils]: 19: Hoare triple {3158#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {3158#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:32,741 INFO L273 TraceCheckUtils]: 20: Hoare triple {3158#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3159#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:32,741 INFO L273 TraceCheckUtils]: 21: Hoare triple {3159#(<= main_~i~1 5)} assume true; {3159#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:32,742 INFO L273 TraceCheckUtils]: 22: Hoare triple {3159#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {3159#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:32,743 INFO L273 TraceCheckUtils]: 23: Hoare triple {3159#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3160#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:32,743 INFO L273 TraceCheckUtils]: 24: Hoare triple {3160#(<= main_~i~1 6)} assume true; {3160#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:32,744 INFO L273 TraceCheckUtils]: 25: Hoare triple {3160#(<= main_~i~1 6)} assume !(~i~1 < 100000); {3153#false} is VALID [2018-11-14 18:56:32,744 INFO L256 TraceCheckUtils]: 26: Hoare triple {3153#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {3152#true} is VALID [2018-11-14 18:56:32,744 INFO L273 TraceCheckUtils]: 27: Hoare triple {3152#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3152#true} is VALID [2018-11-14 18:56:32,744 INFO L273 TraceCheckUtils]: 28: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:56:32,744 INFO L273 TraceCheckUtils]: 29: Hoare triple {3152#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 18:56:32,745 INFO L273 TraceCheckUtils]: 30: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 18:56:32,745 INFO L273 TraceCheckUtils]: 31: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:56:32,745 INFO L273 TraceCheckUtils]: 32: Hoare triple {3152#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 18:56:32,745 INFO L273 TraceCheckUtils]: 33: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 18:56:32,745 INFO L273 TraceCheckUtils]: 34: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:56:32,746 INFO L273 TraceCheckUtils]: 35: Hoare triple {3152#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 18:56:32,746 INFO L273 TraceCheckUtils]: 36: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 18:56:32,746 INFO L273 TraceCheckUtils]: 37: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:56:32,746 INFO L273 TraceCheckUtils]: 38: Hoare triple {3152#true} assume !(~i~0 < 100000); {3152#true} is VALID [2018-11-14 18:56:32,746 INFO L273 TraceCheckUtils]: 39: Hoare triple {3152#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3152#true} is VALID [2018-11-14 18:56:32,747 INFO L273 TraceCheckUtils]: 40: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:56:32,747 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {3152#true} {3153#false} #73#return; {3153#false} is VALID [2018-11-14 18:56:32,747 INFO L273 TraceCheckUtils]: 42: Hoare triple {3153#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {3153#false} is VALID [2018-11-14 18:56:32,747 INFO L256 TraceCheckUtils]: 43: Hoare triple {3153#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {3152#true} is VALID [2018-11-14 18:56:32,747 INFO L273 TraceCheckUtils]: 44: Hoare triple {3152#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3152#true} is VALID [2018-11-14 18:56:32,747 INFO L273 TraceCheckUtils]: 45: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:56:32,747 INFO L273 TraceCheckUtils]: 46: Hoare triple {3152#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 18:56:32,747 INFO L273 TraceCheckUtils]: 47: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 18:56:32,748 INFO L273 TraceCheckUtils]: 48: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:56:32,748 INFO L273 TraceCheckUtils]: 49: Hoare triple {3152#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 18:56:32,748 INFO L273 TraceCheckUtils]: 50: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 18:56:32,748 INFO L273 TraceCheckUtils]: 51: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:56:32,748 INFO L273 TraceCheckUtils]: 52: Hoare triple {3152#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 18:56:32,748 INFO L273 TraceCheckUtils]: 53: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 18:56:32,748 INFO L273 TraceCheckUtils]: 54: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:56:32,748 INFO L273 TraceCheckUtils]: 55: Hoare triple {3152#true} assume !(~i~0 < 100000); {3152#true} is VALID [2018-11-14 18:56:32,749 INFO L273 TraceCheckUtils]: 56: Hoare triple {3152#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3152#true} is VALID [2018-11-14 18:56:32,749 INFO L273 TraceCheckUtils]: 57: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:56:32,749 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {3152#true} {3153#false} #75#return; {3153#false} is VALID [2018-11-14 18:56:32,749 INFO L273 TraceCheckUtils]: 59: Hoare triple {3153#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {3153#false} is VALID [2018-11-14 18:56:32,749 INFO L273 TraceCheckUtils]: 60: Hoare triple {3153#false} assume true; {3153#false} is VALID [2018-11-14 18:56:32,749 INFO L273 TraceCheckUtils]: 61: Hoare triple {3153#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {3153#false} is VALID [2018-11-14 18:56:32,749 INFO L273 TraceCheckUtils]: 62: Hoare triple {3153#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {3153#false} is VALID [2018-11-14 18:56:32,749 INFO L273 TraceCheckUtils]: 63: Hoare triple {3153#false} assume true; {3153#false} is VALID [2018-11-14 18:56:32,750 INFO L273 TraceCheckUtils]: 64: Hoare triple {3153#false} assume !(~i~2 < 99999); {3153#false} is VALID [2018-11-14 18:56:32,750 INFO L273 TraceCheckUtils]: 65: Hoare triple {3153#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {3153#false} is VALID [2018-11-14 18:56:32,750 INFO L256 TraceCheckUtils]: 66: Hoare triple {3153#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {3152#true} is VALID [2018-11-14 18:56:32,750 INFO L273 TraceCheckUtils]: 67: Hoare triple {3152#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3152#true} is VALID [2018-11-14 18:56:32,750 INFO L273 TraceCheckUtils]: 68: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:56:32,750 INFO L273 TraceCheckUtils]: 69: Hoare triple {3152#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 18:56:32,750 INFO L273 TraceCheckUtils]: 70: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 18:56:32,750 INFO L273 TraceCheckUtils]: 71: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:56:32,750 INFO L273 TraceCheckUtils]: 72: Hoare triple {3152#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 18:56:32,751 INFO L273 TraceCheckUtils]: 73: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 18:56:32,751 INFO L273 TraceCheckUtils]: 74: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:56:32,751 INFO L273 TraceCheckUtils]: 75: Hoare triple {3152#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 18:56:32,751 INFO L273 TraceCheckUtils]: 76: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 18:56:32,751 INFO L273 TraceCheckUtils]: 77: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:56:32,751 INFO L273 TraceCheckUtils]: 78: Hoare triple {3152#true} assume !(~i~0 < 100000); {3152#true} is VALID [2018-11-14 18:56:32,751 INFO L273 TraceCheckUtils]: 79: Hoare triple {3152#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3152#true} is VALID [2018-11-14 18:56:32,752 INFO L273 TraceCheckUtils]: 80: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:56:32,752 INFO L268 TraceCheckUtils]: 81: Hoare quadruple {3152#true} {3153#false} #77#return; {3153#false} is VALID [2018-11-14 18:56:32,752 INFO L273 TraceCheckUtils]: 82: Hoare triple {3153#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {3153#false} is VALID [2018-11-14 18:56:32,752 INFO L273 TraceCheckUtils]: 83: Hoare triple {3153#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {3153#false} is VALID [2018-11-14 18:56:32,752 INFO L273 TraceCheckUtils]: 84: Hoare triple {3153#false} assume !false; {3153#false} is VALID [2018-11-14 18:56:32,757 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-11-14 18:56:32,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:56:32,757 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-14 18:56:32,770 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 18:56:32,874 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-11-14 18:56:32,874 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:56:32,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:56:32,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:56:33,179 INFO L256 TraceCheckUtils]: 0: Hoare triple {3152#true} call ULTIMATE.init(); {3152#true} is VALID [2018-11-14 18:56:33,179 INFO L273 TraceCheckUtils]: 1: Hoare triple {3152#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3152#true} is VALID [2018-11-14 18:56:33,179 INFO L273 TraceCheckUtils]: 2: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:56:33,180 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3152#true} {3152#true} #69#return; {3152#true} is VALID [2018-11-14 18:56:33,180 INFO L256 TraceCheckUtils]: 4: Hoare triple {3152#true} call #t~ret13 := main(); {3152#true} is VALID [2018-11-14 18:56:33,180 INFO L273 TraceCheckUtils]: 5: Hoare triple {3152#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; {3152#true} is VALID [2018-11-14 18:56:33,180 INFO L273 TraceCheckUtils]: 6: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:56:33,180 INFO L273 TraceCheckUtils]: 7: Hoare triple {3152#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3152#true} is VALID [2018-11-14 18:56:33,181 INFO L273 TraceCheckUtils]: 8: Hoare triple {3152#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3152#true} is VALID [2018-11-14 18:56:33,181 INFO L273 TraceCheckUtils]: 9: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:56:33,181 INFO L273 TraceCheckUtils]: 10: Hoare triple {3152#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3152#true} is VALID [2018-11-14 18:56:33,181 INFO L273 TraceCheckUtils]: 11: Hoare triple {3152#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3152#true} is VALID [2018-11-14 18:56:33,181 INFO L273 TraceCheckUtils]: 12: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:56:33,181 INFO L273 TraceCheckUtils]: 13: Hoare triple {3152#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3152#true} is VALID [2018-11-14 18:56:33,182 INFO L273 TraceCheckUtils]: 14: Hoare triple {3152#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3152#true} is VALID [2018-11-14 18:56:33,182 INFO L273 TraceCheckUtils]: 15: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:56:33,182 INFO L273 TraceCheckUtils]: 16: Hoare triple {3152#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3152#true} is VALID [2018-11-14 18:56:33,182 INFO L273 TraceCheckUtils]: 17: Hoare triple {3152#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3152#true} is VALID [2018-11-14 18:56:33,182 INFO L273 TraceCheckUtils]: 18: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:56:33,182 INFO L273 TraceCheckUtils]: 19: Hoare triple {3152#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3152#true} is VALID [2018-11-14 18:56:33,183 INFO L273 TraceCheckUtils]: 20: Hoare triple {3152#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3152#true} is VALID [2018-11-14 18:56:33,183 INFO L273 TraceCheckUtils]: 21: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:56:33,183 INFO L273 TraceCheckUtils]: 22: Hoare triple {3152#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3152#true} is VALID [2018-11-14 18:56:33,183 INFO L273 TraceCheckUtils]: 23: Hoare triple {3152#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3152#true} is VALID [2018-11-14 18:56:33,183 INFO L273 TraceCheckUtils]: 24: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:56:33,183 INFO L273 TraceCheckUtils]: 25: Hoare triple {3152#true} assume !(~i~1 < 100000); {3152#true} is VALID [2018-11-14 18:56:33,184 INFO L256 TraceCheckUtils]: 26: Hoare triple {3152#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {3152#true} is VALID [2018-11-14 18:56:33,184 INFO L273 TraceCheckUtils]: 27: Hoare triple {3152#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3152#true} is VALID [2018-11-14 18:56:33,184 INFO L273 TraceCheckUtils]: 28: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:56:33,184 INFO L273 TraceCheckUtils]: 29: Hoare triple {3152#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 18:56:33,184 INFO L273 TraceCheckUtils]: 30: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 18:56:33,184 INFO L273 TraceCheckUtils]: 31: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:56:33,184 INFO L273 TraceCheckUtils]: 32: Hoare triple {3152#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 18:56:33,184 INFO L273 TraceCheckUtils]: 33: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 18:56:33,185 INFO L273 TraceCheckUtils]: 34: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:56:33,185 INFO L273 TraceCheckUtils]: 35: Hoare triple {3152#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 18:56:33,185 INFO L273 TraceCheckUtils]: 36: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 18:56:33,185 INFO L273 TraceCheckUtils]: 37: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:56:33,185 INFO L273 TraceCheckUtils]: 38: Hoare triple {3152#true} assume !(~i~0 < 100000); {3152#true} is VALID [2018-11-14 18:56:33,185 INFO L273 TraceCheckUtils]: 39: Hoare triple {3152#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3152#true} is VALID [2018-11-14 18:56:33,185 INFO L273 TraceCheckUtils]: 40: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:56:33,185 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {3152#true} {3152#true} #73#return; {3152#true} is VALID [2018-11-14 18:56:33,186 INFO L273 TraceCheckUtils]: 42: Hoare triple {3152#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {3152#true} is VALID [2018-11-14 18:56:33,186 INFO L256 TraceCheckUtils]: 43: Hoare triple {3152#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {3152#true} is VALID [2018-11-14 18:56:33,186 INFO L273 TraceCheckUtils]: 44: Hoare triple {3152#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3152#true} is VALID [2018-11-14 18:56:33,186 INFO L273 TraceCheckUtils]: 45: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:56:33,186 INFO L273 TraceCheckUtils]: 46: Hoare triple {3152#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 18:56:33,186 INFO L273 TraceCheckUtils]: 47: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 18:56:33,186 INFO L273 TraceCheckUtils]: 48: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:56:33,186 INFO L273 TraceCheckUtils]: 49: Hoare triple {3152#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 18:56:33,186 INFO L273 TraceCheckUtils]: 50: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 18:56:33,187 INFO L273 TraceCheckUtils]: 51: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:56:33,187 INFO L273 TraceCheckUtils]: 52: Hoare triple {3152#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 18:56:33,187 INFO L273 TraceCheckUtils]: 53: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 18:56:33,187 INFO L273 TraceCheckUtils]: 54: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:56:33,187 INFO L273 TraceCheckUtils]: 55: Hoare triple {3152#true} assume !(~i~0 < 100000); {3152#true} is VALID [2018-11-14 18:56:33,187 INFO L273 TraceCheckUtils]: 56: Hoare triple {3152#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3152#true} is VALID [2018-11-14 18:56:33,187 INFO L273 TraceCheckUtils]: 57: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 18:56:33,187 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {3152#true} {3152#true} #75#return; {3152#true} is VALID [2018-11-14 18:56:33,192 INFO L273 TraceCheckUtils]: 59: Hoare triple {3152#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {3341#(<= main_~i~2 0)} is VALID [2018-11-14 18:56:33,192 INFO L273 TraceCheckUtils]: 60: Hoare triple {3341#(<= main_~i~2 0)} assume true; {3341#(<= main_~i~2 0)} is VALID [2018-11-14 18:56:33,194 INFO L273 TraceCheckUtils]: 61: Hoare triple {3341#(<= main_~i~2 0)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {3341#(<= main_~i~2 0)} is VALID [2018-11-14 18:56:33,194 INFO L273 TraceCheckUtils]: 62: Hoare triple {3341#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {3351#(<= main_~i~2 1)} is VALID [2018-11-14 18:56:33,196 INFO L273 TraceCheckUtils]: 63: Hoare triple {3351#(<= main_~i~2 1)} assume true; {3351#(<= main_~i~2 1)} is VALID [2018-11-14 18:56:33,196 INFO L273 TraceCheckUtils]: 64: Hoare triple {3351#(<= main_~i~2 1)} assume !(~i~2 < 99999); {3153#false} is VALID [2018-11-14 18:56:33,196 INFO L273 TraceCheckUtils]: 65: Hoare triple {3153#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {3153#false} is VALID [2018-11-14 18:56:33,196 INFO L256 TraceCheckUtils]: 66: Hoare triple {3153#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {3153#false} is VALID [2018-11-14 18:56:33,197 INFO L273 TraceCheckUtils]: 67: Hoare triple {3153#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3153#false} is VALID [2018-11-14 18:56:33,197 INFO L273 TraceCheckUtils]: 68: Hoare triple {3153#false} assume true; {3153#false} is VALID [2018-11-14 18:56:33,197 INFO L273 TraceCheckUtils]: 69: Hoare triple {3153#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3153#false} is VALID [2018-11-14 18:56:33,197 INFO L273 TraceCheckUtils]: 70: Hoare triple {3153#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3153#false} is VALID [2018-11-14 18:56:33,197 INFO L273 TraceCheckUtils]: 71: Hoare triple {3153#false} assume true; {3153#false} is VALID [2018-11-14 18:56:33,197 INFO L273 TraceCheckUtils]: 72: Hoare triple {3153#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3153#false} is VALID [2018-11-14 18:56:33,197 INFO L273 TraceCheckUtils]: 73: Hoare triple {3153#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3153#false} is VALID [2018-11-14 18:56:33,197 INFO L273 TraceCheckUtils]: 74: Hoare triple {3153#false} assume true; {3153#false} is VALID [2018-11-14 18:56:33,198 INFO L273 TraceCheckUtils]: 75: Hoare triple {3153#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3153#false} is VALID [2018-11-14 18:56:33,198 INFO L273 TraceCheckUtils]: 76: Hoare triple {3153#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3153#false} is VALID [2018-11-14 18:56:33,198 INFO L273 TraceCheckUtils]: 77: Hoare triple {3153#false} assume true; {3153#false} is VALID [2018-11-14 18:56:33,198 INFO L273 TraceCheckUtils]: 78: Hoare triple {3153#false} assume !(~i~0 < 100000); {3153#false} is VALID [2018-11-14 18:56:33,198 INFO L273 TraceCheckUtils]: 79: Hoare triple {3153#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3153#false} is VALID [2018-11-14 18:56:33,198 INFO L273 TraceCheckUtils]: 80: Hoare triple {3153#false} assume true; {3153#false} is VALID [2018-11-14 18:56:33,198 INFO L268 TraceCheckUtils]: 81: Hoare quadruple {3153#false} {3153#false} #77#return; {3153#false} is VALID [2018-11-14 18:56:33,199 INFO L273 TraceCheckUtils]: 82: Hoare triple {3153#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {3153#false} is VALID [2018-11-14 18:56:33,199 INFO L273 TraceCheckUtils]: 83: Hoare triple {3153#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {3153#false} is VALID [2018-11-14 18:56:33,199 INFO L273 TraceCheckUtils]: 84: Hoare triple {3153#false} assume !false; {3153#false} is VALID [2018-11-14 18:56:33,203 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 90 proven. 2 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-11-14 18:56:33,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:56:33,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2018-11-14 18:56:33,225 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 85 [2018-11-14 18:56:33,226 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:56:33,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 18:56:33,326 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-14 18:56:33,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 18:56:33,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 18:56:33,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-14 18:56:33,327 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 11 states. [2018-11-14 18:56:33,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:33,665 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2018-11-14 18:56:33,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 18:56:33,665 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 85 [2018-11-14 18:56:33,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:56:33,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 18:56:33,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 85 transitions. [2018-11-14 18:56:33,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 18:56:33,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 85 transitions. [2018-11-14 18:56:33,669 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 85 transitions. [2018-11-14 18:56:33,783 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:56:33,785 INFO L225 Difference]: With dead ends: 94 [2018-11-14 18:56:33,785 INFO L226 Difference]: Without dead ends: 64 [2018-11-14 18:56:33,786 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-14 18:56:33,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-14 18:56:33,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-11-14 18:56:33,811 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:56:33,811 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 62 states. [2018-11-14 18:56:33,811 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 62 states. [2018-11-14 18:56:33,812 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 62 states. [2018-11-14 18:56:33,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:33,814 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-11-14 18:56:33,815 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-11-14 18:56:33,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:56:33,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:56:33,815 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 64 states. [2018-11-14 18:56:33,816 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 64 states. [2018-11-14 18:56:33,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:33,817 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-11-14 18:56:33,817 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-11-14 18:56:33,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:56:33,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:56:33,818 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:56:33,818 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:56:33,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-14 18:56:33,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2018-11-14 18:56:33,820 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 85 [2018-11-14 18:56:33,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:56:33,821 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2018-11-14 18:56:33,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 18:56:33,821 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2018-11-14 18:56:33,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-14 18:56:33,822 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:56:33,822 INFO L375 BasicCegarLoop]: trace histogram [12, 9, 9, 8, 7, 7, 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] [2018-11-14 18:56:33,822 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:56:33,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:56:33,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1537898689, now seen corresponding path program 7 times [2018-11-14 18:56:33,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:56:33,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:56:33,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:56:33,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:56:33,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:56:33,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:56:34,002 INFO L256 TraceCheckUtils]: 0: Hoare triple {3757#true} call ULTIMATE.init(); {3757#true} is VALID [2018-11-14 18:56:34,002 INFO L273 TraceCheckUtils]: 1: Hoare triple {3757#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3757#true} is VALID [2018-11-14 18:56:34,003 INFO L273 TraceCheckUtils]: 2: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 18:56:34,003 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3757#true} {3757#true} #69#return; {3757#true} is VALID [2018-11-14 18:56:34,003 INFO L256 TraceCheckUtils]: 4: Hoare triple {3757#true} call #t~ret13 := main(); {3757#true} is VALID [2018-11-14 18:56:34,004 INFO L273 TraceCheckUtils]: 5: Hoare triple {3757#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; {3759#(= main_~i~1 0)} is VALID [2018-11-14 18:56:34,004 INFO L273 TraceCheckUtils]: 6: Hoare triple {3759#(= main_~i~1 0)} assume true; {3759#(= main_~i~1 0)} is VALID [2018-11-14 18:56:34,004 INFO L273 TraceCheckUtils]: 7: Hoare triple {3759#(= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {3759#(= main_~i~1 0)} is VALID [2018-11-14 18:56:34,005 INFO L273 TraceCheckUtils]: 8: Hoare triple {3759#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3760#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:34,005 INFO L273 TraceCheckUtils]: 9: Hoare triple {3760#(<= main_~i~1 1)} assume true; {3760#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:34,005 INFO L273 TraceCheckUtils]: 10: Hoare triple {3760#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {3760#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:34,006 INFO L273 TraceCheckUtils]: 11: Hoare triple {3760#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3761#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:34,006 INFO L273 TraceCheckUtils]: 12: Hoare triple {3761#(<= main_~i~1 2)} assume true; {3761#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:34,007 INFO L273 TraceCheckUtils]: 13: Hoare triple {3761#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {3761#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:34,007 INFO L273 TraceCheckUtils]: 14: Hoare triple {3761#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3762#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:34,008 INFO L273 TraceCheckUtils]: 15: Hoare triple {3762#(<= main_~i~1 3)} assume true; {3762#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:34,008 INFO L273 TraceCheckUtils]: 16: Hoare triple {3762#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {3762#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:34,009 INFO L273 TraceCheckUtils]: 17: Hoare triple {3762#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3763#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:34,010 INFO L273 TraceCheckUtils]: 18: Hoare triple {3763#(<= main_~i~1 4)} assume true; {3763#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:34,010 INFO L273 TraceCheckUtils]: 19: Hoare triple {3763#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {3763#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:34,011 INFO L273 TraceCheckUtils]: 20: Hoare triple {3763#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3764#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:34,011 INFO L273 TraceCheckUtils]: 21: Hoare triple {3764#(<= main_~i~1 5)} assume true; {3764#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:34,012 INFO L273 TraceCheckUtils]: 22: Hoare triple {3764#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {3764#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:34,013 INFO L273 TraceCheckUtils]: 23: Hoare triple {3764#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3765#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:34,013 INFO L273 TraceCheckUtils]: 24: Hoare triple {3765#(<= main_~i~1 6)} assume true; {3765#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:34,014 INFO L273 TraceCheckUtils]: 25: Hoare triple {3765#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {3765#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:34,014 INFO L273 TraceCheckUtils]: 26: Hoare triple {3765#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3766#(<= main_~i~1 7)} is VALID [2018-11-14 18:56:34,015 INFO L273 TraceCheckUtils]: 27: Hoare triple {3766#(<= main_~i~1 7)} assume true; {3766#(<= main_~i~1 7)} is VALID [2018-11-14 18:56:34,016 INFO L273 TraceCheckUtils]: 28: Hoare triple {3766#(<= main_~i~1 7)} assume !(~i~1 < 100000); {3758#false} is VALID [2018-11-14 18:56:34,016 INFO L256 TraceCheckUtils]: 29: Hoare triple {3758#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {3757#true} is VALID [2018-11-14 18:56:34,016 INFO L273 TraceCheckUtils]: 30: Hoare triple {3757#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3757#true} is VALID [2018-11-14 18:56:34,016 INFO L273 TraceCheckUtils]: 31: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 18:56:34,017 INFO L273 TraceCheckUtils]: 32: Hoare triple {3757#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3757#true} is VALID [2018-11-14 18:56:34,017 INFO L273 TraceCheckUtils]: 33: Hoare triple {3757#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3757#true} is VALID [2018-11-14 18:56:34,017 INFO L273 TraceCheckUtils]: 34: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 18:56:34,017 INFO L273 TraceCheckUtils]: 35: Hoare triple {3757#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3757#true} is VALID [2018-11-14 18:56:34,017 INFO L273 TraceCheckUtils]: 36: Hoare triple {3757#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3757#true} is VALID [2018-11-14 18:56:34,018 INFO L273 TraceCheckUtils]: 37: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 18:56:34,018 INFO L273 TraceCheckUtils]: 38: Hoare triple {3757#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3757#true} is VALID [2018-11-14 18:56:34,018 INFO L273 TraceCheckUtils]: 39: Hoare triple {3757#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3757#true} is VALID [2018-11-14 18:56:34,018 INFO L273 TraceCheckUtils]: 40: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 18:56:34,018 INFO L273 TraceCheckUtils]: 41: Hoare triple {3757#true} assume !(~i~0 < 100000); {3757#true} is VALID [2018-11-14 18:56:34,019 INFO L273 TraceCheckUtils]: 42: Hoare triple {3757#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3757#true} is VALID [2018-11-14 18:56:34,019 INFO L273 TraceCheckUtils]: 43: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 18:56:34,019 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {3757#true} {3758#false} #73#return; {3758#false} is VALID [2018-11-14 18:56:34,019 INFO L273 TraceCheckUtils]: 45: Hoare triple {3758#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {3758#false} is VALID [2018-11-14 18:56:34,019 INFO L256 TraceCheckUtils]: 46: Hoare triple {3758#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {3757#true} is VALID [2018-11-14 18:56:34,019 INFO L273 TraceCheckUtils]: 47: Hoare triple {3757#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3757#true} is VALID [2018-11-14 18:56:34,020 INFO L273 TraceCheckUtils]: 48: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 18:56:34,020 INFO L273 TraceCheckUtils]: 49: Hoare triple {3757#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3757#true} is VALID [2018-11-14 18:56:34,020 INFO L273 TraceCheckUtils]: 50: Hoare triple {3757#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3757#true} is VALID [2018-11-14 18:56:34,020 INFO L273 TraceCheckUtils]: 51: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 18:56:34,020 INFO L273 TraceCheckUtils]: 52: Hoare triple {3757#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3757#true} is VALID [2018-11-14 18:56:34,020 INFO L273 TraceCheckUtils]: 53: Hoare triple {3757#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3757#true} is VALID [2018-11-14 18:56:34,020 INFO L273 TraceCheckUtils]: 54: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 18:56:34,020 INFO L273 TraceCheckUtils]: 55: Hoare triple {3757#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3757#true} is VALID [2018-11-14 18:56:34,021 INFO L273 TraceCheckUtils]: 56: Hoare triple {3757#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3757#true} is VALID [2018-11-14 18:56:34,021 INFO L273 TraceCheckUtils]: 57: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 18:56:34,021 INFO L273 TraceCheckUtils]: 58: Hoare triple {3757#true} assume !(~i~0 < 100000); {3757#true} is VALID [2018-11-14 18:56:34,021 INFO L273 TraceCheckUtils]: 59: Hoare triple {3757#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3757#true} is VALID [2018-11-14 18:56:34,021 INFO L273 TraceCheckUtils]: 60: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 18:56:34,021 INFO L268 TraceCheckUtils]: 61: Hoare quadruple {3757#true} {3758#false} #75#return; {3758#false} is VALID [2018-11-14 18:56:34,021 INFO L273 TraceCheckUtils]: 62: Hoare triple {3758#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {3758#false} is VALID [2018-11-14 18:56:34,021 INFO L273 TraceCheckUtils]: 63: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 18:56:34,022 INFO L273 TraceCheckUtils]: 64: Hoare triple {3758#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {3758#false} is VALID [2018-11-14 18:56:34,022 INFO L273 TraceCheckUtils]: 65: Hoare triple {3758#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {3758#false} is VALID [2018-11-14 18:56:34,022 INFO L273 TraceCheckUtils]: 66: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 18:56:34,022 INFO L273 TraceCheckUtils]: 67: Hoare triple {3758#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {3758#false} is VALID [2018-11-14 18:56:34,022 INFO L273 TraceCheckUtils]: 68: Hoare triple {3758#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {3758#false} is VALID [2018-11-14 18:56:34,022 INFO L273 TraceCheckUtils]: 69: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 18:56:34,022 INFO L273 TraceCheckUtils]: 70: Hoare triple {3758#false} assume !(~i~2 < 99999); {3758#false} is VALID [2018-11-14 18:56:34,022 INFO L273 TraceCheckUtils]: 71: Hoare triple {3758#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {3758#false} is VALID [2018-11-14 18:56:34,022 INFO L256 TraceCheckUtils]: 72: Hoare triple {3758#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {3757#true} is VALID [2018-11-14 18:56:34,023 INFO L273 TraceCheckUtils]: 73: Hoare triple {3757#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3757#true} is VALID [2018-11-14 18:56:34,023 INFO L273 TraceCheckUtils]: 74: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 18:56:34,023 INFO L273 TraceCheckUtils]: 75: Hoare triple {3757#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3757#true} is VALID [2018-11-14 18:56:34,023 INFO L273 TraceCheckUtils]: 76: Hoare triple {3757#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3757#true} is VALID [2018-11-14 18:56:34,023 INFO L273 TraceCheckUtils]: 77: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 18:56:34,023 INFO L273 TraceCheckUtils]: 78: Hoare triple {3757#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3757#true} is VALID [2018-11-14 18:56:34,023 INFO L273 TraceCheckUtils]: 79: Hoare triple {3757#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3757#true} is VALID [2018-11-14 18:56:34,023 INFO L273 TraceCheckUtils]: 80: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 18:56:34,024 INFO L273 TraceCheckUtils]: 81: Hoare triple {3757#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3757#true} is VALID [2018-11-14 18:56:34,024 INFO L273 TraceCheckUtils]: 82: Hoare triple {3757#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3757#true} is VALID [2018-11-14 18:56:34,024 INFO L273 TraceCheckUtils]: 83: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 18:56:34,024 INFO L273 TraceCheckUtils]: 84: Hoare triple {3757#true} assume !(~i~0 < 100000); {3757#true} is VALID [2018-11-14 18:56:34,024 INFO L273 TraceCheckUtils]: 85: Hoare triple {3757#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3757#true} is VALID [2018-11-14 18:56:34,024 INFO L273 TraceCheckUtils]: 86: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 18:56:34,024 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {3757#true} {3758#false} #77#return; {3758#false} is VALID [2018-11-14 18:56:34,024 INFO L273 TraceCheckUtils]: 88: Hoare triple {3758#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {3758#false} is VALID [2018-11-14 18:56:34,025 INFO L273 TraceCheckUtils]: 89: Hoare triple {3758#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {3758#false} is VALID [2018-11-14 18:56:34,025 INFO L273 TraceCheckUtils]: 90: Hoare triple {3758#false} assume !false; {3758#false} is VALID [2018-11-14 18:56:34,029 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-14 18:56:34,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:56:34,030 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-14 18:56:34,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:56:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:56:34,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:56:34,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:56:34,300 INFO L256 TraceCheckUtils]: 0: Hoare triple {3757#true} call ULTIMATE.init(); {3757#true} is VALID [2018-11-14 18:56:34,301 INFO L273 TraceCheckUtils]: 1: Hoare triple {3757#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3757#true} is VALID [2018-11-14 18:56:34,301 INFO L273 TraceCheckUtils]: 2: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 18:56:34,301 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3757#true} {3757#true} #69#return; {3757#true} is VALID [2018-11-14 18:56:34,302 INFO L256 TraceCheckUtils]: 4: Hoare triple {3757#true} call #t~ret13 := main(); {3757#true} is VALID [2018-11-14 18:56:34,302 INFO L273 TraceCheckUtils]: 5: Hoare triple {3757#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; {3785#(<= main_~i~1 0)} is VALID [2018-11-14 18:56:34,303 INFO L273 TraceCheckUtils]: 6: Hoare triple {3785#(<= main_~i~1 0)} assume true; {3785#(<= main_~i~1 0)} is VALID [2018-11-14 18:56:34,303 INFO L273 TraceCheckUtils]: 7: Hoare triple {3785#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {3785#(<= main_~i~1 0)} is VALID [2018-11-14 18:56:34,304 INFO L273 TraceCheckUtils]: 8: Hoare triple {3785#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3760#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:34,304 INFO L273 TraceCheckUtils]: 9: Hoare triple {3760#(<= main_~i~1 1)} assume true; {3760#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:34,304 INFO L273 TraceCheckUtils]: 10: Hoare triple {3760#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {3760#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:34,305 INFO L273 TraceCheckUtils]: 11: Hoare triple {3760#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3761#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:34,305 INFO L273 TraceCheckUtils]: 12: Hoare triple {3761#(<= main_~i~1 2)} assume true; {3761#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:34,306 INFO L273 TraceCheckUtils]: 13: Hoare triple {3761#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {3761#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:34,307 INFO L273 TraceCheckUtils]: 14: Hoare triple {3761#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3762#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:34,307 INFO L273 TraceCheckUtils]: 15: Hoare triple {3762#(<= main_~i~1 3)} assume true; {3762#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:34,308 INFO L273 TraceCheckUtils]: 16: Hoare triple {3762#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {3762#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:34,309 INFO L273 TraceCheckUtils]: 17: Hoare triple {3762#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3763#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:34,309 INFO L273 TraceCheckUtils]: 18: Hoare triple {3763#(<= main_~i~1 4)} assume true; {3763#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:34,310 INFO L273 TraceCheckUtils]: 19: Hoare triple {3763#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {3763#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:34,310 INFO L273 TraceCheckUtils]: 20: Hoare triple {3763#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3764#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:34,311 INFO L273 TraceCheckUtils]: 21: Hoare triple {3764#(<= main_~i~1 5)} assume true; {3764#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:34,311 INFO L273 TraceCheckUtils]: 22: Hoare triple {3764#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {3764#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:34,312 INFO L273 TraceCheckUtils]: 23: Hoare triple {3764#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3765#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:34,313 INFO L273 TraceCheckUtils]: 24: Hoare triple {3765#(<= main_~i~1 6)} assume true; {3765#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:34,313 INFO L273 TraceCheckUtils]: 25: Hoare triple {3765#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {3765#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:34,314 INFO L273 TraceCheckUtils]: 26: Hoare triple {3765#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3766#(<= main_~i~1 7)} is VALID [2018-11-14 18:56:34,315 INFO L273 TraceCheckUtils]: 27: Hoare triple {3766#(<= main_~i~1 7)} assume true; {3766#(<= main_~i~1 7)} is VALID [2018-11-14 18:56:34,315 INFO L273 TraceCheckUtils]: 28: Hoare triple {3766#(<= main_~i~1 7)} assume !(~i~1 < 100000); {3758#false} is VALID [2018-11-14 18:56:34,316 INFO L256 TraceCheckUtils]: 29: Hoare triple {3758#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {3758#false} is VALID [2018-11-14 18:56:34,316 INFO L273 TraceCheckUtils]: 30: Hoare triple {3758#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3758#false} is VALID [2018-11-14 18:56:34,316 INFO L273 TraceCheckUtils]: 31: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 18:56:34,316 INFO L273 TraceCheckUtils]: 32: Hoare triple {3758#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3758#false} is VALID [2018-11-14 18:56:34,316 INFO L273 TraceCheckUtils]: 33: Hoare triple {3758#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3758#false} is VALID [2018-11-14 18:56:34,317 INFO L273 TraceCheckUtils]: 34: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 18:56:34,317 INFO L273 TraceCheckUtils]: 35: Hoare triple {3758#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3758#false} is VALID [2018-11-14 18:56:34,317 INFO L273 TraceCheckUtils]: 36: Hoare triple {3758#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3758#false} is VALID [2018-11-14 18:56:34,317 INFO L273 TraceCheckUtils]: 37: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 18:56:34,317 INFO L273 TraceCheckUtils]: 38: Hoare triple {3758#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3758#false} is VALID [2018-11-14 18:56:34,318 INFO L273 TraceCheckUtils]: 39: Hoare triple {3758#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3758#false} is VALID [2018-11-14 18:56:34,318 INFO L273 TraceCheckUtils]: 40: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 18:56:34,318 INFO L273 TraceCheckUtils]: 41: Hoare triple {3758#false} assume !(~i~0 < 100000); {3758#false} is VALID [2018-11-14 18:56:34,318 INFO L273 TraceCheckUtils]: 42: Hoare triple {3758#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3758#false} is VALID [2018-11-14 18:56:34,318 INFO L273 TraceCheckUtils]: 43: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 18:56:34,318 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {3758#false} {3758#false} #73#return; {3758#false} is VALID [2018-11-14 18:56:34,318 INFO L273 TraceCheckUtils]: 45: Hoare triple {3758#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {3758#false} is VALID [2018-11-14 18:56:34,318 INFO L256 TraceCheckUtils]: 46: Hoare triple {3758#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {3758#false} is VALID [2018-11-14 18:56:34,319 INFO L273 TraceCheckUtils]: 47: Hoare triple {3758#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3758#false} is VALID [2018-11-14 18:56:34,319 INFO L273 TraceCheckUtils]: 48: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 18:56:34,319 INFO L273 TraceCheckUtils]: 49: Hoare triple {3758#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3758#false} is VALID [2018-11-14 18:56:34,319 INFO L273 TraceCheckUtils]: 50: Hoare triple {3758#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3758#false} is VALID [2018-11-14 18:56:34,319 INFO L273 TraceCheckUtils]: 51: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 18:56:34,319 INFO L273 TraceCheckUtils]: 52: Hoare triple {3758#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3758#false} is VALID [2018-11-14 18:56:34,319 INFO L273 TraceCheckUtils]: 53: Hoare triple {3758#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3758#false} is VALID [2018-11-14 18:56:34,319 INFO L273 TraceCheckUtils]: 54: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 18:56:34,319 INFO L273 TraceCheckUtils]: 55: Hoare triple {3758#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3758#false} is VALID [2018-11-14 18:56:34,320 INFO L273 TraceCheckUtils]: 56: Hoare triple {3758#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3758#false} is VALID [2018-11-14 18:56:34,320 INFO L273 TraceCheckUtils]: 57: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 18:56:34,320 INFO L273 TraceCheckUtils]: 58: Hoare triple {3758#false} assume !(~i~0 < 100000); {3758#false} is VALID [2018-11-14 18:56:34,320 INFO L273 TraceCheckUtils]: 59: Hoare triple {3758#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3758#false} is VALID [2018-11-14 18:56:34,320 INFO L273 TraceCheckUtils]: 60: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 18:56:34,320 INFO L268 TraceCheckUtils]: 61: Hoare quadruple {3758#false} {3758#false} #75#return; {3758#false} is VALID [2018-11-14 18:56:34,320 INFO L273 TraceCheckUtils]: 62: Hoare triple {3758#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {3758#false} is VALID [2018-11-14 18:56:34,320 INFO L273 TraceCheckUtils]: 63: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 18:56:34,321 INFO L273 TraceCheckUtils]: 64: Hoare triple {3758#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {3758#false} is VALID [2018-11-14 18:56:34,321 INFO L273 TraceCheckUtils]: 65: Hoare triple {3758#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {3758#false} is VALID [2018-11-14 18:56:34,321 INFO L273 TraceCheckUtils]: 66: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 18:56:34,321 INFO L273 TraceCheckUtils]: 67: Hoare triple {3758#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {3758#false} is VALID [2018-11-14 18:56:34,321 INFO L273 TraceCheckUtils]: 68: Hoare triple {3758#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {3758#false} is VALID [2018-11-14 18:56:34,321 INFO L273 TraceCheckUtils]: 69: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 18:56:34,321 INFO L273 TraceCheckUtils]: 70: Hoare triple {3758#false} assume !(~i~2 < 99999); {3758#false} is VALID [2018-11-14 18:56:34,321 INFO L273 TraceCheckUtils]: 71: Hoare triple {3758#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {3758#false} is VALID [2018-11-14 18:56:34,321 INFO L256 TraceCheckUtils]: 72: Hoare triple {3758#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {3758#false} is VALID [2018-11-14 18:56:34,322 INFO L273 TraceCheckUtils]: 73: Hoare triple {3758#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3758#false} is VALID [2018-11-14 18:56:34,322 INFO L273 TraceCheckUtils]: 74: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 18:56:34,322 INFO L273 TraceCheckUtils]: 75: Hoare triple {3758#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3758#false} is VALID [2018-11-14 18:56:34,322 INFO L273 TraceCheckUtils]: 76: Hoare triple {3758#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3758#false} is VALID [2018-11-14 18:56:34,322 INFO L273 TraceCheckUtils]: 77: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 18:56:34,322 INFO L273 TraceCheckUtils]: 78: Hoare triple {3758#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3758#false} is VALID [2018-11-14 18:56:34,322 INFO L273 TraceCheckUtils]: 79: Hoare triple {3758#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3758#false} is VALID [2018-11-14 18:56:34,322 INFO L273 TraceCheckUtils]: 80: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 18:56:34,323 INFO L273 TraceCheckUtils]: 81: Hoare triple {3758#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3758#false} is VALID [2018-11-14 18:56:34,323 INFO L273 TraceCheckUtils]: 82: Hoare triple {3758#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3758#false} is VALID [2018-11-14 18:56:34,323 INFO L273 TraceCheckUtils]: 83: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 18:56:34,323 INFO L273 TraceCheckUtils]: 84: Hoare triple {3758#false} assume !(~i~0 < 100000); {3758#false} is VALID [2018-11-14 18:56:34,323 INFO L273 TraceCheckUtils]: 85: Hoare triple {3758#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3758#false} is VALID [2018-11-14 18:56:34,323 INFO L273 TraceCheckUtils]: 86: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 18:56:34,323 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {3758#false} {3758#false} #77#return; {3758#false} is VALID [2018-11-14 18:56:34,323 INFO L273 TraceCheckUtils]: 88: Hoare triple {3758#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {3758#false} is VALID [2018-11-14 18:56:34,323 INFO L273 TraceCheckUtils]: 89: Hoare triple {3758#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {3758#false} is VALID [2018-11-14 18:56:34,324 INFO L273 TraceCheckUtils]: 90: Hoare triple {3758#false} assume !false; {3758#false} is VALID [2018-11-14 18:56:34,327 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-14 18:56:34,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:56:34,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-14 18:56:34,348 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 91 [2018-11-14 18:56:34,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:56:34,350 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 18:56:34,420 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-14 18:56:34,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 18:56:34,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 18:56:34,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 18:56:34,421 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 11 states. [2018-11-14 18:56:34,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:34,814 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2018-11-14 18:56:34,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 18:56:34,814 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 91 [2018-11-14 18:56:34,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:56:34,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 18:56:34,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2018-11-14 18:56:34,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 18:56:34,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2018-11-14 18:56:34,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 81 transitions. [2018-11-14 18:56:34,910 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-14 18:56:34,912 INFO L225 Difference]: With dead ends: 99 [2018-11-14 18:56:34,912 INFO L226 Difference]: Without dead ends: 66 [2018-11-14 18:56:34,913 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 91 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-14 18:56:34,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-14 18:56:34,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-11-14 18:56:34,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:56:34,934 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 65 states. [2018-11-14 18:56:34,934 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 65 states. [2018-11-14 18:56:34,934 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 65 states. [2018-11-14 18:56:34,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:34,936 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-11-14 18:56:34,936 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-11-14 18:56:34,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:56:34,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:56:34,937 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 66 states. [2018-11-14 18:56:34,937 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 66 states. [2018-11-14 18:56:34,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:34,938 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-11-14 18:56:34,938 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-11-14 18:56:34,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:56:34,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:56:34,939 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:56:34,939 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:56:34,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-14 18:56:34,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-11-14 18:56:34,941 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 91 [2018-11-14 18:56:34,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:56:34,941 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-11-14 18:56:34,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 18:56:34,942 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-11-14 18:56:34,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-14 18:56:34,942 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:56:34,943 INFO L375 BasicCegarLoop]: trace histogram [12, 9, 9, 9, 8, 8, 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] [2018-11-14 18:56:34,943 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:56:34,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:56:34,943 INFO L82 PathProgramCache]: Analyzing trace with hash -849314171, now seen corresponding path program 8 times [2018-11-14 18:56:34,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:56:34,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:56:34,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:56:34,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:56:34,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:56:34,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:56:35,109 INFO L256 TraceCheckUtils]: 0: Hoare triple {4395#true} call ULTIMATE.init(); {4395#true} is VALID [2018-11-14 18:56:35,109 INFO L273 TraceCheckUtils]: 1: Hoare triple {4395#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4395#true} is VALID [2018-11-14 18:56:35,110 INFO L273 TraceCheckUtils]: 2: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 18:56:35,110 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4395#true} {4395#true} #69#return; {4395#true} is VALID [2018-11-14 18:56:35,110 INFO L256 TraceCheckUtils]: 4: Hoare triple {4395#true} call #t~ret13 := main(); {4395#true} is VALID [2018-11-14 18:56:35,111 INFO L273 TraceCheckUtils]: 5: Hoare triple {4395#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; {4397#(= main_~i~1 0)} is VALID [2018-11-14 18:56:35,111 INFO L273 TraceCheckUtils]: 6: Hoare triple {4397#(= main_~i~1 0)} assume true; {4397#(= main_~i~1 0)} is VALID [2018-11-14 18:56:35,112 INFO L273 TraceCheckUtils]: 7: Hoare triple {4397#(= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {4397#(= main_~i~1 0)} is VALID [2018-11-14 18:56:35,112 INFO L273 TraceCheckUtils]: 8: Hoare triple {4397#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4398#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:35,113 INFO L273 TraceCheckUtils]: 9: Hoare triple {4398#(<= main_~i~1 1)} assume true; {4398#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:35,113 INFO L273 TraceCheckUtils]: 10: Hoare triple {4398#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {4398#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:35,114 INFO L273 TraceCheckUtils]: 11: Hoare triple {4398#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4399#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:35,115 INFO L273 TraceCheckUtils]: 12: Hoare triple {4399#(<= main_~i~1 2)} assume true; {4399#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:35,115 INFO L273 TraceCheckUtils]: 13: Hoare triple {4399#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {4399#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:35,116 INFO L273 TraceCheckUtils]: 14: Hoare triple {4399#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4400#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:35,117 INFO L273 TraceCheckUtils]: 15: Hoare triple {4400#(<= main_~i~1 3)} assume true; {4400#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:35,117 INFO L273 TraceCheckUtils]: 16: Hoare triple {4400#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {4400#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:35,118 INFO L273 TraceCheckUtils]: 17: Hoare triple {4400#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4401#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:35,119 INFO L273 TraceCheckUtils]: 18: Hoare triple {4401#(<= main_~i~1 4)} assume true; {4401#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:35,119 INFO L273 TraceCheckUtils]: 19: Hoare triple {4401#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {4401#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:35,120 INFO L273 TraceCheckUtils]: 20: Hoare triple {4401#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4402#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:35,121 INFO L273 TraceCheckUtils]: 21: Hoare triple {4402#(<= main_~i~1 5)} assume true; {4402#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:35,121 INFO L273 TraceCheckUtils]: 22: Hoare triple {4402#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {4402#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:35,122 INFO L273 TraceCheckUtils]: 23: Hoare triple {4402#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4403#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:35,123 INFO L273 TraceCheckUtils]: 24: Hoare triple {4403#(<= main_~i~1 6)} assume true; {4403#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:35,124 INFO L273 TraceCheckUtils]: 25: Hoare triple {4403#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {4403#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:35,124 INFO L273 TraceCheckUtils]: 26: Hoare triple {4403#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4404#(<= main_~i~1 7)} is VALID [2018-11-14 18:56:35,125 INFO L273 TraceCheckUtils]: 27: Hoare triple {4404#(<= main_~i~1 7)} assume true; {4404#(<= main_~i~1 7)} is VALID [2018-11-14 18:56:35,126 INFO L273 TraceCheckUtils]: 28: Hoare triple {4404#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {4404#(<= main_~i~1 7)} is VALID [2018-11-14 18:56:35,127 INFO L273 TraceCheckUtils]: 29: Hoare triple {4404#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4405#(<= main_~i~1 8)} is VALID [2018-11-14 18:56:35,127 INFO L273 TraceCheckUtils]: 30: Hoare triple {4405#(<= main_~i~1 8)} assume true; {4405#(<= main_~i~1 8)} is VALID [2018-11-14 18:56:35,128 INFO L273 TraceCheckUtils]: 31: Hoare triple {4405#(<= main_~i~1 8)} assume !(~i~1 < 100000); {4396#false} is VALID [2018-11-14 18:56:35,128 INFO L256 TraceCheckUtils]: 32: Hoare triple {4396#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {4395#true} is VALID [2018-11-14 18:56:35,128 INFO L273 TraceCheckUtils]: 33: Hoare triple {4395#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4395#true} is VALID [2018-11-14 18:56:35,129 INFO L273 TraceCheckUtils]: 34: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 18:56:35,129 INFO L273 TraceCheckUtils]: 35: Hoare triple {4395#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4395#true} is VALID [2018-11-14 18:56:35,129 INFO L273 TraceCheckUtils]: 36: Hoare triple {4395#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4395#true} is VALID [2018-11-14 18:56:35,130 INFO L273 TraceCheckUtils]: 37: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 18:56:35,130 INFO L273 TraceCheckUtils]: 38: Hoare triple {4395#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4395#true} is VALID [2018-11-14 18:56:35,130 INFO L273 TraceCheckUtils]: 39: Hoare triple {4395#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4395#true} is VALID [2018-11-14 18:56:35,130 INFO L273 TraceCheckUtils]: 40: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 18:56:35,130 INFO L273 TraceCheckUtils]: 41: Hoare triple {4395#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4395#true} is VALID [2018-11-14 18:56:35,131 INFO L273 TraceCheckUtils]: 42: Hoare triple {4395#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4395#true} is VALID [2018-11-14 18:56:35,131 INFO L273 TraceCheckUtils]: 43: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 18:56:35,131 INFO L273 TraceCheckUtils]: 44: Hoare triple {4395#true} assume !(~i~0 < 100000); {4395#true} is VALID [2018-11-14 18:56:35,131 INFO L273 TraceCheckUtils]: 45: Hoare triple {4395#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4395#true} is VALID [2018-11-14 18:56:35,131 INFO L273 TraceCheckUtils]: 46: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 18:56:35,131 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {4395#true} {4396#false} #73#return; {4396#false} is VALID [2018-11-14 18:56:35,131 INFO L273 TraceCheckUtils]: 48: Hoare triple {4396#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {4396#false} is VALID [2018-11-14 18:56:35,132 INFO L256 TraceCheckUtils]: 49: Hoare triple {4396#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {4395#true} is VALID [2018-11-14 18:56:35,132 INFO L273 TraceCheckUtils]: 50: Hoare triple {4395#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4395#true} is VALID [2018-11-14 18:56:35,132 INFO L273 TraceCheckUtils]: 51: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 18:56:35,132 INFO L273 TraceCheckUtils]: 52: Hoare triple {4395#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4395#true} is VALID [2018-11-14 18:56:35,132 INFO L273 TraceCheckUtils]: 53: Hoare triple {4395#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4395#true} is VALID [2018-11-14 18:56:35,132 INFO L273 TraceCheckUtils]: 54: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 18:56:35,133 INFO L273 TraceCheckUtils]: 55: Hoare triple {4395#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4395#true} is VALID [2018-11-14 18:56:35,133 INFO L273 TraceCheckUtils]: 56: Hoare triple {4395#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4395#true} is VALID [2018-11-14 18:56:35,133 INFO L273 TraceCheckUtils]: 57: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 18:56:35,133 INFO L273 TraceCheckUtils]: 58: Hoare triple {4395#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4395#true} is VALID [2018-11-14 18:56:35,133 INFO L273 TraceCheckUtils]: 59: Hoare triple {4395#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4395#true} is VALID [2018-11-14 18:56:35,133 INFO L273 TraceCheckUtils]: 60: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 18:56:35,133 INFO L273 TraceCheckUtils]: 61: Hoare triple {4395#true} assume !(~i~0 < 100000); {4395#true} is VALID [2018-11-14 18:56:35,134 INFO L273 TraceCheckUtils]: 62: Hoare triple {4395#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4395#true} is VALID [2018-11-14 18:56:35,134 INFO L273 TraceCheckUtils]: 63: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 18:56:35,134 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {4395#true} {4396#false} #75#return; {4396#false} is VALID [2018-11-14 18:56:35,134 INFO L273 TraceCheckUtils]: 65: Hoare triple {4396#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {4396#false} is VALID [2018-11-14 18:56:35,134 INFO L273 TraceCheckUtils]: 66: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 18:56:35,134 INFO L273 TraceCheckUtils]: 67: Hoare triple {4396#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {4396#false} is VALID [2018-11-14 18:56:35,135 INFO L273 TraceCheckUtils]: 68: Hoare triple {4396#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {4396#false} is VALID [2018-11-14 18:56:35,135 INFO L273 TraceCheckUtils]: 69: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 18:56:35,135 INFO L273 TraceCheckUtils]: 70: Hoare triple {4396#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {4396#false} is VALID [2018-11-14 18:56:35,135 INFO L273 TraceCheckUtils]: 71: Hoare triple {4396#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {4396#false} is VALID [2018-11-14 18:56:35,135 INFO L273 TraceCheckUtils]: 72: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 18:56:35,135 INFO L273 TraceCheckUtils]: 73: Hoare triple {4396#false} assume !(~i~2 < 99999); {4396#false} is VALID [2018-11-14 18:56:35,135 INFO L273 TraceCheckUtils]: 74: Hoare triple {4396#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {4396#false} is VALID [2018-11-14 18:56:35,136 INFO L256 TraceCheckUtils]: 75: Hoare triple {4396#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {4395#true} is VALID [2018-11-14 18:56:35,136 INFO L273 TraceCheckUtils]: 76: Hoare triple {4395#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4395#true} is VALID [2018-11-14 18:56:35,136 INFO L273 TraceCheckUtils]: 77: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 18:56:35,136 INFO L273 TraceCheckUtils]: 78: Hoare triple {4395#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4395#true} is VALID [2018-11-14 18:56:35,136 INFO L273 TraceCheckUtils]: 79: Hoare triple {4395#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4395#true} is VALID [2018-11-14 18:56:35,136 INFO L273 TraceCheckUtils]: 80: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 18:56:35,136 INFO L273 TraceCheckUtils]: 81: Hoare triple {4395#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4395#true} is VALID [2018-11-14 18:56:35,137 INFO L273 TraceCheckUtils]: 82: Hoare triple {4395#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4395#true} is VALID [2018-11-14 18:56:35,137 INFO L273 TraceCheckUtils]: 83: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 18:56:35,137 INFO L273 TraceCheckUtils]: 84: Hoare triple {4395#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4395#true} is VALID [2018-11-14 18:56:35,137 INFO L273 TraceCheckUtils]: 85: Hoare triple {4395#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4395#true} is VALID [2018-11-14 18:56:35,137 INFO L273 TraceCheckUtils]: 86: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 18:56:35,137 INFO L273 TraceCheckUtils]: 87: Hoare triple {4395#true} assume !(~i~0 < 100000); {4395#true} is VALID [2018-11-14 18:56:35,138 INFO L273 TraceCheckUtils]: 88: Hoare triple {4395#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4395#true} is VALID [2018-11-14 18:56:35,138 INFO L273 TraceCheckUtils]: 89: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 18:56:35,138 INFO L268 TraceCheckUtils]: 90: Hoare quadruple {4395#true} {4396#false} #77#return; {4396#false} is VALID [2018-11-14 18:56:35,138 INFO L273 TraceCheckUtils]: 91: Hoare triple {4396#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {4396#false} is VALID [2018-11-14 18:56:35,138 INFO L273 TraceCheckUtils]: 92: Hoare triple {4396#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {4396#false} is VALID [2018-11-14 18:56:35,138 INFO L273 TraceCheckUtils]: 93: Hoare triple {4396#false} assume !false; {4396#false} is VALID [2018-11-14 18:56:35,146 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-14 18:56:35,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:56:35,146 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-14 18:56:35,155 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:56:35,199 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:56:35,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:56:35,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:56:35,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:56:35,374 INFO L256 TraceCheckUtils]: 0: Hoare triple {4395#true} call ULTIMATE.init(); {4395#true} is VALID [2018-11-14 18:56:35,374 INFO L273 TraceCheckUtils]: 1: Hoare triple {4395#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4395#true} is VALID [2018-11-14 18:56:35,375 INFO L273 TraceCheckUtils]: 2: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 18:56:35,375 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4395#true} {4395#true} #69#return; {4395#true} is VALID [2018-11-14 18:56:35,375 INFO L256 TraceCheckUtils]: 4: Hoare triple {4395#true} call #t~ret13 := main(); {4395#true} is VALID [2018-11-14 18:56:35,376 INFO L273 TraceCheckUtils]: 5: Hoare triple {4395#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; {4424#(<= main_~i~1 0)} is VALID [2018-11-14 18:56:35,377 INFO L273 TraceCheckUtils]: 6: Hoare triple {4424#(<= main_~i~1 0)} assume true; {4424#(<= main_~i~1 0)} is VALID [2018-11-14 18:56:35,377 INFO L273 TraceCheckUtils]: 7: Hoare triple {4424#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {4424#(<= main_~i~1 0)} is VALID [2018-11-14 18:56:35,378 INFO L273 TraceCheckUtils]: 8: Hoare triple {4424#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4398#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:35,378 INFO L273 TraceCheckUtils]: 9: Hoare triple {4398#(<= main_~i~1 1)} assume true; {4398#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:35,378 INFO L273 TraceCheckUtils]: 10: Hoare triple {4398#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {4398#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:35,379 INFO L273 TraceCheckUtils]: 11: Hoare triple {4398#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4399#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:35,379 INFO L273 TraceCheckUtils]: 12: Hoare triple {4399#(<= main_~i~1 2)} assume true; {4399#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:35,380 INFO L273 TraceCheckUtils]: 13: Hoare triple {4399#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {4399#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:35,381 INFO L273 TraceCheckUtils]: 14: Hoare triple {4399#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4400#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:35,381 INFO L273 TraceCheckUtils]: 15: Hoare triple {4400#(<= main_~i~1 3)} assume true; {4400#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:35,382 INFO L273 TraceCheckUtils]: 16: Hoare triple {4400#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {4400#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:35,383 INFO L273 TraceCheckUtils]: 17: Hoare triple {4400#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4401#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:35,383 INFO L273 TraceCheckUtils]: 18: Hoare triple {4401#(<= main_~i~1 4)} assume true; {4401#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:35,384 INFO L273 TraceCheckUtils]: 19: Hoare triple {4401#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {4401#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:35,385 INFO L273 TraceCheckUtils]: 20: Hoare triple {4401#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4402#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:35,386 INFO L273 TraceCheckUtils]: 21: Hoare triple {4402#(<= main_~i~1 5)} assume true; {4402#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:35,386 INFO L273 TraceCheckUtils]: 22: Hoare triple {4402#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {4402#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:35,387 INFO L273 TraceCheckUtils]: 23: Hoare triple {4402#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4403#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:35,388 INFO L273 TraceCheckUtils]: 24: Hoare triple {4403#(<= main_~i~1 6)} assume true; {4403#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:35,388 INFO L273 TraceCheckUtils]: 25: Hoare triple {4403#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {4403#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:35,389 INFO L273 TraceCheckUtils]: 26: Hoare triple {4403#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4404#(<= main_~i~1 7)} is VALID [2018-11-14 18:56:35,390 INFO L273 TraceCheckUtils]: 27: Hoare triple {4404#(<= main_~i~1 7)} assume true; {4404#(<= main_~i~1 7)} is VALID [2018-11-14 18:56:35,390 INFO L273 TraceCheckUtils]: 28: Hoare triple {4404#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {4404#(<= main_~i~1 7)} is VALID [2018-11-14 18:56:35,391 INFO L273 TraceCheckUtils]: 29: Hoare triple {4404#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4405#(<= main_~i~1 8)} is VALID [2018-11-14 18:56:35,392 INFO L273 TraceCheckUtils]: 30: Hoare triple {4405#(<= main_~i~1 8)} assume true; {4405#(<= main_~i~1 8)} is VALID [2018-11-14 18:56:35,393 INFO L273 TraceCheckUtils]: 31: Hoare triple {4405#(<= main_~i~1 8)} assume !(~i~1 < 100000); {4396#false} is VALID [2018-11-14 18:56:35,393 INFO L256 TraceCheckUtils]: 32: Hoare triple {4396#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {4396#false} is VALID [2018-11-14 18:56:35,393 INFO L273 TraceCheckUtils]: 33: Hoare triple {4396#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4396#false} is VALID [2018-11-14 18:56:35,394 INFO L273 TraceCheckUtils]: 34: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 18:56:35,394 INFO L273 TraceCheckUtils]: 35: Hoare triple {4396#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4396#false} is VALID [2018-11-14 18:56:35,394 INFO L273 TraceCheckUtils]: 36: Hoare triple {4396#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4396#false} is VALID [2018-11-14 18:56:35,394 INFO L273 TraceCheckUtils]: 37: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 18:56:35,395 INFO L273 TraceCheckUtils]: 38: Hoare triple {4396#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4396#false} is VALID [2018-11-14 18:56:35,395 INFO L273 TraceCheckUtils]: 39: Hoare triple {4396#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4396#false} is VALID [2018-11-14 18:56:35,395 INFO L273 TraceCheckUtils]: 40: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 18:56:35,395 INFO L273 TraceCheckUtils]: 41: Hoare triple {4396#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4396#false} is VALID [2018-11-14 18:56:35,396 INFO L273 TraceCheckUtils]: 42: Hoare triple {4396#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4396#false} is VALID [2018-11-14 18:56:35,396 INFO L273 TraceCheckUtils]: 43: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 18:56:35,396 INFO L273 TraceCheckUtils]: 44: Hoare triple {4396#false} assume !(~i~0 < 100000); {4396#false} is VALID [2018-11-14 18:56:35,396 INFO L273 TraceCheckUtils]: 45: Hoare triple {4396#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4396#false} is VALID [2018-11-14 18:56:35,397 INFO L273 TraceCheckUtils]: 46: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 18:56:35,397 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {4396#false} {4396#false} #73#return; {4396#false} is VALID [2018-11-14 18:56:35,397 INFO L273 TraceCheckUtils]: 48: Hoare triple {4396#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {4396#false} is VALID [2018-11-14 18:56:35,397 INFO L256 TraceCheckUtils]: 49: Hoare triple {4396#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {4396#false} is VALID [2018-11-14 18:56:35,398 INFO L273 TraceCheckUtils]: 50: Hoare triple {4396#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4396#false} is VALID [2018-11-14 18:56:35,398 INFO L273 TraceCheckUtils]: 51: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 18:56:35,398 INFO L273 TraceCheckUtils]: 52: Hoare triple {4396#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4396#false} is VALID [2018-11-14 18:56:35,398 INFO L273 TraceCheckUtils]: 53: Hoare triple {4396#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4396#false} is VALID [2018-11-14 18:56:35,398 INFO L273 TraceCheckUtils]: 54: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 18:56:35,398 INFO L273 TraceCheckUtils]: 55: Hoare triple {4396#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4396#false} is VALID [2018-11-14 18:56:35,399 INFO L273 TraceCheckUtils]: 56: Hoare triple {4396#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4396#false} is VALID [2018-11-14 18:56:35,399 INFO L273 TraceCheckUtils]: 57: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 18:56:35,399 INFO L273 TraceCheckUtils]: 58: Hoare triple {4396#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4396#false} is VALID [2018-11-14 18:56:35,399 INFO L273 TraceCheckUtils]: 59: Hoare triple {4396#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4396#false} is VALID [2018-11-14 18:56:35,399 INFO L273 TraceCheckUtils]: 60: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 18:56:35,399 INFO L273 TraceCheckUtils]: 61: Hoare triple {4396#false} assume !(~i~0 < 100000); {4396#false} is VALID [2018-11-14 18:56:35,399 INFO L273 TraceCheckUtils]: 62: Hoare triple {4396#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4396#false} is VALID [2018-11-14 18:56:35,400 INFO L273 TraceCheckUtils]: 63: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 18:56:35,400 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {4396#false} {4396#false} #75#return; {4396#false} is VALID [2018-11-14 18:56:35,400 INFO L273 TraceCheckUtils]: 65: Hoare triple {4396#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {4396#false} is VALID [2018-11-14 18:56:35,400 INFO L273 TraceCheckUtils]: 66: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 18:56:35,400 INFO L273 TraceCheckUtils]: 67: Hoare triple {4396#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {4396#false} is VALID [2018-11-14 18:56:35,400 INFO L273 TraceCheckUtils]: 68: Hoare triple {4396#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {4396#false} is VALID [2018-11-14 18:56:35,401 INFO L273 TraceCheckUtils]: 69: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 18:56:35,401 INFO L273 TraceCheckUtils]: 70: Hoare triple {4396#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {4396#false} is VALID [2018-11-14 18:56:35,401 INFO L273 TraceCheckUtils]: 71: Hoare triple {4396#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {4396#false} is VALID [2018-11-14 18:56:35,401 INFO L273 TraceCheckUtils]: 72: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 18:56:35,401 INFO L273 TraceCheckUtils]: 73: Hoare triple {4396#false} assume !(~i~2 < 99999); {4396#false} is VALID [2018-11-14 18:56:35,401 INFO L273 TraceCheckUtils]: 74: Hoare triple {4396#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {4396#false} is VALID [2018-11-14 18:56:35,401 INFO L256 TraceCheckUtils]: 75: Hoare triple {4396#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {4396#false} is VALID [2018-11-14 18:56:35,402 INFO L273 TraceCheckUtils]: 76: Hoare triple {4396#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4396#false} is VALID [2018-11-14 18:56:35,402 INFO L273 TraceCheckUtils]: 77: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 18:56:35,402 INFO L273 TraceCheckUtils]: 78: Hoare triple {4396#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4396#false} is VALID [2018-11-14 18:56:35,402 INFO L273 TraceCheckUtils]: 79: Hoare triple {4396#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4396#false} is VALID [2018-11-14 18:56:35,402 INFO L273 TraceCheckUtils]: 80: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 18:56:35,402 INFO L273 TraceCheckUtils]: 81: Hoare triple {4396#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4396#false} is VALID [2018-11-14 18:56:35,402 INFO L273 TraceCheckUtils]: 82: Hoare triple {4396#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4396#false} is VALID [2018-11-14 18:56:35,403 INFO L273 TraceCheckUtils]: 83: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 18:56:35,403 INFO L273 TraceCheckUtils]: 84: Hoare triple {4396#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4396#false} is VALID [2018-11-14 18:56:35,403 INFO L273 TraceCheckUtils]: 85: Hoare triple {4396#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4396#false} is VALID [2018-11-14 18:56:35,403 INFO L273 TraceCheckUtils]: 86: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 18:56:35,403 INFO L273 TraceCheckUtils]: 87: Hoare triple {4396#false} assume !(~i~0 < 100000); {4396#false} is VALID [2018-11-14 18:56:35,403 INFO L273 TraceCheckUtils]: 88: Hoare triple {4396#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4396#false} is VALID [2018-11-14 18:56:35,404 INFO L273 TraceCheckUtils]: 89: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 18:56:35,404 INFO L268 TraceCheckUtils]: 90: Hoare quadruple {4396#false} {4396#false} #77#return; {4396#false} is VALID [2018-11-14 18:56:35,404 INFO L273 TraceCheckUtils]: 91: Hoare triple {4396#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {4396#false} is VALID [2018-11-14 18:56:35,404 INFO L273 TraceCheckUtils]: 92: Hoare triple {4396#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {4396#false} is VALID [2018-11-14 18:56:35,404 INFO L273 TraceCheckUtils]: 93: Hoare triple {4396#false} assume !false; {4396#false} is VALID [2018-11-14 18:56:35,412 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-14 18:56:35,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:56:35,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-14 18:56:35,433 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2018-11-14 18:56:35,433 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:56:35,434 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 18:56:35,532 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:56:35,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 18:56:35,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 18:56:35,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 18:56:35,534 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 12 states. [2018-11-14 18:56:35,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:35,867 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2018-11-14 18:56:35,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 18:56:35,868 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2018-11-14 18:56:35,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:56:35,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:56:35,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 84 transitions. [2018-11-14 18:56:35,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:56:35,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 84 transitions. [2018-11-14 18:56:35,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 84 transitions. [2018-11-14 18:56:36,032 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:56:36,034 INFO L225 Difference]: With dead ends: 102 [2018-11-14 18:56:36,034 INFO L226 Difference]: Without dead ends: 69 [2018-11-14 18:56:36,035 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 18:56:36,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-14 18:56:36,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-11-14 18:56:36,087 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:56:36,087 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 68 states. [2018-11-14 18:56:36,087 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 68 states. [2018-11-14 18:56:36,087 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 68 states. [2018-11-14 18:56:36,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:36,089 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-14 18:56:36,089 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-14 18:56:36,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:56:36,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:56:36,090 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 69 states. [2018-11-14 18:56:36,090 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 69 states. [2018-11-14 18:56:36,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:36,091 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-14 18:56:36,091 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-14 18:56:36,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:56:36,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:56:36,092 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:56:36,092 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:56:36,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-14 18:56:36,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-11-14 18:56:36,095 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 94 [2018-11-14 18:56:36,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:56:36,095 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-11-14 18:56:36,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 18:56:36,095 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-11-14 18:56:36,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-14 18:56:36,096 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:56:36,096 INFO L375 BasicCegarLoop]: trace histogram [12, 10, 9, 9, 9, 9, 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] [2018-11-14 18:56:36,096 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:56:36,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:56:36,098 INFO L82 PathProgramCache]: Analyzing trace with hash 8255871, now seen corresponding path program 9 times [2018-11-14 18:56:36,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:56:36,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:56:36,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:56:36,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:56:36,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:56:36,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:56:36,596 INFO L256 TraceCheckUtils]: 0: Hoare triple {5057#true} call ULTIMATE.init(); {5057#true} is VALID [2018-11-14 18:56:36,596 INFO L273 TraceCheckUtils]: 1: Hoare triple {5057#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5057#true} is VALID [2018-11-14 18:56:36,597 INFO L273 TraceCheckUtils]: 2: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:56:36,597 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5057#true} {5057#true} #69#return; {5057#true} is VALID [2018-11-14 18:56:36,597 INFO L256 TraceCheckUtils]: 4: Hoare triple {5057#true} call #t~ret13 := main(); {5057#true} is VALID [2018-11-14 18:56:36,598 INFO L273 TraceCheckUtils]: 5: Hoare triple {5057#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; {5059#(= main_~i~1 0)} is VALID [2018-11-14 18:56:36,598 INFO L273 TraceCheckUtils]: 6: Hoare triple {5059#(= main_~i~1 0)} assume true; {5059#(= main_~i~1 0)} is VALID [2018-11-14 18:56:36,599 INFO L273 TraceCheckUtils]: 7: Hoare triple {5059#(= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {5059#(= main_~i~1 0)} is VALID [2018-11-14 18:56:36,600 INFO L273 TraceCheckUtils]: 8: Hoare triple {5059#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5060#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:36,600 INFO L273 TraceCheckUtils]: 9: Hoare triple {5060#(<= main_~i~1 1)} assume true; {5060#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:36,601 INFO L273 TraceCheckUtils]: 10: Hoare triple {5060#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {5060#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:36,601 INFO L273 TraceCheckUtils]: 11: Hoare triple {5060#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5061#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:36,602 INFO L273 TraceCheckUtils]: 12: Hoare triple {5061#(<= main_~i~1 2)} assume true; {5061#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:36,603 INFO L273 TraceCheckUtils]: 13: Hoare triple {5061#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {5061#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:36,603 INFO L273 TraceCheckUtils]: 14: Hoare triple {5061#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5062#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:36,604 INFO L273 TraceCheckUtils]: 15: Hoare triple {5062#(<= main_~i~1 3)} assume true; {5062#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:36,604 INFO L273 TraceCheckUtils]: 16: Hoare triple {5062#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {5062#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:36,605 INFO L273 TraceCheckUtils]: 17: Hoare triple {5062#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5063#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:36,606 INFO L273 TraceCheckUtils]: 18: Hoare triple {5063#(<= main_~i~1 4)} assume true; {5063#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:36,606 INFO L273 TraceCheckUtils]: 19: Hoare triple {5063#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {5063#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:36,607 INFO L273 TraceCheckUtils]: 20: Hoare triple {5063#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5064#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:36,608 INFO L273 TraceCheckUtils]: 21: Hoare triple {5064#(<= main_~i~1 5)} assume true; {5064#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:36,608 INFO L273 TraceCheckUtils]: 22: Hoare triple {5064#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {5064#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:36,609 INFO L273 TraceCheckUtils]: 23: Hoare triple {5064#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5065#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:36,609 INFO L273 TraceCheckUtils]: 24: Hoare triple {5065#(<= main_~i~1 6)} assume true; {5065#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:36,610 INFO L273 TraceCheckUtils]: 25: Hoare triple {5065#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {5065#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:36,611 INFO L273 TraceCheckUtils]: 26: Hoare triple {5065#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5066#(<= main_~i~1 7)} is VALID [2018-11-14 18:56:36,611 INFO L273 TraceCheckUtils]: 27: Hoare triple {5066#(<= main_~i~1 7)} assume true; {5066#(<= main_~i~1 7)} is VALID [2018-11-14 18:56:36,612 INFO L273 TraceCheckUtils]: 28: Hoare triple {5066#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {5066#(<= main_~i~1 7)} is VALID [2018-11-14 18:56:36,613 INFO L273 TraceCheckUtils]: 29: Hoare triple {5066#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5067#(<= main_~i~1 8)} is VALID [2018-11-14 18:56:36,613 INFO L273 TraceCheckUtils]: 30: Hoare triple {5067#(<= main_~i~1 8)} assume true; {5067#(<= main_~i~1 8)} is VALID [2018-11-14 18:56:36,614 INFO L273 TraceCheckUtils]: 31: Hoare triple {5067#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {5067#(<= main_~i~1 8)} is VALID [2018-11-14 18:56:36,614 INFO L273 TraceCheckUtils]: 32: Hoare triple {5067#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5068#(<= main_~i~1 9)} is VALID [2018-11-14 18:56:36,615 INFO L273 TraceCheckUtils]: 33: Hoare triple {5068#(<= main_~i~1 9)} assume true; {5068#(<= main_~i~1 9)} is VALID [2018-11-14 18:56:36,616 INFO L273 TraceCheckUtils]: 34: Hoare triple {5068#(<= main_~i~1 9)} assume !(~i~1 < 100000); {5058#false} is VALID [2018-11-14 18:56:36,616 INFO L256 TraceCheckUtils]: 35: Hoare triple {5058#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {5057#true} is VALID [2018-11-14 18:56:36,616 INFO L273 TraceCheckUtils]: 36: Hoare triple {5057#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5057#true} is VALID [2018-11-14 18:56:36,616 INFO L273 TraceCheckUtils]: 37: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:56:36,617 INFO L273 TraceCheckUtils]: 38: Hoare triple {5057#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 18:56:36,617 INFO L273 TraceCheckUtils]: 39: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 18:56:36,617 INFO L273 TraceCheckUtils]: 40: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:56:36,617 INFO L273 TraceCheckUtils]: 41: Hoare triple {5057#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 18:56:36,617 INFO L273 TraceCheckUtils]: 42: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 18:56:36,618 INFO L273 TraceCheckUtils]: 43: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:56:36,618 INFO L273 TraceCheckUtils]: 44: Hoare triple {5057#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 18:56:36,618 INFO L273 TraceCheckUtils]: 45: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 18:56:36,618 INFO L273 TraceCheckUtils]: 46: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:56:36,618 INFO L273 TraceCheckUtils]: 47: Hoare triple {5057#true} assume !(~i~0 < 100000); {5057#true} is VALID [2018-11-14 18:56:36,619 INFO L273 TraceCheckUtils]: 48: Hoare triple {5057#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5057#true} is VALID [2018-11-14 18:56:36,619 INFO L273 TraceCheckUtils]: 49: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:56:36,619 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {5057#true} {5058#false} #73#return; {5058#false} is VALID [2018-11-14 18:56:36,619 INFO L273 TraceCheckUtils]: 51: Hoare triple {5058#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {5058#false} is VALID [2018-11-14 18:56:36,619 INFO L256 TraceCheckUtils]: 52: Hoare triple {5058#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {5057#true} is VALID [2018-11-14 18:56:36,620 INFO L273 TraceCheckUtils]: 53: Hoare triple {5057#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5057#true} is VALID [2018-11-14 18:56:36,620 INFO L273 TraceCheckUtils]: 54: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:56:36,620 INFO L273 TraceCheckUtils]: 55: Hoare triple {5057#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 18:56:36,621 INFO L273 TraceCheckUtils]: 56: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 18:56:36,621 INFO L273 TraceCheckUtils]: 57: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:56:36,621 INFO L273 TraceCheckUtils]: 58: Hoare triple {5057#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 18:56:36,621 INFO L273 TraceCheckUtils]: 59: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 18:56:36,621 INFO L273 TraceCheckUtils]: 60: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:56:36,622 INFO L273 TraceCheckUtils]: 61: Hoare triple {5057#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 18:56:36,622 INFO L273 TraceCheckUtils]: 62: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 18:56:36,622 INFO L273 TraceCheckUtils]: 63: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:56:36,622 INFO L273 TraceCheckUtils]: 64: Hoare triple {5057#true} assume !(~i~0 < 100000); {5057#true} is VALID [2018-11-14 18:56:36,622 INFO L273 TraceCheckUtils]: 65: Hoare triple {5057#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5057#true} is VALID [2018-11-14 18:56:36,622 INFO L273 TraceCheckUtils]: 66: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:56:36,623 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {5057#true} {5058#false} #75#return; {5058#false} is VALID [2018-11-14 18:56:36,623 INFO L273 TraceCheckUtils]: 68: Hoare triple {5058#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {5058#false} is VALID [2018-11-14 18:56:36,623 INFO L273 TraceCheckUtils]: 69: Hoare triple {5058#false} assume true; {5058#false} is VALID [2018-11-14 18:56:36,623 INFO L273 TraceCheckUtils]: 70: Hoare triple {5058#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {5058#false} is VALID [2018-11-14 18:56:36,623 INFO L273 TraceCheckUtils]: 71: Hoare triple {5058#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {5058#false} is VALID [2018-11-14 18:56:36,623 INFO L273 TraceCheckUtils]: 72: Hoare triple {5058#false} assume true; {5058#false} is VALID [2018-11-14 18:56:36,624 INFO L273 TraceCheckUtils]: 73: Hoare triple {5058#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {5058#false} is VALID [2018-11-14 18:56:36,624 INFO L273 TraceCheckUtils]: 74: Hoare triple {5058#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {5058#false} is VALID [2018-11-14 18:56:36,624 INFO L273 TraceCheckUtils]: 75: Hoare triple {5058#false} assume true; {5058#false} is VALID [2018-11-14 18:56:36,624 INFO L273 TraceCheckUtils]: 76: Hoare triple {5058#false} assume !(~i~2 < 99999); {5058#false} is VALID [2018-11-14 18:56:36,624 INFO L273 TraceCheckUtils]: 77: Hoare triple {5058#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {5058#false} is VALID [2018-11-14 18:56:36,625 INFO L256 TraceCheckUtils]: 78: Hoare triple {5058#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {5057#true} is VALID [2018-11-14 18:56:36,625 INFO L273 TraceCheckUtils]: 79: Hoare triple {5057#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5057#true} is VALID [2018-11-14 18:56:36,625 INFO L273 TraceCheckUtils]: 80: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:56:36,625 INFO L273 TraceCheckUtils]: 81: Hoare triple {5057#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 18:56:36,625 INFO L273 TraceCheckUtils]: 82: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 18:56:36,625 INFO L273 TraceCheckUtils]: 83: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:56:36,625 INFO L273 TraceCheckUtils]: 84: Hoare triple {5057#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 18:56:36,626 INFO L273 TraceCheckUtils]: 85: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 18:56:36,626 INFO L273 TraceCheckUtils]: 86: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:56:36,626 INFO L273 TraceCheckUtils]: 87: Hoare triple {5057#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 18:56:36,626 INFO L273 TraceCheckUtils]: 88: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 18:56:36,626 INFO L273 TraceCheckUtils]: 89: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:56:36,626 INFO L273 TraceCheckUtils]: 90: Hoare triple {5057#true} assume !(~i~0 < 100000); {5057#true} is VALID [2018-11-14 18:56:36,627 INFO L273 TraceCheckUtils]: 91: Hoare triple {5057#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5057#true} is VALID [2018-11-14 18:56:36,627 INFO L273 TraceCheckUtils]: 92: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:56:36,627 INFO L268 TraceCheckUtils]: 93: Hoare quadruple {5057#true} {5058#false} #77#return; {5058#false} is VALID [2018-11-14 18:56:36,627 INFO L273 TraceCheckUtils]: 94: Hoare triple {5058#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {5058#false} is VALID [2018-11-14 18:56:36,627 INFO L273 TraceCheckUtils]: 95: Hoare triple {5058#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {5058#false} is VALID [2018-11-14 18:56:36,627 INFO L273 TraceCheckUtils]: 96: Hoare triple {5058#false} assume !false; {5058#false} is VALID [2018-11-14 18:56:36,633 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-14 18:56:36,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:56:36,633 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-14 18:56:36,647 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:56:36,699 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-14 18:56:36,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:56:36,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:56:36,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:56:36,995 INFO L256 TraceCheckUtils]: 0: Hoare triple {5057#true} call ULTIMATE.init(); {5057#true} is VALID [2018-11-14 18:56:36,996 INFO L273 TraceCheckUtils]: 1: Hoare triple {5057#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5057#true} is VALID [2018-11-14 18:56:36,996 INFO L273 TraceCheckUtils]: 2: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:56:36,996 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5057#true} {5057#true} #69#return; {5057#true} is VALID [2018-11-14 18:56:36,996 INFO L256 TraceCheckUtils]: 4: Hoare triple {5057#true} call #t~ret13 := main(); {5057#true} is VALID [2018-11-14 18:56:36,996 INFO L273 TraceCheckUtils]: 5: Hoare triple {5057#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; {5057#true} is VALID [2018-11-14 18:56:36,996 INFO L273 TraceCheckUtils]: 6: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:56:36,997 INFO L273 TraceCheckUtils]: 7: Hoare triple {5057#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5057#true} is VALID [2018-11-14 18:56:36,997 INFO L273 TraceCheckUtils]: 8: Hoare triple {5057#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5057#true} is VALID [2018-11-14 18:56:36,997 INFO L273 TraceCheckUtils]: 9: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:56:36,997 INFO L273 TraceCheckUtils]: 10: Hoare triple {5057#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5057#true} is VALID [2018-11-14 18:56:36,997 INFO L273 TraceCheckUtils]: 11: Hoare triple {5057#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5057#true} is VALID [2018-11-14 18:56:36,997 INFO L273 TraceCheckUtils]: 12: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:56:36,997 INFO L273 TraceCheckUtils]: 13: Hoare triple {5057#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5057#true} is VALID [2018-11-14 18:56:36,997 INFO L273 TraceCheckUtils]: 14: Hoare triple {5057#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5057#true} is VALID [2018-11-14 18:56:36,997 INFO L273 TraceCheckUtils]: 15: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:56:36,998 INFO L273 TraceCheckUtils]: 16: Hoare triple {5057#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5057#true} is VALID [2018-11-14 18:56:36,998 INFO L273 TraceCheckUtils]: 17: Hoare triple {5057#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5057#true} is VALID [2018-11-14 18:56:36,998 INFO L273 TraceCheckUtils]: 18: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:56:36,998 INFO L273 TraceCheckUtils]: 19: Hoare triple {5057#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5057#true} is VALID [2018-11-14 18:56:36,998 INFO L273 TraceCheckUtils]: 20: Hoare triple {5057#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5057#true} is VALID [2018-11-14 18:56:36,998 INFO L273 TraceCheckUtils]: 21: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:56:36,998 INFO L273 TraceCheckUtils]: 22: Hoare triple {5057#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5057#true} is VALID [2018-11-14 18:56:36,998 INFO L273 TraceCheckUtils]: 23: Hoare triple {5057#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5057#true} is VALID [2018-11-14 18:56:36,999 INFO L273 TraceCheckUtils]: 24: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:56:36,999 INFO L273 TraceCheckUtils]: 25: Hoare triple {5057#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5057#true} is VALID [2018-11-14 18:56:36,999 INFO L273 TraceCheckUtils]: 26: Hoare triple {5057#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5057#true} is VALID [2018-11-14 18:56:36,999 INFO L273 TraceCheckUtils]: 27: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:56:36,999 INFO L273 TraceCheckUtils]: 28: Hoare triple {5057#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5057#true} is VALID [2018-11-14 18:56:36,999 INFO L273 TraceCheckUtils]: 29: Hoare triple {5057#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5057#true} is VALID [2018-11-14 18:56:36,999 INFO L273 TraceCheckUtils]: 30: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:56:36,999 INFO L273 TraceCheckUtils]: 31: Hoare triple {5057#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5057#true} is VALID [2018-11-14 18:56:37,000 INFO L273 TraceCheckUtils]: 32: Hoare triple {5057#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5057#true} is VALID [2018-11-14 18:56:37,000 INFO L273 TraceCheckUtils]: 33: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:56:37,000 INFO L273 TraceCheckUtils]: 34: Hoare triple {5057#true} assume !(~i~1 < 100000); {5057#true} is VALID [2018-11-14 18:56:37,000 INFO L256 TraceCheckUtils]: 35: Hoare triple {5057#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {5057#true} is VALID [2018-11-14 18:56:37,000 INFO L273 TraceCheckUtils]: 36: Hoare triple {5057#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5057#true} is VALID [2018-11-14 18:56:37,000 INFO L273 TraceCheckUtils]: 37: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:56:37,000 INFO L273 TraceCheckUtils]: 38: Hoare triple {5057#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 18:56:37,000 INFO L273 TraceCheckUtils]: 39: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 18:56:37,000 INFO L273 TraceCheckUtils]: 40: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:56:37,001 INFO L273 TraceCheckUtils]: 41: Hoare triple {5057#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 18:56:37,001 INFO L273 TraceCheckUtils]: 42: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 18:56:37,001 INFO L273 TraceCheckUtils]: 43: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:56:37,001 INFO L273 TraceCheckUtils]: 44: Hoare triple {5057#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 18:56:37,001 INFO L273 TraceCheckUtils]: 45: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 18:56:37,001 INFO L273 TraceCheckUtils]: 46: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:56:37,001 INFO L273 TraceCheckUtils]: 47: Hoare triple {5057#true} assume !(~i~0 < 100000); {5057#true} is VALID [2018-11-14 18:56:37,001 INFO L273 TraceCheckUtils]: 48: Hoare triple {5057#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5057#true} is VALID [2018-11-14 18:56:37,002 INFO L273 TraceCheckUtils]: 49: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:56:37,002 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {5057#true} {5057#true} #73#return; {5057#true} is VALID [2018-11-14 18:56:37,002 INFO L273 TraceCheckUtils]: 51: Hoare triple {5057#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {5057#true} is VALID [2018-11-14 18:56:37,002 INFO L256 TraceCheckUtils]: 52: Hoare triple {5057#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {5057#true} is VALID [2018-11-14 18:56:37,002 INFO L273 TraceCheckUtils]: 53: Hoare triple {5057#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5057#true} is VALID [2018-11-14 18:56:37,002 INFO L273 TraceCheckUtils]: 54: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:56:37,002 INFO L273 TraceCheckUtils]: 55: Hoare triple {5057#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 18:56:37,002 INFO L273 TraceCheckUtils]: 56: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 18:56:37,002 INFO L273 TraceCheckUtils]: 57: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:56:37,003 INFO L273 TraceCheckUtils]: 58: Hoare triple {5057#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 18:56:37,003 INFO L273 TraceCheckUtils]: 59: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 18:56:37,003 INFO L273 TraceCheckUtils]: 60: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:56:37,003 INFO L273 TraceCheckUtils]: 61: Hoare triple {5057#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 18:56:37,003 INFO L273 TraceCheckUtils]: 62: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 18:56:37,003 INFO L273 TraceCheckUtils]: 63: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:56:37,003 INFO L273 TraceCheckUtils]: 64: Hoare triple {5057#true} assume !(~i~0 < 100000); {5057#true} is VALID [2018-11-14 18:56:37,003 INFO L273 TraceCheckUtils]: 65: Hoare triple {5057#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5057#true} is VALID [2018-11-14 18:56:37,004 INFO L273 TraceCheckUtils]: 66: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:56:37,004 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {5057#true} {5057#true} #75#return; {5057#true} is VALID [2018-11-14 18:56:37,004 INFO L273 TraceCheckUtils]: 68: Hoare triple {5057#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {5057#true} is VALID [2018-11-14 18:56:37,004 INFO L273 TraceCheckUtils]: 69: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:56:37,004 INFO L273 TraceCheckUtils]: 70: Hoare triple {5057#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {5057#true} is VALID [2018-11-14 18:56:37,004 INFO L273 TraceCheckUtils]: 71: Hoare triple {5057#true} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {5057#true} is VALID [2018-11-14 18:56:37,004 INFO L273 TraceCheckUtils]: 72: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:56:37,004 INFO L273 TraceCheckUtils]: 73: Hoare triple {5057#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {5057#true} is VALID [2018-11-14 18:56:37,005 INFO L273 TraceCheckUtils]: 74: Hoare triple {5057#true} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {5057#true} is VALID [2018-11-14 18:56:37,005 INFO L273 TraceCheckUtils]: 75: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 18:56:37,005 INFO L273 TraceCheckUtils]: 76: Hoare triple {5057#true} assume !(~i~2 < 99999); {5057#true} is VALID [2018-11-14 18:56:37,005 INFO L273 TraceCheckUtils]: 77: Hoare triple {5057#true} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {5057#true} is VALID [2018-11-14 18:56:37,005 INFO L256 TraceCheckUtils]: 78: Hoare triple {5057#true} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {5057#true} is VALID [2018-11-14 18:56:37,006 INFO L273 TraceCheckUtils]: 79: Hoare triple {5057#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5309#(<= xor_~i~0 1)} is VALID [2018-11-14 18:56:37,007 INFO L273 TraceCheckUtils]: 80: Hoare triple {5309#(<= xor_~i~0 1)} assume true; {5309#(<= xor_~i~0 1)} is VALID [2018-11-14 18:56:37,007 INFO L273 TraceCheckUtils]: 81: Hoare triple {5309#(<= xor_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5309#(<= xor_~i~0 1)} is VALID [2018-11-14 18:56:37,009 INFO L273 TraceCheckUtils]: 82: Hoare triple {5309#(<= xor_~i~0 1)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5319#(<= xor_~i~0 2)} is VALID [2018-11-14 18:56:37,009 INFO L273 TraceCheckUtils]: 83: Hoare triple {5319#(<= xor_~i~0 2)} assume true; {5319#(<= xor_~i~0 2)} is VALID [2018-11-14 18:56:37,009 INFO L273 TraceCheckUtils]: 84: Hoare triple {5319#(<= xor_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5319#(<= xor_~i~0 2)} is VALID [2018-11-14 18:56:37,010 INFO L273 TraceCheckUtils]: 85: Hoare triple {5319#(<= xor_~i~0 2)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5329#(<= xor_~i~0 3)} is VALID [2018-11-14 18:56:37,010 INFO L273 TraceCheckUtils]: 86: Hoare triple {5329#(<= xor_~i~0 3)} assume true; {5329#(<= xor_~i~0 3)} is VALID [2018-11-14 18:56:37,010 INFO L273 TraceCheckUtils]: 87: Hoare triple {5329#(<= xor_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5329#(<= xor_~i~0 3)} is VALID [2018-11-14 18:56:37,011 INFO L273 TraceCheckUtils]: 88: Hoare triple {5329#(<= xor_~i~0 3)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5339#(<= xor_~i~0 4)} is VALID [2018-11-14 18:56:37,011 INFO L273 TraceCheckUtils]: 89: Hoare triple {5339#(<= xor_~i~0 4)} assume true; {5339#(<= xor_~i~0 4)} is VALID [2018-11-14 18:56:37,012 INFO L273 TraceCheckUtils]: 90: Hoare triple {5339#(<= xor_~i~0 4)} assume !(~i~0 < 100000); {5058#false} is VALID [2018-11-14 18:56:37,012 INFO L273 TraceCheckUtils]: 91: Hoare triple {5058#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5058#false} is VALID [2018-11-14 18:56:37,012 INFO L273 TraceCheckUtils]: 92: Hoare triple {5058#false} assume true; {5058#false} is VALID [2018-11-14 18:56:37,012 INFO L268 TraceCheckUtils]: 93: Hoare quadruple {5058#false} {5057#true} #77#return; {5058#false} is VALID [2018-11-14 18:56:37,012 INFO L273 TraceCheckUtils]: 94: Hoare triple {5058#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {5058#false} is VALID [2018-11-14 18:56:37,012 INFO L273 TraceCheckUtils]: 95: Hoare triple {5058#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {5058#false} is VALID [2018-11-14 18:56:37,012 INFO L273 TraceCheckUtils]: 96: Hoare triple {5058#false} assume !false; {5058#false} is VALID [2018-11-14 18:56:37,017 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 88 proven. 15 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-14 18:56:37,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:56:37,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 16 [2018-11-14 18:56:37,038 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 97 [2018-11-14 18:56:37,039 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:56:37,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-14 18:56:37,122 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-14 18:56:37,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-14 18:56:37,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-14 18:56:37,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-11-14 18:56:37,123 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 16 states. [2018-11-14 18:56:37,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:37,573 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2018-11-14 18:56:37,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 18:56:37,574 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 97 [2018-11-14 18:56:37,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:56:37,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 18:56:37,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 103 transitions. [2018-11-14 18:56:37,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 18:56:37,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 103 transitions. [2018-11-14 18:56:37,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 103 transitions. [2018-11-14 18:56:38,574 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:56:38,576 INFO L225 Difference]: With dead ends: 109 [2018-11-14 18:56:38,576 INFO L226 Difference]: Without dead ends: 76 [2018-11-14 18:56:38,577 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-11-14 18:56:38,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-14 18:56:38,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-11-14 18:56:38,597 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:56:38,597 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 74 states. [2018-11-14 18:56:38,597 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 74 states. [2018-11-14 18:56:38,598 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 74 states. [2018-11-14 18:56:38,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:38,601 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-11-14 18:56:38,601 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-11-14 18:56:38,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:56:38,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:56:38,602 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 76 states. [2018-11-14 18:56:38,602 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 76 states. [2018-11-14 18:56:38,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:38,604 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-11-14 18:56:38,604 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-11-14 18:56:38,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:56:38,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:56:38,605 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:56:38,605 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:56:38,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-14 18:56:38,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2018-11-14 18:56:38,607 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 97 [2018-11-14 18:56:38,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:56:38,607 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2018-11-14 18:56:38,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-14 18:56:38,608 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-11-14 18:56:38,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-14 18:56:38,609 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:56:38,609 INFO L375 BasicCegarLoop]: trace histogram [15, 12, 12, 11, 10, 10, 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] [2018-11-14 18:56:38,609 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:56:38,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:56:38,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1234880144, now seen corresponding path program 10 times [2018-11-14 18:56:38,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:56:38,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:56:38,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:56:38,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:56:38,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:56:38,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:56:38,858 INFO L256 TraceCheckUtils]: 0: Hoare triple {5763#true} call ULTIMATE.init(); {5763#true} is VALID [2018-11-14 18:56:38,859 INFO L273 TraceCheckUtils]: 1: Hoare triple {5763#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5763#true} is VALID [2018-11-14 18:56:38,859 INFO L273 TraceCheckUtils]: 2: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 18:56:38,859 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5763#true} {5763#true} #69#return; {5763#true} is VALID [2018-11-14 18:56:38,859 INFO L256 TraceCheckUtils]: 4: Hoare triple {5763#true} call #t~ret13 := main(); {5763#true} is VALID [2018-11-14 18:56:38,859 INFO L273 TraceCheckUtils]: 5: Hoare triple {5763#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; {5765#(= main_~i~1 0)} is VALID [2018-11-14 18:56:38,860 INFO L273 TraceCheckUtils]: 6: Hoare triple {5765#(= main_~i~1 0)} assume true; {5765#(= main_~i~1 0)} is VALID [2018-11-14 18:56:38,860 INFO L273 TraceCheckUtils]: 7: Hoare triple {5765#(= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {5765#(= main_~i~1 0)} is VALID [2018-11-14 18:56:38,861 INFO L273 TraceCheckUtils]: 8: Hoare triple {5765#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5766#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:38,861 INFO L273 TraceCheckUtils]: 9: Hoare triple {5766#(<= main_~i~1 1)} assume true; {5766#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:38,861 INFO L273 TraceCheckUtils]: 10: Hoare triple {5766#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {5766#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:38,862 INFO L273 TraceCheckUtils]: 11: Hoare triple {5766#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5767#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:38,863 INFO L273 TraceCheckUtils]: 12: Hoare triple {5767#(<= main_~i~1 2)} assume true; {5767#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:38,863 INFO L273 TraceCheckUtils]: 13: Hoare triple {5767#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {5767#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:38,866 INFO L273 TraceCheckUtils]: 14: Hoare triple {5767#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5768#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:38,867 INFO L273 TraceCheckUtils]: 15: Hoare triple {5768#(<= main_~i~1 3)} assume true; {5768#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:38,867 INFO L273 TraceCheckUtils]: 16: Hoare triple {5768#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {5768#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:38,868 INFO L273 TraceCheckUtils]: 17: Hoare triple {5768#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5769#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:38,868 INFO L273 TraceCheckUtils]: 18: Hoare triple {5769#(<= main_~i~1 4)} assume true; {5769#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:38,868 INFO L273 TraceCheckUtils]: 19: Hoare triple {5769#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {5769#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:38,869 INFO L273 TraceCheckUtils]: 20: Hoare triple {5769#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5770#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:38,869 INFO L273 TraceCheckUtils]: 21: Hoare triple {5770#(<= main_~i~1 5)} assume true; {5770#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:38,869 INFO L273 TraceCheckUtils]: 22: Hoare triple {5770#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {5770#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:38,870 INFO L273 TraceCheckUtils]: 23: Hoare triple {5770#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5771#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:38,870 INFO L273 TraceCheckUtils]: 24: Hoare triple {5771#(<= main_~i~1 6)} assume true; {5771#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:38,870 INFO L273 TraceCheckUtils]: 25: Hoare triple {5771#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {5771#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:38,871 INFO L273 TraceCheckUtils]: 26: Hoare triple {5771#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5772#(<= main_~i~1 7)} is VALID [2018-11-14 18:56:38,871 INFO L273 TraceCheckUtils]: 27: Hoare triple {5772#(<= main_~i~1 7)} assume true; {5772#(<= main_~i~1 7)} is VALID [2018-11-14 18:56:38,872 INFO L273 TraceCheckUtils]: 28: Hoare triple {5772#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {5772#(<= main_~i~1 7)} is VALID [2018-11-14 18:56:38,872 INFO L273 TraceCheckUtils]: 29: Hoare triple {5772#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5773#(<= main_~i~1 8)} is VALID [2018-11-14 18:56:38,873 INFO L273 TraceCheckUtils]: 30: Hoare triple {5773#(<= main_~i~1 8)} assume true; {5773#(<= main_~i~1 8)} is VALID [2018-11-14 18:56:38,874 INFO L273 TraceCheckUtils]: 31: Hoare triple {5773#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {5773#(<= main_~i~1 8)} is VALID [2018-11-14 18:56:38,874 INFO L273 TraceCheckUtils]: 32: Hoare triple {5773#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5774#(<= main_~i~1 9)} is VALID [2018-11-14 18:56:38,875 INFO L273 TraceCheckUtils]: 33: Hoare triple {5774#(<= main_~i~1 9)} assume true; {5774#(<= main_~i~1 9)} is VALID [2018-11-14 18:56:38,875 INFO L273 TraceCheckUtils]: 34: Hoare triple {5774#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {5774#(<= main_~i~1 9)} is VALID [2018-11-14 18:56:38,876 INFO L273 TraceCheckUtils]: 35: Hoare triple {5774#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5775#(<= main_~i~1 10)} is VALID [2018-11-14 18:56:38,877 INFO L273 TraceCheckUtils]: 36: Hoare triple {5775#(<= main_~i~1 10)} assume true; {5775#(<= main_~i~1 10)} is VALID [2018-11-14 18:56:38,877 INFO L273 TraceCheckUtils]: 37: Hoare triple {5775#(<= main_~i~1 10)} assume !(~i~1 < 100000); {5764#false} is VALID [2018-11-14 18:56:38,878 INFO L256 TraceCheckUtils]: 38: Hoare triple {5764#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {5763#true} is VALID [2018-11-14 18:56:38,878 INFO L273 TraceCheckUtils]: 39: Hoare triple {5763#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5763#true} is VALID [2018-11-14 18:56:38,878 INFO L273 TraceCheckUtils]: 40: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 18:56:38,878 INFO L273 TraceCheckUtils]: 41: Hoare triple {5763#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 18:56:38,878 INFO L273 TraceCheckUtils]: 42: Hoare triple {5763#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5763#true} is VALID [2018-11-14 18:56:38,879 INFO L273 TraceCheckUtils]: 43: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 18:56:38,879 INFO L273 TraceCheckUtils]: 44: Hoare triple {5763#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 18:56:38,879 INFO L273 TraceCheckUtils]: 45: Hoare triple {5763#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5763#true} is VALID [2018-11-14 18:56:38,879 INFO L273 TraceCheckUtils]: 46: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 18:56:38,879 INFO L273 TraceCheckUtils]: 47: Hoare triple {5763#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 18:56:38,879 INFO L273 TraceCheckUtils]: 48: Hoare triple {5763#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5763#true} is VALID [2018-11-14 18:56:38,880 INFO L273 TraceCheckUtils]: 49: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 18:56:38,880 INFO L273 TraceCheckUtils]: 50: Hoare triple {5763#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 18:56:38,880 INFO L273 TraceCheckUtils]: 51: Hoare triple {5763#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5763#true} is VALID [2018-11-14 18:56:38,880 INFO L273 TraceCheckUtils]: 52: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 18:56:38,880 INFO L273 TraceCheckUtils]: 53: Hoare triple {5763#true} assume !(~i~0 < 100000); {5763#true} is VALID [2018-11-14 18:56:38,880 INFO L273 TraceCheckUtils]: 54: Hoare triple {5763#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5763#true} is VALID [2018-11-14 18:56:38,880 INFO L273 TraceCheckUtils]: 55: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 18:56:38,881 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {5763#true} {5764#false} #73#return; {5764#false} is VALID [2018-11-14 18:56:38,881 INFO L273 TraceCheckUtils]: 57: Hoare triple {5764#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {5764#false} is VALID [2018-11-14 18:56:38,881 INFO L256 TraceCheckUtils]: 58: Hoare triple {5764#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {5763#true} is VALID [2018-11-14 18:56:38,881 INFO L273 TraceCheckUtils]: 59: Hoare triple {5763#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5763#true} is VALID [2018-11-14 18:56:38,881 INFO L273 TraceCheckUtils]: 60: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 18:56:38,881 INFO L273 TraceCheckUtils]: 61: Hoare triple {5763#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 18:56:38,882 INFO L273 TraceCheckUtils]: 62: Hoare triple {5763#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5763#true} is VALID [2018-11-14 18:56:38,882 INFO L273 TraceCheckUtils]: 63: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 18:56:38,882 INFO L273 TraceCheckUtils]: 64: Hoare triple {5763#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 18:56:38,882 INFO L273 TraceCheckUtils]: 65: Hoare triple {5763#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5763#true} is VALID [2018-11-14 18:56:38,882 INFO L273 TraceCheckUtils]: 66: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 18:56:38,883 INFO L273 TraceCheckUtils]: 67: Hoare triple {5763#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 18:56:38,883 INFO L273 TraceCheckUtils]: 68: Hoare triple {5763#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5763#true} is VALID [2018-11-14 18:56:38,883 INFO L273 TraceCheckUtils]: 69: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 18:56:38,883 INFO L273 TraceCheckUtils]: 70: Hoare triple {5763#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 18:56:38,883 INFO L273 TraceCheckUtils]: 71: Hoare triple {5763#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5763#true} is VALID [2018-11-14 18:56:38,883 INFO L273 TraceCheckUtils]: 72: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 18:56:38,884 INFO L273 TraceCheckUtils]: 73: Hoare triple {5763#true} assume !(~i~0 < 100000); {5763#true} is VALID [2018-11-14 18:56:38,884 INFO L273 TraceCheckUtils]: 74: Hoare triple {5763#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5763#true} is VALID [2018-11-14 18:56:38,884 INFO L273 TraceCheckUtils]: 75: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 18:56:38,884 INFO L268 TraceCheckUtils]: 76: Hoare quadruple {5763#true} {5764#false} #75#return; {5764#false} is VALID [2018-11-14 18:56:38,884 INFO L273 TraceCheckUtils]: 77: Hoare triple {5764#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {5764#false} is VALID [2018-11-14 18:56:38,884 INFO L273 TraceCheckUtils]: 78: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 18:56:38,885 INFO L273 TraceCheckUtils]: 79: Hoare triple {5764#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {5764#false} is VALID [2018-11-14 18:56:38,885 INFO L273 TraceCheckUtils]: 80: Hoare triple {5764#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {5764#false} is VALID [2018-11-14 18:56:38,885 INFO L273 TraceCheckUtils]: 81: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 18:56:38,885 INFO L273 TraceCheckUtils]: 82: Hoare triple {5764#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {5764#false} is VALID [2018-11-14 18:56:38,885 INFO L273 TraceCheckUtils]: 83: Hoare triple {5764#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {5764#false} is VALID [2018-11-14 18:56:38,886 INFO L273 TraceCheckUtils]: 84: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 18:56:38,886 INFO L273 TraceCheckUtils]: 85: Hoare triple {5764#false} assume !(~i~2 < 99999); {5764#false} is VALID [2018-11-14 18:56:38,886 INFO L273 TraceCheckUtils]: 86: Hoare triple {5764#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {5764#false} is VALID [2018-11-14 18:56:38,886 INFO L256 TraceCheckUtils]: 87: Hoare triple {5764#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {5763#true} is VALID [2018-11-14 18:56:38,886 INFO L273 TraceCheckUtils]: 88: Hoare triple {5763#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5763#true} is VALID [2018-11-14 18:56:38,886 INFO L273 TraceCheckUtils]: 89: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 18:56:38,887 INFO L273 TraceCheckUtils]: 90: Hoare triple {5763#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 18:56:38,887 INFO L273 TraceCheckUtils]: 91: Hoare triple {5763#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5763#true} is VALID [2018-11-14 18:56:38,887 INFO L273 TraceCheckUtils]: 92: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 18:56:38,887 INFO L273 TraceCheckUtils]: 93: Hoare triple {5763#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 18:56:38,887 INFO L273 TraceCheckUtils]: 94: Hoare triple {5763#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5763#true} is VALID [2018-11-14 18:56:38,887 INFO L273 TraceCheckUtils]: 95: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 18:56:38,888 INFO L273 TraceCheckUtils]: 96: Hoare triple {5763#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 18:56:38,888 INFO L273 TraceCheckUtils]: 97: Hoare triple {5763#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5763#true} is VALID [2018-11-14 18:56:38,888 INFO L273 TraceCheckUtils]: 98: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 18:56:38,888 INFO L273 TraceCheckUtils]: 99: Hoare triple {5763#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 18:56:38,888 INFO L273 TraceCheckUtils]: 100: Hoare triple {5763#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5763#true} is VALID [2018-11-14 18:56:38,888 INFO L273 TraceCheckUtils]: 101: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 18:56:38,889 INFO L273 TraceCheckUtils]: 102: Hoare triple {5763#true} assume !(~i~0 < 100000); {5763#true} is VALID [2018-11-14 18:56:38,889 INFO L273 TraceCheckUtils]: 103: Hoare triple {5763#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5763#true} is VALID [2018-11-14 18:56:38,889 INFO L273 TraceCheckUtils]: 104: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 18:56:38,889 INFO L268 TraceCheckUtils]: 105: Hoare quadruple {5763#true} {5764#false} #77#return; {5764#false} is VALID [2018-11-14 18:56:38,889 INFO L273 TraceCheckUtils]: 106: Hoare triple {5764#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {5764#false} is VALID [2018-11-14 18:56:38,889 INFO L273 TraceCheckUtils]: 107: Hoare triple {5764#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {5764#false} is VALID [2018-11-14 18:56:38,890 INFO L273 TraceCheckUtils]: 108: Hoare triple {5764#false} assume !false; {5764#false} is VALID [2018-11-14 18:56:38,898 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2018-11-14 18:56:38,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:56:38,898 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-14 18:56:38,916 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:56:38,955 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:56:38,955 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:56:38,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:56:38,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:56:39,104 INFO L256 TraceCheckUtils]: 0: Hoare triple {5763#true} call ULTIMATE.init(); {5763#true} is VALID [2018-11-14 18:56:39,104 INFO L273 TraceCheckUtils]: 1: Hoare triple {5763#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5763#true} is VALID [2018-11-14 18:56:39,104 INFO L273 TraceCheckUtils]: 2: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 18:56:39,105 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5763#true} {5763#true} #69#return; {5763#true} is VALID [2018-11-14 18:56:39,105 INFO L256 TraceCheckUtils]: 4: Hoare triple {5763#true} call #t~ret13 := main(); {5763#true} is VALID [2018-11-14 18:56:39,106 INFO L273 TraceCheckUtils]: 5: Hoare triple {5763#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; {5794#(<= main_~i~1 0)} is VALID [2018-11-14 18:56:39,106 INFO L273 TraceCheckUtils]: 6: Hoare triple {5794#(<= main_~i~1 0)} assume true; {5794#(<= main_~i~1 0)} is VALID [2018-11-14 18:56:39,107 INFO L273 TraceCheckUtils]: 7: Hoare triple {5794#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {5794#(<= main_~i~1 0)} is VALID [2018-11-14 18:56:39,107 INFO L273 TraceCheckUtils]: 8: Hoare triple {5794#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5766#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:39,108 INFO L273 TraceCheckUtils]: 9: Hoare triple {5766#(<= main_~i~1 1)} assume true; {5766#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:39,108 INFO L273 TraceCheckUtils]: 10: Hoare triple {5766#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {5766#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:39,109 INFO L273 TraceCheckUtils]: 11: Hoare triple {5766#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5767#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:39,110 INFO L273 TraceCheckUtils]: 12: Hoare triple {5767#(<= main_~i~1 2)} assume true; {5767#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:39,110 INFO L273 TraceCheckUtils]: 13: Hoare triple {5767#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {5767#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:39,111 INFO L273 TraceCheckUtils]: 14: Hoare triple {5767#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5768#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:39,111 INFO L273 TraceCheckUtils]: 15: Hoare triple {5768#(<= main_~i~1 3)} assume true; {5768#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:39,112 INFO L273 TraceCheckUtils]: 16: Hoare triple {5768#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {5768#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:39,113 INFO L273 TraceCheckUtils]: 17: Hoare triple {5768#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5769#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:39,113 INFO L273 TraceCheckUtils]: 18: Hoare triple {5769#(<= main_~i~1 4)} assume true; {5769#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:39,114 INFO L273 TraceCheckUtils]: 19: Hoare triple {5769#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {5769#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:39,114 INFO L273 TraceCheckUtils]: 20: Hoare triple {5769#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5770#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:39,115 INFO L273 TraceCheckUtils]: 21: Hoare triple {5770#(<= main_~i~1 5)} assume true; {5770#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:39,115 INFO L273 TraceCheckUtils]: 22: Hoare triple {5770#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {5770#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:39,116 INFO L273 TraceCheckUtils]: 23: Hoare triple {5770#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5771#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:39,116 INFO L273 TraceCheckUtils]: 24: Hoare triple {5771#(<= main_~i~1 6)} assume true; {5771#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:39,117 INFO L273 TraceCheckUtils]: 25: Hoare triple {5771#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {5771#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:39,118 INFO L273 TraceCheckUtils]: 26: Hoare triple {5771#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5772#(<= main_~i~1 7)} is VALID [2018-11-14 18:56:39,118 INFO L273 TraceCheckUtils]: 27: Hoare triple {5772#(<= main_~i~1 7)} assume true; {5772#(<= main_~i~1 7)} is VALID [2018-11-14 18:56:39,119 INFO L273 TraceCheckUtils]: 28: Hoare triple {5772#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {5772#(<= main_~i~1 7)} is VALID [2018-11-14 18:56:39,120 INFO L273 TraceCheckUtils]: 29: Hoare triple {5772#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5773#(<= main_~i~1 8)} is VALID [2018-11-14 18:56:39,120 INFO L273 TraceCheckUtils]: 30: Hoare triple {5773#(<= main_~i~1 8)} assume true; {5773#(<= main_~i~1 8)} is VALID [2018-11-14 18:56:39,121 INFO L273 TraceCheckUtils]: 31: Hoare triple {5773#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {5773#(<= main_~i~1 8)} is VALID [2018-11-14 18:56:39,121 INFO L273 TraceCheckUtils]: 32: Hoare triple {5773#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5774#(<= main_~i~1 9)} is VALID [2018-11-14 18:56:39,122 INFO L273 TraceCheckUtils]: 33: Hoare triple {5774#(<= main_~i~1 9)} assume true; {5774#(<= main_~i~1 9)} is VALID [2018-11-14 18:56:39,122 INFO L273 TraceCheckUtils]: 34: Hoare triple {5774#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {5774#(<= main_~i~1 9)} is VALID [2018-11-14 18:56:39,123 INFO L273 TraceCheckUtils]: 35: Hoare triple {5774#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5775#(<= main_~i~1 10)} is VALID [2018-11-14 18:56:39,124 INFO L273 TraceCheckUtils]: 36: Hoare triple {5775#(<= main_~i~1 10)} assume true; {5775#(<= main_~i~1 10)} is VALID [2018-11-14 18:56:39,124 INFO L273 TraceCheckUtils]: 37: Hoare triple {5775#(<= main_~i~1 10)} assume !(~i~1 < 100000); {5764#false} is VALID [2018-11-14 18:56:39,124 INFO L256 TraceCheckUtils]: 38: Hoare triple {5764#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {5764#false} is VALID [2018-11-14 18:56:39,125 INFO L273 TraceCheckUtils]: 39: Hoare triple {5764#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5764#false} is VALID [2018-11-14 18:56:39,125 INFO L273 TraceCheckUtils]: 40: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 18:56:39,125 INFO L273 TraceCheckUtils]: 41: Hoare triple {5764#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 18:56:39,125 INFO L273 TraceCheckUtils]: 42: Hoare triple {5764#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5764#false} is VALID [2018-11-14 18:56:39,125 INFO L273 TraceCheckUtils]: 43: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 18:56:39,126 INFO L273 TraceCheckUtils]: 44: Hoare triple {5764#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 18:56:39,126 INFO L273 TraceCheckUtils]: 45: Hoare triple {5764#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5764#false} is VALID [2018-11-14 18:56:39,126 INFO L273 TraceCheckUtils]: 46: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 18:56:39,126 INFO L273 TraceCheckUtils]: 47: Hoare triple {5764#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 18:56:39,127 INFO L273 TraceCheckUtils]: 48: Hoare triple {5764#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5764#false} is VALID [2018-11-14 18:56:39,127 INFO L273 TraceCheckUtils]: 49: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 18:56:39,127 INFO L273 TraceCheckUtils]: 50: Hoare triple {5764#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 18:56:39,127 INFO L273 TraceCheckUtils]: 51: Hoare triple {5764#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5764#false} is VALID [2018-11-14 18:56:39,127 INFO L273 TraceCheckUtils]: 52: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 18:56:39,127 INFO L273 TraceCheckUtils]: 53: Hoare triple {5764#false} assume !(~i~0 < 100000); {5764#false} is VALID [2018-11-14 18:56:39,128 INFO L273 TraceCheckUtils]: 54: Hoare triple {5764#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5764#false} is VALID [2018-11-14 18:56:39,128 INFO L273 TraceCheckUtils]: 55: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 18:56:39,128 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {5764#false} {5764#false} #73#return; {5764#false} is VALID [2018-11-14 18:56:39,128 INFO L273 TraceCheckUtils]: 57: Hoare triple {5764#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {5764#false} is VALID [2018-11-14 18:56:39,128 INFO L256 TraceCheckUtils]: 58: Hoare triple {5764#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {5764#false} is VALID [2018-11-14 18:56:39,128 INFO L273 TraceCheckUtils]: 59: Hoare triple {5764#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5764#false} is VALID [2018-11-14 18:56:39,129 INFO L273 TraceCheckUtils]: 60: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 18:56:39,129 INFO L273 TraceCheckUtils]: 61: Hoare triple {5764#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 18:56:39,129 INFO L273 TraceCheckUtils]: 62: Hoare triple {5764#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5764#false} is VALID [2018-11-14 18:56:39,129 INFO L273 TraceCheckUtils]: 63: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 18:56:39,129 INFO L273 TraceCheckUtils]: 64: Hoare triple {5764#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 18:56:39,129 INFO L273 TraceCheckUtils]: 65: Hoare triple {5764#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5764#false} is VALID [2018-11-14 18:56:39,130 INFO L273 TraceCheckUtils]: 66: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 18:56:39,130 INFO L273 TraceCheckUtils]: 67: Hoare triple {5764#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 18:56:39,130 INFO L273 TraceCheckUtils]: 68: Hoare triple {5764#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5764#false} is VALID [2018-11-14 18:56:39,130 INFO L273 TraceCheckUtils]: 69: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 18:56:39,130 INFO L273 TraceCheckUtils]: 70: Hoare triple {5764#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 18:56:39,130 INFO L273 TraceCheckUtils]: 71: Hoare triple {5764#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5764#false} is VALID [2018-11-14 18:56:39,131 INFO L273 TraceCheckUtils]: 72: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 18:56:39,131 INFO L273 TraceCheckUtils]: 73: Hoare triple {5764#false} assume !(~i~0 < 100000); {5764#false} is VALID [2018-11-14 18:56:39,131 INFO L273 TraceCheckUtils]: 74: Hoare triple {5764#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5764#false} is VALID [2018-11-14 18:56:39,131 INFO L273 TraceCheckUtils]: 75: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 18:56:39,131 INFO L268 TraceCheckUtils]: 76: Hoare quadruple {5764#false} {5764#false} #75#return; {5764#false} is VALID [2018-11-14 18:56:39,131 INFO L273 TraceCheckUtils]: 77: Hoare triple {5764#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {5764#false} is VALID [2018-11-14 18:56:39,132 INFO L273 TraceCheckUtils]: 78: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 18:56:39,132 INFO L273 TraceCheckUtils]: 79: Hoare triple {5764#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {5764#false} is VALID [2018-11-14 18:56:39,132 INFO L273 TraceCheckUtils]: 80: Hoare triple {5764#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {5764#false} is VALID [2018-11-14 18:56:39,132 INFO L273 TraceCheckUtils]: 81: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 18:56:39,132 INFO L273 TraceCheckUtils]: 82: Hoare triple {5764#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {5764#false} is VALID [2018-11-14 18:56:39,132 INFO L273 TraceCheckUtils]: 83: Hoare triple {5764#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {5764#false} is VALID [2018-11-14 18:56:39,132 INFO L273 TraceCheckUtils]: 84: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 18:56:39,133 INFO L273 TraceCheckUtils]: 85: Hoare triple {5764#false} assume !(~i~2 < 99999); {5764#false} is VALID [2018-11-14 18:56:39,133 INFO L273 TraceCheckUtils]: 86: Hoare triple {5764#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {5764#false} is VALID [2018-11-14 18:56:39,133 INFO L256 TraceCheckUtils]: 87: Hoare triple {5764#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {5764#false} is VALID [2018-11-14 18:56:39,133 INFO L273 TraceCheckUtils]: 88: Hoare triple {5764#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5764#false} is VALID [2018-11-14 18:56:39,133 INFO L273 TraceCheckUtils]: 89: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 18:56:39,133 INFO L273 TraceCheckUtils]: 90: Hoare triple {5764#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 18:56:39,134 INFO L273 TraceCheckUtils]: 91: Hoare triple {5764#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5764#false} is VALID [2018-11-14 18:56:39,134 INFO L273 TraceCheckUtils]: 92: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 18:56:39,134 INFO L273 TraceCheckUtils]: 93: Hoare triple {5764#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 18:56:39,134 INFO L273 TraceCheckUtils]: 94: Hoare triple {5764#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5764#false} is VALID [2018-11-14 18:56:39,134 INFO L273 TraceCheckUtils]: 95: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 18:56:39,134 INFO L273 TraceCheckUtils]: 96: Hoare triple {5764#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 18:56:39,135 INFO L273 TraceCheckUtils]: 97: Hoare triple {5764#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5764#false} is VALID [2018-11-14 18:56:39,135 INFO L273 TraceCheckUtils]: 98: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 18:56:39,135 INFO L273 TraceCheckUtils]: 99: Hoare triple {5764#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 18:56:39,135 INFO L273 TraceCheckUtils]: 100: Hoare triple {5764#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5764#false} is VALID [2018-11-14 18:56:39,135 INFO L273 TraceCheckUtils]: 101: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 18:56:39,135 INFO L273 TraceCheckUtils]: 102: Hoare triple {5764#false} assume !(~i~0 < 100000); {5764#false} is VALID [2018-11-14 18:56:39,135 INFO L273 TraceCheckUtils]: 103: Hoare triple {5764#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5764#false} is VALID [2018-11-14 18:56:39,136 INFO L273 TraceCheckUtils]: 104: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 18:56:39,136 INFO L268 TraceCheckUtils]: 105: Hoare quadruple {5764#false} {5764#false} #77#return; {5764#false} is VALID [2018-11-14 18:56:39,136 INFO L273 TraceCheckUtils]: 106: Hoare triple {5764#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {5764#false} is VALID [2018-11-14 18:56:39,136 INFO L273 TraceCheckUtils]: 107: Hoare triple {5764#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {5764#false} is VALID [2018-11-14 18:56:39,136 INFO L273 TraceCheckUtils]: 108: Hoare triple {5764#false} assume !false; {5764#false} is VALID [2018-11-14 18:56:39,142 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2018-11-14 18:56:39,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:56:39,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-14 18:56:39,163 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 109 [2018-11-14 18:56:39,165 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:56:39,165 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 18:56:39,240 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:56:39,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 18:56:39,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 18:56:39,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-14 18:56:39,242 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 14 states. [2018-11-14 18:56:39,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:39,591 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2018-11-14 18:56:39,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 18:56:39,592 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 109 [2018-11-14 18:56:39,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:56:39,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 18:56:39,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 90 transitions. [2018-11-14 18:56:39,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 18:56:39,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 90 transitions. [2018-11-14 18:56:39,595 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 90 transitions. [2018-11-14 18:56:39,710 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-14 18:56:39,712 INFO L225 Difference]: With dead ends: 114 [2018-11-14 18:56:39,712 INFO L226 Difference]: Without dead ends: 78 [2018-11-14 18:56:39,713 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-14 18:56:39,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-14 18:56:39,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-11-14 18:56:39,765 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:56:39,765 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 77 states. [2018-11-14 18:56:39,765 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 77 states. [2018-11-14 18:56:39,765 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 77 states. [2018-11-14 18:56:39,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:39,767 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-11-14 18:56:39,767 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-11-14 18:56:39,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:56:39,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:56:39,768 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 78 states. [2018-11-14 18:56:39,768 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 78 states. [2018-11-14 18:56:39,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:39,770 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-11-14 18:56:39,770 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-11-14 18:56:39,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:56:39,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:56:39,771 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:56:39,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:56:39,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-14 18:56:39,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-11-14 18:56:39,773 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 109 [2018-11-14 18:56:39,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:56:39,774 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-11-14 18:56:39,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 18:56:39,774 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-14 18:56:39,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-14 18:56:39,775 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:56:39,775 INFO L375 BasicCegarLoop]: trace histogram [15, 12, 12, 12, 11, 11, 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] [2018-11-14 18:56:39,775 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:56:39,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:56:39,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1525893034, now seen corresponding path program 11 times [2018-11-14 18:56:39,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:56:39,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:56:39,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:56:39,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:56:39,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:56:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:56:40,593 INFO L256 TraceCheckUtils]: 0: Hoare triple {6518#true} call ULTIMATE.init(); {6518#true} is VALID [2018-11-14 18:56:40,594 INFO L273 TraceCheckUtils]: 1: Hoare triple {6518#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6518#true} is VALID [2018-11-14 18:56:40,594 INFO L273 TraceCheckUtils]: 2: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:56:40,594 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6518#true} {6518#true} #69#return; {6518#true} is VALID [2018-11-14 18:56:40,595 INFO L256 TraceCheckUtils]: 4: Hoare triple {6518#true} call #t~ret13 := main(); {6518#true} is VALID [2018-11-14 18:56:40,595 INFO L273 TraceCheckUtils]: 5: Hoare triple {6518#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; {6520#(= main_~i~1 0)} is VALID [2018-11-14 18:56:40,596 INFO L273 TraceCheckUtils]: 6: Hoare triple {6520#(= main_~i~1 0)} assume true; {6520#(= main_~i~1 0)} is VALID [2018-11-14 18:56:40,596 INFO L273 TraceCheckUtils]: 7: Hoare triple {6520#(= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {6520#(= main_~i~1 0)} is VALID [2018-11-14 18:56:40,597 INFO L273 TraceCheckUtils]: 8: Hoare triple {6520#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6521#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:40,597 INFO L273 TraceCheckUtils]: 9: Hoare triple {6521#(<= main_~i~1 1)} assume true; {6521#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:40,598 INFO L273 TraceCheckUtils]: 10: Hoare triple {6521#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {6521#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:40,599 INFO L273 TraceCheckUtils]: 11: Hoare triple {6521#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6522#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:40,599 INFO L273 TraceCheckUtils]: 12: Hoare triple {6522#(<= main_~i~1 2)} assume true; {6522#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:40,600 INFO L273 TraceCheckUtils]: 13: Hoare triple {6522#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {6522#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:40,601 INFO L273 TraceCheckUtils]: 14: Hoare triple {6522#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6523#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:40,601 INFO L273 TraceCheckUtils]: 15: Hoare triple {6523#(<= main_~i~1 3)} assume true; {6523#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:40,602 INFO L273 TraceCheckUtils]: 16: Hoare triple {6523#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {6523#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:40,602 INFO L273 TraceCheckUtils]: 17: Hoare triple {6523#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6524#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:40,603 INFO L273 TraceCheckUtils]: 18: Hoare triple {6524#(<= main_~i~1 4)} assume true; {6524#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:40,603 INFO L273 TraceCheckUtils]: 19: Hoare triple {6524#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {6524#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:40,604 INFO L273 TraceCheckUtils]: 20: Hoare triple {6524#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6525#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:40,605 INFO L273 TraceCheckUtils]: 21: Hoare triple {6525#(<= main_~i~1 5)} assume true; {6525#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:40,605 INFO L273 TraceCheckUtils]: 22: Hoare triple {6525#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {6525#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:40,606 INFO L273 TraceCheckUtils]: 23: Hoare triple {6525#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6526#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:40,607 INFO L273 TraceCheckUtils]: 24: Hoare triple {6526#(<= main_~i~1 6)} assume true; {6526#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:40,607 INFO L273 TraceCheckUtils]: 25: Hoare triple {6526#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {6526#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:40,608 INFO L273 TraceCheckUtils]: 26: Hoare triple {6526#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6527#(<= main_~i~1 7)} is VALID [2018-11-14 18:56:40,608 INFO L273 TraceCheckUtils]: 27: Hoare triple {6527#(<= main_~i~1 7)} assume true; {6527#(<= main_~i~1 7)} is VALID [2018-11-14 18:56:40,609 INFO L273 TraceCheckUtils]: 28: Hoare triple {6527#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {6527#(<= main_~i~1 7)} is VALID [2018-11-14 18:56:40,610 INFO L273 TraceCheckUtils]: 29: Hoare triple {6527#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6528#(<= main_~i~1 8)} is VALID [2018-11-14 18:56:40,610 INFO L273 TraceCheckUtils]: 30: Hoare triple {6528#(<= main_~i~1 8)} assume true; {6528#(<= main_~i~1 8)} is VALID [2018-11-14 18:56:40,611 INFO L273 TraceCheckUtils]: 31: Hoare triple {6528#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {6528#(<= main_~i~1 8)} is VALID [2018-11-14 18:56:40,611 INFO L273 TraceCheckUtils]: 32: Hoare triple {6528#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6529#(<= main_~i~1 9)} is VALID [2018-11-14 18:56:40,612 INFO L273 TraceCheckUtils]: 33: Hoare triple {6529#(<= main_~i~1 9)} assume true; {6529#(<= main_~i~1 9)} is VALID [2018-11-14 18:56:40,613 INFO L273 TraceCheckUtils]: 34: Hoare triple {6529#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {6529#(<= main_~i~1 9)} is VALID [2018-11-14 18:56:40,613 INFO L273 TraceCheckUtils]: 35: Hoare triple {6529#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6530#(<= main_~i~1 10)} is VALID [2018-11-14 18:56:40,614 INFO L273 TraceCheckUtils]: 36: Hoare triple {6530#(<= main_~i~1 10)} assume true; {6530#(<= main_~i~1 10)} is VALID [2018-11-14 18:56:40,614 INFO L273 TraceCheckUtils]: 37: Hoare triple {6530#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {6530#(<= main_~i~1 10)} is VALID [2018-11-14 18:56:40,615 INFO L273 TraceCheckUtils]: 38: Hoare triple {6530#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6531#(<= main_~i~1 11)} is VALID [2018-11-14 18:56:40,616 INFO L273 TraceCheckUtils]: 39: Hoare triple {6531#(<= main_~i~1 11)} assume true; {6531#(<= main_~i~1 11)} is VALID [2018-11-14 18:56:40,616 INFO L273 TraceCheckUtils]: 40: Hoare triple {6531#(<= main_~i~1 11)} assume !(~i~1 < 100000); {6519#false} is VALID [2018-11-14 18:56:40,617 INFO L256 TraceCheckUtils]: 41: Hoare triple {6519#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {6518#true} is VALID [2018-11-14 18:56:40,617 INFO L273 TraceCheckUtils]: 42: Hoare triple {6518#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {6518#true} is VALID [2018-11-14 18:56:40,617 INFO L273 TraceCheckUtils]: 43: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:56:40,617 INFO L273 TraceCheckUtils]: 44: Hoare triple {6518#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 18:56:40,617 INFO L273 TraceCheckUtils]: 45: Hoare triple {6518#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6518#true} is VALID [2018-11-14 18:56:40,618 INFO L273 TraceCheckUtils]: 46: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:56:40,618 INFO L273 TraceCheckUtils]: 47: Hoare triple {6518#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 18:56:40,618 INFO L273 TraceCheckUtils]: 48: Hoare triple {6518#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6518#true} is VALID [2018-11-14 18:56:40,618 INFO L273 TraceCheckUtils]: 49: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:56:40,618 INFO L273 TraceCheckUtils]: 50: Hoare triple {6518#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 18:56:40,619 INFO L273 TraceCheckUtils]: 51: Hoare triple {6518#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6518#true} is VALID [2018-11-14 18:56:40,619 INFO L273 TraceCheckUtils]: 52: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:56:40,619 INFO L273 TraceCheckUtils]: 53: Hoare triple {6518#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 18:56:40,619 INFO L273 TraceCheckUtils]: 54: Hoare triple {6518#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6518#true} is VALID [2018-11-14 18:56:40,619 INFO L273 TraceCheckUtils]: 55: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:56:40,620 INFO L273 TraceCheckUtils]: 56: Hoare triple {6518#true} assume !(~i~0 < 100000); {6518#true} is VALID [2018-11-14 18:56:40,620 INFO L273 TraceCheckUtils]: 57: Hoare triple {6518#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6518#true} is VALID [2018-11-14 18:56:40,620 INFO L273 TraceCheckUtils]: 58: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:56:40,620 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {6518#true} {6519#false} #73#return; {6519#false} is VALID [2018-11-14 18:56:40,620 INFO L273 TraceCheckUtils]: 60: Hoare triple {6519#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {6519#false} is VALID [2018-11-14 18:56:40,621 INFO L256 TraceCheckUtils]: 61: Hoare triple {6519#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {6518#true} is VALID [2018-11-14 18:56:40,621 INFO L273 TraceCheckUtils]: 62: Hoare triple {6518#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {6518#true} is VALID [2018-11-14 18:56:40,621 INFO L273 TraceCheckUtils]: 63: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:56:40,621 INFO L273 TraceCheckUtils]: 64: Hoare triple {6518#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 18:56:40,621 INFO L273 TraceCheckUtils]: 65: Hoare triple {6518#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6518#true} is VALID [2018-11-14 18:56:40,621 INFO L273 TraceCheckUtils]: 66: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:56:40,621 INFO L273 TraceCheckUtils]: 67: Hoare triple {6518#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 18:56:40,621 INFO L273 TraceCheckUtils]: 68: Hoare triple {6518#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6518#true} is VALID [2018-11-14 18:56:40,621 INFO L273 TraceCheckUtils]: 69: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:56:40,622 INFO L273 TraceCheckUtils]: 70: Hoare triple {6518#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 18:56:40,622 INFO L273 TraceCheckUtils]: 71: Hoare triple {6518#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6518#true} is VALID [2018-11-14 18:56:40,622 INFO L273 TraceCheckUtils]: 72: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:56:40,622 INFO L273 TraceCheckUtils]: 73: Hoare triple {6518#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 18:56:40,622 INFO L273 TraceCheckUtils]: 74: Hoare triple {6518#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6518#true} is VALID [2018-11-14 18:56:40,622 INFO L273 TraceCheckUtils]: 75: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:56:40,622 INFO L273 TraceCheckUtils]: 76: Hoare triple {6518#true} assume !(~i~0 < 100000); {6518#true} is VALID [2018-11-14 18:56:40,622 INFO L273 TraceCheckUtils]: 77: Hoare triple {6518#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6518#true} is VALID [2018-11-14 18:56:40,622 INFO L273 TraceCheckUtils]: 78: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:56:40,623 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {6518#true} {6519#false} #75#return; {6519#false} is VALID [2018-11-14 18:56:40,623 INFO L273 TraceCheckUtils]: 80: Hoare triple {6519#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {6519#false} is VALID [2018-11-14 18:56:40,623 INFO L273 TraceCheckUtils]: 81: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 18:56:40,623 INFO L273 TraceCheckUtils]: 82: Hoare triple {6519#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {6519#false} is VALID [2018-11-14 18:56:40,623 INFO L273 TraceCheckUtils]: 83: Hoare triple {6519#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {6519#false} is VALID [2018-11-14 18:56:40,623 INFO L273 TraceCheckUtils]: 84: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 18:56:40,623 INFO L273 TraceCheckUtils]: 85: Hoare triple {6519#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {6519#false} is VALID [2018-11-14 18:56:40,623 INFO L273 TraceCheckUtils]: 86: Hoare triple {6519#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {6519#false} is VALID [2018-11-14 18:56:40,623 INFO L273 TraceCheckUtils]: 87: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 18:56:40,624 INFO L273 TraceCheckUtils]: 88: Hoare triple {6519#false} assume !(~i~2 < 99999); {6519#false} is VALID [2018-11-14 18:56:40,624 INFO L273 TraceCheckUtils]: 89: Hoare triple {6519#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {6519#false} is VALID [2018-11-14 18:56:40,624 INFO L256 TraceCheckUtils]: 90: Hoare triple {6519#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {6518#true} is VALID [2018-11-14 18:56:40,624 INFO L273 TraceCheckUtils]: 91: Hoare triple {6518#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {6518#true} is VALID [2018-11-14 18:56:40,624 INFO L273 TraceCheckUtils]: 92: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:56:40,624 INFO L273 TraceCheckUtils]: 93: Hoare triple {6518#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 18:56:40,624 INFO L273 TraceCheckUtils]: 94: Hoare triple {6518#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6518#true} is VALID [2018-11-14 18:56:40,624 INFO L273 TraceCheckUtils]: 95: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:56:40,624 INFO L273 TraceCheckUtils]: 96: Hoare triple {6518#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 18:56:40,625 INFO L273 TraceCheckUtils]: 97: Hoare triple {6518#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6518#true} is VALID [2018-11-14 18:56:40,625 INFO L273 TraceCheckUtils]: 98: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:56:40,625 INFO L273 TraceCheckUtils]: 99: Hoare triple {6518#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 18:56:40,625 INFO L273 TraceCheckUtils]: 100: Hoare triple {6518#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6518#true} is VALID [2018-11-14 18:56:40,625 INFO L273 TraceCheckUtils]: 101: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:56:40,625 INFO L273 TraceCheckUtils]: 102: Hoare triple {6518#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 18:56:40,625 INFO L273 TraceCheckUtils]: 103: Hoare triple {6518#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6518#true} is VALID [2018-11-14 18:56:40,625 INFO L273 TraceCheckUtils]: 104: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:56:40,626 INFO L273 TraceCheckUtils]: 105: Hoare triple {6518#true} assume !(~i~0 < 100000); {6518#true} is VALID [2018-11-14 18:56:40,626 INFO L273 TraceCheckUtils]: 106: Hoare triple {6518#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6518#true} is VALID [2018-11-14 18:56:40,626 INFO L273 TraceCheckUtils]: 107: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:56:40,626 INFO L268 TraceCheckUtils]: 108: Hoare quadruple {6518#true} {6519#false} #77#return; {6519#false} is VALID [2018-11-14 18:56:40,626 INFO L273 TraceCheckUtils]: 109: Hoare triple {6519#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {6519#false} is VALID [2018-11-14 18:56:40,626 INFO L273 TraceCheckUtils]: 110: Hoare triple {6519#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {6519#false} is VALID [2018-11-14 18:56:40,626 INFO L273 TraceCheckUtils]: 111: Hoare triple {6519#false} assume !false; {6519#false} is VALID [2018-11-14 18:56:40,632 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2018-11-14 18:56:40,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:56:40,632 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-14 18:56:40,641 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 18:56:40,850 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-11-14 18:56:40,850 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:56:40,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:56:40,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:56:41,084 INFO L256 TraceCheckUtils]: 0: Hoare triple {6518#true} call ULTIMATE.init(); {6518#true} is VALID [2018-11-14 18:56:41,085 INFO L273 TraceCheckUtils]: 1: Hoare triple {6518#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6518#true} is VALID [2018-11-14 18:56:41,085 INFO L273 TraceCheckUtils]: 2: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:56:41,085 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6518#true} {6518#true} #69#return; {6518#true} is VALID [2018-11-14 18:56:41,085 INFO L256 TraceCheckUtils]: 4: Hoare triple {6518#true} call #t~ret13 := main(); {6518#true} is VALID [2018-11-14 18:56:41,085 INFO L273 TraceCheckUtils]: 5: Hoare triple {6518#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; {6518#true} is VALID [2018-11-14 18:56:41,086 INFO L273 TraceCheckUtils]: 6: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:56:41,086 INFO L273 TraceCheckUtils]: 7: Hoare triple {6518#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6518#true} is VALID [2018-11-14 18:56:41,086 INFO L273 TraceCheckUtils]: 8: Hoare triple {6518#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6518#true} is VALID [2018-11-14 18:56:41,086 INFO L273 TraceCheckUtils]: 9: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:56:41,086 INFO L273 TraceCheckUtils]: 10: Hoare triple {6518#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6518#true} is VALID [2018-11-14 18:56:41,086 INFO L273 TraceCheckUtils]: 11: Hoare triple {6518#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6518#true} is VALID [2018-11-14 18:56:41,087 INFO L273 TraceCheckUtils]: 12: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:56:41,087 INFO L273 TraceCheckUtils]: 13: Hoare triple {6518#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6518#true} is VALID [2018-11-14 18:56:41,087 INFO L273 TraceCheckUtils]: 14: Hoare triple {6518#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6518#true} is VALID [2018-11-14 18:56:41,087 INFO L273 TraceCheckUtils]: 15: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:56:41,087 INFO L273 TraceCheckUtils]: 16: Hoare triple {6518#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6518#true} is VALID [2018-11-14 18:56:41,087 INFO L273 TraceCheckUtils]: 17: Hoare triple {6518#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6518#true} is VALID [2018-11-14 18:56:41,088 INFO L273 TraceCheckUtils]: 18: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:56:41,088 INFO L273 TraceCheckUtils]: 19: Hoare triple {6518#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6518#true} is VALID [2018-11-14 18:56:41,088 INFO L273 TraceCheckUtils]: 20: Hoare triple {6518#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6518#true} is VALID [2018-11-14 18:56:41,088 INFO L273 TraceCheckUtils]: 21: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:56:41,088 INFO L273 TraceCheckUtils]: 22: Hoare triple {6518#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6518#true} is VALID [2018-11-14 18:56:41,088 INFO L273 TraceCheckUtils]: 23: Hoare triple {6518#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6518#true} is VALID [2018-11-14 18:56:41,089 INFO L273 TraceCheckUtils]: 24: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:56:41,089 INFO L273 TraceCheckUtils]: 25: Hoare triple {6518#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6518#true} is VALID [2018-11-14 18:56:41,089 INFO L273 TraceCheckUtils]: 26: Hoare triple {6518#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6518#true} is VALID [2018-11-14 18:56:41,089 INFO L273 TraceCheckUtils]: 27: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:56:41,089 INFO L273 TraceCheckUtils]: 28: Hoare triple {6518#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6518#true} is VALID [2018-11-14 18:56:41,089 INFO L273 TraceCheckUtils]: 29: Hoare triple {6518#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6518#true} is VALID [2018-11-14 18:56:41,090 INFO L273 TraceCheckUtils]: 30: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:56:41,090 INFO L273 TraceCheckUtils]: 31: Hoare triple {6518#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6518#true} is VALID [2018-11-14 18:56:41,090 INFO L273 TraceCheckUtils]: 32: Hoare triple {6518#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6518#true} is VALID [2018-11-14 18:56:41,090 INFO L273 TraceCheckUtils]: 33: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:56:41,090 INFO L273 TraceCheckUtils]: 34: Hoare triple {6518#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6518#true} is VALID [2018-11-14 18:56:41,091 INFO L273 TraceCheckUtils]: 35: Hoare triple {6518#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6518#true} is VALID [2018-11-14 18:56:41,091 INFO L273 TraceCheckUtils]: 36: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:56:41,091 INFO L273 TraceCheckUtils]: 37: Hoare triple {6518#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6518#true} is VALID [2018-11-14 18:56:41,091 INFO L273 TraceCheckUtils]: 38: Hoare triple {6518#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6518#true} is VALID [2018-11-14 18:56:41,091 INFO L273 TraceCheckUtils]: 39: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 18:56:41,091 INFO L273 TraceCheckUtils]: 40: Hoare triple {6518#true} assume !(~i~1 < 100000); {6518#true} is VALID [2018-11-14 18:56:41,092 INFO L256 TraceCheckUtils]: 41: Hoare triple {6518#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {6518#true} is VALID [2018-11-14 18:56:41,105 INFO L273 TraceCheckUtils]: 42: Hoare triple {6518#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {6661#(<= xor_~i~0 1)} is VALID [2018-11-14 18:56:41,113 INFO L273 TraceCheckUtils]: 43: Hoare triple {6661#(<= xor_~i~0 1)} assume true; {6661#(<= xor_~i~0 1)} is VALID [2018-11-14 18:56:41,128 INFO L273 TraceCheckUtils]: 44: Hoare triple {6661#(<= xor_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6661#(<= xor_~i~0 1)} is VALID [2018-11-14 18:56:41,137 INFO L273 TraceCheckUtils]: 45: Hoare triple {6661#(<= xor_~i~0 1)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6671#(<= xor_~i~0 2)} is VALID [2018-11-14 18:56:41,151 INFO L273 TraceCheckUtils]: 46: Hoare triple {6671#(<= xor_~i~0 2)} assume true; {6671#(<= xor_~i~0 2)} is VALID [2018-11-14 18:56:41,160 INFO L273 TraceCheckUtils]: 47: Hoare triple {6671#(<= xor_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6671#(<= xor_~i~0 2)} is VALID [2018-11-14 18:56:41,172 INFO L273 TraceCheckUtils]: 48: Hoare triple {6671#(<= xor_~i~0 2)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6681#(<= xor_~i~0 3)} is VALID [2018-11-14 18:56:41,184 INFO L273 TraceCheckUtils]: 49: Hoare triple {6681#(<= xor_~i~0 3)} assume true; {6681#(<= xor_~i~0 3)} is VALID [2018-11-14 18:56:41,185 INFO L273 TraceCheckUtils]: 50: Hoare triple {6681#(<= xor_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6681#(<= xor_~i~0 3)} is VALID [2018-11-14 18:56:41,185 INFO L273 TraceCheckUtils]: 51: Hoare triple {6681#(<= xor_~i~0 3)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6691#(<= xor_~i~0 4)} is VALID [2018-11-14 18:56:41,187 INFO L273 TraceCheckUtils]: 52: Hoare triple {6691#(<= xor_~i~0 4)} assume true; {6691#(<= xor_~i~0 4)} is VALID [2018-11-14 18:56:41,187 INFO L273 TraceCheckUtils]: 53: Hoare triple {6691#(<= xor_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6691#(<= xor_~i~0 4)} is VALID [2018-11-14 18:56:41,189 INFO L273 TraceCheckUtils]: 54: Hoare triple {6691#(<= xor_~i~0 4)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6701#(<= xor_~i~0 5)} is VALID [2018-11-14 18:56:41,189 INFO L273 TraceCheckUtils]: 55: Hoare triple {6701#(<= xor_~i~0 5)} assume true; {6701#(<= xor_~i~0 5)} is VALID [2018-11-14 18:56:41,191 INFO L273 TraceCheckUtils]: 56: Hoare triple {6701#(<= xor_~i~0 5)} assume !(~i~0 < 100000); {6519#false} is VALID [2018-11-14 18:56:41,191 INFO L273 TraceCheckUtils]: 57: Hoare triple {6519#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6519#false} is VALID [2018-11-14 18:56:41,191 INFO L273 TraceCheckUtils]: 58: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 18:56:41,191 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {6519#false} {6518#true} #73#return; {6519#false} is VALID [2018-11-14 18:56:41,191 INFO L273 TraceCheckUtils]: 60: Hoare triple {6519#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {6519#false} is VALID [2018-11-14 18:56:41,191 INFO L256 TraceCheckUtils]: 61: Hoare triple {6519#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {6519#false} is VALID [2018-11-14 18:56:41,191 INFO L273 TraceCheckUtils]: 62: Hoare triple {6519#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {6519#false} is VALID [2018-11-14 18:56:41,191 INFO L273 TraceCheckUtils]: 63: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 18:56:41,192 INFO L273 TraceCheckUtils]: 64: Hoare triple {6519#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6519#false} is VALID [2018-11-14 18:56:41,192 INFO L273 TraceCheckUtils]: 65: Hoare triple {6519#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6519#false} is VALID [2018-11-14 18:56:41,192 INFO L273 TraceCheckUtils]: 66: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 18:56:41,192 INFO L273 TraceCheckUtils]: 67: Hoare triple {6519#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6519#false} is VALID [2018-11-14 18:56:41,192 INFO L273 TraceCheckUtils]: 68: Hoare triple {6519#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6519#false} is VALID [2018-11-14 18:56:41,192 INFO L273 TraceCheckUtils]: 69: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 18:56:41,192 INFO L273 TraceCheckUtils]: 70: Hoare triple {6519#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6519#false} is VALID [2018-11-14 18:56:41,192 INFO L273 TraceCheckUtils]: 71: Hoare triple {6519#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6519#false} is VALID [2018-11-14 18:56:41,193 INFO L273 TraceCheckUtils]: 72: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 18:56:41,193 INFO L273 TraceCheckUtils]: 73: Hoare triple {6519#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6519#false} is VALID [2018-11-14 18:56:41,193 INFO L273 TraceCheckUtils]: 74: Hoare triple {6519#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6519#false} is VALID [2018-11-14 18:56:41,193 INFO L273 TraceCheckUtils]: 75: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 18:56:41,193 INFO L273 TraceCheckUtils]: 76: Hoare triple {6519#false} assume !(~i~0 < 100000); {6519#false} is VALID [2018-11-14 18:56:41,193 INFO L273 TraceCheckUtils]: 77: Hoare triple {6519#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6519#false} is VALID [2018-11-14 18:56:41,193 INFO L273 TraceCheckUtils]: 78: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 18:56:41,193 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {6519#false} {6519#false} #75#return; {6519#false} is VALID [2018-11-14 18:56:41,193 INFO L273 TraceCheckUtils]: 80: Hoare triple {6519#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {6519#false} is VALID [2018-11-14 18:56:41,194 INFO L273 TraceCheckUtils]: 81: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 18:56:41,194 INFO L273 TraceCheckUtils]: 82: Hoare triple {6519#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {6519#false} is VALID [2018-11-14 18:56:41,194 INFO L273 TraceCheckUtils]: 83: Hoare triple {6519#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {6519#false} is VALID [2018-11-14 18:56:41,194 INFO L273 TraceCheckUtils]: 84: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 18:56:41,194 INFO L273 TraceCheckUtils]: 85: Hoare triple {6519#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {6519#false} is VALID [2018-11-14 18:56:41,194 INFO L273 TraceCheckUtils]: 86: Hoare triple {6519#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {6519#false} is VALID [2018-11-14 18:56:41,194 INFO L273 TraceCheckUtils]: 87: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 18:56:41,194 INFO L273 TraceCheckUtils]: 88: Hoare triple {6519#false} assume !(~i~2 < 99999); {6519#false} is VALID [2018-11-14 18:56:41,194 INFO L273 TraceCheckUtils]: 89: Hoare triple {6519#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {6519#false} is VALID [2018-11-14 18:56:41,195 INFO L256 TraceCheckUtils]: 90: Hoare triple {6519#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {6519#false} is VALID [2018-11-14 18:56:41,195 INFO L273 TraceCheckUtils]: 91: Hoare triple {6519#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {6519#false} is VALID [2018-11-14 18:56:41,195 INFO L273 TraceCheckUtils]: 92: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 18:56:41,195 INFO L273 TraceCheckUtils]: 93: Hoare triple {6519#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6519#false} is VALID [2018-11-14 18:56:41,195 INFO L273 TraceCheckUtils]: 94: Hoare triple {6519#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6519#false} is VALID [2018-11-14 18:56:41,195 INFO L273 TraceCheckUtils]: 95: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 18:56:41,195 INFO L273 TraceCheckUtils]: 96: Hoare triple {6519#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6519#false} is VALID [2018-11-14 18:56:41,195 INFO L273 TraceCheckUtils]: 97: Hoare triple {6519#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6519#false} is VALID [2018-11-14 18:56:41,195 INFO L273 TraceCheckUtils]: 98: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 18:56:41,196 INFO L273 TraceCheckUtils]: 99: Hoare triple {6519#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6519#false} is VALID [2018-11-14 18:56:41,196 INFO L273 TraceCheckUtils]: 100: Hoare triple {6519#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6519#false} is VALID [2018-11-14 18:56:41,196 INFO L273 TraceCheckUtils]: 101: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 18:56:41,196 INFO L273 TraceCheckUtils]: 102: Hoare triple {6519#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6519#false} is VALID [2018-11-14 18:56:41,196 INFO L273 TraceCheckUtils]: 103: Hoare triple {6519#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6519#false} is VALID [2018-11-14 18:56:41,196 INFO L273 TraceCheckUtils]: 104: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 18:56:41,196 INFO L273 TraceCheckUtils]: 105: Hoare triple {6519#false} assume !(~i~0 < 100000); {6519#false} is VALID [2018-11-14 18:56:41,196 INFO L273 TraceCheckUtils]: 106: Hoare triple {6519#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6519#false} is VALID [2018-11-14 18:56:41,196 INFO L273 TraceCheckUtils]: 107: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 18:56:41,197 INFO L268 TraceCheckUtils]: 108: Hoare quadruple {6519#false} {6519#false} #77#return; {6519#false} is VALID [2018-11-14 18:56:41,197 INFO L273 TraceCheckUtils]: 109: Hoare triple {6519#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {6519#false} is VALID [2018-11-14 18:56:41,197 INFO L273 TraceCheckUtils]: 110: Hoare triple {6519#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {6519#false} is VALID [2018-11-14 18:56:41,197 INFO L273 TraceCheckUtils]: 111: Hoare triple {6519#false} assume !false; {6519#false} is VALID [2018-11-14 18:56:41,202 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 134 proven. 26 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2018-11-14 18:56:41,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:56:41,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 19 [2018-11-14 18:56:41,222 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 112 [2018-11-14 18:56:41,224 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:56:41,224 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-14 18:56:41,345 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:56:41,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-14 18:56:41,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-14 18:56:41,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2018-11-14 18:56:41,347 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 19 states. [2018-11-14 18:56:41,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:41,734 INFO L93 Difference]: Finished difference Result 121 states and 133 transitions. [2018-11-14 18:56:41,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-14 18:56:41,734 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 112 [2018-11-14 18:56:41,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:56:41,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 18:56:41,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 112 transitions. [2018-11-14 18:56:41,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 18:56:41,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 112 transitions. [2018-11-14 18:56:41,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 112 transitions. [2018-11-14 18:56:41,835 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:56:41,837 INFO L225 Difference]: With dead ends: 121 [2018-11-14 18:56:41,837 INFO L226 Difference]: Without dead ends: 85 [2018-11-14 18:56:41,838 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 108 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-14 18:56:41,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-14 18:56:41,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2018-11-14 18:56:41,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:56:41,948 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 83 states. [2018-11-14 18:56:41,948 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 83 states. [2018-11-14 18:56:41,948 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 83 states. [2018-11-14 18:56:41,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:41,950 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2018-11-14 18:56:41,951 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-11-14 18:56:41,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:56:41,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:56:41,951 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 85 states. [2018-11-14 18:56:41,951 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 85 states. [2018-11-14 18:56:41,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:41,954 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2018-11-14 18:56:41,955 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-11-14 18:56:41,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:56:41,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:56:41,955 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:56:41,955 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:56:41,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-14 18:56:41,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2018-11-14 18:56:41,957 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 112 [2018-11-14 18:56:41,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:56:41,958 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2018-11-14 18:56:41,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-14 18:56:41,958 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-11-14 18:56:41,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-14 18:56:41,959 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:56:41,959 INFO L375 BasicCegarLoop]: trace histogram [18, 15, 15, 13, 12, 12, 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] [2018-11-14 18:56:41,960 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:56:41,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:56:41,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1735050981, now seen corresponding path program 12 times [2018-11-14 18:56:41,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:56:41,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:56:41,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:56:41,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:56:41,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:56:41,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:56:42,708 INFO L256 TraceCheckUtils]: 0: Hoare triple {7318#true} call ULTIMATE.init(); {7318#true} is VALID [2018-11-14 18:56:42,708 INFO L273 TraceCheckUtils]: 1: Hoare triple {7318#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7318#true} is VALID [2018-11-14 18:56:42,708 INFO L273 TraceCheckUtils]: 2: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:56:42,708 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7318#true} {7318#true} #69#return; {7318#true} is VALID [2018-11-14 18:56:42,708 INFO L256 TraceCheckUtils]: 4: Hoare triple {7318#true} call #t~ret13 := main(); {7318#true} is VALID [2018-11-14 18:56:42,709 INFO L273 TraceCheckUtils]: 5: Hoare triple {7318#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; {7320#(= main_~i~1 0)} is VALID [2018-11-14 18:56:42,709 INFO L273 TraceCheckUtils]: 6: Hoare triple {7320#(= main_~i~1 0)} assume true; {7320#(= main_~i~1 0)} is VALID [2018-11-14 18:56:42,710 INFO L273 TraceCheckUtils]: 7: Hoare triple {7320#(= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {7320#(= main_~i~1 0)} is VALID [2018-11-14 18:56:42,710 INFO L273 TraceCheckUtils]: 8: Hoare triple {7320#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7321#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:42,710 INFO L273 TraceCheckUtils]: 9: Hoare triple {7321#(<= main_~i~1 1)} assume true; {7321#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:42,711 INFO L273 TraceCheckUtils]: 10: Hoare triple {7321#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {7321#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:42,711 INFO L273 TraceCheckUtils]: 11: Hoare triple {7321#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7322#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:42,712 INFO L273 TraceCheckUtils]: 12: Hoare triple {7322#(<= main_~i~1 2)} assume true; {7322#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:42,712 INFO L273 TraceCheckUtils]: 13: Hoare triple {7322#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {7322#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:42,712 INFO L273 TraceCheckUtils]: 14: Hoare triple {7322#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7323#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:42,713 INFO L273 TraceCheckUtils]: 15: Hoare triple {7323#(<= main_~i~1 3)} assume true; {7323#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:42,713 INFO L273 TraceCheckUtils]: 16: Hoare triple {7323#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {7323#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:42,714 INFO L273 TraceCheckUtils]: 17: Hoare triple {7323#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7324#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:42,715 INFO L273 TraceCheckUtils]: 18: Hoare triple {7324#(<= main_~i~1 4)} assume true; {7324#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:42,715 INFO L273 TraceCheckUtils]: 19: Hoare triple {7324#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {7324#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:42,716 INFO L273 TraceCheckUtils]: 20: Hoare triple {7324#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7325#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:42,717 INFO L273 TraceCheckUtils]: 21: Hoare triple {7325#(<= main_~i~1 5)} assume true; {7325#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:42,717 INFO L273 TraceCheckUtils]: 22: Hoare triple {7325#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {7325#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:42,718 INFO L273 TraceCheckUtils]: 23: Hoare triple {7325#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7326#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:42,718 INFO L273 TraceCheckUtils]: 24: Hoare triple {7326#(<= main_~i~1 6)} assume true; {7326#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:42,719 INFO L273 TraceCheckUtils]: 25: Hoare triple {7326#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {7326#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:42,720 INFO L273 TraceCheckUtils]: 26: Hoare triple {7326#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7327#(<= main_~i~1 7)} is VALID [2018-11-14 18:56:42,720 INFO L273 TraceCheckUtils]: 27: Hoare triple {7327#(<= main_~i~1 7)} assume true; {7327#(<= main_~i~1 7)} is VALID [2018-11-14 18:56:42,721 INFO L273 TraceCheckUtils]: 28: Hoare triple {7327#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {7327#(<= main_~i~1 7)} is VALID [2018-11-14 18:56:42,721 INFO L273 TraceCheckUtils]: 29: Hoare triple {7327#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7328#(<= main_~i~1 8)} is VALID [2018-11-14 18:56:42,722 INFO L273 TraceCheckUtils]: 30: Hoare triple {7328#(<= main_~i~1 8)} assume true; {7328#(<= main_~i~1 8)} is VALID [2018-11-14 18:56:42,722 INFO L273 TraceCheckUtils]: 31: Hoare triple {7328#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {7328#(<= main_~i~1 8)} is VALID [2018-11-14 18:56:42,723 INFO L273 TraceCheckUtils]: 32: Hoare triple {7328#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7329#(<= main_~i~1 9)} is VALID [2018-11-14 18:56:42,724 INFO L273 TraceCheckUtils]: 33: Hoare triple {7329#(<= main_~i~1 9)} assume true; {7329#(<= main_~i~1 9)} is VALID [2018-11-14 18:56:42,724 INFO L273 TraceCheckUtils]: 34: Hoare triple {7329#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {7329#(<= main_~i~1 9)} is VALID [2018-11-14 18:56:42,725 INFO L273 TraceCheckUtils]: 35: Hoare triple {7329#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7330#(<= main_~i~1 10)} is VALID [2018-11-14 18:56:42,725 INFO L273 TraceCheckUtils]: 36: Hoare triple {7330#(<= main_~i~1 10)} assume true; {7330#(<= main_~i~1 10)} is VALID [2018-11-14 18:56:42,726 INFO L273 TraceCheckUtils]: 37: Hoare triple {7330#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {7330#(<= main_~i~1 10)} is VALID [2018-11-14 18:56:42,727 INFO L273 TraceCheckUtils]: 38: Hoare triple {7330#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7331#(<= main_~i~1 11)} is VALID [2018-11-14 18:56:42,727 INFO L273 TraceCheckUtils]: 39: Hoare triple {7331#(<= main_~i~1 11)} assume true; {7331#(<= main_~i~1 11)} is VALID [2018-11-14 18:56:42,728 INFO L273 TraceCheckUtils]: 40: Hoare triple {7331#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {7331#(<= main_~i~1 11)} is VALID [2018-11-14 18:56:42,729 INFO L273 TraceCheckUtils]: 41: Hoare triple {7331#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7332#(<= main_~i~1 12)} is VALID [2018-11-14 18:56:42,729 INFO L273 TraceCheckUtils]: 42: Hoare triple {7332#(<= main_~i~1 12)} assume true; {7332#(<= main_~i~1 12)} is VALID [2018-11-14 18:56:42,730 INFO L273 TraceCheckUtils]: 43: Hoare triple {7332#(<= main_~i~1 12)} assume !(~i~1 < 100000); {7319#false} is VALID [2018-11-14 18:56:42,730 INFO L256 TraceCheckUtils]: 44: Hoare triple {7319#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {7318#true} is VALID [2018-11-14 18:56:42,730 INFO L273 TraceCheckUtils]: 45: Hoare triple {7318#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7318#true} is VALID [2018-11-14 18:56:42,730 INFO L273 TraceCheckUtils]: 46: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:56:42,730 INFO L273 TraceCheckUtils]: 47: Hoare triple {7318#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 18:56:42,731 INFO L273 TraceCheckUtils]: 48: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 18:56:42,731 INFO L273 TraceCheckUtils]: 49: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:56:42,731 INFO L273 TraceCheckUtils]: 50: Hoare triple {7318#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 18:56:42,731 INFO L273 TraceCheckUtils]: 51: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 18:56:42,731 INFO L273 TraceCheckUtils]: 52: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:56:42,732 INFO L273 TraceCheckUtils]: 53: Hoare triple {7318#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 18:56:42,732 INFO L273 TraceCheckUtils]: 54: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 18:56:42,732 INFO L273 TraceCheckUtils]: 55: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:56:42,732 INFO L273 TraceCheckUtils]: 56: Hoare triple {7318#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 18:56:42,732 INFO L273 TraceCheckUtils]: 57: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 18:56:42,733 INFO L273 TraceCheckUtils]: 58: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:56:42,733 INFO L273 TraceCheckUtils]: 59: Hoare triple {7318#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 18:56:42,733 INFO L273 TraceCheckUtils]: 60: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 18:56:42,733 INFO L273 TraceCheckUtils]: 61: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:56:42,733 INFO L273 TraceCheckUtils]: 62: Hoare triple {7318#true} assume !(~i~0 < 100000); {7318#true} is VALID [2018-11-14 18:56:42,733 INFO L273 TraceCheckUtils]: 63: Hoare triple {7318#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7318#true} is VALID [2018-11-14 18:56:42,734 INFO L273 TraceCheckUtils]: 64: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:56:42,734 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {7318#true} {7319#false} #73#return; {7319#false} is VALID [2018-11-14 18:56:42,734 INFO L273 TraceCheckUtils]: 66: Hoare triple {7319#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {7319#false} is VALID [2018-11-14 18:56:42,734 INFO L256 TraceCheckUtils]: 67: Hoare triple {7319#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {7318#true} is VALID [2018-11-14 18:56:42,734 INFO L273 TraceCheckUtils]: 68: Hoare triple {7318#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7318#true} is VALID [2018-11-14 18:56:42,735 INFO L273 TraceCheckUtils]: 69: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:56:42,735 INFO L273 TraceCheckUtils]: 70: Hoare triple {7318#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 18:56:42,735 INFO L273 TraceCheckUtils]: 71: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 18:56:42,735 INFO L273 TraceCheckUtils]: 72: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:56:42,735 INFO L273 TraceCheckUtils]: 73: Hoare triple {7318#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 18:56:42,735 INFO L273 TraceCheckUtils]: 74: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 18:56:42,735 INFO L273 TraceCheckUtils]: 75: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:56:42,735 INFO L273 TraceCheckUtils]: 76: Hoare triple {7318#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 18:56:42,735 INFO L273 TraceCheckUtils]: 77: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 18:56:42,736 INFO L273 TraceCheckUtils]: 78: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:56:42,736 INFO L273 TraceCheckUtils]: 79: Hoare triple {7318#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 18:56:42,736 INFO L273 TraceCheckUtils]: 80: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 18:56:42,736 INFO L273 TraceCheckUtils]: 81: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:56:42,736 INFO L273 TraceCheckUtils]: 82: Hoare triple {7318#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 18:56:42,736 INFO L273 TraceCheckUtils]: 83: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 18:56:42,736 INFO L273 TraceCheckUtils]: 84: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:56:42,736 INFO L273 TraceCheckUtils]: 85: Hoare triple {7318#true} assume !(~i~0 < 100000); {7318#true} is VALID [2018-11-14 18:56:42,736 INFO L273 TraceCheckUtils]: 86: Hoare triple {7318#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7318#true} is VALID [2018-11-14 18:56:42,737 INFO L273 TraceCheckUtils]: 87: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:56:42,737 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {7318#true} {7319#false} #75#return; {7319#false} is VALID [2018-11-14 18:56:42,737 INFO L273 TraceCheckUtils]: 89: Hoare triple {7319#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {7319#false} is VALID [2018-11-14 18:56:42,737 INFO L273 TraceCheckUtils]: 90: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 18:56:42,737 INFO L273 TraceCheckUtils]: 91: Hoare triple {7319#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {7319#false} is VALID [2018-11-14 18:56:42,737 INFO L273 TraceCheckUtils]: 92: Hoare triple {7319#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {7319#false} is VALID [2018-11-14 18:56:42,737 INFO L273 TraceCheckUtils]: 93: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 18:56:42,737 INFO L273 TraceCheckUtils]: 94: Hoare triple {7319#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {7319#false} is VALID [2018-11-14 18:56:42,737 INFO L273 TraceCheckUtils]: 95: Hoare triple {7319#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {7319#false} is VALID [2018-11-14 18:56:42,738 INFO L273 TraceCheckUtils]: 96: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 18:56:42,738 INFO L273 TraceCheckUtils]: 97: Hoare triple {7319#false} assume !(~i~2 < 99999); {7319#false} is VALID [2018-11-14 18:56:42,738 INFO L273 TraceCheckUtils]: 98: Hoare triple {7319#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {7319#false} is VALID [2018-11-14 18:56:42,738 INFO L256 TraceCheckUtils]: 99: Hoare triple {7319#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {7318#true} is VALID [2018-11-14 18:56:42,738 INFO L273 TraceCheckUtils]: 100: Hoare triple {7318#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7318#true} is VALID [2018-11-14 18:56:42,738 INFO L273 TraceCheckUtils]: 101: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:56:42,738 INFO L273 TraceCheckUtils]: 102: Hoare triple {7318#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 18:56:42,738 INFO L273 TraceCheckUtils]: 103: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 18:56:42,738 INFO L273 TraceCheckUtils]: 104: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:56:42,739 INFO L273 TraceCheckUtils]: 105: Hoare triple {7318#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 18:56:42,739 INFO L273 TraceCheckUtils]: 106: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 18:56:42,739 INFO L273 TraceCheckUtils]: 107: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:56:42,739 INFO L273 TraceCheckUtils]: 108: Hoare triple {7318#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 18:56:42,739 INFO L273 TraceCheckUtils]: 109: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 18:56:42,739 INFO L273 TraceCheckUtils]: 110: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:56:42,739 INFO L273 TraceCheckUtils]: 111: Hoare triple {7318#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 18:56:42,739 INFO L273 TraceCheckUtils]: 112: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 18:56:42,739 INFO L273 TraceCheckUtils]: 113: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:56:42,740 INFO L273 TraceCheckUtils]: 114: Hoare triple {7318#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 18:56:42,740 INFO L273 TraceCheckUtils]: 115: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 18:56:42,740 INFO L273 TraceCheckUtils]: 116: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:56:42,740 INFO L273 TraceCheckUtils]: 117: Hoare triple {7318#true} assume !(~i~0 < 100000); {7318#true} is VALID [2018-11-14 18:56:42,740 INFO L273 TraceCheckUtils]: 118: Hoare triple {7318#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7318#true} is VALID [2018-11-14 18:56:42,740 INFO L273 TraceCheckUtils]: 119: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:56:42,740 INFO L268 TraceCheckUtils]: 120: Hoare quadruple {7318#true} {7319#false} #77#return; {7319#false} is VALID [2018-11-14 18:56:42,740 INFO L273 TraceCheckUtils]: 121: Hoare triple {7319#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {7319#false} is VALID [2018-11-14 18:56:42,740 INFO L273 TraceCheckUtils]: 122: Hoare triple {7319#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {7319#false} is VALID [2018-11-14 18:56:42,741 INFO L273 TraceCheckUtils]: 123: Hoare triple {7319#false} assume !false; {7319#false} is VALID [2018-11-14 18:56:42,755 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 430 trivial. 0 not checked. [2018-11-14 18:56:42,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:56:42,755 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-14 18:56:42,764 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 18:56:42,854 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-14 18:56:42,854 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:56:42,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:56:42,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:56:43,082 INFO L256 TraceCheckUtils]: 0: Hoare triple {7318#true} call ULTIMATE.init(); {7318#true} is VALID [2018-11-14 18:56:43,083 INFO L273 TraceCheckUtils]: 1: Hoare triple {7318#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7318#true} is VALID [2018-11-14 18:56:43,083 INFO L273 TraceCheckUtils]: 2: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:56:43,083 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7318#true} {7318#true} #69#return; {7318#true} is VALID [2018-11-14 18:56:43,083 INFO L256 TraceCheckUtils]: 4: Hoare triple {7318#true} call #t~ret13 := main(); {7318#true} is VALID [2018-11-14 18:56:43,084 INFO L273 TraceCheckUtils]: 5: Hoare triple {7318#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; {7318#true} is VALID [2018-11-14 18:56:43,084 INFO L273 TraceCheckUtils]: 6: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:56:43,084 INFO L273 TraceCheckUtils]: 7: Hoare triple {7318#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7318#true} is VALID [2018-11-14 18:56:43,084 INFO L273 TraceCheckUtils]: 8: Hoare triple {7318#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7318#true} is VALID [2018-11-14 18:56:43,084 INFO L273 TraceCheckUtils]: 9: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:56:43,085 INFO L273 TraceCheckUtils]: 10: Hoare triple {7318#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7318#true} is VALID [2018-11-14 18:56:43,085 INFO L273 TraceCheckUtils]: 11: Hoare triple {7318#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7318#true} is VALID [2018-11-14 18:56:43,085 INFO L273 TraceCheckUtils]: 12: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:56:43,085 INFO L273 TraceCheckUtils]: 13: Hoare triple {7318#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7318#true} is VALID [2018-11-14 18:56:43,085 INFO L273 TraceCheckUtils]: 14: Hoare triple {7318#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7318#true} is VALID [2018-11-14 18:56:43,086 INFO L273 TraceCheckUtils]: 15: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:56:43,086 INFO L273 TraceCheckUtils]: 16: Hoare triple {7318#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7318#true} is VALID [2018-11-14 18:56:43,086 INFO L273 TraceCheckUtils]: 17: Hoare triple {7318#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7318#true} is VALID [2018-11-14 18:56:43,086 INFO L273 TraceCheckUtils]: 18: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:56:43,086 INFO L273 TraceCheckUtils]: 19: Hoare triple {7318#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7318#true} is VALID [2018-11-14 18:56:43,086 INFO L273 TraceCheckUtils]: 20: Hoare triple {7318#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7318#true} is VALID [2018-11-14 18:56:43,086 INFO L273 TraceCheckUtils]: 21: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:56:43,087 INFO L273 TraceCheckUtils]: 22: Hoare triple {7318#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7318#true} is VALID [2018-11-14 18:56:43,087 INFO L273 TraceCheckUtils]: 23: Hoare triple {7318#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7318#true} is VALID [2018-11-14 18:56:43,087 INFO L273 TraceCheckUtils]: 24: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:56:43,087 INFO L273 TraceCheckUtils]: 25: Hoare triple {7318#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7318#true} is VALID [2018-11-14 18:56:43,087 INFO L273 TraceCheckUtils]: 26: Hoare triple {7318#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7318#true} is VALID [2018-11-14 18:56:43,087 INFO L273 TraceCheckUtils]: 27: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:56:43,087 INFO L273 TraceCheckUtils]: 28: Hoare triple {7318#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7318#true} is VALID [2018-11-14 18:56:43,088 INFO L273 TraceCheckUtils]: 29: Hoare triple {7318#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7318#true} is VALID [2018-11-14 18:56:43,088 INFO L273 TraceCheckUtils]: 30: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:56:43,088 INFO L273 TraceCheckUtils]: 31: Hoare triple {7318#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7318#true} is VALID [2018-11-14 18:56:43,088 INFO L273 TraceCheckUtils]: 32: Hoare triple {7318#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7318#true} is VALID [2018-11-14 18:56:43,088 INFO L273 TraceCheckUtils]: 33: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:56:43,088 INFO L273 TraceCheckUtils]: 34: Hoare triple {7318#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7318#true} is VALID [2018-11-14 18:56:43,088 INFO L273 TraceCheckUtils]: 35: Hoare triple {7318#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7318#true} is VALID [2018-11-14 18:56:43,089 INFO L273 TraceCheckUtils]: 36: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:56:43,089 INFO L273 TraceCheckUtils]: 37: Hoare triple {7318#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7318#true} is VALID [2018-11-14 18:56:43,089 INFO L273 TraceCheckUtils]: 38: Hoare triple {7318#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7318#true} is VALID [2018-11-14 18:56:43,089 INFO L273 TraceCheckUtils]: 39: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:56:43,089 INFO L273 TraceCheckUtils]: 40: Hoare triple {7318#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7318#true} is VALID [2018-11-14 18:56:43,089 INFO L273 TraceCheckUtils]: 41: Hoare triple {7318#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7318#true} is VALID [2018-11-14 18:56:43,089 INFO L273 TraceCheckUtils]: 42: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:56:43,090 INFO L273 TraceCheckUtils]: 43: Hoare triple {7318#true} assume !(~i~1 < 100000); {7318#true} is VALID [2018-11-14 18:56:43,090 INFO L256 TraceCheckUtils]: 44: Hoare triple {7318#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {7318#true} is VALID [2018-11-14 18:56:43,090 INFO L273 TraceCheckUtils]: 45: Hoare triple {7318#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7318#true} is VALID [2018-11-14 18:56:43,090 INFO L273 TraceCheckUtils]: 46: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:56:43,090 INFO L273 TraceCheckUtils]: 47: Hoare triple {7318#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 18:56:43,090 INFO L273 TraceCheckUtils]: 48: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 18:56:43,090 INFO L273 TraceCheckUtils]: 49: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:56:43,091 INFO L273 TraceCheckUtils]: 50: Hoare triple {7318#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 18:56:43,091 INFO L273 TraceCheckUtils]: 51: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 18:56:43,091 INFO L273 TraceCheckUtils]: 52: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:56:43,091 INFO L273 TraceCheckUtils]: 53: Hoare triple {7318#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 18:56:43,091 INFO L273 TraceCheckUtils]: 54: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 18:56:43,091 INFO L273 TraceCheckUtils]: 55: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:56:43,091 INFO L273 TraceCheckUtils]: 56: Hoare triple {7318#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 18:56:43,092 INFO L273 TraceCheckUtils]: 57: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 18:56:43,092 INFO L273 TraceCheckUtils]: 58: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:56:43,092 INFO L273 TraceCheckUtils]: 59: Hoare triple {7318#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 18:56:43,092 INFO L273 TraceCheckUtils]: 60: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 18:56:43,092 INFO L273 TraceCheckUtils]: 61: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:56:43,092 INFO L273 TraceCheckUtils]: 62: Hoare triple {7318#true} assume !(~i~0 < 100000); {7318#true} is VALID [2018-11-14 18:56:43,092 INFO L273 TraceCheckUtils]: 63: Hoare triple {7318#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7318#true} is VALID [2018-11-14 18:56:43,093 INFO L273 TraceCheckUtils]: 64: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:56:43,093 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {7318#true} {7318#true} #73#return; {7318#true} is VALID [2018-11-14 18:56:43,093 INFO L273 TraceCheckUtils]: 66: Hoare triple {7318#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {7318#true} is VALID [2018-11-14 18:56:43,093 INFO L256 TraceCheckUtils]: 67: Hoare triple {7318#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {7318#true} is VALID [2018-11-14 18:56:43,093 INFO L273 TraceCheckUtils]: 68: Hoare triple {7318#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7318#true} is VALID [2018-11-14 18:56:43,093 INFO L273 TraceCheckUtils]: 69: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:56:43,094 INFO L273 TraceCheckUtils]: 70: Hoare triple {7318#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 18:56:43,094 INFO L273 TraceCheckUtils]: 71: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 18:56:43,094 INFO L273 TraceCheckUtils]: 72: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:56:43,094 INFO L273 TraceCheckUtils]: 73: Hoare triple {7318#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 18:56:43,094 INFO L273 TraceCheckUtils]: 74: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 18:56:43,094 INFO L273 TraceCheckUtils]: 75: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:56:43,094 INFO L273 TraceCheckUtils]: 76: Hoare triple {7318#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 18:56:43,095 INFO L273 TraceCheckUtils]: 77: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 18:56:43,095 INFO L273 TraceCheckUtils]: 78: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:56:43,095 INFO L273 TraceCheckUtils]: 79: Hoare triple {7318#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 18:56:43,095 INFO L273 TraceCheckUtils]: 80: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 18:56:43,095 INFO L273 TraceCheckUtils]: 81: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:56:43,095 INFO L273 TraceCheckUtils]: 82: Hoare triple {7318#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 18:56:43,095 INFO L273 TraceCheckUtils]: 83: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 18:56:43,096 INFO L273 TraceCheckUtils]: 84: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:56:43,096 INFO L273 TraceCheckUtils]: 85: Hoare triple {7318#true} assume !(~i~0 < 100000); {7318#true} is VALID [2018-11-14 18:56:43,096 INFO L273 TraceCheckUtils]: 86: Hoare triple {7318#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7318#true} is VALID [2018-11-14 18:56:43,096 INFO L273 TraceCheckUtils]: 87: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 18:56:43,096 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {7318#true} {7318#true} #75#return; {7318#true} is VALID [2018-11-14 18:56:43,097 INFO L273 TraceCheckUtils]: 89: Hoare triple {7318#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {7603#(<= main_~i~2 0)} is VALID [2018-11-14 18:56:43,097 INFO L273 TraceCheckUtils]: 90: Hoare triple {7603#(<= main_~i~2 0)} assume true; {7603#(<= main_~i~2 0)} is VALID [2018-11-14 18:56:43,097 INFO L273 TraceCheckUtils]: 91: Hoare triple {7603#(<= main_~i~2 0)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {7603#(<= main_~i~2 0)} is VALID [2018-11-14 18:56:43,098 INFO L273 TraceCheckUtils]: 92: Hoare triple {7603#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {7613#(<= main_~i~2 1)} is VALID [2018-11-14 18:56:43,098 INFO L273 TraceCheckUtils]: 93: Hoare triple {7613#(<= main_~i~2 1)} assume true; {7613#(<= main_~i~2 1)} is VALID [2018-11-14 18:56:43,099 INFO L273 TraceCheckUtils]: 94: Hoare triple {7613#(<= main_~i~2 1)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {7613#(<= main_~i~2 1)} is VALID [2018-11-14 18:56:43,099 INFO L273 TraceCheckUtils]: 95: Hoare triple {7613#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {7623#(<= main_~i~2 2)} is VALID [2018-11-14 18:56:43,100 INFO L273 TraceCheckUtils]: 96: Hoare triple {7623#(<= main_~i~2 2)} assume true; {7623#(<= main_~i~2 2)} is VALID [2018-11-14 18:56:43,100 INFO L273 TraceCheckUtils]: 97: Hoare triple {7623#(<= main_~i~2 2)} assume !(~i~2 < 99999); {7319#false} is VALID [2018-11-14 18:56:43,100 INFO L273 TraceCheckUtils]: 98: Hoare triple {7319#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {7319#false} is VALID [2018-11-14 18:56:43,100 INFO L256 TraceCheckUtils]: 99: Hoare triple {7319#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {7319#false} is VALID [2018-11-14 18:56:43,101 INFO L273 TraceCheckUtils]: 100: Hoare triple {7319#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7319#false} is VALID [2018-11-14 18:56:43,101 INFO L273 TraceCheckUtils]: 101: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 18:56:43,101 INFO L273 TraceCheckUtils]: 102: Hoare triple {7319#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7319#false} is VALID [2018-11-14 18:56:43,101 INFO L273 TraceCheckUtils]: 103: Hoare triple {7319#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7319#false} is VALID [2018-11-14 18:56:43,101 INFO L273 TraceCheckUtils]: 104: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 18:56:43,101 INFO L273 TraceCheckUtils]: 105: Hoare triple {7319#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7319#false} is VALID [2018-11-14 18:56:43,102 INFO L273 TraceCheckUtils]: 106: Hoare triple {7319#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7319#false} is VALID [2018-11-14 18:56:43,102 INFO L273 TraceCheckUtils]: 107: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 18:56:43,102 INFO L273 TraceCheckUtils]: 108: Hoare triple {7319#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7319#false} is VALID [2018-11-14 18:56:43,102 INFO L273 TraceCheckUtils]: 109: Hoare triple {7319#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7319#false} is VALID [2018-11-14 18:56:43,102 INFO L273 TraceCheckUtils]: 110: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 18:56:43,103 INFO L273 TraceCheckUtils]: 111: Hoare triple {7319#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7319#false} is VALID [2018-11-14 18:56:43,103 INFO L273 TraceCheckUtils]: 112: Hoare triple {7319#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7319#false} is VALID [2018-11-14 18:56:43,103 INFO L273 TraceCheckUtils]: 113: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 18:56:43,103 INFO L273 TraceCheckUtils]: 114: Hoare triple {7319#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7319#false} is VALID [2018-11-14 18:56:43,103 INFO L273 TraceCheckUtils]: 115: Hoare triple {7319#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7319#false} is VALID [2018-11-14 18:56:43,103 INFO L273 TraceCheckUtils]: 116: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 18:56:43,103 INFO L273 TraceCheckUtils]: 117: Hoare triple {7319#false} assume !(~i~0 < 100000); {7319#false} is VALID [2018-11-14 18:56:43,104 INFO L273 TraceCheckUtils]: 118: Hoare triple {7319#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7319#false} is VALID [2018-11-14 18:56:43,104 INFO L273 TraceCheckUtils]: 119: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 18:56:43,104 INFO L268 TraceCheckUtils]: 120: Hoare quadruple {7319#false} {7319#false} #77#return; {7319#false} is VALID [2018-11-14 18:56:43,104 INFO L273 TraceCheckUtils]: 121: Hoare triple {7319#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {7319#false} is VALID [2018-11-14 18:56:43,104 INFO L273 TraceCheckUtils]: 122: Hoare triple {7319#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {7319#false} is VALID [2018-11-14 18:56:43,105 INFO L273 TraceCheckUtils]: 123: Hoare triple {7319#false} assume !false; {7319#false} is VALID [2018-11-14 18:56:43,118 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 202 proven. 7 refuted. 0 times theorem prover too weak. 443 trivial. 0 not checked. [2018-11-14 18:56:43,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:56:43,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5] total 18 [2018-11-14 18:56:43,140 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 124 [2018-11-14 18:56:43,140 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:56:43,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-14 18:56:43,272 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-14 18:56:43,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-14 18:56:43,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-14 18:56:43,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=192, Unknown=0, NotChecked=0, Total=306 [2018-11-14 18:56:43,273 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 18 states. [2018-11-14 18:56:43,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:43,840 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2018-11-14 18:56:43,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-14 18:56:43,840 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 124 [2018-11-14 18:56:43,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:56:43,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 18:56:43,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 106 transitions. [2018-11-14 18:56:43,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 18:56:43,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 106 transitions. [2018-11-14 18:56:43,843 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 106 transitions. [2018-11-14 18:56:44,248 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-14 18:56:44,251 INFO L225 Difference]: With dead ends: 130 [2018-11-14 18:56:44,251 INFO L226 Difference]: Without dead ends: 91 [2018-11-14 18:56:44,252 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=114, Invalid=192, Unknown=0, NotChecked=0, Total=306 [2018-11-14 18:56:44,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-14 18:56:44,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2018-11-14 18:56:44,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:56:44,276 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand 89 states. [2018-11-14 18:56:44,276 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 89 states. [2018-11-14 18:56:44,276 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 89 states. [2018-11-14 18:56:44,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:44,279 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-11-14 18:56:44,279 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2018-11-14 18:56:44,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:56:44,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:56:44,280 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 91 states. [2018-11-14 18:56:44,280 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 91 states. [2018-11-14 18:56:44,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:44,282 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-11-14 18:56:44,282 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2018-11-14 18:56:44,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:56:44,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:56:44,283 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:56:44,283 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:56:44,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-14 18:56:44,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-11-14 18:56:44,285 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 124 [2018-11-14 18:56:44,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:56:44,285 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-11-14 18:56:44,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-14 18:56:44,285 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-11-14 18:56:44,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-14 18:56:44,287 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:56:44,287 INFO L375 BasicCegarLoop]: trace histogram [18, 15, 15, 14, 13, 13, 4, 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-14 18:56:44,287 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:56:44,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:56:44,288 INFO L82 PathProgramCache]: Analyzing trace with hash 854600333, now seen corresponding path program 13 times [2018-11-14 18:56:44,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:56:44,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:56:44,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:56:44,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:56:44,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:56:44,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:56:45,400 INFO L256 TraceCheckUtils]: 0: Hoare triple {8185#true} call ULTIMATE.init(); {8185#true} is VALID [2018-11-14 18:56:45,401 INFO L273 TraceCheckUtils]: 1: Hoare triple {8185#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8185#true} is VALID [2018-11-14 18:56:45,401 INFO L273 TraceCheckUtils]: 2: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 18:56:45,401 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8185#true} {8185#true} #69#return; {8185#true} is VALID [2018-11-14 18:56:45,402 INFO L256 TraceCheckUtils]: 4: Hoare triple {8185#true} call #t~ret13 := main(); {8185#true} is VALID [2018-11-14 18:56:45,402 INFO L273 TraceCheckUtils]: 5: Hoare triple {8185#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; {8187#(= main_~i~1 0)} is VALID [2018-11-14 18:56:45,403 INFO L273 TraceCheckUtils]: 6: Hoare triple {8187#(= main_~i~1 0)} assume true; {8187#(= main_~i~1 0)} is VALID [2018-11-14 18:56:45,403 INFO L273 TraceCheckUtils]: 7: Hoare triple {8187#(= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {8187#(= main_~i~1 0)} is VALID [2018-11-14 18:56:45,403 INFO L273 TraceCheckUtils]: 8: Hoare triple {8187#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8188#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:45,404 INFO L273 TraceCheckUtils]: 9: Hoare triple {8188#(<= main_~i~1 1)} assume true; {8188#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:45,404 INFO L273 TraceCheckUtils]: 10: Hoare triple {8188#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {8188#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:45,405 INFO L273 TraceCheckUtils]: 11: Hoare triple {8188#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8189#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:45,405 INFO L273 TraceCheckUtils]: 12: Hoare triple {8189#(<= main_~i~1 2)} assume true; {8189#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:45,406 INFO L273 TraceCheckUtils]: 13: Hoare triple {8189#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {8189#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:45,406 INFO L273 TraceCheckUtils]: 14: Hoare triple {8189#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8190#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:45,407 INFO L273 TraceCheckUtils]: 15: Hoare triple {8190#(<= main_~i~1 3)} assume true; {8190#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:45,407 INFO L273 TraceCheckUtils]: 16: Hoare triple {8190#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {8190#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:45,408 INFO L273 TraceCheckUtils]: 17: Hoare triple {8190#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8191#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:45,409 INFO L273 TraceCheckUtils]: 18: Hoare triple {8191#(<= main_~i~1 4)} assume true; {8191#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:45,409 INFO L273 TraceCheckUtils]: 19: Hoare triple {8191#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {8191#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:45,410 INFO L273 TraceCheckUtils]: 20: Hoare triple {8191#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8192#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:45,410 INFO L273 TraceCheckUtils]: 21: Hoare triple {8192#(<= main_~i~1 5)} assume true; {8192#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:45,411 INFO L273 TraceCheckUtils]: 22: Hoare triple {8192#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {8192#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:45,414 INFO L273 TraceCheckUtils]: 23: Hoare triple {8192#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8193#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:45,415 INFO L273 TraceCheckUtils]: 24: Hoare triple {8193#(<= main_~i~1 6)} assume true; {8193#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:45,415 INFO L273 TraceCheckUtils]: 25: Hoare triple {8193#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {8193#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:45,415 INFO L273 TraceCheckUtils]: 26: Hoare triple {8193#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8194#(<= main_~i~1 7)} is VALID [2018-11-14 18:56:45,416 INFO L273 TraceCheckUtils]: 27: Hoare triple {8194#(<= main_~i~1 7)} assume true; {8194#(<= main_~i~1 7)} is VALID [2018-11-14 18:56:45,416 INFO L273 TraceCheckUtils]: 28: Hoare triple {8194#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {8194#(<= main_~i~1 7)} is VALID [2018-11-14 18:56:45,416 INFO L273 TraceCheckUtils]: 29: Hoare triple {8194#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8195#(<= main_~i~1 8)} is VALID [2018-11-14 18:56:45,417 INFO L273 TraceCheckUtils]: 30: Hoare triple {8195#(<= main_~i~1 8)} assume true; {8195#(<= main_~i~1 8)} is VALID [2018-11-14 18:56:45,417 INFO L273 TraceCheckUtils]: 31: Hoare triple {8195#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {8195#(<= main_~i~1 8)} is VALID [2018-11-14 18:56:45,418 INFO L273 TraceCheckUtils]: 32: Hoare triple {8195#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8196#(<= main_~i~1 9)} is VALID [2018-11-14 18:56:45,418 INFO L273 TraceCheckUtils]: 33: Hoare triple {8196#(<= main_~i~1 9)} assume true; {8196#(<= main_~i~1 9)} is VALID [2018-11-14 18:56:45,419 INFO L273 TraceCheckUtils]: 34: Hoare triple {8196#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {8196#(<= main_~i~1 9)} is VALID [2018-11-14 18:56:45,419 INFO L273 TraceCheckUtils]: 35: Hoare triple {8196#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8197#(<= main_~i~1 10)} is VALID [2018-11-14 18:56:45,420 INFO L273 TraceCheckUtils]: 36: Hoare triple {8197#(<= main_~i~1 10)} assume true; {8197#(<= main_~i~1 10)} is VALID [2018-11-14 18:56:45,420 INFO L273 TraceCheckUtils]: 37: Hoare triple {8197#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {8197#(<= main_~i~1 10)} is VALID [2018-11-14 18:56:45,421 INFO L273 TraceCheckUtils]: 38: Hoare triple {8197#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8198#(<= main_~i~1 11)} is VALID [2018-11-14 18:56:45,422 INFO L273 TraceCheckUtils]: 39: Hoare triple {8198#(<= main_~i~1 11)} assume true; {8198#(<= main_~i~1 11)} is VALID [2018-11-14 18:56:45,422 INFO L273 TraceCheckUtils]: 40: Hoare triple {8198#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {8198#(<= main_~i~1 11)} is VALID [2018-11-14 18:56:45,423 INFO L273 TraceCheckUtils]: 41: Hoare triple {8198#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8199#(<= main_~i~1 12)} is VALID [2018-11-14 18:56:45,423 INFO L273 TraceCheckUtils]: 42: Hoare triple {8199#(<= main_~i~1 12)} assume true; {8199#(<= main_~i~1 12)} is VALID [2018-11-14 18:56:45,424 INFO L273 TraceCheckUtils]: 43: Hoare triple {8199#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {8199#(<= main_~i~1 12)} is VALID [2018-11-14 18:56:45,425 INFO L273 TraceCheckUtils]: 44: Hoare triple {8199#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8200#(<= main_~i~1 13)} is VALID [2018-11-14 18:56:45,425 INFO L273 TraceCheckUtils]: 45: Hoare triple {8200#(<= main_~i~1 13)} assume true; {8200#(<= main_~i~1 13)} is VALID [2018-11-14 18:56:45,426 INFO L273 TraceCheckUtils]: 46: Hoare triple {8200#(<= main_~i~1 13)} assume !(~i~1 < 100000); {8186#false} is VALID [2018-11-14 18:56:45,426 INFO L256 TraceCheckUtils]: 47: Hoare triple {8186#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {8185#true} is VALID [2018-11-14 18:56:45,426 INFO L273 TraceCheckUtils]: 48: Hoare triple {8185#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {8185#true} is VALID [2018-11-14 18:56:45,426 INFO L273 TraceCheckUtils]: 49: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 18:56:45,427 INFO L273 TraceCheckUtils]: 50: Hoare triple {8185#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 18:56:45,427 INFO L273 TraceCheckUtils]: 51: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 18:56:45,427 INFO L273 TraceCheckUtils]: 52: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 18:56:45,427 INFO L273 TraceCheckUtils]: 53: Hoare triple {8185#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 18:56:45,427 INFO L273 TraceCheckUtils]: 54: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 18:56:45,428 INFO L273 TraceCheckUtils]: 55: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 18:56:45,428 INFO L273 TraceCheckUtils]: 56: Hoare triple {8185#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 18:56:45,428 INFO L273 TraceCheckUtils]: 57: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 18:56:45,428 INFO L273 TraceCheckUtils]: 58: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 18:56:45,428 INFO L273 TraceCheckUtils]: 59: Hoare triple {8185#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 18:56:45,429 INFO L273 TraceCheckUtils]: 60: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 18:56:45,429 INFO L273 TraceCheckUtils]: 61: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 18:56:45,429 INFO L273 TraceCheckUtils]: 62: Hoare triple {8185#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 18:56:45,429 INFO L273 TraceCheckUtils]: 63: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 18:56:45,429 INFO L273 TraceCheckUtils]: 64: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 18:56:45,430 INFO L273 TraceCheckUtils]: 65: Hoare triple {8185#true} assume !(~i~0 < 100000); {8185#true} is VALID [2018-11-14 18:56:45,430 INFO L273 TraceCheckUtils]: 66: Hoare triple {8185#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8185#true} is VALID [2018-11-14 18:56:45,430 INFO L273 TraceCheckUtils]: 67: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 18:56:45,430 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {8185#true} {8186#false} #73#return; {8186#false} is VALID [2018-11-14 18:56:45,430 INFO L273 TraceCheckUtils]: 69: Hoare triple {8186#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {8186#false} is VALID [2018-11-14 18:56:45,431 INFO L256 TraceCheckUtils]: 70: Hoare triple {8186#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {8185#true} is VALID [2018-11-14 18:56:45,431 INFO L273 TraceCheckUtils]: 71: Hoare triple {8185#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {8185#true} is VALID [2018-11-14 18:56:45,431 INFO L273 TraceCheckUtils]: 72: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 18:56:45,431 INFO L273 TraceCheckUtils]: 73: Hoare triple {8185#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 18:56:45,431 INFO L273 TraceCheckUtils]: 74: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 18:56:45,431 INFO L273 TraceCheckUtils]: 75: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 18:56:45,431 INFO L273 TraceCheckUtils]: 76: Hoare triple {8185#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 18:56:45,431 INFO L273 TraceCheckUtils]: 77: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 18:56:45,432 INFO L273 TraceCheckUtils]: 78: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 18:56:45,432 INFO L273 TraceCheckUtils]: 79: Hoare triple {8185#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 18:56:45,432 INFO L273 TraceCheckUtils]: 80: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 18:56:45,432 INFO L273 TraceCheckUtils]: 81: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 18:56:45,432 INFO L273 TraceCheckUtils]: 82: Hoare triple {8185#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 18:56:45,432 INFO L273 TraceCheckUtils]: 83: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 18:56:45,432 INFO L273 TraceCheckUtils]: 84: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 18:56:45,432 INFO L273 TraceCheckUtils]: 85: Hoare triple {8185#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 18:56:45,432 INFO L273 TraceCheckUtils]: 86: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 18:56:45,433 INFO L273 TraceCheckUtils]: 87: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 18:56:45,433 INFO L273 TraceCheckUtils]: 88: Hoare triple {8185#true} assume !(~i~0 < 100000); {8185#true} is VALID [2018-11-14 18:56:45,433 INFO L273 TraceCheckUtils]: 89: Hoare triple {8185#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8185#true} is VALID [2018-11-14 18:56:45,433 INFO L273 TraceCheckUtils]: 90: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 18:56:45,433 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {8185#true} {8186#false} #75#return; {8186#false} is VALID [2018-11-14 18:56:45,433 INFO L273 TraceCheckUtils]: 92: Hoare triple {8186#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {8186#false} is VALID [2018-11-14 18:56:45,433 INFO L273 TraceCheckUtils]: 93: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:56:45,433 INFO L273 TraceCheckUtils]: 94: Hoare triple {8186#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {8186#false} is VALID [2018-11-14 18:56:45,433 INFO L273 TraceCheckUtils]: 95: Hoare triple {8186#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {8186#false} is VALID [2018-11-14 18:56:45,434 INFO L273 TraceCheckUtils]: 96: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:56:45,434 INFO L273 TraceCheckUtils]: 97: Hoare triple {8186#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {8186#false} is VALID [2018-11-14 18:56:45,434 INFO L273 TraceCheckUtils]: 98: Hoare triple {8186#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {8186#false} is VALID [2018-11-14 18:56:45,434 INFO L273 TraceCheckUtils]: 99: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:56:45,434 INFO L273 TraceCheckUtils]: 100: Hoare triple {8186#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {8186#false} is VALID [2018-11-14 18:56:45,434 INFO L273 TraceCheckUtils]: 101: Hoare triple {8186#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {8186#false} is VALID [2018-11-14 18:56:45,434 INFO L273 TraceCheckUtils]: 102: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:56:45,434 INFO L273 TraceCheckUtils]: 103: Hoare triple {8186#false} assume !(~i~2 < 99999); {8186#false} is VALID [2018-11-14 18:56:45,434 INFO L273 TraceCheckUtils]: 104: Hoare triple {8186#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {8186#false} is VALID [2018-11-14 18:56:45,435 INFO L256 TraceCheckUtils]: 105: Hoare triple {8186#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {8185#true} is VALID [2018-11-14 18:56:45,435 INFO L273 TraceCheckUtils]: 106: Hoare triple {8185#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {8185#true} is VALID [2018-11-14 18:56:45,435 INFO L273 TraceCheckUtils]: 107: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 18:56:45,435 INFO L273 TraceCheckUtils]: 108: Hoare triple {8185#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 18:56:45,435 INFO L273 TraceCheckUtils]: 109: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 18:56:45,435 INFO L273 TraceCheckUtils]: 110: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 18:56:45,435 INFO L273 TraceCheckUtils]: 111: Hoare triple {8185#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 18:56:45,435 INFO L273 TraceCheckUtils]: 112: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 18:56:45,436 INFO L273 TraceCheckUtils]: 113: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 18:56:45,436 INFO L273 TraceCheckUtils]: 114: Hoare triple {8185#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 18:56:45,436 INFO L273 TraceCheckUtils]: 115: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 18:56:45,436 INFO L273 TraceCheckUtils]: 116: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 18:56:45,436 INFO L273 TraceCheckUtils]: 117: Hoare triple {8185#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 18:56:45,436 INFO L273 TraceCheckUtils]: 118: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 18:56:45,436 INFO L273 TraceCheckUtils]: 119: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 18:56:45,436 INFO L273 TraceCheckUtils]: 120: Hoare triple {8185#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 18:56:45,436 INFO L273 TraceCheckUtils]: 121: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 18:56:45,437 INFO L273 TraceCheckUtils]: 122: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 18:56:45,437 INFO L273 TraceCheckUtils]: 123: Hoare triple {8185#true} assume !(~i~0 < 100000); {8185#true} is VALID [2018-11-14 18:56:45,437 INFO L273 TraceCheckUtils]: 124: Hoare triple {8185#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8185#true} is VALID [2018-11-14 18:56:45,437 INFO L273 TraceCheckUtils]: 125: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 18:56:45,437 INFO L268 TraceCheckUtils]: 126: Hoare quadruple {8185#true} {8186#false} #77#return; {8186#false} is VALID [2018-11-14 18:56:45,437 INFO L273 TraceCheckUtils]: 127: Hoare triple {8186#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {8186#false} is VALID [2018-11-14 18:56:45,437 INFO L273 TraceCheckUtils]: 128: Hoare triple {8186#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {8186#false} is VALID [2018-11-14 18:56:45,437 INFO L273 TraceCheckUtils]: 129: Hoare triple {8186#false} assume !false; {8186#false} is VALID [2018-11-14 18:56:45,445 INFO L134 CoverageAnalysis]: Checked inductivity of 698 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2018-11-14 18:56:45,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:56:45,445 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-14 18:56:45,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:56:45,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:56:45,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:56:45,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:56:45,905 INFO L256 TraceCheckUtils]: 0: Hoare triple {8185#true} call ULTIMATE.init(); {8185#true} is VALID [2018-11-14 18:56:45,906 INFO L273 TraceCheckUtils]: 1: Hoare triple {8185#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8185#true} is VALID [2018-11-14 18:56:45,906 INFO L273 TraceCheckUtils]: 2: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 18:56:45,906 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8185#true} {8185#true} #69#return; {8185#true} is VALID [2018-11-14 18:56:45,906 INFO L256 TraceCheckUtils]: 4: Hoare triple {8185#true} call #t~ret13 := main(); {8185#true} is VALID [2018-11-14 18:56:45,907 INFO L273 TraceCheckUtils]: 5: Hoare triple {8185#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; {8219#(<= main_~i~1 0)} is VALID [2018-11-14 18:56:45,908 INFO L273 TraceCheckUtils]: 6: Hoare triple {8219#(<= main_~i~1 0)} assume true; {8219#(<= main_~i~1 0)} is VALID [2018-11-14 18:56:45,908 INFO L273 TraceCheckUtils]: 7: Hoare triple {8219#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {8219#(<= main_~i~1 0)} is VALID [2018-11-14 18:56:45,909 INFO L273 TraceCheckUtils]: 8: Hoare triple {8219#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8188#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:45,909 INFO L273 TraceCheckUtils]: 9: Hoare triple {8188#(<= main_~i~1 1)} assume true; {8188#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:45,910 INFO L273 TraceCheckUtils]: 10: Hoare triple {8188#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {8188#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:45,910 INFO L273 TraceCheckUtils]: 11: Hoare triple {8188#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8189#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:45,911 INFO L273 TraceCheckUtils]: 12: Hoare triple {8189#(<= main_~i~1 2)} assume true; {8189#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:45,911 INFO L273 TraceCheckUtils]: 13: Hoare triple {8189#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {8189#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:45,912 INFO L273 TraceCheckUtils]: 14: Hoare triple {8189#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8190#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:45,912 INFO L273 TraceCheckUtils]: 15: Hoare triple {8190#(<= main_~i~1 3)} assume true; {8190#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:45,913 INFO L273 TraceCheckUtils]: 16: Hoare triple {8190#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {8190#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:45,914 INFO L273 TraceCheckUtils]: 17: Hoare triple {8190#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8191#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:45,914 INFO L273 TraceCheckUtils]: 18: Hoare triple {8191#(<= main_~i~1 4)} assume true; {8191#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:45,915 INFO L273 TraceCheckUtils]: 19: Hoare triple {8191#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {8191#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:45,916 INFO L273 TraceCheckUtils]: 20: Hoare triple {8191#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8192#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:45,916 INFO L273 TraceCheckUtils]: 21: Hoare triple {8192#(<= main_~i~1 5)} assume true; {8192#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:45,917 INFO L273 TraceCheckUtils]: 22: Hoare triple {8192#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {8192#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:45,918 INFO L273 TraceCheckUtils]: 23: Hoare triple {8192#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8193#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:45,918 INFO L273 TraceCheckUtils]: 24: Hoare triple {8193#(<= main_~i~1 6)} assume true; {8193#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:45,919 INFO L273 TraceCheckUtils]: 25: Hoare triple {8193#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {8193#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:45,919 INFO L273 TraceCheckUtils]: 26: Hoare triple {8193#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8194#(<= main_~i~1 7)} is VALID [2018-11-14 18:56:45,920 INFO L273 TraceCheckUtils]: 27: Hoare triple {8194#(<= main_~i~1 7)} assume true; {8194#(<= main_~i~1 7)} is VALID [2018-11-14 18:56:45,920 INFO L273 TraceCheckUtils]: 28: Hoare triple {8194#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {8194#(<= main_~i~1 7)} is VALID [2018-11-14 18:56:45,921 INFO L273 TraceCheckUtils]: 29: Hoare triple {8194#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8195#(<= main_~i~1 8)} is VALID [2018-11-14 18:56:45,922 INFO L273 TraceCheckUtils]: 30: Hoare triple {8195#(<= main_~i~1 8)} assume true; {8195#(<= main_~i~1 8)} is VALID [2018-11-14 18:56:45,922 INFO L273 TraceCheckUtils]: 31: Hoare triple {8195#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {8195#(<= main_~i~1 8)} is VALID [2018-11-14 18:56:45,923 INFO L273 TraceCheckUtils]: 32: Hoare triple {8195#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8196#(<= main_~i~1 9)} is VALID [2018-11-14 18:56:45,924 INFO L273 TraceCheckUtils]: 33: Hoare triple {8196#(<= main_~i~1 9)} assume true; {8196#(<= main_~i~1 9)} is VALID [2018-11-14 18:56:45,924 INFO L273 TraceCheckUtils]: 34: Hoare triple {8196#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {8196#(<= main_~i~1 9)} is VALID [2018-11-14 18:56:45,925 INFO L273 TraceCheckUtils]: 35: Hoare triple {8196#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8197#(<= main_~i~1 10)} is VALID [2018-11-14 18:56:45,925 INFO L273 TraceCheckUtils]: 36: Hoare triple {8197#(<= main_~i~1 10)} assume true; {8197#(<= main_~i~1 10)} is VALID [2018-11-14 18:56:45,926 INFO L273 TraceCheckUtils]: 37: Hoare triple {8197#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {8197#(<= main_~i~1 10)} is VALID [2018-11-14 18:56:45,927 INFO L273 TraceCheckUtils]: 38: Hoare triple {8197#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8198#(<= main_~i~1 11)} is VALID [2018-11-14 18:56:45,927 INFO L273 TraceCheckUtils]: 39: Hoare triple {8198#(<= main_~i~1 11)} assume true; {8198#(<= main_~i~1 11)} is VALID [2018-11-14 18:56:45,928 INFO L273 TraceCheckUtils]: 40: Hoare triple {8198#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {8198#(<= main_~i~1 11)} is VALID [2018-11-14 18:56:45,928 INFO L273 TraceCheckUtils]: 41: Hoare triple {8198#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8199#(<= main_~i~1 12)} is VALID [2018-11-14 18:56:45,929 INFO L273 TraceCheckUtils]: 42: Hoare triple {8199#(<= main_~i~1 12)} assume true; {8199#(<= main_~i~1 12)} is VALID [2018-11-14 18:56:45,929 INFO L273 TraceCheckUtils]: 43: Hoare triple {8199#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {8199#(<= main_~i~1 12)} is VALID [2018-11-14 18:56:45,930 INFO L273 TraceCheckUtils]: 44: Hoare triple {8199#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8200#(<= main_~i~1 13)} is VALID [2018-11-14 18:56:45,931 INFO L273 TraceCheckUtils]: 45: Hoare triple {8200#(<= main_~i~1 13)} assume true; {8200#(<= main_~i~1 13)} is VALID [2018-11-14 18:56:45,931 INFO L273 TraceCheckUtils]: 46: Hoare triple {8200#(<= main_~i~1 13)} assume !(~i~1 < 100000); {8186#false} is VALID [2018-11-14 18:56:45,932 INFO L256 TraceCheckUtils]: 47: Hoare triple {8186#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {8186#false} is VALID [2018-11-14 18:56:45,932 INFO L273 TraceCheckUtils]: 48: Hoare triple {8186#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {8186#false} is VALID [2018-11-14 18:56:45,932 INFO L273 TraceCheckUtils]: 49: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:56:45,932 INFO L273 TraceCheckUtils]: 50: Hoare triple {8186#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 18:56:45,932 INFO L273 TraceCheckUtils]: 51: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 18:56:45,933 INFO L273 TraceCheckUtils]: 52: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:56:45,933 INFO L273 TraceCheckUtils]: 53: Hoare triple {8186#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 18:56:45,933 INFO L273 TraceCheckUtils]: 54: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 18:56:45,933 INFO L273 TraceCheckUtils]: 55: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:56:45,933 INFO L273 TraceCheckUtils]: 56: Hoare triple {8186#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 18:56:45,934 INFO L273 TraceCheckUtils]: 57: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 18:56:45,934 INFO L273 TraceCheckUtils]: 58: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:56:45,934 INFO L273 TraceCheckUtils]: 59: Hoare triple {8186#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 18:56:45,934 INFO L273 TraceCheckUtils]: 60: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 18:56:45,934 INFO L273 TraceCheckUtils]: 61: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:56:45,935 INFO L273 TraceCheckUtils]: 62: Hoare triple {8186#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 18:56:45,935 INFO L273 TraceCheckUtils]: 63: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 18:56:45,935 INFO L273 TraceCheckUtils]: 64: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:56:45,935 INFO L273 TraceCheckUtils]: 65: Hoare triple {8186#false} assume !(~i~0 < 100000); {8186#false} is VALID [2018-11-14 18:56:45,935 INFO L273 TraceCheckUtils]: 66: Hoare triple {8186#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8186#false} is VALID [2018-11-14 18:56:45,935 INFO L273 TraceCheckUtils]: 67: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:56:45,935 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {8186#false} {8186#false} #73#return; {8186#false} is VALID [2018-11-14 18:56:45,935 INFO L273 TraceCheckUtils]: 69: Hoare triple {8186#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {8186#false} is VALID [2018-11-14 18:56:45,935 INFO L256 TraceCheckUtils]: 70: Hoare triple {8186#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {8186#false} is VALID [2018-11-14 18:56:45,936 INFO L273 TraceCheckUtils]: 71: Hoare triple {8186#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {8186#false} is VALID [2018-11-14 18:56:45,936 INFO L273 TraceCheckUtils]: 72: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:56:45,936 INFO L273 TraceCheckUtils]: 73: Hoare triple {8186#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 18:56:45,936 INFO L273 TraceCheckUtils]: 74: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 18:56:45,936 INFO L273 TraceCheckUtils]: 75: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:56:45,936 INFO L273 TraceCheckUtils]: 76: Hoare triple {8186#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 18:56:45,936 INFO L273 TraceCheckUtils]: 77: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 18:56:45,936 INFO L273 TraceCheckUtils]: 78: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:56:45,936 INFO L273 TraceCheckUtils]: 79: Hoare triple {8186#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 18:56:45,937 INFO L273 TraceCheckUtils]: 80: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 18:56:45,937 INFO L273 TraceCheckUtils]: 81: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:56:45,937 INFO L273 TraceCheckUtils]: 82: Hoare triple {8186#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 18:56:45,937 INFO L273 TraceCheckUtils]: 83: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 18:56:45,937 INFO L273 TraceCheckUtils]: 84: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:56:45,937 INFO L273 TraceCheckUtils]: 85: Hoare triple {8186#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 18:56:45,937 INFO L273 TraceCheckUtils]: 86: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 18:56:45,937 INFO L273 TraceCheckUtils]: 87: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:56:45,937 INFO L273 TraceCheckUtils]: 88: Hoare triple {8186#false} assume !(~i~0 < 100000); {8186#false} is VALID [2018-11-14 18:56:45,938 INFO L273 TraceCheckUtils]: 89: Hoare triple {8186#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8186#false} is VALID [2018-11-14 18:56:45,938 INFO L273 TraceCheckUtils]: 90: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:56:45,938 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {8186#false} {8186#false} #75#return; {8186#false} is VALID [2018-11-14 18:56:45,938 INFO L273 TraceCheckUtils]: 92: Hoare triple {8186#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {8186#false} is VALID [2018-11-14 18:56:45,938 INFO L273 TraceCheckUtils]: 93: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:56:45,938 INFO L273 TraceCheckUtils]: 94: Hoare triple {8186#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {8186#false} is VALID [2018-11-14 18:56:45,938 INFO L273 TraceCheckUtils]: 95: Hoare triple {8186#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {8186#false} is VALID [2018-11-14 18:56:45,938 INFO L273 TraceCheckUtils]: 96: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:56:45,939 INFO L273 TraceCheckUtils]: 97: Hoare triple {8186#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {8186#false} is VALID [2018-11-14 18:56:45,939 INFO L273 TraceCheckUtils]: 98: Hoare triple {8186#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {8186#false} is VALID [2018-11-14 18:56:45,939 INFO L273 TraceCheckUtils]: 99: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:56:45,939 INFO L273 TraceCheckUtils]: 100: Hoare triple {8186#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {8186#false} is VALID [2018-11-14 18:56:45,939 INFO L273 TraceCheckUtils]: 101: Hoare triple {8186#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {8186#false} is VALID [2018-11-14 18:56:45,939 INFO L273 TraceCheckUtils]: 102: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:56:45,939 INFO L273 TraceCheckUtils]: 103: Hoare triple {8186#false} assume !(~i~2 < 99999); {8186#false} is VALID [2018-11-14 18:56:45,939 INFO L273 TraceCheckUtils]: 104: Hoare triple {8186#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {8186#false} is VALID [2018-11-14 18:56:45,939 INFO L256 TraceCheckUtils]: 105: Hoare triple {8186#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {8186#false} is VALID [2018-11-14 18:56:45,940 INFO L273 TraceCheckUtils]: 106: Hoare triple {8186#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {8186#false} is VALID [2018-11-14 18:56:45,940 INFO L273 TraceCheckUtils]: 107: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:56:45,940 INFO L273 TraceCheckUtils]: 108: Hoare triple {8186#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 18:56:45,940 INFO L273 TraceCheckUtils]: 109: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 18:56:45,940 INFO L273 TraceCheckUtils]: 110: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:56:45,940 INFO L273 TraceCheckUtils]: 111: Hoare triple {8186#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 18:56:45,940 INFO L273 TraceCheckUtils]: 112: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 18:56:45,940 INFO L273 TraceCheckUtils]: 113: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:56:45,940 INFO L273 TraceCheckUtils]: 114: Hoare triple {8186#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 18:56:45,941 INFO L273 TraceCheckUtils]: 115: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 18:56:45,941 INFO L273 TraceCheckUtils]: 116: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:56:45,941 INFO L273 TraceCheckUtils]: 117: Hoare triple {8186#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 18:56:45,941 INFO L273 TraceCheckUtils]: 118: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 18:56:45,941 INFO L273 TraceCheckUtils]: 119: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:56:45,941 INFO L273 TraceCheckUtils]: 120: Hoare triple {8186#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 18:56:45,941 INFO L273 TraceCheckUtils]: 121: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 18:56:45,941 INFO L273 TraceCheckUtils]: 122: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:56:45,941 INFO L273 TraceCheckUtils]: 123: Hoare triple {8186#false} assume !(~i~0 < 100000); {8186#false} is VALID [2018-11-14 18:56:45,942 INFO L273 TraceCheckUtils]: 124: Hoare triple {8186#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8186#false} is VALID [2018-11-14 18:56:45,942 INFO L273 TraceCheckUtils]: 125: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 18:56:45,942 INFO L268 TraceCheckUtils]: 126: Hoare quadruple {8186#false} {8186#false} #77#return; {8186#false} is VALID [2018-11-14 18:56:45,942 INFO L273 TraceCheckUtils]: 127: Hoare triple {8186#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {8186#false} is VALID [2018-11-14 18:56:45,942 INFO L273 TraceCheckUtils]: 128: Hoare triple {8186#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {8186#false} is VALID [2018-11-14 18:56:45,942 INFO L273 TraceCheckUtils]: 129: Hoare triple {8186#false} assume !false; {8186#false} is VALID [2018-11-14 18:56:45,950 INFO L134 CoverageAnalysis]: Checked inductivity of 698 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2018-11-14 18:56:45,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:56:45,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-14 18:56:45,972 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 130 [2018-11-14 18:56:45,973 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:56:45,973 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-14 18:56:46,087 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-14 18:56:46,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-14 18:56:46,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-14 18:56:46,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-14 18:56:46,088 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 17 states. [2018-11-14 18:56:46,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:46,551 INFO L93 Difference]: Finished difference Result 135 states and 143 transitions. [2018-11-14 18:56:46,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 18:56:46,552 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 130 [2018-11-14 18:56:46,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:56:46,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 18:56:46,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 99 transitions. [2018-11-14 18:56:46,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 18:56:46,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 99 transitions. [2018-11-14 18:56:46,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 99 transitions. [2018-11-14 18:56:47,024 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-14 18:56:47,027 INFO L225 Difference]: With dead ends: 135 [2018-11-14 18:56:47,027 INFO L226 Difference]: Without dead ends: 93 [2018-11-14 18:56:47,028 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-14 18:56:47,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-14 18:56:47,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2018-11-14 18:56:47,186 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:56:47,186 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand 92 states. [2018-11-14 18:56:47,187 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 92 states. [2018-11-14 18:56:47,187 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 92 states. [2018-11-14 18:56:47,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:47,190 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2018-11-14 18:56:47,190 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2018-11-14 18:56:47,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:56:47,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:56:47,191 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 93 states. [2018-11-14 18:56:47,191 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 93 states. [2018-11-14 18:56:47,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:47,192 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2018-11-14 18:56:47,192 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2018-11-14 18:56:47,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:56:47,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:56:47,193 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:56:47,193 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:56:47,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-14 18:56:47,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2018-11-14 18:56:47,195 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 130 [2018-11-14 18:56:47,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:56:47,196 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2018-11-14 18:56:47,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-14 18:56:47,196 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2018-11-14 18:56:47,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-14 18:56:47,197 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:56:47,197 INFO L375 BasicCegarLoop]: trace histogram [18, 15, 15, 15, 14, 14, 4, 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-14 18:56:47,197 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:56:47,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:56:47,198 INFO L82 PathProgramCache]: Analyzing trace with hash 138227847, now seen corresponding path program 14 times [2018-11-14 18:56:47,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:56:47,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:56:47,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:56:47,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:56:47,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:56:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:56:47,617 INFO L256 TraceCheckUtils]: 0: Hoare triple {9084#true} call ULTIMATE.init(); {9084#true} is VALID [2018-11-14 18:56:47,617 INFO L273 TraceCheckUtils]: 1: Hoare triple {9084#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9084#true} is VALID [2018-11-14 18:56:47,617 INFO L273 TraceCheckUtils]: 2: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 18:56:47,617 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9084#true} {9084#true} #69#return; {9084#true} is VALID [2018-11-14 18:56:47,618 INFO L256 TraceCheckUtils]: 4: Hoare triple {9084#true} call #t~ret13 := main(); {9084#true} is VALID [2018-11-14 18:56:47,618 INFO L273 TraceCheckUtils]: 5: Hoare triple {9084#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; {9086#(= main_~i~1 0)} is VALID [2018-11-14 18:56:47,618 INFO L273 TraceCheckUtils]: 6: Hoare triple {9086#(= main_~i~1 0)} assume true; {9086#(= main_~i~1 0)} is VALID [2018-11-14 18:56:47,618 INFO L273 TraceCheckUtils]: 7: Hoare triple {9086#(= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {9086#(= main_~i~1 0)} is VALID [2018-11-14 18:56:47,619 INFO L273 TraceCheckUtils]: 8: Hoare triple {9086#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9087#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:47,620 INFO L273 TraceCheckUtils]: 9: Hoare triple {9087#(<= main_~i~1 1)} assume true; {9087#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:47,620 INFO L273 TraceCheckUtils]: 10: Hoare triple {9087#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {9087#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:47,621 INFO L273 TraceCheckUtils]: 11: Hoare triple {9087#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9088#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:47,621 INFO L273 TraceCheckUtils]: 12: Hoare triple {9088#(<= main_~i~1 2)} assume true; {9088#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:47,622 INFO L273 TraceCheckUtils]: 13: Hoare triple {9088#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {9088#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:47,622 INFO L273 TraceCheckUtils]: 14: Hoare triple {9088#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9089#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:47,623 INFO L273 TraceCheckUtils]: 15: Hoare triple {9089#(<= main_~i~1 3)} assume true; {9089#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:47,623 INFO L273 TraceCheckUtils]: 16: Hoare triple {9089#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {9089#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:47,624 INFO L273 TraceCheckUtils]: 17: Hoare triple {9089#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9090#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:47,625 INFO L273 TraceCheckUtils]: 18: Hoare triple {9090#(<= main_~i~1 4)} assume true; {9090#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:47,625 INFO L273 TraceCheckUtils]: 19: Hoare triple {9090#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {9090#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:47,626 INFO L273 TraceCheckUtils]: 20: Hoare triple {9090#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9091#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:47,626 INFO L273 TraceCheckUtils]: 21: Hoare triple {9091#(<= main_~i~1 5)} assume true; {9091#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:47,627 INFO L273 TraceCheckUtils]: 22: Hoare triple {9091#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {9091#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:47,627 INFO L273 TraceCheckUtils]: 23: Hoare triple {9091#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9092#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:47,628 INFO L273 TraceCheckUtils]: 24: Hoare triple {9092#(<= main_~i~1 6)} assume true; {9092#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:47,628 INFO L273 TraceCheckUtils]: 25: Hoare triple {9092#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {9092#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:47,629 INFO L273 TraceCheckUtils]: 26: Hoare triple {9092#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9093#(<= main_~i~1 7)} is VALID [2018-11-14 18:56:47,630 INFO L273 TraceCheckUtils]: 27: Hoare triple {9093#(<= main_~i~1 7)} assume true; {9093#(<= main_~i~1 7)} is VALID [2018-11-14 18:56:47,630 INFO L273 TraceCheckUtils]: 28: Hoare triple {9093#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {9093#(<= main_~i~1 7)} is VALID [2018-11-14 18:56:47,631 INFO L273 TraceCheckUtils]: 29: Hoare triple {9093#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9094#(<= main_~i~1 8)} is VALID [2018-11-14 18:56:47,631 INFO L273 TraceCheckUtils]: 30: Hoare triple {9094#(<= main_~i~1 8)} assume true; {9094#(<= main_~i~1 8)} is VALID [2018-11-14 18:56:47,632 INFO L273 TraceCheckUtils]: 31: Hoare triple {9094#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {9094#(<= main_~i~1 8)} is VALID [2018-11-14 18:56:47,632 INFO L273 TraceCheckUtils]: 32: Hoare triple {9094#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9095#(<= main_~i~1 9)} is VALID [2018-11-14 18:56:47,633 INFO L273 TraceCheckUtils]: 33: Hoare triple {9095#(<= main_~i~1 9)} assume true; {9095#(<= main_~i~1 9)} is VALID [2018-11-14 18:56:47,633 INFO L273 TraceCheckUtils]: 34: Hoare triple {9095#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {9095#(<= main_~i~1 9)} is VALID [2018-11-14 18:56:47,634 INFO L273 TraceCheckUtils]: 35: Hoare triple {9095#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9096#(<= main_~i~1 10)} is VALID [2018-11-14 18:56:47,635 INFO L273 TraceCheckUtils]: 36: Hoare triple {9096#(<= main_~i~1 10)} assume true; {9096#(<= main_~i~1 10)} is VALID [2018-11-14 18:56:47,635 INFO L273 TraceCheckUtils]: 37: Hoare triple {9096#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {9096#(<= main_~i~1 10)} is VALID [2018-11-14 18:56:47,636 INFO L273 TraceCheckUtils]: 38: Hoare triple {9096#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9097#(<= main_~i~1 11)} is VALID [2018-11-14 18:56:47,636 INFO L273 TraceCheckUtils]: 39: Hoare triple {9097#(<= main_~i~1 11)} assume true; {9097#(<= main_~i~1 11)} is VALID [2018-11-14 18:56:47,637 INFO L273 TraceCheckUtils]: 40: Hoare triple {9097#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {9097#(<= main_~i~1 11)} is VALID [2018-11-14 18:56:47,638 INFO L273 TraceCheckUtils]: 41: Hoare triple {9097#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9098#(<= main_~i~1 12)} is VALID [2018-11-14 18:56:47,638 INFO L273 TraceCheckUtils]: 42: Hoare triple {9098#(<= main_~i~1 12)} assume true; {9098#(<= main_~i~1 12)} is VALID [2018-11-14 18:56:47,639 INFO L273 TraceCheckUtils]: 43: Hoare triple {9098#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {9098#(<= main_~i~1 12)} is VALID [2018-11-14 18:56:47,639 INFO L273 TraceCheckUtils]: 44: Hoare triple {9098#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9099#(<= main_~i~1 13)} is VALID [2018-11-14 18:56:47,640 INFO L273 TraceCheckUtils]: 45: Hoare triple {9099#(<= main_~i~1 13)} assume true; {9099#(<= main_~i~1 13)} is VALID [2018-11-14 18:56:47,640 INFO L273 TraceCheckUtils]: 46: Hoare triple {9099#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {9099#(<= main_~i~1 13)} is VALID [2018-11-14 18:56:47,641 INFO L273 TraceCheckUtils]: 47: Hoare triple {9099#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9100#(<= main_~i~1 14)} is VALID [2018-11-14 18:56:47,641 INFO L273 TraceCheckUtils]: 48: Hoare triple {9100#(<= main_~i~1 14)} assume true; {9100#(<= main_~i~1 14)} is VALID [2018-11-14 18:56:47,642 INFO L273 TraceCheckUtils]: 49: Hoare triple {9100#(<= main_~i~1 14)} assume !(~i~1 < 100000); {9085#false} is VALID [2018-11-14 18:56:47,642 INFO L256 TraceCheckUtils]: 50: Hoare triple {9085#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {9084#true} is VALID [2018-11-14 18:56:47,642 INFO L273 TraceCheckUtils]: 51: Hoare triple {9084#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {9084#true} is VALID [2018-11-14 18:56:47,643 INFO L273 TraceCheckUtils]: 52: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 18:56:47,643 INFO L273 TraceCheckUtils]: 53: Hoare triple {9084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 18:56:47,643 INFO L273 TraceCheckUtils]: 54: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 18:56:47,643 INFO L273 TraceCheckUtils]: 55: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 18:56:47,643 INFO L273 TraceCheckUtils]: 56: Hoare triple {9084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 18:56:47,644 INFO L273 TraceCheckUtils]: 57: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 18:56:47,644 INFO L273 TraceCheckUtils]: 58: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 18:56:47,644 INFO L273 TraceCheckUtils]: 59: Hoare triple {9084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 18:56:47,644 INFO L273 TraceCheckUtils]: 60: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 18:56:47,644 INFO L273 TraceCheckUtils]: 61: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 18:56:47,644 INFO L273 TraceCheckUtils]: 62: Hoare triple {9084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 18:56:47,645 INFO L273 TraceCheckUtils]: 63: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 18:56:47,645 INFO L273 TraceCheckUtils]: 64: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 18:56:47,645 INFO L273 TraceCheckUtils]: 65: Hoare triple {9084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 18:56:47,645 INFO L273 TraceCheckUtils]: 66: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 18:56:47,645 INFO L273 TraceCheckUtils]: 67: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 18:56:47,645 INFO L273 TraceCheckUtils]: 68: Hoare triple {9084#true} assume !(~i~0 < 100000); {9084#true} is VALID [2018-11-14 18:56:47,645 INFO L273 TraceCheckUtils]: 69: Hoare triple {9084#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {9084#true} is VALID [2018-11-14 18:56:47,645 INFO L273 TraceCheckUtils]: 70: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 18:56:47,646 INFO L268 TraceCheckUtils]: 71: Hoare quadruple {9084#true} {9085#false} #73#return; {9085#false} is VALID [2018-11-14 18:56:47,646 INFO L273 TraceCheckUtils]: 72: Hoare triple {9085#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {9085#false} is VALID [2018-11-14 18:56:47,646 INFO L256 TraceCheckUtils]: 73: Hoare triple {9085#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {9084#true} is VALID [2018-11-14 18:56:47,646 INFO L273 TraceCheckUtils]: 74: Hoare triple {9084#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {9084#true} is VALID [2018-11-14 18:56:47,646 INFO L273 TraceCheckUtils]: 75: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 18:56:47,646 INFO L273 TraceCheckUtils]: 76: Hoare triple {9084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 18:56:47,646 INFO L273 TraceCheckUtils]: 77: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 18:56:47,646 INFO L273 TraceCheckUtils]: 78: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 18:56:47,646 INFO L273 TraceCheckUtils]: 79: Hoare triple {9084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 18:56:47,647 INFO L273 TraceCheckUtils]: 80: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 18:56:47,647 INFO L273 TraceCheckUtils]: 81: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 18:56:47,647 INFO L273 TraceCheckUtils]: 82: Hoare triple {9084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 18:56:47,647 INFO L273 TraceCheckUtils]: 83: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 18:56:47,647 INFO L273 TraceCheckUtils]: 84: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 18:56:47,647 INFO L273 TraceCheckUtils]: 85: Hoare triple {9084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 18:56:47,647 INFO L273 TraceCheckUtils]: 86: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 18:56:47,647 INFO L273 TraceCheckUtils]: 87: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 18:56:47,648 INFO L273 TraceCheckUtils]: 88: Hoare triple {9084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 18:56:47,648 INFO L273 TraceCheckUtils]: 89: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 18:56:47,648 INFO L273 TraceCheckUtils]: 90: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 18:56:47,648 INFO L273 TraceCheckUtils]: 91: Hoare triple {9084#true} assume !(~i~0 < 100000); {9084#true} is VALID [2018-11-14 18:56:47,648 INFO L273 TraceCheckUtils]: 92: Hoare triple {9084#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {9084#true} is VALID [2018-11-14 18:56:47,648 INFO L273 TraceCheckUtils]: 93: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 18:56:47,648 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {9084#true} {9085#false} #75#return; {9085#false} is VALID [2018-11-14 18:56:47,648 INFO L273 TraceCheckUtils]: 95: Hoare triple {9085#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {9085#false} is VALID [2018-11-14 18:56:47,648 INFO L273 TraceCheckUtils]: 96: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:56:47,649 INFO L273 TraceCheckUtils]: 97: Hoare triple {9085#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {9085#false} is VALID [2018-11-14 18:56:47,649 INFO L273 TraceCheckUtils]: 98: Hoare triple {9085#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {9085#false} is VALID [2018-11-14 18:56:47,649 INFO L273 TraceCheckUtils]: 99: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:56:47,649 INFO L273 TraceCheckUtils]: 100: Hoare triple {9085#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {9085#false} is VALID [2018-11-14 18:56:47,649 INFO L273 TraceCheckUtils]: 101: Hoare triple {9085#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {9085#false} is VALID [2018-11-14 18:56:47,649 INFO L273 TraceCheckUtils]: 102: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:56:47,649 INFO L273 TraceCheckUtils]: 103: Hoare triple {9085#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {9085#false} is VALID [2018-11-14 18:56:47,649 INFO L273 TraceCheckUtils]: 104: Hoare triple {9085#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {9085#false} is VALID [2018-11-14 18:56:47,649 INFO L273 TraceCheckUtils]: 105: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:56:47,650 INFO L273 TraceCheckUtils]: 106: Hoare triple {9085#false} assume !(~i~2 < 99999); {9085#false} is VALID [2018-11-14 18:56:47,650 INFO L273 TraceCheckUtils]: 107: Hoare triple {9085#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {9085#false} is VALID [2018-11-14 18:56:47,650 INFO L256 TraceCheckUtils]: 108: Hoare triple {9085#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {9084#true} is VALID [2018-11-14 18:56:47,650 INFO L273 TraceCheckUtils]: 109: Hoare triple {9084#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {9084#true} is VALID [2018-11-14 18:56:47,650 INFO L273 TraceCheckUtils]: 110: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 18:56:47,650 INFO L273 TraceCheckUtils]: 111: Hoare triple {9084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 18:56:47,650 INFO L273 TraceCheckUtils]: 112: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 18:56:47,650 INFO L273 TraceCheckUtils]: 113: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 18:56:47,650 INFO L273 TraceCheckUtils]: 114: Hoare triple {9084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 18:56:47,651 INFO L273 TraceCheckUtils]: 115: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 18:56:47,651 INFO L273 TraceCheckUtils]: 116: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 18:56:47,651 INFO L273 TraceCheckUtils]: 117: Hoare triple {9084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 18:56:47,651 INFO L273 TraceCheckUtils]: 118: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 18:56:47,651 INFO L273 TraceCheckUtils]: 119: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 18:56:47,651 INFO L273 TraceCheckUtils]: 120: Hoare triple {9084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 18:56:47,651 INFO L273 TraceCheckUtils]: 121: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 18:56:47,651 INFO L273 TraceCheckUtils]: 122: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 18:56:47,651 INFO L273 TraceCheckUtils]: 123: Hoare triple {9084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 18:56:47,652 INFO L273 TraceCheckUtils]: 124: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 18:56:47,652 INFO L273 TraceCheckUtils]: 125: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 18:56:47,652 INFO L273 TraceCheckUtils]: 126: Hoare triple {9084#true} assume !(~i~0 < 100000); {9084#true} is VALID [2018-11-14 18:56:47,652 INFO L273 TraceCheckUtils]: 127: Hoare triple {9084#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {9084#true} is VALID [2018-11-14 18:56:47,652 INFO L273 TraceCheckUtils]: 128: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 18:56:47,652 INFO L268 TraceCheckUtils]: 129: Hoare quadruple {9084#true} {9085#false} #77#return; {9085#false} is VALID [2018-11-14 18:56:47,652 INFO L273 TraceCheckUtils]: 130: Hoare triple {9085#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {9085#false} is VALID [2018-11-14 18:56:47,653 INFO L273 TraceCheckUtils]: 131: Hoare triple {9085#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {9085#false} is VALID [2018-11-14 18:56:47,653 INFO L273 TraceCheckUtils]: 132: Hoare triple {9085#false} assume !false; {9085#false} is VALID [2018-11-14 18:56:47,663 INFO L134 CoverageAnalysis]: Checked inductivity of 739 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2018-11-14 18:56:47,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:56:47,663 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-14 18:56:47,680 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:56:47,727 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:56:47,727 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:56:47,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:56:47,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:56:47,999 INFO L256 TraceCheckUtils]: 0: Hoare triple {9084#true} call ULTIMATE.init(); {9084#true} is VALID [2018-11-14 18:56:48,000 INFO L273 TraceCheckUtils]: 1: Hoare triple {9084#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9084#true} is VALID [2018-11-14 18:56:48,000 INFO L273 TraceCheckUtils]: 2: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 18:56:48,000 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9084#true} {9084#true} #69#return; {9084#true} is VALID [2018-11-14 18:56:48,001 INFO L256 TraceCheckUtils]: 4: Hoare triple {9084#true} call #t~ret13 := main(); {9084#true} is VALID [2018-11-14 18:56:48,001 INFO L273 TraceCheckUtils]: 5: Hoare triple {9084#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; {9119#(<= main_~i~1 0)} is VALID [2018-11-14 18:56:48,002 INFO L273 TraceCheckUtils]: 6: Hoare triple {9119#(<= main_~i~1 0)} assume true; {9119#(<= main_~i~1 0)} is VALID [2018-11-14 18:56:48,002 INFO L273 TraceCheckUtils]: 7: Hoare triple {9119#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {9119#(<= main_~i~1 0)} is VALID [2018-11-14 18:56:48,003 INFO L273 TraceCheckUtils]: 8: Hoare triple {9119#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9087#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:48,004 INFO L273 TraceCheckUtils]: 9: Hoare triple {9087#(<= main_~i~1 1)} assume true; {9087#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:48,004 INFO L273 TraceCheckUtils]: 10: Hoare triple {9087#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {9087#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:48,005 INFO L273 TraceCheckUtils]: 11: Hoare triple {9087#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9088#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:48,006 INFO L273 TraceCheckUtils]: 12: Hoare triple {9088#(<= main_~i~1 2)} assume true; {9088#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:48,006 INFO L273 TraceCheckUtils]: 13: Hoare triple {9088#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {9088#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:48,007 INFO L273 TraceCheckUtils]: 14: Hoare triple {9088#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9089#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:48,015 INFO L273 TraceCheckUtils]: 15: Hoare triple {9089#(<= main_~i~1 3)} assume true; {9089#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:48,015 INFO L273 TraceCheckUtils]: 16: Hoare triple {9089#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {9089#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:48,016 INFO L273 TraceCheckUtils]: 17: Hoare triple {9089#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9090#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:48,016 INFO L273 TraceCheckUtils]: 18: Hoare triple {9090#(<= main_~i~1 4)} assume true; {9090#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:48,016 INFO L273 TraceCheckUtils]: 19: Hoare triple {9090#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {9090#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:48,017 INFO L273 TraceCheckUtils]: 20: Hoare triple {9090#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9091#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:48,017 INFO L273 TraceCheckUtils]: 21: Hoare triple {9091#(<= main_~i~1 5)} assume true; {9091#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:48,017 INFO L273 TraceCheckUtils]: 22: Hoare triple {9091#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {9091#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:48,018 INFO L273 TraceCheckUtils]: 23: Hoare triple {9091#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9092#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:48,018 INFO L273 TraceCheckUtils]: 24: Hoare triple {9092#(<= main_~i~1 6)} assume true; {9092#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:48,018 INFO L273 TraceCheckUtils]: 25: Hoare triple {9092#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {9092#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:48,019 INFO L273 TraceCheckUtils]: 26: Hoare triple {9092#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9093#(<= main_~i~1 7)} is VALID [2018-11-14 18:56:48,020 INFO L273 TraceCheckUtils]: 27: Hoare triple {9093#(<= main_~i~1 7)} assume true; {9093#(<= main_~i~1 7)} is VALID [2018-11-14 18:56:48,020 INFO L273 TraceCheckUtils]: 28: Hoare triple {9093#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {9093#(<= main_~i~1 7)} is VALID [2018-11-14 18:56:48,021 INFO L273 TraceCheckUtils]: 29: Hoare triple {9093#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9094#(<= main_~i~1 8)} is VALID [2018-11-14 18:56:48,022 INFO L273 TraceCheckUtils]: 30: Hoare triple {9094#(<= main_~i~1 8)} assume true; {9094#(<= main_~i~1 8)} is VALID [2018-11-14 18:56:48,022 INFO L273 TraceCheckUtils]: 31: Hoare triple {9094#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {9094#(<= main_~i~1 8)} is VALID [2018-11-14 18:56:48,023 INFO L273 TraceCheckUtils]: 32: Hoare triple {9094#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9095#(<= main_~i~1 9)} is VALID [2018-11-14 18:56:48,023 INFO L273 TraceCheckUtils]: 33: Hoare triple {9095#(<= main_~i~1 9)} assume true; {9095#(<= main_~i~1 9)} is VALID [2018-11-14 18:56:48,024 INFO L273 TraceCheckUtils]: 34: Hoare triple {9095#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {9095#(<= main_~i~1 9)} is VALID [2018-11-14 18:56:48,025 INFO L273 TraceCheckUtils]: 35: Hoare triple {9095#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9096#(<= main_~i~1 10)} is VALID [2018-11-14 18:56:48,025 INFO L273 TraceCheckUtils]: 36: Hoare triple {9096#(<= main_~i~1 10)} assume true; {9096#(<= main_~i~1 10)} is VALID [2018-11-14 18:56:48,026 INFO L273 TraceCheckUtils]: 37: Hoare triple {9096#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {9096#(<= main_~i~1 10)} is VALID [2018-11-14 18:56:48,026 INFO L273 TraceCheckUtils]: 38: Hoare triple {9096#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9097#(<= main_~i~1 11)} is VALID [2018-11-14 18:56:48,027 INFO L273 TraceCheckUtils]: 39: Hoare triple {9097#(<= main_~i~1 11)} assume true; {9097#(<= main_~i~1 11)} is VALID [2018-11-14 18:56:48,027 INFO L273 TraceCheckUtils]: 40: Hoare triple {9097#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {9097#(<= main_~i~1 11)} is VALID [2018-11-14 18:56:48,028 INFO L273 TraceCheckUtils]: 41: Hoare triple {9097#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9098#(<= main_~i~1 12)} is VALID [2018-11-14 18:56:48,029 INFO L273 TraceCheckUtils]: 42: Hoare triple {9098#(<= main_~i~1 12)} assume true; {9098#(<= main_~i~1 12)} is VALID [2018-11-14 18:56:48,029 INFO L273 TraceCheckUtils]: 43: Hoare triple {9098#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {9098#(<= main_~i~1 12)} is VALID [2018-11-14 18:56:48,030 INFO L273 TraceCheckUtils]: 44: Hoare triple {9098#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9099#(<= main_~i~1 13)} is VALID [2018-11-14 18:56:48,030 INFO L273 TraceCheckUtils]: 45: Hoare triple {9099#(<= main_~i~1 13)} assume true; {9099#(<= main_~i~1 13)} is VALID [2018-11-14 18:56:48,031 INFO L273 TraceCheckUtils]: 46: Hoare triple {9099#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {9099#(<= main_~i~1 13)} is VALID [2018-11-14 18:56:48,032 INFO L273 TraceCheckUtils]: 47: Hoare triple {9099#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9100#(<= main_~i~1 14)} is VALID [2018-11-14 18:56:48,032 INFO L273 TraceCheckUtils]: 48: Hoare triple {9100#(<= main_~i~1 14)} assume true; {9100#(<= main_~i~1 14)} is VALID [2018-11-14 18:56:48,033 INFO L273 TraceCheckUtils]: 49: Hoare triple {9100#(<= main_~i~1 14)} assume !(~i~1 < 100000); {9085#false} is VALID [2018-11-14 18:56:48,033 INFO L256 TraceCheckUtils]: 50: Hoare triple {9085#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {9085#false} is VALID [2018-11-14 18:56:48,033 INFO L273 TraceCheckUtils]: 51: Hoare triple {9085#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {9085#false} is VALID [2018-11-14 18:56:48,034 INFO L273 TraceCheckUtils]: 52: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:56:48,034 INFO L273 TraceCheckUtils]: 53: Hoare triple {9085#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 18:56:48,034 INFO L273 TraceCheckUtils]: 54: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 18:56:48,034 INFO L273 TraceCheckUtils]: 55: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:56:48,034 INFO L273 TraceCheckUtils]: 56: Hoare triple {9085#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 18:56:48,034 INFO L273 TraceCheckUtils]: 57: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 18:56:48,035 INFO L273 TraceCheckUtils]: 58: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:56:48,035 INFO L273 TraceCheckUtils]: 59: Hoare triple {9085#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 18:56:48,035 INFO L273 TraceCheckUtils]: 60: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 18:56:48,035 INFO L273 TraceCheckUtils]: 61: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:56:48,035 INFO L273 TraceCheckUtils]: 62: Hoare triple {9085#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 18:56:48,036 INFO L273 TraceCheckUtils]: 63: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 18:56:48,036 INFO L273 TraceCheckUtils]: 64: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:56:48,036 INFO L273 TraceCheckUtils]: 65: Hoare triple {9085#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 18:56:48,036 INFO L273 TraceCheckUtils]: 66: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 18:56:48,036 INFO L273 TraceCheckUtils]: 67: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:56:48,036 INFO L273 TraceCheckUtils]: 68: Hoare triple {9085#false} assume !(~i~0 < 100000); {9085#false} is VALID [2018-11-14 18:56:48,036 INFO L273 TraceCheckUtils]: 69: Hoare triple {9085#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {9085#false} is VALID [2018-11-14 18:56:48,036 INFO L273 TraceCheckUtils]: 70: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:56:48,036 INFO L268 TraceCheckUtils]: 71: Hoare quadruple {9085#false} {9085#false} #73#return; {9085#false} is VALID [2018-11-14 18:56:48,037 INFO L273 TraceCheckUtils]: 72: Hoare triple {9085#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {9085#false} is VALID [2018-11-14 18:56:48,037 INFO L256 TraceCheckUtils]: 73: Hoare triple {9085#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {9085#false} is VALID [2018-11-14 18:56:48,037 INFO L273 TraceCheckUtils]: 74: Hoare triple {9085#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {9085#false} is VALID [2018-11-14 18:56:48,037 INFO L273 TraceCheckUtils]: 75: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:56:48,037 INFO L273 TraceCheckUtils]: 76: Hoare triple {9085#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 18:56:48,037 INFO L273 TraceCheckUtils]: 77: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 18:56:48,037 INFO L273 TraceCheckUtils]: 78: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:56:48,037 INFO L273 TraceCheckUtils]: 79: Hoare triple {9085#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 18:56:48,037 INFO L273 TraceCheckUtils]: 80: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 18:56:48,038 INFO L273 TraceCheckUtils]: 81: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:56:48,038 INFO L273 TraceCheckUtils]: 82: Hoare triple {9085#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 18:56:48,038 INFO L273 TraceCheckUtils]: 83: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 18:56:48,038 INFO L273 TraceCheckUtils]: 84: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:56:48,038 INFO L273 TraceCheckUtils]: 85: Hoare triple {9085#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 18:56:48,038 INFO L273 TraceCheckUtils]: 86: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 18:56:48,038 INFO L273 TraceCheckUtils]: 87: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:56:48,038 INFO L273 TraceCheckUtils]: 88: Hoare triple {9085#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 18:56:48,038 INFO L273 TraceCheckUtils]: 89: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 18:56:48,039 INFO L273 TraceCheckUtils]: 90: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:56:48,039 INFO L273 TraceCheckUtils]: 91: Hoare triple {9085#false} assume !(~i~0 < 100000); {9085#false} is VALID [2018-11-14 18:56:48,039 INFO L273 TraceCheckUtils]: 92: Hoare triple {9085#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {9085#false} is VALID [2018-11-14 18:56:48,039 INFO L273 TraceCheckUtils]: 93: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:56:48,039 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {9085#false} {9085#false} #75#return; {9085#false} is VALID [2018-11-14 18:56:48,039 INFO L273 TraceCheckUtils]: 95: Hoare triple {9085#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {9085#false} is VALID [2018-11-14 18:56:48,039 INFO L273 TraceCheckUtils]: 96: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:56:48,039 INFO L273 TraceCheckUtils]: 97: Hoare triple {9085#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {9085#false} is VALID [2018-11-14 18:56:48,039 INFO L273 TraceCheckUtils]: 98: Hoare triple {9085#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {9085#false} is VALID [2018-11-14 18:56:48,040 INFO L273 TraceCheckUtils]: 99: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:56:48,040 INFO L273 TraceCheckUtils]: 100: Hoare triple {9085#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {9085#false} is VALID [2018-11-14 18:56:48,040 INFO L273 TraceCheckUtils]: 101: Hoare triple {9085#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {9085#false} is VALID [2018-11-14 18:56:48,040 INFO L273 TraceCheckUtils]: 102: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:56:48,040 INFO L273 TraceCheckUtils]: 103: Hoare triple {9085#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {9085#false} is VALID [2018-11-14 18:56:48,040 INFO L273 TraceCheckUtils]: 104: Hoare triple {9085#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {9085#false} is VALID [2018-11-14 18:56:48,040 INFO L273 TraceCheckUtils]: 105: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:56:48,040 INFO L273 TraceCheckUtils]: 106: Hoare triple {9085#false} assume !(~i~2 < 99999); {9085#false} is VALID [2018-11-14 18:56:48,040 INFO L273 TraceCheckUtils]: 107: Hoare triple {9085#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {9085#false} is VALID [2018-11-14 18:56:48,041 INFO L256 TraceCheckUtils]: 108: Hoare triple {9085#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {9085#false} is VALID [2018-11-14 18:56:48,041 INFO L273 TraceCheckUtils]: 109: Hoare triple {9085#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {9085#false} is VALID [2018-11-14 18:56:48,041 INFO L273 TraceCheckUtils]: 110: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:56:48,041 INFO L273 TraceCheckUtils]: 111: Hoare triple {9085#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 18:56:48,041 INFO L273 TraceCheckUtils]: 112: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 18:56:48,041 INFO L273 TraceCheckUtils]: 113: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:56:48,041 INFO L273 TraceCheckUtils]: 114: Hoare triple {9085#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 18:56:48,041 INFO L273 TraceCheckUtils]: 115: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 18:56:48,041 INFO L273 TraceCheckUtils]: 116: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:56:48,042 INFO L273 TraceCheckUtils]: 117: Hoare triple {9085#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 18:56:48,042 INFO L273 TraceCheckUtils]: 118: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 18:56:48,042 INFO L273 TraceCheckUtils]: 119: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:56:48,042 INFO L273 TraceCheckUtils]: 120: Hoare triple {9085#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 18:56:48,042 INFO L273 TraceCheckUtils]: 121: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 18:56:48,042 INFO L273 TraceCheckUtils]: 122: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:56:48,042 INFO L273 TraceCheckUtils]: 123: Hoare triple {9085#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 18:56:48,043 INFO L273 TraceCheckUtils]: 124: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 18:56:48,043 INFO L273 TraceCheckUtils]: 125: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:56:48,043 INFO L273 TraceCheckUtils]: 126: Hoare triple {9085#false} assume !(~i~0 < 100000); {9085#false} is VALID [2018-11-14 18:56:48,043 INFO L273 TraceCheckUtils]: 127: Hoare triple {9085#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {9085#false} is VALID [2018-11-14 18:56:48,043 INFO L273 TraceCheckUtils]: 128: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 18:56:48,043 INFO L268 TraceCheckUtils]: 129: Hoare quadruple {9085#false} {9085#false} #77#return; {9085#false} is VALID [2018-11-14 18:56:48,044 INFO L273 TraceCheckUtils]: 130: Hoare triple {9085#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {9085#false} is VALID [2018-11-14 18:56:48,044 INFO L273 TraceCheckUtils]: 131: Hoare triple {9085#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {9085#false} is VALID [2018-11-14 18:56:48,044 INFO L273 TraceCheckUtils]: 132: Hoare triple {9085#false} assume !false; {9085#false} is VALID [2018-11-14 18:56:48,052 INFO L134 CoverageAnalysis]: Checked inductivity of 739 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2018-11-14 18:56:48,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:56:48,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-14 18:56:48,073 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 133 [2018-11-14 18:56:48,073 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:56:48,073 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-14 18:56:48,153 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-14 18:56:48,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-14 18:56:48,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-14 18:56:48,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-14 18:56:48,155 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand 18 states. [2018-11-14 18:56:48,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:48,986 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2018-11-14 18:56:48,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-14 18:56:48,986 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 133 [2018-11-14 18:56:48,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:56:48,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 18:56:48,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 102 transitions. [2018-11-14 18:56:48,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 18:56:48,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 102 transitions. [2018-11-14 18:56:48,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 102 transitions. [2018-11-14 18:56:49,099 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:56:49,102 INFO L225 Difference]: With dead ends: 138 [2018-11-14 18:56:49,102 INFO L226 Difference]: Without dead ends: 96 [2018-11-14 18:56:49,103 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-14 18:56:49,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-14 18:56:49,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2018-11-14 18:56:49,123 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:56:49,123 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 95 states. [2018-11-14 18:56:49,123 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 95 states. [2018-11-14 18:56:49,123 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 95 states. [2018-11-14 18:56:49,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:49,125 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-11-14 18:56:49,125 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-11-14 18:56:49,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:56:49,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:56:49,125 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 96 states. [2018-11-14 18:56:49,125 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 96 states. [2018-11-14 18:56:49,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:49,127 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-11-14 18:56:49,127 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-11-14 18:56:49,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:56:49,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:56:49,128 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:56:49,128 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:56:49,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-14 18:56:49,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2018-11-14 18:56:49,129 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 133 [2018-11-14 18:56:49,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:56:49,130 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2018-11-14 18:56:49,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-14 18:56:49,130 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-11-14 18:56:49,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-14 18:56:49,130 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:56:49,131 INFO L375 BasicCegarLoop]: trace histogram [18, 16, 15, 15, 15, 15, 4, 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-14 18:56:49,131 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:56:49,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:56:49,131 INFO L82 PathProgramCache]: Analyzing trace with hash 377991245, now seen corresponding path program 15 times [2018-11-14 18:56:49,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:56:49,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:56:49,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:56:49,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:56:49,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:56:49,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:56:50,452 INFO L256 TraceCheckUtils]: 0: Hoare triple {10007#true} call ULTIMATE.init(); {10007#true} is VALID [2018-11-14 18:56:50,452 INFO L273 TraceCheckUtils]: 1: Hoare triple {10007#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10007#true} is VALID [2018-11-14 18:56:50,453 INFO L273 TraceCheckUtils]: 2: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:56:50,453 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10007#true} {10007#true} #69#return; {10007#true} is VALID [2018-11-14 18:56:50,453 INFO L256 TraceCheckUtils]: 4: Hoare triple {10007#true} call #t~ret13 := main(); {10007#true} is VALID [2018-11-14 18:56:50,453 INFO L273 TraceCheckUtils]: 5: Hoare triple {10007#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; {10009#(= main_~i~1 0)} is VALID [2018-11-14 18:56:50,454 INFO L273 TraceCheckUtils]: 6: Hoare triple {10009#(= main_~i~1 0)} assume true; {10009#(= main_~i~1 0)} is VALID [2018-11-14 18:56:50,454 INFO L273 TraceCheckUtils]: 7: Hoare triple {10009#(= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {10009#(= main_~i~1 0)} is VALID [2018-11-14 18:56:50,455 INFO L273 TraceCheckUtils]: 8: Hoare triple {10009#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10010#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:50,455 INFO L273 TraceCheckUtils]: 9: Hoare triple {10010#(<= main_~i~1 1)} assume true; {10010#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:50,455 INFO L273 TraceCheckUtils]: 10: Hoare triple {10010#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {10010#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:50,456 INFO L273 TraceCheckUtils]: 11: Hoare triple {10010#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10011#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:50,456 INFO L273 TraceCheckUtils]: 12: Hoare triple {10011#(<= main_~i~1 2)} assume true; {10011#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:50,456 INFO L273 TraceCheckUtils]: 13: Hoare triple {10011#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {10011#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:50,457 INFO L273 TraceCheckUtils]: 14: Hoare triple {10011#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10012#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:50,457 INFO L273 TraceCheckUtils]: 15: Hoare triple {10012#(<= main_~i~1 3)} assume true; {10012#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:50,458 INFO L273 TraceCheckUtils]: 16: Hoare triple {10012#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {10012#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:50,458 INFO L273 TraceCheckUtils]: 17: Hoare triple {10012#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10013#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:50,459 INFO L273 TraceCheckUtils]: 18: Hoare triple {10013#(<= main_~i~1 4)} assume true; {10013#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:50,459 INFO L273 TraceCheckUtils]: 19: Hoare triple {10013#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {10013#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:50,460 INFO L273 TraceCheckUtils]: 20: Hoare triple {10013#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10014#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:50,461 INFO L273 TraceCheckUtils]: 21: Hoare triple {10014#(<= main_~i~1 5)} assume true; {10014#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:50,461 INFO L273 TraceCheckUtils]: 22: Hoare triple {10014#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {10014#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:50,462 INFO L273 TraceCheckUtils]: 23: Hoare triple {10014#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10015#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:50,462 INFO L273 TraceCheckUtils]: 24: Hoare triple {10015#(<= main_~i~1 6)} assume true; {10015#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:50,463 INFO L273 TraceCheckUtils]: 25: Hoare triple {10015#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {10015#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:50,464 INFO L273 TraceCheckUtils]: 26: Hoare triple {10015#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10016#(<= main_~i~1 7)} is VALID [2018-11-14 18:56:50,464 INFO L273 TraceCheckUtils]: 27: Hoare triple {10016#(<= main_~i~1 7)} assume true; {10016#(<= main_~i~1 7)} is VALID [2018-11-14 18:56:50,465 INFO L273 TraceCheckUtils]: 28: Hoare triple {10016#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {10016#(<= main_~i~1 7)} is VALID [2018-11-14 18:56:50,465 INFO L273 TraceCheckUtils]: 29: Hoare triple {10016#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10017#(<= main_~i~1 8)} is VALID [2018-11-14 18:56:50,466 INFO L273 TraceCheckUtils]: 30: Hoare triple {10017#(<= main_~i~1 8)} assume true; {10017#(<= main_~i~1 8)} is VALID [2018-11-14 18:56:50,466 INFO L273 TraceCheckUtils]: 31: Hoare triple {10017#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {10017#(<= main_~i~1 8)} is VALID [2018-11-14 18:56:50,467 INFO L273 TraceCheckUtils]: 32: Hoare triple {10017#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10018#(<= main_~i~1 9)} is VALID [2018-11-14 18:56:50,467 INFO L273 TraceCheckUtils]: 33: Hoare triple {10018#(<= main_~i~1 9)} assume true; {10018#(<= main_~i~1 9)} is VALID [2018-11-14 18:56:50,468 INFO L273 TraceCheckUtils]: 34: Hoare triple {10018#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {10018#(<= main_~i~1 9)} is VALID [2018-11-14 18:56:50,469 INFO L273 TraceCheckUtils]: 35: Hoare triple {10018#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10019#(<= main_~i~1 10)} is VALID [2018-11-14 18:56:50,469 INFO L273 TraceCheckUtils]: 36: Hoare triple {10019#(<= main_~i~1 10)} assume true; {10019#(<= main_~i~1 10)} is VALID [2018-11-14 18:56:50,470 INFO L273 TraceCheckUtils]: 37: Hoare triple {10019#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {10019#(<= main_~i~1 10)} is VALID [2018-11-14 18:56:50,470 INFO L273 TraceCheckUtils]: 38: Hoare triple {10019#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10020#(<= main_~i~1 11)} is VALID [2018-11-14 18:56:50,471 INFO L273 TraceCheckUtils]: 39: Hoare triple {10020#(<= main_~i~1 11)} assume true; {10020#(<= main_~i~1 11)} is VALID [2018-11-14 18:56:50,471 INFO L273 TraceCheckUtils]: 40: Hoare triple {10020#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {10020#(<= main_~i~1 11)} is VALID [2018-11-14 18:56:50,472 INFO L273 TraceCheckUtils]: 41: Hoare triple {10020#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10021#(<= main_~i~1 12)} is VALID [2018-11-14 18:56:50,473 INFO L273 TraceCheckUtils]: 42: Hoare triple {10021#(<= main_~i~1 12)} assume true; {10021#(<= main_~i~1 12)} is VALID [2018-11-14 18:56:50,473 INFO L273 TraceCheckUtils]: 43: Hoare triple {10021#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {10021#(<= main_~i~1 12)} is VALID [2018-11-14 18:56:50,474 INFO L273 TraceCheckUtils]: 44: Hoare triple {10021#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10022#(<= main_~i~1 13)} is VALID [2018-11-14 18:56:50,474 INFO L273 TraceCheckUtils]: 45: Hoare triple {10022#(<= main_~i~1 13)} assume true; {10022#(<= main_~i~1 13)} is VALID [2018-11-14 18:56:50,475 INFO L273 TraceCheckUtils]: 46: Hoare triple {10022#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {10022#(<= main_~i~1 13)} is VALID [2018-11-14 18:56:50,476 INFO L273 TraceCheckUtils]: 47: Hoare triple {10022#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10023#(<= main_~i~1 14)} is VALID [2018-11-14 18:56:50,476 INFO L273 TraceCheckUtils]: 48: Hoare triple {10023#(<= main_~i~1 14)} assume true; {10023#(<= main_~i~1 14)} is VALID [2018-11-14 18:56:50,477 INFO L273 TraceCheckUtils]: 49: Hoare triple {10023#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {10023#(<= main_~i~1 14)} is VALID [2018-11-14 18:56:50,477 INFO L273 TraceCheckUtils]: 50: Hoare triple {10023#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10024#(<= main_~i~1 15)} is VALID [2018-11-14 18:56:50,478 INFO L273 TraceCheckUtils]: 51: Hoare triple {10024#(<= main_~i~1 15)} assume true; {10024#(<= main_~i~1 15)} is VALID [2018-11-14 18:56:50,478 INFO L273 TraceCheckUtils]: 52: Hoare triple {10024#(<= main_~i~1 15)} assume !(~i~1 < 100000); {10008#false} is VALID [2018-11-14 18:56:50,479 INFO L256 TraceCheckUtils]: 53: Hoare triple {10008#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {10007#true} is VALID [2018-11-14 18:56:50,479 INFO L273 TraceCheckUtils]: 54: Hoare triple {10007#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10007#true} is VALID [2018-11-14 18:56:50,479 INFO L273 TraceCheckUtils]: 55: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:56:50,479 INFO L273 TraceCheckUtils]: 56: Hoare triple {10007#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 18:56:50,479 INFO L273 TraceCheckUtils]: 57: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 18:56:50,480 INFO L273 TraceCheckUtils]: 58: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:56:50,480 INFO L273 TraceCheckUtils]: 59: Hoare triple {10007#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 18:56:50,480 INFO L273 TraceCheckUtils]: 60: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 18:56:50,480 INFO L273 TraceCheckUtils]: 61: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:56:50,480 INFO L273 TraceCheckUtils]: 62: Hoare triple {10007#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 18:56:50,480 INFO L273 TraceCheckUtils]: 63: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 18:56:50,481 INFO L273 TraceCheckUtils]: 64: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:56:50,481 INFO L273 TraceCheckUtils]: 65: Hoare triple {10007#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 18:56:50,481 INFO L273 TraceCheckUtils]: 66: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 18:56:50,481 INFO L273 TraceCheckUtils]: 67: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:56:50,481 INFO L273 TraceCheckUtils]: 68: Hoare triple {10007#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 18:56:50,482 INFO L273 TraceCheckUtils]: 69: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 18:56:50,482 INFO L273 TraceCheckUtils]: 70: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:56:50,482 INFO L273 TraceCheckUtils]: 71: Hoare triple {10007#true} assume !(~i~0 < 100000); {10007#true} is VALID [2018-11-14 18:56:50,482 INFO L273 TraceCheckUtils]: 72: Hoare triple {10007#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10007#true} is VALID [2018-11-14 18:56:50,482 INFO L273 TraceCheckUtils]: 73: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:56:50,482 INFO L268 TraceCheckUtils]: 74: Hoare quadruple {10007#true} {10008#false} #73#return; {10008#false} is VALID [2018-11-14 18:56:50,482 INFO L273 TraceCheckUtils]: 75: Hoare triple {10008#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {10008#false} is VALID [2018-11-14 18:56:50,483 INFO L256 TraceCheckUtils]: 76: Hoare triple {10008#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {10007#true} is VALID [2018-11-14 18:56:50,483 INFO L273 TraceCheckUtils]: 77: Hoare triple {10007#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10007#true} is VALID [2018-11-14 18:56:50,483 INFO L273 TraceCheckUtils]: 78: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:56:50,483 INFO L273 TraceCheckUtils]: 79: Hoare triple {10007#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 18:56:50,483 INFO L273 TraceCheckUtils]: 80: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 18:56:50,483 INFO L273 TraceCheckUtils]: 81: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:56:50,483 INFO L273 TraceCheckUtils]: 82: Hoare triple {10007#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 18:56:50,483 INFO L273 TraceCheckUtils]: 83: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 18:56:50,483 INFO L273 TraceCheckUtils]: 84: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:56:50,484 INFO L273 TraceCheckUtils]: 85: Hoare triple {10007#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 18:56:50,484 INFO L273 TraceCheckUtils]: 86: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 18:56:50,484 INFO L273 TraceCheckUtils]: 87: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:56:50,484 INFO L273 TraceCheckUtils]: 88: Hoare triple {10007#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 18:56:50,484 INFO L273 TraceCheckUtils]: 89: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 18:56:50,484 INFO L273 TraceCheckUtils]: 90: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:56:50,484 INFO L273 TraceCheckUtils]: 91: Hoare triple {10007#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 18:56:50,484 INFO L273 TraceCheckUtils]: 92: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 18:56:50,484 INFO L273 TraceCheckUtils]: 93: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:56:50,485 INFO L273 TraceCheckUtils]: 94: Hoare triple {10007#true} assume !(~i~0 < 100000); {10007#true} is VALID [2018-11-14 18:56:50,485 INFO L273 TraceCheckUtils]: 95: Hoare triple {10007#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10007#true} is VALID [2018-11-14 18:56:50,485 INFO L273 TraceCheckUtils]: 96: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:56:50,485 INFO L268 TraceCheckUtils]: 97: Hoare quadruple {10007#true} {10008#false} #75#return; {10008#false} is VALID [2018-11-14 18:56:50,485 INFO L273 TraceCheckUtils]: 98: Hoare triple {10008#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {10008#false} is VALID [2018-11-14 18:56:50,485 INFO L273 TraceCheckUtils]: 99: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 18:56:50,485 INFO L273 TraceCheckUtils]: 100: Hoare triple {10008#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10008#false} is VALID [2018-11-14 18:56:50,485 INFO L273 TraceCheckUtils]: 101: Hoare triple {10008#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10008#false} is VALID [2018-11-14 18:56:50,485 INFO L273 TraceCheckUtils]: 102: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 18:56:50,486 INFO L273 TraceCheckUtils]: 103: Hoare triple {10008#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10008#false} is VALID [2018-11-14 18:56:50,486 INFO L273 TraceCheckUtils]: 104: Hoare triple {10008#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10008#false} is VALID [2018-11-14 18:56:50,486 INFO L273 TraceCheckUtils]: 105: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 18:56:50,486 INFO L273 TraceCheckUtils]: 106: Hoare triple {10008#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10008#false} is VALID [2018-11-14 18:56:50,486 INFO L273 TraceCheckUtils]: 107: Hoare triple {10008#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10008#false} is VALID [2018-11-14 18:56:50,486 INFO L273 TraceCheckUtils]: 108: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 18:56:50,486 INFO L273 TraceCheckUtils]: 109: Hoare triple {10008#false} assume !(~i~2 < 99999); {10008#false} is VALID [2018-11-14 18:56:50,486 INFO L273 TraceCheckUtils]: 110: Hoare triple {10008#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {10008#false} is VALID [2018-11-14 18:56:50,486 INFO L256 TraceCheckUtils]: 111: Hoare triple {10008#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {10007#true} is VALID [2018-11-14 18:56:50,487 INFO L273 TraceCheckUtils]: 112: Hoare triple {10007#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10007#true} is VALID [2018-11-14 18:56:50,487 INFO L273 TraceCheckUtils]: 113: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:56:50,487 INFO L273 TraceCheckUtils]: 114: Hoare triple {10007#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 18:56:50,487 INFO L273 TraceCheckUtils]: 115: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 18:56:50,487 INFO L273 TraceCheckUtils]: 116: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:56:50,487 INFO L273 TraceCheckUtils]: 117: Hoare triple {10007#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 18:56:50,487 INFO L273 TraceCheckUtils]: 118: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 18:56:50,487 INFO L273 TraceCheckUtils]: 119: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:56:50,487 INFO L273 TraceCheckUtils]: 120: Hoare triple {10007#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 18:56:50,488 INFO L273 TraceCheckUtils]: 121: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 18:56:50,488 INFO L273 TraceCheckUtils]: 122: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:56:50,488 INFO L273 TraceCheckUtils]: 123: Hoare triple {10007#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 18:56:50,488 INFO L273 TraceCheckUtils]: 124: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 18:56:50,488 INFO L273 TraceCheckUtils]: 125: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:56:50,488 INFO L273 TraceCheckUtils]: 126: Hoare triple {10007#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 18:56:50,488 INFO L273 TraceCheckUtils]: 127: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 18:56:50,488 INFO L273 TraceCheckUtils]: 128: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:56:50,489 INFO L273 TraceCheckUtils]: 129: Hoare triple {10007#true} assume !(~i~0 < 100000); {10007#true} is VALID [2018-11-14 18:56:50,489 INFO L273 TraceCheckUtils]: 130: Hoare triple {10007#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10007#true} is VALID [2018-11-14 18:56:50,489 INFO L273 TraceCheckUtils]: 131: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:56:50,489 INFO L268 TraceCheckUtils]: 132: Hoare quadruple {10007#true} {10008#false} #77#return; {10008#false} is VALID [2018-11-14 18:56:50,489 INFO L273 TraceCheckUtils]: 133: Hoare triple {10008#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {10008#false} is VALID [2018-11-14 18:56:50,489 INFO L273 TraceCheckUtils]: 134: Hoare triple {10008#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {10008#false} is VALID [2018-11-14 18:56:50,489 INFO L273 TraceCheckUtils]: 135: Hoare triple {10008#false} assume !false; {10008#false} is VALID [2018-11-14 18:56:50,497 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2018-11-14 18:56:50,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:56:50,498 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-14 18:56:50,507 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:56:50,549 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-14 18:56:50,549 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:56:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:56:50,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:56:50,747 INFO L256 TraceCheckUtils]: 0: Hoare triple {10007#true} call ULTIMATE.init(); {10007#true} is VALID [2018-11-14 18:56:50,747 INFO L273 TraceCheckUtils]: 1: Hoare triple {10007#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10007#true} is VALID [2018-11-14 18:56:50,748 INFO L273 TraceCheckUtils]: 2: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:56:50,748 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10007#true} {10007#true} #69#return; {10007#true} is VALID [2018-11-14 18:56:50,748 INFO L256 TraceCheckUtils]: 4: Hoare triple {10007#true} call #t~ret13 := main(); {10007#true} is VALID [2018-11-14 18:56:50,748 INFO L273 TraceCheckUtils]: 5: Hoare triple {10007#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; {10007#true} is VALID [2018-11-14 18:56:50,748 INFO L273 TraceCheckUtils]: 6: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:56:50,749 INFO L273 TraceCheckUtils]: 7: Hoare triple {10007#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 18:56:50,749 INFO L273 TraceCheckUtils]: 8: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 18:56:50,749 INFO L273 TraceCheckUtils]: 9: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:56:50,749 INFO L273 TraceCheckUtils]: 10: Hoare triple {10007#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 18:56:50,749 INFO L273 TraceCheckUtils]: 11: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 18:56:50,749 INFO L273 TraceCheckUtils]: 12: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:56:50,750 INFO L273 TraceCheckUtils]: 13: Hoare triple {10007#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 18:56:50,750 INFO L273 TraceCheckUtils]: 14: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 18:56:50,750 INFO L273 TraceCheckUtils]: 15: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:56:50,750 INFO L273 TraceCheckUtils]: 16: Hoare triple {10007#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 18:56:50,750 INFO L273 TraceCheckUtils]: 17: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 18:56:50,750 INFO L273 TraceCheckUtils]: 18: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:56:50,750 INFO L273 TraceCheckUtils]: 19: Hoare triple {10007#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 18:56:50,750 INFO L273 TraceCheckUtils]: 20: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 18:56:50,751 INFO L273 TraceCheckUtils]: 21: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:56:50,751 INFO L273 TraceCheckUtils]: 22: Hoare triple {10007#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 18:56:50,751 INFO L273 TraceCheckUtils]: 23: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 18:56:50,751 INFO L273 TraceCheckUtils]: 24: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:56:50,751 INFO L273 TraceCheckUtils]: 25: Hoare triple {10007#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 18:56:50,751 INFO L273 TraceCheckUtils]: 26: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 18:56:50,751 INFO L273 TraceCheckUtils]: 27: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:56:50,751 INFO L273 TraceCheckUtils]: 28: Hoare triple {10007#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 18:56:50,751 INFO L273 TraceCheckUtils]: 29: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 18:56:50,752 INFO L273 TraceCheckUtils]: 30: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:56:50,752 INFO L273 TraceCheckUtils]: 31: Hoare triple {10007#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 18:56:50,752 INFO L273 TraceCheckUtils]: 32: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 18:56:50,752 INFO L273 TraceCheckUtils]: 33: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:56:50,752 INFO L273 TraceCheckUtils]: 34: Hoare triple {10007#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 18:56:50,752 INFO L273 TraceCheckUtils]: 35: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 18:56:50,752 INFO L273 TraceCheckUtils]: 36: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:56:50,752 INFO L273 TraceCheckUtils]: 37: Hoare triple {10007#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 18:56:50,752 INFO L273 TraceCheckUtils]: 38: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 18:56:50,753 INFO L273 TraceCheckUtils]: 39: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:56:50,753 INFO L273 TraceCheckUtils]: 40: Hoare triple {10007#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 18:56:50,753 INFO L273 TraceCheckUtils]: 41: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 18:56:50,753 INFO L273 TraceCheckUtils]: 42: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:56:50,753 INFO L273 TraceCheckUtils]: 43: Hoare triple {10007#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 18:56:50,753 INFO L273 TraceCheckUtils]: 44: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 18:56:50,753 INFO L273 TraceCheckUtils]: 45: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:56:50,753 INFO L273 TraceCheckUtils]: 46: Hoare triple {10007#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 18:56:50,753 INFO L273 TraceCheckUtils]: 47: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 18:56:50,754 INFO L273 TraceCheckUtils]: 48: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:56:50,754 INFO L273 TraceCheckUtils]: 49: Hoare triple {10007#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 18:56:50,754 INFO L273 TraceCheckUtils]: 50: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 18:56:50,754 INFO L273 TraceCheckUtils]: 51: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:56:50,754 INFO L273 TraceCheckUtils]: 52: Hoare triple {10007#true} assume !(~i~1 < 100000); {10007#true} is VALID [2018-11-14 18:56:50,754 INFO L256 TraceCheckUtils]: 53: Hoare triple {10007#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {10007#true} is VALID [2018-11-14 18:56:50,754 INFO L273 TraceCheckUtils]: 54: Hoare triple {10007#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10007#true} is VALID [2018-11-14 18:56:50,754 INFO L273 TraceCheckUtils]: 55: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:56:50,755 INFO L273 TraceCheckUtils]: 56: Hoare triple {10007#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 18:56:50,755 INFO L273 TraceCheckUtils]: 57: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 18:56:50,755 INFO L273 TraceCheckUtils]: 58: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:56:50,755 INFO L273 TraceCheckUtils]: 59: Hoare triple {10007#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 18:56:50,755 INFO L273 TraceCheckUtils]: 60: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 18:56:50,755 INFO L273 TraceCheckUtils]: 61: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:56:50,755 INFO L273 TraceCheckUtils]: 62: Hoare triple {10007#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 18:56:50,755 INFO L273 TraceCheckUtils]: 63: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 18:56:50,755 INFO L273 TraceCheckUtils]: 64: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:56:50,755 INFO L273 TraceCheckUtils]: 65: Hoare triple {10007#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 18:56:50,756 INFO L273 TraceCheckUtils]: 66: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 18:56:50,756 INFO L273 TraceCheckUtils]: 67: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:56:50,756 INFO L273 TraceCheckUtils]: 68: Hoare triple {10007#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 18:56:50,756 INFO L273 TraceCheckUtils]: 69: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 18:56:50,756 INFO L273 TraceCheckUtils]: 70: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:56:50,756 INFO L273 TraceCheckUtils]: 71: Hoare triple {10007#true} assume !(~i~0 < 100000); {10007#true} is VALID [2018-11-14 18:56:50,756 INFO L273 TraceCheckUtils]: 72: Hoare triple {10007#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10007#true} is VALID [2018-11-14 18:56:50,756 INFO L273 TraceCheckUtils]: 73: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:56:50,757 INFO L268 TraceCheckUtils]: 74: Hoare quadruple {10007#true} {10007#true} #73#return; {10007#true} is VALID [2018-11-14 18:56:50,757 INFO L273 TraceCheckUtils]: 75: Hoare triple {10007#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {10007#true} is VALID [2018-11-14 18:56:50,757 INFO L256 TraceCheckUtils]: 76: Hoare triple {10007#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {10007#true} is VALID [2018-11-14 18:56:50,757 INFO L273 TraceCheckUtils]: 77: Hoare triple {10007#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10007#true} is VALID [2018-11-14 18:56:50,757 INFO L273 TraceCheckUtils]: 78: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:56:50,757 INFO L273 TraceCheckUtils]: 79: Hoare triple {10007#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 18:56:50,757 INFO L273 TraceCheckUtils]: 80: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 18:56:50,757 INFO L273 TraceCheckUtils]: 81: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:56:50,757 INFO L273 TraceCheckUtils]: 82: Hoare triple {10007#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 18:56:50,758 INFO L273 TraceCheckUtils]: 83: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 18:56:50,758 INFO L273 TraceCheckUtils]: 84: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:56:50,758 INFO L273 TraceCheckUtils]: 85: Hoare triple {10007#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 18:56:50,758 INFO L273 TraceCheckUtils]: 86: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 18:56:50,758 INFO L273 TraceCheckUtils]: 87: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:56:50,758 INFO L273 TraceCheckUtils]: 88: Hoare triple {10007#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 18:56:50,758 INFO L273 TraceCheckUtils]: 89: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 18:56:50,758 INFO L273 TraceCheckUtils]: 90: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:56:50,758 INFO L273 TraceCheckUtils]: 91: Hoare triple {10007#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 18:56:50,759 INFO L273 TraceCheckUtils]: 92: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 18:56:50,759 INFO L273 TraceCheckUtils]: 93: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:56:50,759 INFO L273 TraceCheckUtils]: 94: Hoare triple {10007#true} assume !(~i~0 < 100000); {10007#true} is VALID [2018-11-14 18:56:50,759 INFO L273 TraceCheckUtils]: 95: Hoare triple {10007#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10007#true} is VALID [2018-11-14 18:56:50,759 INFO L273 TraceCheckUtils]: 96: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 18:56:50,759 INFO L268 TraceCheckUtils]: 97: Hoare quadruple {10007#true} {10007#true} #75#return; {10007#true} is VALID [2018-11-14 18:56:50,760 INFO L273 TraceCheckUtils]: 98: Hoare triple {10007#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {10322#(<= main_~i~2 0)} is VALID [2018-11-14 18:56:50,760 INFO L273 TraceCheckUtils]: 99: Hoare triple {10322#(<= main_~i~2 0)} assume true; {10322#(<= main_~i~2 0)} is VALID [2018-11-14 18:56:50,760 INFO L273 TraceCheckUtils]: 100: Hoare triple {10322#(<= main_~i~2 0)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10322#(<= main_~i~2 0)} is VALID [2018-11-14 18:56:50,761 INFO L273 TraceCheckUtils]: 101: Hoare triple {10322#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10332#(<= main_~i~2 1)} is VALID [2018-11-14 18:56:50,761 INFO L273 TraceCheckUtils]: 102: Hoare triple {10332#(<= main_~i~2 1)} assume true; {10332#(<= main_~i~2 1)} is VALID [2018-11-14 18:56:50,762 INFO L273 TraceCheckUtils]: 103: Hoare triple {10332#(<= main_~i~2 1)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10332#(<= main_~i~2 1)} is VALID [2018-11-14 18:56:50,762 INFO L273 TraceCheckUtils]: 104: Hoare triple {10332#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10342#(<= main_~i~2 2)} is VALID [2018-11-14 18:56:50,763 INFO L273 TraceCheckUtils]: 105: Hoare triple {10342#(<= main_~i~2 2)} assume true; {10342#(<= main_~i~2 2)} is VALID [2018-11-14 18:56:50,763 INFO L273 TraceCheckUtils]: 106: Hoare triple {10342#(<= main_~i~2 2)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10342#(<= main_~i~2 2)} is VALID [2018-11-14 18:56:50,764 INFO L273 TraceCheckUtils]: 107: Hoare triple {10342#(<= main_~i~2 2)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10352#(<= main_~i~2 3)} is VALID [2018-11-14 18:56:50,765 INFO L273 TraceCheckUtils]: 108: Hoare triple {10352#(<= main_~i~2 3)} assume true; {10352#(<= main_~i~2 3)} is VALID [2018-11-14 18:56:50,765 INFO L273 TraceCheckUtils]: 109: Hoare triple {10352#(<= main_~i~2 3)} assume !(~i~2 < 99999); {10008#false} is VALID [2018-11-14 18:56:50,765 INFO L273 TraceCheckUtils]: 110: Hoare triple {10008#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {10008#false} is VALID [2018-11-14 18:56:50,766 INFO L256 TraceCheckUtils]: 111: Hoare triple {10008#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {10008#false} is VALID [2018-11-14 18:56:50,766 INFO L273 TraceCheckUtils]: 112: Hoare triple {10008#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10008#false} is VALID [2018-11-14 18:56:50,766 INFO L273 TraceCheckUtils]: 113: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 18:56:50,766 INFO L273 TraceCheckUtils]: 114: Hoare triple {10008#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10008#false} is VALID [2018-11-14 18:56:50,766 INFO L273 TraceCheckUtils]: 115: Hoare triple {10008#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10008#false} is VALID [2018-11-14 18:56:50,767 INFO L273 TraceCheckUtils]: 116: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 18:56:50,767 INFO L273 TraceCheckUtils]: 117: Hoare triple {10008#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10008#false} is VALID [2018-11-14 18:56:50,767 INFO L273 TraceCheckUtils]: 118: Hoare triple {10008#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10008#false} is VALID [2018-11-14 18:56:50,767 INFO L273 TraceCheckUtils]: 119: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 18:56:50,767 INFO L273 TraceCheckUtils]: 120: Hoare triple {10008#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10008#false} is VALID [2018-11-14 18:56:50,768 INFO L273 TraceCheckUtils]: 121: Hoare triple {10008#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10008#false} is VALID [2018-11-14 18:56:50,768 INFO L273 TraceCheckUtils]: 122: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 18:56:50,768 INFO L273 TraceCheckUtils]: 123: Hoare triple {10008#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10008#false} is VALID [2018-11-14 18:56:50,768 INFO L273 TraceCheckUtils]: 124: Hoare triple {10008#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10008#false} is VALID [2018-11-14 18:56:50,768 INFO L273 TraceCheckUtils]: 125: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 18:56:50,768 INFO L273 TraceCheckUtils]: 126: Hoare triple {10008#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10008#false} is VALID [2018-11-14 18:56:50,768 INFO L273 TraceCheckUtils]: 127: Hoare triple {10008#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10008#false} is VALID [2018-11-14 18:56:50,768 INFO L273 TraceCheckUtils]: 128: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 18:56:50,769 INFO L273 TraceCheckUtils]: 129: Hoare triple {10008#false} assume !(~i~0 < 100000); {10008#false} is VALID [2018-11-14 18:56:50,769 INFO L273 TraceCheckUtils]: 130: Hoare triple {10008#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10008#false} is VALID [2018-11-14 18:56:50,769 INFO L273 TraceCheckUtils]: 131: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 18:56:50,769 INFO L268 TraceCheckUtils]: 132: Hoare quadruple {10008#false} {10008#false} #77#return; {10008#false} is VALID [2018-11-14 18:56:50,769 INFO L273 TraceCheckUtils]: 133: Hoare triple {10008#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {10008#false} is VALID [2018-11-14 18:56:50,769 INFO L273 TraceCheckUtils]: 134: Hoare triple {10008#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {10008#false} is VALID [2018-11-14 18:56:50,769 INFO L273 TraceCheckUtils]: 135: Hoare triple {10008#false} assume !false; {10008#false} is VALID [2018-11-14 18:56:50,780 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 202 proven. 15 refuted. 0 times theorem prover too weak. 566 trivial. 0 not checked. [2018-11-14 18:56:50,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:56:50,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 6] total 22 [2018-11-14 18:56:50,801 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 136 [2018-11-14 18:56:50,802 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:56:50,802 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-14 18:56:50,904 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-14 18:56:50,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-14 18:56:50,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-14 18:56:50,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2018-11-14 18:56:50,905 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 22 states. [2018-11-14 18:56:51,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:51,359 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2018-11-14 18:56:51,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-14 18:56:51,359 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 136 [2018-11-14 18:56:51,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:56:51,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 18:56:51,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 118 transitions. [2018-11-14 18:56:51,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 18:56:51,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 118 transitions. [2018-11-14 18:56:51,362 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 118 transitions. [2018-11-14 18:56:51,517 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-14 18:56:51,519 INFO L225 Difference]: With dead ends: 145 [2018-11-14 18:56:51,520 INFO L226 Difference]: Without dead ends: 103 [2018-11-14 18:56:51,520 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2018-11-14 18:56:51,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-14 18:56:51,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2018-11-14 18:56:51,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:56:51,564 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand 101 states. [2018-11-14 18:56:51,564 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 101 states. [2018-11-14 18:56:51,564 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 101 states. [2018-11-14 18:56:51,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:51,566 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2018-11-14 18:56:51,566 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2018-11-14 18:56:51,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:56:51,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:56:51,567 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 103 states. [2018-11-14 18:56:51,567 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 103 states. [2018-11-14 18:56:51,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:51,569 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2018-11-14 18:56:51,569 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2018-11-14 18:56:51,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:56:51,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:56:51,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:56:51,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:56:51,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-14 18:56:51,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2018-11-14 18:56:51,572 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 136 [2018-11-14 18:56:51,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:56:51,573 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2018-11-14 18:56:51,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-14 18:56:51,573 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-11-14 18:56:51,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-14 18:56:51,574 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:56:51,574 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 16, 16, 15, 15, 5, 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-14 18:56:51,575 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:56:51,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:56:51,575 INFO L82 PathProgramCache]: Analyzing trace with hash -542134491, now seen corresponding path program 16 times [2018-11-14 18:56:51,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:56:51,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:56:51,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:56:51,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:56:51,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:56:51,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:56:52,217 INFO L256 TraceCheckUtils]: 0: Hoare triple {10974#true} call ULTIMATE.init(); {10974#true} is VALID [2018-11-14 18:56:52,217 INFO L273 TraceCheckUtils]: 1: Hoare triple {10974#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10974#true} is VALID [2018-11-14 18:56:52,217 INFO L273 TraceCheckUtils]: 2: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,217 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10974#true} {10974#true} #69#return; {10974#true} is VALID [2018-11-14 18:56:52,217 INFO L256 TraceCheckUtils]: 4: Hoare triple {10974#true} call #t~ret13 := main(); {10974#true} is VALID [2018-11-14 18:56:52,218 INFO L273 TraceCheckUtils]: 5: Hoare triple {10974#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; {10976#(= main_~i~1 0)} is VALID [2018-11-14 18:56:52,218 INFO L273 TraceCheckUtils]: 6: Hoare triple {10976#(= main_~i~1 0)} assume true; {10976#(= main_~i~1 0)} is VALID [2018-11-14 18:56:52,218 INFO L273 TraceCheckUtils]: 7: Hoare triple {10976#(= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {10976#(= main_~i~1 0)} is VALID [2018-11-14 18:56:52,219 INFO L273 TraceCheckUtils]: 8: Hoare triple {10976#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10977#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:52,219 INFO L273 TraceCheckUtils]: 9: Hoare triple {10977#(<= main_~i~1 1)} assume true; {10977#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:52,219 INFO L273 TraceCheckUtils]: 10: Hoare triple {10977#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {10977#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:52,220 INFO L273 TraceCheckUtils]: 11: Hoare triple {10977#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10978#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:52,220 INFO L273 TraceCheckUtils]: 12: Hoare triple {10978#(<= main_~i~1 2)} assume true; {10978#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:52,221 INFO L273 TraceCheckUtils]: 13: Hoare triple {10978#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {10978#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:52,221 INFO L273 TraceCheckUtils]: 14: Hoare triple {10978#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10979#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:52,221 INFO L273 TraceCheckUtils]: 15: Hoare triple {10979#(<= main_~i~1 3)} assume true; {10979#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:52,222 INFO L273 TraceCheckUtils]: 16: Hoare triple {10979#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {10979#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:52,222 INFO L273 TraceCheckUtils]: 17: Hoare triple {10979#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10980#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:52,223 INFO L273 TraceCheckUtils]: 18: Hoare triple {10980#(<= main_~i~1 4)} assume true; {10980#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:52,223 INFO L273 TraceCheckUtils]: 19: Hoare triple {10980#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {10980#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:52,224 INFO L273 TraceCheckUtils]: 20: Hoare triple {10980#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10981#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:52,225 INFO L273 TraceCheckUtils]: 21: Hoare triple {10981#(<= main_~i~1 5)} assume true; {10981#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:52,225 INFO L273 TraceCheckUtils]: 22: Hoare triple {10981#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {10981#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:52,226 INFO L273 TraceCheckUtils]: 23: Hoare triple {10981#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10982#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:52,226 INFO L273 TraceCheckUtils]: 24: Hoare triple {10982#(<= main_~i~1 6)} assume true; {10982#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:52,227 INFO L273 TraceCheckUtils]: 25: Hoare triple {10982#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {10982#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:52,227 INFO L273 TraceCheckUtils]: 26: Hoare triple {10982#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10983#(<= main_~i~1 7)} is VALID [2018-11-14 18:56:52,228 INFO L273 TraceCheckUtils]: 27: Hoare triple {10983#(<= main_~i~1 7)} assume true; {10983#(<= main_~i~1 7)} is VALID [2018-11-14 18:56:52,228 INFO L273 TraceCheckUtils]: 28: Hoare triple {10983#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {10983#(<= main_~i~1 7)} is VALID [2018-11-14 18:56:52,229 INFO L273 TraceCheckUtils]: 29: Hoare triple {10983#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10984#(<= main_~i~1 8)} is VALID [2018-11-14 18:56:52,230 INFO L273 TraceCheckUtils]: 30: Hoare triple {10984#(<= main_~i~1 8)} assume true; {10984#(<= main_~i~1 8)} is VALID [2018-11-14 18:56:52,230 INFO L273 TraceCheckUtils]: 31: Hoare triple {10984#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {10984#(<= main_~i~1 8)} is VALID [2018-11-14 18:56:52,231 INFO L273 TraceCheckUtils]: 32: Hoare triple {10984#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10985#(<= main_~i~1 9)} is VALID [2018-11-14 18:56:52,231 INFO L273 TraceCheckUtils]: 33: Hoare triple {10985#(<= main_~i~1 9)} assume true; {10985#(<= main_~i~1 9)} is VALID [2018-11-14 18:56:52,232 INFO L273 TraceCheckUtils]: 34: Hoare triple {10985#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {10985#(<= main_~i~1 9)} is VALID [2018-11-14 18:56:52,233 INFO L273 TraceCheckUtils]: 35: Hoare triple {10985#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10986#(<= main_~i~1 10)} is VALID [2018-11-14 18:56:52,233 INFO L273 TraceCheckUtils]: 36: Hoare triple {10986#(<= main_~i~1 10)} assume true; {10986#(<= main_~i~1 10)} is VALID [2018-11-14 18:56:52,234 INFO L273 TraceCheckUtils]: 37: Hoare triple {10986#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {10986#(<= main_~i~1 10)} is VALID [2018-11-14 18:56:52,234 INFO L273 TraceCheckUtils]: 38: Hoare triple {10986#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10987#(<= main_~i~1 11)} is VALID [2018-11-14 18:56:52,235 INFO L273 TraceCheckUtils]: 39: Hoare triple {10987#(<= main_~i~1 11)} assume true; {10987#(<= main_~i~1 11)} is VALID [2018-11-14 18:56:52,235 INFO L273 TraceCheckUtils]: 40: Hoare triple {10987#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {10987#(<= main_~i~1 11)} is VALID [2018-11-14 18:56:52,236 INFO L273 TraceCheckUtils]: 41: Hoare triple {10987#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10988#(<= main_~i~1 12)} is VALID [2018-11-14 18:56:52,236 INFO L273 TraceCheckUtils]: 42: Hoare triple {10988#(<= main_~i~1 12)} assume true; {10988#(<= main_~i~1 12)} is VALID [2018-11-14 18:56:52,237 INFO L273 TraceCheckUtils]: 43: Hoare triple {10988#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {10988#(<= main_~i~1 12)} is VALID [2018-11-14 18:56:52,238 INFO L273 TraceCheckUtils]: 44: Hoare triple {10988#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10989#(<= main_~i~1 13)} is VALID [2018-11-14 18:56:52,238 INFO L273 TraceCheckUtils]: 45: Hoare triple {10989#(<= main_~i~1 13)} assume true; {10989#(<= main_~i~1 13)} is VALID [2018-11-14 18:56:52,239 INFO L273 TraceCheckUtils]: 46: Hoare triple {10989#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {10989#(<= main_~i~1 13)} is VALID [2018-11-14 18:56:52,239 INFO L273 TraceCheckUtils]: 47: Hoare triple {10989#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10990#(<= main_~i~1 14)} is VALID [2018-11-14 18:56:52,240 INFO L273 TraceCheckUtils]: 48: Hoare triple {10990#(<= main_~i~1 14)} assume true; {10990#(<= main_~i~1 14)} is VALID [2018-11-14 18:56:52,240 INFO L273 TraceCheckUtils]: 49: Hoare triple {10990#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {10990#(<= main_~i~1 14)} is VALID [2018-11-14 18:56:52,241 INFO L273 TraceCheckUtils]: 50: Hoare triple {10990#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10991#(<= main_~i~1 15)} is VALID [2018-11-14 18:56:52,241 INFO L273 TraceCheckUtils]: 51: Hoare triple {10991#(<= main_~i~1 15)} assume true; {10991#(<= main_~i~1 15)} is VALID [2018-11-14 18:56:52,242 INFO L273 TraceCheckUtils]: 52: Hoare triple {10991#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {10991#(<= main_~i~1 15)} is VALID [2018-11-14 18:56:52,243 INFO L273 TraceCheckUtils]: 53: Hoare triple {10991#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10992#(<= main_~i~1 16)} is VALID [2018-11-14 18:56:52,243 INFO L273 TraceCheckUtils]: 54: Hoare triple {10992#(<= main_~i~1 16)} assume true; {10992#(<= main_~i~1 16)} is VALID [2018-11-14 18:56:52,244 INFO L273 TraceCheckUtils]: 55: Hoare triple {10992#(<= main_~i~1 16)} assume !(~i~1 < 100000); {10975#false} is VALID [2018-11-14 18:56:52,244 INFO L256 TraceCheckUtils]: 56: Hoare triple {10975#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {10974#true} is VALID [2018-11-14 18:56:52,244 INFO L273 TraceCheckUtils]: 57: Hoare triple {10974#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10974#true} is VALID [2018-11-14 18:56:52,245 INFO L273 TraceCheckUtils]: 58: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,245 INFO L273 TraceCheckUtils]: 59: Hoare triple {10974#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 18:56:52,245 INFO L273 TraceCheckUtils]: 60: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 18:56:52,245 INFO L273 TraceCheckUtils]: 61: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,245 INFO L273 TraceCheckUtils]: 62: Hoare triple {10974#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 18:56:52,246 INFO L273 TraceCheckUtils]: 63: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 18:56:52,246 INFO L273 TraceCheckUtils]: 64: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,246 INFO L273 TraceCheckUtils]: 65: Hoare triple {10974#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 18:56:52,246 INFO L273 TraceCheckUtils]: 66: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 18:56:52,246 INFO L273 TraceCheckUtils]: 67: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,247 INFO L273 TraceCheckUtils]: 68: Hoare triple {10974#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 18:56:52,247 INFO L273 TraceCheckUtils]: 69: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 18:56:52,247 INFO L273 TraceCheckUtils]: 70: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,247 INFO L273 TraceCheckUtils]: 71: Hoare triple {10974#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 18:56:52,247 INFO L273 TraceCheckUtils]: 72: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 18:56:52,247 INFO L273 TraceCheckUtils]: 73: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,247 INFO L273 TraceCheckUtils]: 74: Hoare triple {10974#true} assume !(~i~0 < 100000); {10974#true} is VALID [2018-11-14 18:56:52,247 INFO L273 TraceCheckUtils]: 75: Hoare triple {10974#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10974#true} is VALID [2018-11-14 18:56:52,247 INFO L273 TraceCheckUtils]: 76: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,248 INFO L268 TraceCheckUtils]: 77: Hoare quadruple {10974#true} {10975#false} #73#return; {10975#false} is VALID [2018-11-14 18:56:52,248 INFO L273 TraceCheckUtils]: 78: Hoare triple {10975#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {10975#false} is VALID [2018-11-14 18:56:52,248 INFO L256 TraceCheckUtils]: 79: Hoare triple {10975#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {10974#true} is VALID [2018-11-14 18:56:52,248 INFO L273 TraceCheckUtils]: 80: Hoare triple {10974#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10974#true} is VALID [2018-11-14 18:56:52,248 INFO L273 TraceCheckUtils]: 81: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,248 INFO L273 TraceCheckUtils]: 82: Hoare triple {10974#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 18:56:52,248 INFO L273 TraceCheckUtils]: 83: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 18:56:52,248 INFO L273 TraceCheckUtils]: 84: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,248 INFO L273 TraceCheckUtils]: 85: Hoare triple {10974#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 18:56:52,249 INFO L273 TraceCheckUtils]: 86: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 18:56:52,249 INFO L273 TraceCheckUtils]: 87: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,249 INFO L273 TraceCheckUtils]: 88: Hoare triple {10974#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 18:56:52,249 INFO L273 TraceCheckUtils]: 89: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 18:56:52,249 INFO L273 TraceCheckUtils]: 90: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,249 INFO L273 TraceCheckUtils]: 91: Hoare triple {10974#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 18:56:52,249 INFO L273 TraceCheckUtils]: 92: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 18:56:52,249 INFO L273 TraceCheckUtils]: 93: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,249 INFO L273 TraceCheckUtils]: 94: Hoare triple {10974#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 18:56:52,250 INFO L273 TraceCheckUtils]: 95: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 18:56:52,250 INFO L273 TraceCheckUtils]: 96: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,250 INFO L273 TraceCheckUtils]: 97: Hoare triple {10974#true} assume !(~i~0 < 100000); {10974#true} is VALID [2018-11-14 18:56:52,250 INFO L273 TraceCheckUtils]: 98: Hoare triple {10974#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10974#true} is VALID [2018-11-14 18:56:52,250 INFO L273 TraceCheckUtils]: 99: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,250 INFO L268 TraceCheckUtils]: 100: Hoare quadruple {10974#true} {10975#false} #75#return; {10975#false} is VALID [2018-11-14 18:56:52,250 INFO L273 TraceCheckUtils]: 101: Hoare triple {10975#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {10975#false} is VALID [2018-11-14 18:56:52,250 INFO L273 TraceCheckUtils]: 102: Hoare triple {10975#false} assume true; {10975#false} is VALID [2018-11-14 18:56:52,250 INFO L273 TraceCheckUtils]: 103: Hoare triple {10975#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10975#false} is VALID [2018-11-14 18:56:52,251 INFO L273 TraceCheckUtils]: 104: Hoare triple {10975#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10975#false} is VALID [2018-11-14 18:56:52,251 INFO L273 TraceCheckUtils]: 105: Hoare triple {10975#false} assume true; {10975#false} is VALID [2018-11-14 18:56:52,251 INFO L273 TraceCheckUtils]: 106: Hoare triple {10975#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10975#false} is VALID [2018-11-14 18:56:52,251 INFO L273 TraceCheckUtils]: 107: Hoare triple {10975#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10975#false} is VALID [2018-11-14 18:56:52,251 INFO L273 TraceCheckUtils]: 108: Hoare triple {10975#false} assume true; {10975#false} is VALID [2018-11-14 18:56:52,251 INFO L273 TraceCheckUtils]: 109: Hoare triple {10975#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10975#false} is VALID [2018-11-14 18:56:52,251 INFO L273 TraceCheckUtils]: 110: Hoare triple {10975#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10975#false} is VALID [2018-11-14 18:56:52,251 INFO L273 TraceCheckUtils]: 111: Hoare triple {10975#false} assume true; {10975#false} is VALID [2018-11-14 18:56:52,251 INFO L273 TraceCheckUtils]: 112: Hoare triple {10975#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10975#false} is VALID [2018-11-14 18:56:52,252 INFO L273 TraceCheckUtils]: 113: Hoare triple {10975#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10975#false} is VALID [2018-11-14 18:56:52,252 INFO L273 TraceCheckUtils]: 114: Hoare triple {10975#false} assume true; {10975#false} is VALID [2018-11-14 18:56:52,252 INFO L273 TraceCheckUtils]: 115: Hoare triple {10975#false} assume !(~i~2 < 99999); {10975#false} is VALID [2018-11-14 18:56:52,252 INFO L273 TraceCheckUtils]: 116: Hoare triple {10975#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {10975#false} is VALID [2018-11-14 18:56:52,252 INFO L256 TraceCheckUtils]: 117: Hoare triple {10975#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {10974#true} is VALID [2018-11-14 18:56:52,252 INFO L273 TraceCheckUtils]: 118: Hoare triple {10974#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10974#true} is VALID [2018-11-14 18:56:52,252 INFO L273 TraceCheckUtils]: 119: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,252 INFO L273 TraceCheckUtils]: 120: Hoare triple {10974#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 18:56:52,252 INFO L273 TraceCheckUtils]: 121: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 18:56:52,253 INFO L273 TraceCheckUtils]: 122: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,253 INFO L273 TraceCheckUtils]: 123: Hoare triple {10974#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 18:56:52,253 INFO L273 TraceCheckUtils]: 124: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 18:56:52,253 INFO L273 TraceCheckUtils]: 125: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,253 INFO L273 TraceCheckUtils]: 126: Hoare triple {10974#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 18:56:52,253 INFO L273 TraceCheckUtils]: 127: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 18:56:52,253 INFO L273 TraceCheckUtils]: 128: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,253 INFO L273 TraceCheckUtils]: 129: Hoare triple {10974#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 18:56:52,253 INFO L273 TraceCheckUtils]: 130: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 18:56:52,254 INFO L273 TraceCheckUtils]: 131: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,254 INFO L273 TraceCheckUtils]: 132: Hoare triple {10974#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 18:56:52,254 INFO L273 TraceCheckUtils]: 133: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 18:56:52,254 INFO L273 TraceCheckUtils]: 134: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,254 INFO L273 TraceCheckUtils]: 135: Hoare triple {10974#true} assume !(~i~0 < 100000); {10974#true} is VALID [2018-11-14 18:56:52,254 INFO L273 TraceCheckUtils]: 136: Hoare triple {10974#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10974#true} is VALID [2018-11-14 18:56:52,254 INFO L273 TraceCheckUtils]: 137: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,254 INFO L268 TraceCheckUtils]: 138: Hoare quadruple {10974#true} {10975#false} #77#return; {10975#false} is VALID [2018-11-14 18:56:52,254 INFO L273 TraceCheckUtils]: 139: Hoare triple {10975#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {10975#false} is VALID [2018-11-14 18:56:52,255 INFO L273 TraceCheckUtils]: 140: Hoare triple {10975#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {10975#false} is VALID [2018-11-14 18:56:52,255 INFO L273 TraceCheckUtils]: 141: Hoare triple {10975#false} assume !false; {10975#false} is VALID [2018-11-14 18:56:52,264 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 449 trivial. 0 not checked. [2018-11-14 18:56:52,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:56:52,264 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-14 18:56:52,274 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:56:52,324 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:56:52,325 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:56:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:56:52,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:56:52,641 INFO L256 TraceCheckUtils]: 0: Hoare triple {10974#true} call ULTIMATE.init(); {10974#true} is VALID [2018-11-14 18:56:52,641 INFO L273 TraceCheckUtils]: 1: Hoare triple {10974#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10974#true} is VALID [2018-11-14 18:56:52,641 INFO L273 TraceCheckUtils]: 2: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,642 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10974#true} {10974#true} #69#return; {10974#true} is VALID [2018-11-14 18:56:52,642 INFO L256 TraceCheckUtils]: 4: Hoare triple {10974#true} call #t~ret13 := main(); {10974#true} is VALID [2018-11-14 18:56:52,642 INFO L273 TraceCheckUtils]: 5: Hoare triple {10974#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; {10974#true} is VALID [2018-11-14 18:56:52,642 INFO L273 TraceCheckUtils]: 6: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,642 INFO L273 TraceCheckUtils]: 7: Hoare triple {10974#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 18:56:52,642 INFO L273 TraceCheckUtils]: 8: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 18:56:52,643 INFO L273 TraceCheckUtils]: 9: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,643 INFO L273 TraceCheckUtils]: 10: Hoare triple {10974#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 18:56:52,643 INFO L273 TraceCheckUtils]: 11: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 18:56:52,643 INFO L273 TraceCheckUtils]: 12: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,643 INFO L273 TraceCheckUtils]: 13: Hoare triple {10974#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 18:56:52,643 INFO L273 TraceCheckUtils]: 14: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 18:56:52,643 INFO L273 TraceCheckUtils]: 15: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,643 INFO L273 TraceCheckUtils]: 16: Hoare triple {10974#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 18:56:52,643 INFO L273 TraceCheckUtils]: 17: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 18:56:52,644 INFO L273 TraceCheckUtils]: 18: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,644 INFO L273 TraceCheckUtils]: 19: Hoare triple {10974#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 18:56:52,644 INFO L273 TraceCheckUtils]: 20: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 18:56:52,644 INFO L273 TraceCheckUtils]: 21: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,644 INFO L273 TraceCheckUtils]: 22: Hoare triple {10974#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 18:56:52,644 INFO L273 TraceCheckUtils]: 23: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 18:56:52,644 INFO L273 TraceCheckUtils]: 24: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,644 INFO L273 TraceCheckUtils]: 25: Hoare triple {10974#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 18:56:52,644 INFO L273 TraceCheckUtils]: 26: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 18:56:52,645 INFO L273 TraceCheckUtils]: 27: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,645 INFO L273 TraceCheckUtils]: 28: Hoare triple {10974#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 18:56:52,645 INFO L273 TraceCheckUtils]: 29: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 18:56:52,645 INFO L273 TraceCheckUtils]: 30: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,645 INFO L273 TraceCheckUtils]: 31: Hoare triple {10974#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 18:56:52,645 INFO L273 TraceCheckUtils]: 32: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 18:56:52,645 INFO L273 TraceCheckUtils]: 33: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,645 INFO L273 TraceCheckUtils]: 34: Hoare triple {10974#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 18:56:52,645 INFO L273 TraceCheckUtils]: 35: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 18:56:52,646 INFO L273 TraceCheckUtils]: 36: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,646 INFO L273 TraceCheckUtils]: 37: Hoare triple {10974#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 18:56:52,646 INFO L273 TraceCheckUtils]: 38: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 18:56:52,646 INFO L273 TraceCheckUtils]: 39: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,646 INFO L273 TraceCheckUtils]: 40: Hoare triple {10974#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 18:56:52,646 INFO L273 TraceCheckUtils]: 41: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 18:56:52,646 INFO L273 TraceCheckUtils]: 42: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,646 INFO L273 TraceCheckUtils]: 43: Hoare triple {10974#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 18:56:52,646 INFO L273 TraceCheckUtils]: 44: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 18:56:52,647 INFO L273 TraceCheckUtils]: 45: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,647 INFO L273 TraceCheckUtils]: 46: Hoare triple {10974#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 18:56:52,647 INFO L273 TraceCheckUtils]: 47: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 18:56:52,647 INFO L273 TraceCheckUtils]: 48: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,647 INFO L273 TraceCheckUtils]: 49: Hoare triple {10974#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 18:56:52,647 INFO L273 TraceCheckUtils]: 50: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 18:56:52,647 INFO L273 TraceCheckUtils]: 51: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,647 INFO L273 TraceCheckUtils]: 52: Hoare triple {10974#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 18:56:52,647 INFO L273 TraceCheckUtils]: 53: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 18:56:52,648 INFO L273 TraceCheckUtils]: 54: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,648 INFO L273 TraceCheckUtils]: 55: Hoare triple {10974#true} assume !(~i~1 < 100000); {10974#true} is VALID [2018-11-14 18:56:52,648 INFO L256 TraceCheckUtils]: 56: Hoare triple {10974#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {10974#true} is VALID [2018-11-14 18:56:52,648 INFO L273 TraceCheckUtils]: 57: Hoare triple {10974#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10974#true} is VALID [2018-11-14 18:56:52,648 INFO L273 TraceCheckUtils]: 58: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,648 INFO L273 TraceCheckUtils]: 59: Hoare triple {10974#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 18:56:52,648 INFO L273 TraceCheckUtils]: 60: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 18:56:52,648 INFO L273 TraceCheckUtils]: 61: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,648 INFO L273 TraceCheckUtils]: 62: Hoare triple {10974#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 18:56:52,649 INFO L273 TraceCheckUtils]: 63: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 18:56:52,649 INFO L273 TraceCheckUtils]: 64: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,649 INFO L273 TraceCheckUtils]: 65: Hoare triple {10974#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 18:56:52,649 INFO L273 TraceCheckUtils]: 66: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 18:56:52,649 INFO L273 TraceCheckUtils]: 67: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,649 INFO L273 TraceCheckUtils]: 68: Hoare triple {10974#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 18:56:52,649 INFO L273 TraceCheckUtils]: 69: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 18:56:52,649 INFO L273 TraceCheckUtils]: 70: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,649 INFO L273 TraceCheckUtils]: 71: Hoare triple {10974#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 18:56:52,650 INFO L273 TraceCheckUtils]: 72: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 18:56:52,650 INFO L273 TraceCheckUtils]: 73: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,650 INFO L273 TraceCheckUtils]: 74: Hoare triple {10974#true} assume !(~i~0 < 100000); {10974#true} is VALID [2018-11-14 18:56:52,650 INFO L273 TraceCheckUtils]: 75: Hoare triple {10974#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10974#true} is VALID [2018-11-14 18:56:52,650 INFO L273 TraceCheckUtils]: 76: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,650 INFO L268 TraceCheckUtils]: 77: Hoare quadruple {10974#true} {10974#true} #73#return; {10974#true} is VALID [2018-11-14 18:56:52,650 INFO L273 TraceCheckUtils]: 78: Hoare triple {10974#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {10974#true} is VALID [2018-11-14 18:56:52,650 INFO L256 TraceCheckUtils]: 79: Hoare triple {10974#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {10974#true} is VALID [2018-11-14 18:56:52,650 INFO L273 TraceCheckUtils]: 80: Hoare triple {10974#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10974#true} is VALID [2018-11-14 18:56:52,651 INFO L273 TraceCheckUtils]: 81: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,651 INFO L273 TraceCheckUtils]: 82: Hoare triple {10974#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 18:56:52,651 INFO L273 TraceCheckUtils]: 83: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 18:56:52,651 INFO L273 TraceCheckUtils]: 84: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,651 INFO L273 TraceCheckUtils]: 85: Hoare triple {10974#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 18:56:52,651 INFO L273 TraceCheckUtils]: 86: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 18:56:52,651 INFO L273 TraceCheckUtils]: 87: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,651 INFO L273 TraceCheckUtils]: 88: Hoare triple {10974#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 18:56:52,651 INFO L273 TraceCheckUtils]: 89: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 18:56:52,652 INFO L273 TraceCheckUtils]: 90: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,652 INFO L273 TraceCheckUtils]: 91: Hoare triple {10974#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 18:56:52,652 INFO L273 TraceCheckUtils]: 92: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 18:56:52,652 INFO L273 TraceCheckUtils]: 93: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,652 INFO L273 TraceCheckUtils]: 94: Hoare triple {10974#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 18:56:52,652 INFO L273 TraceCheckUtils]: 95: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 18:56:52,652 INFO L273 TraceCheckUtils]: 96: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,653 INFO L273 TraceCheckUtils]: 97: Hoare triple {10974#true} assume !(~i~0 < 100000); {10974#true} is VALID [2018-11-14 18:56:52,653 INFO L273 TraceCheckUtils]: 98: Hoare triple {10974#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10974#true} is VALID [2018-11-14 18:56:52,653 INFO L273 TraceCheckUtils]: 99: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,653 INFO L268 TraceCheckUtils]: 100: Hoare quadruple {10974#true} {10974#true} #75#return; {10974#true} is VALID [2018-11-14 18:56:52,653 INFO L273 TraceCheckUtils]: 101: Hoare triple {10974#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {10974#true} is VALID [2018-11-14 18:56:52,653 INFO L273 TraceCheckUtils]: 102: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,654 INFO L273 TraceCheckUtils]: 103: Hoare triple {10974#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10974#true} is VALID [2018-11-14 18:56:52,654 INFO L273 TraceCheckUtils]: 104: Hoare triple {10974#true} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10974#true} is VALID [2018-11-14 18:56:52,654 INFO L273 TraceCheckUtils]: 105: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,654 INFO L273 TraceCheckUtils]: 106: Hoare triple {10974#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10974#true} is VALID [2018-11-14 18:56:52,654 INFO L273 TraceCheckUtils]: 107: Hoare triple {10974#true} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10974#true} is VALID [2018-11-14 18:56:52,654 INFO L273 TraceCheckUtils]: 108: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,655 INFO L273 TraceCheckUtils]: 109: Hoare triple {10974#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10974#true} is VALID [2018-11-14 18:56:52,655 INFO L273 TraceCheckUtils]: 110: Hoare triple {10974#true} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10974#true} is VALID [2018-11-14 18:56:52,655 INFO L273 TraceCheckUtils]: 111: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,655 INFO L273 TraceCheckUtils]: 112: Hoare triple {10974#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10974#true} is VALID [2018-11-14 18:56:52,655 INFO L273 TraceCheckUtils]: 113: Hoare triple {10974#true} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10974#true} is VALID [2018-11-14 18:56:52,655 INFO L273 TraceCheckUtils]: 114: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 18:56:52,656 INFO L273 TraceCheckUtils]: 115: Hoare triple {10974#true} assume !(~i~2 < 99999); {10974#true} is VALID [2018-11-14 18:56:52,656 INFO L273 TraceCheckUtils]: 116: Hoare triple {10974#true} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {10974#true} is VALID [2018-11-14 18:56:52,656 INFO L256 TraceCheckUtils]: 117: Hoare triple {10974#true} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {10974#true} is VALID [2018-11-14 18:56:52,670 INFO L273 TraceCheckUtils]: 118: Hoare triple {10974#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {11350#(<= xor_~i~0 1)} is VALID [2018-11-14 18:56:52,683 INFO L273 TraceCheckUtils]: 119: Hoare triple {11350#(<= xor_~i~0 1)} assume true; {11350#(<= xor_~i~0 1)} is VALID [2018-11-14 18:56:52,692 INFO L273 TraceCheckUtils]: 120: Hoare triple {11350#(<= xor_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11350#(<= xor_~i~0 1)} is VALID [2018-11-14 18:56:52,705 INFO L273 TraceCheckUtils]: 121: Hoare triple {11350#(<= xor_~i~0 1)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11360#(<= xor_~i~0 2)} is VALID [2018-11-14 18:56:52,714 INFO L273 TraceCheckUtils]: 122: Hoare triple {11360#(<= xor_~i~0 2)} assume true; {11360#(<= xor_~i~0 2)} is VALID [2018-11-14 18:56:52,728 INFO L273 TraceCheckUtils]: 123: Hoare triple {11360#(<= xor_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11360#(<= xor_~i~0 2)} is VALID [2018-11-14 18:56:52,737 INFO L273 TraceCheckUtils]: 124: Hoare triple {11360#(<= xor_~i~0 2)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11370#(<= xor_~i~0 3)} is VALID [2018-11-14 18:56:52,749 INFO L273 TraceCheckUtils]: 125: Hoare triple {11370#(<= xor_~i~0 3)} assume true; {11370#(<= xor_~i~0 3)} is VALID [2018-11-14 18:56:52,765 INFO L273 TraceCheckUtils]: 126: Hoare triple {11370#(<= xor_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11370#(<= xor_~i~0 3)} is VALID [2018-11-14 18:56:52,774 INFO L273 TraceCheckUtils]: 127: Hoare triple {11370#(<= xor_~i~0 3)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11380#(<= xor_~i~0 4)} is VALID [2018-11-14 18:56:52,792 INFO L273 TraceCheckUtils]: 128: Hoare triple {11380#(<= xor_~i~0 4)} assume true; {11380#(<= xor_~i~0 4)} is VALID [2018-11-14 18:56:52,800 INFO L273 TraceCheckUtils]: 129: Hoare triple {11380#(<= xor_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11380#(<= xor_~i~0 4)} is VALID [2018-11-14 18:56:52,814 INFO L273 TraceCheckUtils]: 130: Hoare triple {11380#(<= xor_~i~0 4)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11390#(<= xor_~i~0 5)} is VALID [2018-11-14 18:56:52,823 INFO L273 TraceCheckUtils]: 131: Hoare triple {11390#(<= xor_~i~0 5)} assume true; {11390#(<= xor_~i~0 5)} is VALID [2018-11-14 18:56:52,836 INFO L273 TraceCheckUtils]: 132: Hoare triple {11390#(<= xor_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11390#(<= xor_~i~0 5)} is VALID [2018-11-14 18:56:52,850 INFO L273 TraceCheckUtils]: 133: Hoare triple {11390#(<= xor_~i~0 5)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11400#(<= xor_~i~0 6)} is VALID [2018-11-14 18:56:52,859 INFO L273 TraceCheckUtils]: 134: Hoare triple {11400#(<= xor_~i~0 6)} assume true; {11400#(<= xor_~i~0 6)} is VALID [2018-11-14 18:56:52,871 INFO L273 TraceCheckUtils]: 135: Hoare triple {11400#(<= xor_~i~0 6)} assume !(~i~0 < 100000); {10975#false} is VALID [2018-11-14 18:56:52,872 INFO L273 TraceCheckUtils]: 136: Hoare triple {10975#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10975#false} is VALID [2018-11-14 18:56:52,872 INFO L273 TraceCheckUtils]: 137: Hoare triple {10975#false} assume true; {10975#false} is VALID [2018-11-14 18:56:52,872 INFO L268 TraceCheckUtils]: 138: Hoare quadruple {10975#false} {10974#true} #77#return; {10975#false} is VALID [2018-11-14 18:56:52,872 INFO L273 TraceCheckUtils]: 139: Hoare triple {10975#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {10975#false} is VALID [2018-11-14 18:56:52,872 INFO L273 TraceCheckUtils]: 140: Hoare triple {10975#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {10975#false} is VALID [2018-11-14 18:56:52,872 INFO L273 TraceCheckUtils]: 141: Hoare triple {10975#false} assume !false; {10975#false} is VALID [2018-11-14 18:56:52,883 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 200 proven. 40 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2018-11-14 18:56:52,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:56:52,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 8] total 25 [2018-11-14 18:56:52,906 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 142 [2018-11-14 18:56:52,906 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:56:52,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-14 18:56:53,011 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-14 18:56:53,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-14 18:56:53,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-14 18:56:53,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=402, Unknown=0, NotChecked=0, Total=600 [2018-11-14 18:56:53,012 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand 25 states. [2018-11-14 18:56:54,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:54,240 INFO L93 Difference]: Finished difference Result 154 states and 166 transitions. [2018-11-14 18:56:54,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-14 18:56:54,240 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 142 [2018-11-14 18:56:54,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:56:54,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 18:56:54,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 130 transitions. [2018-11-14 18:56:54,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 18:56:54,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 130 transitions. [2018-11-14 18:56:54,243 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 130 transitions. [2018-11-14 18:56:54,421 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-14 18:56:54,424 INFO L225 Difference]: With dead ends: 154 [2018-11-14 18:56:54,424 INFO L226 Difference]: Without dead ends: 109 [2018-11-14 18:56:54,424 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=198, Invalid=402, Unknown=0, NotChecked=0, Total=600 [2018-11-14 18:56:54,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-14 18:56:54,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2018-11-14 18:56:54,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:56:54,451 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand 107 states. [2018-11-14 18:56:54,451 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 107 states. [2018-11-14 18:56:54,451 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 107 states. [2018-11-14 18:56:54,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:54,453 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2018-11-14 18:56:54,453 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2018-11-14 18:56:54,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:56:54,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:56:54,454 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 109 states. [2018-11-14 18:56:54,454 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 109 states. [2018-11-14 18:56:54,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:54,456 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2018-11-14 18:56:54,457 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2018-11-14 18:56:54,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:56:54,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:56:54,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:56:54,457 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:56:54,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-14 18:56:54,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2018-11-14 18:56:54,460 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 142 [2018-11-14 18:56:54,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:56:54,460 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2018-11-14 18:56:54,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-14 18:56:54,460 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2018-11-14 18:56:54,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-14 18:56:54,461 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:56:54,461 INFO L375 BasicCegarLoop]: trace histogram [21, 18, 18, 18, 17, 17, 5, 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-14 18:56:54,462 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:56:54,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:56:54,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1209501706, now seen corresponding path program 17 times [2018-11-14 18:56:54,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:56:54,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:56:54,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:56:54,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:56:54,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:56:54,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:56:55,035 INFO L256 TraceCheckUtils]: 0: Hoare triple {11994#true} call ULTIMATE.init(); {11994#true} is VALID [2018-11-14 18:56:55,035 INFO L273 TraceCheckUtils]: 1: Hoare triple {11994#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11994#true} is VALID [2018-11-14 18:56:55,035 INFO L273 TraceCheckUtils]: 2: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:56:55,036 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11994#true} {11994#true} #69#return; {11994#true} is VALID [2018-11-14 18:56:55,036 INFO L256 TraceCheckUtils]: 4: Hoare triple {11994#true} call #t~ret13 := main(); {11994#true} is VALID [2018-11-14 18:56:55,036 INFO L273 TraceCheckUtils]: 5: Hoare triple {11994#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; {11996#(= main_~i~1 0)} is VALID [2018-11-14 18:56:55,036 INFO L273 TraceCheckUtils]: 6: Hoare triple {11996#(= main_~i~1 0)} assume true; {11996#(= main_~i~1 0)} is VALID [2018-11-14 18:56:55,037 INFO L273 TraceCheckUtils]: 7: Hoare triple {11996#(= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {11996#(= main_~i~1 0)} is VALID [2018-11-14 18:56:55,037 INFO L273 TraceCheckUtils]: 8: Hoare triple {11996#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11997#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:55,037 INFO L273 TraceCheckUtils]: 9: Hoare triple {11997#(<= main_~i~1 1)} assume true; {11997#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:55,038 INFO L273 TraceCheckUtils]: 10: Hoare triple {11997#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {11997#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:55,038 INFO L273 TraceCheckUtils]: 11: Hoare triple {11997#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11998#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:55,038 INFO L273 TraceCheckUtils]: 12: Hoare triple {11998#(<= main_~i~1 2)} assume true; {11998#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:55,039 INFO L273 TraceCheckUtils]: 13: Hoare triple {11998#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {11998#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:55,039 INFO L273 TraceCheckUtils]: 14: Hoare triple {11998#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11999#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:55,040 INFO L273 TraceCheckUtils]: 15: Hoare triple {11999#(<= main_~i~1 3)} assume true; {11999#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:55,040 INFO L273 TraceCheckUtils]: 16: Hoare triple {11999#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {11999#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:55,041 INFO L273 TraceCheckUtils]: 17: Hoare triple {11999#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12000#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:55,042 INFO L273 TraceCheckUtils]: 18: Hoare triple {12000#(<= main_~i~1 4)} assume true; {12000#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:55,042 INFO L273 TraceCheckUtils]: 19: Hoare triple {12000#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {12000#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:55,043 INFO L273 TraceCheckUtils]: 20: Hoare triple {12000#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12001#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:55,043 INFO L273 TraceCheckUtils]: 21: Hoare triple {12001#(<= main_~i~1 5)} assume true; {12001#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:55,044 INFO L273 TraceCheckUtils]: 22: Hoare triple {12001#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {12001#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:55,044 INFO L273 TraceCheckUtils]: 23: Hoare triple {12001#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12002#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:55,045 INFO L273 TraceCheckUtils]: 24: Hoare triple {12002#(<= main_~i~1 6)} assume true; {12002#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:55,045 INFO L273 TraceCheckUtils]: 25: Hoare triple {12002#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {12002#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:55,046 INFO L273 TraceCheckUtils]: 26: Hoare triple {12002#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12003#(<= main_~i~1 7)} is VALID [2018-11-14 18:56:55,047 INFO L273 TraceCheckUtils]: 27: Hoare triple {12003#(<= main_~i~1 7)} assume true; {12003#(<= main_~i~1 7)} is VALID [2018-11-14 18:56:55,047 INFO L273 TraceCheckUtils]: 28: Hoare triple {12003#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {12003#(<= main_~i~1 7)} is VALID [2018-11-14 18:56:55,048 INFO L273 TraceCheckUtils]: 29: Hoare triple {12003#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12004#(<= main_~i~1 8)} is VALID [2018-11-14 18:56:55,048 INFO L273 TraceCheckUtils]: 30: Hoare triple {12004#(<= main_~i~1 8)} assume true; {12004#(<= main_~i~1 8)} is VALID [2018-11-14 18:56:55,049 INFO L273 TraceCheckUtils]: 31: Hoare triple {12004#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {12004#(<= main_~i~1 8)} is VALID [2018-11-14 18:56:55,050 INFO L273 TraceCheckUtils]: 32: Hoare triple {12004#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12005#(<= main_~i~1 9)} is VALID [2018-11-14 18:56:55,050 INFO L273 TraceCheckUtils]: 33: Hoare triple {12005#(<= main_~i~1 9)} assume true; {12005#(<= main_~i~1 9)} is VALID [2018-11-14 18:56:55,051 INFO L273 TraceCheckUtils]: 34: Hoare triple {12005#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {12005#(<= main_~i~1 9)} is VALID [2018-11-14 18:56:55,051 INFO L273 TraceCheckUtils]: 35: Hoare triple {12005#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12006#(<= main_~i~1 10)} is VALID [2018-11-14 18:56:55,052 INFO L273 TraceCheckUtils]: 36: Hoare triple {12006#(<= main_~i~1 10)} assume true; {12006#(<= main_~i~1 10)} is VALID [2018-11-14 18:56:55,052 INFO L273 TraceCheckUtils]: 37: Hoare triple {12006#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {12006#(<= main_~i~1 10)} is VALID [2018-11-14 18:56:55,053 INFO L273 TraceCheckUtils]: 38: Hoare triple {12006#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12007#(<= main_~i~1 11)} is VALID [2018-11-14 18:56:55,054 INFO L273 TraceCheckUtils]: 39: Hoare triple {12007#(<= main_~i~1 11)} assume true; {12007#(<= main_~i~1 11)} is VALID [2018-11-14 18:56:55,054 INFO L273 TraceCheckUtils]: 40: Hoare triple {12007#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {12007#(<= main_~i~1 11)} is VALID [2018-11-14 18:56:55,055 INFO L273 TraceCheckUtils]: 41: Hoare triple {12007#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12008#(<= main_~i~1 12)} is VALID [2018-11-14 18:56:55,055 INFO L273 TraceCheckUtils]: 42: Hoare triple {12008#(<= main_~i~1 12)} assume true; {12008#(<= main_~i~1 12)} is VALID [2018-11-14 18:56:55,056 INFO L273 TraceCheckUtils]: 43: Hoare triple {12008#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {12008#(<= main_~i~1 12)} is VALID [2018-11-14 18:56:55,056 INFO L273 TraceCheckUtils]: 44: Hoare triple {12008#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12009#(<= main_~i~1 13)} is VALID [2018-11-14 18:56:55,057 INFO L273 TraceCheckUtils]: 45: Hoare triple {12009#(<= main_~i~1 13)} assume true; {12009#(<= main_~i~1 13)} is VALID [2018-11-14 18:56:55,057 INFO L273 TraceCheckUtils]: 46: Hoare triple {12009#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {12009#(<= main_~i~1 13)} is VALID [2018-11-14 18:56:55,058 INFO L273 TraceCheckUtils]: 47: Hoare triple {12009#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12010#(<= main_~i~1 14)} is VALID [2018-11-14 18:56:55,058 INFO L273 TraceCheckUtils]: 48: Hoare triple {12010#(<= main_~i~1 14)} assume true; {12010#(<= main_~i~1 14)} is VALID [2018-11-14 18:56:55,059 INFO L273 TraceCheckUtils]: 49: Hoare triple {12010#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {12010#(<= main_~i~1 14)} is VALID [2018-11-14 18:56:55,060 INFO L273 TraceCheckUtils]: 50: Hoare triple {12010#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12011#(<= main_~i~1 15)} is VALID [2018-11-14 18:56:55,060 INFO L273 TraceCheckUtils]: 51: Hoare triple {12011#(<= main_~i~1 15)} assume true; {12011#(<= main_~i~1 15)} is VALID [2018-11-14 18:56:55,061 INFO L273 TraceCheckUtils]: 52: Hoare triple {12011#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {12011#(<= main_~i~1 15)} is VALID [2018-11-14 18:56:55,061 INFO L273 TraceCheckUtils]: 53: Hoare triple {12011#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12012#(<= main_~i~1 16)} is VALID [2018-11-14 18:56:55,062 INFO L273 TraceCheckUtils]: 54: Hoare triple {12012#(<= main_~i~1 16)} assume true; {12012#(<= main_~i~1 16)} is VALID [2018-11-14 18:56:55,062 INFO L273 TraceCheckUtils]: 55: Hoare triple {12012#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {12012#(<= main_~i~1 16)} is VALID [2018-11-14 18:56:55,063 INFO L273 TraceCheckUtils]: 56: Hoare triple {12012#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12013#(<= main_~i~1 17)} is VALID [2018-11-14 18:56:55,064 INFO L273 TraceCheckUtils]: 57: Hoare triple {12013#(<= main_~i~1 17)} assume true; {12013#(<= main_~i~1 17)} is VALID [2018-11-14 18:56:55,064 INFO L273 TraceCheckUtils]: 58: Hoare triple {12013#(<= main_~i~1 17)} assume !(~i~1 < 100000); {11995#false} is VALID [2018-11-14 18:56:55,064 INFO L256 TraceCheckUtils]: 59: Hoare triple {11995#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {11994#true} is VALID [2018-11-14 18:56:55,065 INFO L273 TraceCheckUtils]: 60: Hoare triple {11994#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {11994#true} is VALID [2018-11-14 18:56:55,065 INFO L273 TraceCheckUtils]: 61: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:56:55,065 INFO L273 TraceCheckUtils]: 62: Hoare triple {11994#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 18:56:55,065 INFO L273 TraceCheckUtils]: 63: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 18:56:55,065 INFO L273 TraceCheckUtils]: 64: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:56:55,065 INFO L273 TraceCheckUtils]: 65: Hoare triple {11994#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 18:56:55,066 INFO L273 TraceCheckUtils]: 66: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 18:56:55,066 INFO L273 TraceCheckUtils]: 67: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:56:55,066 INFO L273 TraceCheckUtils]: 68: Hoare triple {11994#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 18:56:55,066 INFO L273 TraceCheckUtils]: 69: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 18:56:55,066 INFO L273 TraceCheckUtils]: 70: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:56:55,067 INFO L273 TraceCheckUtils]: 71: Hoare triple {11994#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 18:56:55,067 INFO L273 TraceCheckUtils]: 72: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 18:56:55,067 INFO L273 TraceCheckUtils]: 73: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:56:55,067 INFO L273 TraceCheckUtils]: 74: Hoare triple {11994#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 18:56:55,067 INFO L273 TraceCheckUtils]: 75: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 18:56:55,067 INFO L273 TraceCheckUtils]: 76: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:56:55,067 INFO L273 TraceCheckUtils]: 77: Hoare triple {11994#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 18:56:55,067 INFO L273 TraceCheckUtils]: 78: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 18:56:55,068 INFO L273 TraceCheckUtils]: 79: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:56:55,068 INFO L273 TraceCheckUtils]: 80: Hoare triple {11994#true} assume !(~i~0 < 100000); {11994#true} is VALID [2018-11-14 18:56:55,068 INFO L273 TraceCheckUtils]: 81: Hoare triple {11994#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11994#true} is VALID [2018-11-14 18:56:55,068 INFO L273 TraceCheckUtils]: 82: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:56:55,068 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {11994#true} {11995#false} #73#return; {11995#false} is VALID [2018-11-14 18:56:55,068 INFO L273 TraceCheckUtils]: 84: Hoare triple {11995#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {11995#false} is VALID [2018-11-14 18:56:55,068 INFO L256 TraceCheckUtils]: 85: Hoare triple {11995#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {11994#true} is VALID [2018-11-14 18:56:55,068 INFO L273 TraceCheckUtils]: 86: Hoare triple {11994#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {11994#true} is VALID [2018-11-14 18:56:55,068 INFO L273 TraceCheckUtils]: 87: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:56:55,068 INFO L273 TraceCheckUtils]: 88: Hoare triple {11994#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 18:56:55,069 INFO L273 TraceCheckUtils]: 89: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 18:56:55,069 INFO L273 TraceCheckUtils]: 90: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:56:55,069 INFO L273 TraceCheckUtils]: 91: Hoare triple {11994#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 18:56:55,069 INFO L273 TraceCheckUtils]: 92: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 18:56:55,069 INFO L273 TraceCheckUtils]: 93: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:56:55,069 INFO L273 TraceCheckUtils]: 94: Hoare triple {11994#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 18:56:55,069 INFO L273 TraceCheckUtils]: 95: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 18:56:55,069 INFO L273 TraceCheckUtils]: 96: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:56:55,069 INFO L273 TraceCheckUtils]: 97: Hoare triple {11994#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 18:56:55,070 INFO L273 TraceCheckUtils]: 98: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 18:56:55,070 INFO L273 TraceCheckUtils]: 99: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:56:55,070 INFO L273 TraceCheckUtils]: 100: Hoare triple {11994#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 18:56:55,070 INFO L273 TraceCheckUtils]: 101: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 18:56:55,070 INFO L273 TraceCheckUtils]: 102: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:56:55,070 INFO L273 TraceCheckUtils]: 103: Hoare triple {11994#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 18:56:55,070 INFO L273 TraceCheckUtils]: 104: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 18:56:55,070 INFO L273 TraceCheckUtils]: 105: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:56:55,070 INFO L273 TraceCheckUtils]: 106: Hoare triple {11994#true} assume !(~i~0 < 100000); {11994#true} is VALID [2018-11-14 18:56:55,071 INFO L273 TraceCheckUtils]: 107: Hoare triple {11994#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11994#true} is VALID [2018-11-14 18:56:55,071 INFO L273 TraceCheckUtils]: 108: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:56:55,071 INFO L268 TraceCheckUtils]: 109: Hoare quadruple {11994#true} {11995#false} #75#return; {11995#false} is VALID [2018-11-14 18:56:55,071 INFO L273 TraceCheckUtils]: 110: Hoare triple {11995#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {11995#false} is VALID [2018-11-14 18:56:55,071 INFO L273 TraceCheckUtils]: 111: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 18:56:55,071 INFO L273 TraceCheckUtils]: 112: Hoare triple {11995#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {11995#false} is VALID [2018-11-14 18:56:55,071 INFO L273 TraceCheckUtils]: 113: Hoare triple {11995#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {11995#false} is VALID [2018-11-14 18:56:55,071 INFO L273 TraceCheckUtils]: 114: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 18:56:55,071 INFO L273 TraceCheckUtils]: 115: Hoare triple {11995#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {11995#false} is VALID [2018-11-14 18:56:55,072 INFO L273 TraceCheckUtils]: 116: Hoare triple {11995#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {11995#false} is VALID [2018-11-14 18:56:55,072 INFO L273 TraceCheckUtils]: 117: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 18:56:55,072 INFO L273 TraceCheckUtils]: 118: Hoare triple {11995#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {11995#false} is VALID [2018-11-14 18:56:55,072 INFO L273 TraceCheckUtils]: 119: Hoare triple {11995#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {11995#false} is VALID [2018-11-14 18:56:55,072 INFO L273 TraceCheckUtils]: 120: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 18:56:55,072 INFO L273 TraceCheckUtils]: 121: Hoare triple {11995#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {11995#false} is VALID [2018-11-14 18:56:55,072 INFO L273 TraceCheckUtils]: 122: Hoare triple {11995#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {11995#false} is VALID [2018-11-14 18:56:55,072 INFO L273 TraceCheckUtils]: 123: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 18:56:55,072 INFO L273 TraceCheckUtils]: 124: Hoare triple {11995#false} assume !(~i~2 < 99999); {11995#false} is VALID [2018-11-14 18:56:55,072 INFO L273 TraceCheckUtils]: 125: Hoare triple {11995#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {11995#false} is VALID [2018-11-14 18:56:55,073 INFO L256 TraceCheckUtils]: 126: Hoare triple {11995#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {11994#true} is VALID [2018-11-14 18:56:55,073 INFO L273 TraceCheckUtils]: 127: Hoare triple {11994#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {11994#true} is VALID [2018-11-14 18:56:55,073 INFO L273 TraceCheckUtils]: 128: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:56:55,073 INFO L273 TraceCheckUtils]: 129: Hoare triple {11994#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 18:56:55,073 INFO L273 TraceCheckUtils]: 130: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 18:56:55,073 INFO L273 TraceCheckUtils]: 131: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:56:55,073 INFO L273 TraceCheckUtils]: 132: Hoare triple {11994#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 18:56:55,073 INFO L273 TraceCheckUtils]: 133: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 18:56:55,073 INFO L273 TraceCheckUtils]: 134: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:56:55,074 INFO L273 TraceCheckUtils]: 135: Hoare triple {11994#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 18:56:55,074 INFO L273 TraceCheckUtils]: 136: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 18:56:55,074 INFO L273 TraceCheckUtils]: 137: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:56:55,074 INFO L273 TraceCheckUtils]: 138: Hoare triple {11994#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 18:56:55,074 INFO L273 TraceCheckUtils]: 139: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 18:56:55,074 INFO L273 TraceCheckUtils]: 140: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:56:55,074 INFO L273 TraceCheckUtils]: 141: Hoare triple {11994#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 18:56:55,074 INFO L273 TraceCheckUtils]: 142: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 18:56:55,074 INFO L273 TraceCheckUtils]: 143: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:56:55,075 INFO L273 TraceCheckUtils]: 144: Hoare triple {11994#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 18:56:55,075 INFO L273 TraceCheckUtils]: 145: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 18:56:55,075 INFO L273 TraceCheckUtils]: 146: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:56:55,075 INFO L273 TraceCheckUtils]: 147: Hoare triple {11994#true} assume !(~i~0 < 100000); {11994#true} is VALID [2018-11-14 18:56:55,075 INFO L273 TraceCheckUtils]: 148: Hoare triple {11994#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11994#true} is VALID [2018-11-14 18:56:55,075 INFO L273 TraceCheckUtils]: 149: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:56:55,075 INFO L268 TraceCheckUtils]: 150: Hoare quadruple {11994#true} {11995#false} #77#return; {11995#false} is VALID [2018-11-14 18:56:55,075 INFO L273 TraceCheckUtils]: 151: Hoare triple {11995#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {11995#false} is VALID [2018-11-14 18:56:55,075 INFO L273 TraceCheckUtils]: 152: Hoare triple {11995#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {11995#false} is VALID [2018-11-14 18:56:55,076 INFO L273 TraceCheckUtils]: 153: Hoare triple {11995#false} assume !false; {11995#false} is VALID [2018-11-14 18:56:55,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 611 trivial. 0 not checked. [2018-11-14 18:56:55,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:56:55,089 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-14 18:56:55,106 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 18:56:55,734 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2018-11-14 18:56:55,735 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:56:55,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:56:55,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:56:55,981 INFO L256 TraceCheckUtils]: 0: Hoare triple {11994#true} call ULTIMATE.init(); {11994#true} is VALID [2018-11-14 18:56:55,981 INFO L273 TraceCheckUtils]: 1: Hoare triple {11994#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11994#true} is VALID [2018-11-14 18:56:55,981 INFO L273 TraceCheckUtils]: 2: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:56:55,981 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11994#true} {11994#true} #69#return; {11994#true} is VALID [2018-11-14 18:56:55,982 INFO L256 TraceCheckUtils]: 4: Hoare triple {11994#true} call #t~ret13 := main(); {11994#true} is VALID [2018-11-14 18:56:55,982 INFO L273 TraceCheckUtils]: 5: Hoare triple {11994#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; {11994#true} is VALID [2018-11-14 18:56:55,982 INFO L273 TraceCheckUtils]: 6: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:56:55,982 INFO L273 TraceCheckUtils]: 7: Hoare triple {11994#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 18:56:55,982 INFO L273 TraceCheckUtils]: 8: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 18:56:55,983 INFO L273 TraceCheckUtils]: 9: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:56:55,983 INFO L273 TraceCheckUtils]: 10: Hoare triple {11994#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 18:56:55,983 INFO L273 TraceCheckUtils]: 11: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 18:56:55,983 INFO L273 TraceCheckUtils]: 12: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:56:55,983 INFO L273 TraceCheckUtils]: 13: Hoare triple {11994#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 18:56:55,983 INFO L273 TraceCheckUtils]: 14: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 18:56:55,984 INFO L273 TraceCheckUtils]: 15: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:56:55,984 INFO L273 TraceCheckUtils]: 16: Hoare triple {11994#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 18:56:55,984 INFO L273 TraceCheckUtils]: 17: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 18:56:55,984 INFO L273 TraceCheckUtils]: 18: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:56:55,984 INFO L273 TraceCheckUtils]: 19: Hoare triple {11994#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 18:56:55,984 INFO L273 TraceCheckUtils]: 20: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 18:56:55,985 INFO L273 TraceCheckUtils]: 21: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:56:55,985 INFO L273 TraceCheckUtils]: 22: Hoare triple {11994#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 18:56:55,985 INFO L273 TraceCheckUtils]: 23: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 18:56:55,985 INFO L273 TraceCheckUtils]: 24: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:56:55,985 INFO L273 TraceCheckUtils]: 25: Hoare triple {11994#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 18:56:55,985 INFO L273 TraceCheckUtils]: 26: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 18:56:55,986 INFO L273 TraceCheckUtils]: 27: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:56:55,986 INFO L273 TraceCheckUtils]: 28: Hoare triple {11994#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 18:56:55,986 INFO L273 TraceCheckUtils]: 29: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 18:56:55,986 INFO L273 TraceCheckUtils]: 30: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:56:55,986 INFO L273 TraceCheckUtils]: 31: Hoare triple {11994#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 18:56:55,986 INFO L273 TraceCheckUtils]: 32: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 18:56:55,987 INFO L273 TraceCheckUtils]: 33: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:56:55,987 INFO L273 TraceCheckUtils]: 34: Hoare triple {11994#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 18:56:55,987 INFO L273 TraceCheckUtils]: 35: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 18:56:55,987 INFO L273 TraceCheckUtils]: 36: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:56:55,987 INFO L273 TraceCheckUtils]: 37: Hoare triple {11994#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 18:56:55,987 INFO L273 TraceCheckUtils]: 38: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 18:56:55,988 INFO L273 TraceCheckUtils]: 39: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:56:55,988 INFO L273 TraceCheckUtils]: 40: Hoare triple {11994#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 18:56:55,988 INFO L273 TraceCheckUtils]: 41: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 18:56:55,988 INFO L273 TraceCheckUtils]: 42: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:56:55,988 INFO L273 TraceCheckUtils]: 43: Hoare triple {11994#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 18:56:55,988 INFO L273 TraceCheckUtils]: 44: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 18:56:55,989 INFO L273 TraceCheckUtils]: 45: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:56:55,989 INFO L273 TraceCheckUtils]: 46: Hoare triple {11994#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 18:56:55,989 INFO L273 TraceCheckUtils]: 47: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 18:56:55,989 INFO L273 TraceCheckUtils]: 48: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:56:55,989 INFO L273 TraceCheckUtils]: 49: Hoare triple {11994#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 18:56:55,989 INFO L273 TraceCheckUtils]: 50: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 18:56:55,990 INFO L273 TraceCheckUtils]: 51: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:56:55,990 INFO L273 TraceCheckUtils]: 52: Hoare triple {11994#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 18:56:55,990 INFO L273 TraceCheckUtils]: 53: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 18:56:55,990 INFO L273 TraceCheckUtils]: 54: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:56:55,990 INFO L273 TraceCheckUtils]: 55: Hoare triple {11994#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 18:56:55,990 INFO L273 TraceCheckUtils]: 56: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 18:56:55,991 INFO L273 TraceCheckUtils]: 57: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 18:56:55,991 INFO L273 TraceCheckUtils]: 58: Hoare triple {11994#true} assume !(~i~1 < 100000); {11994#true} is VALID [2018-11-14 18:56:55,991 INFO L256 TraceCheckUtils]: 59: Hoare triple {11994#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {11994#true} is VALID [2018-11-14 18:56:56,012 INFO L273 TraceCheckUtils]: 60: Hoare triple {11994#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {12197#(<= xor_~i~0 1)} is VALID [2018-11-14 18:56:56,013 INFO L273 TraceCheckUtils]: 61: Hoare triple {12197#(<= xor_~i~0 1)} assume true; {12197#(<= xor_~i~0 1)} is VALID [2018-11-14 18:56:56,015 INFO L273 TraceCheckUtils]: 62: Hoare triple {12197#(<= xor_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12197#(<= xor_~i~0 1)} is VALID [2018-11-14 18:56:56,015 INFO L273 TraceCheckUtils]: 63: Hoare triple {12197#(<= xor_~i~0 1)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {12207#(<= xor_~i~0 2)} is VALID [2018-11-14 18:56:56,017 INFO L273 TraceCheckUtils]: 64: Hoare triple {12207#(<= xor_~i~0 2)} assume true; {12207#(<= xor_~i~0 2)} is VALID [2018-11-14 18:56:56,017 INFO L273 TraceCheckUtils]: 65: Hoare triple {12207#(<= xor_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12207#(<= xor_~i~0 2)} is VALID [2018-11-14 18:56:56,019 INFO L273 TraceCheckUtils]: 66: Hoare triple {12207#(<= xor_~i~0 2)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {12217#(<= xor_~i~0 3)} is VALID [2018-11-14 18:56:56,019 INFO L273 TraceCheckUtils]: 67: Hoare triple {12217#(<= xor_~i~0 3)} assume true; {12217#(<= xor_~i~0 3)} is VALID [2018-11-14 18:56:56,019 INFO L273 TraceCheckUtils]: 68: Hoare triple {12217#(<= xor_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12217#(<= xor_~i~0 3)} is VALID [2018-11-14 18:56:56,020 INFO L273 TraceCheckUtils]: 69: Hoare triple {12217#(<= xor_~i~0 3)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {12227#(<= xor_~i~0 4)} is VALID [2018-11-14 18:56:56,020 INFO L273 TraceCheckUtils]: 70: Hoare triple {12227#(<= xor_~i~0 4)} assume true; {12227#(<= xor_~i~0 4)} is VALID [2018-11-14 18:56:56,020 INFO L273 TraceCheckUtils]: 71: Hoare triple {12227#(<= xor_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12227#(<= xor_~i~0 4)} is VALID [2018-11-14 18:56:56,021 INFO L273 TraceCheckUtils]: 72: Hoare triple {12227#(<= xor_~i~0 4)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {12237#(<= xor_~i~0 5)} is VALID [2018-11-14 18:56:56,021 INFO L273 TraceCheckUtils]: 73: Hoare triple {12237#(<= xor_~i~0 5)} assume true; {12237#(<= xor_~i~0 5)} is VALID [2018-11-14 18:56:56,021 INFO L273 TraceCheckUtils]: 74: Hoare triple {12237#(<= xor_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12237#(<= xor_~i~0 5)} is VALID [2018-11-14 18:56:56,022 INFO L273 TraceCheckUtils]: 75: Hoare triple {12237#(<= xor_~i~0 5)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {12247#(<= xor_~i~0 6)} is VALID [2018-11-14 18:56:56,022 INFO L273 TraceCheckUtils]: 76: Hoare triple {12247#(<= xor_~i~0 6)} assume true; {12247#(<= xor_~i~0 6)} is VALID [2018-11-14 18:56:56,023 INFO L273 TraceCheckUtils]: 77: Hoare triple {12247#(<= xor_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12247#(<= xor_~i~0 6)} is VALID [2018-11-14 18:56:56,023 INFO L273 TraceCheckUtils]: 78: Hoare triple {12247#(<= xor_~i~0 6)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {12257#(<= xor_~i~0 7)} is VALID [2018-11-14 18:56:56,024 INFO L273 TraceCheckUtils]: 79: Hoare triple {12257#(<= xor_~i~0 7)} assume true; {12257#(<= xor_~i~0 7)} is VALID [2018-11-14 18:56:56,025 INFO L273 TraceCheckUtils]: 80: Hoare triple {12257#(<= xor_~i~0 7)} assume !(~i~0 < 100000); {11995#false} is VALID [2018-11-14 18:56:56,025 INFO L273 TraceCheckUtils]: 81: Hoare triple {11995#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11995#false} is VALID [2018-11-14 18:56:56,025 INFO L273 TraceCheckUtils]: 82: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 18:56:56,025 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {11995#false} {11994#true} #73#return; {11995#false} is VALID [2018-11-14 18:56:56,025 INFO L273 TraceCheckUtils]: 84: Hoare triple {11995#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {11995#false} is VALID [2018-11-14 18:56:56,026 INFO L256 TraceCheckUtils]: 85: Hoare triple {11995#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {11995#false} is VALID [2018-11-14 18:56:56,026 INFO L273 TraceCheckUtils]: 86: Hoare triple {11995#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {11995#false} is VALID [2018-11-14 18:56:56,026 INFO L273 TraceCheckUtils]: 87: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 18:56:56,026 INFO L273 TraceCheckUtils]: 88: Hoare triple {11995#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 18:56:56,026 INFO L273 TraceCheckUtils]: 89: Hoare triple {11995#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11995#false} is VALID [2018-11-14 18:56:56,026 INFO L273 TraceCheckUtils]: 90: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 18:56:56,027 INFO L273 TraceCheckUtils]: 91: Hoare triple {11995#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 18:56:56,027 INFO L273 TraceCheckUtils]: 92: Hoare triple {11995#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11995#false} is VALID [2018-11-14 18:56:56,027 INFO L273 TraceCheckUtils]: 93: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 18:56:56,027 INFO L273 TraceCheckUtils]: 94: Hoare triple {11995#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 18:56:56,027 INFO L273 TraceCheckUtils]: 95: Hoare triple {11995#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11995#false} is VALID [2018-11-14 18:56:56,027 INFO L273 TraceCheckUtils]: 96: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 18:56:56,028 INFO L273 TraceCheckUtils]: 97: Hoare triple {11995#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 18:56:56,028 INFO L273 TraceCheckUtils]: 98: Hoare triple {11995#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11995#false} is VALID [2018-11-14 18:56:56,028 INFO L273 TraceCheckUtils]: 99: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 18:56:56,028 INFO L273 TraceCheckUtils]: 100: Hoare triple {11995#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 18:56:56,028 INFO L273 TraceCheckUtils]: 101: Hoare triple {11995#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11995#false} is VALID [2018-11-14 18:56:56,028 INFO L273 TraceCheckUtils]: 102: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 18:56:56,028 INFO L273 TraceCheckUtils]: 103: Hoare triple {11995#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 18:56:56,028 INFO L273 TraceCheckUtils]: 104: Hoare triple {11995#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11995#false} is VALID [2018-11-14 18:56:56,028 INFO L273 TraceCheckUtils]: 105: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 18:56:56,029 INFO L273 TraceCheckUtils]: 106: Hoare triple {11995#false} assume !(~i~0 < 100000); {11995#false} is VALID [2018-11-14 18:56:56,029 INFO L273 TraceCheckUtils]: 107: Hoare triple {11995#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11995#false} is VALID [2018-11-14 18:56:56,029 INFO L273 TraceCheckUtils]: 108: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 18:56:56,029 INFO L268 TraceCheckUtils]: 109: Hoare quadruple {11995#false} {11995#false} #75#return; {11995#false} is VALID [2018-11-14 18:56:56,029 INFO L273 TraceCheckUtils]: 110: Hoare triple {11995#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {11995#false} is VALID [2018-11-14 18:56:56,029 INFO L273 TraceCheckUtils]: 111: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 18:56:56,029 INFO L273 TraceCheckUtils]: 112: Hoare triple {11995#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {11995#false} is VALID [2018-11-14 18:56:56,029 INFO L273 TraceCheckUtils]: 113: Hoare triple {11995#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {11995#false} is VALID [2018-11-14 18:56:56,029 INFO L273 TraceCheckUtils]: 114: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 18:56:56,030 INFO L273 TraceCheckUtils]: 115: Hoare triple {11995#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {11995#false} is VALID [2018-11-14 18:56:56,030 INFO L273 TraceCheckUtils]: 116: Hoare triple {11995#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {11995#false} is VALID [2018-11-14 18:56:56,030 INFO L273 TraceCheckUtils]: 117: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 18:56:56,030 INFO L273 TraceCheckUtils]: 118: Hoare triple {11995#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {11995#false} is VALID [2018-11-14 18:56:56,030 INFO L273 TraceCheckUtils]: 119: Hoare triple {11995#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {11995#false} is VALID [2018-11-14 18:56:56,030 INFO L273 TraceCheckUtils]: 120: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 18:56:56,030 INFO L273 TraceCheckUtils]: 121: Hoare triple {11995#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {11995#false} is VALID [2018-11-14 18:56:56,030 INFO L273 TraceCheckUtils]: 122: Hoare triple {11995#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {11995#false} is VALID [2018-11-14 18:56:56,030 INFO L273 TraceCheckUtils]: 123: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 18:56:56,031 INFO L273 TraceCheckUtils]: 124: Hoare triple {11995#false} assume !(~i~2 < 99999); {11995#false} is VALID [2018-11-14 18:56:56,031 INFO L273 TraceCheckUtils]: 125: Hoare triple {11995#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {11995#false} is VALID [2018-11-14 18:56:56,031 INFO L256 TraceCheckUtils]: 126: Hoare triple {11995#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {11995#false} is VALID [2018-11-14 18:56:56,031 INFO L273 TraceCheckUtils]: 127: Hoare triple {11995#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {11995#false} is VALID [2018-11-14 18:56:56,031 INFO L273 TraceCheckUtils]: 128: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 18:56:56,031 INFO L273 TraceCheckUtils]: 129: Hoare triple {11995#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 18:56:56,031 INFO L273 TraceCheckUtils]: 130: Hoare triple {11995#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11995#false} is VALID [2018-11-14 18:56:56,031 INFO L273 TraceCheckUtils]: 131: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 18:56:56,031 INFO L273 TraceCheckUtils]: 132: Hoare triple {11995#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 18:56:56,031 INFO L273 TraceCheckUtils]: 133: Hoare triple {11995#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11995#false} is VALID [2018-11-14 18:56:56,032 INFO L273 TraceCheckUtils]: 134: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 18:56:56,032 INFO L273 TraceCheckUtils]: 135: Hoare triple {11995#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 18:56:56,032 INFO L273 TraceCheckUtils]: 136: Hoare triple {11995#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11995#false} is VALID [2018-11-14 18:56:56,032 INFO L273 TraceCheckUtils]: 137: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 18:56:56,032 INFO L273 TraceCheckUtils]: 138: Hoare triple {11995#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 18:56:56,032 INFO L273 TraceCheckUtils]: 139: Hoare triple {11995#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11995#false} is VALID [2018-11-14 18:56:56,032 INFO L273 TraceCheckUtils]: 140: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 18:56:56,032 INFO L273 TraceCheckUtils]: 141: Hoare triple {11995#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 18:56:56,032 INFO L273 TraceCheckUtils]: 142: Hoare triple {11995#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11995#false} is VALID [2018-11-14 18:56:56,033 INFO L273 TraceCheckUtils]: 143: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 18:56:56,033 INFO L273 TraceCheckUtils]: 144: Hoare triple {11995#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 18:56:56,033 INFO L273 TraceCheckUtils]: 145: Hoare triple {11995#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11995#false} is VALID [2018-11-14 18:56:56,033 INFO L273 TraceCheckUtils]: 146: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 18:56:56,033 INFO L273 TraceCheckUtils]: 147: Hoare triple {11995#false} assume !(~i~0 < 100000); {11995#false} is VALID [2018-11-14 18:56:56,033 INFO L273 TraceCheckUtils]: 148: Hoare triple {11995#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11995#false} is VALID [2018-11-14 18:56:56,033 INFO L273 TraceCheckUtils]: 149: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 18:56:56,033 INFO L268 TraceCheckUtils]: 150: Hoare quadruple {11995#false} {11995#false} #77#return; {11995#false} is VALID [2018-11-14 18:56:56,033 INFO L273 TraceCheckUtils]: 151: Hoare triple {11995#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {11995#false} is VALID [2018-11-14 18:56:56,033 INFO L273 TraceCheckUtils]: 152: Hoare triple {11995#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {11995#false} is VALID [2018-11-14 18:56:56,034 INFO L273 TraceCheckUtils]: 153: Hoare triple {11995#false} assume !false; {11995#false} is VALID [2018-11-14 18:56:56,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 270 proven. 57 refuted. 0 times theorem prover too weak. 726 trivial. 0 not checked. [2018-11-14 18:56:56,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:56:56,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9] total 27 [2018-11-14 18:56:56,065 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 154 [2018-11-14 18:56:56,065 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:56:56,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-14 18:56:56,173 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:56:56,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-14 18:56:56,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-14 18:56:56,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2018-11-14 18:56:56,175 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 27 states. [2018-11-14 18:56:56,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:56,994 INFO L93 Difference]: Finished difference Result 163 states and 175 transitions. [2018-11-14 18:56:56,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-14 18:56:56,994 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 154 [2018-11-14 18:56:56,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:56:56,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 18:56:56,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 136 transitions. [2018-11-14 18:56:56,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 18:56:56,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 136 transitions. [2018-11-14 18:56:56,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 136 transitions. [2018-11-14 18:56:57,139 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-14 18:56:57,141 INFO L225 Difference]: With dead ends: 163 [2018-11-14 18:56:57,142 INFO L226 Difference]: Without dead ends: 115 [2018-11-14 18:56:57,142 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2018-11-14 18:56:57,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-14 18:56:57,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2018-11-14 18:56:57,183 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:56:57,183 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand 113 states. [2018-11-14 18:56:57,183 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 113 states. [2018-11-14 18:56:57,183 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 113 states. [2018-11-14 18:56:57,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:57,186 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2018-11-14 18:56:57,186 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2018-11-14 18:56:57,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:56:57,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:56:57,187 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 115 states. [2018-11-14 18:56:57,187 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 115 states. [2018-11-14 18:56:57,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:57,189 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2018-11-14 18:56:57,189 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2018-11-14 18:56:57,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:56:57,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:56:57,190 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:56:57,190 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:56:57,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-14 18:56:57,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2018-11-14 18:56:57,192 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 154 [2018-11-14 18:56:57,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:56:57,192 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2018-11-14 18:56:57,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-14 18:56:57,193 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2018-11-14 18:56:57,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-14 18:56:57,194 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:56:57,194 INFO L375 BasicCegarLoop]: trace histogram [24, 21, 21, 19, 18, 18, 5, 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-14 18:56:57,194 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:56:57,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:56:57,194 INFO L82 PathProgramCache]: Analyzing trace with hash 2094815685, now seen corresponding path program 18 times [2018-11-14 18:56:57,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:56:57,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:56:57,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:56:57,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:56:57,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:56:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:56:57,566 INFO L256 TraceCheckUtils]: 0: Hoare triple {13084#true} call ULTIMATE.init(); {13084#true} is VALID [2018-11-14 18:56:57,566 INFO L273 TraceCheckUtils]: 1: Hoare triple {13084#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13084#true} is VALID [2018-11-14 18:56:57,566 INFO L273 TraceCheckUtils]: 2: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:57,567 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13084#true} {13084#true} #69#return; {13084#true} is VALID [2018-11-14 18:56:57,567 INFO L256 TraceCheckUtils]: 4: Hoare triple {13084#true} call #t~ret13 := main(); {13084#true} is VALID [2018-11-14 18:56:57,567 INFO L273 TraceCheckUtils]: 5: Hoare triple {13084#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; {13086#(= main_~i~1 0)} is VALID [2018-11-14 18:56:57,568 INFO L273 TraceCheckUtils]: 6: Hoare triple {13086#(= main_~i~1 0)} assume true; {13086#(= main_~i~1 0)} is VALID [2018-11-14 18:56:57,568 INFO L273 TraceCheckUtils]: 7: Hoare triple {13086#(= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {13086#(= main_~i~1 0)} is VALID [2018-11-14 18:56:57,568 INFO L273 TraceCheckUtils]: 8: Hoare triple {13086#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13087#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:57,569 INFO L273 TraceCheckUtils]: 9: Hoare triple {13087#(<= main_~i~1 1)} assume true; {13087#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:57,569 INFO L273 TraceCheckUtils]: 10: Hoare triple {13087#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {13087#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:57,571 INFO L273 TraceCheckUtils]: 11: Hoare triple {13087#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13088#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:57,571 INFO L273 TraceCheckUtils]: 12: Hoare triple {13088#(<= main_~i~1 2)} assume true; {13088#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:57,572 INFO L273 TraceCheckUtils]: 13: Hoare triple {13088#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {13088#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:57,572 INFO L273 TraceCheckUtils]: 14: Hoare triple {13088#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13089#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:57,573 INFO L273 TraceCheckUtils]: 15: Hoare triple {13089#(<= main_~i~1 3)} assume true; {13089#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:57,573 INFO L273 TraceCheckUtils]: 16: Hoare triple {13089#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {13089#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:57,574 INFO L273 TraceCheckUtils]: 17: Hoare triple {13089#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13090#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:57,575 INFO L273 TraceCheckUtils]: 18: Hoare triple {13090#(<= main_~i~1 4)} assume true; {13090#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:57,575 INFO L273 TraceCheckUtils]: 19: Hoare triple {13090#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {13090#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:57,576 INFO L273 TraceCheckUtils]: 20: Hoare triple {13090#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13091#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:57,576 INFO L273 TraceCheckUtils]: 21: Hoare triple {13091#(<= main_~i~1 5)} assume true; {13091#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:57,577 INFO L273 TraceCheckUtils]: 22: Hoare triple {13091#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {13091#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:57,578 INFO L273 TraceCheckUtils]: 23: Hoare triple {13091#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13092#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:57,578 INFO L273 TraceCheckUtils]: 24: Hoare triple {13092#(<= main_~i~1 6)} assume true; {13092#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:57,579 INFO L273 TraceCheckUtils]: 25: Hoare triple {13092#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {13092#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:57,579 INFO L273 TraceCheckUtils]: 26: Hoare triple {13092#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13093#(<= main_~i~1 7)} is VALID [2018-11-14 18:56:57,580 INFO L273 TraceCheckUtils]: 27: Hoare triple {13093#(<= main_~i~1 7)} assume true; {13093#(<= main_~i~1 7)} is VALID [2018-11-14 18:56:57,580 INFO L273 TraceCheckUtils]: 28: Hoare triple {13093#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {13093#(<= main_~i~1 7)} is VALID [2018-11-14 18:56:57,581 INFO L273 TraceCheckUtils]: 29: Hoare triple {13093#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13094#(<= main_~i~1 8)} is VALID [2018-11-14 18:56:57,582 INFO L273 TraceCheckUtils]: 30: Hoare triple {13094#(<= main_~i~1 8)} assume true; {13094#(<= main_~i~1 8)} is VALID [2018-11-14 18:56:57,582 INFO L273 TraceCheckUtils]: 31: Hoare triple {13094#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {13094#(<= main_~i~1 8)} is VALID [2018-11-14 18:56:57,583 INFO L273 TraceCheckUtils]: 32: Hoare triple {13094#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13095#(<= main_~i~1 9)} is VALID [2018-11-14 18:56:57,583 INFO L273 TraceCheckUtils]: 33: Hoare triple {13095#(<= main_~i~1 9)} assume true; {13095#(<= main_~i~1 9)} is VALID [2018-11-14 18:56:57,584 INFO L273 TraceCheckUtils]: 34: Hoare triple {13095#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {13095#(<= main_~i~1 9)} is VALID [2018-11-14 18:56:57,585 INFO L273 TraceCheckUtils]: 35: Hoare triple {13095#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13096#(<= main_~i~1 10)} is VALID [2018-11-14 18:56:57,585 INFO L273 TraceCheckUtils]: 36: Hoare triple {13096#(<= main_~i~1 10)} assume true; {13096#(<= main_~i~1 10)} is VALID [2018-11-14 18:56:57,586 INFO L273 TraceCheckUtils]: 37: Hoare triple {13096#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {13096#(<= main_~i~1 10)} is VALID [2018-11-14 18:56:57,586 INFO L273 TraceCheckUtils]: 38: Hoare triple {13096#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13097#(<= main_~i~1 11)} is VALID [2018-11-14 18:56:57,587 INFO L273 TraceCheckUtils]: 39: Hoare triple {13097#(<= main_~i~1 11)} assume true; {13097#(<= main_~i~1 11)} is VALID [2018-11-14 18:56:57,609 INFO L273 TraceCheckUtils]: 40: Hoare triple {13097#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {13097#(<= main_~i~1 11)} is VALID [2018-11-14 18:56:57,623 INFO L273 TraceCheckUtils]: 41: Hoare triple {13097#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13098#(<= main_~i~1 12)} is VALID [2018-11-14 18:56:57,632 INFO L273 TraceCheckUtils]: 42: Hoare triple {13098#(<= main_~i~1 12)} assume true; {13098#(<= main_~i~1 12)} is VALID [2018-11-14 18:56:57,636 INFO L273 TraceCheckUtils]: 43: Hoare triple {13098#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {13098#(<= main_~i~1 12)} is VALID [2018-11-14 18:56:57,636 INFO L273 TraceCheckUtils]: 44: Hoare triple {13098#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13099#(<= main_~i~1 13)} is VALID [2018-11-14 18:56:57,637 INFO L273 TraceCheckUtils]: 45: Hoare triple {13099#(<= main_~i~1 13)} assume true; {13099#(<= main_~i~1 13)} is VALID [2018-11-14 18:56:57,637 INFO L273 TraceCheckUtils]: 46: Hoare triple {13099#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {13099#(<= main_~i~1 13)} is VALID [2018-11-14 18:56:57,637 INFO L273 TraceCheckUtils]: 47: Hoare triple {13099#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13100#(<= main_~i~1 14)} is VALID [2018-11-14 18:56:57,638 INFO L273 TraceCheckUtils]: 48: Hoare triple {13100#(<= main_~i~1 14)} assume true; {13100#(<= main_~i~1 14)} is VALID [2018-11-14 18:56:57,638 INFO L273 TraceCheckUtils]: 49: Hoare triple {13100#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {13100#(<= main_~i~1 14)} is VALID [2018-11-14 18:56:57,638 INFO L273 TraceCheckUtils]: 50: Hoare triple {13100#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13101#(<= main_~i~1 15)} is VALID [2018-11-14 18:56:57,639 INFO L273 TraceCheckUtils]: 51: Hoare triple {13101#(<= main_~i~1 15)} assume true; {13101#(<= main_~i~1 15)} is VALID [2018-11-14 18:56:57,639 INFO L273 TraceCheckUtils]: 52: Hoare triple {13101#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {13101#(<= main_~i~1 15)} is VALID [2018-11-14 18:56:57,639 INFO L273 TraceCheckUtils]: 53: Hoare triple {13101#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13102#(<= main_~i~1 16)} is VALID [2018-11-14 18:56:57,640 INFO L273 TraceCheckUtils]: 54: Hoare triple {13102#(<= main_~i~1 16)} assume true; {13102#(<= main_~i~1 16)} is VALID [2018-11-14 18:56:57,640 INFO L273 TraceCheckUtils]: 55: Hoare triple {13102#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {13102#(<= main_~i~1 16)} is VALID [2018-11-14 18:56:57,641 INFO L273 TraceCheckUtils]: 56: Hoare triple {13102#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13103#(<= main_~i~1 17)} is VALID [2018-11-14 18:56:57,642 INFO L273 TraceCheckUtils]: 57: Hoare triple {13103#(<= main_~i~1 17)} assume true; {13103#(<= main_~i~1 17)} is VALID [2018-11-14 18:56:57,642 INFO L273 TraceCheckUtils]: 58: Hoare triple {13103#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {13103#(<= main_~i~1 17)} is VALID [2018-11-14 18:56:57,643 INFO L273 TraceCheckUtils]: 59: Hoare triple {13103#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13104#(<= main_~i~1 18)} is VALID [2018-11-14 18:56:57,643 INFO L273 TraceCheckUtils]: 60: Hoare triple {13104#(<= main_~i~1 18)} assume true; {13104#(<= main_~i~1 18)} is VALID [2018-11-14 18:56:57,644 INFO L273 TraceCheckUtils]: 61: Hoare triple {13104#(<= main_~i~1 18)} assume !(~i~1 < 100000); {13085#false} is VALID [2018-11-14 18:56:57,644 INFO L256 TraceCheckUtils]: 62: Hoare triple {13085#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {13084#true} is VALID [2018-11-14 18:56:57,645 INFO L273 TraceCheckUtils]: 63: Hoare triple {13084#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {13084#true} is VALID [2018-11-14 18:56:57,645 INFO L273 TraceCheckUtils]: 64: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:57,645 INFO L273 TraceCheckUtils]: 65: Hoare triple {13084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:56:57,645 INFO L273 TraceCheckUtils]: 66: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:56:57,645 INFO L273 TraceCheckUtils]: 67: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:57,645 INFO L273 TraceCheckUtils]: 68: Hoare triple {13084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:56:57,646 INFO L273 TraceCheckUtils]: 69: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:56:57,646 INFO L273 TraceCheckUtils]: 70: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:57,646 INFO L273 TraceCheckUtils]: 71: Hoare triple {13084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:56:57,646 INFO L273 TraceCheckUtils]: 72: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:56:57,646 INFO L273 TraceCheckUtils]: 73: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:57,647 INFO L273 TraceCheckUtils]: 74: Hoare triple {13084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:56:57,647 INFO L273 TraceCheckUtils]: 75: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:56:57,647 INFO L273 TraceCheckUtils]: 76: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:57,647 INFO L273 TraceCheckUtils]: 77: Hoare triple {13084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:56:57,647 INFO L273 TraceCheckUtils]: 78: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:56:57,647 INFO L273 TraceCheckUtils]: 79: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:57,647 INFO L273 TraceCheckUtils]: 80: Hoare triple {13084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:56:57,647 INFO L273 TraceCheckUtils]: 81: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:56:57,647 INFO L273 TraceCheckUtils]: 82: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:57,648 INFO L273 TraceCheckUtils]: 83: Hoare triple {13084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:56:57,648 INFO L273 TraceCheckUtils]: 84: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:56:57,648 INFO L273 TraceCheckUtils]: 85: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:57,648 INFO L273 TraceCheckUtils]: 86: Hoare triple {13084#true} assume !(~i~0 < 100000); {13084#true} is VALID [2018-11-14 18:56:57,648 INFO L273 TraceCheckUtils]: 87: Hoare triple {13084#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {13084#true} is VALID [2018-11-14 18:56:57,648 INFO L273 TraceCheckUtils]: 88: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:57,648 INFO L268 TraceCheckUtils]: 89: Hoare quadruple {13084#true} {13085#false} #73#return; {13085#false} is VALID [2018-11-14 18:56:57,648 INFO L273 TraceCheckUtils]: 90: Hoare triple {13085#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {13085#false} is VALID [2018-11-14 18:56:57,648 INFO L256 TraceCheckUtils]: 91: Hoare triple {13085#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {13084#true} is VALID [2018-11-14 18:56:57,649 INFO L273 TraceCheckUtils]: 92: Hoare triple {13084#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {13084#true} is VALID [2018-11-14 18:56:57,649 INFO L273 TraceCheckUtils]: 93: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:57,649 INFO L273 TraceCheckUtils]: 94: Hoare triple {13084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:56:57,649 INFO L273 TraceCheckUtils]: 95: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:56:57,649 INFO L273 TraceCheckUtils]: 96: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:57,649 INFO L273 TraceCheckUtils]: 97: Hoare triple {13084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:56:57,649 INFO L273 TraceCheckUtils]: 98: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:56:57,649 INFO L273 TraceCheckUtils]: 99: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:57,649 INFO L273 TraceCheckUtils]: 100: Hoare triple {13084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:56:57,649 INFO L273 TraceCheckUtils]: 101: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:56:57,650 INFO L273 TraceCheckUtils]: 102: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:57,650 INFO L273 TraceCheckUtils]: 103: Hoare triple {13084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:56:57,650 INFO L273 TraceCheckUtils]: 104: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:56:57,650 INFO L273 TraceCheckUtils]: 105: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:57,650 INFO L273 TraceCheckUtils]: 106: Hoare triple {13084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:56:57,650 INFO L273 TraceCheckUtils]: 107: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:56:57,650 INFO L273 TraceCheckUtils]: 108: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:57,650 INFO L273 TraceCheckUtils]: 109: Hoare triple {13084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:56:57,650 INFO L273 TraceCheckUtils]: 110: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:56:57,651 INFO L273 TraceCheckUtils]: 111: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:57,651 INFO L273 TraceCheckUtils]: 112: Hoare triple {13084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:56:57,651 INFO L273 TraceCheckUtils]: 113: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:56:57,651 INFO L273 TraceCheckUtils]: 114: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:57,651 INFO L273 TraceCheckUtils]: 115: Hoare triple {13084#true} assume !(~i~0 < 100000); {13084#true} is VALID [2018-11-14 18:56:57,651 INFO L273 TraceCheckUtils]: 116: Hoare triple {13084#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {13084#true} is VALID [2018-11-14 18:56:57,651 INFO L273 TraceCheckUtils]: 117: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:57,651 INFO L268 TraceCheckUtils]: 118: Hoare quadruple {13084#true} {13085#false} #75#return; {13085#false} is VALID [2018-11-14 18:56:57,651 INFO L273 TraceCheckUtils]: 119: Hoare triple {13085#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {13085#false} is VALID [2018-11-14 18:56:57,652 INFO L273 TraceCheckUtils]: 120: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 18:56:57,652 INFO L273 TraceCheckUtils]: 121: Hoare triple {13085#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {13085#false} is VALID [2018-11-14 18:56:57,652 INFO L273 TraceCheckUtils]: 122: Hoare triple {13085#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {13085#false} is VALID [2018-11-14 18:56:57,652 INFO L273 TraceCheckUtils]: 123: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 18:56:57,652 INFO L273 TraceCheckUtils]: 124: Hoare triple {13085#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {13085#false} is VALID [2018-11-14 18:56:57,652 INFO L273 TraceCheckUtils]: 125: Hoare triple {13085#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {13085#false} is VALID [2018-11-14 18:56:57,652 INFO L273 TraceCheckUtils]: 126: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 18:56:57,652 INFO L273 TraceCheckUtils]: 127: Hoare triple {13085#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {13085#false} is VALID [2018-11-14 18:56:57,652 INFO L273 TraceCheckUtils]: 128: Hoare triple {13085#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {13085#false} is VALID [2018-11-14 18:56:57,653 INFO L273 TraceCheckUtils]: 129: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 18:56:57,653 INFO L273 TraceCheckUtils]: 130: Hoare triple {13085#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {13085#false} is VALID [2018-11-14 18:56:57,653 INFO L273 TraceCheckUtils]: 131: Hoare triple {13085#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {13085#false} is VALID [2018-11-14 18:56:57,653 INFO L273 TraceCheckUtils]: 132: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 18:56:57,653 INFO L273 TraceCheckUtils]: 133: Hoare triple {13085#false} assume !(~i~2 < 99999); {13085#false} is VALID [2018-11-14 18:56:57,653 INFO L273 TraceCheckUtils]: 134: Hoare triple {13085#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {13085#false} is VALID [2018-11-14 18:56:57,653 INFO L256 TraceCheckUtils]: 135: Hoare triple {13085#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {13084#true} is VALID [2018-11-14 18:56:57,653 INFO L273 TraceCheckUtils]: 136: Hoare triple {13084#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {13084#true} is VALID [2018-11-14 18:56:57,653 INFO L273 TraceCheckUtils]: 137: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:57,653 INFO L273 TraceCheckUtils]: 138: Hoare triple {13084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:56:57,654 INFO L273 TraceCheckUtils]: 139: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:56:57,654 INFO L273 TraceCheckUtils]: 140: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:57,654 INFO L273 TraceCheckUtils]: 141: Hoare triple {13084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:56:57,654 INFO L273 TraceCheckUtils]: 142: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:56:57,654 INFO L273 TraceCheckUtils]: 143: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:57,654 INFO L273 TraceCheckUtils]: 144: Hoare triple {13084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:56:57,654 INFO L273 TraceCheckUtils]: 145: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:56:57,655 INFO L273 TraceCheckUtils]: 146: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:57,655 INFO L273 TraceCheckUtils]: 147: Hoare triple {13084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:56:57,655 INFO L273 TraceCheckUtils]: 148: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:56:57,655 INFO L273 TraceCheckUtils]: 149: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:57,655 INFO L273 TraceCheckUtils]: 150: Hoare triple {13084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:56:57,655 INFO L273 TraceCheckUtils]: 151: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:56:57,656 INFO L273 TraceCheckUtils]: 152: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:57,656 INFO L273 TraceCheckUtils]: 153: Hoare triple {13084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:56:57,656 INFO L273 TraceCheckUtils]: 154: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:56:57,656 INFO L273 TraceCheckUtils]: 155: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:57,656 INFO L273 TraceCheckUtils]: 156: Hoare triple {13084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:56:57,656 INFO L273 TraceCheckUtils]: 157: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:56:57,656 INFO L273 TraceCheckUtils]: 158: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:57,657 INFO L273 TraceCheckUtils]: 159: Hoare triple {13084#true} assume !(~i~0 < 100000); {13084#true} is VALID [2018-11-14 18:56:57,657 INFO L273 TraceCheckUtils]: 160: Hoare triple {13084#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {13084#true} is VALID [2018-11-14 18:56:57,657 INFO L273 TraceCheckUtils]: 161: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:57,657 INFO L268 TraceCheckUtils]: 162: Hoare quadruple {13084#true} {13085#false} #77#return; {13085#false} is VALID [2018-11-14 18:56:57,657 INFO L273 TraceCheckUtils]: 163: Hoare triple {13085#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {13085#false} is VALID [2018-11-14 18:56:57,657 INFO L273 TraceCheckUtils]: 164: Hoare triple {13085#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {13085#false} is VALID [2018-11-14 18:56:57,657 INFO L273 TraceCheckUtils]: 165: Hoare triple {13085#false} assume !false; {13085#false} is VALID [2018-11-14 18:56:57,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1295 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2018-11-14 18:56:57,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:56:57,671 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-14 18:56:57,679 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 18:56:58,148 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-11-14 18:56:58,148 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:56:58,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:56:58,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:56:58,448 INFO L256 TraceCheckUtils]: 0: Hoare triple {13084#true} call ULTIMATE.init(); {13084#true} is VALID [2018-11-14 18:56:58,449 INFO L273 TraceCheckUtils]: 1: Hoare triple {13084#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13084#true} is VALID [2018-11-14 18:56:58,449 INFO L273 TraceCheckUtils]: 2: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:58,449 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13084#true} {13084#true} #69#return; {13084#true} is VALID [2018-11-14 18:56:58,449 INFO L256 TraceCheckUtils]: 4: Hoare triple {13084#true} call #t~ret13 := main(); {13084#true} is VALID [2018-11-14 18:56:58,450 INFO L273 TraceCheckUtils]: 5: Hoare triple {13084#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; {13084#true} is VALID [2018-11-14 18:56:58,450 INFO L273 TraceCheckUtils]: 6: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:58,450 INFO L273 TraceCheckUtils]: 7: Hoare triple {13084#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 18:56:58,450 INFO L273 TraceCheckUtils]: 8: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 18:56:58,451 INFO L273 TraceCheckUtils]: 9: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:58,451 INFO L273 TraceCheckUtils]: 10: Hoare triple {13084#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 18:56:58,451 INFO L273 TraceCheckUtils]: 11: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 18:56:58,451 INFO L273 TraceCheckUtils]: 12: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:58,451 INFO L273 TraceCheckUtils]: 13: Hoare triple {13084#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 18:56:58,452 INFO L273 TraceCheckUtils]: 14: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 18:56:58,452 INFO L273 TraceCheckUtils]: 15: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:58,452 INFO L273 TraceCheckUtils]: 16: Hoare triple {13084#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 18:56:58,452 INFO L273 TraceCheckUtils]: 17: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 18:56:58,452 INFO L273 TraceCheckUtils]: 18: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:58,452 INFO L273 TraceCheckUtils]: 19: Hoare triple {13084#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 18:56:58,453 INFO L273 TraceCheckUtils]: 20: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 18:56:58,453 INFO L273 TraceCheckUtils]: 21: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:58,453 INFO L273 TraceCheckUtils]: 22: Hoare triple {13084#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 18:56:58,453 INFO L273 TraceCheckUtils]: 23: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 18:56:58,453 INFO L273 TraceCheckUtils]: 24: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:58,453 INFO L273 TraceCheckUtils]: 25: Hoare triple {13084#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 18:56:58,454 INFO L273 TraceCheckUtils]: 26: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 18:56:58,454 INFO L273 TraceCheckUtils]: 27: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:58,454 INFO L273 TraceCheckUtils]: 28: Hoare triple {13084#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 18:56:58,454 INFO L273 TraceCheckUtils]: 29: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 18:56:58,454 INFO L273 TraceCheckUtils]: 30: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:58,454 INFO L273 TraceCheckUtils]: 31: Hoare triple {13084#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 18:56:58,454 INFO L273 TraceCheckUtils]: 32: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 18:56:58,455 INFO L273 TraceCheckUtils]: 33: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:58,455 INFO L273 TraceCheckUtils]: 34: Hoare triple {13084#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 18:56:58,455 INFO L273 TraceCheckUtils]: 35: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 18:56:58,455 INFO L273 TraceCheckUtils]: 36: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:58,455 INFO L273 TraceCheckUtils]: 37: Hoare triple {13084#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 18:56:58,455 INFO L273 TraceCheckUtils]: 38: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 18:56:58,456 INFO L273 TraceCheckUtils]: 39: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:58,456 INFO L273 TraceCheckUtils]: 40: Hoare triple {13084#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 18:56:58,456 INFO L273 TraceCheckUtils]: 41: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 18:56:58,456 INFO L273 TraceCheckUtils]: 42: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:58,456 INFO L273 TraceCheckUtils]: 43: Hoare triple {13084#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 18:56:58,456 INFO L273 TraceCheckUtils]: 44: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 18:56:58,457 INFO L273 TraceCheckUtils]: 45: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:58,457 INFO L273 TraceCheckUtils]: 46: Hoare triple {13084#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 18:56:58,457 INFO L273 TraceCheckUtils]: 47: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 18:56:58,457 INFO L273 TraceCheckUtils]: 48: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:58,457 INFO L273 TraceCheckUtils]: 49: Hoare triple {13084#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 18:56:58,458 INFO L273 TraceCheckUtils]: 50: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 18:56:58,458 INFO L273 TraceCheckUtils]: 51: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:58,458 INFO L273 TraceCheckUtils]: 52: Hoare triple {13084#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 18:56:58,458 INFO L273 TraceCheckUtils]: 53: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 18:56:58,458 INFO L273 TraceCheckUtils]: 54: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:58,458 INFO L273 TraceCheckUtils]: 55: Hoare triple {13084#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 18:56:58,459 INFO L273 TraceCheckUtils]: 56: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 18:56:58,459 INFO L273 TraceCheckUtils]: 57: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:58,459 INFO L273 TraceCheckUtils]: 58: Hoare triple {13084#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 18:56:58,459 INFO L273 TraceCheckUtils]: 59: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 18:56:58,459 INFO L273 TraceCheckUtils]: 60: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:58,459 INFO L273 TraceCheckUtils]: 61: Hoare triple {13084#true} assume !(~i~1 < 100000); {13084#true} is VALID [2018-11-14 18:56:58,459 INFO L256 TraceCheckUtils]: 62: Hoare triple {13084#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {13084#true} is VALID [2018-11-14 18:56:58,459 INFO L273 TraceCheckUtils]: 63: Hoare triple {13084#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {13084#true} is VALID [2018-11-14 18:56:58,460 INFO L273 TraceCheckUtils]: 64: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:58,460 INFO L273 TraceCheckUtils]: 65: Hoare triple {13084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:56:58,460 INFO L273 TraceCheckUtils]: 66: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:56:58,460 INFO L273 TraceCheckUtils]: 67: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:58,460 INFO L273 TraceCheckUtils]: 68: Hoare triple {13084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:56:58,460 INFO L273 TraceCheckUtils]: 69: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:56:58,460 INFO L273 TraceCheckUtils]: 70: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:58,461 INFO L273 TraceCheckUtils]: 71: Hoare triple {13084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:56:58,461 INFO L273 TraceCheckUtils]: 72: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:56:58,461 INFO L273 TraceCheckUtils]: 73: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:58,461 INFO L273 TraceCheckUtils]: 74: Hoare triple {13084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:56:58,461 INFO L273 TraceCheckUtils]: 75: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:56:58,461 INFO L273 TraceCheckUtils]: 76: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:58,461 INFO L273 TraceCheckUtils]: 77: Hoare triple {13084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:56:58,462 INFO L273 TraceCheckUtils]: 78: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:56:58,462 INFO L273 TraceCheckUtils]: 79: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:58,462 INFO L273 TraceCheckUtils]: 80: Hoare triple {13084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:56:58,462 INFO L273 TraceCheckUtils]: 81: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:56:58,462 INFO L273 TraceCheckUtils]: 82: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:58,462 INFO L273 TraceCheckUtils]: 83: Hoare triple {13084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:56:58,462 INFO L273 TraceCheckUtils]: 84: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:56:58,463 INFO L273 TraceCheckUtils]: 85: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:58,463 INFO L273 TraceCheckUtils]: 86: Hoare triple {13084#true} assume !(~i~0 < 100000); {13084#true} is VALID [2018-11-14 18:56:58,463 INFO L273 TraceCheckUtils]: 87: Hoare triple {13084#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {13084#true} is VALID [2018-11-14 18:56:58,463 INFO L273 TraceCheckUtils]: 88: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:58,463 INFO L268 TraceCheckUtils]: 89: Hoare quadruple {13084#true} {13084#true} #73#return; {13084#true} is VALID [2018-11-14 18:56:58,463 INFO L273 TraceCheckUtils]: 90: Hoare triple {13084#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {13084#true} is VALID [2018-11-14 18:56:58,463 INFO L256 TraceCheckUtils]: 91: Hoare triple {13084#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {13084#true} is VALID [2018-11-14 18:56:58,464 INFO L273 TraceCheckUtils]: 92: Hoare triple {13084#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {13084#true} is VALID [2018-11-14 18:56:58,464 INFO L273 TraceCheckUtils]: 93: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:58,464 INFO L273 TraceCheckUtils]: 94: Hoare triple {13084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:56:58,464 INFO L273 TraceCheckUtils]: 95: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:56:58,464 INFO L273 TraceCheckUtils]: 96: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:58,464 INFO L273 TraceCheckUtils]: 97: Hoare triple {13084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:56:58,464 INFO L273 TraceCheckUtils]: 98: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:56:58,465 INFO L273 TraceCheckUtils]: 99: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:58,465 INFO L273 TraceCheckUtils]: 100: Hoare triple {13084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:56:58,465 INFO L273 TraceCheckUtils]: 101: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:56:58,465 INFO L273 TraceCheckUtils]: 102: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:58,465 INFO L273 TraceCheckUtils]: 103: Hoare triple {13084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:56:58,465 INFO L273 TraceCheckUtils]: 104: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:56:58,466 INFO L273 TraceCheckUtils]: 105: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:58,466 INFO L273 TraceCheckUtils]: 106: Hoare triple {13084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:56:58,466 INFO L273 TraceCheckUtils]: 107: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:56:58,466 INFO L273 TraceCheckUtils]: 108: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:58,466 INFO L273 TraceCheckUtils]: 109: Hoare triple {13084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:56:58,466 INFO L273 TraceCheckUtils]: 110: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:56:58,467 INFO L273 TraceCheckUtils]: 111: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:58,467 INFO L273 TraceCheckUtils]: 112: Hoare triple {13084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 18:56:58,467 INFO L273 TraceCheckUtils]: 113: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 18:56:58,467 INFO L273 TraceCheckUtils]: 114: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:58,467 INFO L273 TraceCheckUtils]: 115: Hoare triple {13084#true} assume !(~i~0 < 100000); {13084#true} is VALID [2018-11-14 18:56:58,467 INFO L273 TraceCheckUtils]: 116: Hoare triple {13084#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {13084#true} is VALID [2018-11-14 18:56:58,468 INFO L273 TraceCheckUtils]: 117: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 18:56:58,468 INFO L268 TraceCheckUtils]: 118: Hoare quadruple {13084#true} {13084#true} #75#return; {13084#true} is VALID [2018-11-14 18:56:58,469 INFO L273 TraceCheckUtils]: 119: Hoare triple {13084#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {13465#(<= main_~i~2 0)} is VALID [2018-11-14 18:56:58,469 INFO L273 TraceCheckUtils]: 120: Hoare triple {13465#(<= main_~i~2 0)} assume true; {13465#(<= main_~i~2 0)} is VALID [2018-11-14 18:56:58,473 INFO L273 TraceCheckUtils]: 121: Hoare triple {13465#(<= main_~i~2 0)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {13465#(<= main_~i~2 0)} is VALID [2018-11-14 18:56:58,474 INFO L273 TraceCheckUtils]: 122: Hoare triple {13465#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {13475#(<= main_~i~2 1)} is VALID [2018-11-14 18:56:58,474 INFO L273 TraceCheckUtils]: 123: Hoare triple {13475#(<= main_~i~2 1)} assume true; {13475#(<= main_~i~2 1)} is VALID [2018-11-14 18:56:58,476 INFO L273 TraceCheckUtils]: 124: Hoare triple {13475#(<= main_~i~2 1)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {13475#(<= main_~i~2 1)} is VALID [2018-11-14 18:56:58,477 INFO L273 TraceCheckUtils]: 125: Hoare triple {13475#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {13485#(<= main_~i~2 2)} is VALID [2018-11-14 18:56:58,478 INFO L273 TraceCheckUtils]: 126: Hoare triple {13485#(<= main_~i~2 2)} assume true; {13485#(<= main_~i~2 2)} is VALID [2018-11-14 18:56:58,480 INFO L273 TraceCheckUtils]: 127: Hoare triple {13485#(<= main_~i~2 2)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {13485#(<= main_~i~2 2)} is VALID [2018-11-14 18:56:58,483 INFO L273 TraceCheckUtils]: 128: Hoare triple {13485#(<= main_~i~2 2)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {13495#(<= main_~i~2 3)} is VALID [2018-11-14 18:56:58,483 INFO L273 TraceCheckUtils]: 129: Hoare triple {13495#(<= main_~i~2 3)} assume true; {13495#(<= main_~i~2 3)} is VALID [2018-11-14 18:56:58,486 INFO L273 TraceCheckUtils]: 130: Hoare triple {13495#(<= main_~i~2 3)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {13495#(<= main_~i~2 3)} is VALID [2018-11-14 18:56:58,486 INFO L273 TraceCheckUtils]: 131: Hoare triple {13495#(<= main_~i~2 3)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {13505#(<= main_~i~2 4)} is VALID [2018-11-14 18:56:58,489 INFO L273 TraceCheckUtils]: 132: Hoare triple {13505#(<= main_~i~2 4)} assume true; {13505#(<= main_~i~2 4)} is VALID [2018-11-14 18:56:58,489 INFO L273 TraceCheckUtils]: 133: Hoare triple {13505#(<= main_~i~2 4)} assume !(~i~2 < 99999); {13085#false} is VALID [2018-11-14 18:56:58,489 INFO L273 TraceCheckUtils]: 134: Hoare triple {13085#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {13085#false} is VALID [2018-11-14 18:56:58,489 INFO L256 TraceCheckUtils]: 135: Hoare triple {13085#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {13085#false} is VALID [2018-11-14 18:56:58,490 INFO L273 TraceCheckUtils]: 136: Hoare triple {13085#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {13085#false} is VALID [2018-11-14 18:56:58,490 INFO L273 TraceCheckUtils]: 137: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 18:56:58,490 INFO L273 TraceCheckUtils]: 138: Hoare triple {13085#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13085#false} is VALID [2018-11-14 18:56:58,490 INFO L273 TraceCheckUtils]: 139: Hoare triple {13085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13085#false} is VALID [2018-11-14 18:56:58,490 INFO L273 TraceCheckUtils]: 140: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 18:56:58,490 INFO L273 TraceCheckUtils]: 141: Hoare triple {13085#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13085#false} is VALID [2018-11-14 18:56:58,490 INFO L273 TraceCheckUtils]: 142: Hoare triple {13085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13085#false} is VALID [2018-11-14 18:56:58,491 INFO L273 TraceCheckUtils]: 143: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 18:56:58,491 INFO L273 TraceCheckUtils]: 144: Hoare triple {13085#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13085#false} is VALID [2018-11-14 18:56:58,491 INFO L273 TraceCheckUtils]: 145: Hoare triple {13085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13085#false} is VALID [2018-11-14 18:56:58,491 INFO L273 TraceCheckUtils]: 146: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 18:56:58,492 INFO L273 TraceCheckUtils]: 147: Hoare triple {13085#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13085#false} is VALID [2018-11-14 18:56:58,492 INFO L273 TraceCheckUtils]: 148: Hoare triple {13085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13085#false} is VALID [2018-11-14 18:56:58,492 INFO L273 TraceCheckUtils]: 149: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 18:56:58,492 INFO L273 TraceCheckUtils]: 150: Hoare triple {13085#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13085#false} is VALID [2018-11-14 18:56:58,492 INFO L273 TraceCheckUtils]: 151: Hoare triple {13085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13085#false} is VALID [2018-11-14 18:56:58,493 INFO L273 TraceCheckUtils]: 152: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 18:56:58,493 INFO L273 TraceCheckUtils]: 153: Hoare triple {13085#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13085#false} is VALID [2018-11-14 18:56:58,493 INFO L273 TraceCheckUtils]: 154: Hoare triple {13085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13085#false} is VALID [2018-11-14 18:56:58,493 INFO L273 TraceCheckUtils]: 155: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 18:56:58,493 INFO L273 TraceCheckUtils]: 156: Hoare triple {13085#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13085#false} is VALID [2018-11-14 18:56:58,493 INFO L273 TraceCheckUtils]: 157: Hoare triple {13085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13085#false} is VALID [2018-11-14 18:56:58,493 INFO L273 TraceCheckUtils]: 158: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 18:56:58,493 INFO L273 TraceCheckUtils]: 159: Hoare triple {13085#false} assume !(~i~0 < 100000); {13085#false} is VALID [2018-11-14 18:56:58,494 INFO L273 TraceCheckUtils]: 160: Hoare triple {13085#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {13085#false} is VALID [2018-11-14 18:56:58,494 INFO L273 TraceCheckUtils]: 161: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 18:56:58,494 INFO L268 TraceCheckUtils]: 162: Hoare quadruple {13085#false} {13085#false} #77#return; {13085#false} is VALID [2018-11-14 18:56:58,494 INFO L273 TraceCheckUtils]: 163: Hoare triple {13085#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {13085#false} is VALID [2018-11-14 18:56:58,494 INFO L273 TraceCheckUtils]: 164: Hoare triple {13085#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {13085#false} is VALID [2018-11-14 18:56:58,494 INFO L273 TraceCheckUtils]: 165: Hoare triple {13085#false} assume !false; {13085#false} is VALID [2018-11-14 18:56:58,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1295 backedges. 362 proven. 26 refuted. 0 times theorem prover too weak. 907 trivial. 0 not checked. [2018-11-14 18:56:58,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:56:58,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7] total 26 [2018-11-14 18:56:58,553 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 166 [2018-11-14 18:56:58,553 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:56:58,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-14 18:56:58,699 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-14 18:56:58,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-14 18:56:58,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-14 18:56:58,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2018-11-14 18:56:58,700 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand 26 states. [2018-11-14 18:56:59,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:59,398 INFO L93 Difference]: Finished difference Result 172 states and 181 transitions. [2018-11-14 18:56:59,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-14 18:56:59,399 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 166 [2018-11-14 18:56:59,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:56:59,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 18:56:59,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 130 transitions. [2018-11-14 18:56:59,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 18:56:59,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 130 transitions. [2018-11-14 18:56:59,402 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 130 transitions. [2018-11-14 18:56:59,540 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-14 18:56:59,543 INFO L225 Difference]: With dead ends: 172 [2018-11-14 18:56:59,543 INFO L226 Difference]: Without dead ends: 121 [2018-11-14 18:56:59,544 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2018-11-14 18:56:59,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-14 18:56:59,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-11-14 18:56:59,587 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:56:59,587 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand 119 states. [2018-11-14 18:56:59,587 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 119 states. [2018-11-14 18:56:59,588 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 119 states. [2018-11-14 18:56:59,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:59,590 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2018-11-14 18:56:59,590 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2018-11-14 18:56:59,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:56:59,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:56:59,591 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 121 states. [2018-11-14 18:56:59,591 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 121 states. [2018-11-14 18:56:59,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:56:59,593 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2018-11-14 18:56:59,593 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2018-11-14 18:56:59,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:56:59,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:56:59,593 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:56:59,594 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:56:59,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-14 18:56:59,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2018-11-14 18:56:59,596 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 166 [2018-11-14 18:56:59,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:56:59,596 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2018-11-14 18:56:59,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-14 18:56:59,596 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2018-11-14 18:56:59,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-14 18:56:59,598 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:56:59,598 INFO L375 BasicCegarLoop]: trace histogram [24, 21, 21, 20, 19, 19, 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] [2018-11-14 18:56:59,598 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:56:59,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:56:59,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1361262355, now seen corresponding path program 19 times [2018-11-14 18:56:59,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:56:59,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:56:59,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:56:59,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:56:59,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:56:59,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:56:59,946 INFO L256 TraceCheckUtils]: 0: Hoare triple {14241#true} call ULTIMATE.init(); {14241#true} is VALID [2018-11-14 18:56:59,946 INFO L273 TraceCheckUtils]: 1: Hoare triple {14241#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14241#true} is VALID [2018-11-14 18:56:59,947 INFO L273 TraceCheckUtils]: 2: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 18:56:59,947 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14241#true} {14241#true} #69#return; {14241#true} is VALID [2018-11-14 18:56:59,947 INFO L256 TraceCheckUtils]: 4: Hoare triple {14241#true} call #t~ret13 := main(); {14241#true} is VALID [2018-11-14 18:56:59,947 INFO L273 TraceCheckUtils]: 5: Hoare triple {14241#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; {14243#(= main_~i~1 0)} is VALID [2018-11-14 18:56:59,948 INFO L273 TraceCheckUtils]: 6: Hoare triple {14243#(= main_~i~1 0)} assume true; {14243#(= main_~i~1 0)} is VALID [2018-11-14 18:56:59,948 INFO L273 TraceCheckUtils]: 7: Hoare triple {14243#(= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {14243#(= main_~i~1 0)} is VALID [2018-11-14 18:56:59,949 INFO L273 TraceCheckUtils]: 8: Hoare triple {14243#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14244#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:59,949 INFO L273 TraceCheckUtils]: 9: Hoare triple {14244#(<= main_~i~1 1)} assume true; {14244#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:59,949 INFO L273 TraceCheckUtils]: 10: Hoare triple {14244#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {14244#(<= main_~i~1 1)} is VALID [2018-11-14 18:56:59,950 INFO L273 TraceCheckUtils]: 11: Hoare triple {14244#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14245#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:59,950 INFO L273 TraceCheckUtils]: 12: Hoare triple {14245#(<= main_~i~1 2)} assume true; {14245#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:59,950 INFO L273 TraceCheckUtils]: 13: Hoare triple {14245#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {14245#(<= main_~i~1 2)} is VALID [2018-11-14 18:56:59,951 INFO L273 TraceCheckUtils]: 14: Hoare triple {14245#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14246#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:59,951 INFO L273 TraceCheckUtils]: 15: Hoare triple {14246#(<= main_~i~1 3)} assume true; {14246#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:59,951 INFO L273 TraceCheckUtils]: 16: Hoare triple {14246#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {14246#(<= main_~i~1 3)} is VALID [2018-11-14 18:56:59,952 INFO L273 TraceCheckUtils]: 17: Hoare triple {14246#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14247#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:59,953 INFO L273 TraceCheckUtils]: 18: Hoare triple {14247#(<= main_~i~1 4)} assume true; {14247#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:59,953 INFO L273 TraceCheckUtils]: 19: Hoare triple {14247#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {14247#(<= main_~i~1 4)} is VALID [2018-11-14 18:56:59,954 INFO L273 TraceCheckUtils]: 20: Hoare triple {14247#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14248#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:59,954 INFO L273 TraceCheckUtils]: 21: Hoare triple {14248#(<= main_~i~1 5)} assume true; {14248#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:59,955 INFO L273 TraceCheckUtils]: 22: Hoare triple {14248#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {14248#(<= main_~i~1 5)} is VALID [2018-11-14 18:56:59,955 INFO L273 TraceCheckUtils]: 23: Hoare triple {14248#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14249#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:59,956 INFO L273 TraceCheckUtils]: 24: Hoare triple {14249#(<= main_~i~1 6)} assume true; {14249#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:59,956 INFO L273 TraceCheckUtils]: 25: Hoare triple {14249#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {14249#(<= main_~i~1 6)} is VALID [2018-11-14 18:56:59,957 INFO L273 TraceCheckUtils]: 26: Hoare triple {14249#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14250#(<= main_~i~1 7)} is VALID [2018-11-14 18:56:59,958 INFO L273 TraceCheckUtils]: 27: Hoare triple {14250#(<= main_~i~1 7)} assume true; {14250#(<= main_~i~1 7)} is VALID [2018-11-14 18:56:59,958 INFO L273 TraceCheckUtils]: 28: Hoare triple {14250#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {14250#(<= main_~i~1 7)} is VALID [2018-11-14 18:56:59,959 INFO L273 TraceCheckUtils]: 29: Hoare triple {14250#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14251#(<= main_~i~1 8)} is VALID [2018-11-14 18:56:59,959 INFO L273 TraceCheckUtils]: 30: Hoare triple {14251#(<= main_~i~1 8)} assume true; {14251#(<= main_~i~1 8)} is VALID [2018-11-14 18:56:59,960 INFO L273 TraceCheckUtils]: 31: Hoare triple {14251#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {14251#(<= main_~i~1 8)} is VALID [2018-11-14 18:56:59,960 INFO L273 TraceCheckUtils]: 32: Hoare triple {14251#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14252#(<= main_~i~1 9)} is VALID [2018-11-14 18:56:59,961 INFO L273 TraceCheckUtils]: 33: Hoare triple {14252#(<= main_~i~1 9)} assume true; {14252#(<= main_~i~1 9)} is VALID [2018-11-14 18:56:59,961 INFO L273 TraceCheckUtils]: 34: Hoare triple {14252#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {14252#(<= main_~i~1 9)} is VALID [2018-11-14 18:56:59,962 INFO L273 TraceCheckUtils]: 35: Hoare triple {14252#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14253#(<= main_~i~1 10)} is VALID [2018-11-14 18:56:59,962 INFO L273 TraceCheckUtils]: 36: Hoare triple {14253#(<= main_~i~1 10)} assume true; {14253#(<= main_~i~1 10)} is VALID [2018-11-14 18:56:59,963 INFO L273 TraceCheckUtils]: 37: Hoare triple {14253#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {14253#(<= main_~i~1 10)} is VALID [2018-11-14 18:56:59,964 INFO L273 TraceCheckUtils]: 38: Hoare triple {14253#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14254#(<= main_~i~1 11)} is VALID [2018-11-14 18:56:59,964 INFO L273 TraceCheckUtils]: 39: Hoare triple {14254#(<= main_~i~1 11)} assume true; {14254#(<= main_~i~1 11)} is VALID [2018-11-14 18:56:59,964 INFO L273 TraceCheckUtils]: 40: Hoare triple {14254#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {14254#(<= main_~i~1 11)} is VALID [2018-11-14 18:56:59,965 INFO L273 TraceCheckUtils]: 41: Hoare triple {14254#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14255#(<= main_~i~1 12)} is VALID [2018-11-14 18:56:59,966 INFO L273 TraceCheckUtils]: 42: Hoare triple {14255#(<= main_~i~1 12)} assume true; {14255#(<= main_~i~1 12)} is VALID [2018-11-14 18:56:59,966 INFO L273 TraceCheckUtils]: 43: Hoare triple {14255#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {14255#(<= main_~i~1 12)} is VALID [2018-11-14 18:56:59,971 INFO L273 TraceCheckUtils]: 44: Hoare triple {14255#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14256#(<= main_~i~1 13)} is VALID [2018-11-14 18:56:59,972 INFO L273 TraceCheckUtils]: 45: Hoare triple {14256#(<= main_~i~1 13)} assume true; {14256#(<= main_~i~1 13)} is VALID [2018-11-14 18:56:59,972 INFO L273 TraceCheckUtils]: 46: Hoare triple {14256#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {14256#(<= main_~i~1 13)} is VALID [2018-11-14 18:56:59,972 INFO L273 TraceCheckUtils]: 47: Hoare triple {14256#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14257#(<= main_~i~1 14)} is VALID [2018-11-14 18:56:59,973 INFO L273 TraceCheckUtils]: 48: Hoare triple {14257#(<= main_~i~1 14)} assume true; {14257#(<= main_~i~1 14)} is VALID [2018-11-14 18:56:59,973 INFO L273 TraceCheckUtils]: 49: Hoare triple {14257#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {14257#(<= main_~i~1 14)} is VALID [2018-11-14 18:56:59,973 INFO L273 TraceCheckUtils]: 50: Hoare triple {14257#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14258#(<= main_~i~1 15)} is VALID [2018-11-14 18:56:59,974 INFO L273 TraceCheckUtils]: 51: Hoare triple {14258#(<= main_~i~1 15)} assume true; {14258#(<= main_~i~1 15)} is VALID [2018-11-14 18:56:59,974 INFO L273 TraceCheckUtils]: 52: Hoare triple {14258#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {14258#(<= main_~i~1 15)} is VALID [2018-11-14 18:56:59,975 INFO L273 TraceCheckUtils]: 53: Hoare triple {14258#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14259#(<= main_~i~1 16)} is VALID [2018-11-14 18:56:59,975 INFO L273 TraceCheckUtils]: 54: Hoare triple {14259#(<= main_~i~1 16)} assume true; {14259#(<= main_~i~1 16)} is VALID [2018-11-14 18:56:59,975 INFO L273 TraceCheckUtils]: 55: Hoare triple {14259#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {14259#(<= main_~i~1 16)} is VALID [2018-11-14 18:56:59,976 INFO L273 TraceCheckUtils]: 56: Hoare triple {14259#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14260#(<= main_~i~1 17)} is VALID [2018-11-14 18:56:59,977 INFO L273 TraceCheckUtils]: 57: Hoare triple {14260#(<= main_~i~1 17)} assume true; {14260#(<= main_~i~1 17)} is VALID [2018-11-14 18:56:59,977 INFO L273 TraceCheckUtils]: 58: Hoare triple {14260#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {14260#(<= main_~i~1 17)} is VALID [2018-11-14 18:56:59,978 INFO L273 TraceCheckUtils]: 59: Hoare triple {14260#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14261#(<= main_~i~1 18)} is VALID [2018-11-14 18:56:59,978 INFO L273 TraceCheckUtils]: 60: Hoare triple {14261#(<= main_~i~1 18)} assume true; {14261#(<= main_~i~1 18)} is VALID [2018-11-14 18:56:59,979 INFO L273 TraceCheckUtils]: 61: Hoare triple {14261#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {14261#(<= main_~i~1 18)} is VALID [2018-11-14 18:56:59,979 INFO L273 TraceCheckUtils]: 62: Hoare triple {14261#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14262#(<= main_~i~1 19)} is VALID [2018-11-14 18:56:59,980 INFO L273 TraceCheckUtils]: 63: Hoare triple {14262#(<= main_~i~1 19)} assume true; {14262#(<= main_~i~1 19)} is VALID [2018-11-14 18:56:59,980 INFO L273 TraceCheckUtils]: 64: Hoare triple {14262#(<= main_~i~1 19)} assume !(~i~1 < 100000); {14242#false} is VALID [2018-11-14 18:56:59,981 INFO L256 TraceCheckUtils]: 65: Hoare triple {14242#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {14241#true} is VALID [2018-11-14 18:56:59,981 INFO L273 TraceCheckUtils]: 66: Hoare triple {14241#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {14241#true} is VALID [2018-11-14 18:56:59,981 INFO L273 TraceCheckUtils]: 67: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 18:56:59,981 INFO L273 TraceCheckUtils]: 68: Hoare triple {14241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 18:56:59,981 INFO L273 TraceCheckUtils]: 69: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 18:56:59,982 INFO L273 TraceCheckUtils]: 70: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 18:56:59,982 INFO L273 TraceCheckUtils]: 71: Hoare triple {14241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 18:56:59,982 INFO L273 TraceCheckUtils]: 72: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 18:56:59,982 INFO L273 TraceCheckUtils]: 73: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 18:56:59,982 INFO L273 TraceCheckUtils]: 74: Hoare triple {14241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 18:56:59,982 INFO L273 TraceCheckUtils]: 75: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 18:56:59,983 INFO L273 TraceCheckUtils]: 76: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 18:56:59,983 INFO L273 TraceCheckUtils]: 77: Hoare triple {14241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 18:56:59,983 INFO L273 TraceCheckUtils]: 78: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 18:56:59,983 INFO L273 TraceCheckUtils]: 79: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 18:56:59,983 INFO L273 TraceCheckUtils]: 80: Hoare triple {14241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 18:56:59,983 INFO L273 TraceCheckUtils]: 81: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 18:56:59,983 INFO L273 TraceCheckUtils]: 82: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 18:56:59,983 INFO L273 TraceCheckUtils]: 83: Hoare triple {14241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 18:56:59,984 INFO L273 TraceCheckUtils]: 84: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 18:56:59,984 INFO L273 TraceCheckUtils]: 85: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 18:56:59,984 INFO L273 TraceCheckUtils]: 86: Hoare triple {14241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 18:56:59,984 INFO L273 TraceCheckUtils]: 87: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 18:56:59,984 INFO L273 TraceCheckUtils]: 88: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 18:56:59,984 INFO L273 TraceCheckUtils]: 89: Hoare triple {14241#true} assume !(~i~0 < 100000); {14241#true} is VALID [2018-11-14 18:56:59,984 INFO L273 TraceCheckUtils]: 90: Hoare triple {14241#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {14241#true} is VALID [2018-11-14 18:56:59,984 INFO L273 TraceCheckUtils]: 91: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 18:56:59,984 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {14241#true} {14242#false} #73#return; {14242#false} is VALID [2018-11-14 18:56:59,985 INFO L273 TraceCheckUtils]: 93: Hoare triple {14242#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {14242#false} is VALID [2018-11-14 18:56:59,985 INFO L256 TraceCheckUtils]: 94: Hoare triple {14242#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {14241#true} is VALID [2018-11-14 18:56:59,985 INFO L273 TraceCheckUtils]: 95: Hoare triple {14241#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {14241#true} is VALID [2018-11-14 18:56:59,985 INFO L273 TraceCheckUtils]: 96: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 18:56:59,985 INFO L273 TraceCheckUtils]: 97: Hoare triple {14241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 18:56:59,985 INFO L273 TraceCheckUtils]: 98: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 18:56:59,985 INFO L273 TraceCheckUtils]: 99: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 18:56:59,986 INFO L273 TraceCheckUtils]: 100: Hoare triple {14241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 18:56:59,986 INFO L273 TraceCheckUtils]: 101: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 18:56:59,986 INFO L273 TraceCheckUtils]: 102: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 18:56:59,986 INFO L273 TraceCheckUtils]: 103: Hoare triple {14241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 18:56:59,986 INFO L273 TraceCheckUtils]: 104: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 18:56:59,986 INFO L273 TraceCheckUtils]: 105: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 18:56:59,986 INFO L273 TraceCheckUtils]: 106: Hoare triple {14241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 18:56:59,986 INFO L273 TraceCheckUtils]: 107: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 18:56:59,986 INFO L273 TraceCheckUtils]: 108: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 18:56:59,986 INFO L273 TraceCheckUtils]: 109: Hoare triple {14241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 18:56:59,987 INFO L273 TraceCheckUtils]: 110: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 18:56:59,987 INFO L273 TraceCheckUtils]: 111: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 18:56:59,987 INFO L273 TraceCheckUtils]: 112: Hoare triple {14241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 18:56:59,987 INFO L273 TraceCheckUtils]: 113: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 18:56:59,987 INFO L273 TraceCheckUtils]: 114: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 18:56:59,987 INFO L273 TraceCheckUtils]: 115: Hoare triple {14241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 18:56:59,987 INFO L273 TraceCheckUtils]: 116: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 18:56:59,987 INFO L273 TraceCheckUtils]: 117: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 18:56:59,987 INFO L273 TraceCheckUtils]: 118: Hoare triple {14241#true} assume !(~i~0 < 100000); {14241#true} is VALID [2018-11-14 18:56:59,988 INFO L273 TraceCheckUtils]: 119: Hoare triple {14241#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {14241#true} is VALID [2018-11-14 18:56:59,988 INFO L273 TraceCheckUtils]: 120: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 18:56:59,988 INFO L268 TraceCheckUtils]: 121: Hoare quadruple {14241#true} {14242#false} #75#return; {14242#false} is VALID [2018-11-14 18:56:59,988 INFO L273 TraceCheckUtils]: 122: Hoare triple {14242#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {14242#false} is VALID [2018-11-14 18:56:59,988 INFO L273 TraceCheckUtils]: 123: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 18:56:59,988 INFO L273 TraceCheckUtils]: 124: Hoare triple {14242#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {14242#false} is VALID [2018-11-14 18:56:59,988 INFO L273 TraceCheckUtils]: 125: Hoare triple {14242#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {14242#false} is VALID [2018-11-14 18:56:59,988 INFO L273 TraceCheckUtils]: 126: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 18:56:59,988 INFO L273 TraceCheckUtils]: 127: Hoare triple {14242#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {14242#false} is VALID [2018-11-14 18:56:59,988 INFO L273 TraceCheckUtils]: 128: Hoare triple {14242#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {14242#false} is VALID [2018-11-14 18:56:59,989 INFO L273 TraceCheckUtils]: 129: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 18:56:59,989 INFO L273 TraceCheckUtils]: 130: Hoare triple {14242#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {14242#false} is VALID [2018-11-14 18:56:59,989 INFO L273 TraceCheckUtils]: 131: Hoare triple {14242#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {14242#false} is VALID [2018-11-14 18:56:59,989 INFO L273 TraceCheckUtils]: 132: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 18:56:59,989 INFO L273 TraceCheckUtils]: 133: Hoare triple {14242#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {14242#false} is VALID [2018-11-14 18:56:59,989 INFO L273 TraceCheckUtils]: 134: Hoare triple {14242#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {14242#false} is VALID [2018-11-14 18:56:59,989 INFO L273 TraceCheckUtils]: 135: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 18:56:59,989 INFO L273 TraceCheckUtils]: 136: Hoare triple {14242#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {14242#false} is VALID [2018-11-14 18:56:59,989 INFO L273 TraceCheckUtils]: 137: Hoare triple {14242#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {14242#false} is VALID [2018-11-14 18:56:59,989 INFO L273 TraceCheckUtils]: 138: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 18:56:59,990 INFO L273 TraceCheckUtils]: 139: Hoare triple {14242#false} assume !(~i~2 < 99999); {14242#false} is VALID [2018-11-14 18:56:59,990 INFO L273 TraceCheckUtils]: 140: Hoare triple {14242#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {14242#false} is VALID [2018-11-14 18:56:59,990 INFO L256 TraceCheckUtils]: 141: Hoare triple {14242#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {14241#true} is VALID [2018-11-14 18:56:59,990 INFO L273 TraceCheckUtils]: 142: Hoare triple {14241#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {14241#true} is VALID [2018-11-14 18:56:59,990 INFO L273 TraceCheckUtils]: 143: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 18:56:59,990 INFO L273 TraceCheckUtils]: 144: Hoare triple {14241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 18:56:59,990 INFO L273 TraceCheckUtils]: 145: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 18:56:59,990 INFO L273 TraceCheckUtils]: 146: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 18:56:59,990 INFO L273 TraceCheckUtils]: 147: Hoare triple {14241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 18:56:59,990 INFO L273 TraceCheckUtils]: 148: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 18:56:59,991 INFO L273 TraceCheckUtils]: 149: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 18:56:59,991 INFO L273 TraceCheckUtils]: 150: Hoare triple {14241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 18:56:59,991 INFO L273 TraceCheckUtils]: 151: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 18:56:59,991 INFO L273 TraceCheckUtils]: 152: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 18:56:59,991 INFO L273 TraceCheckUtils]: 153: Hoare triple {14241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 18:56:59,991 INFO L273 TraceCheckUtils]: 154: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 18:56:59,991 INFO L273 TraceCheckUtils]: 155: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 18:56:59,991 INFO L273 TraceCheckUtils]: 156: Hoare triple {14241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 18:56:59,991 INFO L273 TraceCheckUtils]: 157: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 18:56:59,992 INFO L273 TraceCheckUtils]: 158: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 18:56:59,992 INFO L273 TraceCheckUtils]: 159: Hoare triple {14241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 18:56:59,992 INFO L273 TraceCheckUtils]: 160: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 18:56:59,992 INFO L273 TraceCheckUtils]: 161: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 18:56:59,992 INFO L273 TraceCheckUtils]: 162: Hoare triple {14241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 18:56:59,992 INFO L273 TraceCheckUtils]: 163: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 18:56:59,992 INFO L273 TraceCheckUtils]: 164: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 18:56:59,992 INFO L273 TraceCheckUtils]: 165: Hoare triple {14241#true} assume !(~i~0 < 100000); {14241#true} is VALID [2018-11-14 18:56:59,992 INFO L273 TraceCheckUtils]: 166: Hoare triple {14241#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {14241#true} is VALID [2018-11-14 18:56:59,992 INFO L273 TraceCheckUtils]: 167: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 18:56:59,993 INFO L268 TraceCheckUtils]: 168: Hoare quadruple {14241#true} {14242#false} #77#return; {14242#false} is VALID [2018-11-14 18:56:59,993 INFO L273 TraceCheckUtils]: 169: Hoare triple {14242#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {14242#false} is VALID [2018-11-14 18:56:59,993 INFO L273 TraceCheckUtils]: 170: Hoare triple {14242#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {14242#false} is VALID [2018-11-14 18:56:59,993 INFO L273 TraceCheckUtils]: 171: Hoare triple {14242#false} assume !false; {14242#false} is VALID [2018-11-14 18:57:00,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 814 trivial. 0 not checked. [2018-11-14 18:57:00,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:57:00,006 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-14 18:57:00,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:57:00,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:57:00,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:57:00,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:57:00,437 INFO L256 TraceCheckUtils]: 0: Hoare triple {14241#true} call ULTIMATE.init(); {14241#true} is VALID [2018-11-14 18:57:00,437 INFO L273 TraceCheckUtils]: 1: Hoare triple {14241#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14241#true} is VALID [2018-11-14 18:57:00,437 INFO L273 TraceCheckUtils]: 2: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 18:57:00,437 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14241#true} {14241#true} #69#return; {14241#true} is VALID [2018-11-14 18:57:00,437 INFO L256 TraceCheckUtils]: 4: Hoare triple {14241#true} call #t~ret13 := main(); {14241#true} is VALID [2018-11-14 18:57:00,438 INFO L273 TraceCheckUtils]: 5: Hoare triple {14241#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; {14281#(<= main_~i~1 0)} is VALID [2018-11-14 18:57:00,439 INFO L273 TraceCheckUtils]: 6: Hoare triple {14281#(<= main_~i~1 0)} assume true; {14281#(<= main_~i~1 0)} is VALID [2018-11-14 18:57:00,439 INFO L273 TraceCheckUtils]: 7: Hoare triple {14281#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {14281#(<= main_~i~1 0)} is VALID [2018-11-14 18:57:00,440 INFO L273 TraceCheckUtils]: 8: Hoare triple {14281#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14244#(<= main_~i~1 1)} is VALID [2018-11-14 18:57:00,440 INFO L273 TraceCheckUtils]: 9: Hoare triple {14244#(<= main_~i~1 1)} assume true; {14244#(<= main_~i~1 1)} is VALID [2018-11-14 18:57:00,441 INFO L273 TraceCheckUtils]: 10: Hoare triple {14244#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {14244#(<= main_~i~1 1)} is VALID [2018-11-14 18:57:00,442 INFO L273 TraceCheckUtils]: 11: Hoare triple {14244#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14245#(<= main_~i~1 2)} is VALID [2018-11-14 18:57:00,442 INFO L273 TraceCheckUtils]: 12: Hoare triple {14245#(<= main_~i~1 2)} assume true; {14245#(<= main_~i~1 2)} is VALID [2018-11-14 18:57:00,443 INFO L273 TraceCheckUtils]: 13: Hoare triple {14245#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {14245#(<= main_~i~1 2)} is VALID [2018-11-14 18:57:00,443 INFO L273 TraceCheckUtils]: 14: Hoare triple {14245#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14246#(<= main_~i~1 3)} is VALID [2018-11-14 18:57:00,444 INFO L273 TraceCheckUtils]: 15: Hoare triple {14246#(<= main_~i~1 3)} assume true; {14246#(<= main_~i~1 3)} is VALID [2018-11-14 18:57:00,444 INFO L273 TraceCheckUtils]: 16: Hoare triple {14246#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {14246#(<= main_~i~1 3)} is VALID [2018-11-14 18:57:00,445 INFO L273 TraceCheckUtils]: 17: Hoare triple {14246#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14247#(<= main_~i~1 4)} is VALID [2018-11-14 18:57:00,446 INFO L273 TraceCheckUtils]: 18: Hoare triple {14247#(<= main_~i~1 4)} assume true; {14247#(<= main_~i~1 4)} is VALID [2018-11-14 18:57:00,446 INFO L273 TraceCheckUtils]: 19: Hoare triple {14247#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {14247#(<= main_~i~1 4)} is VALID [2018-11-14 18:57:00,447 INFO L273 TraceCheckUtils]: 20: Hoare triple {14247#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14248#(<= main_~i~1 5)} is VALID [2018-11-14 18:57:00,447 INFO L273 TraceCheckUtils]: 21: Hoare triple {14248#(<= main_~i~1 5)} assume true; {14248#(<= main_~i~1 5)} is VALID [2018-11-14 18:57:00,448 INFO L273 TraceCheckUtils]: 22: Hoare triple {14248#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {14248#(<= main_~i~1 5)} is VALID [2018-11-14 18:57:00,448 INFO L273 TraceCheckUtils]: 23: Hoare triple {14248#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14249#(<= main_~i~1 6)} is VALID [2018-11-14 18:57:00,449 INFO L273 TraceCheckUtils]: 24: Hoare triple {14249#(<= main_~i~1 6)} assume true; {14249#(<= main_~i~1 6)} is VALID [2018-11-14 18:57:00,449 INFO L273 TraceCheckUtils]: 25: Hoare triple {14249#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {14249#(<= main_~i~1 6)} is VALID [2018-11-14 18:57:00,450 INFO L273 TraceCheckUtils]: 26: Hoare triple {14249#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14250#(<= main_~i~1 7)} is VALID [2018-11-14 18:57:00,451 INFO L273 TraceCheckUtils]: 27: Hoare triple {14250#(<= main_~i~1 7)} assume true; {14250#(<= main_~i~1 7)} is VALID [2018-11-14 18:57:00,451 INFO L273 TraceCheckUtils]: 28: Hoare triple {14250#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {14250#(<= main_~i~1 7)} is VALID [2018-11-14 18:57:00,452 INFO L273 TraceCheckUtils]: 29: Hoare triple {14250#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14251#(<= main_~i~1 8)} is VALID [2018-11-14 18:57:00,452 INFO L273 TraceCheckUtils]: 30: Hoare triple {14251#(<= main_~i~1 8)} assume true; {14251#(<= main_~i~1 8)} is VALID [2018-11-14 18:57:00,453 INFO L273 TraceCheckUtils]: 31: Hoare triple {14251#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {14251#(<= main_~i~1 8)} is VALID [2018-11-14 18:57:00,454 INFO L273 TraceCheckUtils]: 32: Hoare triple {14251#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14252#(<= main_~i~1 9)} is VALID [2018-11-14 18:57:00,454 INFO L273 TraceCheckUtils]: 33: Hoare triple {14252#(<= main_~i~1 9)} assume true; {14252#(<= main_~i~1 9)} is VALID [2018-11-14 18:57:00,455 INFO L273 TraceCheckUtils]: 34: Hoare triple {14252#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {14252#(<= main_~i~1 9)} is VALID [2018-11-14 18:57:00,455 INFO L273 TraceCheckUtils]: 35: Hoare triple {14252#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14253#(<= main_~i~1 10)} is VALID [2018-11-14 18:57:00,456 INFO L273 TraceCheckUtils]: 36: Hoare triple {14253#(<= main_~i~1 10)} assume true; {14253#(<= main_~i~1 10)} is VALID [2018-11-14 18:57:00,456 INFO L273 TraceCheckUtils]: 37: Hoare triple {14253#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {14253#(<= main_~i~1 10)} is VALID [2018-11-14 18:57:00,457 INFO L273 TraceCheckUtils]: 38: Hoare triple {14253#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14254#(<= main_~i~1 11)} is VALID [2018-11-14 18:57:00,458 INFO L273 TraceCheckUtils]: 39: Hoare triple {14254#(<= main_~i~1 11)} assume true; {14254#(<= main_~i~1 11)} is VALID [2018-11-14 18:57:00,458 INFO L273 TraceCheckUtils]: 40: Hoare triple {14254#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {14254#(<= main_~i~1 11)} is VALID [2018-11-14 18:57:00,459 INFO L273 TraceCheckUtils]: 41: Hoare triple {14254#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14255#(<= main_~i~1 12)} is VALID [2018-11-14 18:57:00,459 INFO L273 TraceCheckUtils]: 42: Hoare triple {14255#(<= main_~i~1 12)} assume true; {14255#(<= main_~i~1 12)} is VALID [2018-11-14 18:57:00,460 INFO L273 TraceCheckUtils]: 43: Hoare triple {14255#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {14255#(<= main_~i~1 12)} is VALID [2018-11-14 18:57:00,461 INFO L273 TraceCheckUtils]: 44: Hoare triple {14255#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14256#(<= main_~i~1 13)} is VALID [2018-11-14 18:57:00,461 INFO L273 TraceCheckUtils]: 45: Hoare triple {14256#(<= main_~i~1 13)} assume true; {14256#(<= main_~i~1 13)} is VALID [2018-11-14 18:57:00,462 INFO L273 TraceCheckUtils]: 46: Hoare triple {14256#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {14256#(<= main_~i~1 13)} is VALID [2018-11-14 18:57:00,462 INFO L273 TraceCheckUtils]: 47: Hoare triple {14256#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14257#(<= main_~i~1 14)} is VALID [2018-11-14 18:57:00,463 INFO L273 TraceCheckUtils]: 48: Hoare triple {14257#(<= main_~i~1 14)} assume true; {14257#(<= main_~i~1 14)} is VALID [2018-11-14 18:57:00,463 INFO L273 TraceCheckUtils]: 49: Hoare triple {14257#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {14257#(<= main_~i~1 14)} is VALID [2018-11-14 18:57:00,464 INFO L273 TraceCheckUtils]: 50: Hoare triple {14257#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14258#(<= main_~i~1 15)} is VALID [2018-11-14 18:57:00,465 INFO L273 TraceCheckUtils]: 51: Hoare triple {14258#(<= main_~i~1 15)} assume true; {14258#(<= main_~i~1 15)} is VALID [2018-11-14 18:57:00,465 INFO L273 TraceCheckUtils]: 52: Hoare triple {14258#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {14258#(<= main_~i~1 15)} is VALID [2018-11-14 18:57:00,466 INFO L273 TraceCheckUtils]: 53: Hoare triple {14258#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14259#(<= main_~i~1 16)} is VALID [2018-11-14 18:57:00,466 INFO L273 TraceCheckUtils]: 54: Hoare triple {14259#(<= main_~i~1 16)} assume true; {14259#(<= main_~i~1 16)} is VALID [2018-11-14 18:57:00,467 INFO L273 TraceCheckUtils]: 55: Hoare triple {14259#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {14259#(<= main_~i~1 16)} is VALID [2018-11-14 18:57:00,468 INFO L273 TraceCheckUtils]: 56: Hoare triple {14259#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14260#(<= main_~i~1 17)} is VALID [2018-11-14 18:57:00,468 INFO L273 TraceCheckUtils]: 57: Hoare triple {14260#(<= main_~i~1 17)} assume true; {14260#(<= main_~i~1 17)} is VALID [2018-11-14 18:57:00,469 INFO L273 TraceCheckUtils]: 58: Hoare triple {14260#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {14260#(<= main_~i~1 17)} is VALID [2018-11-14 18:57:00,469 INFO L273 TraceCheckUtils]: 59: Hoare triple {14260#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14261#(<= main_~i~1 18)} is VALID [2018-11-14 18:57:00,470 INFO L273 TraceCheckUtils]: 60: Hoare triple {14261#(<= main_~i~1 18)} assume true; {14261#(<= main_~i~1 18)} is VALID [2018-11-14 18:57:00,470 INFO L273 TraceCheckUtils]: 61: Hoare triple {14261#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {14261#(<= main_~i~1 18)} is VALID [2018-11-14 18:57:00,471 INFO L273 TraceCheckUtils]: 62: Hoare triple {14261#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14262#(<= main_~i~1 19)} is VALID [2018-11-14 18:57:00,472 INFO L273 TraceCheckUtils]: 63: Hoare triple {14262#(<= main_~i~1 19)} assume true; {14262#(<= main_~i~1 19)} is VALID [2018-11-14 18:57:00,472 INFO L273 TraceCheckUtils]: 64: Hoare triple {14262#(<= main_~i~1 19)} assume !(~i~1 < 100000); {14242#false} is VALID [2018-11-14 18:57:00,473 INFO L256 TraceCheckUtils]: 65: Hoare triple {14242#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {14242#false} is VALID [2018-11-14 18:57:00,473 INFO L273 TraceCheckUtils]: 66: Hoare triple {14242#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {14242#false} is VALID [2018-11-14 18:57:00,473 INFO L273 TraceCheckUtils]: 67: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 18:57:00,473 INFO L273 TraceCheckUtils]: 68: Hoare triple {14242#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 18:57:00,473 INFO L273 TraceCheckUtils]: 69: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 18:57:00,473 INFO L273 TraceCheckUtils]: 70: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 18:57:00,474 INFO L273 TraceCheckUtils]: 71: Hoare triple {14242#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 18:57:00,474 INFO L273 TraceCheckUtils]: 72: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 18:57:00,474 INFO L273 TraceCheckUtils]: 73: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 18:57:00,474 INFO L273 TraceCheckUtils]: 74: Hoare triple {14242#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 18:57:00,474 INFO L273 TraceCheckUtils]: 75: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 18:57:00,475 INFO L273 TraceCheckUtils]: 76: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 18:57:00,475 INFO L273 TraceCheckUtils]: 77: Hoare triple {14242#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 18:57:00,475 INFO L273 TraceCheckUtils]: 78: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 18:57:00,475 INFO L273 TraceCheckUtils]: 79: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 18:57:00,475 INFO L273 TraceCheckUtils]: 80: Hoare triple {14242#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 18:57:00,475 INFO L273 TraceCheckUtils]: 81: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 18:57:00,476 INFO L273 TraceCheckUtils]: 82: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 18:57:00,476 INFO L273 TraceCheckUtils]: 83: Hoare triple {14242#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 18:57:00,476 INFO L273 TraceCheckUtils]: 84: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 18:57:00,476 INFO L273 TraceCheckUtils]: 85: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 18:57:00,476 INFO L273 TraceCheckUtils]: 86: Hoare triple {14242#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 18:57:00,476 INFO L273 TraceCheckUtils]: 87: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 18:57:00,476 INFO L273 TraceCheckUtils]: 88: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 18:57:00,476 INFO L273 TraceCheckUtils]: 89: Hoare triple {14242#false} assume !(~i~0 < 100000); {14242#false} is VALID [2018-11-14 18:57:00,477 INFO L273 TraceCheckUtils]: 90: Hoare triple {14242#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {14242#false} is VALID [2018-11-14 18:57:00,477 INFO L273 TraceCheckUtils]: 91: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 18:57:00,477 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {14242#false} {14242#false} #73#return; {14242#false} is VALID [2018-11-14 18:57:00,477 INFO L273 TraceCheckUtils]: 93: Hoare triple {14242#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {14242#false} is VALID [2018-11-14 18:57:00,477 INFO L256 TraceCheckUtils]: 94: Hoare triple {14242#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {14242#false} is VALID [2018-11-14 18:57:00,477 INFO L273 TraceCheckUtils]: 95: Hoare triple {14242#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {14242#false} is VALID [2018-11-14 18:57:00,477 INFO L273 TraceCheckUtils]: 96: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 18:57:00,477 INFO L273 TraceCheckUtils]: 97: Hoare triple {14242#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 18:57:00,477 INFO L273 TraceCheckUtils]: 98: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 18:57:00,478 INFO L273 TraceCheckUtils]: 99: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 18:57:00,478 INFO L273 TraceCheckUtils]: 100: Hoare triple {14242#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 18:57:00,478 INFO L273 TraceCheckUtils]: 101: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 18:57:00,478 INFO L273 TraceCheckUtils]: 102: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 18:57:00,478 INFO L273 TraceCheckUtils]: 103: Hoare triple {14242#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 18:57:00,478 INFO L273 TraceCheckUtils]: 104: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 18:57:00,478 INFO L273 TraceCheckUtils]: 105: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 18:57:00,478 INFO L273 TraceCheckUtils]: 106: Hoare triple {14242#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 18:57:00,478 INFO L273 TraceCheckUtils]: 107: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 18:57:00,478 INFO L273 TraceCheckUtils]: 108: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 18:57:00,479 INFO L273 TraceCheckUtils]: 109: Hoare triple {14242#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 18:57:00,479 INFO L273 TraceCheckUtils]: 110: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 18:57:00,479 INFO L273 TraceCheckUtils]: 111: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 18:57:00,479 INFO L273 TraceCheckUtils]: 112: Hoare triple {14242#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 18:57:00,479 INFO L273 TraceCheckUtils]: 113: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 18:57:00,479 INFO L273 TraceCheckUtils]: 114: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 18:57:00,479 INFO L273 TraceCheckUtils]: 115: Hoare triple {14242#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 18:57:00,479 INFO L273 TraceCheckUtils]: 116: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 18:57:00,479 INFO L273 TraceCheckUtils]: 117: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 18:57:00,480 INFO L273 TraceCheckUtils]: 118: Hoare triple {14242#false} assume !(~i~0 < 100000); {14242#false} is VALID [2018-11-14 18:57:00,480 INFO L273 TraceCheckUtils]: 119: Hoare triple {14242#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {14242#false} is VALID [2018-11-14 18:57:00,480 INFO L273 TraceCheckUtils]: 120: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 18:57:00,480 INFO L268 TraceCheckUtils]: 121: Hoare quadruple {14242#false} {14242#false} #75#return; {14242#false} is VALID [2018-11-14 18:57:00,480 INFO L273 TraceCheckUtils]: 122: Hoare triple {14242#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {14242#false} is VALID [2018-11-14 18:57:00,480 INFO L273 TraceCheckUtils]: 123: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 18:57:00,480 INFO L273 TraceCheckUtils]: 124: Hoare triple {14242#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {14242#false} is VALID [2018-11-14 18:57:00,480 INFO L273 TraceCheckUtils]: 125: Hoare triple {14242#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {14242#false} is VALID [2018-11-14 18:57:00,480 INFO L273 TraceCheckUtils]: 126: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 18:57:00,480 INFO L273 TraceCheckUtils]: 127: Hoare triple {14242#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {14242#false} is VALID [2018-11-14 18:57:00,481 INFO L273 TraceCheckUtils]: 128: Hoare triple {14242#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {14242#false} is VALID [2018-11-14 18:57:00,481 INFO L273 TraceCheckUtils]: 129: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 18:57:00,481 INFO L273 TraceCheckUtils]: 130: Hoare triple {14242#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {14242#false} is VALID [2018-11-14 18:57:00,481 INFO L273 TraceCheckUtils]: 131: Hoare triple {14242#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {14242#false} is VALID [2018-11-14 18:57:00,481 INFO L273 TraceCheckUtils]: 132: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 18:57:00,481 INFO L273 TraceCheckUtils]: 133: Hoare triple {14242#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {14242#false} is VALID [2018-11-14 18:57:00,481 INFO L273 TraceCheckUtils]: 134: Hoare triple {14242#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {14242#false} is VALID [2018-11-14 18:57:00,481 INFO L273 TraceCheckUtils]: 135: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 18:57:00,481 INFO L273 TraceCheckUtils]: 136: Hoare triple {14242#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {14242#false} is VALID [2018-11-14 18:57:00,481 INFO L273 TraceCheckUtils]: 137: Hoare triple {14242#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {14242#false} is VALID [2018-11-14 18:57:00,482 INFO L273 TraceCheckUtils]: 138: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 18:57:00,482 INFO L273 TraceCheckUtils]: 139: Hoare triple {14242#false} assume !(~i~2 < 99999); {14242#false} is VALID [2018-11-14 18:57:00,482 INFO L273 TraceCheckUtils]: 140: Hoare triple {14242#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {14242#false} is VALID [2018-11-14 18:57:00,482 INFO L256 TraceCheckUtils]: 141: Hoare triple {14242#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {14242#false} is VALID [2018-11-14 18:57:00,482 INFO L273 TraceCheckUtils]: 142: Hoare triple {14242#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {14242#false} is VALID [2018-11-14 18:57:00,482 INFO L273 TraceCheckUtils]: 143: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 18:57:00,482 INFO L273 TraceCheckUtils]: 144: Hoare triple {14242#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 18:57:00,482 INFO L273 TraceCheckUtils]: 145: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 18:57:00,482 INFO L273 TraceCheckUtils]: 146: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 18:57:00,483 INFO L273 TraceCheckUtils]: 147: Hoare triple {14242#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 18:57:00,483 INFO L273 TraceCheckUtils]: 148: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 18:57:00,483 INFO L273 TraceCheckUtils]: 149: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 18:57:00,483 INFO L273 TraceCheckUtils]: 150: Hoare triple {14242#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 18:57:00,483 INFO L273 TraceCheckUtils]: 151: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 18:57:00,483 INFO L273 TraceCheckUtils]: 152: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 18:57:00,483 INFO L273 TraceCheckUtils]: 153: Hoare triple {14242#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 18:57:00,483 INFO L273 TraceCheckUtils]: 154: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 18:57:00,483 INFO L273 TraceCheckUtils]: 155: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 18:57:00,483 INFO L273 TraceCheckUtils]: 156: Hoare triple {14242#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 18:57:00,484 INFO L273 TraceCheckUtils]: 157: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 18:57:00,484 INFO L273 TraceCheckUtils]: 158: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 18:57:00,484 INFO L273 TraceCheckUtils]: 159: Hoare triple {14242#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 18:57:00,484 INFO L273 TraceCheckUtils]: 160: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 18:57:00,484 INFO L273 TraceCheckUtils]: 161: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 18:57:00,484 INFO L273 TraceCheckUtils]: 162: Hoare triple {14242#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 18:57:00,484 INFO L273 TraceCheckUtils]: 163: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 18:57:00,484 INFO L273 TraceCheckUtils]: 164: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 18:57:00,484 INFO L273 TraceCheckUtils]: 165: Hoare triple {14242#false} assume !(~i~0 < 100000); {14242#false} is VALID [2018-11-14 18:57:00,484 INFO L273 TraceCheckUtils]: 166: Hoare triple {14242#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {14242#false} is VALID [2018-11-14 18:57:00,485 INFO L273 TraceCheckUtils]: 167: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 18:57:00,485 INFO L268 TraceCheckUtils]: 168: Hoare quadruple {14242#false} {14242#false} #77#return; {14242#false} is VALID [2018-11-14 18:57:00,485 INFO L273 TraceCheckUtils]: 169: Hoare triple {14242#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {14242#false} is VALID [2018-11-14 18:57:00,485 INFO L273 TraceCheckUtils]: 170: Hoare triple {14242#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {14242#false} is VALID [2018-11-14 18:57:00,485 INFO L273 TraceCheckUtils]: 171: Hoare triple {14242#false} assume !false; {14242#false} is VALID [2018-11-14 18:57:00,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 814 trivial. 0 not checked. [2018-11-14 18:57:00,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:57:00,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-14 18:57:00,520 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 172 [2018-11-14 18:57:00,520 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:57:00,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-14 18:57:00,616 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-14 18:57:00,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-14 18:57:00,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-14 18:57:00,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-14 18:57:00,617 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand 23 states. [2018-11-14 18:57:01,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:57:01,506 INFO L93 Difference]: Finished difference Result 177 states and 185 transitions. [2018-11-14 18:57:01,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-14 18:57:01,506 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 172 [2018-11-14 18:57:01,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:57:01,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 18:57:01,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 117 transitions. [2018-11-14 18:57:01,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 18:57:01,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 117 transitions. [2018-11-14 18:57:01,509 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 117 transitions. [2018-11-14 18:57:01,612 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-14 18:57:01,614 INFO L225 Difference]: With dead ends: 177 [2018-11-14 18:57:01,614 INFO L226 Difference]: Without dead ends: 123 [2018-11-14 18:57:01,614 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 172 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-14 18:57:01,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-14 18:57:01,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2018-11-14 18:57:01,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:57:01,649 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand 122 states. [2018-11-14 18:57:01,649 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 122 states. [2018-11-14 18:57:01,649 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 122 states. [2018-11-14 18:57:01,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:57:01,652 INFO L93 Difference]: Finished difference Result 123 states and 127 transitions. [2018-11-14 18:57:01,652 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2018-11-14 18:57:01,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:57:01,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:57:01,653 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 123 states. [2018-11-14 18:57:01,653 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 123 states. [2018-11-14 18:57:01,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:57:01,655 INFO L93 Difference]: Finished difference Result 123 states and 127 transitions. [2018-11-14 18:57:01,655 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2018-11-14 18:57:01,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:57:01,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:57:01,656 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:57:01,656 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:57:01,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-14 18:57:01,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 126 transitions. [2018-11-14 18:57:01,658 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 126 transitions. Word has length 172 [2018-11-14 18:57:01,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:57:01,659 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 126 transitions. [2018-11-14 18:57:01,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-14 18:57:01,659 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 126 transitions. [2018-11-14 18:57:01,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-14 18:57:01,660 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:57:01,660 INFO L375 BasicCegarLoop]: trace histogram [24, 21, 21, 21, 20, 20, 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] [2018-11-14 18:57:01,661 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:57:01,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:57:01,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1124485529, now seen corresponding path program 20 times [2018-11-14 18:57:01,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:57:01,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:57:01,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:57:01,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:57:01,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:57:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:57:02,183 INFO L256 TraceCheckUtils]: 0: Hoare triple {15428#true} call ULTIMATE.init(); {15428#true} is VALID [2018-11-14 18:57:02,183 INFO L273 TraceCheckUtils]: 1: Hoare triple {15428#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15428#true} is VALID [2018-11-14 18:57:02,183 INFO L273 TraceCheckUtils]: 2: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 18:57:02,183 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15428#true} {15428#true} #69#return; {15428#true} is VALID [2018-11-14 18:57:02,184 INFO L256 TraceCheckUtils]: 4: Hoare triple {15428#true} call #t~ret13 := main(); {15428#true} is VALID [2018-11-14 18:57:02,184 INFO L273 TraceCheckUtils]: 5: Hoare triple {15428#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; {15430#(= main_~i~1 0)} is VALID [2018-11-14 18:57:02,185 INFO L273 TraceCheckUtils]: 6: Hoare triple {15430#(= main_~i~1 0)} assume true; {15430#(= main_~i~1 0)} is VALID [2018-11-14 18:57:02,185 INFO L273 TraceCheckUtils]: 7: Hoare triple {15430#(= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {15430#(= main_~i~1 0)} is VALID [2018-11-14 18:57:02,186 INFO L273 TraceCheckUtils]: 8: Hoare triple {15430#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15431#(<= main_~i~1 1)} is VALID [2018-11-14 18:57:02,186 INFO L273 TraceCheckUtils]: 9: Hoare triple {15431#(<= main_~i~1 1)} assume true; {15431#(<= main_~i~1 1)} is VALID [2018-11-14 18:57:02,186 INFO L273 TraceCheckUtils]: 10: Hoare triple {15431#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {15431#(<= main_~i~1 1)} is VALID [2018-11-14 18:57:02,187 INFO L273 TraceCheckUtils]: 11: Hoare triple {15431#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15432#(<= main_~i~1 2)} is VALID [2018-11-14 18:57:02,187 INFO L273 TraceCheckUtils]: 12: Hoare triple {15432#(<= main_~i~1 2)} assume true; {15432#(<= main_~i~1 2)} is VALID [2018-11-14 18:57:02,187 INFO L273 TraceCheckUtils]: 13: Hoare triple {15432#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {15432#(<= main_~i~1 2)} is VALID [2018-11-14 18:57:02,188 INFO L273 TraceCheckUtils]: 14: Hoare triple {15432#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15433#(<= main_~i~1 3)} is VALID [2018-11-14 18:57:02,188 INFO L273 TraceCheckUtils]: 15: Hoare triple {15433#(<= main_~i~1 3)} assume true; {15433#(<= main_~i~1 3)} is VALID [2018-11-14 18:57:02,189 INFO L273 TraceCheckUtils]: 16: Hoare triple {15433#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {15433#(<= main_~i~1 3)} is VALID [2018-11-14 18:57:02,189 INFO L273 TraceCheckUtils]: 17: Hoare triple {15433#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15434#(<= main_~i~1 4)} is VALID [2018-11-14 18:57:02,190 INFO L273 TraceCheckUtils]: 18: Hoare triple {15434#(<= main_~i~1 4)} assume true; {15434#(<= main_~i~1 4)} is VALID [2018-11-14 18:57:02,190 INFO L273 TraceCheckUtils]: 19: Hoare triple {15434#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {15434#(<= main_~i~1 4)} is VALID [2018-11-14 18:57:02,191 INFO L273 TraceCheckUtils]: 20: Hoare triple {15434#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15435#(<= main_~i~1 5)} is VALID [2018-11-14 18:57:02,192 INFO L273 TraceCheckUtils]: 21: Hoare triple {15435#(<= main_~i~1 5)} assume true; {15435#(<= main_~i~1 5)} is VALID [2018-11-14 18:57:02,192 INFO L273 TraceCheckUtils]: 22: Hoare triple {15435#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {15435#(<= main_~i~1 5)} is VALID [2018-11-14 18:57:02,193 INFO L273 TraceCheckUtils]: 23: Hoare triple {15435#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15436#(<= main_~i~1 6)} is VALID [2018-11-14 18:57:02,193 INFO L273 TraceCheckUtils]: 24: Hoare triple {15436#(<= main_~i~1 6)} assume true; {15436#(<= main_~i~1 6)} is VALID [2018-11-14 18:57:02,194 INFO L273 TraceCheckUtils]: 25: Hoare triple {15436#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {15436#(<= main_~i~1 6)} is VALID [2018-11-14 18:57:02,194 INFO L273 TraceCheckUtils]: 26: Hoare triple {15436#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15437#(<= main_~i~1 7)} is VALID [2018-11-14 18:57:02,195 INFO L273 TraceCheckUtils]: 27: Hoare triple {15437#(<= main_~i~1 7)} assume true; {15437#(<= main_~i~1 7)} is VALID [2018-11-14 18:57:02,195 INFO L273 TraceCheckUtils]: 28: Hoare triple {15437#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {15437#(<= main_~i~1 7)} is VALID [2018-11-14 18:57:02,196 INFO L273 TraceCheckUtils]: 29: Hoare triple {15437#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15438#(<= main_~i~1 8)} is VALID [2018-11-14 18:57:02,196 INFO L273 TraceCheckUtils]: 30: Hoare triple {15438#(<= main_~i~1 8)} assume true; {15438#(<= main_~i~1 8)} is VALID [2018-11-14 18:57:02,197 INFO L273 TraceCheckUtils]: 31: Hoare triple {15438#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {15438#(<= main_~i~1 8)} is VALID [2018-11-14 18:57:02,198 INFO L273 TraceCheckUtils]: 32: Hoare triple {15438#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15439#(<= main_~i~1 9)} is VALID [2018-11-14 18:57:02,198 INFO L273 TraceCheckUtils]: 33: Hoare triple {15439#(<= main_~i~1 9)} assume true; {15439#(<= main_~i~1 9)} is VALID [2018-11-14 18:57:02,199 INFO L273 TraceCheckUtils]: 34: Hoare triple {15439#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {15439#(<= main_~i~1 9)} is VALID [2018-11-14 18:57:02,199 INFO L273 TraceCheckUtils]: 35: Hoare triple {15439#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15440#(<= main_~i~1 10)} is VALID [2018-11-14 18:57:02,200 INFO L273 TraceCheckUtils]: 36: Hoare triple {15440#(<= main_~i~1 10)} assume true; {15440#(<= main_~i~1 10)} is VALID [2018-11-14 18:57:02,200 INFO L273 TraceCheckUtils]: 37: Hoare triple {15440#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {15440#(<= main_~i~1 10)} is VALID [2018-11-14 18:57:02,201 INFO L273 TraceCheckUtils]: 38: Hoare triple {15440#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15441#(<= main_~i~1 11)} is VALID [2018-11-14 18:57:02,201 INFO L273 TraceCheckUtils]: 39: Hoare triple {15441#(<= main_~i~1 11)} assume true; {15441#(<= main_~i~1 11)} is VALID [2018-11-14 18:57:02,202 INFO L273 TraceCheckUtils]: 40: Hoare triple {15441#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {15441#(<= main_~i~1 11)} is VALID [2018-11-14 18:57:02,202 INFO L273 TraceCheckUtils]: 41: Hoare triple {15441#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15442#(<= main_~i~1 12)} is VALID [2018-11-14 18:57:02,203 INFO L273 TraceCheckUtils]: 42: Hoare triple {15442#(<= main_~i~1 12)} assume true; {15442#(<= main_~i~1 12)} is VALID [2018-11-14 18:57:02,203 INFO L273 TraceCheckUtils]: 43: Hoare triple {15442#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {15442#(<= main_~i~1 12)} is VALID [2018-11-14 18:57:02,204 INFO L273 TraceCheckUtils]: 44: Hoare triple {15442#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15443#(<= main_~i~1 13)} is VALID [2018-11-14 18:57:02,205 INFO L273 TraceCheckUtils]: 45: Hoare triple {15443#(<= main_~i~1 13)} assume true; {15443#(<= main_~i~1 13)} is VALID [2018-11-14 18:57:02,205 INFO L273 TraceCheckUtils]: 46: Hoare triple {15443#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {15443#(<= main_~i~1 13)} is VALID [2018-11-14 18:57:02,206 INFO L273 TraceCheckUtils]: 47: Hoare triple {15443#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15444#(<= main_~i~1 14)} is VALID [2018-11-14 18:57:02,206 INFO L273 TraceCheckUtils]: 48: Hoare triple {15444#(<= main_~i~1 14)} assume true; {15444#(<= main_~i~1 14)} is VALID [2018-11-14 18:57:02,207 INFO L273 TraceCheckUtils]: 49: Hoare triple {15444#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {15444#(<= main_~i~1 14)} is VALID [2018-11-14 18:57:02,207 INFO L273 TraceCheckUtils]: 50: Hoare triple {15444#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15445#(<= main_~i~1 15)} is VALID [2018-11-14 18:57:02,208 INFO L273 TraceCheckUtils]: 51: Hoare triple {15445#(<= main_~i~1 15)} assume true; {15445#(<= main_~i~1 15)} is VALID [2018-11-14 18:57:02,208 INFO L273 TraceCheckUtils]: 52: Hoare triple {15445#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {15445#(<= main_~i~1 15)} is VALID [2018-11-14 18:57:02,209 INFO L273 TraceCheckUtils]: 53: Hoare triple {15445#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15446#(<= main_~i~1 16)} is VALID [2018-11-14 18:57:02,210 INFO L273 TraceCheckUtils]: 54: Hoare triple {15446#(<= main_~i~1 16)} assume true; {15446#(<= main_~i~1 16)} is VALID [2018-11-14 18:57:02,210 INFO L273 TraceCheckUtils]: 55: Hoare triple {15446#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {15446#(<= main_~i~1 16)} is VALID [2018-11-14 18:57:02,211 INFO L273 TraceCheckUtils]: 56: Hoare triple {15446#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15447#(<= main_~i~1 17)} is VALID [2018-11-14 18:57:02,211 INFO L273 TraceCheckUtils]: 57: Hoare triple {15447#(<= main_~i~1 17)} assume true; {15447#(<= main_~i~1 17)} is VALID [2018-11-14 18:57:02,212 INFO L273 TraceCheckUtils]: 58: Hoare triple {15447#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {15447#(<= main_~i~1 17)} is VALID [2018-11-14 18:57:02,212 INFO L273 TraceCheckUtils]: 59: Hoare triple {15447#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15448#(<= main_~i~1 18)} is VALID [2018-11-14 18:57:02,213 INFO L273 TraceCheckUtils]: 60: Hoare triple {15448#(<= main_~i~1 18)} assume true; {15448#(<= main_~i~1 18)} is VALID [2018-11-14 18:57:02,213 INFO L273 TraceCheckUtils]: 61: Hoare triple {15448#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {15448#(<= main_~i~1 18)} is VALID [2018-11-14 18:57:02,214 INFO L273 TraceCheckUtils]: 62: Hoare triple {15448#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15449#(<= main_~i~1 19)} is VALID [2018-11-14 18:57:02,214 INFO L273 TraceCheckUtils]: 63: Hoare triple {15449#(<= main_~i~1 19)} assume true; {15449#(<= main_~i~1 19)} is VALID [2018-11-14 18:57:02,215 INFO L273 TraceCheckUtils]: 64: Hoare triple {15449#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {15449#(<= main_~i~1 19)} is VALID [2018-11-14 18:57:02,216 INFO L273 TraceCheckUtils]: 65: Hoare triple {15449#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15450#(<= main_~i~1 20)} is VALID [2018-11-14 18:57:02,216 INFO L273 TraceCheckUtils]: 66: Hoare triple {15450#(<= main_~i~1 20)} assume true; {15450#(<= main_~i~1 20)} is VALID [2018-11-14 18:57:02,217 INFO L273 TraceCheckUtils]: 67: Hoare triple {15450#(<= main_~i~1 20)} assume !(~i~1 < 100000); {15429#false} is VALID [2018-11-14 18:57:02,217 INFO L256 TraceCheckUtils]: 68: Hoare triple {15429#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {15428#true} is VALID [2018-11-14 18:57:02,217 INFO L273 TraceCheckUtils]: 69: Hoare triple {15428#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {15428#true} is VALID [2018-11-14 18:57:02,217 INFO L273 TraceCheckUtils]: 70: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 18:57:02,217 INFO L273 TraceCheckUtils]: 71: Hoare triple {15428#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 18:57:02,218 INFO L273 TraceCheckUtils]: 72: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 18:57:02,218 INFO L273 TraceCheckUtils]: 73: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 18:57:02,218 INFO L273 TraceCheckUtils]: 74: Hoare triple {15428#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 18:57:02,218 INFO L273 TraceCheckUtils]: 75: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 18:57:02,218 INFO L273 TraceCheckUtils]: 76: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 18:57:02,218 INFO L273 TraceCheckUtils]: 77: Hoare triple {15428#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 18:57:02,219 INFO L273 TraceCheckUtils]: 78: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 18:57:02,219 INFO L273 TraceCheckUtils]: 79: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 18:57:02,219 INFO L273 TraceCheckUtils]: 80: Hoare triple {15428#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 18:57:02,219 INFO L273 TraceCheckUtils]: 81: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 18:57:02,219 INFO L273 TraceCheckUtils]: 82: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 18:57:02,219 INFO L273 TraceCheckUtils]: 83: Hoare triple {15428#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 18:57:02,219 INFO L273 TraceCheckUtils]: 84: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 18:57:02,220 INFO L273 TraceCheckUtils]: 85: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 18:57:02,220 INFO L273 TraceCheckUtils]: 86: Hoare triple {15428#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 18:57:02,220 INFO L273 TraceCheckUtils]: 87: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 18:57:02,220 INFO L273 TraceCheckUtils]: 88: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 18:57:02,220 INFO L273 TraceCheckUtils]: 89: Hoare triple {15428#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 18:57:02,220 INFO L273 TraceCheckUtils]: 90: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 18:57:02,220 INFO L273 TraceCheckUtils]: 91: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 18:57:02,220 INFO L273 TraceCheckUtils]: 92: Hoare triple {15428#true} assume !(~i~0 < 100000); {15428#true} is VALID [2018-11-14 18:57:02,220 INFO L273 TraceCheckUtils]: 93: Hoare triple {15428#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15428#true} is VALID [2018-11-14 18:57:02,221 INFO L273 TraceCheckUtils]: 94: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 18:57:02,221 INFO L268 TraceCheckUtils]: 95: Hoare quadruple {15428#true} {15429#false} #73#return; {15429#false} is VALID [2018-11-14 18:57:02,221 INFO L273 TraceCheckUtils]: 96: Hoare triple {15429#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {15429#false} is VALID [2018-11-14 18:57:02,221 INFO L256 TraceCheckUtils]: 97: Hoare triple {15429#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {15428#true} is VALID [2018-11-14 18:57:02,221 INFO L273 TraceCheckUtils]: 98: Hoare triple {15428#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {15428#true} is VALID [2018-11-14 18:57:02,221 INFO L273 TraceCheckUtils]: 99: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 18:57:02,221 INFO L273 TraceCheckUtils]: 100: Hoare triple {15428#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 18:57:02,221 INFO L273 TraceCheckUtils]: 101: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 18:57:02,221 INFO L273 TraceCheckUtils]: 102: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 18:57:02,221 INFO L273 TraceCheckUtils]: 103: Hoare triple {15428#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 18:57:02,222 INFO L273 TraceCheckUtils]: 104: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 18:57:02,222 INFO L273 TraceCheckUtils]: 105: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 18:57:02,222 INFO L273 TraceCheckUtils]: 106: Hoare triple {15428#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 18:57:02,222 INFO L273 TraceCheckUtils]: 107: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 18:57:02,222 INFO L273 TraceCheckUtils]: 108: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 18:57:02,222 INFO L273 TraceCheckUtils]: 109: Hoare triple {15428#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 18:57:02,222 INFO L273 TraceCheckUtils]: 110: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 18:57:02,222 INFO L273 TraceCheckUtils]: 111: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 18:57:02,222 INFO L273 TraceCheckUtils]: 112: Hoare triple {15428#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 18:57:02,223 INFO L273 TraceCheckUtils]: 113: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 18:57:02,223 INFO L273 TraceCheckUtils]: 114: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 18:57:02,223 INFO L273 TraceCheckUtils]: 115: Hoare triple {15428#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 18:57:02,223 INFO L273 TraceCheckUtils]: 116: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 18:57:02,223 INFO L273 TraceCheckUtils]: 117: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 18:57:02,223 INFO L273 TraceCheckUtils]: 118: Hoare triple {15428#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 18:57:02,223 INFO L273 TraceCheckUtils]: 119: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 18:57:02,223 INFO L273 TraceCheckUtils]: 120: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 18:57:02,223 INFO L273 TraceCheckUtils]: 121: Hoare triple {15428#true} assume !(~i~0 < 100000); {15428#true} is VALID [2018-11-14 18:57:02,223 INFO L273 TraceCheckUtils]: 122: Hoare triple {15428#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15428#true} is VALID [2018-11-14 18:57:02,224 INFO L273 TraceCheckUtils]: 123: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 18:57:02,224 INFO L268 TraceCheckUtils]: 124: Hoare quadruple {15428#true} {15429#false} #75#return; {15429#false} is VALID [2018-11-14 18:57:02,224 INFO L273 TraceCheckUtils]: 125: Hoare triple {15429#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {15429#false} is VALID [2018-11-14 18:57:02,224 INFO L273 TraceCheckUtils]: 126: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 18:57:02,224 INFO L273 TraceCheckUtils]: 127: Hoare triple {15429#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {15429#false} is VALID [2018-11-14 18:57:02,224 INFO L273 TraceCheckUtils]: 128: Hoare triple {15429#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {15429#false} is VALID [2018-11-14 18:57:02,224 INFO L273 TraceCheckUtils]: 129: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 18:57:02,224 INFO L273 TraceCheckUtils]: 130: Hoare triple {15429#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {15429#false} is VALID [2018-11-14 18:57:02,224 INFO L273 TraceCheckUtils]: 131: Hoare triple {15429#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {15429#false} is VALID [2018-11-14 18:57:02,225 INFO L273 TraceCheckUtils]: 132: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 18:57:02,225 INFO L273 TraceCheckUtils]: 133: Hoare triple {15429#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {15429#false} is VALID [2018-11-14 18:57:02,225 INFO L273 TraceCheckUtils]: 134: Hoare triple {15429#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {15429#false} is VALID [2018-11-14 18:57:02,225 INFO L273 TraceCheckUtils]: 135: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 18:57:02,225 INFO L273 TraceCheckUtils]: 136: Hoare triple {15429#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {15429#false} is VALID [2018-11-14 18:57:02,225 INFO L273 TraceCheckUtils]: 137: Hoare triple {15429#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {15429#false} is VALID [2018-11-14 18:57:02,225 INFO L273 TraceCheckUtils]: 138: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 18:57:02,225 INFO L273 TraceCheckUtils]: 139: Hoare triple {15429#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {15429#false} is VALID [2018-11-14 18:57:02,225 INFO L273 TraceCheckUtils]: 140: Hoare triple {15429#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {15429#false} is VALID [2018-11-14 18:57:02,225 INFO L273 TraceCheckUtils]: 141: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 18:57:02,226 INFO L273 TraceCheckUtils]: 142: Hoare triple {15429#false} assume !(~i~2 < 99999); {15429#false} is VALID [2018-11-14 18:57:02,226 INFO L273 TraceCheckUtils]: 143: Hoare triple {15429#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {15429#false} is VALID [2018-11-14 18:57:02,226 INFO L256 TraceCheckUtils]: 144: Hoare triple {15429#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {15428#true} is VALID [2018-11-14 18:57:02,226 INFO L273 TraceCheckUtils]: 145: Hoare triple {15428#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {15428#true} is VALID [2018-11-14 18:57:02,226 INFO L273 TraceCheckUtils]: 146: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 18:57:02,226 INFO L273 TraceCheckUtils]: 147: Hoare triple {15428#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 18:57:02,226 INFO L273 TraceCheckUtils]: 148: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 18:57:02,226 INFO L273 TraceCheckUtils]: 149: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 18:57:02,226 INFO L273 TraceCheckUtils]: 150: Hoare triple {15428#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 18:57:02,226 INFO L273 TraceCheckUtils]: 151: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 18:57:02,227 INFO L273 TraceCheckUtils]: 152: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 18:57:02,227 INFO L273 TraceCheckUtils]: 153: Hoare triple {15428#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 18:57:02,227 INFO L273 TraceCheckUtils]: 154: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 18:57:02,227 INFO L273 TraceCheckUtils]: 155: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 18:57:02,227 INFO L273 TraceCheckUtils]: 156: Hoare triple {15428#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 18:57:02,227 INFO L273 TraceCheckUtils]: 157: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 18:57:02,227 INFO L273 TraceCheckUtils]: 158: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 18:57:02,227 INFO L273 TraceCheckUtils]: 159: Hoare triple {15428#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 18:57:02,227 INFO L273 TraceCheckUtils]: 160: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 18:57:02,228 INFO L273 TraceCheckUtils]: 161: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 18:57:02,228 INFO L273 TraceCheckUtils]: 162: Hoare triple {15428#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 18:57:02,228 INFO L273 TraceCheckUtils]: 163: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 18:57:02,228 INFO L273 TraceCheckUtils]: 164: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 18:57:02,228 INFO L273 TraceCheckUtils]: 165: Hoare triple {15428#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 18:57:02,228 INFO L273 TraceCheckUtils]: 166: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 18:57:02,228 INFO L273 TraceCheckUtils]: 167: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 18:57:02,228 INFO L273 TraceCheckUtils]: 168: Hoare triple {15428#true} assume !(~i~0 < 100000); {15428#true} is VALID [2018-11-14 18:57:02,228 INFO L273 TraceCheckUtils]: 169: Hoare triple {15428#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15428#true} is VALID [2018-11-14 18:57:02,228 INFO L273 TraceCheckUtils]: 170: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 18:57:02,229 INFO L268 TraceCheckUtils]: 171: Hoare quadruple {15428#true} {15429#false} #77#return; {15429#false} is VALID [2018-11-14 18:57:02,229 INFO L273 TraceCheckUtils]: 172: Hoare triple {15429#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {15429#false} is VALID [2018-11-14 18:57:02,229 INFO L273 TraceCheckUtils]: 173: Hoare triple {15429#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {15429#false} is VALID [2018-11-14 18:57:02,229 INFO L273 TraceCheckUtils]: 174: Hoare triple {15429#false} assume !false; {15429#false} is VALID [2018-11-14 18:57:02,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1424 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 814 trivial. 0 not checked. [2018-11-14 18:57:02,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:57:02,243 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-14 18:57:02,251 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:57:02,311 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:57:02,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:57:02,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:57:02,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:57:03,893 INFO L256 TraceCheckUtils]: 0: Hoare triple {15428#true} call ULTIMATE.init(); {15428#true} is VALID [2018-11-14 18:57:03,893 INFO L273 TraceCheckUtils]: 1: Hoare triple {15428#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15428#true} is VALID [2018-11-14 18:57:03,893 INFO L273 TraceCheckUtils]: 2: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 18:57:03,893 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15428#true} {15428#true} #69#return; {15428#true} is VALID [2018-11-14 18:57:03,893 INFO L256 TraceCheckUtils]: 4: Hoare triple {15428#true} call #t~ret13 := main(); {15428#true} is VALID [2018-11-14 18:57:03,895 INFO L273 TraceCheckUtils]: 5: Hoare triple {15428#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; {15469#(<= main_~i~1 0)} is VALID [2018-11-14 18:57:03,895 INFO L273 TraceCheckUtils]: 6: Hoare triple {15469#(<= main_~i~1 0)} assume true; {15469#(<= main_~i~1 0)} is VALID [2018-11-14 18:57:03,897 INFO L273 TraceCheckUtils]: 7: Hoare triple {15469#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {15469#(<= main_~i~1 0)} is VALID [2018-11-14 18:57:03,897 INFO L273 TraceCheckUtils]: 8: Hoare triple {15469#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15431#(<= main_~i~1 1)} is VALID [2018-11-14 18:57:03,899 INFO L273 TraceCheckUtils]: 9: Hoare triple {15431#(<= main_~i~1 1)} assume true; {15431#(<= main_~i~1 1)} is VALID [2018-11-14 18:57:03,899 INFO L273 TraceCheckUtils]: 10: Hoare triple {15431#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {15431#(<= main_~i~1 1)} is VALID [2018-11-14 18:57:03,901 INFO L273 TraceCheckUtils]: 11: Hoare triple {15431#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15432#(<= main_~i~1 2)} is VALID [2018-11-14 18:57:03,901 INFO L273 TraceCheckUtils]: 12: Hoare triple {15432#(<= main_~i~1 2)} assume true; {15432#(<= main_~i~1 2)} is VALID [2018-11-14 18:57:03,903 INFO L273 TraceCheckUtils]: 13: Hoare triple {15432#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {15432#(<= main_~i~1 2)} is VALID [2018-11-14 18:57:03,903 INFO L273 TraceCheckUtils]: 14: Hoare triple {15432#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15433#(<= main_~i~1 3)} is VALID [2018-11-14 18:57:03,905 INFO L273 TraceCheckUtils]: 15: Hoare triple {15433#(<= main_~i~1 3)} assume true; {15433#(<= main_~i~1 3)} is VALID [2018-11-14 18:57:03,905 INFO L273 TraceCheckUtils]: 16: Hoare triple {15433#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {15433#(<= main_~i~1 3)} is VALID [2018-11-14 18:57:03,907 INFO L273 TraceCheckUtils]: 17: Hoare triple {15433#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15434#(<= main_~i~1 4)} is VALID [2018-11-14 18:57:03,907 INFO L273 TraceCheckUtils]: 18: Hoare triple {15434#(<= main_~i~1 4)} assume true; {15434#(<= main_~i~1 4)} is VALID [2018-11-14 18:57:03,909 INFO L273 TraceCheckUtils]: 19: Hoare triple {15434#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {15434#(<= main_~i~1 4)} is VALID [2018-11-14 18:57:03,909 INFO L273 TraceCheckUtils]: 20: Hoare triple {15434#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15435#(<= main_~i~1 5)} is VALID [2018-11-14 18:57:03,911 INFO L273 TraceCheckUtils]: 21: Hoare triple {15435#(<= main_~i~1 5)} assume true; {15435#(<= main_~i~1 5)} is VALID [2018-11-14 18:57:03,911 INFO L273 TraceCheckUtils]: 22: Hoare triple {15435#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {15435#(<= main_~i~1 5)} is VALID [2018-11-14 18:57:03,913 INFO L273 TraceCheckUtils]: 23: Hoare triple {15435#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15436#(<= main_~i~1 6)} is VALID [2018-11-14 18:57:03,913 INFO L273 TraceCheckUtils]: 24: Hoare triple {15436#(<= main_~i~1 6)} assume true; {15436#(<= main_~i~1 6)} is VALID [2018-11-14 18:57:03,915 INFO L273 TraceCheckUtils]: 25: Hoare triple {15436#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {15436#(<= main_~i~1 6)} is VALID [2018-11-14 18:57:03,915 INFO L273 TraceCheckUtils]: 26: Hoare triple {15436#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15437#(<= main_~i~1 7)} is VALID [2018-11-14 18:57:03,917 INFO L273 TraceCheckUtils]: 27: Hoare triple {15437#(<= main_~i~1 7)} assume true; {15437#(<= main_~i~1 7)} is VALID [2018-11-14 18:57:03,917 INFO L273 TraceCheckUtils]: 28: Hoare triple {15437#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {15437#(<= main_~i~1 7)} is VALID [2018-11-14 18:57:03,919 INFO L273 TraceCheckUtils]: 29: Hoare triple {15437#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15438#(<= main_~i~1 8)} is VALID [2018-11-14 18:57:03,919 INFO L273 TraceCheckUtils]: 30: Hoare triple {15438#(<= main_~i~1 8)} assume true; {15438#(<= main_~i~1 8)} is VALID [2018-11-14 18:57:03,921 INFO L273 TraceCheckUtils]: 31: Hoare triple {15438#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {15438#(<= main_~i~1 8)} is VALID [2018-11-14 18:57:03,921 INFO L273 TraceCheckUtils]: 32: Hoare triple {15438#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15439#(<= main_~i~1 9)} is VALID [2018-11-14 18:57:03,924 INFO L273 TraceCheckUtils]: 33: Hoare triple {15439#(<= main_~i~1 9)} assume true; {15439#(<= main_~i~1 9)} is VALID [2018-11-14 18:57:03,924 INFO L273 TraceCheckUtils]: 34: Hoare triple {15439#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {15439#(<= main_~i~1 9)} is VALID [2018-11-14 18:57:03,926 INFO L273 TraceCheckUtils]: 35: Hoare triple {15439#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15440#(<= main_~i~1 10)} is VALID [2018-11-14 18:57:03,926 INFO L273 TraceCheckUtils]: 36: Hoare triple {15440#(<= main_~i~1 10)} assume true; {15440#(<= main_~i~1 10)} is VALID [2018-11-14 18:57:03,928 INFO L273 TraceCheckUtils]: 37: Hoare triple {15440#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {15440#(<= main_~i~1 10)} is VALID [2018-11-14 18:57:03,928 INFO L273 TraceCheckUtils]: 38: Hoare triple {15440#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15441#(<= main_~i~1 11)} is VALID [2018-11-14 18:57:03,930 INFO L273 TraceCheckUtils]: 39: Hoare triple {15441#(<= main_~i~1 11)} assume true; {15441#(<= main_~i~1 11)} is VALID [2018-11-14 18:57:03,930 INFO L273 TraceCheckUtils]: 40: Hoare triple {15441#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {15441#(<= main_~i~1 11)} is VALID [2018-11-14 18:57:03,932 INFO L273 TraceCheckUtils]: 41: Hoare triple {15441#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15442#(<= main_~i~1 12)} is VALID [2018-11-14 18:57:03,932 INFO L273 TraceCheckUtils]: 42: Hoare triple {15442#(<= main_~i~1 12)} assume true; {15442#(<= main_~i~1 12)} is VALID [2018-11-14 18:57:03,934 INFO L273 TraceCheckUtils]: 43: Hoare triple {15442#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {15442#(<= main_~i~1 12)} is VALID [2018-11-14 18:57:03,934 INFO L273 TraceCheckUtils]: 44: Hoare triple {15442#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15443#(<= main_~i~1 13)} is VALID [2018-11-14 18:57:03,936 INFO L273 TraceCheckUtils]: 45: Hoare triple {15443#(<= main_~i~1 13)} assume true; {15443#(<= main_~i~1 13)} is VALID [2018-11-14 18:57:03,936 INFO L273 TraceCheckUtils]: 46: Hoare triple {15443#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {15443#(<= main_~i~1 13)} is VALID [2018-11-14 18:57:03,938 INFO L273 TraceCheckUtils]: 47: Hoare triple {15443#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15444#(<= main_~i~1 14)} is VALID [2018-11-14 18:57:03,938 INFO L273 TraceCheckUtils]: 48: Hoare triple {15444#(<= main_~i~1 14)} assume true; {15444#(<= main_~i~1 14)} is VALID [2018-11-14 18:57:03,941 INFO L273 TraceCheckUtils]: 49: Hoare triple {15444#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {15444#(<= main_~i~1 14)} is VALID [2018-11-14 18:57:03,941 INFO L273 TraceCheckUtils]: 50: Hoare triple {15444#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15445#(<= main_~i~1 15)} is VALID [2018-11-14 18:57:03,944 INFO L273 TraceCheckUtils]: 51: Hoare triple {15445#(<= main_~i~1 15)} assume true; {15445#(<= main_~i~1 15)} is VALID [2018-11-14 18:57:03,944 INFO L273 TraceCheckUtils]: 52: Hoare triple {15445#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {15445#(<= main_~i~1 15)} is VALID [2018-11-14 18:57:03,947 INFO L273 TraceCheckUtils]: 53: Hoare triple {15445#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15446#(<= main_~i~1 16)} is VALID [2018-11-14 18:57:03,947 INFO L273 TraceCheckUtils]: 54: Hoare triple {15446#(<= main_~i~1 16)} assume true; {15446#(<= main_~i~1 16)} is VALID [2018-11-14 18:57:03,950 INFO L273 TraceCheckUtils]: 55: Hoare triple {15446#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {15446#(<= main_~i~1 16)} is VALID [2018-11-14 18:57:03,950 INFO L273 TraceCheckUtils]: 56: Hoare triple {15446#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15447#(<= main_~i~1 17)} is VALID [2018-11-14 18:57:03,952 INFO L273 TraceCheckUtils]: 57: Hoare triple {15447#(<= main_~i~1 17)} assume true; {15447#(<= main_~i~1 17)} is VALID [2018-11-14 18:57:03,952 INFO L273 TraceCheckUtils]: 58: Hoare triple {15447#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {15447#(<= main_~i~1 17)} is VALID [2018-11-14 18:57:03,955 INFO L273 TraceCheckUtils]: 59: Hoare triple {15447#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15448#(<= main_~i~1 18)} is VALID [2018-11-14 18:57:03,955 INFO L273 TraceCheckUtils]: 60: Hoare triple {15448#(<= main_~i~1 18)} assume true; {15448#(<= main_~i~1 18)} is VALID [2018-11-14 18:57:03,957 INFO L273 TraceCheckUtils]: 61: Hoare triple {15448#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {15448#(<= main_~i~1 18)} is VALID [2018-11-14 18:57:03,957 INFO L273 TraceCheckUtils]: 62: Hoare triple {15448#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15449#(<= main_~i~1 19)} is VALID [2018-11-14 18:57:03,959 INFO L273 TraceCheckUtils]: 63: Hoare triple {15449#(<= main_~i~1 19)} assume true; {15449#(<= main_~i~1 19)} is VALID [2018-11-14 18:57:03,959 INFO L273 TraceCheckUtils]: 64: Hoare triple {15449#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {15449#(<= main_~i~1 19)} is VALID [2018-11-14 18:57:03,961 INFO L273 TraceCheckUtils]: 65: Hoare triple {15449#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15450#(<= main_~i~1 20)} is VALID [2018-11-14 18:57:03,961 INFO L273 TraceCheckUtils]: 66: Hoare triple {15450#(<= main_~i~1 20)} assume true; {15450#(<= main_~i~1 20)} is VALID [2018-11-14 18:57:03,963 INFO L273 TraceCheckUtils]: 67: Hoare triple {15450#(<= main_~i~1 20)} assume !(~i~1 < 100000); {15429#false} is VALID [2018-11-14 18:57:03,963 INFO L256 TraceCheckUtils]: 68: Hoare triple {15429#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {15429#false} is VALID [2018-11-14 18:57:03,963 INFO L273 TraceCheckUtils]: 69: Hoare triple {15429#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {15429#false} is VALID [2018-11-14 18:57:03,963 INFO L273 TraceCheckUtils]: 70: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 18:57:03,963 INFO L273 TraceCheckUtils]: 71: Hoare triple {15429#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 18:57:03,963 INFO L273 TraceCheckUtils]: 72: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 18:57:03,963 INFO L273 TraceCheckUtils]: 73: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 18:57:03,963 INFO L273 TraceCheckUtils]: 74: Hoare triple {15429#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 18:57:03,964 INFO L273 TraceCheckUtils]: 75: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 18:57:03,964 INFO L273 TraceCheckUtils]: 76: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 18:57:03,964 INFO L273 TraceCheckUtils]: 77: Hoare triple {15429#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 18:57:03,964 INFO L273 TraceCheckUtils]: 78: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 18:57:03,964 INFO L273 TraceCheckUtils]: 79: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 18:57:03,964 INFO L273 TraceCheckUtils]: 80: Hoare triple {15429#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 18:57:03,964 INFO L273 TraceCheckUtils]: 81: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 18:57:03,964 INFO L273 TraceCheckUtils]: 82: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 18:57:03,964 INFO L273 TraceCheckUtils]: 83: Hoare triple {15429#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 18:57:03,964 INFO L273 TraceCheckUtils]: 84: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 18:57:03,965 INFO L273 TraceCheckUtils]: 85: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 18:57:03,965 INFO L273 TraceCheckUtils]: 86: Hoare triple {15429#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 18:57:03,965 INFO L273 TraceCheckUtils]: 87: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 18:57:03,965 INFO L273 TraceCheckUtils]: 88: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 18:57:03,965 INFO L273 TraceCheckUtils]: 89: Hoare triple {15429#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 18:57:03,965 INFO L273 TraceCheckUtils]: 90: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 18:57:03,965 INFO L273 TraceCheckUtils]: 91: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 18:57:03,965 INFO L273 TraceCheckUtils]: 92: Hoare triple {15429#false} assume !(~i~0 < 100000); {15429#false} is VALID [2018-11-14 18:57:03,965 INFO L273 TraceCheckUtils]: 93: Hoare triple {15429#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15429#false} is VALID [2018-11-14 18:57:03,965 INFO L273 TraceCheckUtils]: 94: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 18:57:03,966 INFO L268 TraceCheckUtils]: 95: Hoare quadruple {15429#false} {15429#false} #73#return; {15429#false} is VALID [2018-11-14 18:57:03,966 INFO L273 TraceCheckUtils]: 96: Hoare triple {15429#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {15429#false} is VALID [2018-11-14 18:57:03,966 INFO L256 TraceCheckUtils]: 97: Hoare triple {15429#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {15429#false} is VALID [2018-11-14 18:57:03,966 INFO L273 TraceCheckUtils]: 98: Hoare triple {15429#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {15429#false} is VALID [2018-11-14 18:57:03,966 INFO L273 TraceCheckUtils]: 99: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 18:57:03,966 INFO L273 TraceCheckUtils]: 100: Hoare triple {15429#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 18:57:03,966 INFO L273 TraceCheckUtils]: 101: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 18:57:03,966 INFO L273 TraceCheckUtils]: 102: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 18:57:03,966 INFO L273 TraceCheckUtils]: 103: Hoare triple {15429#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 18:57:03,967 INFO L273 TraceCheckUtils]: 104: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 18:57:03,967 INFO L273 TraceCheckUtils]: 105: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 18:57:03,967 INFO L273 TraceCheckUtils]: 106: Hoare triple {15429#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 18:57:03,967 INFO L273 TraceCheckUtils]: 107: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 18:57:03,967 INFO L273 TraceCheckUtils]: 108: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 18:57:03,967 INFO L273 TraceCheckUtils]: 109: Hoare triple {15429#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 18:57:03,967 INFO L273 TraceCheckUtils]: 110: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 18:57:03,967 INFO L273 TraceCheckUtils]: 111: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 18:57:03,967 INFO L273 TraceCheckUtils]: 112: Hoare triple {15429#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 18:57:03,967 INFO L273 TraceCheckUtils]: 113: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 18:57:03,968 INFO L273 TraceCheckUtils]: 114: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 18:57:03,968 INFO L273 TraceCheckUtils]: 115: Hoare triple {15429#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 18:57:03,968 INFO L273 TraceCheckUtils]: 116: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 18:57:03,968 INFO L273 TraceCheckUtils]: 117: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 18:57:03,968 INFO L273 TraceCheckUtils]: 118: Hoare triple {15429#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 18:57:03,968 INFO L273 TraceCheckUtils]: 119: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 18:57:03,968 INFO L273 TraceCheckUtils]: 120: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 18:57:03,968 INFO L273 TraceCheckUtils]: 121: Hoare triple {15429#false} assume !(~i~0 < 100000); {15429#false} is VALID [2018-11-14 18:57:03,968 INFO L273 TraceCheckUtils]: 122: Hoare triple {15429#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15429#false} is VALID [2018-11-14 18:57:03,969 INFO L273 TraceCheckUtils]: 123: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 18:57:03,969 INFO L268 TraceCheckUtils]: 124: Hoare quadruple {15429#false} {15429#false} #75#return; {15429#false} is VALID [2018-11-14 18:57:03,969 INFO L273 TraceCheckUtils]: 125: Hoare triple {15429#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {15429#false} is VALID [2018-11-14 18:57:03,969 INFO L273 TraceCheckUtils]: 126: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 18:57:03,969 INFO L273 TraceCheckUtils]: 127: Hoare triple {15429#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {15429#false} is VALID [2018-11-14 18:57:03,969 INFO L273 TraceCheckUtils]: 128: Hoare triple {15429#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {15429#false} is VALID [2018-11-14 18:57:03,969 INFO L273 TraceCheckUtils]: 129: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 18:57:03,969 INFO L273 TraceCheckUtils]: 130: Hoare triple {15429#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {15429#false} is VALID [2018-11-14 18:57:03,969 INFO L273 TraceCheckUtils]: 131: Hoare triple {15429#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {15429#false} is VALID [2018-11-14 18:57:03,969 INFO L273 TraceCheckUtils]: 132: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 18:57:03,970 INFO L273 TraceCheckUtils]: 133: Hoare triple {15429#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {15429#false} is VALID [2018-11-14 18:57:03,970 INFO L273 TraceCheckUtils]: 134: Hoare triple {15429#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {15429#false} is VALID [2018-11-14 18:57:03,970 INFO L273 TraceCheckUtils]: 135: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 18:57:03,970 INFO L273 TraceCheckUtils]: 136: Hoare triple {15429#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {15429#false} is VALID [2018-11-14 18:57:03,970 INFO L273 TraceCheckUtils]: 137: Hoare triple {15429#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {15429#false} is VALID [2018-11-14 18:57:03,970 INFO L273 TraceCheckUtils]: 138: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 18:57:03,970 INFO L273 TraceCheckUtils]: 139: Hoare triple {15429#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {15429#false} is VALID [2018-11-14 18:57:03,970 INFO L273 TraceCheckUtils]: 140: Hoare triple {15429#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {15429#false} is VALID [2018-11-14 18:57:03,970 INFO L273 TraceCheckUtils]: 141: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 18:57:03,970 INFO L273 TraceCheckUtils]: 142: Hoare triple {15429#false} assume !(~i~2 < 99999); {15429#false} is VALID [2018-11-14 18:57:03,971 INFO L273 TraceCheckUtils]: 143: Hoare triple {15429#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {15429#false} is VALID [2018-11-14 18:57:03,971 INFO L256 TraceCheckUtils]: 144: Hoare triple {15429#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {15429#false} is VALID [2018-11-14 18:57:03,971 INFO L273 TraceCheckUtils]: 145: Hoare triple {15429#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {15429#false} is VALID [2018-11-14 18:57:03,971 INFO L273 TraceCheckUtils]: 146: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 18:57:03,971 INFO L273 TraceCheckUtils]: 147: Hoare triple {15429#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 18:57:03,971 INFO L273 TraceCheckUtils]: 148: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 18:57:03,971 INFO L273 TraceCheckUtils]: 149: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 18:57:03,971 INFO L273 TraceCheckUtils]: 150: Hoare triple {15429#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 18:57:03,971 INFO L273 TraceCheckUtils]: 151: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 18:57:03,972 INFO L273 TraceCheckUtils]: 152: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 18:57:03,972 INFO L273 TraceCheckUtils]: 153: Hoare triple {15429#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 18:57:03,972 INFO L273 TraceCheckUtils]: 154: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 18:57:03,972 INFO L273 TraceCheckUtils]: 155: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 18:57:03,972 INFO L273 TraceCheckUtils]: 156: Hoare triple {15429#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 18:57:03,972 INFO L273 TraceCheckUtils]: 157: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 18:57:03,972 INFO L273 TraceCheckUtils]: 158: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 18:57:03,972 INFO L273 TraceCheckUtils]: 159: Hoare triple {15429#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 18:57:03,972 INFO L273 TraceCheckUtils]: 160: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 18:57:03,972 INFO L273 TraceCheckUtils]: 161: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 18:57:03,973 INFO L273 TraceCheckUtils]: 162: Hoare triple {15429#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 18:57:03,973 INFO L273 TraceCheckUtils]: 163: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 18:57:03,973 INFO L273 TraceCheckUtils]: 164: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 18:57:03,973 INFO L273 TraceCheckUtils]: 165: Hoare triple {15429#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 18:57:03,973 INFO L273 TraceCheckUtils]: 166: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 18:57:03,973 INFO L273 TraceCheckUtils]: 167: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 18:57:03,973 INFO L273 TraceCheckUtils]: 168: Hoare triple {15429#false} assume !(~i~0 < 100000); {15429#false} is VALID [2018-11-14 18:57:03,973 INFO L273 TraceCheckUtils]: 169: Hoare triple {15429#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15429#false} is VALID [2018-11-14 18:57:03,973 INFO L273 TraceCheckUtils]: 170: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 18:57:03,974 INFO L268 TraceCheckUtils]: 171: Hoare quadruple {15429#false} {15429#false} #77#return; {15429#false} is VALID [2018-11-14 18:57:03,974 INFO L273 TraceCheckUtils]: 172: Hoare triple {15429#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {15429#false} is VALID [2018-11-14 18:57:03,974 INFO L273 TraceCheckUtils]: 173: Hoare triple {15429#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {15429#false} is VALID [2018-11-14 18:57:03,974 INFO L273 TraceCheckUtils]: 174: Hoare triple {15429#false} assume !false; {15429#false} is VALID [2018-11-14 18:57:03,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1424 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 814 trivial. 0 not checked. [2018-11-14 18:57:04,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:57:04,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-14 18:57:04,009 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 175 [2018-11-14 18:57:04,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:57:04,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-14 18:57:04,110 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-14 18:57:04,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-14 18:57:04,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-14 18:57:04,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-14 18:57:04,111 INFO L87 Difference]: Start difference. First operand 122 states and 126 transitions. Second operand 24 states. [2018-11-14 18:57:04,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:57:04,812 INFO L93 Difference]: Finished difference Result 180 states and 188 transitions. [2018-11-14 18:57:04,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-14 18:57:04,812 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 175 [2018-11-14 18:57:04,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:57:04,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 18:57:04,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 120 transitions. [2018-11-14 18:57:04,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 18:57:04,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 120 transitions. [2018-11-14 18:57:04,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 120 transitions. [2018-11-14 18:57:04,921 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-14 18:57:04,923 INFO L225 Difference]: With dead ends: 180 [2018-11-14 18:57:04,924 INFO L226 Difference]: Without dead ends: 126 [2018-11-14 18:57:04,924 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-14 18:57:04,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-14 18:57:04,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2018-11-14 18:57:04,971 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:57:04,971 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand 125 states. [2018-11-14 18:57:04,972 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 125 states. [2018-11-14 18:57:04,972 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 125 states. [2018-11-14 18:57:04,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:57:04,973 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2018-11-14 18:57:04,974 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2018-11-14 18:57:04,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:57:04,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:57:04,975 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 126 states. [2018-11-14 18:57:04,975 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 126 states. [2018-11-14 18:57:04,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:57:04,977 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2018-11-14 18:57:04,977 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2018-11-14 18:57:04,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:57:04,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:57:04,978 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:57:04,978 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:57:04,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-14 18:57:04,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2018-11-14 18:57:04,980 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 175 [2018-11-14 18:57:04,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:57:04,980 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2018-11-14 18:57:04,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-14 18:57:04,980 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-11-14 18:57:04,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-14 18:57:04,982 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:57:04,982 INFO L375 BasicCegarLoop]: trace histogram [24, 22, 21, 21, 21, 21, 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] [2018-11-14 18:57:04,982 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:57:04,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:57:04,982 INFO L82 PathProgramCache]: Analyzing trace with hash 357637805, now seen corresponding path program 21 times [2018-11-14 18:57:04,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:57:04,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:57:04,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:57:04,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:57:04,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:57:05,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:57:06,185 INFO L256 TraceCheckUtils]: 0: Hoare triple {16639#true} call ULTIMATE.init(); {16639#true} is VALID [2018-11-14 18:57:06,185 INFO L273 TraceCheckUtils]: 1: Hoare triple {16639#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16639#true} is VALID [2018-11-14 18:57:06,185 INFO L273 TraceCheckUtils]: 2: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,186 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16639#true} {16639#true} #69#return; {16639#true} is VALID [2018-11-14 18:57:06,186 INFO L256 TraceCheckUtils]: 4: Hoare triple {16639#true} call #t~ret13 := main(); {16639#true} is VALID [2018-11-14 18:57:06,186 INFO L273 TraceCheckUtils]: 5: Hoare triple {16639#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; {16641#(= main_~i~1 0)} is VALID [2018-11-14 18:57:06,187 INFO L273 TraceCheckUtils]: 6: Hoare triple {16641#(= main_~i~1 0)} assume true; {16641#(= main_~i~1 0)} is VALID [2018-11-14 18:57:06,187 INFO L273 TraceCheckUtils]: 7: Hoare triple {16641#(= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {16641#(= main_~i~1 0)} is VALID [2018-11-14 18:57:06,188 INFO L273 TraceCheckUtils]: 8: Hoare triple {16641#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16642#(<= main_~i~1 1)} is VALID [2018-11-14 18:57:06,188 INFO L273 TraceCheckUtils]: 9: Hoare triple {16642#(<= main_~i~1 1)} assume true; {16642#(<= main_~i~1 1)} is VALID [2018-11-14 18:57:06,188 INFO L273 TraceCheckUtils]: 10: Hoare triple {16642#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {16642#(<= main_~i~1 1)} is VALID [2018-11-14 18:57:06,189 INFO L273 TraceCheckUtils]: 11: Hoare triple {16642#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16643#(<= main_~i~1 2)} is VALID [2018-11-14 18:57:06,189 INFO L273 TraceCheckUtils]: 12: Hoare triple {16643#(<= main_~i~1 2)} assume true; {16643#(<= main_~i~1 2)} is VALID [2018-11-14 18:57:06,189 INFO L273 TraceCheckUtils]: 13: Hoare triple {16643#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {16643#(<= main_~i~1 2)} is VALID [2018-11-14 18:57:06,190 INFO L273 TraceCheckUtils]: 14: Hoare triple {16643#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16644#(<= main_~i~1 3)} is VALID [2018-11-14 18:57:06,191 INFO L273 TraceCheckUtils]: 15: Hoare triple {16644#(<= main_~i~1 3)} assume true; {16644#(<= main_~i~1 3)} is VALID [2018-11-14 18:57:06,191 INFO L273 TraceCheckUtils]: 16: Hoare triple {16644#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {16644#(<= main_~i~1 3)} is VALID [2018-11-14 18:57:06,192 INFO L273 TraceCheckUtils]: 17: Hoare triple {16644#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16645#(<= main_~i~1 4)} is VALID [2018-11-14 18:57:06,192 INFO L273 TraceCheckUtils]: 18: Hoare triple {16645#(<= main_~i~1 4)} assume true; {16645#(<= main_~i~1 4)} is VALID [2018-11-14 18:57:06,193 INFO L273 TraceCheckUtils]: 19: Hoare triple {16645#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {16645#(<= main_~i~1 4)} is VALID [2018-11-14 18:57:06,194 INFO L273 TraceCheckUtils]: 20: Hoare triple {16645#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16646#(<= main_~i~1 5)} is VALID [2018-11-14 18:57:06,194 INFO L273 TraceCheckUtils]: 21: Hoare triple {16646#(<= main_~i~1 5)} assume true; {16646#(<= main_~i~1 5)} is VALID [2018-11-14 18:57:06,195 INFO L273 TraceCheckUtils]: 22: Hoare triple {16646#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {16646#(<= main_~i~1 5)} is VALID [2018-11-14 18:57:06,195 INFO L273 TraceCheckUtils]: 23: Hoare triple {16646#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16647#(<= main_~i~1 6)} is VALID [2018-11-14 18:57:06,196 INFO L273 TraceCheckUtils]: 24: Hoare triple {16647#(<= main_~i~1 6)} assume true; {16647#(<= main_~i~1 6)} is VALID [2018-11-14 18:57:06,196 INFO L273 TraceCheckUtils]: 25: Hoare triple {16647#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {16647#(<= main_~i~1 6)} is VALID [2018-11-14 18:57:06,197 INFO L273 TraceCheckUtils]: 26: Hoare triple {16647#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16648#(<= main_~i~1 7)} is VALID [2018-11-14 18:57:06,198 INFO L273 TraceCheckUtils]: 27: Hoare triple {16648#(<= main_~i~1 7)} assume true; {16648#(<= main_~i~1 7)} is VALID [2018-11-14 18:57:06,198 INFO L273 TraceCheckUtils]: 28: Hoare triple {16648#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {16648#(<= main_~i~1 7)} is VALID [2018-11-14 18:57:06,199 INFO L273 TraceCheckUtils]: 29: Hoare triple {16648#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16649#(<= main_~i~1 8)} is VALID [2018-11-14 18:57:06,199 INFO L273 TraceCheckUtils]: 30: Hoare triple {16649#(<= main_~i~1 8)} assume true; {16649#(<= main_~i~1 8)} is VALID [2018-11-14 18:57:06,200 INFO L273 TraceCheckUtils]: 31: Hoare triple {16649#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {16649#(<= main_~i~1 8)} is VALID [2018-11-14 18:57:06,201 INFO L273 TraceCheckUtils]: 32: Hoare triple {16649#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16650#(<= main_~i~1 9)} is VALID [2018-11-14 18:57:06,201 INFO L273 TraceCheckUtils]: 33: Hoare triple {16650#(<= main_~i~1 9)} assume true; {16650#(<= main_~i~1 9)} is VALID [2018-11-14 18:57:06,202 INFO L273 TraceCheckUtils]: 34: Hoare triple {16650#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {16650#(<= main_~i~1 9)} is VALID [2018-11-14 18:57:06,202 INFO L273 TraceCheckUtils]: 35: Hoare triple {16650#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16651#(<= main_~i~1 10)} is VALID [2018-11-14 18:57:06,203 INFO L273 TraceCheckUtils]: 36: Hoare triple {16651#(<= main_~i~1 10)} assume true; {16651#(<= main_~i~1 10)} is VALID [2018-11-14 18:57:06,203 INFO L273 TraceCheckUtils]: 37: Hoare triple {16651#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {16651#(<= main_~i~1 10)} is VALID [2018-11-14 18:57:06,204 INFO L273 TraceCheckUtils]: 38: Hoare triple {16651#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16652#(<= main_~i~1 11)} is VALID [2018-11-14 18:57:06,205 INFO L273 TraceCheckUtils]: 39: Hoare triple {16652#(<= main_~i~1 11)} assume true; {16652#(<= main_~i~1 11)} is VALID [2018-11-14 18:57:06,205 INFO L273 TraceCheckUtils]: 40: Hoare triple {16652#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {16652#(<= main_~i~1 11)} is VALID [2018-11-14 18:57:06,206 INFO L273 TraceCheckUtils]: 41: Hoare triple {16652#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16653#(<= main_~i~1 12)} is VALID [2018-11-14 18:57:06,206 INFO L273 TraceCheckUtils]: 42: Hoare triple {16653#(<= main_~i~1 12)} assume true; {16653#(<= main_~i~1 12)} is VALID [2018-11-14 18:57:06,207 INFO L273 TraceCheckUtils]: 43: Hoare triple {16653#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {16653#(<= main_~i~1 12)} is VALID [2018-11-14 18:57:06,207 INFO L273 TraceCheckUtils]: 44: Hoare triple {16653#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16654#(<= main_~i~1 13)} is VALID [2018-11-14 18:57:06,208 INFO L273 TraceCheckUtils]: 45: Hoare triple {16654#(<= main_~i~1 13)} assume true; {16654#(<= main_~i~1 13)} is VALID [2018-11-14 18:57:06,208 INFO L273 TraceCheckUtils]: 46: Hoare triple {16654#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {16654#(<= main_~i~1 13)} is VALID [2018-11-14 18:57:06,209 INFO L273 TraceCheckUtils]: 47: Hoare triple {16654#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16655#(<= main_~i~1 14)} is VALID [2018-11-14 18:57:06,210 INFO L273 TraceCheckUtils]: 48: Hoare triple {16655#(<= main_~i~1 14)} assume true; {16655#(<= main_~i~1 14)} is VALID [2018-11-14 18:57:06,210 INFO L273 TraceCheckUtils]: 49: Hoare triple {16655#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {16655#(<= main_~i~1 14)} is VALID [2018-11-14 18:57:06,211 INFO L273 TraceCheckUtils]: 50: Hoare triple {16655#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16656#(<= main_~i~1 15)} is VALID [2018-11-14 18:57:06,211 INFO L273 TraceCheckUtils]: 51: Hoare triple {16656#(<= main_~i~1 15)} assume true; {16656#(<= main_~i~1 15)} is VALID [2018-11-14 18:57:06,212 INFO L273 TraceCheckUtils]: 52: Hoare triple {16656#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {16656#(<= main_~i~1 15)} is VALID [2018-11-14 18:57:06,213 INFO L273 TraceCheckUtils]: 53: Hoare triple {16656#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16657#(<= main_~i~1 16)} is VALID [2018-11-14 18:57:06,213 INFO L273 TraceCheckUtils]: 54: Hoare triple {16657#(<= main_~i~1 16)} assume true; {16657#(<= main_~i~1 16)} is VALID [2018-11-14 18:57:06,214 INFO L273 TraceCheckUtils]: 55: Hoare triple {16657#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {16657#(<= main_~i~1 16)} is VALID [2018-11-14 18:57:06,214 INFO L273 TraceCheckUtils]: 56: Hoare triple {16657#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16658#(<= main_~i~1 17)} is VALID [2018-11-14 18:57:06,215 INFO L273 TraceCheckUtils]: 57: Hoare triple {16658#(<= main_~i~1 17)} assume true; {16658#(<= main_~i~1 17)} is VALID [2018-11-14 18:57:06,215 INFO L273 TraceCheckUtils]: 58: Hoare triple {16658#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {16658#(<= main_~i~1 17)} is VALID [2018-11-14 18:57:06,216 INFO L273 TraceCheckUtils]: 59: Hoare triple {16658#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16659#(<= main_~i~1 18)} is VALID [2018-11-14 18:57:06,217 INFO L273 TraceCheckUtils]: 60: Hoare triple {16659#(<= main_~i~1 18)} assume true; {16659#(<= main_~i~1 18)} is VALID [2018-11-14 18:57:06,217 INFO L273 TraceCheckUtils]: 61: Hoare triple {16659#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {16659#(<= main_~i~1 18)} is VALID [2018-11-14 18:57:06,218 INFO L273 TraceCheckUtils]: 62: Hoare triple {16659#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16660#(<= main_~i~1 19)} is VALID [2018-11-14 18:57:06,218 INFO L273 TraceCheckUtils]: 63: Hoare triple {16660#(<= main_~i~1 19)} assume true; {16660#(<= main_~i~1 19)} is VALID [2018-11-14 18:57:06,219 INFO L273 TraceCheckUtils]: 64: Hoare triple {16660#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {16660#(<= main_~i~1 19)} is VALID [2018-11-14 18:57:06,220 INFO L273 TraceCheckUtils]: 65: Hoare triple {16660#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16661#(<= main_~i~1 20)} is VALID [2018-11-14 18:57:06,220 INFO L273 TraceCheckUtils]: 66: Hoare triple {16661#(<= main_~i~1 20)} assume true; {16661#(<= main_~i~1 20)} is VALID [2018-11-14 18:57:06,221 INFO L273 TraceCheckUtils]: 67: Hoare triple {16661#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {16661#(<= main_~i~1 20)} is VALID [2018-11-14 18:57:06,221 INFO L273 TraceCheckUtils]: 68: Hoare triple {16661#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16662#(<= main_~i~1 21)} is VALID [2018-11-14 18:57:06,222 INFO L273 TraceCheckUtils]: 69: Hoare triple {16662#(<= main_~i~1 21)} assume true; {16662#(<= main_~i~1 21)} is VALID [2018-11-14 18:57:06,222 INFO L273 TraceCheckUtils]: 70: Hoare triple {16662#(<= main_~i~1 21)} assume !(~i~1 < 100000); {16640#false} is VALID [2018-11-14 18:57:06,223 INFO L256 TraceCheckUtils]: 71: Hoare triple {16640#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {16639#true} is VALID [2018-11-14 18:57:06,223 INFO L273 TraceCheckUtils]: 72: Hoare triple {16639#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {16639#true} is VALID [2018-11-14 18:57:06,223 INFO L273 TraceCheckUtils]: 73: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,223 INFO L273 TraceCheckUtils]: 74: Hoare triple {16639#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 18:57:06,223 INFO L273 TraceCheckUtils]: 75: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 18:57:06,224 INFO L273 TraceCheckUtils]: 76: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,224 INFO L273 TraceCheckUtils]: 77: Hoare triple {16639#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 18:57:06,224 INFO L273 TraceCheckUtils]: 78: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 18:57:06,224 INFO L273 TraceCheckUtils]: 79: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,224 INFO L273 TraceCheckUtils]: 80: Hoare triple {16639#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 18:57:06,224 INFO L273 TraceCheckUtils]: 81: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 18:57:06,225 INFO L273 TraceCheckUtils]: 82: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,225 INFO L273 TraceCheckUtils]: 83: Hoare triple {16639#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 18:57:06,225 INFO L273 TraceCheckUtils]: 84: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 18:57:06,225 INFO L273 TraceCheckUtils]: 85: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,225 INFO L273 TraceCheckUtils]: 86: Hoare triple {16639#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 18:57:06,226 INFO L273 TraceCheckUtils]: 87: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 18:57:06,226 INFO L273 TraceCheckUtils]: 88: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,226 INFO L273 TraceCheckUtils]: 89: Hoare triple {16639#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 18:57:06,226 INFO L273 TraceCheckUtils]: 90: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 18:57:06,226 INFO L273 TraceCheckUtils]: 91: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,226 INFO L273 TraceCheckUtils]: 92: Hoare triple {16639#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 18:57:06,227 INFO L273 TraceCheckUtils]: 93: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 18:57:06,227 INFO L273 TraceCheckUtils]: 94: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,227 INFO L273 TraceCheckUtils]: 95: Hoare triple {16639#true} assume !(~i~0 < 100000); {16639#true} is VALID [2018-11-14 18:57:06,227 INFO L273 TraceCheckUtils]: 96: Hoare triple {16639#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {16639#true} is VALID [2018-11-14 18:57:06,227 INFO L273 TraceCheckUtils]: 97: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,227 INFO L268 TraceCheckUtils]: 98: Hoare quadruple {16639#true} {16640#false} #73#return; {16640#false} is VALID [2018-11-14 18:57:06,227 INFO L273 TraceCheckUtils]: 99: Hoare triple {16640#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {16640#false} is VALID [2018-11-14 18:57:06,227 INFO L256 TraceCheckUtils]: 100: Hoare triple {16640#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {16639#true} is VALID [2018-11-14 18:57:06,228 INFO L273 TraceCheckUtils]: 101: Hoare triple {16639#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {16639#true} is VALID [2018-11-14 18:57:06,228 INFO L273 TraceCheckUtils]: 102: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,228 INFO L273 TraceCheckUtils]: 103: Hoare triple {16639#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 18:57:06,228 INFO L273 TraceCheckUtils]: 104: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 18:57:06,228 INFO L273 TraceCheckUtils]: 105: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,228 INFO L273 TraceCheckUtils]: 106: Hoare triple {16639#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 18:57:06,228 INFO L273 TraceCheckUtils]: 107: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 18:57:06,228 INFO L273 TraceCheckUtils]: 108: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,228 INFO L273 TraceCheckUtils]: 109: Hoare triple {16639#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 18:57:06,229 INFO L273 TraceCheckUtils]: 110: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 18:57:06,229 INFO L273 TraceCheckUtils]: 111: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,229 INFO L273 TraceCheckUtils]: 112: Hoare triple {16639#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 18:57:06,229 INFO L273 TraceCheckUtils]: 113: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 18:57:06,229 INFO L273 TraceCheckUtils]: 114: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,229 INFO L273 TraceCheckUtils]: 115: Hoare triple {16639#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 18:57:06,229 INFO L273 TraceCheckUtils]: 116: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 18:57:06,229 INFO L273 TraceCheckUtils]: 117: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,229 INFO L273 TraceCheckUtils]: 118: Hoare triple {16639#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 18:57:06,229 INFO L273 TraceCheckUtils]: 119: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 18:57:06,230 INFO L273 TraceCheckUtils]: 120: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,230 INFO L273 TraceCheckUtils]: 121: Hoare triple {16639#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 18:57:06,230 INFO L273 TraceCheckUtils]: 122: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 18:57:06,230 INFO L273 TraceCheckUtils]: 123: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,230 INFO L273 TraceCheckUtils]: 124: Hoare triple {16639#true} assume !(~i~0 < 100000); {16639#true} is VALID [2018-11-14 18:57:06,230 INFO L273 TraceCheckUtils]: 125: Hoare triple {16639#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {16639#true} is VALID [2018-11-14 18:57:06,230 INFO L273 TraceCheckUtils]: 126: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,230 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {16639#true} {16640#false} #75#return; {16640#false} is VALID [2018-11-14 18:57:06,230 INFO L273 TraceCheckUtils]: 128: Hoare triple {16640#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {16640#false} is VALID [2018-11-14 18:57:06,230 INFO L273 TraceCheckUtils]: 129: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 18:57:06,231 INFO L273 TraceCheckUtils]: 130: Hoare triple {16640#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {16640#false} is VALID [2018-11-14 18:57:06,231 INFO L273 TraceCheckUtils]: 131: Hoare triple {16640#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {16640#false} is VALID [2018-11-14 18:57:06,231 INFO L273 TraceCheckUtils]: 132: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 18:57:06,231 INFO L273 TraceCheckUtils]: 133: Hoare triple {16640#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {16640#false} is VALID [2018-11-14 18:57:06,231 INFO L273 TraceCheckUtils]: 134: Hoare triple {16640#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {16640#false} is VALID [2018-11-14 18:57:06,231 INFO L273 TraceCheckUtils]: 135: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 18:57:06,231 INFO L273 TraceCheckUtils]: 136: Hoare triple {16640#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {16640#false} is VALID [2018-11-14 18:57:06,231 INFO L273 TraceCheckUtils]: 137: Hoare triple {16640#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {16640#false} is VALID [2018-11-14 18:57:06,231 INFO L273 TraceCheckUtils]: 138: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 18:57:06,231 INFO L273 TraceCheckUtils]: 139: Hoare triple {16640#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {16640#false} is VALID [2018-11-14 18:57:06,232 INFO L273 TraceCheckUtils]: 140: Hoare triple {16640#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {16640#false} is VALID [2018-11-14 18:57:06,232 INFO L273 TraceCheckUtils]: 141: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 18:57:06,232 INFO L273 TraceCheckUtils]: 142: Hoare triple {16640#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {16640#false} is VALID [2018-11-14 18:57:06,232 INFO L273 TraceCheckUtils]: 143: Hoare triple {16640#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {16640#false} is VALID [2018-11-14 18:57:06,232 INFO L273 TraceCheckUtils]: 144: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 18:57:06,232 INFO L273 TraceCheckUtils]: 145: Hoare triple {16640#false} assume !(~i~2 < 99999); {16640#false} is VALID [2018-11-14 18:57:06,233 INFO L273 TraceCheckUtils]: 146: Hoare triple {16640#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {16640#false} is VALID [2018-11-14 18:57:06,233 INFO L256 TraceCheckUtils]: 147: Hoare triple {16640#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {16639#true} is VALID [2018-11-14 18:57:06,233 INFO L273 TraceCheckUtils]: 148: Hoare triple {16639#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {16639#true} is VALID [2018-11-14 18:57:06,233 INFO L273 TraceCheckUtils]: 149: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,233 INFO L273 TraceCheckUtils]: 150: Hoare triple {16639#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 18:57:06,233 INFO L273 TraceCheckUtils]: 151: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 18:57:06,234 INFO L273 TraceCheckUtils]: 152: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,234 INFO L273 TraceCheckUtils]: 153: Hoare triple {16639#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 18:57:06,234 INFO L273 TraceCheckUtils]: 154: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 18:57:06,234 INFO L273 TraceCheckUtils]: 155: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,234 INFO L273 TraceCheckUtils]: 156: Hoare triple {16639#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 18:57:06,234 INFO L273 TraceCheckUtils]: 157: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 18:57:06,235 INFO L273 TraceCheckUtils]: 158: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,235 INFO L273 TraceCheckUtils]: 159: Hoare triple {16639#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 18:57:06,235 INFO L273 TraceCheckUtils]: 160: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 18:57:06,235 INFO L273 TraceCheckUtils]: 161: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,235 INFO L273 TraceCheckUtils]: 162: Hoare triple {16639#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 18:57:06,235 INFO L273 TraceCheckUtils]: 163: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 18:57:06,235 INFO L273 TraceCheckUtils]: 164: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,236 INFO L273 TraceCheckUtils]: 165: Hoare triple {16639#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 18:57:06,236 INFO L273 TraceCheckUtils]: 166: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 18:57:06,236 INFO L273 TraceCheckUtils]: 167: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,236 INFO L273 TraceCheckUtils]: 168: Hoare triple {16639#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 18:57:06,236 INFO L273 TraceCheckUtils]: 169: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 18:57:06,236 INFO L273 TraceCheckUtils]: 170: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,237 INFO L273 TraceCheckUtils]: 171: Hoare triple {16639#true} assume !(~i~0 < 100000); {16639#true} is VALID [2018-11-14 18:57:06,237 INFO L273 TraceCheckUtils]: 172: Hoare triple {16639#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {16639#true} is VALID [2018-11-14 18:57:06,237 INFO L273 TraceCheckUtils]: 173: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,237 INFO L268 TraceCheckUtils]: 174: Hoare quadruple {16639#true} {16640#false} #77#return; {16640#false} is VALID [2018-11-14 18:57:06,237 INFO L273 TraceCheckUtils]: 175: Hoare triple {16640#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {16640#false} is VALID [2018-11-14 18:57:06,237 INFO L273 TraceCheckUtils]: 176: Hoare triple {16640#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {16640#false} is VALID [2018-11-14 18:57:06,237 INFO L273 TraceCheckUtils]: 177: Hoare triple {16640#false} assume !false; {16640#false} is VALID [2018-11-14 18:57:06,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1486 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 814 trivial. 0 not checked. [2018-11-14 18:57:06,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:57:06,257 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-14 18:57:06,273 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:57:06,355 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-14 18:57:06,355 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:57:06,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:57:06,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:57:06,649 INFO L256 TraceCheckUtils]: 0: Hoare triple {16639#true} call ULTIMATE.init(); {16639#true} is VALID [2018-11-14 18:57:06,649 INFO L273 TraceCheckUtils]: 1: Hoare triple {16639#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16639#true} is VALID [2018-11-14 18:57:06,649 INFO L273 TraceCheckUtils]: 2: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,649 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16639#true} {16639#true} #69#return; {16639#true} is VALID [2018-11-14 18:57:06,650 INFO L256 TraceCheckUtils]: 4: Hoare triple {16639#true} call #t~ret13 := main(); {16639#true} is VALID [2018-11-14 18:57:06,650 INFO L273 TraceCheckUtils]: 5: Hoare triple {16639#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; {16639#true} is VALID [2018-11-14 18:57:06,650 INFO L273 TraceCheckUtils]: 6: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,650 INFO L273 TraceCheckUtils]: 7: Hoare triple {16639#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 18:57:06,650 INFO L273 TraceCheckUtils]: 8: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 18:57:06,650 INFO L273 TraceCheckUtils]: 9: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,651 INFO L273 TraceCheckUtils]: 10: Hoare triple {16639#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 18:57:06,651 INFO L273 TraceCheckUtils]: 11: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 18:57:06,651 INFO L273 TraceCheckUtils]: 12: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,651 INFO L273 TraceCheckUtils]: 13: Hoare triple {16639#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 18:57:06,651 INFO L273 TraceCheckUtils]: 14: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 18:57:06,651 INFO L273 TraceCheckUtils]: 15: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,652 INFO L273 TraceCheckUtils]: 16: Hoare triple {16639#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 18:57:06,652 INFO L273 TraceCheckUtils]: 17: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 18:57:06,652 INFO L273 TraceCheckUtils]: 18: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,652 INFO L273 TraceCheckUtils]: 19: Hoare triple {16639#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 18:57:06,652 INFO L273 TraceCheckUtils]: 20: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 18:57:06,652 INFO L273 TraceCheckUtils]: 21: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,652 INFO L273 TraceCheckUtils]: 22: Hoare triple {16639#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 18:57:06,652 INFO L273 TraceCheckUtils]: 23: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 18:57:06,652 INFO L273 TraceCheckUtils]: 24: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,653 INFO L273 TraceCheckUtils]: 25: Hoare triple {16639#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 18:57:06,653 INFO L273 TraceCheckUtils]: 26: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 18:57:06,653 INFO L273 TraceCheckUtils]: 27: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,653 INFO L273 TraceCheckUtils]: 28: Hoare triple {16639#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 18:57:06,653 INFO L273 TraceCheckUtils]: 29: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 18:57:06,653 INFO L273 TraceCheckUtils]: 30: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,653 INFO L273 TraceCheckUtils]: 31: Hoare triple {16639#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 18:57:06,653 INFO L273 TraceCheckUtils]: 32: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 18:57:06,653 INFO L273 TraceCheckUtils]: 33: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,654 INFO L273 TraceCheckUtils]: 34: Hoare triple {16639#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 18:57:06,654 INFO L273 TraceCheckUtils]: 35: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 18:57:06,654 INFO L273 TraceCheckUtils]: 36: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,654 INFO L273 TraceCheckUtils]: 37: Hoare triple {16639#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 18:57:06,654 INFO L273 TraceCheckUtils]: 38: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 18:57:06,654 INFO L273 TraceCheckUtils]: 39: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,654 INFO L273 TraceCheckUtils]: 40: Hoare triple {16639#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 18:57:06,654 INFO L273 TraceCheckUtils]: 41: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 18:57:06,654 INFO L273 TraceCheckUtils]: 42: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,654 INFO L273 TraceCheckUtils]: 43: Hoare triple {16639#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 18:57:06,655 INFO L273 TraceCheckUtils]: 44: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 18:57:06,655 INFO L273 TraceCheckUtils]: 45: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,655 INFO L273 TraceCheckUtils]: 46: Hoare triple {16639#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 18:57:06,655 INFO L273 TraceCheckUtils]: 47: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 18:57:06,655 INFO L273 TraceCheckUtils]: 48: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,655 INFO L273 TraceCheckUtils]: 49: Hoare triple {16639#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 18:57:06,655 INFO L273 TraceCheckUtils]: 50: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 18:57:06,655 INFO L273 TraceCheckUtils]: 51: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,655 INFO L273 TraceCheckUtils]: 52: Hoare triple {16639#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 18:57:06,655 INFO L273 TraceCheckUtils]: 53: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 18:57:06,656 INFO L273 TraceCheckUtils]: 54: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,656 INFO L273 TraceCheckUtils]: 55: Hoare triple {16639#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 18:57:06,656 INFO L273 TraceCheckUtils]: 56: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 18:57:06,656 INFO L273 TraceCheckUtils]: 57: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,656 INFO L273 TraceCheckUtils]: 58: Hoare triple {16639#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 18:57:06,656 INFO L273 TraceCheckUtils]: 59: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 18:57:06,656 INFO L273 TraceCheckUtils]: 60: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,656 INFO L273 TraceCheckUtils]: 61: Hoare triple {16639#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 18:57:06,656 INFO L273 TraceCheckUtils]: 62: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 18:57:06,656 INFO L273 TraceCheckUtils]: 63: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,657 INFO L273 TraceCheckUtils]: 64: Hoare triple {16639#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 18:57:06,657 INFO L273 TraceCheckUtils]: 65: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 18:57:06,657 INFO L273 TraceCheckUtils]: 66: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,657 INFO L273 TraceCheckUtils]: 67: Hoare triple {16639#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 18:57:06,657 INFO L273 TraceCheckUtils]: 68: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 18:57:06,657 INFO L273 TraceCheckUtils]: 69: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,657 INFO L273 TraceCheckUtils]: 70: Hoare triple {16639#true} assume !(~i~1 < 100000); {16639#true} is VALID [2018-11-14 18:57:06,657 INFO L256 TraceCheckUtils]: 71: Hoare triple {16639#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {16639#true} is VALID [2018-11-14 18:57:06,657 INFO L273 TraceCheckUtils]: 72: Hoare triple {16639#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {16639#true} is VALID [2018-11-14 18:57:06,658 INFO L273 TraceCheckUtils]: 73: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,658 INFO L273 TraceCheckUtils]: 74: Hoare triple {16639#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 18:57:06,658 INFO L273 TraceCheckUtils]: 75: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 18:57:06,658 INFO L273 TraceCheckUtils]: 76: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,658 INFO L273 TraceCheckUtils]: 77: Hoare triple {16639#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 18:57:06,658 INFO L273 TraceCheckUtils]: 78: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 18:57:06,658 INFO L273 TraceCheckUtils]: 79: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,658 INFO L273 TraceCheckUtils]: 80: Hoare triple {16639#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 18:57:06,658 INFO L273 TraceCheckUtils]: 81: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 18:57:06,658 INFO L273 TraceCheckUtils]: 82: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,659 INFO L273 TraceCheckUtils]: 83: Hoare triple {16639#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 18:57:06,659 INFO L273 TraceCheckUtils]: 84: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 18:57:06,659 INFO L273 TraceCheckUtils]: 85: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,659 INFO L273 TraceCheckUtils]: 86: Hoare triple {16639#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 18:57:06,659 INFO L273 TraceCheckUtils]: 87: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 18:57:06,659 INFO L273 TraceCheckUtils]: 88: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,659 INFO L273 TraceCheckUtils]: 89: Hoare triple {16639#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 18:57:06,659 INFO L273 TraceCheckUtils]: 90: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 18:57:06,659 INFO L273 TraceCheckUtils]: 91: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,659 INFO L273 TraceCheckUtils]: 92: Hoare triple {16639#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 18:57:06,660 INFO L273 TraceCheckUtils]: 93: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 18:57:06,660 INFO L273 TraceCheckUtils]: 94: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,660 INFO L273 TraceCheckUtils]: 95: Hoare triple {16639#true} assume !(~i~0 < 100000); {16639#true} is VALID [2018-11-14 18:57:06,660 INFO L273 TraceCheckUtils]: 96: Hoare triple {16639#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {16639#true} is VALID [2018-11-14 18:57:06,660 INFO L273 TraceCheckUtils]: 97: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,660 INFO L268 TraceCheckUtils]: 98: Hoare quadruple {16639#true} {16639#true} #73#return; {16639#true} is VALID [2018-11-14 18:57:06,660 INFO L273 TraceCheckUtils]: 99: Hoare triple {16639#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {16639#true} is VALID [2018-11-14 18:57:06,660 INFO L256 TraceCheckUtils]: 100: Hoare triple {16639#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {16639#true} is VALID [2018-11-14 18:57:06,660 INFO L273 TraceCheckUtils]: 101: Hoare triple {16639#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {16639#true} is VALID [2018-11-14 18:57:06,661 INFO L273 TraceCheckUtils]: 102: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,661 INFO L273 TraceCheckUtils]: 103: Hoare triple {16639#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 18:57:06,661 INFO L273 TraceCheckUtils]: 104: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 18:57:06,661 INFO L273 TraceCheckUtils]: 105: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,661 INFO L273 TraceCheckUtils]: 106: Hoare triple {16639#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 18:57:06,661 INFO L273 TraceCheckUtils]: 107: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 18:57:06,661 INFO L273 TraceCheckUtils]: 108: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,661 INFO L273 TraceCheckUtils]: 109: Hoare triple {16639#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 18:57:06,661 INFO L273 TraceCheckUtils]: 110: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 18:57:06,661 INFO L273 TraceCheckUtils]: 111: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,662 INFO L273 TraceCheckUtils]: 112: Hoare triple {16639#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 18:57:06,662 INFO L273 TraceCheckUtils]: 113: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 18:57:06,662 INFO L273 TraceCheckUtils]: 114: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,662 INFO L273 TraceCheckUtils]: 115: Hoare triple {16639#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 18:57:06,662 INFO L273 TraceCheckUtils]: 116: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 18:57:06,662 INFO L273 TraceCheckUtils]: 117: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,662 INFO L273 TraceCheckUtils]: 118: Hoare triple {16639#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 18:57:06,662 INFO L273 TraceCheckUtils]: 119: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 18:57:06,662 INFO L273 TraceCheckUtils]: 120: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,662 INFO L273 TraceCheckUtils]: 121: Hoare triple {16639#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 18:57:06,663 INFO L273 TraceCheckUtils]: 122: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 18:57:06,663 INFO L273 TraceCheckUtils]: 123: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,663 INFO L273 TraceCheckUtils]: 124: Hoare triple {16639#true} assume !(~i~0 < 100000); {16639#true} is VALID [2018-11-14 18:57:06,663 INFO L273 TraceCheckUtils]: 125: Hoare triple {16639#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {16639#true} is VALID [2018-11-14 18:57:06,663 INFO L273 TraceCheckUtils]: 126: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 18:57:06,663 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {16639#true} {16639#true} #75#return; {16639#true} is VALID [2018-11-14 18:57:06,664 INFO L273 TraceCheckUtils]: 128: Hoare triple {16639#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {17050#(<= main_~i~2 0)} is VALID [2018-11-14 18:57:06,664 INFO L273 TraceCheckUtils]: 129: Hoare triple {17050#(<= main_~i~2 0)} assume true; {17050#(<= main_~i~2 0)} is VALID [2018-11-14 18:57:06,664 INFO L273 TraceCheckUtils]: 130: Hoare triple {17050#(<= main_~i~2 0)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17050#(<= main_~i~2 0)} is VALID [2018-11-14 18:57:06,665 INFO L273 TraceCheckUtils]: 131: Hoare triple {17050#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17060#(<= main_~i~2 1)} is VALID [2018-11-14 18:57:06,665 INFO L273 TraceCheckUtils]: 132: Hoare triple {17060#(<= main_~i~2 1)} assume true; {17060#(<= main_~i~2 1)} is VALID [2018-11-14 18:57:06,665 INFO L273 TraceCheckUtils]: 133: Hoare triple {17060#(<= main_~i~2 1)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17060#(<= main_~i~2 1)} is VALID [2018-11-14 18:57:06,666 INFO L273 TraceCheckUtils]: 134: Hoare triple {17060#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17070#(<= main_~i~2 2)} is VALID [2018-11-14 18:57:06,666 INFO L273 TraceCheckUtils]: 135: Hoare triple {17070#(<= main_~i~2 2)} assume true; {17070#(<= main_~i~2 2)} is VALID [2018-11-14 18:57:06,666 INFO L273 TraceCheckUtils]: 136: Hoare triple {17070#(<= main_~i~2 2)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17070#(<= main_~i~2 2)} is VALID [2018-11-14 18:57:06,667 INFO L273 TraceCheckUtils]: 137: Hoare triple {17070#(<= main_~i~2 2)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17080#(<= main_~i~2 3)} is VALID [2018-11-14 18:57:06,667 INFO L273 TraceCheckUtils]: 138: Hoare triple {17080#(<= main_~i~2 3)} assume true; {17080#(<= main_~i~2 3)} is VALID [2018-11-14 18:57:06,667 INFO L273 TraceCheckUtils]: 139: Hoare triple {17080#(<= main_~i~2 3)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17080#(<= main_~i~2 3)} is VALID [2018-11-14 18:57:06,668 INFO L273 TraceCheckUtils]: 140: Hoare triple {17080#(<= main_~i~2 3)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17090#(<= main_~i~2 4)} is VALID [2018-11-14 18:57:06,668 INFO L273 TraceCheckUtils]: 141: Hoare triple {17090#(<= main_~i~2 4)} assume true; {17090#(<= main_~i~2 4)} is VALID [2018-11-14 18:57:06,669 INFO L273 TraceCheckUtils]: 142: Hoare triple {17090#(<= main_~i~2 4)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17090#(<= main_~i~2 4)} is VALID [2018-11-14 18:57:06,669 INFO L273 TraceCheckUtils]: 143: Hoare triple {17090#(<= main_~i~2 4)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17100#(<= main_~i~2 5)} is VALID [2018-11-14 18:57:06,670 INFO L273 TraceCheckUtils]: 144: Hoare triple {17100#(<= main_~i~2 5)} assume true; {17100#(<= main_~i~2 5)} is VALID [2018-11-14 18:57:06,671 INFO L273 TraceCheckUtils]: 145: Hoare triple {17100#(<= main_~i~2 5)} assume !(~i~2 < 99999); {16640#false} is VALID [2018-11-14 18:57:06,671 INFO L273 TraceCheckUtils]: 146: Hoare triple {16640#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {16640#false} is VALID [2018-11-14 18:57:06,671 INFO L256 TraceCheckUtils]: 147: Hoare triple {16640#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {16640#false} is VALID [2018-11-14 18:57:06,671 INFO L273 TraceCheckUtils]: 148: Hoare triple {16640#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {16640#false} is VALID [2018-11-14 18:57:06,671 INFO L273 TraceCheckUtils]: 149: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 18:57:06,672 INFO L273 TraceCheckUtils]: 150: Hoare triple {16640#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16640#false} is VALID [2018-11-14 18:57:06,672 INFO L273 TraceCheckUtils]: 151: Hoare triple {16640#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16640#false} is VALID [2018-11-14 18:57:06,672 INFO L273 TraceCheckUtils]: 152: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 18:57:06,672 INFO L273 TraceCheckUtils]: 153: Hoare triple {16640#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16640#false} is VALID [2018-11-14 18:57:06,672 INFO L273 TraceCheckUtils]: 154: Hoare triple {16640#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16640#false} is VALID [2018-11-14 18:57:06,673 INFO L273 TraceCheckUtils]: 155: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 18:57:06,673 INFO L273 TraceCheckUtils]: 156: Hoare triple {16640#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16640#false} is VALID [2018-11-14 18:57:06,673 INFO L273 TraceCheckUtils]: 157: Hoare triple {16640#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16640#false} is VALID [2018-11-14 18:57:06,673 INFO L273 TraceCheckUtils]: 158: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 18:57:06,673 INFO L273 TraceCheckUtils]: 159: Hoare triple {16640#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16640#false} is VALID [2018-11-14 18:57:06,673 INFO L273 TraceCheckUtils]: 160: Hoare triple {16640#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16640#false} is VALID [2018-11-14 18:57:06,673 INFO L273 TraceCheckUtils]: 161: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 18:57:06,673 INFO L273 TraceCheckUtils]: 162: Hoare triple {16640#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16640#false} is VALID [2018-11-14 18:57:06,673 INFO L273 TraceCheckUtils]: 163: Hoare triple {16640#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16640#false} is VALID [2018-11-14 18:57:06,674 INFO L273 TraceCheckUtils]: 164: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 18:57:06,674 INFO L273 TraceCheckUtils]: 165: Hoare triple {16640#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16640#false} is VALID [2018-11-14 18:57:06,674 INFO L273 TraceCheckUtils]: 166: Hoare triple {16640#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16640#false} is VALID [2018-11-14 18:57:06,674 INFO L273 TraceCheckUtils]: 167: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 18:57:06,674 INFO L273 TraceCheckUtils]: 168: Hoare triple {16640#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16640#false} is VALID [2018-11-14 18:57:06,674 INFO L273 TraceCheckUtils]: 169: Hoare triple {16640#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16640#false} is VALID [2018-11-14 18:57:06,674 INFO L273 TraceCheckUtils]: 170: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 18:57:06,674 INFO L273 TraceCheckUtils]: 171: Hoare triple {16640#false} assume !(~i~0 < 100000); {16640#false} is VALID [2018-11-14 18:57:06,674 INFO L273 TraceCheckUtils]: 172: Hoare triple {16640#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {16640#false} is VALID [2018-11-14 18:57:06,674 INFO L273 TraceCheckUtils]: 173: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 18:57:06,675 INFO L268 TraceCheckUtils]: 174: Hoare quadruple {16640#false} {16640#false} #77#return; {16640#false} is VALID [2018-11-14 18:57:06,675 INFO L273 TraceCheckUtils]: 175: Hoare triple {16640#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {16640#false} is VALID [2018-11-14 18:57:06,675 INFO L273 TraceCheckUtils]: 176: Hoare triple {16640#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {16640#false} is VALID [2018-11-14 18:57:06,675 INFO L273 TraceCheckUtils]: 177: Hoare triple {16640#false} assume !false; {16640#false} is VALID [2018-11-14 18:57:06,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1486 backedges. 362 proven. 40 refuted. 0 times theorem prover too weak. 1084 trivial. 0 not checked. [2018-11-14 18:57:06,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:57:06,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 8] total 30 [2018-11-14 18:57:06,709 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 178 [2018-11-14 18:57:06,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:57:06,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-14 18:57:06,825 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-14 18:57:06,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-14 18:57:06,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-14 18:57:06,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=567, Unknown=0, NotChecked=0, Total=870 [2018-11-14 18:57:06,827 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand 30 states. [2018-11-14 18:57:08,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:57:08,566 INFO L93 Difference]: Finished difference Result 187 states and 196 transitions. [2018-11-14 18:57:08,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-14 18:57:08,566 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 178 [2018-11-14 18:57:08,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:57:08,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 18:57:08,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 142 transitions. [2018-11-14 18:57:08,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 18:57:08,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 142 transitions. [2018-11-14 18:57:08,568 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 142 transitions. [2018-11-14 18:57:08,698 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-14 18:57:08,701 INFO L225 Difference]: With dead ends: 187 [2018-11-14 18:57:08,701 INFO L226 Difference]: Without dead ends: 133 [2018-11-14 18:57:08,702 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=303, Invalid=567, Unknown=0, NotChecked=0, Total=870 [2018-11-14 18:57:08,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-14 18:57:08,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-11-14 18:57:08,831 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:57:08,831 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand 131 states. [2018-11-14 18:57:08,831 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 131 states. [2018-11-14 18:57:08,831 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 131 states. [2018-11-14 18:57:08,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:57:08,833 INFO L93 Difference]: Finished difference Result 133 states and 137 transitions. [2018-11-14 18:57:08,833 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2018-11-14 18:57:08,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:57:08,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:57:08,834 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand 133 states. [2018-11-14 18:57:08,834 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 133 states. [2018-11-14 18:57:08,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:57:08,835 INFO L93 Difference]: Finished difference Result 133 states and 137 transitions. [2018-11-14 18:57:08,835 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2018-11-14 18:57:08,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:57:08,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:57:08,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:57:08,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:57:08,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-14 18:57:08,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 135 transitions. [2018-11-14 18:57:08,839 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 135 transitions. Word has length 178 [2018-11-14 18:57:08,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:57:08,839 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 135 transitions. [2018-11-14 18:57:08,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-14 18:57:08,839 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2018-11-14 18:57:08,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-14 18:57:08,840 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:57:08,840 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 22, 22, 21, 21, 7, 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-14 18:57:08,841 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:57:08,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:57:08,841 INFO L82 PathProgramCache]: Analyzing trace with hash -24903163, now seen corresponding path program 22 times [2018-11-14 18:57:08,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:57:08,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:57:08,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:57:08,842 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:57:08,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:57:08,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:57:09,450 INFO L256 TraceCheckUtils]: 0: Hoare triple {17896#true} call ULTIMATE.init(); {17896#true} is VALID [2018-11-14 18:57:09,450 INFO L273 TraceCheckUtils]: 1: Hoare triple {17896#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17896#true} is VALID [2018-11-14 18:57:09,451 INFO L273 TraceCheckUtils]: 2: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 18:57:09,451 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17896#true} {17896#true} #69#return; {17896#true} is VALID [2018-11-14 18:57:09,451 INFO L256 TraceCheckUtils]: 4: Hoare triple {17896#true} call #t~ret13 := main(); {17896#true} is VALID [2018-11-14 18:57:09,455 INFO L273 TraceCheckUtils]: 5: Hoare triple {17896#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; {17898#(= main_~i~1 0)} is VALID [2018-11-14 18:57:09,455 INFO L273 TraceCheckUtils]: 6: Hoare triple {17898#(= main_~i~1 0)} assume true; {17898#(= main_~i~1 0)} is VALID [2018-11-14 18:57:09,455 INFO L273 TraceCheckUtils]: 7: Hoare triple {17898#(= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {17898#(= main_~i~1 0)} is VALID [2018-11-14 18:57:09,456 INFO L273 TraceCheckUtils]: 8: Hoare triple {17898#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17899#(<= main_~i~1 1)} is VALID [2018-11-14 18:57:09,456 INFO L273 TraceCheckUtils]: 9: Hoare triple {17899#(<= main_~i~1 1)} assume true; {17899#(<= main_~i~1 1)} is VALID [2018-11-14 18:57:09,457 INFO L273 TraceCheckUtils]: 10: Hoare triple {17899#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {17899#(<= main_~i~1 1)} is VALID [2018-11-14 18:57:09,457 INFO L273 TraceCheckUtils]: 11: Hoare triple {17899#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17900#(<= main_~i~1 2)} is VALID [2018-11-14 18:57:09,457 INFO L273 TraceCheckUtils]: 12: Hoare triple {17900#(<= main_~i~1 2)} assume true; {17900#(<= main_~i~1 2)} is VALID [2018-11-14 18:57:09,458 INFO L273 TraceCheckUtils]: 13: Hoare triple {17900#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {17900#(<= main_~i~1 2)} is VALID [2018-11-14 18:57:09,458 INFO L273 TraceCheckUtils]: 14: Hoare triple {17900#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17901#(<= main_~i~1 3)} is VALID [2018-11-14 18:57:09,458 INFO L273 TraceCheckUtils]: 15: Hoare triple {17901#(<= main_~i~1 3)} assume true; {17901#(<= main_~i~1 3)} is VALID [2018-11-14 18:57:09,459 INFO L273 TraceCheckUtils]: 16: Hoare triple {17901#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {17901#(<= main_~i~1 3)} is VALID [2018-11-14 18:57:09,460 INFO L273 TraceCheckUtils]: 17: Hoare triple {17901#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17902#(<= main_~i~1 4)} is VALID [2018-11-14 18:57:09,460 INFO L273 TraceCheckUtils]: 18: Hoare triple {17902#(<= main_~i~1 4)} assume true; {17902#(<= main_~i~1 4)} is VALID [2018-11-14 18:57:09,461 INFO L273 TraceCheckUtils]: 19: Hoare triple {17902#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {17902#(<= main_~i~1 4)} is VALID [2018-11-14 18:57:09,461 INFO L273 TraceCheckUtils]: 20: Hoare triple {17902#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17903#(<= main_~i~1 5)} is VALID [2018-11-14 18:57:09,462 INFO L273 TraceCheckUtils]: 21: Hoare triple {17903#(<= main_~i~1 5)} assume true; {17903#(<= main_~i~1 5)} is VALID [2018-11-14 18:57:09,463 INFO L273 TraceCheckUtils]: 22: Hoare triple {17903#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {17903#(<= main_~i~1 5)} is VALID [2018-11-14 18:57:09,463 INFO L273 TraceCheckUtils]: 23: Hoare triple {17903#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17904#(<= main_~i~1 6)} is VALID [2018-11-14 18:57:09,464 INFO L273 TraceCheckUtils]: 24: Hoare triple {17904#(<= main_~i~1 6)} assume true; {17904#(<= main_~i~1 6)} is VALID [2018-11-14 18:57:09,464 INFO L273 TraceCheckUtils]: 25: Hoare triple {17904#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {17904#(<= main_~i~1 6)} is VALID [2018-11-14 18:57:09,465 INFO L273 TraceCheckUtils]: 26: Hoare triple {17904#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17905#(<= main_~i~1 7)} is VALID [2018-11-14 18:57:09,466 INFO L273 TraceCheckUtils]: 27: Hoare triple {17905#(<= main_~i~1 7)} assume true; {17905#(<= main_~i~1 7)} is VALID [2018-11-14 18:57:09,466 INFO L273 TraceCheckUtils]: 28: Hoare triple {17905#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {17905#(<= main_~i~1 7)} is VALID [2018-11-14 18:57:09,467 INFO L273 TraceCheckUtils]: 29: Hoare triple {17905#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17906#(<= main_~i~1 8)} is VALID [2018-11-14 18:57:09,467 INFO L273 TraceCheckUtils]: 30: Hoare triple {17906#(<= main_~i~1 8)} assume true; {17906#(<= main_~i~1 8)} is VALID [2018-11-14 18:57:09,468 INFO L273 TraceCheckUtils]: 31: Hoare triple {17906#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {17906#(<= main_~i~1 8)} is VALID [2018-11-14 18:57:09,468 INFO L273 TraceCheckUtils]: 32: Hoare triple {17906#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17907#(<= main_~i~1 9)} is VALID [2018-11-14 18:57:09,469 INFO L273 TraceCheckUtils]: 33: Hoare triple {17907#(<= main_~i~1 9)} assume true; {17907#(<= main_~i~1 9)} is VALID [2018-11-14 18:57:09,470 INFO L273 TraceCheckUtils]: 34: Hoare triple {17907#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {17907#(<= main_~i~1 9)} is VALID [2018-11-14 18:57:09,470 INFO L273 TraceCheckUtils]: 35: Hoare triple {17907#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17908#(<= main_~i~1 10)} is VALID [2018-11-14 18:57:09,471 INFO L273 TraceCheckUtils]: 36: Hoare triple {17908#(<= main_~i~1 10)} assume true; {17908#(<= main_~i~1 10)} is VALID [2018-11-14 18:57:09,471 INFO L273 TraceCheckUtils]: 37: Hoare triple {17908#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {17908#(<= main_~i~1 10)} is VALID [2018-11-14 18:57:09,472 INFO L273 TraceCheckUtils]: 38: Hoare triple {17908#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17909#(<= main_~i~1 11)} is VALID [2018-11-14 18:57:09,472 INFO L273 TraceCheckUtils]: 39: Hoare triple {17909#(<= main_~i~1 11)} assume true; {17909#(<= main_~i~1 11)} is VALID [2018-11-14 18:57:09,473 INFO L273 TraceCheckUtils]: 40: Hoare triple {17909#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {17909#(<= main_~i~1 11)} is VALID [2018-11-14 18:57:09,474 INFO L273 TraceCheckUtils]: 41: Hoare triple {17909#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17910#(<= main_~i~1 12)} is VALID [2018-11-14 18:57:09,474 INFO L273 TraceCheckUtils]: 42: Hoare triple {17910#(<= main_~i~1 12)} assume true; {17910#(<= main_~i~1 12)} is VALID [2018-11-14 18:57:09,475 INFO L273 TraceCheckUtils]: 43: Hoare triple {17910#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {17910#(<= main_~i~1 12)} is VALID [2018-11-14 18:57:09,475 INFO L273 TraceCheckUtils]: 44: Hoare triple {17910#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17911#(<= main_~i~1 13)} is VALID [2018-11-14 18:57:09,476 INFO L273 TraceCheckUtils]: 45: Hoare triple {17911#(<= main_~i~1 13)} assume true; {17911#(<= main_~i~1 13)} is VALID [2018-11-14 18:57:09,476 INFO L273 TraceCheckUtils]: 46: Hoare triple {17911#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {17911#(<= main_~i~1 13)} is VALID [2018-11-14 18:57:09,477 INFO L273 TraceCheckUtils]: 47: Hoare triple {17911#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17912#(<= main_~i~1 14)} is VALID [2018-11-14 18:57:09,478 INFO L273 TraceCheckUtils]: 48: Hoare triple {17912#(<= main_~i~1 14)} assume true; {17912#(<= main_~i~1 14)} is VALID [2018-11-14 18:57:09,478 INFO L273 TraceCheckUtils]: 49: Hoare triple {17912#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {17912#(<= main_~i~1 14)} is VALID [2018-11-14 18:57:09,479 INFO L273 TraceCheckUtils]: 50: Hoare triple {17912#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17913#(<= main_~i~1 15)} is VALID [2018-11-14 18:57:09,479 INFO L273 TraceCheckUtils]: 51: Hoare triple {17913#(<= main_~i~1 15)} assume true; {17913#(<= main_~i~1 15)} is VALID [2018-11-14 18:57:09,480 INFO L273 TraceCheckUtils]: 52: Hoare triple {17913#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {17913#(<= main_~i~1 15)} is VALID [2018-11-14 18:57:09,481 INFO L273 TraceCheckUtils]: 53: Hoare triple {17913#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17914#(<= main_~i~1 16)} is VALID [2018-11-14 18:57:09,481 INFO L273 TraceCheckUtils]: 54: Hoare triple {17914#(<= main_~i~1 16)} assume true; {17914#(<= main_~i~1 16)} is VALID [2018-11-14 18:57:09,482 INFO L273 TraceCheckUtils]: 55: Hoare triple {17914#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {17914#(<= main_~i~1 16)} is VALID [2018-11-14 18:57:09,482 INFO L273 TraceCheckUtils]: 56: Hoare triple {17914#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17915#(<= main_~i~1 17)} is VALID [2018-11-14 18:57:09,483 INFO L273 TraceCheckUtils]: 57: Hoare triple {17915#(<= main_~i~1 17)} assume true; {17915#(<= main_~i~1 17)} is VALID [2018-11-14 18:57:09,483 INFO L273 TraceCheckUtils]: 58: Hoare triple {17915#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {17915#(<= main_~i~1 17)} is VALID [2018-11-14 18:57:09,484 INFO L273 TraceCheckUtils]: 59: Hoare triple {17915#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17916#(<= main_~i~1 18)} is VALID [2018-11-14 18:57:09,485 INFO L273 TraceCheckUtils]: 60: Hoare triple {17916#(<= main_~i~1 18)} assume true; {17916#(<= main_~i~1 18)} is VALID [2018-11-14 18:57:09,485 INFO L273 TraceCheckUtils]: 61: Hoare triple {17916#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {17916#(<= main_~i~1 18)} is VALID [2018-11-14 18:57:09,486 INFO L273 TraceCheckUtils]: 62: Hoare triple {17916#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17917#(<= main_~i~1 19)} is VALID [2018-11-14 18:57:09,486 INFO L273 TraceCheckUtils]: 63: Hoare triple {17917#(<= main_~i~1 19)} assume true; {17917#(<= main_~i~1 19)} is VALID [2018-11-14 18:57:09,487 INFO L273 TraceCheckUtils]: 64: Hoare triple {17917#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {17917#(<= main_~i~1 19)} is VALID [2018-11-14 18:57:09,488 INFO L273 TraceCheckUtils]: 65: Hoare triple {17917#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17918#(<= main_~i~1 20)} is VALID [2018-11-14 18:57:09,488 INFO L273 TraceCheckUtils]: 66: Hoare triple {17918#(<= main_~i~1 20)} assume true; {17918#(<= main_~i~1 20)} is VALID [2018-11-14 18:57:09,489 INFO L273 TraceCheckUtils]: 67: Hoare triple {17918#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {17918#(<= main_~i~1 20)} is VALID [2018-11-14 18:57:09,489 INFO L273 TraceCheckUtils]: 68: Hoare triple {17918#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17919#(<= main_~i~1 21)} is VALID [2018-11-14 18:57:09,490 INFO L273 TraceCheckUtils]: 69: Hoare triple {17919#(<= main_~i~1 21)} assume true; {17919#(<= main_~i~1 21)} is VALID [2018-11-14 18:57:09,490 INFO L273 TraceCheckUtils]: 70: Hoare triple {17919#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {17919#(<= main_~i~1 21)} is VALID [2018-11-14 18:57:09,491 INFO L273 TraceCheckUtils]: 71: Hoare triple {17919#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17920#(<= main_~i~1 22)} is VALID [2018-11-14 18:57:09,492 INFO L273 TraceCheckUtils]: 72: Hoare triple {17920#(<= main_~i~1 22)} assume true; {17920#(<= main_~i~1 22)} is VALID [2018-11-14 18:57:09,492 INFO L273 TraceCheckUtils]: 73: Hoare triple {17920#(<= main_~i~1 22)} assume !(~i~1 < 100000); {17897#false} is VALID [2018-11-14 18:57:09,492 INFO L256 TraceCheckUtils]: 74: Hoare triple {17897#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {17896#true} is VALID [2018-11-14 18:57:09,493 INFO L273 TraceCheckUtils]: 75: Hoare triple {17896#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {17896#true} is VALID [2018-11-14 18:57:09,493 INFO L273 TraceCheckUtils]: 76: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 18:57:09,493 INFO L273 TraceCheckUtils]: 77: Hoare triple {17896#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 18:57:09,493 INFO L273 TraceCheckUtils]: 78: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 18:57:09,493 INFO L273 TraceCheckUtils]: 79: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 18:57:09,494 INFO L273 TraceCheckUtils]: 80: Hoare triple {17896#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 18:57:09,494 INFO L273 TraceCheckUtils]: 81: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 18:57:09,494 INFO L273 TraceCheckUtils]: 82: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 18:57:09,494 INFO L273 TraceCheckUtils]: 83: Hoare triple {17896#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 18:57:09,494 INFO L273 TraceCheckUtils]: 84: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 18:57:09,495 INFO L273 TraceCheckUtils]: 85: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 18:57:09,495 INFO L273 TraceCheckUtils]: 86: Hoare triple {17896#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 18:57:09,495 INFO L273 TraceCheckUtils]: 87: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 18:57:09,495 INFO L273 TraceCheckUtils]: 88: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 18:57:09,495 INFO L273 TraceCheckUtils]: 89: Hoare triple {17896#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 18:57:09,495 INFO L273 TraceCheckUtils]: 90: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 18:57:09,496 INFO L273 TraceCheckUtils]: 91: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 18:57:09,496 INFO L273 TraceCheckUtils]: 92: Hoare triple {17896#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 18:57:09,496 INFO L273 TraceCheckUtils]: 93: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 18:57:09,496 INFO L273 TraceCheckUtils]: 94: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 18:57:09,496 INFO L273 TraceCheckUtils]: 95: Hoare triple {17896#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 18:57:09,497 INFO L273 TraceCheckUtils]: 96: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 18:57:09,497 INFO L273 TraceCheckUtils]: 97: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 18:57:09,497 INFO L273 TraceCheckUtils]: 98: Hoare triple {17896#true} assume !(~i~0 < 100000); {17896#true} is VALID [2018-11-14 18:57:09,497 INFO L273 TraceCheckUtils]: 99: Hoare triple {17896#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {17896#true} is VALID [2018-11-14 18:57:09,497 INFO L273 TraceCheckUtils]: 100: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 18:57:09,497 INFO L268 TraceCheckUtils]: 101: Hoare quadruple {17896#true} {17897#false} #73#return; {17897#false} is VALID [2018-11-14 18:57:09,497 INFO L273 TraceCheckUtils]: 102: Hoare triple {17897#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {17897#false} is VALID [2018-11-14 18:57:09,498 INFO L256 TraceCheckUtils]: 103: Hoare triple {17897#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {17896#true} is VALID [2018-11-14 18:57:09,498 INFO L273 TraceCheckUtils]: 104: Hoare triple {17896#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {17896#true} is VALID [2018-11-14 18:57:09,498 INFO L273 TraceCheckUtils]: 105: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 18:57:09,498 INFO L273 TraceCheckUtils]: 106: Hoare triple {17896#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 18:57:09,498 INFO L273 TraceCheckUtils]: 107: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 18:57:09,498 INFO L273 TraceCheckUtils]: 108: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 18:57:09,498 INFO L273 TraceCheckUtils]: 109: Hoare triple {17896#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 18:57:09,498 INFO L273 TraceCheckUtils]: 110: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 18:57:09,498 INFO L273 TraceCheckUtils]: 111: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 18:57:09,498 INFO L273 TraceCheckUtils]: 112: Hoare triple {17896#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 18:57:09,499 INFO L273 TraceCheckUtils]: 113: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 18:57:09,499 INFO L273 TraceCheckUtils]: 114: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 18:57:09,499 INFO L273 TraceCheckUtils]: 115: Hoare triple {17896#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 18:57:09,499 INFO L273 TraceCheckUtils]: 116: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 18:57:09,499 INFO L273 TraceCheckUtils]: 117: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 18:57:09,499 INFO L273 TraceCheckUtils]: 118: Hoare triple {17896#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 18:57:09,499 INFO L273 TraceCheckUtils]: 119: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 18:57:09,499 INFO L273 TraceCheckUtils]: 120: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 18:57:09,499 INFO L273 TraceCheckUtils]: 121: Hoare triple {17896#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 18:57:09,500 INFO L273 TraceCheckUtils]: 122: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 18:57:09,500 INFO L273 TraceCheckUtils]: 123: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 18:57:09,500 INFO L273 TraceCheckUtils]: 124: Hoare triple {17896#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 18:57:09,500 INFO L273 TraceCheckUtils]: 125: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 18:57:09,500 INFO L273 TraceCheckUtils]: 126: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 18:57:09,500 INFO L273 TraceCheckUtils]: 127: Hoare triple {17896#true} assume !(~i~0 < 100000); {17896#true} is VALID [2018-11-14 18:57:09,500 INFO L273 TraceCheckUtils]: 128: Hoare triple {17896#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {17896#true} is VALID [2018-11-14 18:57:09,500 INFO L273 TraceCheckUtils]: 129: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 18:57:09,500 INFO L268 TraceCheckUtils]: 130: Hoare quadruple {17896#true} {17897#false} #75#return; {17897#false} is VALID [2018-11-14 18:57:09,500 INFO L273 TraceCheckUtils]: 131: Hoare triple {17897#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {17897#false} is VALID [2018-11-14 18:57:09,501 INFO L273 TraceCheckUtils]: 132: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 18:57:09,501 INFO L273 TraceCheckUtils]: 133: Hoare triple {17897#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17897#false} is VALID [2018-11-14 18:57:09,501 INFO L273 TraceCheckUtils]: 134: Hoare triple {17897#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17897#false} is VALID [2018-11-14 18:57:09,501 INFO L273 TraceCheckUtils]: 135: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 18:57:09,501 INFO L273 TraceCheckUtils]: 136: Hoare triple {17897#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17897#false} is VALID [2018-11-14 18:57:09,501 INFO L273 TraceCheckUtils]: 137: Hoare triple {17897#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17897#false} is VALID [2018-11-14 18:57:09,501 INFO L273 TraceCheckUtils]: 138: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 18:57:09,501 INFO L273 TraceCheckUtils]: 139: Hoare triple {17897#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17897#false} is VALID [2018-11-14 18:57:09,501 INFO L273 TraceCheckUtils]: 140: Hoare triple {17897#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17897#false} is VALID [2018-11-14 18:57:09,502 INFO L273 TraceCheckUtils]: 141: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 18:57:09,502 INFO L273 TraceCheckUtils]: 142: Hoare triple {17897#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17897#false} is VALID [2018-11-14 18:57:09,502 INFO L273 TraceCheckUtils]: 143: Hoare triple {17897#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17897#false} is VALID [2018-11-14 18:57:09,502 INFO L273 TraceCheckUtils]: 144: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 18:57:09,502 INFO L273 TraceCheckUtils]: 145: Hoare triple {17897#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17897#false} is VALID [2018-11-14 18:57:09,502 INFO L273 TraceCheckUtils]: 146: Hoare triple {17897#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17897#false} is VALID [2018-11-14 18:57:09,502 INFO L273 TraceCheckUtils]: 147: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 18:57:09,502 INFO L273 TraceCheckUtils]: 148: Hoare triple {17897#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17897#false} is VALID [2018-11-14 18:57:09,502 INFO L273 TraceCheckUtils]: 149: Hoare triple {17897#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17897#false} is VALID [2018-11-14 18:57:09,503 INFO L273 TraceCheckUtils]: 150: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 18:57:09,503 INFO L273 TraceCheckUtils]: 151: Hoare triple {17897#false} assume !(~i~2 < 99999); {17897#false} is VALID [2018-11-14 18:57:09,503 INFO L273 TraceCheckUtils]: 152: Hoare triple {17897#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {17897#false} is VALID [2018-11-14 18:57:09,503 INFO L256 TraceCheckUtils]: 153: Hoare triple {17897#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {17896#true} is VALID [2018-11-14 18:57:09,503 INFO L273 TraceCheckUtils]: 154: Hoare triple {17896#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {17896#true} is VALID [2018-11-14 18:57:09,503 INFO L273 TraceCheckUtils]: 155: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 18:57:09,503 INFO L273 TraceCheckUtils]: 156: Hoare triple {17896#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 18:57:09,503 INFO L273 TraceCheckUtils]: 157: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 18:57:09,503 INFO L273 TraceCheckUtils]: 158: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 18:57:09,503 INFO L273 TraceCheckUtils]: 159: Hoare triple {17896#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 18:57:09,504 INFO L273 TraceCheckUtils]: 160: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 18:57:09,504 INFO L273 TraceCheckUtils]: 161: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 18:57:09,504 INFO L273 TraceCheckUtils]: 162: Hoare triple {17896#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 18:57:09,504 INFO L273 TraceCheckUtils]: 163: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 18:57:09,504 INFO L273 TraceCheckUtils]: 164: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 18:57:09,504 INFO L273 TraceCheckUtils]: 165: Hoare triple {17896#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 18:57:09,504 INFO L273 TraceCheckUtils]: 166: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 18:57:09,504 INFO L273 TraceCheckUtils]: 167: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 18:57:09,504 INFO L273 TraceCheckUtils]: 168: Hoare triple {17896#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 18:57:09,505 INFO L273 TraceCheckUtils]: 169: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 18:57:09,505 INFO L273 TraceCheckUtils]: 170: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 18:57:09,505 INFO L273 TraceCheckUtils]: 171: Hoare triple {17896#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 18:57:09,505 INFO L273 TraceCheckUtils]: 172: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 18:57:09,505 INFO L273 TraceCheckUtils]: 173: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 18:57:09,505 INFO L273 TraceCheckUtils]: 174: Hoare triple {17896#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17896#true} is VALID [2018-11-14 18:57:09,505 INFO L273 TraceCheckUtils]: 175: Hoare triple {17896#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17896#true} is VALID [2018-11-14 18:57:09,505 INFO L273 TraceCheckUtils]: 176: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 18:57:09,505 INFO L273 TraceCheckUtils]: 177: Hoare triple {17896#true} assume !(~i~0 < 100000); {17896#true} is VALID [2018-11-14 18:57:09,505 INFO L273 TraceCheckUtils]: 178: Hoare triple {17896#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {17896#true} is VALID [2018-11-14 18:57:09,506 INFO L273 TraceCheckUtils]: 179: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 18:57:09,506 INFO L268 TraceCheckUtils]: 180: Hoare quadruple {17896#true} {17897#false} #77#return; {17897#false} is VALID [2018-11-14 18:57:09,506 INFO L273 TraceCheckUtils]: 181: Hoare triple {17897#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {17897#false} is VALID [2018-11-14 18:57:09,506 INFO L273 TraceCheckUtils]: 182: Hoare triple {17897#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {17897#false} is VALID [2018-11-14 18:57:09,506 INFO L273 TraceCheckUtils]: 183: Hoare triple {17897#false} assume !false; {17897#false} is VALID [2018-11-14 18:57:09,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 831 trivial. 0 not checked. [2018-11-14 18:57:09,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:57:09,521 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-14 18:57:09,530 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:57:09,590 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:57:09,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:57:09,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:57:09,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:57:09,879 INFO L256 TraceCheckUtils]: 0: Hoare triple {17896#true} call ULTIMATE.init(); {17896#true} is VALID [2018-11-14 18:57:09,879 INFO L273 TraceCheckUtils]: 1: Hoare triple {17896#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17896#true} is VALID [2018-11-14 18:57:09,880 INFO L273 TraceCheckUtils]: 2: Hoare triple {17896#true} assume true; {17896#true} is VALID [2018-11-14 18:57:09,880 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17896#true} {17896#true} #69#return; {17896#true} is VALID [2018-11-14 18:57:09,880 INFO L256 TraceCheckUtils]: 4: Hoare triple {17896#true} call #t~ret13 := main(); {17896#true} is VALID [2018-11-14 18:57:09,880 INFO L273 TraceCheckUtils]: 5: Hoare triple {17896#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; {17939#(<= main_~i~1 0)} is VALID [2018-11-14 18:57:09,880 INFO L273 TraceCheckUtils]: 6: Hoare triple {17939#(<= main_~i~1 0)} assume true; {17939#(<= main_~i~1 0)} is VALID [2018-11-14 18:57:09,881 INFO L273 TraceCheckUtils]: 7: Hoare triple {17939#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {17939#(<= main_~i~1 0)} is VALID [2018-11-14 18:57:09,881 INFO L273 TraceCheckUtils]: 8: Hoare triple {17939#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17899#(<= main_~i~1 1)} is VALID [2018-11-14 18:57:09,882 INFO L273 TraceCheckUtils]: 9: Hoare triple {17899#(<= main_~i~1 1)} assume true; {17899#(<= main_~i~1 1)} is VALID [2018-11-14 18:57:09,882 INFO L273 TraceCheckUtils]: 10: Hoare triple {17899#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {17899#(<= main_~i~1 1)} is VALID [2018-11-14 18:57:09,882 INFO L273 TraceCheckUtils]: 11: Hoare triple {17899#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17900#(<= main_~i~1 2)} is VALID [2018-11-14 18:57:09,883 INFO L273 TraceCheckUtils]: 12: Hoare triple {17900#(<= main_~i~1 2)} assume true; {17900#(<= main_~i~1 2)} is VALID [2018-11-14 18:57:09,883 INFO L273 TraceCheckUtils]: 13: Hoare triple {17900#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {17900#(<= main_~i~1 2)} is VALID [2018-11-14 18:57:09,884 INFO L273 TraceCheckUtils]: 14: Hoare triple {17900#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17901#(<= main_~i~1 3)} is VALID [2018-11-14 18:57:09,884 INFO L273 TraceCheckUtils]: 15: Hoare triple {17901#(<= main_~i~1 3)} assume true; {17901#(<= main_~i~1 3)} is VALID [2018-11-14 18:57:09,885 INFO L273 TraceCheckUtils]: 16: Hoare triple {17901#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {17901#(<= main_~i~1 3)} is VALID [2018-11-14 18:57:09,885 INFO L273 TraceCheckUtils]: 17: Hoare triple {17901#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17902#(<= main_~i~1 4)} is VALID [2018-11-14 18:57:09,886 INFO L273 TraceCheckUtils]: 18: Hoare triple {17902#(<= main_~i~1 4)} assume true; {17902#(<= main_~i~1 4)} is VALID [2018-11-14 18:57:09,886 INFO L273 TraceCheckUtils]: 19: Hoare triple {17902#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {17902#(<= main_~i~1 4)} is VALID [2018-11-14 18:57:09,887 INFO L273 TraceCheckUtils]: 20: Hoare triple {17902#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17903#(<= main_~i~1 5)} is VALID [2018-11-14 18:57:09,888 INFO L273 TraceCheckUtils]: 21: Hoare triple {17903#(<= main_~i~1 5)} assume true; {17903#(<= main_~i~1 5)} is VALID [2018-11-14 18:57:09,888 INFO L273 TraceCheckUtils]: 22: Hoare triple {17903#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {17903#(<= main_~i~1 5)} is VALID [2018-11-14 18:57:09,889 INFO L273 TraceCheckUtils]: 23: Hoare triple {17903#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17904#(<= main_~i~1 6)} is VALID [2018-11-14 18:57:09,889 INFO L273 TraceCheckUtils]: 24: Hoare triple {17904#(<= main_~i~1 6)} assume true; {17904#(<= main_~i~1 6)} is VALID [2018-11-14 18:57:09,890 INFO L273 TraceCheckUtils]: 25: Hoare triple {17904#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {17904#(<= main_~i~1 6)} is VALID [2018-11-14 18:57:09,891 INFO L273 TraceCheckUtils]: 26: Hoare triple {17904#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17905#(<= main_~i~1 7)} is VALID [2018-11-14 18:57:09,891 INFO L273 TraceCheckUtils]: 27: Hoare triple {17905#(<= main_~i~1 7)} assume true; {17905#(<= main_~i~1 7)} is VALID [2018-11-14 18:57:09,892 INFO L273 TraceCheckUtils]: 28: Hoare triple {17905#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {17905#(<= main_~i~1 7)} is VALID [2018-11-14 18:57:09,892 INFO L273 TraceCheckUtils]: 29: Hoare triple {17905#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17906#(<= main_~i~1 8)} is VALID [2018-11-14 18:57:09,893 INFO L273 TraceCheckUtils]: 30: Hoare triple {17906#(<= main_~i~1 8)} assume true; {17906#(<= main_~i~1 8)} is VALID [2018-11-14 18:57:09,893 INFO L273 TraceCheckUtils]: 31: Hoare triple {17906#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {17906#(<= main_~i~1 8)} is VALID [2018-11-14 18:57:09,894 INFO L273 TraceCheckUtils]: 32: Hoare triple {17906#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17907#(<= main_~i~1 9)} is VALID [2018-11-14 18:57:09,895 INFO L273 TraceCheckUtils]: 33: Hoare triple {17907#(<= main_~i~1 9)} assume true; {17907#(<= main_~i~1 9)} is VALID [2018-11-14 18:57:09,895 INFO L273 TraceCheckUtils]: 34: Hoare triple {17907#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {17907#(<= main_~i~1 9)} is VALID [2018-11-14 18:57:09,896 INFO L273 TraceCheckUtils]: 35: Hoare triple {17907#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17908#(<= main_~i~1 10)} is VALID [2018-11-14 18:57:09,896 INFO L273 TraceCheckUtils]: 36: Hoare triple {17908#(<= main_~i~1 10)} assume true; {17908#(<= main_~i~1 10)} is VALID [2018-11-14 18:57:09,897 INFO L273 TraceCheckUtils]: 37: Hoare triple {17908#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {17908#(<= main_~i~1 10)} is VALID [2018-11-14 18:57:09,898 INFO L273 TraceCheckUtils]: 38: Hoare triple {17908#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17909#(<= main_~i~1 11)} is VALID [2018-11-14 18:57:09,898 INFO L273 TraceCheckUtils]: 39: Hoare triple {17909#(<= main_~i~1 11)} assume true; {17909#(<= main_~i~1 11)} is VALID [2018-11-14 18:57:09,899 INFO L273 TraceCheckUtils]: 40: Hoare triple {17909#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {17909#(<= main_~i~1 11)} is VALID [2018-11-14 18:57:09,899 INFO L273 TraceCheckUtils]: 41: Hoare triple {17909#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17910#(<= main_~i~1 12)} is VALID [2018-11-14 18:57:09,900 INFO L273 TraceCheckUtils]: 42: Hoare triple {17910#(<= main_~i~1 12)} assume true; {17910#(<= main_~i~1 12)} is VALID [2018-11-14 18:57:09,900 INFO L273 TraceCheckUtils]: 43: Hoare triple {17910#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {17910#(<= main_~i~1 12)} is VALID [2018-11-14 18:57:09,901 INFO L273 TraceCheckUtils]: 44: Hoare triple {17910#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17911#(<= main_~i~1 13)} is VALID [2018-11-14 18:57:09,901 INFO L273 TraceCheckUtils]: 45: Hoare triple {17911#(<= main_~i~1 13)} assume true; {17911#(<= main_~i~1 13)} is VALID [2018-11-14 18:57:09,902 INFO L273 TraceCheckUtils]: 46: Hoare triple {17911#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {17911#(<= main_~i~1 13)} is VALID [2018-11-14 18:57:09,903 INFO L273 TraceCheckUtils]: 47: Hoare triple {17911#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17912#(<= main_~i~1 14)} is VALID [2018-11-14 18:57:09,903 INFO L273 TraceCheckUtils]: 48: Hoare triple {17912#(<= main_~i~1 14)} assume true; {17912#(<= main_~i~1 14)} is VALID [2018-11-14 18:57:09,904 INFO L273 TraceCheckUtils]: 49: Hoare triple {17912#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {17912#(<= main_~i~1 14)} is VALID [2018-11-14 18:57:09,904 INFO L273 TraceCheckUtils]: 50: Hoare triple {17912#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17913#(<= main_~i~1 15)} is VALID [2018-11-14 18:57:09,905 INFO L273 TraceCheckUtils]: 51: Hoare triple {17913#(<= main_~i~1 15)} assume true; {17913#(<= main_~i~1 15)} is VALID [2018-11-14 18:57:09,905 INFO L273 TraceCheckUtils]: 52: Hoare triple {17913#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {17913#(<= main_~i~1 15)} is VALID [2018-11-14 18:57:09,906 INFO L273 TraceCheckUtils]: 53: Hoare triple {17913#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17914#(<= main_~i~1 16)} is VALID [2018-11-14 18:57:09,907 INFO L273 TraceCheckUtils]: 54: Hoare triple {17914#(<= main_~i~1 16)} assume true; {17914#(<= main_~i~1 16)} is VALID [2018-11-14 18:57:09,907 INFO L273 TraceCheckUtils]: 55: Hoare triple {17914#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {17914#(<= main_~i~1 16)} is VALID [2018-11-14 18:57:09,908 INFO L273 TraceCheckUtils]: 56: Hoare triple {17914#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17915#(<= main_~i~1 17)} is VALID [2018-11-14 18:57:09,908 INFO L273 TraceCheckUtils]: 57: Hoare triple {17915#(<= main_~i~1 17)} assume true; {17915#(<= main_~i~1 17)} is VALID [2018-11-14 18:57:09,909 INFO L273 TraceCheckUtils]: 58: Hoare triple {17915#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {17915#(<= main_~i~1 17)} is VALID [2018-11-14 18:57:09,910 INFO L273 TraceCheckUtils]: 59: Hoare triple {17915#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17916#(<= main_~i~1 18)} is VALID [2018-11-14 18:57:09,910 INFO L273 TraceCheckUtils]: 60: Hoare triple {17916#(<= main_~i~1 18)} assume true; {17916#(<= main_~i~1 18)} is VALID [2018-11-14 18:57:09,911 INFO L273 TraceCheckUtils]: 61: Hoare triple {17916#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {17916#(<= main_~i~1 18)} is VALID [2018-11-14 18:57:09,911 INFO L273 TraceCheckUtils]: 62: Hoare triple {17916#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17917#(<= main_~i~1 19)} is VALID [2018-11-14 18:57:09,912 INFO L273 TraceCheckUtils]: 63: Hoare triple {17917#(<= main_~i~1 19)} assume true; {17917#(<= main_~i~1 19)} is VALID [2018-11-14 18:57:09,912 INFO L273 TraceCheckUtils]: 64: Hoare triple {17917#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {17917#(<= main_~i~1 19)} is VALID [2018-11-14 18:57:09,913 INFO L273 TraceCheckUtils]: 65: Hoare triple {17917#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17918#(<= main_~i~1 20)} is VALID [2018-11-14 18:57:09,914 INFO L273 TraceCheckUtils]: 66: Hoare triple {17918#(<= main_~i~1 20)} assume true; {17918#(<= main_~i~1 20)} is VALID [2018-11-14 18:57:09,914 INFO L273 TraceCheckUtils]: 67: Hoare triple {17918#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {17918#(<= main_~i~1 20)} is VALID [2018-11-14 18:57:09,915 INFO L273 TraceCheckUtils]: 68: Hoare triple {17918#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17919#(<= main_~i~1 21)} is VALID [2018-11-14 18:57:09,915 INFO L273 TraceCheckUtils]: 69: Hoare triple {17919#(<= main_~i~1 21)} assume true; {17919#(<= main_~i~1 21)} is VALID [2018-11-14 18:57:09,916 INFO L273 TraceCheckUtils]: 70: Hoare triple {17919#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {17919#(<= main_~i~1 21)} is VALID [2018-11-14 18:57:09,916 INFO L273 TraceCheckUtils]: 71: Hoare triple {17919#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17920#(<= main_~i~1 22)} is VALID [2018-11-14 18:57:09,917 INFO L273 TraceCheckUtils]: 72: Hoare triple {17920#(<= main_~i~1 22)} assume true; {17920#(<= main_~i~1 22)} is VALID [2018-11-14 18:57:09,918 INFO L273 TraceCheckUtils]: 73: Hoare triple {17920#(<= main_~i~1 22)} assume !(~i~1 < 100000); {17897#false} is VALID [2018-11-14 18:57:09,918 INFO L256 TraceCheckUtils]: 74: Hoare triple {17897#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {17897#false} is VALID [2018-11-14 18:57:09,918 INFO L273 TraceCheckUtils]: 75: Hoare triple {17897#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {17897#false} is VALID [2018-11-14 18:57:09,918 INFO L273 TraceCheckUtils]: 76: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 18:57:09,918 INFO L273 TraceCheckUtils]: 77: Hoare triple {17897#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 18:57:09,919 INFO L273 TraceCheckUtils]: 78: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 18:57:09,919 INFO L273 TraceCheckUtils]: 79: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 18:57:09,919 INFO L273 TraceCheckUtils]: 80: Hoare triple {17897#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 18:57:09,919 INFO L273 TraceCheckUtils]: 81: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 18:57:09,919 INFO L273 TraceCheckUtils]: 82: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 18:57:09,919 INFO L273 TraceCheckUtils]: 83: Hoare triple {17897#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 18:57:09,920 INFO L273 TraceCheckUtils]: 84: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 18:57:09,920 INFO L273 TraceCheckUtils]: 85: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 18:57:09,920 INFO L273 TraceCheckUtils]: 86: Hoare triple {17897#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 18:57:09,920 INFO L273 TraceCheckUtils]: 87: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 18:57:09,920 INFO L273 TraceCheckUtils]: 88: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 18:57:09,921 INFO L273 TraceCheckUtils]: 89: Hoare triple {17897#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 18:57:09,921 INFO L273 TraceCheckUtils]: 90: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 18:57:09,921 INFO L273 TraceCheckUtils]: 91: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 18:57:09,921 INFO L273 TraceCheckUtils]: 92: Hoare triple {17897#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 18:57:09,921 INFO L273 TraceCheckUtils]: 93: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 18:57:09,921 INFO L273 TraceCheckUtils]: 94: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 18:57:09,921 INFO L273 TraceCheckUtils]: 95: Hoare triple {17897#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 18:57:09,921 INFO L273 TraceCheckUtils]: 96: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 18:57:09,921 INFO L273 TraceCheckUtils]: 97: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 18:57:09,922 INFO L273 TraceCheckUtils]: 98: Hoare triple {17897#false} assume !(~i~0 < 100000); {17897#false} is VALID [2018-11-14 18:57:09,922 INFO L273 TraceCheckUtils]: 99: Hoare triple {17897#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {17897#false} is VALID [2018-11-14 18:57:09,922 INFO L273 TraceCheckUtils]: 100: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 18:57:09,922 INFO L268 TraceCheckUtils]: 101: Hoare quadruple {17897#false} {17897#false} #73#return; {17897#false} is VALID [2018-11-14 18:57:09,922 INFO L273 TraceCheckUtils]: 102: Hoare triple {17897#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {17897#false} is VALID [2018-11-14 18:57:09,922 INFO L256 TraceCheckUtils]: 103: Hoare triple {17897#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {17897#false} is VALID [2018-11-14 18:57:09,922 INFO L273 TraceCheckUtils]: 104: Hoare triple {17897#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {17897#false} is VALID [2018-11-14 18:57:09,922 INFO L273 TraceCheckUtils]: 105: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 18:57:09,922 INFO L273 TraceCheckUtils]: 106: Hoare triple {17897#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 18:57:09,923 INFO L273 TraceCheckUtils]: 107: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 18:57:09,923 INFO L273 TraceCheckUtils]: 108: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 18:57:09,923 INFO L273 TraceCheckUtils]: 109: Hoare triple {17897#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 18:57:09,923 INFO L273 TraceCheckUtils]: 110: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 18:57:09,923 INFO L273 TraceCheckUtils]: 111: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 18:57:09,923 INFO L273 TraceCheckUtils]: 112: Hoare triple {17897#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 18:57:09,923 INFO L273 TraceCheckUtils]: 113: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 18:57:09,923 INFO L273 TraceCheckUtils]: 114: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 18:57:09,923 INFO L273 TraceCheckUtils]: 115: Hoare triple {17897#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 18:57:09,923 INFO L273 TraceCheckUtils]: 116: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 18:57:09,924 INFO L273 TraceCheckUtils]: 117: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 18:57:09,924 INFO L273 TraceCheckUtils]: 118: Hoare triple {17897#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 18:57:09,924 INFO L273 TraceCheckUtils]: 119: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 18:57:09,924 INFO L273 TraceCheckUtils]: 120: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 18:57:09,924 INFO L273 TraceCheckUtils]: 121: Hoare triple {17897#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 18:57:09,924 INFO L273 TraceCheckUtils]: 122: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 18:57:09,924 INFO L273 TraceCheckUtils]: 123: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 18:57:09,924 INFO L273 TraceCheckUtils]: 124: Hoare triple {17897#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 18:57:09,924 INFO L273 TraceCheckUtils]: 125: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 18:57:09,924 INFO L273 TraceCheckUtils]: 126: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 18:57:09,925 INFO L273 TraceCheckUtils]: 127: Hoare triple {17897#false} assume !(~i~0 < 100000); {17897#false} is VALID [2018-11-14 18:57:09,925 INFO L273 TraceCheckUtils]: 128: Hoare triple {17897#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {17897#false} is VALID [2018-11-14 18:57:09,925 INFO L273 TraceCheckUtils]: 129: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 18:57:09,925 INFO L268 TraceCheckUtils]: 130: Hoare quadruple {17897#false} {17897#false} #75#return; {17897#false} is VALID [2018-11-14 18:57:09,925 INFO L273 TraceCheckUtils]: 131: Hoare triple {17897#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {17897#false} is VALID [2018-11-14 18:57:09,925 INFO L273 TraceCheckUtils]: 132: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 18:57:09,925 INFO L273 TraceCheckUtils]: 133: Hoare triple {17897#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17897#false} is VALID [2018-11-14 18:57:09,925 INFO L273 TraceCheckUtils]: 134: Hoare triple {17897#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17897#false} is VALID [2018-11-14 18:57:09,925 INFO L273 TraceCheckUtils]: 135: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 18:57:09,926 INFO L273 TraceCheckUtils]: 136: Hoare triple {17897#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17897#false} is VALID [2018-11-14 18:57:09,926 INFO L273 TraceCheckUtils]: 137: Hoare triple {17897#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17897#false} is VALID [2018-11-14 18:57:09,926 INFO L273 TraceCheckUtils]: 138: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 18:57:09,926 INFO L273 TraceCheckUtils]: 139: Hoare triple {17897#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17897#false} is VALID [2018-11-14 18:57:09,926 INFO L273 TraceCheckUtils]: 140: Hoare triple {17897#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17897#false} is VALID [2018-11-14 18:57:09,926 INFO L273 TraceCheckUtils]: 141: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 18:57:09,926 INFO L273 TraceCheckUtils]: 142: Hoare triple {17897#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17897#false} is VALID [2018-11-14 18:57:09,926 INFO L273 TraceCheckUtils]: 143: Hoare triple {17897#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17897#false} is VALID [2018-11-14 18:57:09,926 INFO L273 TraceCheckUtils]: 144: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 18:57:09,926 INFO L273 TraceCheckUtils]: 145: Hoare triple {17897#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17897#false} is VALID [2018-11-14 18:57:09,927 INFO L273 TraceCheckUtils]: 146: Hoare triple {17897#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17897#false} is VALID [2018-11-14 18:57:09,927 INFO L273 TraceCheckUtils]: 147: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 18:57:09,927 INFO L273 TraceCheckUtils]: 148: Hoare triple {17897#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17897#false} is VALID [2018-11-14 18:57:09,927 INFO L273 TraceCheckUtils]: 149: Hoare triple {17897#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17897#false} is VALID [2018-11-14 18:57:09,927 INFO L273 TraceCheckUtils]: 150: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 18:57:09,927 INFO L273 TraceCheckUtils]: 151: Hoare triple {17897#false} assume !(~i~2 < 99999); {17897#false} is VALID [2018-11-14 18:57:09,927 INFO L273 TraceCheckUtils]: 152: Hoare triple {17897#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {17897#false} is VALID [2018-11-14 18:57:09,927 INFO L256 TraceCheckUtils]: 153: Hoare triple {17897#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {17897#false} is VALID [2018-11-14 18:57:09,927 INFO L273 TraceCheckUtils]: 154: Hoare triple {17897#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {17897#false} is VALID [2018-11-14 18:57:09,927 INFO L273 TraceCheckUtils]: 155: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 18:57:09,928 INFO L273 TraceCheckUtils]: 156: Hoare triple {17897#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 18:57:09,928 INFO L273 TraceCheckUtils]: 157: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 18:57:09,928 INFO L273 TraceCheckUtils]: 158: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 18:57:09,928 INFO L273 TraceCheckUtils]: 159: Hoare triple {17897#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 18:57:09,928 INFO L273 TraceCheckUtils]: 160: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 18:57:09,928 INFO L273 TraceCheckUtils]: 161: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 18:57:09,928 INFO L273 TraceCheckUtils]: 162: Hoare triple {17897#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 18:57:09,928 INFO L273 TraceCheckUtils]: 163: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 18:57:09,928 INFO L273 TraceCheckUtils]: 164: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 18:57:09,928 INFO L273 TraceCheckUtils]: 165: Hoare triple {17897#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 18:57:09,929 INFO L273 TraceCheckUtils]: 166: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 18:57:09,929 INFO L273 TraceCheckUtils]: 167: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 18:57:09,929 INFO L273 TraceCheckUtils]: 168: Hoare triple {17897#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 18:57:09,929 INFO L273 TraceCheckUtils]: 169: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 18:57:09,929 INFO L273 TraceCheckUtils]: 170: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 18:57:09,929 INFO L273 TraceCheckUtils]: 171: Hoare triple {17897#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 18:57:09,929 INFO L273 TraceCheckUtils]: 172: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 18:57:09,929 INFO L273 TraceCheckUtils]: 173: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 18:57:09,929 INFO L273 TraceCheckUtils]: 174: Hoare triple {17897#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17897#false} is VALID [2018-11-14 18:57:09,930 INFO L273 TraceCheckUtils]: 175: Hoare triple {17897#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17897#false} is VALID [2018-11-14 18:57:09,930 INFO L273 TraceCheckUtils]: 176: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 18:57:09,930 INFO L273 TraceCheckUtils]: 177: Hoare triple {17897#false} assume !(~i~0 < 100000); {17897#false} is VALID [2018-11-14 18:57:09,930 INFO L273 TraceCheckUtils]: 178: Hoare triple {17897#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {17897#false} is VALID [2018-11-14 18:57:09,930 INFO L273 TraceCheckUtils]: 179: Hoare triple {17897#false} assume true; {17897#false} is VALID [2018-11-14 18:57:09,930 INFO L268 TraceCheckUtils]: 180: Hoare quadruple {17897#false} {17897#false} #77#return; {17897#false} is VALID [2018-11-14 18:57:09,930 INFO L273 TraceCheckUtils]: 181: Hoare triple {17897#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {17897#false} is VALID [2018-11-14 18:57:09,930 INFO L273 TraceCheckUtils]: 182: Hoare triple {17897#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {17897#false} is VALID [2018-11-14 18:57:09,930 INFO L273 TraceCheckUtils]: 183: Hoare triple {17897#false} assume !false; {17897#false} is VALID [2018-11-14 18:57:09,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 831 trivial. 0 not checked. [2018-11-14 18:57:09,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:57:09,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-11-14 18:57:09,982 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 184 [2018-11-14 18:57:09,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:57:09,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-14 18:57:10,113 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:57:10,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-14 18:57:10,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-14 18:57:10,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-14 18:57:10,114 INFO L87 Difference]: Start difference. First operand 131 states and 135 transitions. Second operand 26 states. [2018-11-14 18:57:10,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:57:10,342 INFO L93 Difference]: Finished difference Result 192 states and 200 transitions. [2018-11-14 18:57:10,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-14 18:57:10,342 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 184 [2018-11-14 18:57:10,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:57:10,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 18:57:10,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 126 transitions. [2018-11-14 18:57:10,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 18:57:10,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 126 transitions. [2018-11-14 18:57:10,344 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 126 transitions. [2018-11-14 18:57:10,455 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:57:10,458 INFO L225 Difference]: With dead ends: 192 [2018-11-14 18:57:10,458 INFO L226 Difference]: Without dead ends: 135 [2018-11-14 18:57:10,459 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-14 18:57:10,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-11-14 18:57:10,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2018-11-14 18:57:10,494 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:57:10,494 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand 134 states. [2018-11-14 18:57:10,494 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand 134 states. [2018-11-14 18:57:10,494 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 134 states. [2018-11-14 18:57:10,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:57:10,497 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2018-11-14 18:57:10,497 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2018-11-14 18:57:10,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:57:10,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:57:10,498 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 135 states. [2018-11-14 18:57:10,498 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 135 states. [2018-11-14 18:57:10,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:57:10,501 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2018-11-14 18:57:10,501 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2018-11-14 18:57:10,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:57:10,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:57:10,501 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:57:10,502 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:57:10,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-11-14 18:57:10,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 138 transitions. [2018-11-14 18:57:10,504 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 138 transitions. Word has length 184 [2018-11-14 18:57:10,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:57:10,504 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 138 transitions. [2018-11-14 18:57:10,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-14 18:57:10,505 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 138 transitions. [2018-11-14 18:57:10,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-11-14 18:57:10,506 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:57:10,506 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 21, 21, 7, 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-14 18:57:10,506 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:57:10,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:57:10,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1172928385, now seen corresponding path program 23 times [2018-11-14 18:57:10,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:57:10,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:57:10,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:57:10,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:57:10,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:57:10,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:57:11,341 INFO L256 TraceCheckUtils]: 0: Hoare triple {19182#true} call ULTIMATE.init(); {19182#true} is VALID [2018-11-14 18:57:11,342 INFO L273 TraceCheckUtils]: 1: Hoare triple {19182#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19182#true} is VALID [2018-11-14 18:57:11,342 INFO L273 TraceCheckUtils]: 2: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 18:57:11,342 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19182#true} {19182#true} #69#return; {19182#true} is VALID [2018-11-14 18:57:11,342 INFO L256 TraceCheckUtils]: 4: Hoare triple {19182#true} call #t~ret13 := main(); {19182#true} is VALID [2018-11-14 18:57:11,343 INFO L273 TraceCheckUtils]: 5: Hoare triple {19182#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; {19184#(= main_~i~1 0)} is VALID [2018-11-14 18:57:11,343 INFO L273 TraceCheckUtils]: 6: Hoare triple {19184#(= main_~i~1 0)} assume true; {19184#(= main_~i~1 0)} is VALID [2018-11-14 18:57:11,344 INFO L273 TraceCheckUtils]: 7: Hoare triple {19184#(= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {19184#(= main_~i~1 0)} is VALID [2018-11-14 18:57:11,345 INFO L273 TraceCheckUtils]: 8: Hoare triple {19184#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19185#(<= main_~i~1 1)} is VALID [2018-11-14 18:57:11,345 INFO L273 TraceCheckUtils]: 9: Hoare triple {19185#(<= main_~i~1 1)} assume true; {19185#(<= main_~i~1 1)} is VALID [2018-11-14 18:57:11,346 INFO L273 TraceCheckUtils]: 10: Hoare triple {19185#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {19185#(<= main_~i~1 1)} is VALID [2018-11-14 18:57:11,346 INFO L273 TraceCheckUtils]: 11: Hoare triple {19185#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19186#(<= main_~i~1 2)} is VALID [2018-11-14 18:57:11,347 INFO L273 TraceCheckUtils]: 12: Hoare triple {19186#(<= main_~i~1 2)} assume true; {19186#(<= main_~i~1 2)} is VALID [2018-11-14 18:57:11,347 INFO L273 TraceCheckUtils]: 13: Hoare triple {19186#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {19186#(<= main_~i~1 2)} is VALID [2018-11-14 18:57:11,348 INFO L273 TraceCheckUtils]: 14: Hoare triple {19186#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19187#(<= main_~i~1 3)} is VALID [2018-11-14 18:57:11,349 INFO L273 TraceCheckUtils]: 15: Hoare triple {19187#(<= main_~i~1 3)} assume true; {19187#(<= main_~i~1 3)} is VALID [2018-11-14 18:57:11,349 INFO L273 TraceCheckUtils]: 16: Hoare triple {19187#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {19187#(<= main_~i~1 3)} is VALID [2018-11-14 18:57:11,350 INFO L273 TraceCheckUtils]: 17: Hoare triple {19187#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19188#(<= main_~i~1 4)} is VALID [2018-11-14 18:57:11,350 INFO L273 TraceCheckUtils]: 18: Hoare triple {19188#(<= main_~i~1 4)} assume true; {19188#(<= main_~i~1 4)} is VALID [2018-11-14 18:57:11,351 INFO L273 TraceCheckUtils]: 19: Hoare triple {19188#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {19188#(<= main_~i~1 4)} is VALID [2018-11-14 18:57:11,352 INFO L273 TraceCheckUtils]: 20: Hoare triple {19188#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19189#(<= main_~i~1 5)} is VALID [2018-11-14 18:57:11,352 INFO L273 TraceCheckUtils]: 21: Hoare triple {19189#(<= main_~i~1 5)} assume true; {19189#(<= main_~i~1 5)} is VALID [2018-11-14 18:57:11,354 INFO L273 TraceCheckUtils]: 22: Hoare triple {19189#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {19189#(<= main_~i~1 5)} is VALID [2018-11-14 18:57:11,355 INFO L273 TraceCheckUtils]: 23: Hoare triple {19189#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19190#(<= main_~i~1 6)} is VALID [2018-11-14 18:57:11,356 INFO L273 TraceCheckUtils]: 24: Hoare triple {19190#(<= main_~i~1 6)} assume true; {19190#(<= main_~i~1 6)} is VALID [2018-11-14 18:57:11,356 INFO L273 TraceCheckUtils]: 25: Hoare triple {19190#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {19190#(<= main_~i~1 6)} is VALID [2018-11-14 18:57:11,356 INFO L273 TraceCheckUtils]: 26: Hoare triple {19190#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19191#(<= main_~i~1 7)} is VALID [2018-11-14 18:57:11,357 INFO L273 TraceCheckUtils]: 27: Hoare triple {19191#(<= main_~i~1 7)} assume true; {19191#(<= main_~i~1 7)} is VALID [2018-11-14 18:57:11,357 INFO L273 TraceCheckUtils]: 28: Hoare triple {19191#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {19191#(<= main_~i~1 7)} is VALID [2018-11-14 18:57:11,357 INFO L273 TraceCheckUtils]: 29: Hoare triple {19191#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19192#(<= main_~i~1 8)} is VALID [2018-11-14 18:57:11,358 INFO L273 TraceCheckUtils]: 30: Hoare triple {19192#(<= main_~i~1 8)} assume true; {19192#(<= main_~i~1 8)} is VALID [2018-11-14 18:57:11,358 INFO L273 TraceCheckUtils]: 31: Hoare triple {19192#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {19192#(<= main_~i~1 8)} is VALID [2018-11-14 18:57:11,359 INFO L273 TraceCheckUtils]: 32: Hoare triple {19192#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19193#(<= main_~i~1 9)} is VALID [2018-11-14 18:57:11,359 INFO L273 TraceCheckUtils]: 33: Hoare triple {19193#(<= main_~i~1 9)} assume true; {19193#(<= main_~i~1 9)} is VALID [2018-11-14 18:57:11,360 INFO L273 TraceCheckUtils]: 34: Hoare triple {19193#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {19193#(<= main_~i~1 9)} is VALID [2018-11-14 18:57:11,361 INFO L273 TraceCheckUtils]: 35: Hoare triple {19193#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19194#(<= main_~i~1 10)} is VALID [2018-11-14 18:57:11,361 INFO L273 TraceCheckUtils]: 36: Hoare triple {19194#(<= main_~i~1 10)} assume true; {19194#(<= main_~i~1 10)} is VALID [2018-11-14 18:57:11,362 INFO L273 TraceCheckUtils]: 37: Hoare triple {19194#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {19194#(<= main_~i~1 10)} is VALID [2018-11-14 18:57:11,362 INFO L273 TraceCheckUtils]: 38: Hoare triple {19194#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19195#(<= main_~i~1 11)} is VALID [2018-11-14 18:57:11,363 INFO L273 TraceCheckUtils]: 39: Hoare triple {19195#(<= main_~i~1 11)} assume true; {19195#(<= main_~i~1 11)} is VALID [2018-11-14 18:57:11,363 INFO L273 TraceCheckUtils]: 40: Hoare triple {19195#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {19195#(<= main_~i~1 11)} is VALID [2018-11-14 18:57:11,364 INFO L273 TraceCheckUtils]: 41: Hoare triple {19195#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19196#(<= main_~i~1 12)} is VALID [2018-11-14 18:57:11,365 INFO L273 TraceCheckUtils]: 42: Hoare triple {19196#(<= main_~i~1 12)} assume true; {19196#(<= main_~i~1 12)} is VALID [2018-11-14 18:57:11,365 INFO L273 TraceCheckUtils]: 43: Hoare triple {19196#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {19196#(<= main_~i~1 12)} is VALID [2018-11-14 18:57:11,366 INFO L273 TraceCheckUtils]: 44: Hoare triple {19196#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19197#(<= main_~i~1 13)} is VALID [2018-11-14 18:57:11,366 INFO L273 TraceCheckUtils]: 45: Hoare triple {19197#(<= main_~i~1 13)} assume true; {19197#(<= main_~i~1 13)} is VALID [2018-11-14 18:57:11,367 INFO L273 TraceCheckUtils]: 46: Hoare triple {19197#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {19197#(<= main_~i~1 13)} is VALID [2018-11-14 18:57:11,368 INFO L273 TraceCheckUtils]: 47: Hoare triple {19197#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19198#(<= main_~i~1 14)} is VALID [2018-11-14 18:57:11,368 INFO L273 TraceCheckUtils]: 48: Hoare triple {19198#(<= main_~i~1 14)} assume true; {19198#(<= main_~i~1 14)} is VALID [2018-11-14 18:57:11,369 INFO L273 TraceCheckUtils]: 49: Hoare triple {19198#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {19198#(<= main_~i~1 14)} is VALID [2018-11-14 18:57:11,369 INFO L273 TraceCheckUtils]: 50: Hoare triple {19198#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19199#(<= main_~i~1 15)} is VALID [2018-11-14 18:57:11,370 INFO L273 TraceCheckUtils]: 51: Hoare triple {19199#(<= main_~i~1 15)} assume true; {19199#(<= main_~i~1 15)} is VALID [2018-11-14 18:57:11,370 INFO L273 TraceCheckUtils]: 52: Hoare triple {19199#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {19199#(<= main_~i~1 15)} is VALID [2018-11-14 18:57:11,371 INFO L273 TraceCheckUtils]: 53: Hoare triple {19199#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19200#(<= main_~i~1 16)} is VALID [2018-11-14 18:57:11,371 INFO L273 TraceCheckUtils]: 54: Hoare triple {19200#(<= main_~i~1 16)} assume true; {19200#(<= main_~i~1 16)} is VALID [2018-11-14 18:57:11,372 INFO L273 TraceCheckUtils]: 55: Hoare triple {19200#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {19200#(<= main_~i~1 16)} is VALID [2018-11-14 18:57:11,373 INFO L273 TraceCheckUtils]: 56: Hoare triple {19200#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19201#(<= main_~i~1 17)} is VALID [2018-11-14 18:57:11,373 INFO L273 TraceCheckUtils]: 57: Hoare triple {19201#(<= main_~i~1 17)} assume true; {19201#(<= main_~i~1 17)} is VALID [2018-11-14 18:57:11,374 INFO L273 TraceCheckUtils]: 58: Hoare triple {19201#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {19201#(<= main_~i~1 17)} is VALID [2018-11-14 18:57:11,374 INFO L273 TraceCheckUtils]: 59: Hoare triple {19201#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19202#(<= main_~i~1 18)} is VALID [2018-11-14 18:57:11,375 INFO L273 TraceCheckUtils]: 60: Hoare triple {19202#(<= main_~i~1 18)} assume true; {19202#(<= main_~i~1 18)} is VALID [2018-11-14 18:57:11,375 INFO L273 TraceCheckUtils]: 61: Hoare triple {19202#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {19202#(<= main_~i~1 18)} is VALID [2018-11-14 18:57:11,376 INFO L273 TraceCheckUtils]: 62: Hoare triple {19202#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19203#(<= main_~i~1 19)} is VALID [2018-11-14 18:57:11,377 INFO L273 TraceCheckUtils]: 63: Hoare triple {19203#(<= main_~i~1 19)} assume true; {19203#(<= main_~i~1 19)} is VALID [2018-11-14 18:57:11,377 INFO L273 TraceCheckUtils]: 64: Hoare triple {19203#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {19203#(<= main_~i~1 19)} is VALID [2018-11-14 18:57:11,378 INFO L273 TraceCheckUtils]: 65: Hoare triple {19203#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19204#(<= main_~i~1 20)} is VALID [2018-11-14 18:57:11,378 INFO L273 TraceCheckUtils]: 66: Hoare triple {19204#(<= main_~i~1 20)} assume true; {19204#(<= main_~i~1 20)} is VALID [2018-11-14 18:57:11,379 INFO L273 TraceCheckUtils]: 67: Hoare triple {19204#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {19204#(<= main_~i~1 20)} is VALID [2018-11-14 18:57:11,380 INFO L273 TraceCheckUtils]: 68: Hoare triple {19204#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19205#(<= main_~i~1 21)} is VALID [2018-11-14 18:57:11,380 INFO L273 TraceCheckUtils]: 69: Hoare triple {19205#(<= main_~i~1 21)} assume true; {19205#(<= main_~i~1 21)} is VALID [2018-11-14 18:57:11,381 INFO L273 TraceCheckUtils]: 70: Hoare triple {19205#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {19205#(<= main_~i~1 21)} is VALID [2018-11-14 18:57:11,381 INFO L273 TraceCheckUtils]: 71: Hoare triple {19205#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19206#(<= main_~i~1 22)} is VALID [2018-11-14 18:57:11,382 INFO L273 TraceCheckUtils]: 72: Hoare triple {19206#(<= main_~i~1 22)} assume true; {19206#(<= main_~i~1 22)} is VALID [2018-11-14 18:57:11,382 INFO L273 TraceCheckUtils]: 73: Hoare triple {19206#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {19206#(<= main_~i~1 22)} is VALID [2018-11-14 18:57:11,383 INFO L273 TraceCheckUtils]: 74: Hoare triple {19206#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19207#(<= main_~i~1 23)} is VALID [2018-11-14 18:57:11,384 INFO L273 TraceCheckUtils]: 75: Hoare triple {19207#(<= main_~i~1 23)} assume true; {19207#(<= main_~i~1 23)} is VALID [2018-11-14 18:57:11,384 INFO L273 TraceCheckUtils]: 76: Hoare triple {19207#(<= main_~i~1 23)} assume !(~i~1 < 100000); {19183#false} is VALID [2018-11-14 18:57:11,384 INFO L256 TraceCheckUtils]: 77: Hoare triple {19183#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {19182#true} is VALID [2018-11-14 18:57:11,385 INFO L273 TraceCheckUtils]: 78: Hoare triple {19182#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {19182#true} is VALID [2018-11-14 18:57:11,385 INFO L273 TraceCheckUtils]: 79: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 18:57:11,385 INFO L273 TraceCheckUtils]: 80: Hoare triple {19182#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 18:57:11,385 INFO L273 TraceCheckUtils]: 81: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 18:57:11,385 INFO L273 TraceCheckUtils]: 82: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 18:57:11,385 INFO L273 TraceCheckUtils]: 83: Hoare triple {19182#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 18:57:11,386 INFO L273 TraceCheckUtils]: 84: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 18:57:11,386 INFO L273 TraceCheckUtils]: 85: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 18:57:11,386 INFO L273 TraceCheckUtils]: 86: Hoare triple {19182#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 18:57:11,386 INFO L273 TraceCheckUtils]: 87: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 18:57:11,386 INFO L273 TraceCheckUtils]: 88: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 18:57:11,387 INFO L273 TraceCheckUtils]: 89: Hoare triple {19182#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 18:57:11,387 INFO L273 TraceCheckUtils]: 90: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 18:57:11,387 INFO L273 TraceCheckUtils]: 91: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 18:57:11,387 INFO L273 TraceCheckUtils]: 92: Hoare triple {19182#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 18:57:11,387 INFO L273 TraceCheckUtils]: 93: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 18:57:11,387 INFO L273 TraceCheckUtils]: 94: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 18:57:11,387 INFO L273 TraceCheckUtils]: 95: Hoare triple {19182#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 18:57:11,387 INFO L273 TraceCheckUtils]: 96: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 18:57:11,387 INFO L273 TraceCheckUtils]: 97: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 18:57:11,388 INFO L273 TraceCheckUtils]: 98: Hoare triple {19182#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 18:57:11,388 INFO L273 TraceCheckUtils]: 99: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 18:57:11,388 INFO L273 TraceCheckUtils]: 100: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 18:57:11,388 INFO L273 TraceCheckUtils]: 101: Hoare triple {19182#true} assume !(~i~0 < 100000); {19182#true} is VALID [2018-11-14 18:57:11,388 INFO L273 TraceCheckUtils]: 102: Hoare triple {19182#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {19182#true} is VALID [2018-11-14 18:57:11,388 INFO L273 TraceCheckUtils]: 103: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 18:57:11,388 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {19182#true} {19183#false} #73#return; {19183#false} is VALID [2018-11-14 18:57:11,388 INFO L273 TraceCheckUtils]: 105: Hoare triple {19183#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {19183#false} is VALID [2018-11-14 18:57:11,388 INFO L256 TraceCheckUtils]: 106: Hoare triple {19183#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {19182#true} is VALID [2018-11-14 18:57:11,388 INFO L273 TraceCheckUtils]: 107: Hoare triple {19182#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {19182#true} is VALID [2018-11-14 18:57:11,389 INFO L273 TraceCheckUtils]: 108: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 18:57:11,389 INFO L273 TraceCheckUtils]: 109: Hoare triple {19182#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 18:57:11,389 INFO L273 TraceCheckUtils]: 110: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 18:57:11,389 INFO L273 TraceCheckUtils]: 111: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 18:57:11,389 INFO L273 TraceCheckUtils]: 112: Hoare triple {19182#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 18:57:11,389 INFO L273 TraceCheckUtils]: 113: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 18:57:11,389 INFO L273 TraceCheckUtils]: 114: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 18:57:11,389 INFO L273 TraceCheckUtils]: 115: Hoare triple {19182#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 18:57:11,389 INFO L273 TraceCheckUtils]: 116: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 18:57:11,389 INFO L273 TraceCheckUtils]: 117: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 18:57:11,390 INFO L273 TraceCheckUtils]: 118: Hoare triple {19182#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 18:57:11,390 INFO L273 TraceCheckUtils]: 119: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 18:57:11,390 INFO L273 TraceCheckUtils]: 120: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 18:57:11,390 INFO L273 TraceCheckUtils]: 121: Hoare triple {19182#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 18:57:11,390 INFO L273 TraceCheckUtils]: 122: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 18:57:11,390 INFO L273 TraceCheckUtils]: 123: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 18:57:11,390 INFO L273 TraceCheckUtils]: 124: Hoare triple {19182#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 18:57:11,390 INFO L273 TraceCheckUtils]: 125: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 18:57:11,390 INFO L273 TraceCheckUtils]: 126: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 18:57:11,390 INFO L273 TraceCheckUtils]: 127: Hoare triple {19182#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 18:57:11,391 INFO L273 TraceCheckUtils]: 128: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 18:57:11,391 INFO L273 TraceCheckUtils]: 129: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 18:57:11,391 INFO L273 TraceCheckUtils]: 130: Hoare triple {19182#true} assume !(~i~0 < 100000); {19182#true} is VALID [2018-11-14 18:57:11,391 INFO L273 TraceCheckUtils]: 131: Hoare triple {19182#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {19182#true} is VALID [2018-11-14 18:57:11,391 INFO L273 TraceCheckUtils]: 132: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 18:57:11,391 INFO L268 TraceCheckUtils]: 133: Hoare quadruple {19182#true} {19183#false} #75#return; {19183#false} is VALID [2018-11-14 18:57:11,391 INFO L273 TraceCheckUtils]: 134: Hoare triple {19183#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {19183#false} is VALID [2018-11-14 18:57:11,391 INFO L273 TraceCheckUtils]: 135: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 18:57:11,391 INFO L273 TraceCheckUtils]: 136: Hoare triple {19183#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19183#false} is VALID [2018-11-14 18:57:11,392 INFO L273 TraceCheckUtils]: 137: Hoare triple {19183#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19183#false} is VALID [2018-11-14 18:57:11,392 INFO L273 TraceCheckUtils]: 138: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 18:57:11,392 INFO L273 TraceCheckUtils]: 139: Hoare triple {19183#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19183#false} is VALID [2018-11-14 18:57:11,392 INFO L273 TraceCheckUtils]: 140: Hoare triple {19183#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19183#false} is VALID [2018-11-14 18:57:11,392 INFO L273 TraceCheckUtils]: 141: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 18:57:11,392 INFO L273 TraceCheckUtils]: 142: Hoare triple {19183#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19183#false} is VALID [2018-11-14 18:57:11,392 INFO L273 TraceCheckUtils]: 143: Hoare triple {19183#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19183#false} is VALID [2018-11-14 18:57:11,392 INFO L273 TraceCheckUtils]: 144: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 18:57:11,392 INFO L273 TraceCheckUtils]: 145: Hoare triple {19183#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19183#false} is VALID [2018-11-14 18:57:11,392 INFO L273 TraceCheckUtils]: 146: Hoare triple {19183#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19183#false} is VALID [2018-11-14 18:57:11,393 INFO L273 TraceCheckUtils]: 147: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 18:57:11,393 INFO L273 TraceCheckUtils]: 148: Hoare triple {19183#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19183#false} is VALID [2018-11-14 18:57:11,393 INFO L273 TraceCheckUtils]: 149: Hoare triple {19183#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19183#false} is VALID [2018-11-14 18:57:11,393 INFO L273 TraceCheckUtils]: 150: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 18:57:11,393 INFO L273 TraceCheckUtils]: 151: Hoare triple {19183#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19183#false} is VALID [2018-11-14 18:57:11,393 INFO L273 TraceCheckUtils]: 152: Hoare triple {19183#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19183#false} is VALID [2018-11-14 18:57:11,393 INFO L273 TraceCheckUtils]: 153: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 18:57:11,393 INFO L273 TraceCheckUtils]: 154: Hoare triple {19183#false} assume !(~i~2 < 99999); {19183#false} is VALID [2018-11-14 18:57:11,393 INFO L273 TraceCheckUtils]: 155: Hoare triple {19183#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {19183#false} is VALID [2018-11-14 18:57:11,393 INFO L256 TraceCheckUtils]: 156: Hoare triple {19183#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {19182#true} is VALID [2018-11-14 18:57:11,394 INFO L273 TraceCheckUtils]: 157: Hoare triple {19182#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {19182#true} is VALID [2018-11-14 18:57:11,394 INFO L273 TraceCheckUtils]: 158: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 18:57:11,394 INFO L273 TraceCheckUtils]: 159: Hoare triple {19182#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 18:57:11,394 INFO L273 TraceCheckUtils]: 160: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 18:57:11,394 INFO L273 TraceCheckUtils]: 161: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 18:57:11,394 INFO L273 TraceCheckUtils]: 162: Hoare triple {19182#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 18:57:11,394 INFO L273 TraceCheckUtils]: 163: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 18:57:11,394 INFO L273 TraceCheckUtils]: 164: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 18:57:11,394 INFO L273 TraceCheckUtils]: 165: Hoare triple {19182#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 18:57:11,394 INFO L273 TraceCheckUtils]: 166: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 18:57:11,395 INFO L273 TraceCheckUtils]: 167: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 18:57:11,395 INFO L273 TraceCheckUtils]: 168: Hoare triple {19182#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 18:57:11,395 INFO L273 TraceCheckUtils]: 169: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 18:57:11,395 INFO L273 TraceCheckUtils]: 170: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 18:57:11,395 INFO L273 TraceCheckUtils]: 171: Hoare triple {19182#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 18:57:11,395 INFO L273 TraceCheckUtils]: 172: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 18:57:11,395 INFO L273 TraceCheckUtils]: 173: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 18:57:11,395 INFO L273 TraceCheckUtils]: 174: Hoare triple {19182#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 18:57:11,395 INFO L273 TraceCheckUtils]: 175: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 18:57:11,396 INFO L273 TraceCheckUtils]: 176: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 18:57:11,396 INFO L273 TraceCheckUtils]: 177: Hoare triple {19182#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19182#true} is VALID [2018-11-14 18:57:11,396 INFO L273 TraceCheckUtils]: 178: Hoare triple {19182#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19182#true} is VALID [2018-11-14 18:57:11,396 INFO L273 TraceCheckUtils]: 179: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 18:57:11,396 INFO L273 TraceCheckUtils]: 180: Hoare triple {19182#true} assume !(~i~0 < 100000); {19182#true} is VALID [2018-11-14 18:57:11,396 INFO L273 TraceCheckUtils]: 181: Hoare triple {19182#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {19182#true} is VALID [2018-11-14 18:57:11,396 INFO L273 TraceCheckUtils]: 182: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 18:57:11,396 INFO L268 TraceCheckUtils]: 183: Hoare quadruple {19182#true} {19183#false} #77#return; {19183#false} is VALID [2018-11-14 18:57:11,396 INFO L273 TraceCheckUtils]: 184: Hoare triple {19183#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {19183#false} is VALID [2018-11-14 18:57:11,396 INFO L273 TraceCheckUtils]: 185: Hoare triple {19183#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {19183#false} is VALID [2018-11-14 18:57:11,397 INFO L273 TraceCheckUtils]: 186: Hoare triple {19183#false} assume !false; {19183#false} is VALID [2018-11-14 18:57:11,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1636 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 831 trivial. 0 not checked. [2018-11-14 18:57:11,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:57:11,413 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-14 18:57:11,421 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 18:57:15,607 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2018-11-14 18:57:15,607 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:57:15,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:57:15,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:57:16,625 INFO L256 TraceCheckUtils]: 0: Hoare triple {19182#true} call ULTIMATE.init(); {19182#true} is VALID [2018-11-14 18:57:16,626 INFO L273 TraceCheckUtils]: 1: Hoare triple {19182#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19182#true} is VALID [2018-11-14 18:57:16,626 INFO L273 TraceCheckUtils]: 2: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 18:57:16,626 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19182#true} {19182#true} #69#return; {19182#true} is VALID [2018-11-14 18:57:16,626 INFO L256 TraceCheckUtils]: 4: Hoare triple {19182#true} call #t~ret13 := main(); {19182#true} is VALID [2018-11-14 18:57:16,627 INFO L273 TraceCheckUtils]: 5: Hoare triple {19182#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; {19182#true} is VALID [2018-11-14 18:57:16,627 INFO L273 TraceCheckUtils]: 6: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 18:57:16,627 INFO L273 TraceCheckUtils]: 7: Hoare triple {19182#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 18:57:16,627 INFO L273 TraceCheckUtils]: 8: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 18:57:16,627 INFO L273 TraceCheckUtils]: 9: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 18:57:16,628 INFO L273 TraceCheckUtils]: 10: Hoare triple {19182#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 18:57:16,628 INFO L273 TraceCheckUtils]: 11: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 18:57:16,628 INFO L273 TraceCheckUtils]: 12: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 18:57:16,628 INFO L273 TraceCheckUtils]: 13: Hoare triple {19182#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 18:57:16,628 INFO L273 TraceCheckUtils]: 14: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 18:57:16,629 INFO L273 TraceCheckUtils]: 15: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 18:57:16,629 INFO L273 TraceCheckUtils]: 16: Hoare triple {19182#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 18:57:16,629 INFO L273 TraceCheckUtils]: 17: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 18:57:16,629 INFO L273 TraceCheckUtils]: 18: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 18:57:16,629 INFO L273 TraceCheckUtils]: 19: Hoare triple {19182#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 18:57:16,630 INFO L273 TraceCheckUtils]: 20: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 18:57:16,630 INFO L273 TraceCheckUtils]: 21: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 18:57:16,630 INFO L273 TraceCheckUtils]: 22: Hoare triple {19182#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 18:57:16,630 INFO L273 TraceCheckUtils]: 23: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 18:57:16,631 INFO L273 TraceCheckUtils]: 24: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 18:57:16,631 INFO L273 TraceCheckUtils]: 25: Hoare triple {19182#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 18:57:16,631 INFO L273 TraceCheckUtils]: 26: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 18:57:16,631 INFO L273 TraceCheckUtils]: 27: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 18:57:16,631 INFO L273 TraceCheckUtils]: 28: Hoare triple {19182#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 18:57:16,631 INFO L273 TraceCheckUtils]: 29: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 18:57:16,631 INFO L273 TraceCheckUtils]: 30: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 18:57:16,632 INFO L273 TraceCheckUtils]: 31: Hoare triple {19182#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 18:57:16,632 INFO L273 TraceCheckUtils]: 32: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 18:57:16,632 INFO L273 TraceCheckUtils]: 33: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 18:57:16,632 INFO L273 TraceCheckUtils]: 34: Hoare triple {19182#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 18:57:16,632 INFO L273 TraceCheckUtils]: 35: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 18:57:16,632 INFO L273 TraceCheckUtils]: 36: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 18:57:16,632 INFO L273 TraceCheckUtils]: 37: Hoare triple {19182#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 18:57:16,633 INFO L273 TraceCheckUtils]: 38: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 18:57:16,633 INFO L273 TraceCheckUtils]: 39: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 18:57:16,633 INFO L273 TraceCheckUtils]: 40: Hoare triple {19182#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 18:57:16,633 INFO L273 TraceCheckUtils]: 41: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 18:57:16,633 INFO L273 TraceCheckUtils]: 42: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 18:57:16,633 INFO L273 TraceCheckUtils]: 43: Hoare triple {19182#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 18:57:16,633 INFO L273 TraceCheckUtils]: 44: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 18:57:16,633 INFO L273 TraceCheckUtils]: 45: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 18:57:16,634 INFO L273 TraceCheckUtils]: 46: Hoare triple {19182#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 18:57:16,634 INFO L273 TraceCheckUtils]: 47: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 18:57:16,634 INFO L273 TraceCheckUtils]: 48: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 18:57:16,634 INFO L273 TraceCheckUtils]: 49: Hoare triple {19182#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 18:57:16,634 INFO L273 TraceCheckUtils]: 50: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 18:57:16,634 INFO L273 TraceCheckUtils]: 51: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 18:57:16,634 INFO L273 TraceCheckUtils]: 52: Hoare triple {19182#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 18:57:16,635 INFO L273 TraceCheckUtils]: 53: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 18:57:16,635 INFO L273 TraceCheckUtils]: 54: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 18:57:16,635 INFO L273 TraceCheckUtils]: 55: Hoare triple {19182#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 18:57:16,635 INFO L273 TraceCheckUtils]: 56: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 18:57:16,635 INFO L273 TraceCheckUtils]: 57: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 18:57:16,635 INFO L273 TraceCheckUtils]: 58: Hoare triple {19182#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 18:57:16,635 INFO L273 TraceCheckUtils]: 59: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 18:57:16,635 INFO L273 TraceCheckUtils]: 60: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 18:57:16,636 INFO L273 TraceCheckUtils]: 61: Hoare triple {19182#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 18:57:16,636 INFO L273 TraceCheckUtils]: 62: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 18:57:16,636 INFO L273 TraceCheckUtils]: 63: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 18:57:16,636 INFO L273 TraceCheckUtils]: 64: Hoare triple {19182#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 18:57:16,636 INFO L273 TraceCheckUtils]: 65: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 18:57:16,636 INFO L273 TraceCheckUtils]: 66: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 18:57:16,637 INFO L273 TraceCheckUtils]: 67: Hoare triple {19182#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 18:57:16,637 INFO L273 TraceCheckUtils]: 68: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 18:57:16,637 INFO L273 TraceCheckUtils]: 69: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 18:57:16,637 INFO L273 TraceCheckUtils]: 70: Hoare triple {19182#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 18:57:16,637 INFO L273 TraceCheckUtils]: 71: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 18:57:16,638 INFO L273 TraceCheckUtils]: 72: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 18:57:16,638 INFO L273 TraceCheckUtils]: 73: Hoare triple {19182#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19182#true} is VALID [2018-11-14 18:57:16,638 INFO L273 TraceCheckUtils]: 74: Hoare triple {19182#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19182#true} is VALID [2018-11-14 18:57:16,638 INFO L273 TraceCheckUtils]: 75: Hoare triple {19182#true} assume true; {19182#true} is VALID [2018-11-14 18:57:16,638 INFO L273 TraceCheckUtils]: 76: Hoare triple {19182#true} assume !(~i~1 < 100000); {19182#true} is VALID [2018-11-14 18:57:16,638 INFO L256 TraceCheckUtils]: 77: Hoare triple {19182#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {19182#true} is VALID [2018-11-14 18:57:16,639 INFO L273 TraceCheckUtils]: 78: Hoare triple {19182#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {19445#(<= xor_~i~0 1)} is VALID [2018-11-14 18:57:16,639 INFO L273 TraceCheckUtils]: 79: Hoare triple {19445#(<= xor_~i~0 1)} assume true; {19445#(<= xor_~i~0 1)} is VALID [2018-11-14 18:57:16,640 INFO L273 TraceCheckUtils]: 80: Hoare triple {19445#(<= xor_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19445#(<= xor_~i~0 1)} is VALID [2018-11-14 18:57:16,640 INFO L273 TraceCheckUtils]: 81: Hoare triple {19445#(<= xor_~i~0 1)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19455#(<= xor_~i~0 2)} is VALID [2018-11-14 18:57:16,641 INFO L273 TraceCheckUtils]: 82: Hoare triple {19455#(<= xor_~i~0 2)} assume true; {19455#(<= xor_~i~0 2)} is VALID [2018-11-14 18:57:16,641 INFO L273 TraceCheckUtils]: 83: Hoare triple {19455#(<= xor_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19455#(<= xor_~i~0 2)} is VALID [2018-11-14 18:57:16,641 INFO L273 TraceCheckUtils]: 84: Hoare triple {19455#(<= xor_~i~0 2)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19465#(<= xor_~i~0 3)} is VALID [2018-11-14 18:57:16,642 INFO L273 TraceCheckUtils]: 85: Hoare triple {19465#(<= xor_~i~0 3)} assume true; {19465#(<= xor_~i~0 3)} is VALID [2018-11-14 18:57:16,642 INFO L273 TraceCheckUtils]: 86: Hoare triple {19465#(<= xor_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19465#(<= xor_~i~0 3)} is VALID [2018-11-14 18:57:16,643 INFO L273 TraceCheckUtils]: 87: Hoare triple {19465#(<= xor_~i~0 3)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19475#(<= xor_~i~0 4)} is VALID [2018-11-14 18:57:16,643 INFO L273 TraceCheckUtils]: 88: Hoare triple {19475#(<= xor_~i~0 4)} assume true; {19475#(<= xor_~i~0 4)} is VALID [2018-11-14 18:57:16,644 INFO L273 TraceCheckUtils]: 89: Hoare triple {19475#(<= xor_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19475#(<= xor_~i~0 4)} is VALID [2018-11-14 18:57:16,645 INFO L273 TraceCheckUtils]: 90: Hoare triple {19475#(<= xor_~i~0 4)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19485#(<= xor_~i~0 5)} is VALID [2018-11-14 18:57:16,645 INFO L273 TraceCheckUtils]: 91: Hoare triple {19485#(<= xor_~i~0 5)} assume true; {19485#(<= xor_~i~0 5)} is VALID [2018-11-14 18:57:16,646 INFO L273 TraceCheckUtils]: 92: Hoare triple {19485#(<= xor_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19485#(<= xor_~i~0 5)} is VALID [2018-11-14 18:57:16,647 INFO L273 TraceCheckUtils]: 93: Hoare triple {19485#(<= xor_~i~0 5)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19495#(<= xor_~i~0 6)} is VALID [2018-11-14 18:57:16,647 INFO L273 TraceCheckUtils]: 94: Hoare triple {19495#(<= xor_~i~0 6)} assume true; {19495#(<= xor_~i~0 6)} is VALID [2018-11-14 18:57:16,648 INFO L273 TraceCheckUtils]: 95: Hoare triple {19495#(<= xor_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19495#(<= xor_~i~0 6)} is VALID [2018-11-14 18:57:16,649 INFO L273 TraceCheckUtils]: 96: Hoare triple {19495#(<= xor_~i~0 6)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19505#(<= xor_~i~0 7)} is VALID [2018-11-14 18:57:16,649 INFO L273 TraceCheckUtils]: 97: Hoare triple {19505#(<= xor_~i~0 7)} assume true; {19505#(<= xor_~i~0 7)} is VALID [2018-11-14 18:57:16,650 INFO L273 TraceCheckUtils]: 98: Hoare triple {19505#(<= xor_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19505#(<= xor_~i~0 7)} is VALID [2018-11-14 18:57:16,651 INFO L273 TraceCheckUtils]: 99: Hoare triple {19505#(<= xor_~i~0 7)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19515#(<= xor_~i~0 8)} is VALID [2018-11-14 18:57:16,651 INFO L273 TraceCheckUtils]: 100: Hoare triple {19515#(<= xor_~i~0 8)} assume true; {19515#(<= xor_~i~0 8)} is VALID [2018-11-14 18:57:16,652 INFO L273 TraceCheckUtils]: 101: Hoare triple {19515#(<= xor_~i~0 8)} assume !(~i~0 < 100000); {19183#false} is VALID [2018-11-14 18:57:16,652 INFO L273 TraceCheckUtils]: 102: Hoare triple {19183#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {19183#false} is VALID [2018-11-14 18:57:16,653 INFO L273 TraceCheckUtils]: 103: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 18:57:16,653 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {19183#false} {19182#true} #73#return; {19183#false} is VALID [2018-11-14 18:57:16,654 INFO L273 TraceCheckUtils]: 105: Hoare triple {19183#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {19183#false} is VALID [2018-11-14 18:57:16,654 INFO L256 TraceCheckUtils]: 106: Hoare triple {19183#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {19183#false} is VALID [2018-11-14 18:57:16,654 INFO L273 TraceCheckUtils]: 107: Hoare triple {19183#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {19183#false} is VALID [2018-11-14 18:57:16,655 INFO L273 TraceCheckUtils]: 108: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 18:57:16,655 INFO L273 TraceCheckUtils]: 109: Hoare triple {19183#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19183#false} is VALID [2018-11-14 18:57:16,655 INFO L273 TraceCheckUtils]: 110: Hoare triple {19183#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19183#false} is VALID [2018-11-14 18:57:16,655 INFO L273 TraceCheckUtils]: 111: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 18:57:16,655 INFO L273 TraceCheckUtils]: 112: Hoare triple {19183#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19183#false} is VALID [2018-11-14 18:57:16,656 INFO L273 TraceCheckUtils]: 113: Hoare triple {19183#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19183#false} is VALID [2018-11-14 18:57:16,656 INFO L273 TraceCheckUtils]: 114: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 18:57:16,656 INFO L273 TraceCheckUtils]: 115: Hoare triple {19183#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19183#false} is VALID [2018-11-14 18:57:16,656 INFO L273 TraceCheckUtils]: 116: Hoare triple {19183#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19183#false} is VALID [2018-11-14 18:57:16,656 INFO L273 TraceCheckUtils]: 117: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 18:57:16,657 INFO L273 TraceCheckUtils]: 118: Hoare triple {19183#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19183#false} is VALID [2018-11-14 18:57:16,657 INFO L273 TraceCheckUtils]: 119: Hoare triple {19183#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19183#false} is VALID [2018-11-14 18:57:16,657 INFO L273 TraceCheckUtils]: 120: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 18:57:16,657 INFO L273 TraceCheckUtils]: 121: Hoare triple {19183#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19183#false} is VALID [2018-11-14 18:57:16,657 INFO L273 TraceCheckUtils]: 122: Hoare triple {19183#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19183#false} is VALID [2018-11-14 18:57:16,657 INFO L273 TraceCheckUtils]: 123: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 18:57:16,658 INFO L273 TraceCheckUtils]: 124: Hoare triple {19183#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19183#false} is VALID [2018-11-14 18:57:16,658 INFO L273 TraceCheckUtils]: 125: Hoare triple {19183#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19183#false} is VALID [2018-11-14 18:57:16,658 INFO L273 TraceCheckUtils]: 126: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 18:57:16,658 INFO L273 TraceCheckUtils]: 127: Hoare triple {19183#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19183#false} is VALID [2018-11-14 18:57:16,658 INFO L273 TraceCheckUtils]: 128: Hoare triple {19183#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19183#false} is VALID [2018-11-14 18:57:16,659 INFO L273 TraceCheckUtils]: 129: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 18:57:16,659 INFO L273 TraceCheckUtils]: 130: Hoare triple {19183#false} assume !(~i~0 < 100000); {19183#false} is VALID [2018-11-14 18:57:16,659 INFO L273 TraceCheckUtils]: 131: Hoare triple {19183#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {19183#false} is VALID [2018-11-14 18:57:16,659 INFO L273 TraceCheckUtils]: 132: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 18:57:16,659 INFO L268 TraceCheckUtils]: 133: Hoare quadruple {19183#false} {19183#false} #75#return; {19183#false} is VALID [2018-11-14 18:57:16,659 INFO L273 TraceCheckUtils]: 134: Hoare triple {19183#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {19183#false} is VALID [2018-11-14 18:57:16,660 INFO L273 TraceCheckUtils]: 135: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 18:57:16,660 INFO L273 TraceCheckUtils]: 136: Hoare triple {19183#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19183#false} is VALID [2018-11-14 18:57:16,660 INFO L273 TraceCheckUtils]: 137: Hoare triple {19183#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19183#false} is VALID [2018-11-14 18:57:16,660 INFO L273 TraceCheckUtils]: 138: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 18:57:16,660 INFO L273 TraceCheckUtils]: 139: Hoare triple {19183#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19183#false} is VALID [2018-11-14 18:57:16,661 INFO L273 TraceCheckUtils]: 140: Hoare triple {19183#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19183#false} is VALID [2018-11-14 18:57:16,661 INFO L273 TraceCheckUtils]: 141: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 18:57:16,661 INFO L273 TraceCheckUtils]: 142: Hoare triple {19183#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19183#false} is VALID [2018-11-14 18:57:16,661 INFO L273 TraceCheckUtils]: 143: Hoare triple {19183#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19183#false} is VALID [2018-11-14 18:57:16,661 INFO L273 TraceCheckUtils]: 144: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 18:57:16,661 INFO L273 TraceCheckUtils]: 145: Hoare triple {19183#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19183#false} is VALID [2018-11-14 18:57:16,662 INFO L273 TraceCheckUtils]: 146: Hoare triple {19183#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19183#false} is VALID [2018-11-14 18:57:16,662 INFO L273 TraceCheckUtils]: 147: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 18:57:16,662 INFO L273 TraceCheckUtils]: 148: Hoare triple {19183#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19183#false} is VALID [2018-11-14 18:57:16,662 INFO L273 TraceCheckUtils]: 149: Hoare triple {19183#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19183#false} is VALID [2018-11-14 18:57:16,662 INFO L273 TraceCheckUtils]: 150: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 18:57:16,663 INFO L273 TraceCheckUtils]: 151: Hoare triple {19183#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19183#false} is VALID [2018-11-14 18:57:16,663 INFO L273 TraceCheckUtils]: 152: Hoare triple {19183#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19183#false} is VALID [2018-11-14 18:57:16,663 INFO L273 TraceCheckUtils]: 153: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 18:57:16,663 INFO L273 TraceCheckUtils]: 154: Hoare triple {19183#false} assume !(~i~2 < 99999); {19183#false} is VALID [2018-11-14 18:57:16,663 INFO L273 TraceCheckUtils]: 155: Hoare triple {19183#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {19183#false} is VALID [2018-11-14 18:57:16,664 INFO L256 TraceCheckUtils]: 156: Hoare triple {19183#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {19183#false} is VALID [2018-11-14 18:57:16,664 INFO L273 TraceCheckUtils]: 157: Hoare triple {19183#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {19183#false} is VALID [2018-11-14 18:57:16,664 INFO L273 TraceCheckUtils]: 158: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 18:57:16,664 INFO L273 TraceCheckUtils]: 159: Hoare triple {19183#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19183#false} is VALID [2018-11-14 18:57:16,664 INFO L273 TraceCheckUtils]: 160: Hoare triple {19183#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19183#false} is VALID [2018-11-14 18:57:16,664 INFO L273 TraceCheckUtils]: 161: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 18:57:16,665 INFO L273 TraceCheckUtils]: 162: Hoare triple {19183#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19183#false} is VALID [2018-11-14 18:57:16,665 INFO L273 TraceCheckUtils]: 163: Hoare triple {19183#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19183#false} is VALID [2018-11-14 18:57:16,665 INFO L273 TraceCheckUtils]: 164: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 18:57:16,665 INFO L273 TraceCheckUtils]: 165: Hoare triple {19183#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19183#false} is VALID [2018-11-14 18:57:16,665 INFO L273 TraceCheckUtils]: 166: Hoare triple {19183#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19183#false} is VALID [2018-11-14 18:57:16,666 INFO L273 TraceCheckUtils]: 167: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 18:57:16,666 INFO L273 TraceCheckUtils]: 168: Hoare triple {19183#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19183#false} is VALID [2018-11-14 18:57:16,666 INFO L273 TraceCheckUtils]: 169: Hoare triple {19183#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19183#false} is VALID [2018-11-14 18:57:16,666 INFO L273 TraceCheckUtils]: 170: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 18:57:16,666 INFO L273 TraceCheckUtils]: 171: Hoare triple {19183#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19183#false} is VALID [2018-11-14 18:57:16,666 INFO L273 TraceCheckUtils]: 172: Hoare triple {19183#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19183#false} is VALID [2018-11-14 18:57:16,667 INFO L273 TraceCheckUtils]: 173: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 18:57:16,667 INFO L273 TraceCheckUtils]: 174: Hoare triple {19183#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19183#false} is VALID [2018-11-14 18:57:16,667 INFO L273 TraceCheckUtils]: 175: Hoare triple {19183#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19183#false} is VALID [2018-11-14 18:57:16,667 INFO L273 TraceCheckUtils]: 176: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 18:57:16,667 INFO L273 TraceCheckUtils]: 177: Hoare triple {19183#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19183#false} is VALID [2018-11-14 18:57:16,668 INFO L273 TraceCheckUtils]: 178: Hoare triple {19183#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19183#false} is VALID [2018-11-14 18:57:16,668 INFO L273 TraceCheckUtils]: 179: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 18:57:16,668 INFO L273 TraceCheckUtils]: 180: Hoare triple {19183#false} assume !(~i~0 < 100000); {19183#false} is VALID [2018-11-14 18:57:16,668 INFO L273 TraceCheckUtils]: 181: Hoare triple {19183#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {19183#false} is VALID [2018-11-14 18:57:16,668 INFO L273 TraceCheckUtils]: 182: Hoare triple {19183#false} assume true; {19183#false} is VALID [2018-11-14 18:57:16,668 INFO L268 TraceCheckUtils]: 183: Hoare quadruple {19183#false} {19183#false} #77#return; {19183#false} is VALID [2018-11-14 18:57:16,669 INFO L273 TraceCheckUtils]: 184: Hoare triple {19183#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {19183#false} is VALID [2018-11-14 18:57:16,669 INFO L273 TraceCheckUtils]: 185: Hoare triple {19183#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {19183#false} is VALID [2018-11-14 18:57:16,669 INFO L273 TraceCheckUtils]: 186: Hoare triple {19183#false} assume !false; {19183#false} is VALID [2018-11-14 18:57:16,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1636 backedges. 356 proven. 77 refuted. 0 times theorem prover too weak. 1203 trivial. 0 not checked. [2018-11-14 18:57:16,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:57:16,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 10] total 34 [2018-11-14 18:57:16,730 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 187 [2018-11-14 18:57:16,731 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:57:16,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-14 18:57:17,099 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-14 18:57:17,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-14 18:57:17,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-14 18:57:17,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=753, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 18:57:17,101 INFO L87 Difference]: Start difference. First operand 134 states and 138 transitions. Second operand 34 states. [2018-11-14 18:57:18,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:57:18,110 INFO L93 Difference]: Finished difference Result 199 states and 211 transitions. [2018-11-14 18:57:18,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-14 18:57:18,110 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 187 [2018-11-14 18:57:18,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:57:18,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 18:57:18,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 157 transitions. [2018-11-14 18:57:18,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 18:57:18,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 157 transitions. [2018-11-14 18:57:18,112 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 157 transitions. [2018-11-14 18:57:18,268 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:57:18,271 INFO L225 Difference]: With dead ends: 199 [2018-11-14 18:57:18,271 INFO L226 Difference]: Without dead ends: 142 [2018-11-14 18:57:18,272 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=369, Invalid=753, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 18:57:18,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-11-14 18:57:18,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2018-11-14 18:57:18,306 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:57:18,306 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand 140 states. [2018-11-14 18:57:18,306 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 140 states. [2018-11-14 18:57:18,306 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 140 states. [2018-11-14 18:57:18,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:57:18,309 INFO L93 Difference]: Finished difference Result 142 states and 146 transitions. [2018-11-14 18:57:18,309 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 146 transitions. [2018-11-14 18:57:18,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:57:18,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:57:18,309 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand 142 states. [2018-11-14 18:57:18,309 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 142 states. [2018-11-14 18:57:18,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:57:18,311 INFO L93 Difference]: Finished difference Result 142 states and 146 transitions. [2018-11-14 18:57:18,311 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 146 transitions. [2018-11-14 18:57:18,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:57:18,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:57:18,312 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:57:18,312 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:57:18,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-14 18:57:18,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 144 transitions. [2018-11-14 18:57:18,314 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 144 transitions. Word has length 187 [2018-11-14 18:57:18,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:57:18,315 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 144 transitions. [2018-11-14 18:57:18,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-14 18:57:18,315 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 144 transitions. [2018-11-14 18:57:18,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-14 18:57:18,316 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:57:18,316 INFO L375 BasicCegarLoop]: trace histogram [27, 25, 24, 24, 24, 24, 7, 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-14 18:57:18,316 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:57:18,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:57:18,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1431621872, now seen corresponding path program 24 times [2018-11-14 18:57:18,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:57:18,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:57:18,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:57:18,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:57:18,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:57:18,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:57:19,372 INFO L256 TraceCheckUtils]: 0: Hoare triple {20516#true} call ULTIMATE.init(); {20516#true} is VALID [2018-11-14 18:57:19,372 INFO L273 TraceCheckUtils]: 1: Hoare triple {20516#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20516#true} is VALID [2018-11-14 18:57:19,372 INFO L273 TraceCheckUtils]: 2: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:19,372 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20516#true} {20516#true} #69#return; {20516#true} is VALID [2018-11-14 18:57:19,373 INFO L256 TraceCheckUtils]: 4: Hoare triple {20516#true} call #t~ret13 := main(); {20516#true} is VALID [2018-11-14 18:57:19,374 INFO L273 TraceCheckUtils]: 5: Hoare triple {20516#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; {20518#(= main_~i~1 0)} is VALID [2018-11-14 18:57:19,374 INFO L273 TraceCheckUtils]: 6: Hoare triple {20518#(= main_~i~1 0)} assume true; {20518#(= main_~i~1 0)} is VALID [2018-11-14 18:57:19,376 INFO L273 TraceCheckUtils]: 7: Hoare triple {20518#(= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {20518#(= main_~i~1 0)} is VALID [2018-11-14 18:57:19,376 INFO L273 TraceCheckUtils]: 8: Hoare triple {20518#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20519#(<= main_~i~1 1)} is VALID [2018-11-14 18:57:19,378 INFO L273 TraceCheckUtils]: 9: Hoare triple {20519#(<= main_~i~1 1)} assume true; {20519#(<= main_~i~1 1)} is VALID [2018-11-14 18:57:19,378 INFO L273 TraceCheckUtils]: 10: Hoare triple {20519#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {20519#(<= main_~i~1 1)} is VALID [2018-11-14 18:57:19,380 INFO L273 TraceCheckUtils]: 11: Hoare triple {20519#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20520#(<= main_~i~1 2)} is VALID [2018-11-14 18:57:19,380 INFO L273 TraceCheckUtils]: 12: Hoare triple {20520#(<= main_~i~1 2)} assume true; {20520#(<= main_~i~1 2)} is VALID [2018-11-14 18:57:19,382 INFO L273 TraceCheckUtils]: 13: Hoare triple {20520#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {20520#(<= main_~i~1 2)} is VALID [2018-11-14 18:57:19,382 INFO L273 TraceCheckUtils]: 14: Hoare triple {20520#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20521#(<= main_~i~1 3)} is VALID [2018-11-14 18:57:19,382 INFO L273 TraceCheckUtils]: 15: Hoare triple {20521#(<= main_~i~1 3)} assume true; {20521#(<= main_~i~1 3)} is VALID [2018-11-14 18:57:19,383 INFO L273 TraceCheckUtils]: 16: Hoare triple {20521#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {20521#(<= main_~i~1 3)} is VALID [2018-11-14 18:57:19,383 INFO L273 TraceCheckUtils]: 17: Hoare triple {20521#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20522#(<= main_~i~1 4)} is VALID [2018-11-14 18:57:19,383 INFO L273 TraceCheckUtils]: 18: Hoare triple {20522#(<= main_~i~1 4)} assume true; {20522#(<= main_~i~1 4)} is VALID [2018-11-14 18:57:19,384 INFO L273 TraceCheckUtils]: 19: Hoare triple {20522#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {20522#(<= main_~i~1 4)} is VALID [2018-11-14 18:57:19,384 INFO L273 TraceCheckUtils]: 20: Hoare triple {20522#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20523#(<= main_~i~1 5)} is VALID [2018-11-14 18:57:19,384 INFO L273 TraceCheckUtils]: 21: Hoare triple {20523#(<= main_~i~1 5)} assume true; {20523#(<= main_~i~1 5)} is VALID [2018-11-14 18:57:19,385 INFO L273 TraceCheckUtils]: 22: Hoare triple {20523#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {20523#(<= main_~i~1 5)} is VALID [2018-11-14 18:57:19,385 INFO L273 TraceCheckUtils]: 23: Hoare triple {20523#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20524#(<= main_~i~1 6)} is VALID [2018-11-14 18:57:19,386 INFO L273 TraceCheckUtils]: 24: Hoare triple {20524#(<= main_~i~1 6)} assume true; {20524#(<= main_~i~1 6)} is VALID [2018-11-14 18:57:19,386 INFO L273 TraceCheckUtils]: 25: Hoare triple {20524#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {20524#(<= main_~i~1 6)} is VALID [2018-11-14 18:57:19,387 INFO L273 TraceCheckUtils]: 26: Hoare triple {20524#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20525#(<= main_~i~1 7)} is VALID [2018-11-14 18:57:19,388 INFO L273 TraceCheckUtils]: 27: Hoare triple {20525#(<= main_~i~1 7)} assume true; {20525#(<= main_~i~1 7)} is VALID [2018-11-14 18:57:19,388 INFO L273 TraceCheckUtils]: 28: Hoare triple {20525#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {20525#(<= main_~i~1 7)} is VALID [2018-11-14 18:57:19,389 INFO L273 TraceCheckUtils]: 29: Hoare triple {20525#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20526#(<= main_~i~1 8)} is VALID [2018-11-14 18:57:19,389 INFO L273 TraceCheckUtils]: 30: Hoare triple {20526#(<= main_~i~1 8)} assume true; {20526#(<= main_~i~1 8)} is VALID [2018-11-14 18:57:19,390 INFO L273 TraceCheckUtils]: 31: Hoare triple {20526#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {20526#(<= main_~i~1 8)} is VALID [2018-11-14 18:57:19,390 INFO L273 TraceCheckUtils]: 32: Hoare triple {20526#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20527#(<= main_~i~1 9)} is VALID [2018-11-14 18:57:19,391 INFO L273 TraceCheckUtils]: 33: Hoare triple {20527#(<= main_~i~1 9)} assume true; {20527#(<= main_~i~1 9)} is VALID [2018-11-14 18:57:19,391 INFO L273 TraceCheckUtils]: 34: Hoare triple {20527#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {20527#(<= main_~i~1 9)} is VALID [2018-11-14 18:57:19,392 INFO L273 TraceCheckUtils]: 35: Hoare triple {20527#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20528#(<= main_~i~1 10)} is VALID [2018-11-14 18:57:19,393 INFO L273 TraceCheckUtils]: 36: Hoare triple {20528#(<= main_~i~1 10)} assume true; {20528#(<= main_~i~1 10)} is VALID [2018-11-14 18:57:19,393 INFO L273 TraceCheckUtils]: 37: Hoare triple {20528#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {20528#(<= main_~i~1 10)} is VALID [2018-11-14 18:57:19,394 INFO L273 TraceCheckUtils]: 38: Hoare triple {20528#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20529#(<= main_~i~1 11)} is VALID [2018-11-14 18:57:19,394 INFO L273 TraceCheckUtils]: 39: Hoare triple {20529#(<= main_~i~1 11)} assume true; {20529#(<= main_~i~1 11)} is VALID [2018-11-14 18:57:19,395 INFO L273 TraceCheckUtils]: 40: Hoare triple {20529#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {20529#(<= main_~i~1 11)} is VALID [2018-11-14 18:57:19,396 INFO L273 TraceCheckUtils]: 41: Hoare triple {20529#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20530#(<= main_~i~1 12)} is VALID [2018-11-14 18:57:19,396 INFO L273 TraceCheckUtils]: 42: Hoare triple {20530#(<= main_~i~1 12)} assume true; {20530#(<= main_~i~1 12)} is VALID [2018-11-14 18:57:19,397 INFO L273 TraceCheckUtils]: 43: Hoare triple {20530#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {20530#(<= main_~i~1 12)} is VALID [2018-11-14 18:57:19,397 INFO L273 TraceCheckUtils]: 44: Hoare triple {20530#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20531#(<= main_~i~1 13)} is VALID [2018-11-14 18:57:19,398 INFO L273 TraceCheckUtils]: 45: Hoare triple {20531#(<= main_~i~1 13)} assume true; {20531#(<= main_~i~1 13)} is VALID [2018-11-14 18:57:19,398 INFO L273 TraceCheckUtils]: 46: Hoare triple {20531#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {20531#(<= main_~i~1 13)} is VALID [2018-11-14 18:57:19,399 INFO L273 TraceCheckUtils]: 47: Hoare triple {20531#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20532#(<= main_~i~1 14)} is VALID [2018-11-14 18:57:19,399 INFO L273 TraceCheckUtils]: 48: Hoare triple {20532#(<= main_~i~1 14)} assume true; {20532#(<= main_~i~1 14)} is VALID [2018-11-14 18:57:19,400 INFO L273 TraceCheckUtils]: 49: Hoare triple {20532#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {20532#(<= main_~i~1 14)} is VALID [2018-11-14 18:57:19,401 INFO L273 TraceCheckUtils]: 50: Hoare triple {20532#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20533#(<= main_~i~1 15)} is VALID [2018-11-14 18:57:19,401 INFO L273 TraceCheckUtils]: 51: Hoare triple {20533#(<= main_~i~1 15)} assume true; {20533#(<= main_~i~1 15)} is VALID [2018-11-14 18:57:19,402 INFO L273 TraceCheckUtils]: 52: Hoare triple {20533#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {20533#(<= main_~i~1 15)} is VALID [2018-11-14 18:57:19,402 INFO L273 TraceCheckUtils]: 53: Hoare triple {20533#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20534#(<= main_~i~1 16)} is VALID [2018-11-14 18:57:19,403 INFO L273 TraceCheckUtils]: 54: Hoare triple {20534#(<= main_~i~1 16)} assume true; {20534#(<= main_~i~1 16)} is VALID [2018-11-14 18:57:19,403 INFO L273 TraceCheckUtils]: 55: Hoare triple {20534#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {20534#(<= main_~i~1 16)} is VALID [2018-11-14 18:57:19,404 INFO L273 TraceCheckUtils]: 56: Hoare triple {20534#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20535#(<= main_~i~1 17)} is VALID [2018-11-14 18:57:19,404 INFO L273 TraceCheckUtils]: 57: Hoare triple {20535#(<= main_~i~1 17)} assume true; {20535#(<= main_~i~1 17)} is VALID [2018-11-14 18:57:19,405 INFO L273 TraceCheckUtils]: 58: Hoare triple {20535#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {20535#(<= main_~i~1 17)} is VALID [2018-11-14 18:57:19,406 INFO L273 TraceCheckUtils]: 59: Hoare triple {20535#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20536#(<= main_~i~1 18)} is VALID [2018-11-14 18:57:19,406 INFO L273 TraceCheckUtils]: 60: Hoare triple {20536#(<= main_~i~1 18)} assume true; {20536#(<= main_~i~1 18)} is VALID [2018-11-14 18:57:19,407 INFO L273 TraceCheckUtils]: 61: Hoare triple {20536#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {20536#(<= main_~i~1 18)} is VALID [2018-11-14 18:57:19,407 INFO L273 TraceCheckUtils]: 62: Hoare triple {20536#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20537#(<= main_~i~1 19)} is VALID [2018-11-14 18:57:19,408 INFO L273 TraceCheckUtils]: 63: Hoare triple {20537#(<= main_~i~1 19)} assume true; {20537#(<= main_~i~1 19)} is VALID [2018-11-14 18:57:19,408 INFO L273 TraceCheckUtils]: 64: Hoare triple {20537#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {20537#(<= main_~i~1 19)} is VALID [2018-11-14 18:57:19,409 INFO L273 TraceCheckUtils]: 65: Hoare triple {20537#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20538#(<= main_~i~1 20)} is VALID [2018-11-14 18:57:19,410 INFO L273 TraceCheckUtils]: 66: Hoare triple {20538#(<= main_~i~1 20)} assume true; {20538#(<= main_~i~1 20)} is VALID [2018-11-14 18:57:19,410 INFO L273 TraceCheckUtils]: 67: Hoare triple {20538#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {20538#(<= main_~i~1 20)} is VALID [2018-11-14 18:57:19,411 INFO L273 TraceCheckUtils]: 68: Hoare triple {20538#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20539#(<= main_~i~1 21)} is VALID [2018-11-14 18:57:19,411 INFO L273 TraceCheckUtils]: 69: Hoare triple {20539#(<= main_~i~1 21)} assume true; {20539#(<= main_~i~1 21)} is VALID [2018-11-14 18:57:19,412 INFO L273 TraceCheckUtils]: 70: Hoare triple {20539#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {20539#(<= main_~i~1 21)} is VALID [2018-11-14 18:57:19,412 INFO L273 TraceCheckUtils]: 71: Hoare triple {20539#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20540#(<= main_~i~1 22)} is VALID [2018-11-14 18:57:19,413 INFO L273 TraceCheckUtils]: 72: Hoare triple {20540#(<= main_~i~1 22)} assume true; {20540#(<= main_~i~1 22)} is VALID [2018-11-14 18:57:19,413 INFO L273 TraceCheckUtils]: 73: Hoare triple {20540#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {20540#(<= main_~i~1 22)} is VALID [2018-11-14 18:57:19,414 INFO L273 TraceCheckUtils]: 74: Hoare triple {20540#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20541#(<= main_~i~1 23)} is VALID [2018-11-14 18:57:19,415 INFO L273 TraceCheckUtils]: 75: Hoare triple {20541#(<= main_~i~1 23)} assume true; {20541#(<= main_~i~1 23)} is VALID [2018-11-14 18:57:19,415 INFO L273 TraceCheckUtils]: 76: Hoare triple {20541#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {20541#(<= main_~i~1 23)} is VALID [2018-11-14 18:57:19,416 INFO L273 TraceCheckUtils]: 77: Hoare triple {20541#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20542#(<= main_~i~1 24)} is VALID [2018-11-14 18:57:19,416 INFO L273 TraceCheckUtils]: 78: Hoare triple {20542#(<= main_~i~1 24)} assume true; {20542#(<= main_~i~1 24)} is VALID [2018-11-14 18:57:19,417 INFO L273 TraceCheckUtils]: 79: Hoare triple {20542#(<= main_~i~1 24)} assume !(~i~1 < 100000); {20517#false} is VALID [2018-11-14 18:57:19,417 INFO L256 TraceCheckUtils]: 80: Hoare triple {20517#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {20516#true} is VALID [2018-11-14 18:57:19,417 INFO L273 TraceCheckUtils]: 81: Hoare triple {20516#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {20516#true} is VALID [2018-11-14 18:57:19,417 INFO L273 TraceCheckUtils]: 82: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:19,418 INFO L273 TraceCheckUtils]: 83: Hoare triple {20516#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 18:57:19,418 INFO L273 TraceCheckUtils]: 84: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 18:57:19,418 INFO L273 TraceCheckUtils]: 85: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:19,418 INFO L273 TraceCheckUtils]: 86: Hoare triple {20516#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 18:57:19,418 INFO L273 TraceCheckUtils]: 87: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 18:57:19,419 INFO L273 TraceCheckUtils]: 88: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:19,419 INFO L273 TraceCheckUtils]: 89: Hoare triple {20516#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 18:57:19,419 INFO L273 TraceCheckUtils]: 90: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 18:57:19,420 INFO L273 TraceCheckUtils]: 91: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:19,420 INFO L273 TraceCheckUtils]: 92: Hoare triple {20516#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 18:57:19,420 INFO L273 TraceCheckUtils]: 93: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 18:57:19,420 INFO L273 TraceCheckUtils]: 94: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:19,420 INFO L273 TraceCheckUtils]: 95: Hoare triple {20516#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 18:57:19,420 INFO L273 TraceCheckUtils]: 96: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 18:57:19,420 INFO L273 TraceCheckUtils]: 97: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:19,421 INFO L273 TraceCheckUtils]: 98: Hoare triple {20516#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 18:57:19,421 INFO L273 TraceCheckUtils]: 99: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 18:57:19,421 INFO L273 TraceCheckUtils]: 100: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:19,421 INFO L273 TraceCheckUtils]: 101: Hoare triple {20516#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 18:57:19,421 INFO L273 TraceCheckUtils]: 102: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 18:57:19,421 INFO L273 TraceCheckUtils]: 103: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:19,421 INFO L273 TraceCheckUtils]: 104: Hoare triple {20516#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 18:57:19,421 INFO L273 TraceCheckUtils]: 105: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 18:57:19,421 INFO L273 TraceCheckUtils]: 106: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:19,421 INFO L273 TraceCheckUtils]: 107: Hoare triple {20516#true} assume !(~i~0 < 100000); {20516#true} is VALID [2018-11-14 18:57:19,422 INFO L273 TraceCheckUtils]: 108: Hoare triple {20516#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {20516#true} is VALID [2018-11-14 18:57:19,422 INFO L273 TraceCheckUtils]: 109: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:19,422 INFO L268 TraceCheckUtils]: 110: Hoare quadruple {20516#true} {20517#false} #73#return; {20517#false} is VALID [2018-11-14 18:57:19,422 INFO L273 TraceCheckUtils]: 111: Hoare triple {20517#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {20517#false} is VALID [2018-11-14 18:57:19,422 INFO L256 TraceCheckUtils]: 112: Hoare triple {20517#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {20516#true} is VALID [2018-11-14 18:57:19,422 INFO L273 TraceCheckUtils]: 113: Hoare triple {20516#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {20516#true} is VALID [2018-11-14 18:57:19,422 INFO L273 TraceCheckUtils]: 114: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:19,422 INFO L273 TraceCheckUtils]: 115: Hoare triple {20516#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 18:57:19,422 INFO L273 TraceCheckUtils]: 116: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 18:57:19,423 INFO L273 TraceCheckUtils]: 117: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:19,423 INFO L273 TraceCheckUtils]: 118: Hoare triple {20516#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 18:57:19,423 INFO L273 TraceCheckUtils]: 119: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 18:57:19,423 INFO L273 TraceCheckUtils]: 120: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:19,423 INFO L273 TraceCheckUtils]: 121: Hoare triple {20516#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 18:57:19,423 INFO L273 TraceCheckUtils]: 122: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 18:57:19,423 INFO L273 TraceCheckUtils]: 123: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:19,423 INFO L273 TraceCheckUtils]: 124: Hoare triple {20516#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 18:57:19,423 INFO L273 TraceCheckUtils]: 125: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 18:57:19,423 INFO L273 TraceCheckUtils]: 126: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:19,424 INFO L273 TraceCheckUtils]: 127: Hoare triple {20516#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 18:57:19,424 INFO L273 TraceCheckUtils]: 128: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 18:57:19,424 INFO L273 TraceCheckUtils]: 129: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:19,424 INFO L273 TraceCheckUtils]: 130: Hoare triple {20516#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 18:57:19,424 INFO L273 TraceCheckUtils]: 131: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 18:57:19,424 INFO L273 TraceCheckUtils]: 132: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:19,424 INFO L273 TraceCheckUtils]: 133: Hoare triple {20516#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 18:57:19,424 INFO L273 TraceCheckUtils]: 134: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 18:57:19,424 INFO L273 TraceCheckUtils]: 135: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:19,424 INFO L273 TraceCheckUtils]: 136: Hoare triple {20516#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 18:57:19,425 INFO L273 TraceCheckUtils]: 137: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 18:57:19,425 INFO L273 TraceCheckUtils]: 138: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:19,425 INFO L273 TraceCheckUtils]: 139: Hoare triple {20516#true} assume !(~i~0 < 100000); {20516#true} is VALID [2018-11-14 18:57:19,425 INFO L273 TraceCheckUtils]: 140: Hoare triple {20516#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {20516#true} is VALID [2018-11-14 18:57:19,425 INFO L273 TraceCheckUtils]: 141: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:19,425 INFO L268 TraceCheckUtils]: 142: Hoare quadruple {20516#true} {20517#false} #75#return; {20517#false} is VALID [2018-11-14 18:57:19,425 INFO L273 TraceCheckUtils]: 143: Hoare triple {20517#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {20517#false} is VALID [2018-11-14 18:57:19,425 INFO L273 TraceCheckUtils]: 144: Hoare triple {20517#false} assume true; {20517#false} is VALID [2018-11-14 18:57:19,425 INFO L273 TraceCheckUtils]: 145: Hoare triple {20517#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {20517#false} is VALID [2018-11-14 18:57:19,425 INFO L273 TraceCheckUtils]: 146: Hoare triple {20517#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {20517#false} is VALID [2018-11-14 18:57:19,426 INFO L273 TraceCheckUtils]: 147: Hoare triple {20517#false} assume true; {20517#false} is VALID [2018-11-14 18:57:19,426 INFO L273 TraceCheckUtils]: 148: Hoare triple {20517#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {20517#false} is VALID [2018-11-14 18:57:19,426 INFO L273 TraceCheckUtils]: 149: Hoare triple {20517#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {20517#false} is VALID [2018-11-14 18:57:19,426 INFO L273 TraceCheckUtils]: 150: Hoare triple {20517#false} assume true; {20517#false} is VALID [2018-11-14 18:57:19,426 INFO L273 TraceCheckUtils]: 151: Hoare triple {20517#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {20517#false} is VALID [2018-11-14 18:57:19,426 INFO L273 TraceCheckUtils]: 152: Hoare triple {20517#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {20517#false} is VALID [2018-11-14 18:57:19,426 INFO L273 TraceCheckUtils]: 153: Hoare triple {20517#false} assume true; {20517#false} is VALID [2018-11-14 18:57:19,426 INFO L273 TraceCheckUtils]: 154: Hoare triple {20517#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {20517#false} is VALID [2018-11-14 18:57:19,426 INFO L273 TraceCheckUtils]: 155: Hoare triple {20517#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {20517#false} is VALID [2018-11-14 18:57:19,427 INFO L273 TraceCheckUtils]: 156: Hoare triple {20517#false} assume true; {20517#false} is VALID [2018-11-14 18:57:19,427 INFO L273 TraceCheckUtils]: 157: Hoare triple {20517#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {20517#false} is VALID [2018-11-14 18:57:19,427 INFO L273 TraceCheckUtils]: 158: Hoare triple {20517#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {20517#false} is VALID [2018-11-14 18:57:19,427 INFO L273 TraceCheckUtils]: 159: Hoare triple {20517#false} assume true; {20517#false} is VALID [2018-11-14 18:57:19,427 INFO L273 TraceCheckUtils]: 160: Hoare triple {20517#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {20517#false} is VALID [2018-11-14 18:57:19,427 INFO L273 TraceCheckUtils]: 161: Hoare triple {20517#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {20517#false} is VALID [2018-11-14 18:57:19,427 INFO L273 TraceCheckUtils]: 162: Hoare triple {20517#false} assume true; {20517#false} is VALID [2018-11-14 18:57:19,427 INFO L273 TraceCheckUtils]: 163: Hoare triple {20517#false} assume !(~i~2 < 99999); {20517#false} is VALID [2018-11-14 18:57:19,427 INFO L273 TraceCheckUtils]: 164: Hoare triple {20517#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {20517#false} is VALID [2018-11-14 18:57:19,427 INFO L256 TraceCheckUtils]: 165: Hoare triple {20517#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {20516#true} is VALID [2018-11-14 18:57:19,428 INFO L273 TraceCheckUtils]: 166: Hoare triple {20516#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {20516#true} is VALID [2018-11-14 18:57:19,428 INFO L273 TraceCheckUtils]: 167: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:19,428 INFO L273 TraceCheckUtils]: 168: Hoare triple {20516#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 18:57:19,428 INFO L273 TraceCheckUtils]: 169: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 18:57:19,428 INFO L273 TraceCheckUtils]: 170: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:19,428 INFO L273 TraceCheckUtils]: 171: Hoare triple {20516#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 18:57:19,428 INFO L273 TraceCheckUtils]: 172: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 18:57:19,428 INFO L273 TraceCheckUtils]: 173: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:19,428 INFO L273 TraceCheckUtils]: 174: Hoare triple {20516#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 18:57:19,428 INFO L273 TraceCheckUtils]: 175: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 18:57:19,429 INFO L273 TraceCheckUtils]: 176: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:19,429 INFO L273 TraceCheckUtils]: 177: Hoare triple {20516#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 18:57:19,429 INFO L273 TraceCheckUtils]: 178: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 18:57:19,429 INFO L273 TraceCheckUtils]: 179: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:19,429 INFO L273 TraceCheckUtils]: 180: Hoare triple {20516#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 18:57:19,429 INFO L273 TraceCheckUtils]: 181: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 18:57:19,429 INFO L273 TraceCheckUtils]: 182: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:19,429 INFO L273 TraceCheckUtils]: 183: Hoare triple {20516#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 18:57:19,429 INFO L273 TraceCheckUtils]: 184: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 18:57:19,429 INFO L273 TraceCheckUtils]: 185: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:19,430 INFO L273 TraceCheckUtils]: 186: Hoare triple {20516#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 18:57:19,430 INFO L273 TraceCheckUtils]: 187: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 18:57:19,430 INFO L273 TraceCheckUtils]: 188: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:19,430 INFO L273 TraceCheckUtils]: 189: Hoare triple {20516#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 18:57:19,430 INFO L273 TraceCheckUtils]: 190: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 18:57:19,430 INFO L273 TraceCheckUtils]: 191: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:19,430 INFO L273 TraceCheckUtils]: 192: Hoare triple {20516#true} assume !(~i~0 < 100000); {20516#true} is VALID [2018-11-14 18:57:19,430 INFO L273 TraceCheckUtils]: 193: Hoare triple {20516#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {20516#true} is VALID [2018-11-14 18:57:19,430 INFO L273 TraceCheckUtils]: 194: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:19,430 INFO L268 TraceCheckUtils]: 195: Hoare quadruple {20516#true} {20517#false} #77#return; {20517#false} is VALID [2018-11-14 18:57:19,431 INFO L273 TraceCheckUtils]: 196: Hoare triple {20517#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {20517#false} is VALID [2018-11-14 18:57:19,431 INFO L273 TraceCheckUtils]: 197: Hoare triple {20517#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {20517#false} is VALID [2018-11-14 18:57:19,431 INFO L273 TraceCheckUtils]: 198: Hoare triple {20517#false} assume !false; {20517#false} is VALID [2018-11-14 18:57:19,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1923 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 1047 trivial. 0 not checked. [2018-11-14 18:57:19,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:57:19,451 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-14 18:57:19,459 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 18:57:19,966 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2018-11-14 18:57:19,967 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:57:19,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:57:19,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:57:20,238 INFO L256 TraceCheckUtils]: 0: Hoare triple {20516#true} call ULTIMATE.init(); {20516#true} is VALID [2018-11-14 18:57:20,239 INFO L273 TraceCheckUtils]: 1: Hoare triple {20516#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20516#true} is VALID [2018-11-14 18:57:20,239 INFO L273 TraceCheckUtils]: 2: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:20,239 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20516#true} {20516#true} #69#return; {20516#true} is VALID [2018-11-14 18:57:20,239 INFO L256 TraceCheckUtils]: 4: Hoare triple {20516#true} call #t~ret13 := main(); {20516#true} is VALID [2018-11-14 18:57:20,239 INFO L273 TraceCheckUtils]: 5: Hoare triple {20516#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; {20516#true} is VALID [2018-11-14 18:57:20,240 INFO L273 TraceCheckUtils]: 6: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:20,240 INFO L273 TraceCheckUtils]: 7: Hoare triple {20516#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 18:57:20,240 INFO L273 TraceCheckUtils]: 8: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 18:57:20,240 INFO L273 TraceCheckUtils]: 9: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:20,240 INFO L273 TraceCheckUtils]: 10: Hoare triple {20516#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 18:57:20,240 INFO L273 TraceCheckUtils]: 11: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 18:57:20,241 INFO L273 TraceCheckUtils]: 12: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:20,241 INFO L273 TraceCheckUtils]: 13: Hoare triple {20516#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 18:57:20,241 INFO L273 TraceCheckUtils]: 14: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 18:57:20,241 INFO L273 TraceCheckUtils]: 15: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:20,241 INFO L273 TraceCheckUtils]: 16: Hoare triple {20516#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 18:57:20,241 INFO L273 TraceCheckUtils]: 17: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 18:57:20,241 INFO L273 TraceCheckUtils]: 18: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:20,241 INFO L273 TraceCheckUtils]: 19: Hoare triple {20516#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 18:57:20,241 INFO L273 TraceCheckUtils]: 20: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 18:57:20,241 INFO L273 TraceCheckUtils]: 21: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:20,242 INFO L273 TraceCheckUtils]: 22: Hoare triple {20516#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 18:57:20,242 INFO L273 TraceCheckUtils]: 23: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 18:57:20,242 INFO L273 TraceCheckUtils]: 24: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:20,242 INFO L273 TraceCheckUtils]: 25: Hoare triple {20516#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 18:57:20,242 INFO L273 TraceCheckUtils]: 26: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 18:57:20,242 INFO L273 TraceCheckUtils]: 27: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:20,242 INFO L273 TraceCheckUtils]: 28: Hoare triple {20516#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 18:57:20,242 INFO L273 TraceCheckUtils]: 29: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 18:57:20,242 INFO L273 TraceCheckUtils]: 30: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:20,242 INFO L273 TraceCheckUtils]: 31: Hoare triple {20516#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 18:57:20,243 INFO L273 TraceCheckUtils]: 32: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 18:57:20,243 INFO L273 TraceCheckUtils]: 33: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:20,243 INFO L273 TraceCheckUtils]: 34: Hoare triple {20516#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 18:57:20,243 INFO L273 TraceCheckUtils]: 35: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 18:57:20,243 INFO L273 TraceCheckUtils]: 36: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:20,243 INFO L273 TraceCheckUtils]: 37: Hoare triple {20516#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 18:57:20,243 INFO L273 TraceCheckUtils]: 38: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 18:57:20,243 INFO L273 TraceCheckUtils]: 39: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:20,243 INFO L273 TraceCheckUtils]: 40: Hoare triple {20516#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 18:57:20,243 INFO L273 TraceCheckUtils]: 41: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 18:57:20,244 INFO L273 TraceCheckUtils]: 42: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:20,244 INFO L273 TraceCheckUtils]: 43: Hoare triple {20516#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 18:57:20,244 INFO L273 TraceCheckUtils]: 44: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 18:57:20,244 INFO L273 TraceCheckUtils]: 45: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:20,244 INFO L273 TraceCheckUtils]: 46: Hoare triple {20516#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 18:57:20,244 INFO L273 TraceCheckUtils]: 47: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 18:57:20,244 INFO L273 TraceCheckUtils]: 48: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:20,244 INFO L273 TraceCheckUtils]: 49: Hoare triple {20516#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 18:57:20,244 INFO L273 TraceCheckUtils]: 50: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 18:57:20,244 INFO L273 TraceCheckUtils]: 51: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:20,245 INFO L273 TraceCheckUtils]: 52: Hoare triple {20516#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 18:57:20,245 INFO L273 TraceCheckUtils]: 53: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 18:57:20,245 INFO L273 TraceCheckUtils]: 54: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:20,245 INFO L273 TraceCheckUtils]: 55: Hoare triple {20516#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 18:57:20,245 INFO L273 TraceCheckUtils]: 56: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 18:57:20,245 INFO L273 TraceCheckUtils]: 57: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:20,245 INFO L273 TraceCheckUtils]: 58: Hoare triple {20516#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 18:57:20,245 INFO L273 TraceCheckUtils]: 59: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 18:57:20,245 INFO L273 TraceCheckUtils]: 60: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:20,246 INFO L273 TraceCheckUtils]: 61: Hoare triple {20516#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 18:57:20,246 INFO L273 TraceCheckUtils]: 62: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 18:57:20,246 INFO L273 TraceCheckUtils]: 63: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:20,246 INFO L273 TraceCheckUtils]: 64: Hoare triple {20516#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 18:57:20,246 INFO L273 TraceCheckUtils]: 65: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 18:57:20,246 INFO L273 TraceCheckUtils]: 66: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:20,246 INFO L273 TraceCheckUtils]: 67: Hoare triple {20516#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 18:57:20,246 INFO L273 TraceCheckUtils]: 68: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 18:57:20,246 INFO L273 TraceCheckUtils]: 69: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:20,246 INFO L273 TraceCheckUtils]: 70: Hoare triple {20516#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 18:57:20,247 INFO L273 TraceCheckUtils]: 71: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 18:57:20,247 INFO L273 TraceCheckUtils]: 72: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:20,247 INFO L273 TraceCheckUtils]: 73: Hoare triple {20516#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 18:57:20,247 INFO L273 TraceCheckUtils]: 74: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 18:57:20,247 INFO L273 TraceCheckUtils]: 75: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:20,247 INFO L273 TraceCheckUtils]: 76: Hoare triple {20516#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20516#true} is VALID [2018-11-14 18:57:20,247 INFO L273 TraceCheckUtils]: 77: Hoare triple {20516#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20516#true} is VALID [2018-11-14 18:57:20,247 INFO L273 TraceCheckUtils]: 78: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:20,247 INFO L273 TraceCheckUtils]: 79: Hoare triple {20516#true} assume !(~i~1 < 100000); {20516#true} is VALID [2018-11-14 18:57:20,247 INFO L256 TraceCheckUtils]: 80: Hoare triple {20516#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {20516#true} is VALID [2018-11-14 18:57:20,248 INFO L273 TraceCheckUtils]: 81: Hoare triple {20516#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {20516#true} is VALID [2018-11-14 18:57:20,248 INFO L273 TraceCheckUtils]: 82: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:20,248 INFO L273 TraceCheckUtils]: 83: Hoare triple {20516#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 18:57:20,248 INFO L273 TraceCheckUtils]: 84: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 18:57:20,248 INFO L273 TraceCheckUtils]: 85: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:20,248 INFO L273 TraceCheckUtils]: 86: Hoare triple {20516#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 18:57:20,248 INFO L273 TraceCheckUtils]: 87: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 18:57:20,248 INFO L273 TraceCheckUtils]: 88: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:20,248 INFO L273 TraceCheckUtils]: 89: Hoare triple {20516#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 18:57:20,248 INFO L273 TraceCheckUtils]: 90: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 18:57:20,249 INFO L273 TraceCheckUtils]: 91: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:20,249 INFO L273 TraceCheckUtils]: 92: Hoare triple {20516#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 18:57:20,249 INFO L273 TraceCheckUtils]: 93: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 18:57:20,249 INFO L273 TraceCheckUtils]: 94: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:20,249 INFO L273 TraceCheckUtils]: 95: Hoare triple {20516#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 18:57:20,249 INFO L273 TraceCheckUtils]: 96: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 18:57:20,249 INFO L273 TraceCheckUtils]: 97: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:20,249 INFO L273 TraceCheckUtils]: 98: Hoare triple {20516#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 18:57:20,249 INFO L273 TraceCheckUtils]: 99: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 18:57:20,249 INFO L273 TraceCheckUtils]: 100: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:20,250 INFO L273 TraceCheckUtils]: 101: Hoare triple {20516#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 18:57:20,250 INFO L273 TraceCheckUtils]: 102: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 18:57:20,250 INFO L273 TraceCheckUtils]: 103: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:20,250 INFO L273 TraceCheckUtils]: 104: Hoare triple {20516#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 18:57:20,250 INFO L273 TraceCheckUtils]: 105: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 18:57:20,250 INFO L273 TraceCheckUtils]: 106: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:20,250 INFO L273 TraceCheckUtils]: 107: Hoare triple {20516#true} assume !(~i~0 < 100000); {20516#true} is VALID [2018-11-14 18:57:20,250 INFO L273 TraceCheckUtils]: 108: Hoare triple {20516#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {20516#true} is VALID [2018-11-14 18:57:20,250 INFO L273 TraceCheckUtils]: 109: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:20,250 INFO L268 TraceCheckUtils]: 110: Hoare quadruple {20516#true} {20516#true} #73#return; {20516#true} is VALID [2018-11-14 18:57:20,251 INFO L273 TraceCheckUtils]: 111: Hoare triple {20516#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {20516#true} is VALID [2018-11-14 18:57:20,251 INFO L256 TraceCheckUtils]: 112: Hoare triple {20516#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {20516#true} is VALID [2018-11-14 18:57:20,251 INFO L273 TraceCheckUtils]: 113: Hoare triple {20516#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {20516#true} is VALID [2018-11-14 18:57:20,251 INFO L273 TraceCheckUtils]: 114: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:20,251 INFO L273 TraceCheckUtils]: 115: Hoare triple {20516#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 18:57:20,251 INFO L273 TraceCheckUtils]: 116: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 18:57:20,251 INFO L273 TraceCheckUtils]: 117: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:20,251 INFO L273 TraceCheckUtils]: 118: Hoare triple {20516#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 18:57:20,251 INFO L273 TraceCheckUtils]: 119: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 18:57:20,252 INFO L273 TraceCheckUtils]: 120: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:20,252 INFO L273 TraceCheckUtils]: 121: Hoare triple {20516#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 18:57:20,252 INFO L273 TraceCheckUtils]: 122: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 18:57:20,252 INFO L273 TraceCheckUtils]: 123: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:20,252 INFO L273 TraceCheckUtils]: 124: Hoare triple {20516#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 18:57:20,252 INFO L273 TraceCheckUtils]: 125: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 18:57:20,252 INFO L273 TraceCheckUtils]: 126: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:20,252 INFO L273 TraceCheckUtils]: 127: Hoare triple {20516#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 18:57:20,252 INFO L273 TraceCheckUtils]: 128: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 18:57:20,252 INFO L273 TraceCheckUtils]: 129: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:20,252 INFO L273 TraceCheckUtils]: 130: Hoare triple {20516#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 18:57:20,253 INFO L273 TraceCheckUtils]: 131: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 18:57:20,253 INFO L273 TraceCheckUtils]: 132: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:20,253 INFO L273 TraceCheckUtils]: 133: Hoare triple {20516#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 18:57:20,253 INFO L273 TraceCheckUtils]: 134: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 18:57:20,253 INFO L273 TraceCheckUtils]: 135: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:20,253 INFO L273 TraceCheckUtils]: 136: Hoare triple {20516#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20516#true} is VALID [2018-11-14 18:57:20,253 INFO L273 TraceCheckUtils]: 137: Hoare triple {20516#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20516#true} is VALID [2018-11-14 18:57:20,253 INFO L273 TraceCheckUtils]: 138: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:20,253 INFO L273 TraceCheckUtils]: 139: Hoare triple {20516#true} assume !(~i~0 < 100000); {20516#true} is VALID [2018-11-14 18:57:20,254 INFO L273 TraceCheckUtils]: 140: Hoare triple {20516#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {20516#true} is VALID [2018-11-14 18:57:20,254 INFO L273 TraceCheckUtils]: 141: Hoare triple {20516#true} assume true; {20516#true} is VALID [2018-11-14 18:57:20,254 INFO L268 TraceCheckUtils]: 142: Hoare quadruple {20516#true} {20516#true} #75#return; {20516#true} is VALID [2018-11-14 18:57:20,255 INFO L273 TraceCheckUtils]: 143: Hoare triple {20516#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {20975#(<= main_~i~2 0)} is VALID [2018-11-14 18:57:20,255 INFO L273 TraceCheckUtils]: 144: Hoare triple {20975#(<= main_~i~2 0)} assume true; {20975#(<= main_~i~2 0)} is VALID [2018-11-14 18:57:20,255 INFO L273 TraceCheckUtils]: 145: Hoare triple {20975#(<= main_~i~2 0)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {20975#(<= main_~i~2 0)} is VALID [2018-11-14 18:57:20,257 INFO L273 TraceCheckUtils]: 146: Hoare triple {20975#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {20985#(<= main_~i~2 1)} is VALID [2018-11-14 18:57:20,257 INFO L273 TraceCheckUtils]: 147: Hoare triple {20985#(<= main_~i~2 1)} assume true; {20985#(<= main_~i~2 1)} is VALID [2018-11-14 18:57:20,259 INFO L273 TraceCheckUtils]: 148: Hoare triple {20985#(<= main_~i~2 1)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {20985#(<= main_~i~2 1)} is VALID [2018-11-14 18:57:20,259 INFO L273 TraceCheckUtils]: 149: Hoare triple {20985#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {20995#(<= main_~i~2 2)} is VALID [2018-11-14 18:57:20,259 INFO L273 TraceCheckUtils]: 150: Hoare triple {20995#(<= main_~i~2 2)} assume true; {20995#(<= main_~i~2 2)} is VALID [2018-11-14 18:57:20,260 INFO L273 TraceCheckUtils]: 151: Hoare triple {20995#(<= main_~i~2 2)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {20995#(<= main_~i~2 2)} is VALID [2018-11-14 18:57:20,260 INFO L273 TraceCheckUtils]: 152: Hoare triple {20995#(<= main_~i~2 2)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21005#(<= main_~i~2 3)} is VALID [2018-11-14 18:57:20,260 INFO L273 TraceCheckUtils]: 153: Hoare triple {21005#(<= main_~i~2 3)} assume true; {21005#(<= main_~i~2 3)} is VALID [2018-11-14 18:57:20,261 INFO L273 TraceCheckUtils]: 154: Hoare triple {21005#(<= main_~i~2 3)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21005#(<= main_~i~2 3)} is VALID [2018-11-14 18:57:20,261 INFO L273 TraceCheckUtils]: 155: Hoare triple {21005#(<= main_~i~2 3)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21015#(<= main_~i~2 4)} is VALID [2018-11-14 18:57:20,261 INFO L273 TraceCheckUtils]: 156: Hoare triple {21015#(<= main_~i~2 4)} assume true; {21015#(<= main_~i~2 4)} is VALID [2018-11-14 18:57:20,262 INFO L273 TraceCheckUtils]: 157: Hoare triple {21015#(<= main_~i~2 4)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21015#(<= main_~i~2 4)} is VALID [2018-11-14 18:57:20,262 INFO L273 TraceCheckUtils]: 158: Hoare triple {21015#(<= main_~i~2 4)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21025#(<= main_~i~2 5)} is VALID [2018-11-14 18:57:20,262 INFO L273 TraceCheckUtils]: 159: Hoare triple {21025#(<= main_~i~2 5)} assume true; {21025#(<= main_~i~2 5)} is VALID [2018-11-14 18:57:20,263 INFO L273 TraceCheckUtils]: 160: Hoare triple {21025#(<= main_~i~2 5)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21025#(<= main_~i~2 5)} is VALID [2018-11-14 18:57:20,264 INFO L273 TraceCheckUtils]: 161: Hoare triple {21025#(<= main_~i~2 5)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21035#(<= main_~i~2 6)} is VALID [2018-11-14 18:57:20,264 INFO L273 TraceCheckUtils]: 162: Hoare triple {21035#(<= main_~i~2 6)} assume true; {21035#(<= main_~i~2 6)} is VALID [2018-11-14 18:57:20,265 INFO L273 TraceCheckUtils]: 163: Hoare triple {21035#(<= main_~i~2 6)} assume !(~i~2 < 99999); {20517#false} is VALID [2018-11-14 18:57:20,265 INFO L273 TraceCheckUtils]: 164: Hoare triple {20517#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {20517#false} is VALID [2018-11-14 18:57:20,265 INFO L256 TraceCheckUtils]: 165: Hoare triple {20517#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {20517#false} is VALID [2018-11-14 18:57:20,265 INFO L273 TraceCheckUtils]: 166: Hoare triple {20517#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {20517#false} is VALID [2018-11-14 18:57:20,265 INFO L273 TraceCheckUtils]: 167: Hoare triple {20517#false} assume true; {20517#false} is VALID [2018-11-14 18:57:20,265 INFO L273 TraceCheckUtils]: 168: Hoare triple {20517#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20517#false} is VALID [2018-11-14 18:57:20,266 INFO L273 TraceCheckUtils]: 169: Hoare triple {20517#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20517#false} is VALID [2018-11-14 18:57:20,266 INFO L273 TraceCheckUtils]: 170: Hoare triple {20517#false} assume true; {20517#false} is VALID [2018-11-14 18:57:20,266 INFO L273 TraceCheckUtils]: 171: Hoare triple {20517#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20517#false} is VALID [2018-11-14 18:57:20,266 INFO L273 TraceCheckUtils]: 172: Hoare triple {20517#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20517#false} is VALID [2018-11-14 18:57:20,266 INFO L273 TraceCheckUtils]: 173: Hoare triple {20517#false} assume true; {20517#false} is VALID [2018-11-14 18:57:20,266 INFO L273 TraceCheckUtils]: 174: Hoare triple {20517#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20517#false} is VALID [2018-11-14 18:57:20,267 INFO L273 TraceCheckUtils]: 175: Hoare triple {20517#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20517#false} is VALID [2018-11-14 18:57:20,267 INFO L273 TraceCheckUtils]: 176: Hoare triple {20517#false} assume true; {20517#false} is VALID [2018-11-14 18:57:20,267 INFO L273 TraceCheckUtils]: 177: Hoare triple {20517#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20517#false} is VALID [2018-11-14 18:57:20,267 INFO L273 TraceCheckUtils]: 178: Hoare triple {20517#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20517#false} is VALID [2018-11-14 18:57:20,267 INFO L273 TraceCheckUtils]: 179: Hoare triple {20517#false} assume true; {20517#false} is VALID [2018-11-14 18:57:20,267 INFO L273 TraceCheckUtils]: 180: Hoare triple {20517#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20517#false} is VALID [2018-11-14 18:57:20,268 INFO L273 TraceCheckUtils]: 181: Hoare triple {20517#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20517#false} is VALID [2018-11-14 18:57:20,268 INFO L273 TraceCheckUtils]: 182: Hoare triple {20517#false} assume true; {20517#false} is VALID [2018-11-14 18:57:20,268 INFO L273 TraceCheckUtils]: 183: Hoare triple {20517#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20517#false} is VALID [2018-11-14 18:57:20,268 INFO L273 TraceCheckUtils]: 184: Hoare triple {20517#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20517#false} is VALID [2018-11-14 18:57:20,268 INFO L273 TraceCheckUtils]: 185: Hoare triple {20517#false} assume true; {20517#false} is VALID [2018-11-14 18:57:20,268 INFO L273 TraceCheckUtils]: 186: Hoare triple {20517#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20517#false} is VALID [2018-11-14 18:57:20,268 INFO L273 TraceCheckUtils]: 187: Hoare triple {20517#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20517#false} is VALID [2018-11-14 18:57:20,268 INFO L273 TraceCheckUtils]: 188: Hoare triple {20517#false} assume true; {20517#false} is VALID [2018-11-14 18:57:20,268 INFO L273 TraceCheckUtils]: 189: Hoare triple {20517#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20517#false} is VALID [2018-11-14 18:57:20,268 INFO L273 TraceCheckUtils]: 190: Hoare triple {20517#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20517#false} is VALID [2018-11-14 18:57:20,269 INFO L273 TraceCheckUtils]: 191: Hoare triple {20517#false} assume true; {20517#false} is VALID [2018-11-14 18:57:20,269 INFO L273 TraceCheckUtils]: 192: Hoare triple {20517#false} assume !(~i~0 < 100000); {20517#false} is VALID [2018-11-14 18:57:20,269 INFO L273 TraceCheckUtils]: 193: Hoare triple {20517#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {20517#false} is VALID [2018-11-14 18:57:20,269 INFO L273 TraceCheckUtils]: 194: Hoare triple {20517#false} assume true; {20517#false} is VALID [2018-11-14 18:57:20,269 INFO L268 TraceCheckUtils]: 195: Hoare quadruple {20517#false} {20517#false} #77#return; {20517#false} is VALID [2018-11-14 18:57:20,269 INFO L273 TraceCheckUtils]: 196: Hoare triple {20517#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {20517#false} is VALID [2018-11-14 18:57:20,269 INFO L273 TraceCheckUtils]: 197: Hoare triple {20517#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {20517#false} is VALID [2018-11-14 18:57:20,269 INFO L273 TraceCheckUtils]: 198: Hoare triple {20517#false} assume !false; {20517#false} is VALID [2018-11-14 18:57:20,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1923 backedges. 460 proven. 57 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2018-11-14 18:57:20,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:57:20,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 9] total 34 [2018-11-14 18:57:20,305 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 199 [2018-11-14 18:57:20,305 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:57:20,305 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-14 18:57:20,435 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:57:20,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-14 18:57:20,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-14 18:57:20,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=736, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 18:57:20,436 INFO L87 Difference]: Start difference. First operand 140 states and 144 transitions. Second operand 34 states. [2018-11-14 18:57:21,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:57:21,401 INFO L93 Difference]: Finished difference Result 208 states and 217 transitions. [2018-11-14 18:57:21,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-14 18:57:21,401 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 199 [2018-11-14 18:57:21,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:57:21,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 18:57:21,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 154 transitions. [2018-11-14 18:57:21,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 18:57:21,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 154 transitions. [2018-11-14 18:57:21,403 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 154 transitions. [2018-11-14 18:57:21,542 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-14 18:57:21,545 INFO L225 Difference]: With dead ends: 208 [2018-11-14 18:57:21,545 INFO L226 Difference]: Without dead ends: 148 [2018-11-14 18:57:21,546 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=386, Invalid=736, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 18:57:21,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-14 18:57:21,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2018-11-14 18:57:21,583 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:57:21,583 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand 146 states. [2018-11-14 18:57:21,583 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand 146 states. [2018-11-14 18:57:21,584 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 146 states. [2018-11-14 18:57:21,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:57:21,586 INFO L93 Difference]: Finished difference Result 148 states and 152 transitions. [2018-11-14 18:57:21,586 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 152 transitions. [2018-11-14 18:57:21,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:57:21,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:57:21,587 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 148 states. [2018-11-14 18:57:21,587 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 148 states. [2018-11-14 18:57:21,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:57:21,590 INFO L93 Difference]: Finished difference Result 148 states and 152 transitions. [2018-11-14 18:57:21,590 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 152 transitions. [2018-11-14 18:57:21,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:57:21,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:57:21,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:57:21,591 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:57:21,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-14 18:57:21,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 150 transitions. [2018-11-14 18:57:21,593 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 150 transitions. Word has length 199 [2018-11-14 18:57:21,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:57:21,593 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 150 transitions. [2018-11-14 18:57:21,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-14 18:57:21,594 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 150 transitions. [2018-11-14 18:57:21,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-11-14 18:57:21,595 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:57:21,595 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 25, 25, 24, 24, 8, 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-14 18:57:21,595 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:57:21,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:57:21,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1744944792, now seen corresponding path program 25 times [2018-11-14 18:57:21,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:57:21,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:57:21,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:57:21,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:57:21,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:57:21,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:57:22,393 INFO L256 TraceCheckUtils]: 0: Hoare triple {21918#true} call ULTIMATE.init(); {21918#true} is VALID [2018-11-14 18:57:22,393 INFO L273 TraceCheckUtils]: 1: Hoare triple {21918#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21918#true} is VALID [2018-11-14 18:57:22,393 INFO L273 TraceCheckUtils]: 2: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 18:57:22,393 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21918#true} {21918#true} #69#return; {21918#true} is VALID [2018-11-14 18:57:22,394 INFO L256 TraceCheckUtils]: 4: Hoare triple {21918#true} call #t~ret13 := main(); {21918#true} is VALID [2018-11-14 18:57:22,394 INFO L273 TraceCheckUtils]: 5: Hoare triple {21918#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; {21920#(= main_~i~1 0)} is VALID [2018-11-14 18:57:22,395 INFO L273 TraceCheckUtils]: 6: Hoare triple {21920#(= main_~i~1 0)} assume true; {21920#(= main_~i~1 0)} is VALID [2018-11-14 18:57:22,395 INFO L273 TraceCheckUtils]: 7: Hoare triple {21920#(= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {21920#(= main_~i~1 0)} is VALID [2018-11-14 18:57:22,395 INFO L273 TraceCheckUtils]: 8: Hoare triple {21920#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21921#(<= main_~i~1 1)} is VALID [2018-11-14 18:57:22,396 INFO L273 TraceCheckUtils]: 9: Hoare triple {21921#(<= main_~i~1 1)} assume true; {21921#(<= main_~i~1 1)} is VALID [2018-11-14 18:57:22,396 INFO L273 TraceCheckUtils]: 10: Hoare triple {21921#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {21921#(<= main_~i~1 1)} is VALID [2018-11-14 18:57:22,396 INFO L273 TraceCheckUtils]: 11: Hoare triple {21921#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21922#(<= main_~i~1 2)} is VALID [2018-11-14 18:57:22,397 INFO L273 TraceCheckUtils]: 12: Hoare triple {21922#(<= main_~i~1 2)} assume true; {21922#(<= main_~i~1 2)} is VALID [2018-11-14 18:57:22,397 INFO L273 TraceCheckUtils]: 13: Hoare triple {21922#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {21922#(<= main_~i~1 2)} is VALID [2018-11-14 18:57:22,398 INFO L273 TraceCheckUtils]: 14: Hoare triple {21922#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21923#(<= main_~i~1 3)} is VALID [2018-11-14 18:57:22,398 INFO L273 TraceCheckUtils]: 15: Hoare triple {21923#(<= main_~i~1 3)} assume true; {21923#(<= main_~i~1 3)} is VALID [2018-11-14 18:57:22,399 INFO L273 TraceCheckUtils]: 16: Hoare triple {21923#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {21923#(<= main_~i~1 3)} is VALID [2018-11-14 18:57:22,400 INFO L273 TraceCheckUtils]: 17: Hoare triple {21923#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21924#(<= main_~i~1 4)} is VALID [2018-11-14 18:57:22,400 INFO L273 TraceCheckUtils]: 18: Hoare triple {21924#(<= main_~i~1 4)} assume true; {21924#(<= main_~i~1 4)} is VALID [2018-11-14 18:57:22,401 INFO L273 TraceCheckUtils]: 19: Hoare triple {21924#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {21924#(<= main_~i~1 4)} is VALID [2018-11-14 18:57:22,401 INFO L273 TraceCheckUtils]: 20: Hoare triple {21924#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21925#(<= main_~i~1 5)} is VALID [2018-11-14 18:57:22,402 INFO L273 TraceCheckUtils]: 21: Hoare triple {21925#(<= main_~i~1 5)} assume true; {21925#(<= main_~i~1 5)} is VALID [2018-11-14 18:57:22,402 INFO L273 TraceCheckUtils]: 22: Hoare triple {21925#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {21925#(<= main_~i~1 5)} is VALID [2018-11-14 18:57:22,403 INFO L273 TraceCheckUtils]: 23: Hoare triple {21925#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21926#(<= main_~i~1 6)} is VALID [2018-11-14 18:57:22,403 INFO L273 TraceCheckUtils]: 24: Hoare triple {21926#(<= main_~i~1 6)} assume true; {21926#(<= main_~i~1 6)} is VALID [2018-11-14 18:57:22,404 INFO L273 TraceCheckUtils]: 25: Hoare triple {21926#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {21926#(<= main_~i~1 6)} is VALID [2018-11-14 18:57:22,404 INFO L273 TraceCheckUtils]: 26: Hoare triple {21926#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21927#(<= main_~i~1 7)} is VALID [2018-11-14 18:57:22,405 INFO L273 TraceCheckUtils]: 27: Hoare triple {21927#(<= main_~i~1 7)} assume true; {21927#(<= main_~i~1 7)} is VALID [2018-11-14 18:57:22,405 INFO L273 TraceCheckUtils]: 28: Hoare triple {21927#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {21927#(<= main_~i~1 7)} is VALID [2018-11-14 18:57:22,406 INFO L273 TraceCheckUtils]: 29: Hoare triple {21927#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21928#(<= main_~i~1 8)} is VALID [2018-11-14 18:57:22,407 INFO L273 TraceCheckUtils]: 30: Hoare triple {21928#(<= main_~i~1 8)} assume true; {21928#(<= main_~i~1 8)} is VALID [2018-11-14 18:57:22,407 INFO L273 TraceCheckUtils]: 31: Hoare triple {21928#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {21928#(<= main_~i~1 8)} is VALID [2018-11-14 18:57:22,408 INFO L273 TraceCheckUtils]: 32: Hoare triple {21928#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21929#(<= main_~i~1 9)} is VALID [2018-11-14 18:57:22,408 INFO L273 TraceCheckUtils]: 33: Hoare triple {21929#(<= main_~i~1 9)} assume true; {21929#(<= main_~i~1 9)} is VALID [2018-11-14 18:57:22,409 INFO L273 TraceCheckUtils]: 34: Hoare triple {21929#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {21929#(<= main_~i~1 9)} is VALID [2018-11-14 18:57:22,409 INFO L273 TraceCheckUtils]: 35: Hoare triple {21929#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21930#(<= main_~i~1 10)} is VALID [2018-11-14 18:57:22,410 INFO L273 TraceCheckUtils]: 36: Hoare triple {21930#(<= main_~i~1 10)} assume true; {21930#(<= main_~i~1 10)} is VALID [2018-11-14 18:57:22,410 INFO L273 TraceCheckUtils]: 37: Hoare triple {21930#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {21930#(<= main_~i~1 10)} is VALID [2018-11-14 18:57:22,411 INFO L273 TraceCheckUtils]: 38: Hoare triple {21930#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21931#(<= main_~i~1 11)} is VALID [2018-11-14 18:57:22,411 INFO L273 TraceCheckUtils]: 39: Hoare triple {21931#(<= main_~i~1 11)} assume true; {21931#(<= main_~i~1 11)} is VALID [2018-11-14 18:57:22,412 INFO L273 TraceCheckUtils]: 40: Hoare triple {21931#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {21931#(<= main_~i~1 11)} is VALID [2018-11-14 18:57:22,413 INFO L273 TraceCheckUtils]: 41: Hoare triple {21931#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21932#(<= main_~i~1 12)} is VALID [2018-11-14 18:57:22,413 INFO L273 TraceCheckUtils]: 42: Hoare triple {21932#(<= main_~i~1 12)} assume true; {21932#(<= main_~i~1 12)} is VALID [2018-11-14 18:57:22,413 INFO L273 TraceCheckUtils]: 43: Hoare triple {21932#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {21932#(<= main_~i~1 12)} is VALID [2018-11-14 18:57:22,414 INFO L273 TraceCheckUtils]: 44: Hoare triple {21932#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21933#(<= main_~i~1 13)} is VALID [2018-11-14 18:57:22,415 INFO L273 TraceCheckUtils]: 45: Hoare triple {21933#(<= main_~i~1 13)} assume true; {21933#(<= main_~i~1 13)} is VALID [2018-11-14 18:57:22,415 INFO L273 TraceCheckUtils]: 46: Hoare triple {21933#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {21933#(<= main_~i~1 13)} is VALID [2018-11-14 18:57:22,416 INFO L273 TraceCheckUtils]: 47: Hoare triple {21933#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21934#(<= main_~i~1 14)} is VALID [2018-11-14 18:57:22,416 INFO L273 TraceCheckUtils]: 48: Hoare triple {21934#(<= main_~i~1 14)} assume true; {21934#(<= main_~i~1 14)} is VALID [2018-11-14 18:57:22,417 INFO L273 TraceCheckUtils]: 49: Hoare triple {21934#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {21934#(<= main_~i~1 14)} is VALID [2018-11-14 18:57:22,417 INFO L273 TraceCheckUtils]: 50: Hoare triple {21934#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21935#(<= main_~i~1 15)} is VALID [2018-11-14 18:57:22,418 INFO L273 TraceCheckUtils]: 51: Hoare triple {21935#(<= main_~i~1 15)} assume true; {21935#(<= main_~i~1 15)} is VALID [2018-11-14 18:57:22,418 INFO L273 TraceCheckUtils]: 52: Hoare triple {21935#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {21935#(<= main_~i~1 15)} is VALID [2018-11-14 18:57:22,419 INFO L273 TraceCheckUtils]: 53: Hoare triple {21935#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21936#(<= main_~i~1 16)} is VALID [2018-11-14 18:57:22,419 INFO L273 TraceCheckUtils]: 54: Hoare triple {21936#(<= main_~i~1 16)} assume true; {21936#(<= main_~i~1 16)} is VALID [2018-11-14 18:57:22,420 INFO L273 TraceCheckUtils]: 55: Hoare triple {21936#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {21936#(<= main_~i~1 16)} is VALID [2018-11-14 18:57:22,421 INFO L273 TraceCheckUtils]: 56: Hoare triple {21936#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21937#(<= main_~i~1 17)} is VALID [2018-11-14 18:57:22,421 INFO L273 TraceCheckUtils]: 57: Hoare triple {21937#(<= main_~i~1 17)} assume true; {21937#(<= main_~i~1 17)} is VALID [2018-11-14 18:57:22,422 INFO L273 TraceCheckUtils]: 58: Hoare triple {21937#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {21937#(<= main_~i~1 17)} is VALID [2018-11-14 18:57:22,422 INFO L273 TraceCheckUtils]: 59: Hoare triple {21937#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21938#(<= main_~i~1 18)} is VALID [2018-11-14 18:57:22,423 INFO L273 TraceCheckUtils]: 60: Hoare triple {21938#(<= main_~i~1 18)} assume true; {21938#(<= main_~i~1 18)} is VALID [2018-11-14 18:57:22,423 INFO L273 TraceCheckUtils]: 61: Hoare triple {21938#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {21938#(<= main_~i~1 18)} is VALID [2018-11-14 18:57:22,424 INFO L273 TraceCheckUtils]: 62: Hoare triple {21938#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21939#(<= main_~i~1 19)} is VALID [2018-11-14 18:57:22,424 INFO L273 TraceCheckUtils]: 63: Hoare triple {21939#(<= main_~i~1 19)} assume true; {21939#(<= main_~i~1 19)} is VALID [2018-11-14 18:57:22,425 INFO L273 TraceCheckUtils]: 64: Hoare triple {21939#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {21939#(<= main_~i~1 19)} is VALID [2018-11-14 18:57:22,425 INFO L273 TraceCheckUtils]: 65: Hoare triple {21939#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21940#(<= main_~i~1 20)} is VALID [2018-11-14 18:57:22,426 INFO L273 TraceCheckUtils]: 66: Hoare triple {21940#(<= main_~i~1 20)} assume true; {21940#(<= main_~i~1 20)} is VALID [2018-11-14 18:57:22,426 INFO L273 TraceCheckUtils]: 67: Hoare triple {21940#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {21940#(<= main_~i~1 20)} is VALID [2018-11-14 18:57:22,427 INFO L273 TraceCheckUtils]: 68: Hoare triple {21940#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21941#(<= main_~i~1 21)} is VALID [2018-11-14 18:57:22,428 INFO L273 TraceCheckUtils]: 69: Hoare triple {21941#(<= main_~i~1 21)} assume true; {21941#(<= main_~i~1 21)} is VALID [2018-11-14 18:57:22,428 INFO L273 TraceCheckUtils]: 70: Hoare triple {21941#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {21941#(<= main_~i~1 21)} is VALID [2018-11-14 18:57:22,429 INFO L273 TraceCheckUtils]: 71: Hoare triple {21941#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21942#(<= main_~i~1 22)} is VALID [2018-11-14 18:57:22,429 INFO L273 TraceCheckUtils]: 72: Hoare triple {21942#(<= main_~i~1 22)} assume true; {21942#(<= main_~i~1 22)} is VALID [2018-11-14 18:57:22,430 INFO L273 TraceCheckUtils]: 73: Hoare triple {21942#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {21942#(<= main_~i~1 22)} is VALID [2018-11-14 18:57:22,430 INFO L273 TraceCheckUtils]: 74: Hoare triple {21942#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21943#(<= main_~i~1 23)} is VALID [2018-11-14 18:57:22,431 INFO L273 TraceCheckUtils]: 75: Hoare triple {21943#(<= main_~i~1 23)} assume true; {21943#(<= main_~i~1 23)} is VALID [2018-11-14 18:57:22,431 INFO L273 TraceCheckUtils]: 76: Hoare triple {21943#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {21943#(<= main_~i~1 23)} is VALID [2018-11-14 18:57:22,432 INFO L273 TraceCheckUtils]: 77: Hoare triple {21943#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21944#(<= main_~i~1 24)} is VALID [2018-11-14 18:57:22,432 INFO L273 TraceCheckUtils]: 78: Hoare triple {21944#(<= main_~i~1 24)} assume true; {21944#(<= main_~i~1 24)} is VALID [2018-11-14 18:57:22,433 INFO L273 TraceCheckUtils]: 79: Hoare triple {21944#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {21944#(<= main_~i~1 24)} is VALID [2018-11-14 18:57:22,434 INFO L273 TraceCheckUtils]: 80: Hoare triple {21944#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21945#(<= main_~i~1 25)} is VALID [2018-11-14 18:57:22,434 INFO L273 TraceCheckUtils]: 81: Hoare triple {21945#(<= main_~i~1 25)} assume true; {21945#(<= main_~i~1 25)} is VALID [2018-11-14 18:57:22,435 INFO L273 TraceCheckUtils]: 82: Hoare triple {21945#(<= main_~i~1 25)} assume !(~i~1 < 100000); {21919#false} is VALID [2018-11-14 18:57:22,435 INFO L256 TraceCheckUtils]: 83: Hoare triple {21919#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {21918#true} is VALID [2018-11-14 18:57:22,435 INFO L273 TraceCheckUtils]: 84: Hoare triple {21918#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {21918#true} is VALID [2018-11-14 18:57:22,435 INFO L273 TraceCheckUtils]: 85: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 18:57:22,435 INFO L273 TraceCheckUtils]: 86: Hoare triple {21918#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 18:57:22,436 INFO L273 TraceCheckUtils]: 87: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 18:57:22,436 INFO L273 TraceCheckUtils]: 88: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 18:57:22,436 INFO L273 TraceCheckUtils]: 89: Hoare triple {21918#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 18:57:22,436 INFO L273 TraceCheckUtils]: 90: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 18:57:22,436 INFO L273 TraceCheckUtils]: 91: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 18:57:22,436 INFO L273 TraceCheckUtils]: 92: Hoare triple {21918#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 18:57:22,437 INFO L273 TraceCheckUtils]: 93: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 18:57:22,437 INFO L273 TraceCheckUtils]: 94: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 18:57:22,437 INFO L273 TraceCheckUtils]: 95: Hoare triple {21918#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 18:57:22,437 INFO L273 TraceCheckUtils]: 96: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 18:57:22,437 INFO L273 TraceCheckUtils]: 97: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 18:57:22,437 INFO L273 TraceCheckUtils]: 98: Hoare triple {21918#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 18:57:22,438 INFO L273 TraceCheckUtils]: 99: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 18:57:22,438 INFO L273 TraceCheckUtils]: 100: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 18:57:22,438 INFO L273 TraceCheckUtils]: 101: Hoare triple {21918#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 18:57:22,438 INFO L273 TraceCheckUtils]: 102: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 18:57:22,438 INFO L273 TraceCheckUtils]: 103: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 18:57:22,438 INFO L273 TraceCheckUtils]: 104: Hoare triple {21918#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 18:57:22,438 INFO L273 TraceCheckUtils]: 105: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 18:57:22,438 INFO L273 TraceCheckUtils]: 106: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 18:57:22,438 INFO L273 TraceCheckUtils]: 107: Hoare triple {21918#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 18:57:22,439 INFO L273 TraceCheckUtils]: 108: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 18:57:22,439 INFO L273 TraceCheckUtils]: 109: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 18:57:22,439 INFO L273 TraceCheckUtils]: 110: Hoare triple {21918#true} assume !(~i~0 < 100000); {21918#true} is VALID [2018-11-14 18:57:22,439 INFO L273 TraceCheckUtils]: 111: Hoare triple {21918#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {21918#true} is VALID [2018-11-14 18:57:22,439 INFO L273 TraceCheckUtils]: 112: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 18:57:22,439 INFO L268 TraceCheckUtils]: 113: Hoare quadruple {21918#true} {21919#false} #73#return; {21919#false} is VALID [2018-11-14 18:57:22,439 INFO L273 TraceCheckUtils]: 114: Hoare triple {21919#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {21919#false} is VALID [2018-11-14 18:57:22,439 INFO L256 TraceCheckUtils]: 115: Hoare triple {21919#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {21918#true} is VALID [2018-11-14 18:57:22,439 INFO L273 TraceCheckUtils]: 116: Hoare triple {21918#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {21918#true} is VALID [2018-11-14 18:57:22,439 INFO L273 TraceCheckUtils]: 117: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 18:57:22,440 INFO L273 TraceCheckUtils]: 118: Hoare triple {21918#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 18:57:22,440 INFO L273 TraceCheckUtils]: 119: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 18:57:22,440 INFO L273 TraceCheckUtils]: 120: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 18:57:22,440 INFO L273 TraceCheckUtils]: 121: Hoare triple {21918#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 18:57:22,440 INFO L273 TraceCheckUtils]: 122: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 18:57:22,440 INFO L273 TraceCheckUtils]: 123: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 18:57:22,440 INFO L273 TraceCheckUtils]: 124: Hoare triple {21918#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 18:57:22,440 INFO L273 TraceCheckUtils]: 125: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 18:57:22,440 INFO L273 TraceCheckUtils]: 126: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 18:57:22,441 INFO L273 TraceCheckUtils]: 127: Hoare triple {21918#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 18:57:22,441 INFO L273 TraceCheckUtils]: 128: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 18:57:22,441 INFO L273 TraceCheckUtils]: 129: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 18:57:22,441 INFO L273 TraceCheckUtils]: 130: Hoare triple {21918#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 18:57:22,441 INFO L273 TraceCheckUtils]: 131: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 18:57:22,441 INFO L273 TraceCheckUtils]: 132: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 18:57:22,441 INFO L273 TraceCheckUtils]: 133: Hoare triple {21918#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 18:57:22,441 INFO L273 TraceCheckUtils]: 134: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 18:57:22,441 INFO L273 TraceCheckUtils]: 135: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 18:57:22,441 INFO L273 TraceCheckUtils]: 136: Hoare triple {21918#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 18:57:22,442 INFO L273 TraceCheckUtils]: 137: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 18:57:22,442 INFO L273 TraceCheckUtils]: 138: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 18:57:22,442 INFO L273 TraceCheckUtils]: 139: Hoare triple {21918#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 18:57:22,442 INFO L273 TraceCheckUtils]: 140: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 18:57:22,442 INFO L273 TraceCheckUtils]: 141: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 18:57:22,442 INFO L273 TraceCheckUtils]: 142: Hoare triple {21918#true} assume !(~i~0 < 100000); {21918#true} is VALID [2018-11-14 18:57:22,442 INFO L273 TraceCheckUtils]: 143: Hoare triple {21918#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {21918#true} is VALID [2018-11-14 18:57:22,442 INFO L273 TraceCheckUtils]: 144: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 18:57:22,442 INFO L268 TraceCheckUtils]: 145: Hoare quadruple {21918#true} {21919#false} #75#return; {21919#false} is VALID [2018-11-14 18:57:22,443 INFO L273 TraceCheckUtils]: 146: Hoare triple {21919#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {21919#false} is VALID [2018-11-14 18:57:22,443 INFO L273 TraceCheckUtils]: 147: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 18:57:22,443 INFO L273 TraceCheckUtils]: 148: Hoare triple {21919#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21919#false} is VALID [2018-11-14 18:57:22,443 INFO L273 TraceCheckUtils]: 149: Hoare triple {21919#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21919#false} is VALID [2018-11-14 18:57:22,443 INFO L273 TraceCheckUtils]: 150: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 18:57:22,443 INFO L273 TraceCheckUtils]: 151: Hoare triple {21919#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21919#false} is VALID [2018-11-14 18:57:22,443 INFO L273 TraceCheckUtils]: 152: Hoare triple {21919#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21919#false} is VALID [2018-11-14 18:57:22,443 INFO L273 TraceCheckUtils]: 153: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 18:57:22,443 INFO L273 TraceCheckUtils]: 154: Hoare triple {21919#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21919#false} is VALID [2018-11-14 18:57:22,443 INFO L273 TraceCheckUtils]: 155: Hoare triple {21919#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21919#false} is VALID [2018-11-14 18:57:22,444 INFO L273 TraceCheckUtils]: 156: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 18:57:22,444 INFO L273 TraceCheckUtils]: 157: Hoare triple {21919#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21919#false} is VALID [2018-11-14 18:57:22,444 INFO L273 TraceCheckUtils]: 158: Hoare triple {21919#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21919#false} is VALID [2018-11-14 18:57:22,444 INFO L273 TraceCheckUtils]: 159: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 18:57:22,444 INFO L273 TraceCheckUtils]: 160: Hoare triple {21919#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21919#false} is VALID [2018-11-14 18:57:22,444 INFO L273 TraceCheckUtils]: 161: Hoare triple {21919#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21919#false} is VALID [2018-11-14 18:57:22,444 INFO L273 TraceCheckUtils]: 162: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 18:57:22,444 INFO L273 TraceCheckUtils]: 163: Hoare triple {21919#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21919#false} is VALID [2018-11-14 18:57:22,444 INFO L273 TraceCheckUtils]: 164: Hoare triple {21919#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21919#false} is VALID [2018-11-14 18:57:22,444 INFO L273 TraceCheckUtils]: 165: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 18:57:22,445 INFO L273 TraceCheckUtils]: 166: Hoare triple {21919#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21919#false} is VALID [2018-11-14 18:57:22,445 INFO L273 TraceCheckUtils]: 167: Hoare triple {21919#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21919#false} is VALID [2018-11-14 18:57:22,445 INFO L273 TraceCheckUtils]: 168: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 18:57:22,445 INFO L273 TraceCheckUtils]: 169: Hoare triple {21919#false} assume !(~i~2 < 99999); {21919#false} is VALID [2018-11-14 18:57:22,445 INFO L273 TraceCheckUtils]: 170: Hoare triple {21919#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {21919#false} is VALID [2018-11-14 18:57:22,445 INFO L256 TraceCheckUtils]: 171: Hoare triple {21919#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {21918#true} is VALID [2018-11-14 18:57:22,445 INFO L273 TraceCheckUtils]: 172: Hoare triple {21918#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {21918#true} is VALID [2018-11-14 18:57:22,445 INFO L273 TraceCheckUtils]: 173: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 18:57:22,445 INFO L273 TraceCheckUtils]: 174: Hoare triple {21918#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 18:57:22,445 INFO L273 TraceCheckUtils]: 175: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 18:57:22,446 INFO L273 TraceCheckUtils]: 176: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 18:57:22,446 INFO L273 TraceCheckUtils]: 177: Hoare triple {21918#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 18:57:22,446 INFO L273 TraceCheckUtils]: 178: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 18:57:22,446 INFO L273 TraceCheckUtils]: 179: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 18:57:22,446 INFO L273 TraceCheckUtils]: 180: Hoare triple {21918#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 18:57:22,446 INFO L273 TraceCheckUtils]: 181: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 18:57:22,446 INFO L273 TraceCheckUtils]: 182: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 18:57:22,446 INFO L273 TraceCheckUtils]: 183: Hoare triple {21918#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 18:57:22,446 INFO L273 TraceCheckUtils]: 184: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 18:57:22,447 INFO L273 TraceCheckUtils]: 185: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 18:57:22,447 INFO L273 TraceCheckUtils]: 186: Hoare triple {21918#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 18:57:22,447 INFO L273 TraceCheckUtils]: 187: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 18:57:22,447 INFO L273 TraceCheckUtils]: 188: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 18:57:22,447 INFO L273 TraceCheckUtils]: 189: Hoare triple {21918#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 18:57:22,447 INFO L273 TraceCheckUtils]: 190: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 18:57:22,447 INFO L273 TraceCheckUtils]: 191: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 18:57:22,447 INFO L273 TraceCheckUtils]: 192: Hoare triple {21918#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 18:57:22,447 INFO L273 TraceCheckUtils]: 193: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 18:57:22,447 INFO L273 TraceCheckUtils]: 194: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 18:57:22,448 INFO L273 TraceCheckUtils]: 195: Hoare triple {21918#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21918#true} is VALID [2018-11-14 18:57:22,448 INFO L273 TraceCheckUtils]: 196: Hoare triple {21918#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21918#true} is VALID [2018-11-14 18:57:22,448 INFO L273 TraceCheckUtils]: 197: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 18:57:22,448 INFO L273 TraceCheckUtils]: 198: Hoare triple {21918#true} assume !(~i~0 < 100000); {21918#true} is VALID [2018-11-14 18:57:22,448 INFO L273 TraceCheckUtils]: 199: Hoare triple {21918#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {21918#true} is VALID [2018-11-14 18:57:22,448 INFO L273 TraceCheckUtils]: 200: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 18:57:22,448 INFO L268 TraceCheckUtils]: 201: Hoare quadruple {21918#true} {21919#false} #77#return; {21919#false} is VALID [2018-11-14 18:57:22,448 INFO L273 TraceCheckUtils]: 202: Hoare triple {21919#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {21919#false} is VALID [2018-11-14 18:57:22,448 INFO L273 TraceCheckUtils]: 203: Hoare triple {21919#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {21919#false} is VALID [2018-11-14 18:57:22,448 INFO L273 TraceCheckUtils]: 204: Hoare triple {21919#false} assume !false; {21919#false} is VALID [2018-11-14 18:57:22,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2017 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2018-11-14 18:57:22,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:57:22,467 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-14 18:57:22,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:57:22,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:57:22,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:57:22,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:57:22,970 INFO L256 TraceCheckUtils]: 0: Hoare triple {21918#true} call ULTIMATE.init(); {21918#true} is VALID [2018-11-14 18:57:22,970 INFO L273 TraceCheckUtils]: 1: Hoare triple {21918#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21918#true} is VALID [2018-11-14 18:57:22,970 INFO L273 TraceCheckUtils]: 2: Hoare triple {21918#true} assume true; {21918#true} is VALID [2018-11-14 18:57:22,971 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21918#true} {21918#true} #69#return; {21918#true} is VALID [2018-11-14 18:57:22,971 INFO L256 TraceCheckUtils]: 4: Hoare triple {21918#true} call #t~ret13 := main(); {21918#true} is VALID [2018-11-14 18:57:22,972 INFO L273 TraceCheckUtils]: 5: Hoare triple {21918#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; {21964#(<= main_~i~1 0)} is VALID [2018-11-14 18:57:22,972 INFO L273 TraceCheckUtils]: 6: Hoare triple {21964#(<= main_~i~1 0)} assume true; {21964#(<= main_~i~1 0)} is VALID [2018-11-14 18:57:22,972 INFO L273 TraceCheckUtils]: 7: Hoare triple {21964#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {21964#(<= main_~i~1 0)} is VALID [2018-11-14 18:57:22,973 INFO L273 TraceCheckUtils]: 8: Hoare triple {21964#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21921#(<= main_~i~1 1)} is VALID [2018-11-14 18:57:22,973 INFO L273 TraceCheckUtils]: 9: Hoare triple {21921#(<= main_~i~1 1)} assume true; {21921#(<= main_~i~1 1)} is VALID [2018-11-14 18:57:22,974 INFO L273 TraceCheckUtils]: 10: Hoare triple {21921#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {21921#(<= main_~i~1 1)} is VALID [2018-11-14 18:57:22,974 INFO L273 TraceCheckUtils]: 11: Hoare triple {21921#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21922#(<= main_~i~1 2)} is VALID [2018-11-14 18:57:22,974 INFO L273 TraceCheckUtils]: 12: Hoare triple {21922#(<= main_~i~1 2)} assume true; {21922#(<= main_~i~1 2)} is VALID [2018-11-14 18:57:22,975 INFO L273 TraceCheckUtils]: 13: Hoare triple {21922#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {21922#(<= main_~i~1 2)} is VALID [2018-11-14 18:57:22,975 INFO L273 TraceCheckUtils]: 14: Hoare triple {21922#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21923#(<= main_~i~1 3)} is VALID [2018-11-14 18:57:22,976 INFO L273 TraceCheckUtils]: 15: Hoare triple {21923#(<= main_~i~1 3)} assume true; {21923#(<= main_~i~1 3)} is VALID [2018-11-14 18:57:22,976 INFO L273 TraceCheckUtils]: 16: Hoare triple {21923#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {21923#(<= main_~i~1 3)} is VALID [2018-11-14 18:57:22,977 INFO L273 TraceCheckUtils]: 17: Hoare triple {21923#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21924#(<= main_~i~1 4)} is VALID [2018-11-14 18:57:22,978 INFO L273 TraceCheckUtils]: 18: Hoare triple {21924#(<= main_~i~1 4)} assume true; {21924#(<= main_~i~1 4)} is VALID [2018-11-14 18:57:22,978 INFO L273 TraceCheckUtils]: 19: Hoare triple {21924#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {21924#(<= main_~i~1 4)} is VALID [2018-11-14 18:57:22,979 INFO L273 TraceCheckUtils]: 20: Hoare triple {21924#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21925#(<= main_~i~1 5)} is VALID [2018-11-14 18:57:22,979 INFO L273 TraceCheckUtils]: 21: Hoare triple {21925#(<= main_~i~1 5)} assume true; {21925#(<= main_~i~1 5)} is VALID [2018-11-14 18:57:22,980 INFO L273 TraceCheckUtils]: 22: Hoare triple {21925#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {21925#(<= main_~i~1 5)} is VALID [2018-11-14 18:57:22,980 INFO L273 TraceCheckUtils]: 23: Hoare triple {21925#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21926#(<= main_~i~1 6)} is VALID [2018-11-14 18:57:22,981 INFO L273 TraceCheckUtils]: 24: Hoare triple {21926#(<= main_~i~1 6)} assume true; {21926#(<= main_~i~1 6)} is VALID [2018-11-14 18:57:22,981 INFO L273 TraceCheckUtils]: 25: Hoare triple {21926#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {21926#(<= main_~i~1 6)} is VALID [2018-11-14 18:57:22,982 INFO L273 TraceCheckUtils]: 26: Hoare triple {21926#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21927#(<= main_~i~1 7)} is VALID [2018-11-14 18:57:22,982 INFO L273 TraceCheckUtils]: 27: Hoare triple {21927#(<= main_~i~1 7)} assume true; {21927#(<= main_~i~1 7)} is VALID [2018-11-14 18:57:22,983 INFO L273 TraceCheckUtils]: 28: Hoare triple {21927#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {21927#(<= main_~i~1 7)} is VALID [2018-11-14 18:57:22,984 INFO L273 TraceCheckUtils]: 29: Hoare triple {21927#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21928#(<= main_~i~1 8)} is VALID [2018-11-14 18:57:22,984 INFO L273 TraceCheckUtils]: 30: Hoare triple {21928#(<= main_~i~1 8)} assume true; {21928#(<= main_~i~1 8)} is VALID [2018-11-14 18:57:22,984 INFO L273 TraceCheckUtils]: 31: Hoare triple {21928#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {21928#(<= main_~i~1 8)} is VALID [2018-11-14 18:57:22,985 INFO L273 TraceCheckUtils]: 32: Hoare triple {21928#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21929#(<= main_~i~1 9)} is VALID [2018-11-14 18:57:22,986 INFO L273 TraceCheckUtils]: 33: Hoare triple {21929#(<= main_~i~1 9)} assume true; {21929#(<= main_~i~1 9)} is VALID [2018-11-14 18:57:22,986 INFO L273 TraceCheckUtils]: 34: Hoare triple {21929#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {21929#(<= main_~i~1 9)} is VALID [2018-11-14 18:57:22,987 INFO L273 TraceCheckUtils]: 35: Hoare triple {21929#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21930#(<= main_~i~1 10)} is VALID [2018-11-14 18:57:22,987 INFO L273 TraceCheckUtils]: 36: Hoare triple {21930#(<= main_~i~1 10)} assume true; {21930#(<= main_~i~1 10)} is VALID [2018-11-14 18:57:22,988 INFO L273 TraceCheckUtils]: 37: Hoare triple {21930#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {21930#(<= main_~i~1 10)} is VALID [2018-11-14 18:57:22,988 INFO L273 TraceCheckUtils]: 38: Hoare triple {21930#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21931#(<= main_~i~1 11)} is VALID [2018-11-14 18:57:22,989 INFO L273 TraceCheckUtils]: 39: Hoare triple {21931#(<= main_~i~1 11)} assume true; {21931#(<= main_~i~1 11)} is VALID [2018-11-14 18:57:22,989 INFO L273 TraceCheckUtils]: 40: Hoare triple {21931#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {21931#(<= main_~i~1 11)} is VALID [2018-11-14 18:57:22,990 INFO L273 TraceCheckUtils]: 41: Hoare triple {21931#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21932#(<= main_~i~1 12)} is VALID [2018-11-14 18:57:22,991 INFO L273 TraceCheckUtils]: 42: Hoare triple {21932#(<= main_~i~1 12)} assume true; {21932#(<= main_~i~1 12)} is VALID [2018-11-14 18:57:22,991 INFO L273 TraceCheckUtils]: 43: Hoare triple {21932#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {21932#(<= main_~i~1 12)} is VALID [2018-11-14 18:57:22,992 INFO L273 TraceCheckUtils]: 44: Hoare triple {21932#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21933#(<= main_~i~1 13)} is VALID [2018-11-14 18:57:22,992 INFO L273 TraceCheckUtils]: 45: Hoare triple {21933#(<= main_~i~1 13)} assume true; {21933#(<= main_~i~1 13)} is VALID [2018-11-14 18:57:22,993 INFO L273 TraceCheckUtils]: 46: Hoare triple {21933#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {21933#(<= main_~i~1 13)} is VALID [2018-11-14 18:57:22,993 INFO L273 TraceCheckUtils]: 47: Hoare triple {21933#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21934#(<= main_~i~1 14)} is VALID [2018-11-14 18:57:22,994 INFO L273 TraceCheckUtils]: 48: Hoare triple {21934#(<= main_~i~1 14)} assume true; {21934#(<= main_~i~1 14)} is VALID [2018-11-14 18:57:22,994 INFO L273 TraceCheckUtils]: 49: Hoare triple {21934#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {21934#(<= main_~i~1 14)} is VALID [2018-11-14 18:57:22,995 INFO L273 TraceCheckUtils]: 50: Hoare triple {21934#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21935#(<= main_~i~1 15)} is VALID [2018-11-14 18:57:22,996 INFO L273 TraceCheckUtils]: 51: Hoare triple {21935#(<= main_~i~1 15)} assume true; {21935#(<= main_~i~1 15)} is VALID [2018-11-14 18:57:22,996 INFO L273 TraceCheckUtils]: 52: Hoare triple {21935#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {21935#(<= main_~i~1 15)} is VALID [2018-11-14 18:57:22,997 INFO L273 TraceCheckUtils]: 53: Hoare triple {21935#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21936#(<= main_~i~1 16)} is VALID [2018-11-14 18:57:22,997 INFO L273 TraceCheckUtils]: 54: Hoare triple {21936#(<= main_~i~1 16)} assume true; {21936#(<= main_~i~1 16)} is VALID [2018-11-14 18:57:22,998 INFO L273 TraceCheckUtils]: 55: Hoare triple {21936#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {21936#(<= main_~i~1 16)} is VALID [2018-11-14 18:57:22,999 INFO L273 TraceCheckUtils]: 56: Hoare triple {21936#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21937#(<= main_~i~1 17)} is VALID [2018-11-14 18:57:22,999 INFO L273 TraceCheckUtils]: 57: Hoare triple {21937#(<= main_~i~1 17)} assume true; {21937#(<= main_~i~1 17)} is VALID [2018-11-14 18:57:23,000 INFO L273 TraceCheckUtils]: 58: Hoare triple {21937#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {21937#(<= main_~i~1 17)} is VALID [2018-11-14 18:57:23,012 INFO L273 TraceCheckUtils]: 59: Hoare triple {21937#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21938#(<= main_~i~1 18)} is VALID [2018-11-14 18:57:23,012 INFO L273 TraceCheckUtils]: 60: Hoare triple {21938#(<= main_~i~1 18)} assume true; {21938#(<= main_~i~1 18)} is VALID [2018-11-14 18:57:23,012 INFO L273 TraceCheckUtils]: 61: Hoare triple {21938#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {21938#(<= main_~i~1 18)} is VALID [2018-11-14 18:57:23,013 INFO L273 TraceCheckUtils]: 62: Hoare triple {21938#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21939#(<= main_~i~1 19)} is VALID [2018-11-14 18:57:23,013 INFO L273 TraceCheckUtils]: 63: Hoare triple {21939#(<= main_~i~1 19)} assume true; {21939#(<= main_~i~1 19)} is VALID [2018-11-14 18:57:23,014 INFO L273 TraceCheckUtils]: 64: Hoare triple {21939#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {21939#(<= main_~i~1 19)} is VALID [2018-11-14 18:57:23,014 INFO L273 TraceCheckUtils]: 65: Hoare triple {21939#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21940#(<= main_~i~1 20)} is VALID [2018-11-14 18:57:23,014 INFO L273 TraceCheckUtils]: 66: Hoare triple {21940#(<= main_~i~1 20)} assume true; {21940#(<= main_~i~1 20)} is VALID [2018-11-14 18:57:23,015 INFO L273 TraceCheckUtils]: 67: Hoare triple {21940#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {21940#(<= main_~i~1 20)} is VALID [2018-11-14 18:57:23,015 INFO L273 TraceCheckUtils]: 68: Hoare triple {21940#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21941#(<= main_~i~1 21)} is VALID [2018-11-14 18:57:23,015 INFO L273 TraceCheckUtils]: 69: Hoare triple {21941#(<= main_~i~1 21)} assume true; {21941#(<= main_~i~1 21)} is VALID [2018-11-14 18:57:23,016 INFO L273 TraceCheckUtils]: 70: Hoare triple {21941#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {21941#(<= main_~i~1 21)} is VALID [2018-11-14 18:57:23,016 INFO L273 TraceCheckUtils]: 71: Hoare triple {21941#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21942#(<= main_~i~1 22)} is VALID [2018-11-14 18:57:23,017 INFO L273 TraceCheckUtils]: 72: Hoare triple {21942#(<= main_~i~1 22)} assume true; {21942#(<= main_~i~1 22)} is VALID [2018-11-14 18:57:23,017 INFO L273 TraceCheckUtils]: 73: Hoare triple {21942#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {21942#(<= main_~i~1 22)} is VALID [2018-11-14 18:57:23,018 INFO L273 TraceCheckUtils]: 74: Hoare triple {21942#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21943#(<= main_~i~1 23)} is VALID [2018-11-14 18:57:23,019 INFO L273 TraceCheckUtils]: 75: Hoare triple {21943#(<= main_~i~1 23)} assume true; {21943#(<= main_~i~1 23)} is VALID [2018-11-14 18:57:23,019 INFO L273 TraceCheckUtils]: 76: Hoare triple {21943#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {21943#(<= main_~i~1 23)} is VALID [2018-11-14 18:57:23,020 INFO L273 TraceCheckUtils]: 77: Hoare triple {21943#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21944#(<= main_~i~1 24)} is VALID [2018-11-14 18:57:23,020 INFO L273 TraceCheckUtils]: 78: Hoare triple {21944#(<= main_~i~1 24)} assume true; {21944#(<= main_~i~1 24)} is VALID [2018-11-14 18:57:23,021 INFO L273 TraceCheckUtils]: 79: Hoare triple {21944#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {21944#(<= main_~i~1 24)} is VALID [2018-11-14 18:57:23,021 INFO L273 TraceCheckUtils]: 80: Hoare triple {21944#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {21945#(<= main_~i~1 25)} is VALID [2018-11-14 18:57:23,022 INFO L273 TraceCheckUtils]: 81: Hoare triple {21945#(<= main_~i~1 25)} assume true; {21945#(<= main_~i~1 25)} is VALID [2018-11-14 18:57:23,023 INFO L273 TraceCheckUtils]: 82: Hoare triple {21945#(<= main_~i~1 25)} assume !(~i~1 < 100000); {21919#false} is VALID [2018-11-14 18:57:23,023 INFO L256 TraceCheckUtils]: 83: Hoare triple {21919#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {21919#false} is VALID [2018-11-14 18:57:23,023 INFO L273 TraceCheckUtils]: 84: Hoare triple {21919#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {21919#false} is VALID [2018-11-14 18:57:23,023 INFO L273 TraceCheckUtils]: 85: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 18:57:23,023 INFO L273 TraceCheckUtils]: 86: Hoare triple {21919#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 18:57:23,023 INFO L273 TraceCheckUtils]: 87: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 18:57:23,024 INFO L273 TraceCheckUtils]: 88: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 18:57:23,024 INFO L273 TraceCheckUtils]: 89: Hoare triple {21919#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 18:57:23,024 INFO L273 TraceCheckUtils]: 90: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 18:57:23,024 INFO L273 TraceCheckUtils]: 91: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 18:57:23,024 INFO L273 TraceCheckUtils]: 92: Hoare triple {21919#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 18:57:23,025 INFO L273 TraceCheckUtils]: 93: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 18:57:23,025 INFO L273 TraceCheckUtils]: 94: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 18:57:23,025 INFO L273 TraceCheckUtils]: 95: Hoare triple {21919#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 18:57:23,025 INFO L273 TraceCheckUtils]: 96: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 18:57:23,025 INFO L273 TraceCheckUtils]: 97: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 18:57:23,025 INFO L273 TraceCheckUtils]: 98: Hoare triple {21919#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 18:57:23,026 INFO L273 TraceCheckUtils]: 99: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 18:57:23,026 INFO L273 TraceCheckUtils]: 100: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 18:57:23,026 INFO L273 TraceCheckUtils]: 101: Hoare triple {21919#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 18:57:23,026 INFO L273 TraceCheckUtils]: 102: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 18:57:23,026 INFO L273 TraceCheckUtils]: 103: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 18:57:23,026 INFO L273 TraceCheckUtils]: 104: Hoare triple {21919#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 18:57:23,026 INFO L273 TraceCheckUtils]: 105: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 18:57:23,026 INFO L273 TraceCheckUtils]: 106: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 18:57:23,026 INFO L273 TraceCheckUtils]: 107: Hoare triple {21919#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 18:57:23,027 INFO L273 TraceCheckUtils]: 108: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 18:57:23,027 INFO L273 TraceCheckUtils]: 109: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 18:57:23,027 INFO L273 TraceCheckUtils]: 110: Hoare triple {21919#false} assume !(~i~0 < 100000); {21919#false} is VALID [2018-11-14 18:57:23,027 INFO L273 TraceCheckUtils]: 111: Hoare triple {21919#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {21919#false} is VALID [2018-11-14 18:57:23,027 INFO L273 TraceCheckUtils]: 112: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 18:57:23,027 INFO L268 TraceCheckUtils]: 113: Hoare quadruple {21919#false} {21919#false} #73#return; {21919#false} is VALID [2018-11-14 18:57:23,027 INFO L273 TraceCheckUtils]: 114: Hoare triple {21919#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {21919#false} is VALID [2018-11-14 18:57:23,027 INFO L256 TraceCheckUtils]: 115: Hoare triple {21919#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {21919#false} is VALID [2018-11-14 18:57:23,027 INFO L273 TraceCheckUtils]: 116: Hoare triple {21919#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {21919#false} is VALID [2018-11-14 18:57:23,027 INFO L273 TraceCheckUtils]: 117: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 18:57:23,028 INFO L273 TraceCheckUtils]: 118: Hoare triple {21919#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 18:57:23,028 INFO L273 TraceCheckUtils]: 119: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 18:57:23,028 INFO L273 TraceCheckUtils]: 120: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 18:57:23,028 INFO L273 TraceCheckUtils]: 121: Hoare triple {21919#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 18:57:23,028 INFO L273 TraceCheckUtils]: 122: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 18:57:23,028 INFO L273 TraceCheckUtils]: 123: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 18:57:23,028 INFO L273 TraceCheckUtils]: 124: Hoare triple {21919#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 18:57:23,028 INFO L273 TraceCheckUtils]: 125: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 18:57:23,028 INFO L273 TraceCheckUtils]: 126: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 18:57:23,029 INFO L273 TraceCheckUtils]: 127: Hoare triple {21919#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 18:57:23,029 INFO L273 TraceCheckUtils]: 128: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 18:57:23,029 INFO L273 TraceCheckUtils]: 129: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 18:57:23,029 INFO L273 TraceCheckUtils]: 130: Hoare triple {21919#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 18:57:23,029 INFO L273 TraceCheckUtils]: 131: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 18:57:23,029 INFO L273 TraceCheckUtils]: 132: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 18:57:23,029 INFO L273 TraceCheckUtils]: 133: Hoare triple {21919#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 18:57:23,029 INFO L273 TraceCheckUtils]: 134: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 18:57:23,029 INFO L273 TraceCheckUtils]: 135: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 18:57:23,029 INFO L273 TraceCheckUtils]: 136: Hoare triple {21919#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 18:57:23,030 INFO L273 TraceCheckUtils]: 137: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 18:57:23,030 INFO L273 TraceCheckUtils]: 138: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 18:57:23,030 INFO L273 TraceCheckUtils]: 139: Hoare triple {21919#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 18:57:23,030 INFO L273 TraceCheckUtils]: 140: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 18:57:23,030 INFO L273 TraceCheckUtils]: 141: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 18:57:23,030 INFO L273 TraceCheckUtils]: 142: Hoare triple {21919#false} assume !(~i~0 < 100000); {21919#false} is VALID [2018-11-14 18:57:23,030 INFO L273 TraceCheckUtils]: 143: Hoare triple {21919#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {21919#false} is VALID [2018-11-14 18:57:23,030 INFO L273 TraceCheckUtils]: 144: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 18:57:23,030 INFO L268 TraceCheckUtils]: 145: Hoare quadruple {21919#false} {21919#false} #75#return; {21919#false} is VALID [2018-11-14 18:57:23,030 INFO L273 TraceCheckUtils]: 146: Hoare triple {21919#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {21919#false} is VALID [2018-11-14 18:57:23,031 INFO L273 TraceCheckUtils]: 147: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 18:57:23,031 INFO L273 TraceCheckUtils]: 148: Hoare triple {21919#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21919#false} is VALID [2018-11-14 18:57:23,031 INFO L273 TraceCheckUtils]: 149: Hoare triple {21919#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21919#false} is VALID [2018-11-14 18:57:23,031 INFO L273 TraceCheckUtils]: 150: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 18:57:23,031 INFO L273 TraceCheckUtils]: 151: Hoare triple {21919#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21919#false} is VALID [2018-11-14 18:57:23,031 INFO L273 TraceCheckUtils]: 152: Hoare triple {21919#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21919#false} is VALID [2018-11-14 18:57:23,031 INFO L273 TraceCheckUtils]: 153: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 18:57:23,031 INFO L273 TraceCheckUtils]: 154: Hoare triple {21919#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21919#false} is VALID [2018-11-14 18:57:23,031 INFO L273 TraceCheckUtils]: 155: Hoare triple {21919#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21919#false} is VALID [2018-11-14 18:57:23,031 INFO L273 TraceCheckUtils]: 156: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 18:57:23,032 INFO L273 TraceCheckUtils]: 157: Hoare triple {21919#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21919#false} is VALID [2018-11-14 18:57:23,032 INFO L273 TraceCheckUtils]: 158: Hoare triple {21919#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21919#false} is VALID [2018-11-14 18:57:23,032 INFO L273 TraceCheckUtils]: 159: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 18:57:23,032 INFO L273 TraceCheckUtils]: 160: Hoare triple {21919#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21919#false} is VALID [2018-11-14 18:57:23,032 INFO L273 TraceCheckUtils]: 161: Hoare triple {21919#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21919#false} is VALID [2018-11-14 18:57:23,032 INFO L273 TraceCheckUtils]: 162: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 18:57:23,032 INFO L273 TraceCheckUtils]: 163: Hoare triple {21919#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21919#false} is VALID [2018-11-14 18:57:23,032 INFO L273 TraceCheckUtils]: 164: Hoare triple {21919#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21919#false} is VALID [2018-11-14 18:57:23,032 INFO L273 TraceCheckUtils]: 165: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 18:57:23,032 INFO L273 TraceCheckUtils]: 166: Hoare triple {21919#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21919#false} is VALID [2018-11-14 18:57:23,033 INFO L273 TraceCheckUtils]: 167: Hoare triple {21919#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21919#false} is VALID [2018-11-14 18:57:23,033 INFO L273 TraceCheckUtils]: 168: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 18:57:23,033 INFO L273 TraceCheckUtils]: 169: Hoare triple {21919#false} assume !(~i~2 < 99999); {21919#false} is VALID [2018-11-14 18:57:23,033 INFO L273 TraceCheckUtils]: 170: Hoare triple {21919#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {21919#false} is VALID [2018-11-14 18:57:23,033 INFO L256 TraceCheckUtils]: 171: Hoare triple {21919#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {21919#false} is VALID [2018-11-14 18:57:23,033 INFO L273 TraceCheckUtils]: 172: Hoare triple {21919#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {21919#false} is VALID [2018-11-14 18:57:23,033 INFO L273 TraceCheckUtils]: 173: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 18:57:23,033 INFO L273 TraceCheckUtils]: 174: Hoare triple {21919#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 18:57:23,033 INFO L273 TraceCheckUtils]: 175: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 18:57:23,034 INFO L273 TraceCheckUtils]: 176: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 18:57:23,034 INFO L273 TraceCheckUtils]: 177: Hoare triple {21919#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 18:57:23,034 INFO L273 TraceCheckUtils]: 178: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 18:57:23,034 INFO L273 TraceCheckUtils]: 179: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 18:57:23,034 INFO L273 TraceCheckUtils]: 180: Hoare triple {21919#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 18:57:23,034 INFO L273 TraceCheckUtils]: 181: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 18:57:23,034 INFO L273 TraceCheckUtils]: 182: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 18:57:23,034 INFO L273 TraceCheckUtils]: 183: Hoare triple {21919#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 18:57:23,034 INFO L273 TraceCheckUtils]: 184: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 18:57:23,034 INFO L273 TraceCheckUtils]: 185: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 18:57:23,035 INFO L273 TraceCheckUtils]: 186: Hoare triple {21919#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 18:57:23,035 INFO L273 TraceCheckUtils]: 187: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 18:57:23,035 INFO L273 TraceCheckUtils]: 188: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 18:57:23,035 INFO L273 TraceCheckUtils]: 189: Hoare triple {21919#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 18:57:23,035 INFO L273 TraceCheckUtils]: 190: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 18:57:23,035 INFO L273 TraceCheckUtils]: 191: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 18:57:23,035 INFO L273 TraceCheckUtils]: 192: Hoare triple {21919#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 18:57:23,035 INFO L273 TraceCheckUtils]: 193: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 18:57:23,035 INFO L273 TraceCheckUtils]: 194: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 18:57:23,036 INFO L273 TraceCheckUtils]: 195: Hoare triple {21919#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {21919#false} is VALID [2018-11-14 18:57:23,036 INFO L273 TraceCheckUtils]: 196: Hoare triple {21919#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {21919#false} is VALID [2018-11-14 18:57:23,036 INFO L273 TraceCheckUtils]: 197: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 18:57:23,036 INFO L273 TraceCheckUtils]: 198: Hoare triple {21919#false} assume !(~i~0 < 100000); {21919#false} is VALID [2018-11-14 18:57:23,036 INFO L273 TraceCheckUtils]: 199: Hoare triple {21919#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {21919#false} is VALID [2018-11-14 18:57:23,036 INFO L273 TraceCheckUtils]: 200: Hoare triple {21919#false} assume true; {21919#false} is VALID [2018-11-14 18:57:23,037 INFO L268 TraceCheckUtils]: 201: Hoare quadruple {21919#false} {21919#false} #77#return; {21919#false} is VALID [2018-11-14 18:57:23,037 INFO L273 TraceCheckUtils]: 202: Hoare triple {21919#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {21919#false} is VALID [2018-11-14 18:57:23,037 INFO L273 TraceCheckUtils]: 203: Hoare triple {21919#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {21919#false} is VALID [2018-11-14 18:57:23,037 INFO L273 TraceCheckUtils]: 204: Hoare triple {21919#false} assume !false; {21919#false} is VALID [2018-11-14 18:57:23,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2017 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2018-11-14 18:57:23,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:57:23,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-11-14 18:57:23,090 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 205 [2018-11-14 18:57:23,091 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:57:23,091 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-14 18:57:23,211 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-14 18:57:23,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-14 18:57:23,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-14 18:57:23,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-14 18:57:23,212 INFO L87 Difference]: Start difference. First operand 146 states and 150 transitions. Second operand 29 states. [2018-11-14 18:57:23,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:57:23,995 INFO L93 Difference]: Finished difference Result 213 states and 221 transitions. [2018-11-14 18:57:23,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-14 18:57:23,995 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 205 [2018-11-14 18:57:23,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:57:23,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 18:57:23,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 135 transitions. [2018-11-14 18:57:23,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 18:57:23,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 135 transitions. [2018-11-14 18:57:23,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 135 transitions. [2018-11-14 18:57:24,139 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-14 18:57:24,142 INFO L225 Difference]: With dead ends: 213 [2018-11-14 18:57:24,142 INFO L226 Difference]: Without dead ends: 150 [2018-11-14 18:57:24,143 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-14 18:57:24,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-14 18:57:24,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2018-11-14 18:57:24,272 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:57:24,272 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand 149 states. [2018-11-14 18:57:24,272 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand 149 states. [2018-11-14 18:57:24,272 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 149 states. [2018-11-14 18:57:24,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:57:24,275 INFO L93 Difference]: Finished difference Result 150 states and 154 transitions. [2018-11-14 18:57:24,276 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 154 transitions. [2018-11-14 18:57:24,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:57:24,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:57:24,276 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand 150 states. [2018-11-14 18:57:24,276 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 150 states. [2018-11-14 18:57:24,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:57:24,279 INFO L93 Difference]: Finished difference Result 150 states and 154 transitions. [2018-11-14 18:57:24,279 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 154 transitions. [2018-11-14 18:57:24,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:57:24,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:57:24,280 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:57:24,280 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:57:24,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-11-14 18:57:24,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 153 transitions. [2018-11-14 18:57:24,282 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 153 transitions. Word has length 205 [2018-11-14 18:57:24,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:57:24,283 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 153 transitions. [2018-11-14 18:57:24,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-14 18:57:24,283 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 153 transitions. [2018-11-14 18:57:24,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-11-14 18:57:24,284 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:57:24,284 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 24, 24, 8, 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-14 18:57:24,284 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:57:24,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:57:24,285 INFO L82 PathProgramCache]: Analyzing trace with hash 387573854, now seen corresponding path program 26 times [2018-11-14 18:57:24,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:57:24,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:57:24,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:57:24,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:57:24,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:57:24,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:57:25,003 INFO L256 TraceCheckUtils]: 0: Hoare triple {23348#true} call ULTIMATE.init(); {23348#true} is VALID [2018-11-14 18:57:25,004 INFO L273 TraceCheckUtils]: 1: Hoare triple {23348#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23348#true} is VALID [2018-11-14 18:57:25,004 INFO L273 TraceCheckUtils]: 2: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 18:57:25,004 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23348#true} {23348#true} #69#return; {23348#true} is VALID [2018-11-14 18:57:25,004 INFO L256 TraceCheckUtils]: 4: Hoare triple {23348#true} call #t~ret13 := main(); {23348#true} is VALID [2018-11-14 18:57:25,005 INFO L273 TraceCheckUtils]: 5: Hoare triple {23348#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; {23350#(= main_~i~1 0)} is VALID [2018-11-14 18:57:25,005 INFO L273 TraceCheckUtils]: 6: Hoare triple {23350#(= main_~i~1 0)} assume true; {23350#(= main_~i~1 0)} is VALID [2018-11-14 18:57:25,006 INFO L273 TraceCheckUtils]: 7: Hoare triple {23350#(= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {23350#(= main_~i~1 0)} is VALID [2018-11-14 18:57:25,006 INFO L273 TraceCheckUtils]: 8: Hoare triple {23350#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23351#(<= main_~i~1 1)} is VALID [2018-11-14 18:57:25,006 INFO L273 TraceCheckUtils]: 9: Hoare triple {23351#(<= main_~i~1 1)} assume true; {23351#(<= main_~i~1 1)} is VALID [2018-11-14 18:57:25,007 INFO L273 TraceCheckUtils]: 10: Hoare triple {23351#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {23351#(<= main_~i~1 1)} is VALID [2018-11-14 18:57:25,007 INFO L273 TraceCheckUtils]: 11: Hoare triple {23351#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23352#(<= main_~i~1 2)} is VALID [2018-11-14 18:57:25,007 INFO L273 TraceCheckUtils]: 12: Hoare triple {23352#(<= main_~i~1 2)} assume true; {23352#(<= main_~i~1 2)} is VALID [2018-11-14 18:57:25,008 INFO L273 TraceCheckUtils]: 13: Hoare triple {23352#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {23352#(<= main_~i~1 2)} is VALID [2018-11-14 18:57:25,009 INFO L273 TraceCheckUtils]: 14: Hoare triple {23352#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23353#(<= main_~i~1 3)} is VALID [2018-11-14 18:57:25,009 INFO L273 TraceCheckUtils]: 15: Hoare triple {23353#(<= main_~i~1 3)} assume true; {23353#(<= main_~i~1 3)} is VALID [2018-11-14 18:57:25,009 INFO L273 TraceCheckUtils]: 16: Hoare triple {23353#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {23353#(<= main_~i~1 3)} is VALID [2018-11-14 18:57:25,010 INFO L273 TraceCheckUtils]: 17: Hoare triple {23353#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23354#(<= main_~i~1 4)} is VALID [2018-11-14 18:57:25,011 INFO L273 TraceCheckUtils]: 18: Hoare triple {23354#(<= main_~i~1 4)} assume true; {23354#(<= main_~i~1 4)} is VALID [2018-11-14 18:57:25,011 INFO L273 TraceCheckUtils]: 19: Hoare triple {23354#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {23354#(<= main_~i~1 4)} is VALID [2018-11-14 18:57:25,012 INFO L273 TraceCheckUtils]: 20: Hoare triple {23354#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23355#(<= main_~i~1 5)} is VALID [2018-11-14 18:57:25,012 INFO L273 TraceCheckUtils]: 21: Hoare triple {23355#(<= main_~i~1 5)} assume true; {23355#(<= main_~i~1 5)} is VALID [2018-11-14 18:57:25,013 INFO L273 TraceCheckUtils]: 22: Hoare triple {23355#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {23355#(<= main_~i~1 5)} is VALID [2018-11-14 18:57:25,013 INFO L273 TraceCheckUtils]: 23: Hoare triple {23355#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23356#(<= main_~i~1 6)} is VALID [2018-11-14 18:57:25,014 INFO L273 TraceCheckUtils]: 24: Hoare triple {23356#(<= main_~i~1 6)} assume true; {23356#(<= main_~i~1 6)} is VALID [2018-11-14 18:57:25,014 INFO L273 TraceCheckUtils]: 25: Hoare triple {23356#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {23356#(<= main_~i~1 6)} is VALID [2018-11-14 18:57:25,015 INFO L273 TraceCheckUtils]: 26: Hoare triple {23356#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23357#(<= main_~i~1 7)} is VALID [2018-11-14 18:57:25,015 INFO L273 TraceCheckUtils]: 27: Hoare triple {23357#(<= main_~i~1 7)} assume true; {23357#(<= main_~i~1 7)} is VALID [2018-11-14 18:57:25,016 INFO L273 TraceCheckUtils]: 28: Hoare triple {23357#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {23357#(<= main_~i~1 7)} is VALID [2018-11-14 18:57:25,017 INFO L273 TraceCheckUtils]: 29: Hoare triple {23357#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23358#(<= main_~i~1 8)} is VALID [2018-11-14 18:57:25,017 INFO L273 TraceCheckUtils]: 30: Hoare triple {23358#(<= main_~i~1 8)} assume true; {23358#(<= main_~i~1 8)} is VALID [2018-11-14 18:57:25,018 INFO L273 TraceCheckUtils]: 31: Hoare triple {23358#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {23358#(<= main_~i~1 8)} is VALID [2018-11-14 18:57:25,018 INFO L273 TraceCheckUtils]: 32: Hoare triple {23358#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23359#(<= main_~i~1 9)} is VALID [2018-11-14 18:57:25,019 INFO L273 TraceCheckUtils]: 33: Hoare triple {23359#(<= main_~i~1 9)} assume true; {23359#(<= main_~i~1 9)} is VALID [2018-11-14 18:57:25,019 INFO L273 TraceCheckUtils]: 34: Hoare triple {23359#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {23359#(<= main_~i~1 9)} is VALID [2018-11-14 18:57:25,020 INFO L273 TraceCheckUtils]: 35: Hoare triple {23359#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23360#(<= main_~i~1 10)} is VALID [2018-11-14 18:57:25,020 INFO L273 TraceCheckUtils]: 36: Hoare triple {23360#(<= main_~i~1 10)} assume true; {23360#(<= main_~i~1 10)} is VALID [2018-11-14 18:57:25,021 INFO L273 TraceCheckUtils]: 37: Hoare triple {23360#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {23360#(<= main_~i~1 10)} is VALID [2018-11-14 18:57:25,021 INFO L273 TraceCheckUtils]: 38: Hoare triple {23360#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23361#(<= main_~i~1 11)} is VALID [2018-11-14 18:57:25,022 INFO L273 TraceCheckUtils]: 39: Hoare triple {23361#(<= main_~i~1 11)} assume true; {23361#(<= main_~i~1 11)} is VALID [2018-11-14 18:57:25,022 INFO L273 TraceCheckUtils]: 40: Hoare triple {23361#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {23361#(<= main_~i~1 11)} is VALID [2018-11-14 18:57:25,023 INFO L273 TraceCheckUtils]: 41: Hoare triple {23361#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23362#(<= main_~i~1 12)} is VALID [2018-11-14 18:57:25,023 INFO L273 TraceCheckUtils]: 42: Hoare triple {23362#(<= main_~i~1 12)} assume true; {23362#(<= main_~i~1 12)} is VALID [2018-11-14 18:57:25,024 INFO L273 TraceCheckUtils]: 43: Hoare triple {23362#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {23362#(<= main_~i~1 12)} is VALID [2018-11-14 18:57:25,025 INFO L273 TraceCheckUtils]: 44: Hoare triple {23362#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23363#(<= main_~i~1 13)} is VALID [2018-11-14 18:57:25,025 INFO L273 TraceCheckUtils]: 45: Hoare triple {23363#(<= main_~i~1 13)} assume true; {23363#(<= main_~i~1 13)} is VALID [2018-11-14 18:57:25,026 INFO L273 TraceCheckUtils]: 46: Hoare triple {23363#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {23363#(<= main_~i~1 13)} is VALID [2018-11-14 18:57:25,026 INFO L273 TraceCheckUtils]: 47: Hoare triple {23363#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23364#(<= main_~i~1 14)} is VALID [2018-11-14 18:57:25,027 INFO L273 TraceCheckUtils]: 48: Hoare triple {23364#(<= main_~i~1 14)} assume true; {23364#(<= main_~i~1 14)} is VALID [2018-11-14 18:57:25,027 INFO L273 TraceCheckUtils]: 49: Hoare triple {23364#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {23364#(<= main_~i~1 14)} is VALID [2018-11-14 18:57:25,028 INFO L273 TraceCheckUtils]: 50: Hoare triple {23364#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23365#(<= main_~i~1 15)} is VALID [2018-11-14 18:57:25,028 INFO L273 TraceCheckUtils]: 51: Hoare triple {23365#(<= main_~i~1 15)} assume true; {23365#(<= main_~i~1 15)} is VALID [2018-11-14 18:57:25,029 INFO L273 TraceCheckUtils]: 52: Hoare triple {23365#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {23365#(<= main_~i~1 15)} is VALID [2018-11-14 18:57:25,029 INFO L273 TraceCheckUtils]: 53: Hoare triple {23365#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23366#(<= main_~i~1 16)} is VALID [2018-11-14 18:57:25,030 INFO L273 TraceCheckUtils]: 54: Hoare triple {23366#(<= main_~i~1 16)} assume true; {23366#(<= main_~i~1 16)} is VALID [2018-11-14 18:57:25,030 INFO L273 TraceCheckUtils]: 55: Hoare triple {23366#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {23366#(<= main_~i~1 16)} is VALID [2018-11-14 18:57:25,031 INFO L273 TraceCheckUtils]: 56: Hoare triple {23366#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23367#(<= main_~i~1 17)} is VALID [2018-11-14 18:57:25,032 INFO L273 TraceCheckUtils]: 57: Hoare triple {23367#(<= main_~i~1 17)} assume true; {23367#(<= main_~i~1 17)} is VALID [2018-11-14 18:57:25,032 INFO L273 TraceCheckUtils]: 58: Hoare triple {23367#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {23367#(<= main_~i~1 17)} is VALID [2018-11-14 18:57:25,033 INFO L273 TraceCheckUtils]: 59: Hoare triple {23367#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23368#(<= main_~i~1 18)} is VALID [2018-11-14 18:57:25,033 INFO L273 TraceCheckUtils]: 60: Hoare triple {23368#(<= main_~i~1 18)} assume true; {23368#(<= main_~i~1 18)} is VALID [2018-11-14 18:57:25,034 INFO L273 TraceCheckUtils]: 61: Hoare triple {23368#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {23368#(<= main_~i~1 18)} is VALID [2018-11-14 18:57:25,034 INFO L273 TraceCheckUtils]: 62: Hoare triple {23368#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23369#(<= main_~i~1 19)} is VALID [2018-11-14 18:57:25,035 INFO L273 TraceCheckUtils]: 63: Hoare triple {23369#(<= main_~i~1 19)} assume true; {23369#(<= main_~i~1 19)} is VALID [2018-11-14 18:57:25,035 INFO L273 TraceCheckUtils]: 64: Hoare triple {23369#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {23369#(<= main_~i~1 19)} is VALID [2018-11-14 18:57:25,036 INFO L273 TraceCheckUtils]: 65: Hoare triple {23369#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23370#(<= main_~i~1 20)} is VALID [2018-11-14 18:57:25,036 INFO L273 TraceCheckUtils]: 66: Hoare triple {23370#(<= main_~i~1 20)} assume true; {23370#(<= main_~i~1 20)} is VALID [2018-11-14 18:57:25,037 INFO L273 TraceCheckUtils]: 67: Hoare triple {23370#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {23370#(<= main_~i~1 20)} is VALID [2018-11-14 18:57:25,038 INFO L273 TraceCheckUtils]: 68: Hoare triple {23370#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23371#(<= main_~i~1 21)} is VALID [2018-11-14 18:57:25,038 INFO L273 TraceCheckUtils]: 69: Hoare triple {23371#(<= main_~i~1 21)} assume true; {23371#(<= main_~i~1 21)} is VALID [2018-11-14 18:57:25,038 INFO L273 TraceCheckUtils]: 70: Hoare triple {23371#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {23371#(<= main_~i~1 21)} is VALID [2018-11-14 18:57:25,039 INFO L273 TraceCheckUtils]: 71: Hoare triple {23371#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23372#(<= main_~i~1 22)} is VALID [2018-11-14 18:57:25,040 INFO L273 TraceCheckUtils]: 72: Hoare triple {23372#(<= main_~i~1 22)} assume true; {23372#(<= main_~i~1 22)} is VALID [2018-11-14 18:57:25,040 INFO L273 TraceCheckUtils]: 73: Hoare triple {23372#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {23372#(<= main_~i~1 22)} is VALID [2018-11-14 18:57:25,041 INFO L273 TraceCheckUtils]: 74: Hoare triple {23372#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23373#(<= main_~i~1 23)} is VALID [2018-11-14 18:57:25,041 INFO L273 TraceCheckUtils]: 75: Hoare triple {23373#(<= main_~i~1 23)} assume true; {23373#(<= main_~i~1 23)} is VALID [2018-11-14 18:57:25,042 INFO L273 TraceCheckUtils]: 76: Hoare triple {23373#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {23373#(<= main_~i~1 23)} is VALID [2018-11-14 18:57:25,042 INFO L273 TraceCheckUtils]: 77: Hoare triple {23373#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23374#(<= main_~i~1 24)} is VALID [2018-11-14 18:57:25,043 INFO L273 TraceCheckUtils]: 78: Hoare triple {23374#(<= main_~i~1 24)} assume true; {23374#(<= main_~i~1 24)} is VALID [2018-11-14 18:57:25,043 INFO L273 TraceCheckUtils]: 79: Hoare triple {23374#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {23374#(<= main_~i~1 24)} is VALID [2018-11-14 18:57:25,044 INFO L273 TraceCheckUtils]: 80: Hoare triple {23374#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23375#(<= main_~i~1 25)} is VALID [2018-11-14 18:57:25,044 INFO L273 TraceCheckUtils]: 81: Hoare triple {23375#(<= main_~i~1 25)} assume true; {23375#(<= main_~i~1 25)} is VALID [2018-11-14 18:57:25,045 INFO L273 TraceCheckUtils]: 82: Hoare triple {23375#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {23375#(<= main_~i~1 25)} is VALID [2018-11-14 18:57:25,046 INFO L273 TraceCheckUtils]: 83: Hoare triple {23375#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23376#(<= main_~i~1 26)} is VALID [2018-11-14 18:57:25,046 INFO L273 TraceCheckUtils]: 84: Hoare triple {23376#(<= main_~i~1 26)} assume true; {23376#(<= main_~i~1 26)} is VALID [2018-11-14 18:57:25,047 INFO L273 TraceCheckUtils]: 85: Hoare triple {23376#(<= main_~i~1 26)} assume !(~i~1 < 100000); {23349#false} is VALID [2018-11-14 18:57:25,047 INFO L256 TraceCheckUtils]: 86: Hoare triple {23349#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {23348#true} is VALID [2018-11-14 18:57:25,047 INFO L273 TraceCheckUtils]: 87: Hoare triple {23348#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {23348#true} is VALID [2018-11-14 18:57:25,047 INFO L273 TraceCheckUtils]: 88: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 18:57:25,047 INFO L273 TraceCheckUtils]: 89: Hoare triple {23348#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 18:57:25,048 INFO L273 TraceCheckUtils]: 90: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 18:57:25,048 INFO L273 TraceCheckUtils]: 91: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 18:57:25,048 INFO L273 TraceCheckUtils]: 92: Hoare triple {23348#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 18:57:25,048 INFO L273 TraceCheckUtils]: 93: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 18:57:25,048 INFO L273 TraceCheckUtils]: 94: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 18:57:25,048 INFO L273 TraceCheckUtils]: 95: Hoare triple {23348#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 18:57:25,049 INFO L273 TraceCheckUtils]: 96: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 18:57:25,049 INFO L273 TraceCheckUtils]: 97: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 18:57:25,049 INFO L273 TraceCheckUtils]: 98: Hoare triple {23348#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 18:57:25,049 INFO L273 TraceCheckUtils]: 99: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 18:57:25,050 INFO L273 TraceCheckUtils]: 100: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 18:57:25,050 INFO L273 TraceCheckUtils]: 101: Hoare triple {23348#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 18:57:25,050 INFO L273 TraceCheckUtils]: 102: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 18:57:25,050 INFO L273 TraceCheckUtils]: 103: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 18:57:25,050 INFO L273 TraceCheckUtils]: 104: Hoare triple {23348#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 18:57:25,050 INFO L273 TraceCheckUtils]: 105: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 18:57:25,051 INFO L273 TraceCheckUtils]: 106: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 18:57:25,051 INFO L273 TraceCheckUtils]: 107: Hoare triple {23348#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 18:57:25,051 INFO L273 TraceCheckUtils]: 108: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 18:57:25,051 INFO L273 TraceCheckUtils]: 109: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 18:57:25,051 INFO L273 TraceCheckUtils]: 110: Hoare triple {23348#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 18:57:25,051 INFO L273 TraceCheckUtils]: 111: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 18:57:25,051 INFO L273 TraceCheckUtils]: 112: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 18:57:25,052 INFO L273 TraceCheckUtils]: 113: Hoare triple {23348#true} assume !(~i~0 < 100000); {23348#true} is VALID [2018-11-14 18:57:25,052 INFO L273 TraceCheckUtils]: 114: Hoare triple {23348#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {23348#true} is VALID [2018-11-14 18:57:25,052 INFO L273 TraceCheckUtils]: 115: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 18:57:25,052 INFO L268 TraceCheckUtils]: 116: Hoare quadruple {23348#true} {23349#false} #73#return; {23349#false} is VALID [2018-11-14 18:57:25,052 INFO L273 TraceCheckUtils]: 117: Hoare triple {23349#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {23349#false} is VALID [2018-11-14 18:57:25,052 INFO L256 TraceCheckUtils]: 118: Hoare triple {23349#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {23348#true} is VALID [2018-11-14 18:57:25,053 INFO L273 TraceCheckUtils]: 119: Hoare triple {23348#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {23348#true} is VALID [2018-11-14 18:57:25,053 INFO L273 TraceCheckUtils]: 120: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 18:57:25,053 INFO L273 TraceCheckUtils]: 121: Hoare triple {23348#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 18:57:25,053 INFO L273 TraceCheckUtils]: 122: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 18:57:25,053 INFO L273 TraceCheckUtils]: 123: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 18:57:25,053 INFO L273 TraceCheckUtils]: 124: Hoare triple {23348#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 18:57:25,054 INFO L273 TraceCheckUtils]: 125: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 18:57:25,054 INFO L273 TraceCheckUtils]: 126: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 18:57:25,054 INFO L273 TraceCheckUtils]: 127: Hoare triple {23348#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 18:57:25,054 INFO L273 TraceCheckUtils]: 128: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 18:57:25,054 INFO L273 TraceCheckUtils]: 129: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 18:57:25,054 INFO L273 TraceCheckUtils]: 130: Hoare triple {23348#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 18:57:25,054 INFO L273 TraceCheckUtils]: 131: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 18:57:25,055 INFO L273 TraceCheckUtils]: 132: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 18:57:25,055 INFO L273 TraceCheckUtils]: 133: Hoare triple {23348#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 18:57:25,055 INFO L273 TraceCheckUtils]: 134: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 18:57:25,055 INFO L273 TraceCheckUtils]: 135: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 18:57:25,055 INFO L273 TraceCheckUtils]: 136: Hoare triple {23348#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 18:57:25,055 INFO L273 TraceCheckUtils]: 137: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 18:57:25,055 INFO L273 TraceCheckUtils]: 138: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 18:57:25,056 INFO L273 TraceCheckUtils]: 139: Hoare triple {23348#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 18:57:25,056 INFO L273 TraceCheckUtils]: 140: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 18:57:25,056 INFO L273 TraceCheckUtils]: 141: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 18:57:25,056 INFO L273 TraceCheckUtils]: 142: Hoare triple {23348#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 18:57:25,056 INFO L273 TraceCheckUtils]: 143: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 18:57:25,056 INFO L273 TraceCheckUtils]: 144: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 18:57:25,056 INFO L273 TraceCheckUtils]: 145: Hoare triple {23348#true} assume !(~i~0 < 100000); {23348#true} is VALID [2018-11-14 18:57:25,057 INFO L273 TraceCheckUtils]: 146: Hoare triple {23348#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {23348#true} is VALID [2018-11-14 18:57:25,057 INFO L273 TraceCheckUtils]: 147: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 18:57:25,057 INFO L268 TraceCheckUtils]: 148: Hoare quadruple {23348#true} {23349#false} #75#return; {23349#false} is VALID [2018-11-14 18:57:25,057 INFO L273 TraceCheckUtils]: 149: Hoare triple {23349#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {23349#false} is VALID [2018-11-14 18:57:25,057 INFO L273 TraceCheckUtils]: 150: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 18:57:25,057 INFO L273 TraceCheckUtils]: 151: Hoare triple {23349#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23349#false} is VALID [2018-11-14 18:57:25,057 INFO L273 TraceCheckUtils]: 152: Hoare triple {23349#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23349#false} is VALID [2018-11-14 18:57:25,058 INFO L273 TraceCheckUtils]: 153: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 18:57:25,058 INFO L273 TraceCheckUtils]: 154: Hoare triple {23349#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23349#false} is VALID [2018-11-14 18:57:25,058 INFO L273 TraceCheckUtils]: 155: Hoare triple {23349#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23349#false} is VALID [2018-11-14 18:57:25,058 INFO L273 TraceCheckUtils]: 156: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 18:57:25,058 INFO L273 TraceCheckUtils]: 157: Hoare triple {23349#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23349#false} is VALID [2018-11-14 18:57:25,058 INFO L273 TraceCheckUtils]: 158: Hoare triple {23349#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23349#false} is VALID [2018-11-14 18:57:25,058 INFO L273 TraceCheckUtils]: 159: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 18:57:25,059 INFO L273 TraceCheckUtils]: 160: Hoare triple {23349#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23349#false} is VALID [2018-11-14 18:57:25,059 INFO L273 TraceCheckUtils]: 161: Hoare triple {23349#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23349#false} is VALID [2018-11-14 18:57:25,059 INFO L273 TraceCheckUtils]: 162: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 18:57:25,059 INFO L273 TraceCheckUtils]: 163: Hoare triple {23349#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23349#false} is VALID [2018-11-14 18:57:25,059 INFO L273 TraceCheckUtils]: 164: Hoare triple {23349#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23349#false} is VALID [2018-11-14 18:57:25,059 INFO L273 TraceCheckUtils]: 165: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 18:57:25,059 INFO L273 TraceCheckUtils]: 166: Hoare triple {23349#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23349#false} is VALID [2018-11-14 18:57:25,060 INFO L273 TraceCheckUtils]: 167: Hoare triple {23349#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23349#false} is VALID [2018-11-14 18:57:25,060 INFO L273 TraceCheckUtils]: 168: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 18:57:25,060 INFO L273 TraceCheckUtils]: 169: Hoare triple {23349#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23349#false} is VALID [2018-11-14 18:57:25,060 INFO L273 TraceCheckUtils]: 170: Hoare triple {23349#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23349#false} is VALID [2018-11-14 18:57:25,060 INFO L273 TraceCheckUtils]: 171: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 18:57:25,060 INFO L273 TraceCheckUtils]: 172: Hoare triple {23349#false} assume !(~i~2 < 99999); {23349#false} is VALID [2018-11-14 18:57:25,060 INFO L273 TraceCheckUtils]: 173: Hoare triple {23349#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {23349#false} is VALID [2018-11-14 18:57:25,061 INFO L256 TraceCheckUtils]: 174: Hoare triple {23349#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {23348#true} is VALID [2018-11-14 18:57:25,061 INFO L273 TraceCheckUtils]: 175: Hoare triple {23348#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {23348#true} is VALID [2018-11-14 18:57:25,061 INFO L273 TraceCheckUtils]: 176: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 18:57:25,061 INFO L273 TraceCheckUtils]: 177: Hoare triple {23348#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 18:57:25,061 INFO L273 TraceCheckUtils]: 178: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 18:57:25,061 INFO L273 TraceCheckUtils]: 179: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 18:57:25,061 INFO L273 TraceCheckUtils]: 180: Hoare triple {23348#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 18:57:25,062 INFO L273 TraceCheckUtils]: 181: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 18:57:25,062 INFO L273 TraceCheckUtils]: 182: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 18:57:25,062 INFO L273 TraceCheckUtils]: 183: Hoare triple {23348#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 18:57:25,062 INFO L273 TraceCheckUtils]: 184: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 18:57:25,062 INFO L273 TraceCheckUtils]: 185: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 18:57:25,062 INFO L273 TraceCheckUtils]: 186: Hoare triple {23348#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 18:57:25,062 INFO L273 TraceCheckUtils]: 187: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 18:57:25,063 INFO L273 TraceCheckUtils]: 188: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 18:57:25,063 INFO L273 TraceCheckUtils]: 189: Hoare triple {23348#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 18:57:25,063 INFO L273 TraceCheckUtils]: 190: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 18:57:25,063 INFO L273 TraceCheckUtils]: 191: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 18:57:25,063 INFO L273 TraceCheckUtils]: 192: Hoare triple {23348#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 18:57:25,063 INFO L273 TraceCheckUtils]: 193: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 18:57:25,063 INFO L273 TraceCheckUtils]: 194: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 18:57:25,064 INFO L273 TraceCheckUtils]: 195: Hoare triple {23348#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 18:57:25,064 INFO L273 TraceCheckUtils]: 196: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 18:57:25,064 INFO L273 TraceCheckUtils]: 197: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 18:57:25,064 INFO L273 TraceCheckUtils]: 198: Hoare triple {23348#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23348#true} is VALID [2018-11-14 18:57:25,064 INFO L273 TraceCheckUtils]: 199: Hoare triple {23348#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23348#true} is VALID [2018-11-14 18:57:25,064 INFO L273 TraceCheckUtils]: 200: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 18:57:25,065 INFO L273 TraceCheckUtils]: 201: Hoare triple {23348#true} assume !(~i~0 < 100000); {23348#true} is VALID [2018-11-14 18:57:25,065 INFO L273 TraceCheckUtils]: 202: Hoare triple {23348#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {23348#true} is VALID [2018-11-14 18:57:25,065 INFO L273 TraceCheckUtils]: 203: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 18:57:25,065 INFO L268 TraceCheckUtils]: 204: Hoare quadruple {23348#true} {23349#false} #77#return; {23349#false} is VALID [2018-11-14 18:57:25,065 INFO L273 TraceCheckUtils]: 205: Hoare triple {23349#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {23349#false} is VALID [2018-11-14 18:57:25,065 INFO L273 TraceCheckUtils]: 206: Hoare triple {23349#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {23349#false} is VALID [2018-11-14 18:57:25,065 INFO L273 TraceCheckUtils]: 207: Hoare triple {23349#false} assume !false; {23349#false} is VALID [2018-11-14 18:57:25,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2094 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2018-11-14 18:57:25,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:57:25,092 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-14 18:57:25,108 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:57:25,181 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:57:25,181 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:57:25,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:57:25,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:57:25,518 INFO L256 TraceCheckUtils]: 0: Hoare triple {23348#true} call ULTIMATE.init(); {23348#true} is VALID [2018-11-14 18:57:25,519 INFO L273 TraceCheckUtils]: 1: Hoare triple {23348#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23348#true} is VALID [2018-11-14 18:57:25,519 INFO L273 TraceCheckUtils]: 2: Hoare triple {23348#true} assume true; {23348#true} is VALID [2018-11-14 18:57:25,519 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23348#true} {23348#true} #69#return; {23348#true} is VALID [2018-11-14 18:57:25,519 INFO L256 TraceCheckUtils]: 4: Hoare triple {23348#true} call #t~ret13 := main(); {23348#true} is VALID [2018-11-14 18:57:25,520 INFO L273 TraceCheckUtils]: 5: Hoare triple {23348#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; {23395#(<= main_~i~1 0)} is VALID [2018-11-14 18:57:25,520 INFO L273 TraceCheckUtils]: 6: Hoare triple {23395#(<= main_~i~1 0)} assume true; {23395#(<= main_~i~1 0)} is VALID [2018-11-14 18:57:25,520 INFO L273 TraceCheckUtils]: 7: Hoare triple {23395#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {23395#(<= main_~i~1 0)} is VALID [2018-11-14 18:57:25,521 INFO L273 TraceCheckUtils]: 8: Hoare triple {23395#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23351#(<= main_~i~1 1)} is VALID [2018-11-14 18:57:25,521 INFO L273 TraceCheckUtils]: 9: Hoare triple {23351#(<= main_~i~1 1)} assume true; {23351#(<= main_~i~1 1)} is VALID [2018-11-14 18:57:25,522 INFO L273 TraceCheckUtils]: 10: Hoare triple {23351#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {23351#(<= main_~i~1 1)} is VALID [2018-11-14 18:57:25,522 INFO L273 TraceCheckUtils]: 11: Hoare triple {23351#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23352#(<= main_~i~1 2)} is VALID [2018-11-14 18:57:25,522 INFO L273 TraceCheckUtils]: 12: Hoare triple {23352#(<= main_~i~1 2)} assume true; {23352#(<= main_~i~1 2)} is VALID [2018-11-14 18:57:25,523 INFO L273 TraceCheckUtils]: 13: Hoare triple {23352#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {23352#(<= main_~i~1 2)} is VALID [2018-11-14 18:57:25,523 INFO L273 TraceCheckUtils]: 14: Hoare triple {23352#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23353#(<= main_~i~1 3)} is VALID [2018-11-14 18:57:25,523 INFO L273 TraceCheckUtils]: 15: Hoare triple {23353#(<= main_~i~1 3)} assume true; {23353#(<= main_~i~1 3)} is VALID [2018-11-14 18:57:25,524 INFO L273 TraceCheckUtils]: 16: Hoare triple {23353#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {23353#(<= main_~i~1 3)} is VALID [2018-11-14 18:57:25,525 INFO L273 TraceCheckUtils]: 17: Hoare triple {23353#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23354#(<= main_~i~1 4)} is VALID [2018-11-14 18:57:25,525 INFO L273 TraceCheckUtils]: 18: Hoare triple {23354#(<= main_~i~1 4)} assume true; {23354#(<= main_~i~1 4)} is VALID [2018-11-14 18:57:25,526 INFO L273 TraceCheckUtils]: 19: Hoare triple {23354#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {23354#(<= main_~i~1 4)} is VALID [2018-11-14 18:57:25,526 INFO L273 TraceCheckUtils]: 20: Hoare triple {23354#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23355#(<= main_~i~1 5)} is VALID [2018-11-14 18:57:25,527 INFO L273 TraceCheckUtils]: 21: Hoare triple {23355#(<= main_~i~1 5)} assume true; {23355#(<= main_~i~1 5)} is VALID [2018-11-14 18:57:25,527 INFO L273 TraceCheckUtils]: 22: Hoare triple {23355#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {23355#(<= main_~i~1 5)} is VALID [2018-11-14 18:57:25,528 INFO L273 TraceCheckUtils]: 23: Hoare triple {23355#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23356#(<= main_~i~1 6)} is VALID [2018-11-14 18:57:25,528 INFO L273 TraceCheckUtils]: 24: Hoare triple {23356#(<= main_~i~1 6)} assume true; {23356#(<= main_~i~1 6)} is VALID [2018-11-14 18:57:25,529 INFO L273 TraceCheckUtils]: 25: Hoare triple {23356#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {23356#(<= main_~i~1 6)} is VALID [2018-11-14 18:57:25,530 INFO L273 TraceCheckUtils]: 26: Hoare triple {23356#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23357#(<= main_~i~1 7)} is VALID [2018-11-14 18:57:25,530 INFO L273 TraceCheckUtils]: 27: Hoare triple {23357#(<= main_~i~1 7)} assume true; {23357#(<= main_~i~1 7)} is VALID [2018-11-14 18:57:25,531 INFO L273 TraceCheckUtils]: 28: Hoare triple {23357#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {23357#(<= main_~i~1 7)} is VALID [2018-11-14 18:57:25,531 INFO L273 TraceCheckUtils]: 29: Hoare triple {23357#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23358#(<= main_~i~1 8)} is VALID [2018-11-14 18:57:25,532 INFO L273 TraceCheckUtils]: 30: Hoare triple {23358#(<= main_~i~1 8)} assume true; {23358#(<= main_~i~1 8)} is VALID [2018-11-14 18:57:25,532 INFO L273 TraceCheckUtils]: 31: Hoare triple {23358#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {23358#(<= main_~i~1 8)} is VALID [2018-11-14 18:57:25,533 INFO L273 TraceCheckUtils]: 32: Hoare triple {23358#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23359#(<= main_~i~1 9)} is VALID [2018-11-14 18:57:25,534 INFO L273 TraceCheckUtils]: 33: Hoare triple {23359#(<= main_~i~1 9)} assume true; {23359#(<= main_~i~1 9)} is VALID [2018-11-14 18:57:25,534 INFO L273 TraceCheckUtils]: 34: Hoare triple {23359#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {23359#(<= main_~i~1 9)} is VALID [2018-11-14 18:57:25,535 INFO L273 TraceCheckUtils]: 35: Hoare triple {23359#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23360#(<= main_~i~1 10)} is VALID [2018-11-14 18:57:25,535 INFO L273 TraceCheckUtils]: 36: Hoare triple {23360#(<= main_~i~1 10)} assume true; {23360#(<= main_~i~1 10)} is VALID [2018-11-14 18:57:25,536 INFO L273 TraceCheckUtils]: 37: Hoare triple {23360#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {23360#(<= main_~i~1 10)} is VALID [2018-11-14 18:57:25,537 INFO L273 TraceCheckUtils]: 38: Hoare triple {23360#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23361#(<= main_~i~1 11)} is VALID [2018-11-14 18:57:25,537 INFO L273 TraceCheckUtils]: 39: Hoare triple {23361#(<= main_~i~1 11)} assume true; {23361#(<= main_~i~1 11)} is VALID [2018-11-14 18:57:25,538 INFO L273 TraceCheckUtils]: 40: Hoare triple {23361#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {23361#(<= main_~i~1 11)} is VALID [2018-11-14 18:57:25,538 INFO L273 TraceCheckUtils]: 41: Hoare triple {23361#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23362#(<= main_~i~1 12)} is VALID [2018-11-14 18:57:25,539 INFO L273 TraceCheckUtils]: 42: Hoare triple {23362#(<= main_~i~1 12)} assume true; {23362#(<= main_~i~1 12)} is VALID [2018-11-14 18:57:25,539 INFO L273 TraceCheckUtils]: 43: Hoare triple {23362#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {23362#(<= main_~i~1 12)} is VALID [2018-11-14 18:57:25,540 INFO L273 TraceCheckUtils]: 44: Hoare triple {23362#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23363#(<= main_~i~1 13)} is VALID [2018-11-14 18:57:25,540 INFO L273 TraceCheckUtils]: 45: Hoare triple {23363#(<= main_~i~1 13)} assume true; {23363#(<= main_~i~1 13)} is VALID [2018-11-14 18:57:25,541 INFO L273 TraceCheckUtils]: 46: Hoare triple {23363#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {23363#(<= main_~i~1 13)} is VALID [2018-11-14 18:57:25,541 INFO L273 TraceCheckUtils]: 47: Hoare triple {23363#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23364#(<= main_~i~1 14)} is VALID [2018-11-14 18:57:25,542 INFO L273 TraceCheckUtils]: 48: Hoare triple {23364#(<= main_~i~1 14)} assume true; {23364#(<= main_~i~1 14)} is VALID [2018-11-14 18:57:25,542 INFO L273 TraceCheckUtils]: 49: Hoare triple {23364#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {23364#(<= main_~i~1 14)} is VALID [2018-11-14 18:57:25,543 INFO L273 TraceCheckUtils]: 50: Hoare triple {23364#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23365#(<= main_~i~1 15)} is VALID [2018-11-14 18:57:25,544 INFO L273 TraceCheckUtils]: 51: Hoare triple {23365#(<= main_~i~1 15)} assume true; {23365#(<= main_~i~1 15)} is VALID [2018-11-14 18:57:25,544 INFO L273 TraceCheckUtils]: 52: Hoare triple {23365#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {23365#(<= main_~i~1 15)} is VALID [2018-11-14 18:57:25,545 INFO L273 TraceCheckUtils]: 53: Hoare triple {23365#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23366#(<= main_~i~1 16)} is VALID [2018-11-14 18:57:25,545 INFO L273 TraceCheckUtils]: 54: Hoare triple {23366#(<= main_~i~1 16)} assume true; {23366#(<= main_~i~1 16)} is VALID [2018-11-14 18:57:25,546 INFO L273 TraceCheckUtils]: 55: Hoare triple {23366#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {23366#(<= main_~i~1 16)} is VALID [2018-11-14 18:57:25,546 INFO L273 TraceCheckUtils]: 56: Hoare triple {23366#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23367#(<= main_~i~1 17)} is VALID [2018-11-14 18:57:25,547 INFO L273 TraceCheckUtils]: 57: Hoare triple {23367#(<= main_~i~1 17)} assume true; {23367#(<= main_~i~1 17)} is VALID [2018-11-14 18:57:25,547 INFO L273 TraceCheckUtils]: 58: Hoare triple {23367#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {23367#(<= main_~i~1 17)} is VALID [2018-11-14 18:57:25,548 INFO L273 TraceCheckUtils]: 59: Hoare triple {23367#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23368#(<= main_~i~1 18)} is VALID [2018-11-14 18:57:25,549 INFO L273 TraceCheckUtils]: 60: Hoare triple {23368#(<= main_~i~1 18)} assume true; {23368#(<= main_~i~1 18)} is VALID [2018-11-14 18:57:25,549 INFO L273 TraceCheckUtils]: 61: Hoare triple {23368#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {23368#(<= main_~i~1 18)} is VALID [2018-11-14 18:57:25,550 INFO L273 TraceCheckUtils]: 62: Hoare triple {23368#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23369#(<= main_~i~1 19)} is VALID [2018-11-14 18:57:25,550 INFO L273 TraceCheckUtils]: 63: Hoare triple {23369#(<= main_~i~1 19)} assume true; {23369#(<= main_~i~1 19)} is VALID [2018-11-14 18:57:25,551 INFO L273 TraceCheckUtils]: 64: Hoare triple {23369#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {23369#(<= main_~i~1 19)} is VALID [2018-11-14 18:57:25,551 INFO L273 TraceCheckUtils]: 65: Hoare triple {23369#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23370#(<= main_~i~1 20)} is VALID [2018-11-14 18:57:25,552 INFO L273 TraceCheckUtils]: 66: Hoare triple {23370#(<= main_~i~1 20)} assume true; {23370#(<= main_~i~1 20)} is VALID [2018-11-14 18:57:25,552 INFO L273 TraceCheckUtils]: 67: Hoare triple {23370#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {23370#(<= main_~i~1 20)} is VALID [2018-11-14 18:57:25,553 INFO L273 TraceCheckUtils]: 68: Hoare triple {23370#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23371#(<= main_~i~1 21)} is VALID [2018-11-14 18:57:25,553 INFO L273 TraceCheckUtils]: 69: Hoare triple {23371#(<= main_~i~1 21)} assume true; {23371#(<= main_~i~1 21)} is VALID [2018-11-14 18:57:25,554 INFO L273 TraceCheckUtils]: 70: Hoare triple {23371#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {23371#(<= main_~i~1 21)} is VALID [2018-11-14 18:57:25,555 INFO L273 TraceCheckUtils]: 71: Hoare triple {23371#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23372#(<= main_~i~1 22)} is VALID [2018-11-14 18:57:25,555 INFO L273 TraceCheckUtils]: 72: Hoare triple {23372#(<= main_~i~1 22)} assume true; {23372#(<= main_~i~1 22)} is VALID [2018-11-14 18:57:25,556 INFO L273 TraceCheckUtils]: 73: Hoare triple {23372#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {23372#(<= main_~i~1 22)} is VALID [2018-11-14 18:57:25,556 INFO L273 TraceCheckUtils]: 74: Hoare triple {23372#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23373#(<= main_~i~1 23)} is VALID [2018-11-14 18:57:25,557 INFO L273 TraceCheckUtils]: 75: Hoare triple {23373#(<= main_~i~1 23)} assume true; {23373#(<= main_~i~1 23)} is VALID [2018-11-14 18:57:25,557 INFO L273 TraceCheckUtils]: 76: Hoare triple {23373#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {23373#(<= main_~i~1 23)} is VALID [2018-11-14 18:57:25,558 INFO L273 TraceCheckUtils]: 77: Hoare triple {23373#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23374#(<= main_~i~1 24)} is VALID [2018-11-14 18:57:25,558 INFO L273 TraceCheckUtils]: 78: Hoare triple {23374#(<= main_~i~1 24)} assume true; {23374#(<= main_~i~1 24)} is VALID [2018-11-14 18:57:25,559 INFO L273 TraceCheckUtils]: 79: Hoare triple {23374#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {23374#(<= main_~i~1 24)} is VALID [2018-11-14 18:57:25,560 INFO L273 TraceCheckUtils]: 80: Hoare triple {23374#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23375#(<= main_~i~1 25)} is VALID [2018-11-14 18:57:25,560 INFO L273 TraceCheckUtils]: 81: Hoare triple {23375#(<= main_~i~1 25)} assume true; {23375#(<= main_~i~1 25)} is VALID [2018-11-14 18:57:25,561 INFO L273 TraceCheckUtils]: 82: Hoare triple {23375#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {23375#(<= main_~i~1 25)} is VALID [2018-11-14 18:57:25,561 INFO L273 TraceCheckUtils]: 83: Hoare triple {23375#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23376#(<= main_~i~1 26)} is VALID [2018-11-14 18:57:25,562 INFO L273 TraceCheckUtils]: 84: Hoare triple {23376#(<= main_~i~1 26)} assume true; {23376#(<= main_~i~1 26)} is VALID [2018-11-14 18:57:25,562 INFO L273 TraceCheckUtils]: 85: Hoare triple {23376#(<= main_~i~1 26)} assume !(~i~1 < 100000); {23349#false} is VALID [2018-11-14 18:57:25,562 INFO L256 TraceCheckUtils]: 86: Hoare triple {23349#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {23349#false} is VALID [2018-11-14 18:57:25,563 INFO L273 TraceCheckUtils]: 87: Hoare triple {23349#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {23349#false} is VALID [2018-11-14 18:57:25,563 INFO L273 TraceCheckUtils]: 88: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 18:57:25,563 INFO L273 TraceCheckUtils]: 89: Hoare triple {23349#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 18:57:25,563 INFO L273 TraceCheckUtils]: 90: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 18:57:25,563 INFO L273 TraceCheckUtils]: 91: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 18:57:25,563 INFO L273 TraceCheckUtils]: 92: Hoare triple {23349#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 18:57:25,564 INFO L273 TraceCheckUtils]: 93: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 18:57:25,564 INFO L273 TraceCheckUtils]: 94: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 18:57:25,564 INFO L273 TraceCheckUtils]: 95: Hoare triple {23349#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 18:57:25,564 INFO L273 TraceCheckUtils]: 96: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 18:57:25,564 INFO L273 TraceCheckUtils]: 97: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 18:57:25,564 INFO L273 TraceCheckUtils]: 98: Hoare triple {23349#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 18:57:25,565 INFO L273 TraceCheckUtils]: 99: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 18:57:25,565 INFO L273 TraceCheckUtils]: 100: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 18:57:25,565 INFO L273 TraceCheckUtils]: 101: Hoare triple {23349#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 18:57:25,565 INFO L273 TraceCheckUtils]: 102: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 18:57:25,565 INFO L273 TraceCheckUtils]: 103: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 18:57:25,565 INFO L273 TraceCheckUtils]: 104: Hoare triple {23349#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 18:57:25,565 INFO L273 TraceCheckUtils]: 105: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 18:57:25,565 INFO L273 TraceCheckUtils]: 106: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 18:57:25,565 INFO L273 TraceCheckUtils]: 107: Hoare triple {23349#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 18:57:25,566 INFO L273 TraceCheckUtils]: 108: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 18:57:25,566 INFO L273 TraceCheckUtils]: 109: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 18:57:25,566 INFO L273 TraceCheckUtils]: 110: Hoare triple {23349#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 18:57:25,566 INFO L273 TraceCheckUtils]: 111: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 18:57:25,566 INFO L273 TraceCheckUtils]: 112: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 18:57:25,566 INFO L273 TraceCheckUtils]: 113: Hoare triple {23349#false} assume !(~i~0 < 100000); {23349#false} is VALID [2018-11-14 18:57:25,566 INFO L273 TraceCheckUtils]: 114: Hoare triple {23349#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {23349#false} is VALID [2018-11-14 18:57:25,566 INFO L273 TraceCheckUtils]: 115: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 18:57:25,566 INFO L268 TraceCheckUtils]: 116: Hoare quadruple {23349#false} {23349#false} #73#return; {23349#false} is VALID [2018-11-14 18:57:25,566 INFO L273 TraceCheckUtils]: 117: Hoare triple {23349#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {23349#false} is VALID [2018-11-14 18:57:25,567 INFO L256 TraceCheckUtils]: 118: Hoare triple {23349#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {23349#false} is VALID [2018-11-14 18:57:25,567 INFO L273 TraceCheckUtils]: 119: Hoare triple {23349#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {23349#false} is VALID [2018-11-14 18:57:25,567 INFO L273 TraceCheckUtils]: 120: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 18:57:25,567 INFO L273 TraceCheckUtils]: 121: Hoare triple {23349#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 18:57:25,567 INFO L273 TraceCheckUtils]: 122: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 18:57:25,567 INFO L273 TraceCheckUtils]: 123: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 18:57:25,567 INFO L273 TraceCheckUtils]: 124: Hoare triple {23349#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 18:57:25,567 INFO L273 TraceCheckUtils]: 125: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 18:57:25,567 INFO L273 TraceCheckUtils]: 126: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 18:57:25,567 INFO L273 TraceCheckUtils]: 127: Hoare triple {23349#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 18:57:25,568 INFO L273 TraceCheckUtils]: 128: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 18:57:25,568 INFO L273 TraceCheckUtils]: 129: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 18:57:25,568 INFO L273 TraceCheckUtils]: 130: Hoare triple {23349#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 18:57:25,568 INFO L273 TraceCheckUtils]: 131: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 18:57:25,568 INFO L273 TraceCheckUtils]: 132: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 18:57:25,568 INFO L273 TraceCheckUtils]: 133: Hoare triple {23349#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 18:57:25,568 INFO L273 TraceCheckUtils]: 134: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 18:57:25,568 INFO L273 TraceCheckUtils]: 135: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 18:57:25,568 INFO L273 TraceCheckUtils]: 136: Hoare triple {23349#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 18:57:25,569 INFO L273 TraceCheckUtils]: 137: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 18:57:25,569 INFO L273 TraceCheckUtils]: 138: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 18:57:25,569 INFO L273 TraceCheckUtils]: 139: Hoare triple {23349#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 18:57:25,569 INFO L273 TraceCheckUtils]: 140: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 18:57:25,569 INFO L273 TraceCheckUtils]: 141: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 18:57:25,569 INFO L273 TraceCheckUtils]: 142: Hoare triple {23349#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 18:57:25,569 INFO L273 TraceCheckUtils]: 143: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 18:57:25,569 INFO L273 TraceCheckUtils]: 144: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 18:57:25,569 INFO L273 TraceCheckUtils]: 145: Hoare triple {23349#false} assume !(~i~0 < 100000); {23349#false} is VALID [2018-11-14 18:57:25,569 INFO L273 TraceCheckUtils]: 146: Hoare triple {23349#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {23349#false} is VALID [2018-11-14 18:57:25,570 INFO L273 TraceCheckUtils]: 147: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 18:57:25,570 INFO L268 TraceCheckUtils]: 148: Hoare quadruple {23349#false} {23349#false} #75#return; {23349#false} is VALID [2018-11-14 18:57:25,570 INFO L273 TraceCheckUtils]: 149: Hoare triple {23349#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {23349#false} is VALID [2018-11-14 18:57:25,570 INFO L273 TraceCheckUtils]: 150: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 18:57:25,570 INFO L273 TraceCheckUtils]: 151: Hoare triple {23349#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23349#false} is VALID [2018-11-14 18:57:25,570 INFO L273 TraceCheckUtils]: 152: Hoare triple {23349#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23349#false} is VALID [2018-11-14 18:57:25,570 INFO L273 TraceCheckUtils]: 153: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 18:57:25,570 INFO L273 TraceCheckUtils]: 154: Hoare triple {23349#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23349#false} is VALID [2018-11-14 18:57:25,570 INFO L273 TraceCheckUtils]: 155: Hoare triple {23349#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23349#false} is VALID [2018-11-14 18:57:25,570 INFO L273 TraceCheckUtils]: 156: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 18:57:25,571 INFO L273 TraceCheckUtils]: 157: Hoare triple {23349#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23349#false} is VALID [2018-11-14 18:57:25,571 INFO L273 TraceCheckUtils]: 158: Hoare triple {23349#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23349#false} is VALID [2018-11-14 18:57:25,571 INFO L273 TraceCheckUtils]: 159: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 18:57:25,571 INFO L273 TraceCheckUtils]: 160: Hoare triple {23349#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23349#false} is VALID [2018-11-14 18:57:25,571 INFO L273 TraceCheckUtils]: 161: Hoare triple {23349#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23349#false} is VALID [2018-11-14 18:57:25,571 INFO L273 TraceCheckUtils]: 162: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 18:57:25,571 INFO L273 TraceCheckUtils]: 163: Hoare triple {23349#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23349#false} is VALID [2018-11-14 18:57:25,571 INFO L273 TraceCheckUtils]: 164: Hoare triple {23349#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23349#false} is VALID [2018-11-14 18:57:25,571 INFO L273 TraceCheckUtils]: 165: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 18:57:25,571 INFO L273 TraceCheckUtils]: 166: Hoare triple {23349#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23349#false} is VALID [2018-11-14 18:57:25,572 INFO L273 TraceCheckUtils]: 167: Hoare triple {23349#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23349#false} is VALID [2018-11-14 18:57:25,572 INFO L273 TraceCheckUtils]: 168: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 18:57:25,572 INFO L273 TraceCheckUtils]: 169: Hoare triple {23349#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23349#false} is VALID [2018-11-14 18:57:25,572 INFO L273 TraceCheckUtils]: 170: Hoare triple {23349#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23349#false} is VALID [2018-11-14 18:57:25,572 INFO L273 TraceCheckUtils]: 171: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 18:57:25,572 INFO L273 TraceCheckUtils]: 172: Hoare triple {23349#false} assume !(~i~2 < 99999); {23349#false} is VALID [2018-11-14 18:57:25,572 INFO L273 TraceCheckUtils]: 173: Hoare triple {23349#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {23349#false} is VALID [2018-11-14 18:57:25,572 INFO L256 TraceCheckUtils]: 174: Hoare triple {23349#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {23349#false} is VALID [2018-11-14 18:57:25,572 INFO L273 TraceCheckUtils]: 175: Hoare triple {23349#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {23349#false} is VALID [2018-11-14 18:57:25,572 INFO L273 TraceCheckUtils]: 176: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 18:57:25,573 INFO L273 TraceCheckUtils]: 177: Hoare triple {23349#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 18:57:25,573 INFO L273 TraceCheckUtils]: 178: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 18:57:25,573 INFO L273 TraceCheckUtils]: 179: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 18:57:25,573 INFO L273 TraceCheckUtils]: 180: Hoare triple {23349#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 18:57:25,573 INFO L273 TraceCheckUtils]: 181: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 18:57:25,573 INFO L273 TraceCheckUtils]: 182: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 18:57:25,573 INFO L273 TraceCheckUtils]: 183: Hoare triple {23349#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 18:57:25,573 INFO L273 TraceCheckUtils]: 184: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 18:57:25,573 INFO L273 TraceCheckUtils]: 185: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 18:57:25,573 INFO L273 TraceCheckUtils]: 186: Hoare triple {23349#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 18:57:25,574 INFO L273 TraceCheckUtils]: 187: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 18:57:25,574 INFO L273 TraceCheckUtils]: 188: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 18:57:25,574 INFO L273 TraceCheckUtils]: 189: Hoare triple {23349#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 18:57:25,574 INFO L273 TraceCheckUtils]: 190: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 18:57:25,574 INFO L273 TraceCheckUtils]: 191: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 18:57:25,574 INFO L273 TraceCheckUtils]: 192: Hoare triple {23349#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 18:57:25,574 INFO L273 TraceCheckUtils]: 193: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 18:57:25,574 INFO L273 TraceCheckUtils]: 194: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 18:57:25,574 INFO L273 TraceCheckUtils]: 195: Hoare triple {23349#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 18:57:25,574 INFO L273 TraceCheckUtils]: 196: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 18:57:25,575 INFO L273 TraceCheckUtils]: 197: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 18:57:25,575 INFO L273 TraceCheckUtils]: 198: Hoare triple {23349#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23349#false} is VALID [2018-11-14 18:57:25,575 INFO L273 TraceCheckUtils]: 199: Hoare triple {23349#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23349#false} is VALID [2018-11-14 18:57:25,575 INFO L273 TraceCheckUtils]: 200: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 18:57:25,575 INFO L273 TraceCheckUtils]: 201: Hoare triple {23349#false} assume !(~i~0 < 100000); {23349#false} is VALID [2018-11-14 18:57:25,575 INFO L273 TraceCheckUtils]: 202: Hoare triple {23349#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {23349#false} is VALID [2018-11-14 18:57:25,575 INFO L273 TraceCheckUtils]: 203: Hoare triple {23349#false} assume true; {23349#false} is VALID [2018-11-14 18:57:25,575 INFO L268 TraceCheckUtils]: 204: Hoare quadruple {23349#false} {23349#false} #77#return; {23349#false} is VALID [2018-11-14 18:57:25,575 INFO L273 TraceCheckUtils]: 205: Hoare triple {23349#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {23349#false} is VALID [2018-11-14 18:57:25,576 INFO L273 TraceCheckUtils]: 206: Hoare triple {23349#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {23349#false} is VALID [2018-11-14 18:57:25,576 INFO L273 TraceCheckUtils]: 207: Hoare triple {23349#false} assume !false; {23349#false} is VALID [2018-11-14 18:57:25,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2094 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2018-11-14 18:57:25,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:57:25,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-11-14 18:57:25,616 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 208 [2018-11-14 18:57:25,617 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:57:25,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-14 18:57:25,728 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:57:25,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-14 18:57:25,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-14 18:57:25,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-14 18:57:25,730 INFO L87 Difference]: Start difference. First operand 149 states and 153 transitions. Second operand 30 states. [2018-11-14 18:57:26,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:57:26,338 INFO L93 Difference]: Finished difference Result 216 states and 224 transitions. [2018-11-14 18:57:26,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-14 18:57:26,338 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 208 [2018-11-14 18:57:26,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:57:26,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 18:57:26,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 138 transitions. [2018-11-14 18:57:26,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 18:57:26,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 138 transitions. [2018-11-14 18:57:26,340 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 138 transitions. [2018-11-14 18:57:26,461 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:57:26,464 INFO L225 Difference]: With dead ends: 216 [2018-11-14 18:57:26,464 INFO L226 Difference]: Without dead ends: 153 [2018-11-14 18:57:26,465 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-14 18:57:26,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-11-14 18:57:26,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2018-11-14 18:57:26,558 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:57:26,558 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand 152 states. [2018-11-14 18:57:26,558 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 152 states. [2018-11-14 18:57:26,558 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 152 states. [2018-11-14 18:57:26,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:57:26,561 INFO L93 Difference]: Finished difference Result 153 states and 157 transitions. [2018-11-14 18:57:26,561 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2018-11-14 18:57:26,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:57:26,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:57:26,562 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 153 states. [2018-11-14 18:57:26,562 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 153 states. [2018-11-14 18:57:26,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:57:26,565 INFO L93 Difference]: Finished difference Result 153 states and 157 transitions. [2018-11-14 18:57:26,565 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2018-11-14 18:57:26,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:57:26,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:57:26,565 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:57:26,565 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:57:26,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-14 18:57:26,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 156 transitions. [2018-11-14 18:57:26,568 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 156 transitions. Word has length 208 [2018-11-14 18:57:26,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:57:26,568 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 156 transitions. [2018-11-14 18:57:26,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-14 18:57:26,569 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 156 transitions. [2018-11-14 18:57:26,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-14 18:57:26,570 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:57:26,570 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 24, 24, 8, 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-14 18:57:26,570 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:57:26,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:57:26,570 INFO L82 PathProgramCache]: Analyzing trace with hash 67051736, now seen corresponding path program 27 times [2018-11-14 18:57:26,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:57:26,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:57:26,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:57:26,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:57:26,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:57:26,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:57:27,195 INFO L256 TraceCheckUtils]: 0: Hoare triple {24802#true} call ULTIMATE.init(); {24802#true} is VALID [2018-11-14 18:57:27,195 INFO L273 TraceCheckUtils]: 1: Hoare triple {24802#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24802#true} is VALID [2018-11-14 18:57:27,195 INFO L273 TraceCheckUtils]: 2: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,196 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24802#true} {24802#true} #69#return; {24802#true} is VALID [2018-11-14 18:57:27,196 INFO L256 TraceCheckUtils]: 4: Hoare triple {24802#true} call #t~ret13 := main(); {24802#true} is VALID [2018-11-14 18:57:27,196 INFO L273 TraceCheckUtils]: 5: Hoare triple {24802#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; {24804#(= main_~i~1 0)} is VALID [2018-11-14 18:57:27,197 INFO L273 TraceCheckUtils]: 6: Hoare triple {24804#(= main_~i~1 0)} assume true; {24804#(= main_~i~1 0)} is VALID [2018-11-14 18:57:27,197 INFO L273 TraceCheckUtils]: 7: Hoare triple {24804#(= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {24804#(= main_~i~1 0)} is VALID [2018-11-14 18:57:27,198 INFO L273 TraceCheckUtils]: 8: Hoare triple {24804#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24805#(<= main_~i~1 1)} is VALID [2018-11-14 18:57:27,198 INFO L273 TraceCheckUtils]: 9: Hoare triple {24805#(<= main_~i~1 1)} assume true; {24805#(<= main_~i~1 1)} is VALID [2018-11-14 18:57:27,199 INFO L273 TraceCheckUtils]: 10: Hoare triple {24805#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {24805#(<= main_~i~1 1)} is VALID [2018-11-14 18:57:27,200 INFO L273 TraceCheckUtils]: 11: Hoare triple {24805#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24806#(<= main_~i~1 2)} is VALID [2018-11-14 18:57:27,200 INFO L273 TraceCheckUtils]: 12: Hoare triple {24806#(<= main_~i~1 2)} assume true; {24806#(<= main_~i~1 2)} is VALID [2018-11-14 18:57:27,201 INFO L273 TraceCheckUtils]: 13: Hoare triple {24806#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {24806#(<= main_~i~1 2)} is VALID [2018-11-14 18:57:27,201 INFO L273 TraceCheckUtils]: 14: Hoare triple {24806#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24807#(<= main_~i~1 3)} is VALID [2018-11-14 18:57:27,202 INFO L273 TraceCheckUtils]: 15: Hoare triple {24807#(<= main_~i~1 3)} assume true; {24807#(<= main_~i~1 3)} is VALID [2018-11-14 18:57:27,202 INFO L273 TraceCheckUtils]: 16: Hoare triple {24807#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {24807#(<= main_~i~1 3)} is VALID [2018-11-14 18:57:27,203 INFO L273 TraceCheckUtils]: 17: Hoare triple {24807#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24808#(<= main_~i~1 4)} is VALID [2018-11-14 18:57:27,203 INFO L273 TraceCheckUtils]: 18: Hoare triple {24808#(<= main_~i~1 4)} assume true; {24808#(<= main_~i~1 4)} is VALID [2018-11-14 18:57:27,204 INFO L273 TraceCheckUtils]: 19: Hoare triple {24808#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {24808#(<= main_~i~1 4)} is VALID [2018-11-14 18:57:27,204 INFO L273 TraceCheckUtils]: 20: Hoare triple {24808#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24809#(<= main_~i~1 5)} is VALID [2018-11-14 18:57:27,205 INFO L273 TraceCheckUtils]: 21: Hoare triple {24809#(<= main_~i~1 5)} assume true; {24809#(<= main_~i~1 5)} is VALID [2018-11-14 18:57:27,205 INFO L273 TraceCheckUtils]: 22: Hoare triple {24809#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {24809#(<= main_~i~1 5)} is VALID [2018-11-14 18:57:27,206 INFO L273 TraceCheckUtils]: 23: Hoare triple {24809#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24810#(<= main_~i~1 6)} is VALID [2018-11-14 18:57:27,206 INFO L273 TraceCheckUtils]: 24: Hoare triple {24810#(<= main_~i~1 6)} assume true; {24810#(<= main_~i~1 6)} is VALID [2018-11-14 18:57:27,207 INFO L273 TraceCheckUtils]: 25: Hoare triple {24810#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {24810#(<= main_~i~1 6)} is VALID [2018-11-14 18:57:27,208 INFO L273 TraceCheckUtils]: 26: Hoare triple {24810#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24811#(<= main_~i~1 7)} is VALID [2018-11-14 18:57:27,208 INFO L273 TraceCheckUtils]: 27: Hoare triple {24811#(<= main_~i~1 7)} assume true; {24811#(<= main_~i~1 7)} is VALID [2018-11-14 18:57:27,209 INFO L273 TraceCheckUtils]: 28: Hoare triple {24811#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {24811#(<= main_~i~1 7)} is VALID [2018-11-14 18:57:27,209 INFO L273 TraceCheckUtils]: 29: Hoare triple {24811#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24812#(<= main_~i~1 8)} is VALID [2018-11-14 18:57:27,210 INFO L273 TraceCheckUtils]: 30: Hoare triple {24812#(<= main_~i~1 8)} assume true; {24812#(<= main_~i~1 8)} is VALID [2018-11-14 18:57:27,210 INFO L273 TraceCheckUtils]: 31: Hoare triple {24812#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {24812#(<= main_~i~1 8)} is VALID [2018-11-14 18:57:27,211 INFO L273 TraceCheckUtils]: 32: Hoare triple {24812#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24813#(<= main_~i~1 9)} is VALID [2018-11-14 18:57:27,211 INFO L273 TraceCheckUtils]: 33: Hoare triple {24813#(<= main_~i~1 9)} assume true; {24813#(<= main_~i~1 9)} is VALID [2018-11-14 18:57:27,212 INFO L273 TraceCheckUtils]: 34: Hoare triple {24813#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {24813#(<= main_~i~1 9)} is VALID [2018-11-14 18:57:27,212 INFO L273 TraceCheckUtils]: 35: Hoare triple {24813#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24814#(<= main_~i~1 10)} is VALID [2018-11-14 18:57:27,213 INFO L273 TraceCheckUtils]: 36: Hoare triple {24814#(<= main_~i~1 10)} assume true; {24814#(<= main_~i~1 10)} is VALID [2018-11-14 18:57:27,213 INFO L273 TraceCheckUtils]: 37: Hoare triple {24814#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {24814#(<= main_~i~1 10)} is VALID [2018-11-14 18:57:27,214 INFO L273 TraceCheckUtils]: 38: Hoare triple {24814#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24815#(<= main_~i~1 11)} is VALID [2018-11-14 18:57:27,214 INFO L273 TraceCheckUtils]: 39: Hoare triple {24815#(<= main_~i~1 11)} assume true; {24815#(<= main_~i~1 11)} is VALID [2018-11-14 18:57:27,215 INFO L273 TraceCheckUtils]: 40: Hoare triple {24815#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {24815#(<= main_~i~1 11)} is VALID [2018-11-14 18:57:27,216 INFO L273 TraceCheckUtils]: 41: Hoare triple {24815#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24816#(<= main_~i~1 12)} is VALID [2018-11-14 18:57:27,216 INFO L273 TraceCheckUtils]: 42: Hoare triple {24816#(<= main_~i~1 12)} assume true; {24816#(<= main_~i~1 12)} is VALID [2018-11-14 18:57:27,217 INFO L273 TraceCheckUtils]: 43: Hoare triple {24816#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {24816#(<= main_~i~1 12)} is VALID [2018-11-14 18:57:27,217 INFO L273 TraceCheckUtils]: 44: Hoare triple {24816#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24817#(<= main_~i~1 13)} is VALID [2018-11-14 18:57:27,218 INFO L273 TraceCheckUtils]: 45: Hoare triple {24817#(<= main_~i~1 13)} assume true; {24817#(<= main_~i~1 13)} is VALID [2018-11-14 18:57:27,218 INFO L273 TraceCheckUtils]: 46: Hoare triple {24817#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {24817#(<= main_~i~1 13)} is VALID [2018-11-14 18:57:27,219 INFO L273 TraceCheckUtils]: 47: Hoare triple {24817#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24818#(<= main_~i~1 14)} is VALID [2018-11-14 18:57:27,219 INFO L273 TraceCheckUtils]: 48: Hoare triple {24818#(<= main_~i~1 14)} assume true; {24818#(<= main_~i~1 14)} is VALID [2018-11-14 18:57:27,220 INFO L273 TraceCheckUtils]: 49: Hoare triple {24818#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {24818#(<= main_~i~1 14)} is VALID [2018-11-14 18:57:27,220 INFO L273 TraceCheckUtils]: 50: Hoare triple {24818#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24819#(<= main_~i~1 15)} is VALID [2018-11-14 18:57:27,221 INFO L273 TraceCheckUtils]: 51: Hoare triple {24819#(<= main_~i~1 15)} assume true; {24819#(<= main_~i~1 15)} is VALID [2018-11-14 18:57:27,221 INFO L273 TraceCheckUtils]: 52: Hoare triple {24819#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {24819#(<= main_~i~1 15)} is VALID [2018-11-14 18:57:27,222 INFO L273 TraceCheckUtils]: 53: Hoare triple {24819#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24820#(<= main_~i~1 16)} is VALID [2018-11-14 18:57:27,222 INFO L273 TraceCheckUtils]: 54: Hoare triple {24820#(<= main_~i~1 16)} assume true; {24820#(<= main_~i~1 16)} is VALID [2018-11-14 18:57:27,223 INFO L273 TraceCheckUtils]: 55: Hoare triple {24820#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {24820#(<= main_~i~1 16)} is VALID [2018-11-14 18:57:27,224 INFO L273 TraceCheckUtils]: 56: Hoare triple {24820#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24821#(<= main_~i~1 17)} is VALID [2018-11-14 18:57:27,224 INFO L273 TraceCheckUtils]: 57: Hoare triple {24821#(<= main_~i~1 17)} assume true; {24821#(<= main_~i~1 17)} is VALID [2018-11-14 18:57:27,224 INFO L273 TraceCheckUtils]: 58: Hoare triple {24821#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {24821#(<= main_~i~1 17)} is VALID [2018-11-14 18:57:27,225 INFO L273 TraceCheckUtils]: 59: Hoare triple {24821#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24822#(<= main_~i~1 18)} is VALID [2018-11-14 18:57:27,226 INFO L273 TraceCheckUtils]: 60: Hoare triple {24822#(<= main_~i~1 18)} assume true; {24822#(<= main_~i~1 18)} is VALID [2018-11-14 18:57:27,226 INFO L273 TraceCheckUtils]: 61: Hoare triple {24822#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {24822#(<= main_~i~1 18)} is VALID [2018-11-14 18:57:27,227 INFO L273 TraceCheckUtils]: 62: Hoare triple {24822#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24823#(<= main_~i~1 19)} is VALID [2018-11-14 18:57:27,227 INFO L273 TraceCheckUtils]: 63: Hoare triple {24823#(<= main_~i~1 19)} assume true; {24823#(<= main_~i~1 19)} is VALID [2018-11-14 18:57:27,228 INFO L273 TraceCheckUtils]: 64: Hoare triple {24823#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {24823#(<= main_~i~1 19)} is VALID [2018-11-14 18:57:27,228 INFO L273 TraceCheckUtils]: 65: Hoare triple {24823#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24824#(<= main_~i~1 20)} is VALID [2018-11-14 18:57:27,229 INFO L273 TraceCheckUtils]: 66: Hoare triple {24824#(<= main_~i~1 20)} assume true; {24824#(<= main_~i~1 20)} is VALID [2018-11-14 18:57:27,229 INFO L273 TraceCheckUtils]: 67: Hoare triple {24824#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {24824#(<= main_~i~1 20)} is VALID [2018-11-14 18:57:27,230 INFO L273 TraceCheckUtils]: 68: Hoare triple {24824#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24825#(<= main_~i~1 21)} is VALID [2018-11-14 18:57:27,230 INFO L273 TraceCheckUtils]: 69: Hoare triple {24825#(<= main_~i~1 21)} assume true; {24825#(<= main_~i~1 21)} is VALID [2018-11-14 18:57:27,231 INFO L273 TraceCheckUtils]: 70: Hoare triple {24825#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {24825#(<= main_~i~1 21)} is VALID [2018-11-14 18:57:27,232 INFO L273 TraceCheckUtils]: 71: Hoare triple {24825#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24826#(<= main_~i~1 22)} is VALID [2018-11-14 18:57:27,232 INFO L273 TraceCheckUtils]: 72: Hoare triple {24826#(<= main_~i~1 22)} assume true; {24826#(<= main_~i~1 22)} is VALID [2018-11-14 18:57:27,233 INFO L273 TraceCheckUtils]: 73: Hoare triple {24826#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {24826#(<= main_~i~1 22)} is VALID [2018-11-14 18:57:27,233 INFO L273 TraceCheckUtils]: 74: Hoare triple {24826#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24827#(<= main_~i~1 23)} is VALID [2018-11-14 18:57:27,234 INFO L273 TraceCheckUtils]: 75: Hoare triple {24827#(<= main_~i~1 23)} assume true; {24827#(<= main_~i~1 23)} is VALID [2018-11-14 18:57:27,234 INFO L273 TraceCheckUtils]: 76: Hoare triple {24827#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {24827#(<= main_~i~1 23)} is VALID [2018-11-14 18:57:27,235 INFO L273 TraceCheckUtils]: 77: Hoare triple {24827#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24828#(<= main_~i~1 24)} is VALID [2018-11-14 18:57:27,235 INFO L273 TraceCheckUtils]: 78: Hoare triple {24828#(<= main_~i~1 24)} assume true; {24828#(<= main_~i~1 24)} is VALID [2018-11-14 18:57:27,236 INFO L273 TraceCheckUtils]: 79: Hoare triple {24828#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {24828#(<= main_~i~1 24)} is VALID [2018-11-14 18:57:27,236 INFO L273 TraceCheckUtils]: 80: Hoare triple {24828#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24829#(<= main_~i~1 25)} is VALID [2018-11-14 18:57:27,237 INFO L273 TraceCheckUtils]: 81: Hoare triple {24829#(<= main_~i~1 25)} assume true; {24829#(<= main_~i~1 25)} is VALID [2018-11-14 18:57:27,237 INFO L273 TraceCheckUtils]: 82: Hoare triple {24829#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {24829#(<= main_~i~1 25)} is VALID [2018-11-14 18:57:27,238 INFO L273 TraceCheckUtils]: 83: Hoare triple {24829#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24830#(<= main_~i~1 26)} is VALID [2018-11-14 18:57:27,238 INFO L273 TraceCheckUtils]: 84: Hoare triple {24830#(<= main_~i~1 26)} assume true; {24830#(<= main_~i~1 26)} is VALID [2018-11-14 18:57:27,239 INFO L273 TraceCheckUtils]: 85: Hoare triple {24830#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {24830#(<= main_~i~1 26)} is VALID [2018-11-14 18:57:27,240 INFO L273 TraceCheckUtils]: 86: Hoare triple {24830#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24831#(<= main_~i~1 27)} is VALID [2018-11-14 18:57:27,240 INFO L273 TraceCheckUtils]: 87: Hoare triple {24831#(<= main_~i~1 27)} assume true; {24831#(<= main_~i~1 27)} is VALID [2018-11-14 18:57:27,241 INFO L273 TraceCheckUtils]: 88: Hoare triple {24831#(<= main_~i~1 27)} assume !(~i~1 < 100000); {24803#false} is VALID [2018-11-14 18:57:27,241 INFO L256 TraceCheckUtils]: 89: Hoare triple {24803#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {24802#true} is VALID [2018-11-14 18:57:27,241 INFO L273 TraceCheckUtils]: 90: Hoare triple {24802#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {24802#true} is VALID [2018-11-14 18:57:27,241 INFO L273 TraceCheckUtils]: 91: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,241 INFO L273 TraceCheckUtils]: 92: Hoare triple {24802#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 18:57:27,242 INFO L273 TraceCheckUtils]: 93: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 18:57:27,242 INFO L273 TraceCheckUtils]: 94: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,242 INFO L273 TraceCheckUtils]: 95: Hoare triple {24802#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 18:57:27,242 INFO L273 TraceCheckUtils]: 96: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 18:57:27,242 INFO L273 TraceCheckUtils]: 97: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,242 INFO L273 TraceCheckUtils]: 98: Hoare triple {24802#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 18:57:27,242 INFO L273 TraceCheckUtils]: 99: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 18:57:27,243 INFO L273 TraceCheckUtils]: 100: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,243 INFO L273 TraceCheckUtils]: 101: Hoare triple {24802#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 18:57:27,243 INFO L273 TraceCheckUtils]: 102: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 18:57:27,243 INFO L273 TraceCheckUtils]: 103: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,243 INFO L273 TraceCheckUtils]: 104: Hoare triple {24802#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 18:57:27,243 INFO L273 TraceCheckUtils]: 105: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 18:57:27,244 INFO L273 TraceCheckUtils]: 106: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,244 INFO L273 TraceCheckUtils]: 107: Hoare triple {24802#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 18:57:27,244 INFO L273 TraceCheckUtils]: 108: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 18:57:27,244 INFO L273 TraceCheckUtils]: 109: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,244 INFO L273 TraceCheckUtils]: 110: Hoare triple {24802#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 18:57:27,244 INFO L273 TraceCheckUtils]: 111: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 18:57:27,244 INFO L273 TraceCheckUtils]: 112: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,244 INFO L273 TraceCheckUtils]: 113: Hoare triple {24802#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 18:57:27,244 INFO L273 TraceCheckUtils]: 114: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 18:57:27,245 INFO L273 TraceCheckUtils]: 115: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,245 INFO L273 TraceCheckUtils]: 116: Hoare triple {24802#true} assume !(~i~0 < 100000); {24802#true} is VALID [2018-11-14 18:57:27,245 INFO L273 TraceCheckUtils]: 117: Hoare triple {24802#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {24802#true} is VALID [2018-11-14 18:57:27,245 INFO L273 TraceCheckUtils]: 118: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,245 INFO L268 TraceCheckUtils]: 119: Hoare quadruple {24802#true} {24803#false} #73#return; {24803#false} is VALID [2018-11-14 18:57:27,245 INFO L273 TraceCheckUtils]: 120: Hoare triple {24803#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {24803#false} is VALID [2018-11-14 18:57:27,245 INFO L256 TraceCheckUtils]: 121: Hoare triple {24803#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {24802#true} is VALID [2018-11-14 18:57:27,245 INFO L273 TraceCheckUtils]: 122: Hoare triple {24802#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {24802#true} is VALID [2018-11-14 18:57:27,245 INFO L273 TraceCheckUtils]: 123: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,245 INFO L273 TraceCheckUtils]: 124: Hoare triple {24802#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 18:57:27,246 INFO L273 TraceCheckUtils]: 125: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 18:57:27,246 INFO L273 TraceCheckUtils]: 126: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,246 INFO L273 TraceCheckUtils]: 127: Hoare triple {24802#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 18:57:27,246 INFO L273 TraceCheckUtils]: 128: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 18:57:27,246 INFO L273 TraceCheckUtils]: 129: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,246 INFO L273 TraceCheckUtils]: 130: Hoare triple {24802#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 18:57:27,246 INFO L273 TraceCheckUtils]: 131: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 18:57:27,246 INFO L273 TraceCheckUtils]: 132: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,246 INFO L273 TraceCheckUtils]: 133: Hoare triple {24802#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 18:57:27,246 INFO L273 TraceCheckUtils]: 134: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 18:57:27,247 INFO L273 TraceCheckUtils]: 135: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,247 INFO L273 TraceCheckUtils]: 136: Hoare triple {24802#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 18:57:27,247 INFO L273 TraceCheckUtils]: 137: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 18:57:27,247 INFO L273 TraceCheckUtils]: 138: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,247 INFO L273 TraceCheckUtils]: 139: Hoare triple {24802#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 18:57:27,247 INFO L273 TraceCheckUtils]: 140: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 18:57:27,247 INFO L273 TraceCheckUtils]: 141: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,247 INFO L273 TraceCheckUtils]: 142: Hoare triple {24802#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 18:57:27,247 INFO L273 TraceCheckUtils]: 143: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 18:57:27,248 INFO L273 TraceCheckUtils]: 144: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,248 INFO L273 TraceCheckUtils]: 145: Hoare triple {24802#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 18:57:27,248 INFO L273 TraceCheckUtils]: 146: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 18:57:27,248 INFO L273 TraceCheckUtils]: 147: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,248 INFO L273 TraceCheckUtils]: 148: Hoare triple {24802#true} assume !(~i~0 < 100000); {24802#true} is VALID [2018-11-14 18:57:27,248 INFO L273 TraceCheckUtils]: 149: Hoare triple {24802#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {24802#true} is VALID [2018-11-14 18:57:27,248 INFO L273 TraceCheckUtils]: 150: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,248 INFO L268 TraceCheckUtils]: 151: Hoare quadruple {24802#true} {24803#false} #75#return; {24803#false} is VALID [2018-11-14 18:57:27,248 INFO L273 TraceCheckUtils]: 152: Hoare triple {24803#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {24803#false} is VALID [2018-11-14 18:57:27,248 INFO L273 TraceCheckUtils]: 153: Hoare triple {24803#false} assume true; {24803#false} is VALID [2018-11-14 18:57:27,249 INFO L273 TraceCheckUtils]: 154: Hoare triple {24803#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {24803#false} is VALID [2018-11-14 18:57:27,249 INFO L273 TraceCheckUtils]: 155: Hoare triple {24803#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {24803#false} is VALID [2018-11-14 18:57:27,249 INFO L273 TraceCheckUtils]: 156: Hoare triple {24803#false} assume true; {24803#false} is VALID [2018-11-14 18:57:27,249 INFO L273 TraceCheckUtils]: 157: Hoare triple {24803#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {24803#false} is VALID [2018-11-14 18:57:27,249 INFO L273 TraceCheckUtils]: 158: Hoare triple {24803#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {24803#false} is VALID [2018-11-14 18:57:27,249 INFO L273 TraceCheckUtils]: 159: Hoare triple {24803#false} assume true; {24803#false} is VALID [2018-11-14 18:57:27,249 INFO L273 TraceCheckUtils]: 160: Hoare triple {24803#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {24803#false} is VALID [2018-11-14 18:57:27,249 INFO L273 TraceCheckUtils]: 161: Hoare triple {24803#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {24803#false} is VALID [2018-11-14 18:57:27,249 INFO L273 TraceCheckUtils]: 162: Hoare triple {24803#false} assume true; {24803#false} is VALID [2018-11-14 18:57:27,249 INFO L273 TraceCheckUtils]: 163: Hoare triple {24803#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {24803#false} is VALID [2018-11-14 18:57:27,250 INFO L273 TraceCheckUtils]: 164: Hoare triple {24803#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {24803#false} is VALID [2018-11-14 18:57:27,250 INFO L273 TraceCheckUtils]: 165: Hoare triple {24803#false} assume true; {24803#false} is VALID [2018-11-14 18:57:27,250 INFO L273 TraceCheckUtils]: 166: Hoare triple {24803#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {24803#false} is VALID [2018-11-14 18:57:27,250 INFO L273 TraceCheckUtils]: 167: Hoare triple {24803#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {24803#false} is VALID [2018-11-14 18:57:27,250 INFO L273 TraceCheckUtils]: 168: Hoare triple {24803#false} assume true; {24803#false} is VALID [2018-11-14 18:57:27,250 INFO L273 TraceCheckUtils]: 169: Hoare triple {24803#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {24803#false} is VALID [2018-11-14 18:57:27,250 INFO L273 TraceCheckUtils]: 170: Hoare triple {24803#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {24803#false} is VALID [2018-11-14 18:57:27,250 INFO L273 TraceCheckUtils]: 171: Hoare triple {24803#false} assume true; {24803#false} is VALID [2018-11-14 18:57:27,250 INFO L273 TraceCheckUtils]: 172: Hoare triple {24803#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {24803#false} is VALID [2018-11-14 18:57:27,250 INFO L273 TraceCheckUtils]: 173: Hoare triple {24803#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {24803#false} is VALID [2018-11-14 18:57:27,251 INFO L273 TraceCheckUtils]: 174: Hoare triple {24803#false} assume true; {24803#false} is VALID [2018-11-14 18:57:27,251 INFO L273 TraceCheckUtils]: 175: Hoare triple {24803#false} assume !(~i~2 < 99999); {24803#false} is VALID [2018-11-14 18:57:27,251 INFO L273 TraceCheckUtils]: 176: Hoare triple {24803#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {24803#false} is VALID [2018-11-14 18:57:27,251 INFO L256 TraceCheckUtils]: 177: Hoare triple {24803#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {24802#true} is VALID [2018-11-14 18:57:27,251 INFO L273 TraceCheckUtils]: 178: Hoare triple {24802#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {24802#true} is VALID [2018-11-14 18:57:27,251 INFO L273 TraceCheckUtils]: 179: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,251 INFO L273 TraceCheckUtils]: 180: Hoare triple {24802#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 18:57:27,251 INFO L273 TraceCheckUtils]: 181: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 18:57:27,251 INFO L273 TraceCheckUtils]: 182: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,251 INFO L273 TraceCheckUtils]: 183: Hoare triple {24802#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 18:57:27,252 INFO L273 TraceCheckUtils]: 184: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 18:57:27,252 INFO L273 TraceCheckUtils]: 185: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,252 INFO L273 TraceCheckUtils]: 186: Hoare triple {24802#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 18:57:27,252 INFO L273 TraceCheckUtils]: 187: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 18:57:27,252 INFO L273 TraceCheckUtils]: 188: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,252 INFO L273 TraceCheckUtils]: 189: Hoare triple {24802#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 18:57:27,252 INFO L273 TraceCheckUtils]: 190: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 18:57:27,252 INFO L273 TraceCheckUtils]: 191: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,252 INFO L273 TraceCheckUtils]: 192: Hoare triple {24802#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 18:57:27,252 INFO L273 TraceCheckUtils]: 193: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 18:57:27,253 INFO L273 TraceCheckUtils]: 194: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,253 INFO L273 TraceCheckUtils]: 195: Hoare triple {24802#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 18:57:27,253 INFO L273 TraceCheckUtils]: 196: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 18:57:27,253 INFO L273 TraceCheckUtils]: 197: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,253 INFO L273 TraceCheckUtils]: 198: Hoare triple {24802#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 18:57:27,253 INFO L273 TraceCheckUtils]: 199: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 18:57:27,253 INFO L273 TraceCheckUtils]: 200: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,253 INFO L273 TraceCheckUtils]: 201: Hoare triple {24802#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 18:57:27,253 INFO L273 TraceCheckUtils]: 202: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 18:57:27,254 INFO L273 TraceCheckUtils]: 203: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,254 INFO L273 TraceCheckUtils]: 204: Hoare triple {24802#true} assume !(~i~0 < 100000); {24802#true} is VALID [2018-11-14 18:57:27,254 INFO L273 TraceCheckUtils]: 205: Hoare triple {24802#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {24802#true} is VALID [2018-11-14 18:57:27,254 INFO L273 TraceCheckUtils]: 206: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,254 INFO L268 TraceCheckUtils]: 207: Hoare quadruple {24802#true} {24803#false} #77#return; {24803#false} is VALID [2018-11-14 18:57:27,254 INFO L273 TraceCheckUtils]: 208: Hoare triple {24803#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {24803#false} is VALID [2018-11-14 18:57:27,254 INFO L273 TraceCheckUtils]: 209: Hoare triple {24803#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {24803#false} is VALID [2018-11-14 18:57:27,254 INFO L273 TraceCheckUtils]: 210: Hoare triple {24803#false} assume !false; {24803#false} is VALID [2018-11-14 18:57:27,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2174 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2018-11-14 18:57:27,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:57:27,275 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-14 18:57:27,283 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:57:27,508 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-14 18:57:27,508 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:57:27,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:57:27,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:57:27,871 INFO L256 TraceCheckUtils]: 0: Hoare triple {24802#true} call ULTIMATE.init(); {24802#true} is VALID [2018-11-14 18:57:27,871 INFO L273 TraceCheckUtils]: 1: Hoare triple {24802#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24802#true} is VALID [2018-11-14 18:57:27,872 INFO L273 TraceCheckUtils]: 2: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,872 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24802#true} {24802#true} #69#return; {24802#true} is VALID [2018-11-14 18:57:27,872 INFO L256 TraceCheckUtils]: 4: Hoare triple {24802#true} call #t~ret13 := main(); {24802#true} is VALID [2018-11-14 18:57:27,872 INFO L273 TraceCheckUtils]: 5: Hoare triple {24802#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; {24802#true} is VALID [2018-11-14 18:57:27,872 INFO L273 TraceCheckUtils]: 6: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,873 INFO L273 TraceCheckUtils]: 7: Hoare triple {24802#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 18:57:27,873 INFO L273 TraceCheckUtils]: 8: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 18:57:27,873 INFO L273 TraceCheckUtils]: 9: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,873 INFO L273 TraceCheckUtils]: 10: Hoare triple {24802#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 18:57:27,873 INFO L273 TraceCheckUtils]: 11: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 18:57:27,873 INFO L273 TraceCheckUtils]: 12: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,873 INFO L273 TraceCheckUtils]: 13: Hoare triple {24802#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 18:57:27,873 INFO L273 TraceCheckUtils]: 14: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 18:57:27,873 INFO L273 TraceCheckUtils]: 15: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,874 INFO L273 TraceCheckUtils]: 16: Hoare triple {24802#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 18:57:27,874 INFO L273 TraceCheckUtils]: 17: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 18:57:27,874 INFO L273 TraceCheckUtils]: 18: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,874 INFO L273 TraceCheckUtils]: 19: Hoare triple {24802#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 18:57:27,874 INFO L273 TraceCheckUtils]: 20: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 18:57:27,874 INFO L273 TraceCheckUtils]: 21: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,874 INFO L273 TraceCheckUtils]: 22: Hoare triple {24802#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 18:57:27,874 INFO L273 TraceCheckUtils]: 23: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 18:57:27,874 INFO L273 TraceCheckUtils]: 24: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,874 INFO L273 TraceCheckUtils]: 25: Hoare triple {24802#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 18:57:27,875 INFO L273 TraceCheckUtils]: 26: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 18:57:27,875 INFO L273 TraceCheckUtils]: 27: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,875 INFO L273 TraceCheckUtils]: 28: Hoare triple {24802#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 18:57:27,875 INFO L273 TraceCheckUtils]: 29: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 18:57:27,875 INFO L273 TraceCheckUtils]: 30: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,875 INFO L273 TraceCheckUtils]: 31: Hoare triple {24802#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 18:57:27,875 INFO L273 TraceCheckUtils]: 32: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 18:57:27,875 INFO L273 TraceCheckUtils]: 33: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,875 INFO L273 TraceCheckUtils]: 34: Hoare triple {24802#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 18:57:27,875 INFO L273 TraceCheckUtils]: 35: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 18:57:27,876 INFO L273 TraceCheckUtils]: 36: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,876 INFO L273 TraceCheckUtils]: 37: Hoare triple {24802#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 18:57:27,876 INFO L273 TraceCheckUtils]: 38: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 18:57:27,876 INFO L273 TraceCheckUtils]: 39: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,876 INFO L273 TraceCheckUtils]: 40: Hoare triple {24802#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 18:57:27,876 INFO L273 TraceCheckUtils]: 41: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 18:57:27,876 INFO L273 TraceCheckUtils]: 42: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,876 INFO L273 TraceCheckUtils]: 43: Hoare triple {24802#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 18:57:27,876 INFO L273 TraceCheckUtils]: 44: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 18:57:27,876 INFO L273 TraceCheckUtils]: 45: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,877 INFO L273 TraceCheckUtils]: 46: Hoare triple {24802#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 18:57:27,877 INFO L273 TraceCheckUtils]: 47: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 18:57:27,877 INFO L273 TraceCheckUtils]: 48: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,877 INFO L273 TraceCheckUtils]: 49: Hoare triple {24802#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 18:57:27,877 INFO L273 TraceCheckUtils]: 50: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 18:57:27,877 INFO L273 TraceCheckUtils]: 51: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,877 INFO L273 TraceCheckUtils]: 52: Hoare triple {24802#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 18:57:27,877 INFO L273 TraceCheckUtils]: 53: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 18:57:27,877 INFO L273 TraceCheckUtils]: 54: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,877 INFO L273 TraceCheckUtils]: 55: Hoare triple {24802#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 18:57:27,878 INFO L273 TraceCheckUtils]: 56: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 18:57:27,878 INFO L273 TraceCheckUtils]: 57: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,878 INFO L273 TraceCheckUtils]: 58: Hoare triple {24802#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 18:57:27,878 INFO L273 TraceCheckUtils]: 59: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 18:57:27,878 INFO L273 TraceCheckUtils]: 60: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,878 INFO L273 TraceCheckUtils]: 61: Hoare triple {24802#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 18:57:27,878 INFO L273 TraceCheckUtils]: 62: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 18:57:27,878 INFO L273 TraceCheckUtils]: 63: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,878 INFO L273 TraceCheckUtils]: 64: Hoare triple {24802#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 18:57:27,878 INFO L273 TraceCheckUtils]: 65: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 18:57:27,879 INFO L273 TraceCheckUtils]: 66: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,879 INFO L273 TraceCheckUtils]: 67: Hoare triple {24802#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 18:57:27,879 INFO L273 TraceCheckUtils]: 68: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 18:57:27,879 INFO L273 TraceCheckUtils]: 69: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,879 INFO L273 TraceCheckUtils]: 70: Hoare triple {24802#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 18:57:27,879 INFO L273 TraceCheckUtils]: 71: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 18:57:27,879 INFO L273 TraceCheckUtils]: 72: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,879 INFO L273 TraceCheckUtils]: 73: Hoare triple {24802#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 18:57:27,879 INFO L273 TraceCheckUtils]: 74: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 18:57:27,879 INFO L273 TraceCheckUtils]: 75: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,880 INFO L273 TraceCheckUtils]: 76: Hoare triple {24802#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 18:57:27,880 INFO L273 TraceCheckUtils]: 77: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 18:57:27,880 INFO L273 TraceCheckUtils]: 78: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,880 INFO L273 TraceCheckUtils]: 79: Hoare triple {24802#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 18:57:27,880 INFO L273 TraceCheckUtils]: 80: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 18:57:27,880 INFO L273 TraceCheckUtils]: 81: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,880 INFO L273 TraceCheckUtils]: 82: Hoare triple {24802#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 18:57:27,880 INFO L273 TraceCheckUtils]: 83: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 18:57:27,880 INFO L273 TraceCheckUtils]: 84: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,880 INFO L273 TraceCheckUtils]: 85: Hoare triple {24802#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24802#true} is VALID [2018-11-14 18:57:27,881 INFO L273 TraceCheckUtils]: 86: Hoare triple {24802#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24802#true} is VALID [2018-11-14 18:57:27,881 INFO L273 TraceCheckUtils]: 87: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,881 INFO L273 TraceCheckUtils]: 88: Hoare triple {24802#true} assume !(~i~1 < 100000); {24802#true} is VALID [2018-11-14 18:57:27,881 INFO L256 TraceCheckUtils]: 89: Hoare triple {24802#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {24802#true} is VALID [2018-11-14 18:57:27,881 INFO L273 TraceCheckUtils]: 90: Hoare triple {24802#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {24802#true} is VALID [2018-11-14 18:57:27,881 INFO L273 TraceCheckUtils]: 91: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,881 INFO L273 TraceCheckUtils]: 92: Hoare triple {24802#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 18:57:27,881 INFO L273 TraceCheckUtils]: 93: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 18:57:27,881 INFO L273 TraceCheckUtils]: 94: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,881 INFO L273 TraceCheckUtils]: 95: Hoare triple {24802#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 18:57:27,882 INFO L273 TraceCheckUtils]: 96: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 18:57:27,882 INFO L273 TraceCheckUtils]: 97: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,882 INFO L273 TraceCheckUtils]: 98: Hoare triple {24802#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 18:57:27,882 INFO L273 TraceCheckUtils]: 99: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 18:57:27,882 INFO L273 TraceCheckUtils]: 100: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,882 INFO L273 TraceCheckUtils]: 101: Hoare triple {24802#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 18:57:27,882 INFO L273 TraceCheckUtils]: 102: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 18:57:27,882 INFO L273 TraceCheckUtils]: 103: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,882 INFO L273 TraceCheckUtils]: 104: Hoare triple {24802#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 18:57:27,882 INFO L273 TraceCheckUtils]: 105: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 18:57:27,883 INFO L273 TraceCheckUtils]: 106: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,883 INFO L273 TraceCheckUtils]: 107: Hoare triple {24802#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 18:57:27,883 INFO L273 TraceCheckUtils]: 108: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 18:57:27,883 INFO L273 TraceCheckUtils]: 109: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,883 INFO L273 TraceCheckUtils]: 110: Hoare triple {24802#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 18:57:27,883 INFO L273 TraceCheckUtils]: 111: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 18:57:27,883 INFO L273 TraceCheckUtils]: 112: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,883 INFO L273 TraceCheckUtils]: 113: Hoare triple {24802#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 18:57:27,883 INFO L273 TraceCheckUtils]: 114: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 18:57:27,883 INFO L273 TraceCheckUtils]: 115: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,884 INFO L273 TraceCheckUtils]: 116: Hoare triple {24802#true} assume !(~i~0 < 100000); {24802#true} is VALID [2018-11-14 18:57:27,884 INFO L273 TraceCheckUtils]: 117: Hoare triple {24802#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {24802#true} is VALID [2018-11-14 18:57:27,884 INFO L273 TraceCheckUtils]: 118: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,884 INFO L268 TraceCheckUtils]: 119: Hoare quadruple {24802#true} {24802#true} #73#return; {24802#true} is VALID [2018-11-14 18:57:27,884 INFO L273 TraceCheckUtils]: 120: Hoare triple {24802#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {24802#true} is VALID [2018-11-14 18:57:27,884 INFO L256 TraceCheckUtils]: 121: Hoare triple {24802#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {24802#true} is VALID [2018-11-14 18:57:27,884 INFO L273 TraceCheckUtils]: 122: Hoare triple {24802#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {24802#true} is VALID [2018-11-14 18:57:27,884 INFO L273 TraceCheckUtils]: 123: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,884 INFO L273 TraceCheckUtils]: 124: Hoare triple {24802#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 18:57:27,885 INFO L273 TraceCheckUtils]: 125: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 18:57:27,885 INFO L273 TraceCheckUtils]: 126: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,885 INFO L273 TraceCheckUtils]: 127: Hoare triple {24802#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 18:57:27,885 INFO L273 TraceCheckUtils]: 128: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 18:57:27,885 INFO L273 TraceCheckUtils]: 129: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,885 INFO L273 TraceCheckUtils]: 130: Hoare triple {24802#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 18:57:27,885 INFO L273 TraceCheckUtils]: 131: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 18:57:27,885 INFO L273 TraceCheckUtils]: 132: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,885 INFO L273 TraceCheckUtils]: 133: Hoare triple {24802#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 18:57:27,885 INFO L273 TraceCheckUtils]: 134: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 18:57:27,886 INFO L273 TraceCheckUtils]: 135: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,886 INFO L273 TraceCheckUtils]: 136: Hoare triple {24802#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 18:57:27,886 INFO L273 TraceCheckUtils]: 137: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 18:57:27,886 INFO L273 TraceCheckUtils]: 138: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,886 INFO L273 TraceCheckUtils]: 139: Hoare triple {24802#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 18:57:27,886 INFO L273 TraceCheckUtils]: 140: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 18:57:27,886 INFO L273 TraceCheckUtils]: 141: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,886 INFO L273 TraceCheckUtils]: 142: Hoare triple {24802#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 18:57:27,886 INFO L273 TraceCheckUtils]: 143: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 18:57:27,886 INFO L273 TraceCheckUtils]: 144: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,887 INFO L273 TraceCheckUtils]: 145: Hoare triple {24802#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24802#true} is VALID [2018-11-14 18:57:27,887 INFO L273 TraceCheckUtils]: 146: Hoare triple {24802#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24802#true} is VALID [2018-11-14 18:57:27,887 INFO L273 TraceCheckUtils]: 147: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,887 INFO L273 TraceCheckUtils]: 148: Hoare triple {24802#true} assume !(~i~0 < 100000); {24802#true} is VALID [2018-11-14 18:57:27,887 INFO L273 TraceCheckUtils]: 149: Hoare triple {24802#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {24802#true} is VALID [2018-11-14 18:57:27,887 INFO L273 TraceCheckUtils]: 150: Hoare triple {24802#true} assume true; {24802#true} is VALID [2018-11-14 18:57:27,887 INFO L268 TraceCheckUtils]: 151: Hoare quadruple {24802#true} {24802#true} #75#return; {24802#true} is VALID [2018-11-14 18:57:27,888 INFO L273 TraceCheckUtils]: 152: Hoare triple {24802#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {25291#(<= main_~i~2 0)} is VALID [2018-11-14 18:57:27,888 INFO L273 TraceCheckUtils]: 153: Hoare triple {25291#(<= main_~i~2 0)} assume true; {25291#(<= main_~i~2 0)} is VALID [2018-11-14 18:57:27,888 INFO L273 TraceCheckUtils]: 154: Hoare triple {25291#(<= main_~i~2 0)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {25291#(<= main_~i~2 0)} is VALID [2018-11-14 18:57:27,889 INFO L273 TraceCheckUtils]: 155: Hoare triple {25291#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {25301#(<= main_~i~2 1)} is VALID [2018-11-14 18:57:27,889 INFO L273 TraceCheckUtils]: 156: Hoare triple {25301#(<= main_~i~2 1)} assume true; {25301#(<= main_~i~2 1)} is VALID [2018-11-14 18:57:27,889 INFO L273 TraceCheckUtils]: 157: Hoare triple {25301#(<= main_~i~2 1)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {25301#(<= main_~i~2 1)} is VALID [2018-11-14 18:57:27,890 INFO L273 TraceCheckUtils]: 158: Hoare triple {25301#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {25311#(<= main_~i~2 2)} is VALID [2018-11-14 18:57:27,890 INFO L273 TraceCheckUtils]: 159: Hoare triple {25311#(<= main_~i~2 2)} assume true; {25311#(<= main_~i~2 2)} is VALID [2018-11-14 18:57:27,890 INFO L273 TraceCheckUtils]: 160: Hoare triple {25311#(<= main_~i~2 2)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {25311#(<= main_~i~2 2)} is VALID [2018-11-14 18:57:27,891 INFO L273 TraceCheckUtils]: 161: Hoare triple {25311#(<= main_~i~2 2)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {25321#(<= main_~i~2 3)} is VALID [2018-11-14 18:57:27,891 INFO L273 TraceCheckUtils]: 162: Hoare triple {25321#(<= main_~i~2 3)} assume true; {25321#(<= main_~i~2 3)} is VALID [2018-11-14 18:57:27,891 INFO L273 TraceCheckUtils]: 163: Hoare triple {25321#(<= main_~i~2 3)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {25321#(<= main_~i~2 3)} is VALID [2018-11-14 18:57:27,892 INFO L273 TraceCheckUtils]: 164: Hoare triple {25321#(<= main_~i~2 3)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {25331#(<= main_~i~2 4)} is VALID [2018-11-14 18:57:27,892 INFO L273 TraceCheckUtils]: 165: Hoare triple {25331#(<= main_~i~2 4)} assume true; {25331#(<= main_~i~2 4)} is VALID [2018-11-14 18:57:27,893 INFO L273 TraceCheckUtils]: 166: Hoare triple {25331#(<= main_~i~2 4)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {25331#(<= main_~i~2 4)} is VALID [2018-11-14 18:57:27,893 INFO L273 TraceCheckUtils]: 167: Hoare triple {25331#(<= main_~i~2 4)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {25341#(<= main_~i~2 5)} is VALID [2018-11-14 18:57:27,894 INFO L273 TraceCheckUtils]: 168: Hoare triple {25341#(<= main_~i~2 5)} assume true; {25341#(<= main_~i~2 5)} is VALID [2018-11-14 18:57:27,894 INFO L273 TraceCheckUtils]: 169: Hoare triple {25341#(<= main_~i~2 5)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {25341#(<= main_~i~2 5)} is VALID [2018-11-14 18:57:27,895 INFO L273 TraceCheckUtils]: 170: Hoare triple {25341#(<= main_~i~2 5)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {25351#(<= main_~i~2 6)} is VALID [2018-11-14 18:57:27,895 INFO L273 TraceCheckUtils]: 171: Hoare triple {25351#(<= main_~i~2 6)} assume true; {25351#(<= main_~i~2 6)} is VALID [2018-11-14 18:57:27,896 INFO L273 TraceCheckUtils]: 172: Hoare triple {25351#(<= main_~i~2 6)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {25351#(<= main_~i~2 6)} is VALID [2018-11-14 18:57:27,896 INFO L273 TraceCheckUtils]: 173: Hoare triple {25351#(<= main_~i~2 6)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {25361#(<= main_~i~2 7)} is VALID [2018-11-14 18:57:27,897 INFO L273 TraceCheckUtils]: 174: Hoare triple {25361#(<= main_~i~2 7)} assume true; {25361#(<= main_~i~2 7)} is VALID [2018-11-14 18:57:27,897 INFO L273 TraceCheckUtils]: 175: Hoare triple {25361#(<= main_~i~2 7)} assume !(~i~2 < 99999); {24803#false} is VALID [2018-11-14 18:57:27,898 INFO L273 TraceCheckUtils]: 176: Hoare triple {24803#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {24803#false} is VALID [2018-11-14 18:57:27,898 INFO L256 TraceCheckUtils]: 177: Hoare triple {24803#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {24803#false} is VALID [2018-11-14 18:57:27,898 INFO L273 TraceCheckUtils]: 178: Hoare triple {24803#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {24803#false} is VALID [2018-11-14 18:57:27,898 INFO L273 TraceCheckUtils]: 179: Hoare triple {24803#false} assume true; {24803#false} is VALID [2018-11-14 18:57:27,898 INFO L273 TraceCheckUtils]: 180: Hoare triple {24803#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24803#false} is VALID [2018-11-14 18:57:27,898 INFO L273 TraceCheckUtils]: 181: Hoare triple {24803#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24803#false} is VALID [2018-11-14 18:57:27,899 INFO L273 TraceCheckUtils]: 182: Hoare triple {24803#false} assume true; {24803#false} is VALID [2018-11-14 18:57:27,899 INFO L273 TraceCheckUtils]: 183: Hoare triple {24803#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24803#false} is VALID [2018-11-14 18:57:27,899 INFO L273 TraceCheckUtils]: 184: Hoare triple {24803#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24803#false} is VALID [2018-11-14 18:57:27,899 INFO L273 TraceCheckUtils]: 185: Hoare triple {24803#false} assume true; {24803#false} is VALID [2018-11-14 18:57:27,899 INFO L273 TraceCheckUtils]: 186: Hoare triple {24803#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24803#false} is VALID [2018-11-14 18:57:27,899 INFO L273 TraceCheckUtils]: 187: Hoare triple {24803#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24803#false} is VALID [2018-11-14 18:57:27,900 INFO L273 TraceCheckUtils]: 188: Hoare triple {24803#false} assume true; {24803#false} is VALID [2018-11-14 18:57:27,900 INFO L273 TraceCheckUtils]: 189: Hoare triple {24803#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24803#false} is VALID [2018-11-14 18:57:27,900 INFO L273 TraceCheckUtils]: 190: Hoare triple {24803#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24803#false} is VALID [2018-11-14 18:57:27,900 INFO L273 TraceCheckUtils]: 191: Hoare triple {24803#false} assume true; {24803#false} is VALID [2018-11-14 18:57:27,900 INFO L273 TraceCheckUtils]: 192: Hoare triple {24803#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24803#false} is VALID [2018-11-14 18:57:27,900 INFO L273 TraceCheckUtils]: 193: Hoare triple {24803#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24803#false} is VALID [2018-11-14 18:57:27,901 INFO L273 TraceCheckUtils]: 194: Hoare triple {24803#false} assume true; {24803#false} is VALID [2018-11-14 18:57:27,901 INFO L273 TraceCheckUtils]: 195: Hoare triple {24803#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24803#false} is VALID [2018-11-14 18:57:27,901 INFO L273 TraceCheckUtils]: 196: Hoare triple {24803#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24803#false} is VALID [2018-11-14 18:57:27,901 INFO L273 TraceCheckUtils]: 197: Hoare triple {24803#false} assume true; {24803#false} is VALID [2018-11-14 18:57:27,901 INFO L273 TraceCheckUtils]: 198: Hoare triple {24803#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24803#false} is VALID [2018-11-14 18:57:27,901 INFO L273 TraceCheckUtils]: 199: Hoare triple {24803#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24803#false} is VALID [2018-11-14 18:57:27,902 INFO L273 TraceCheckUtils]: 200: Hoare triple {24803#false} assume true; {24803#false} is VALID [2018-11-14 18:57:27,902 INFO L273 TraceCheckUtils]: 201: Hoare triple {24803#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24803#false} is VALID [2018-11-14 18:57:27,902 INFO L273 TraceCheckUtils]: 202: Hoare triple {24803#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24803#false} is VALID [2018-11-14 18:57:27,902 INFO L273 TraceCheckUtils]: 203: Hoare triple {24803#false} assume true; {24803#false} is VALID [2018-11-14 18:57:27,902 INFO L273 TraceCheckUtils]: 204: Hoare triple {24803#false} assume !(~i~0 < 100000); {24803#false} is VALID [2018-11-14 18:57:27,902 INFO L273 TraceCheckUtils]: 205: Hoare triple {24803#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {24803#false} is VALID [2018-11-14 18:57:27,902 INFO L273 TraceCheckUtils]: 206: Hoare triple {24803#false} assume true; {24803#false} is VALID [2018-11-14 18:57:27,902 INFO L268 TraceCheckUtils]: 207: Hoare quadruple {24803#false} {24803#false} #77#return; {24803#false} is VALID [2018-11-14 18:57:27,903 INFO L273 TraceCheckUtils]: 208: Hoare triple {24803#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {24803#false} is VALID [2018-11-14 18:57:27,903 INFO L273 TraceCheckUtils]: 209: Hoare triple {24803#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {24803#false} is VALID [2018-11-14 18:57:27,903 INFO L273 TraceCheckUtils]: 210: Hoare triple {24803#false} assume !false; {24803#false} is VALID [2018-11-14 18:57:27,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2174 backedges. 460 proven. 77 refuted. 0 times theorem prover too weak. 1637 trivial. 0 not checked. [2018-11-14 18:57:27,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:57:27,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 10] total 38 [2018-11-14 18:57:27,941 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 211 [2018-11-14 18:57:27,941 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:57:27,941 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-14 18:57:28,161 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:57:28,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-14 18:57:28,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-14 18:57:28,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=479, Invalid=927, Unknown=0, NotChecked=0, Total=1406 [2018-11-14 18:57:28,163 INFO L87 Difference]: Start difference. First operand 152 states and 156 transitions. Second operand 38 states. [2018-11-14 18:57:29,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:57:29,178 INFO L93 Difference]: Finished difference Result 223 states and 232 transitions. [2018-11-14 18:57:29,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-14 18:57:29,178 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 211 [2018-11-14 18:57:29,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:57:29,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 18:57:29,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 166 transitions. [2018-11-14 18:57:29,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 18:57:29,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 166 transitions. [2018-11-14 18:57:29,180 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 166 transitions. [2018-11-14 18:57:29,389 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:57:29,392 INFO L225 Difference]: With dead ends: 223 [2018-11-14 18:57:29,392 INFO L226 Difference]: Without dead ends: 160 [2018-11-14 18:57:29,392 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=479, Invalid=927, Unknown=0, NotChecked=0, Total=1406 [2018-11-14 18:57:29,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-14 18:57:29,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2018-11-14 18:57:29,561 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:57:29,561 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand 158 states. [2018-11-14 18:57:29,561 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 158 states. [2018-11-14 18:57:29,561 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 158 states. [2018-11-14 18:57:29,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:57:29,563 INFO L93 Difference]: Finished difference Result 160 states and 164 transitions. [2018-11-14 18:57:29,563 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 164 transitions. [2018-11-14 18:57:29,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:57:29,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:57:29,564 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 160 states. [2018-11-14 18:57:29,564 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 160 states. [2018-11-14 18:57:29,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:57:29,567 INFO L93 Difference]: Finished difference Result 160 states and 164 transitions. [2018-11-14 18:57:29,567 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 164 transitions. [2018-11-14 18:57:29,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:57:29,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:57:29,568 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:57:29,568 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:57:29,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-14 18:57:29,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 162 transitions. [2018-11-14 18:57:29,571 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 162 transitions. Word has length 211 [2018-11-14 18:57:29,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:57:29,571 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 162 transitions. [2018-11-14 18:57:29,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-14 18:57:29,571 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 162 transitions. [2018-11-14 18:57:29,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-11-14 18:57:29,572 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:57:29,573 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 28, 27, 24, 24, 9, 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-14 18:57:29,573 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:57:29,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:57:29,573 INFO L82 PathProgramCache]: Analyzing trace with hash 706408656, now seen corresponding path program 28 times [2018-11-14 18:57:29,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:57:29,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:57:29,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:57:29,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:57:29,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:57:29,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:57:30,467 INFO L256 TraceCheckUtils]: 0: Hoare triple {26304#true} call ULTIMATE.init(); {26304#true} is VALID [2018-11-14 18:57:30,467 INFO L273 TraceCheckUtils]: 1: Hoare triple {26304#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26304#true} is VALID [2018-11-14 18:57:30,467 INFO L273 TraceCheckUtils]: 2: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 18:57:30,468 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26304#true} {26304#true} #69#return; {26304#true} is VALID [2018-11-14 18:57:30,468 INFO L256 TraceCheckUtils]: 4: Hoare triple {26304#true} call #t~ret13 := main(); {26304#true} is VALID [2018-11-14 18:57:30,468 INFO L273 TraceCheckUtils]: 5: Hoare triple {26304#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; {26306#(= main_~i~1 0)} is VALID [2018-11-14 18:57:30,469 INFO L273 TraceCheckUtils]: 6: Hoare triple {26306#(= main_~i~1 0)} assume true; {26306#(= main_~i~1 0)} is VALID [2018-11-14 18:57:30,469 INFO L273 TraceCheckUtils]: 7: Hoare triple {26306#(= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26306#(= main_~i~1 0)} is VALID [2018-11-14 18:57:30,470 INFO L273 TraceCheckUtils]: 8: Hoare triple {26306#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26307#(<= main_~i~1 1)} is VALID [2018-11-14 18:57:30,470 INFO L273 TraceCheckUtils]: 9: Hoare triple {26307#(<= main_~i~1 1)} assume true; {26307#(<= main_~i~1 1)} is VALID [2018-11-14 18:57:30,470 INFO L273 TraceCheckUtils]: 10: Hoare triple {26307#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26307#(<= main_~i~1 1)} is VALID [2018-11-14 18:57:30,471 INFO L273 TraceCheckUtils]: 11: Hoare triple {26307#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26308#(<= main_~i~1 2)} is VALID [2018-11-14 18:57:30,471 INFO L273 TraceCheckUtils]: 12: Hoare triple {26308#(<= main_~i~1 2)} assume true; {26308#(<= main_~i~1 2)} is VALID [2018-11-14 18:57:30,471 INFO L273 TraceCheckUtils]: 13: Hoare triple {26308#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26308#(<= main_~i~1 2)} is VALID [2018-11-14 18:57:30,472 INFO L273 TraceCheckUtils]: 14: Hoare triple {26308#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26309#(<= main_~i~1 3)} is VALID [2018-11-14 18:57:30,472 INFO L273 TraceCheckUtils]: 15: Hoare triple {26309#(<= main_~i~1 3)} assume true; {26309#(<= main_~i~1 3)} is VALID [2018-11-14 18:57:30,472 INFO L273 TraceCheckUtils]: 16: Hoare triple {26309#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26309#(<= main_~i~1 3)} is VALID [2018-11-14 18:57:30,473 INFO L273 TraceCheckUtils]: 17: Hoare triple {26309#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26310#(<= main_~i~1 4)} is VALID [2018-11-14 18:57:30,473 INFO L273 TraceCheckUtils]: 18: Hoare triple {26310#(<= main_~i~1 4)} assume true; {26310#(<= main_~i~1 4)} is VALID [2018-11-14 18:57:30,474 INFO L273 TraceCheckUtils]: 19: Hoare triple {26310#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26310#(<= main_~i~1 4)} is VALID [2018-11-14 18:57:30,475 INFO L273 TraceCheckUtils]: 20: Hoare triple {26310#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26311#(<= main_~i~1 5)} is VALID [2018-11-14 18:57:30,475 INFO L273 TraceCheckUtils]: 21: Hoare triple {26311#(<= main_~i~1 5)} assume true; {26311#(<= main_~i~1 5)} is VALID [2018-11-14 18:57:30,476 INFO L273 TraceCheckUtils]: 22: Hoare triple {26311#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26311#(<= main_~i~1 5)} is VALID [2018-11-14 18:57:30,476 INFO L273 TraceCheckUtils]: 23: Hoare triple {26311#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26312#(<= main_~i~1 6)} is VALID [2018-11-14 18:57:30,477 INFO L273 TraceCheckUtils]: 24: Hoare triple {26312#(<= main_~i~1 6)} assume true; {26312#(<= main_~i~1 6)} is VALID [2018-11-14 18:57:30,477 INFO L273 TraceCheckUtils]: 25: Hoare triple {26312#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26312#(<= main_~i~1 6)} is VALID [2018-11-14 18:57:30,478 INFO L273 TraceCheckUtils]: 26: Hoare triple {26312#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26313#(<= main_~i~1 7)} is VALID [2018-11-14 18:57:30,478 INFO L273 TraceCheckUtils]: 27: Hoare triple {26313#(<= main_~i~1 7)} assume true; {26313#(<= main_~i~1 7)} is VALID [2018-11-14 18:57:30,479 INFO L273 TraceCheckUtils]: 28: Hoare triple {26313#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26313#(<= main_~i~1 7)} is VALID [2018-11-14 18:57:30,479 INFO L273 TraceCheckUtils]: 29: Hoare triple {26313#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26314#(<= main_~i~1 8)} is VALID [2018-11-14 18:57:30,480 INFO L273 TraceCheckUtils]: 30: Hoare triple {26314#(<= main_~i~1 8)} assume true; {26314#(<= main_~i~1 8)} is VALID [2018-11-14 18:57:30,480 INFO L273 TraceCheckUtils]: 31: Hoare triple {26314#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26314#(<= main_~i~1 8)} is VALID [2018-11-14 18:57:30,481 INFO L273 TraceCheckUtils]: 32: Hoare triple {26314#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26315#(<= main_~i~1 9)} is VALID [2018-11-14 18:57:30,481 INFO L273 TraceCheckUtils]: 33: Hoare triple {26315#(<= main_~i~1 9)} assume true; {26315#(<= main_~i~1 9)} is VALID [2018-11-14 18:57:30,482 INFO L273 TraceCheckUtils]: 34: Hoare triple {26315#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26315#(<= main_~i~1 9)} is VALID [2018-11-14 18:57:30,483 INFO L273 TraceCheckUtils]: 35: Hoare triple {26315#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26316#(<= main_~i~1 10)} is VALID [2018-11-14 18:57:30,483 INFO L273 TraceCheckUtils]: 36: Hoare triple {26316#(<= main_~i~1 10)} assume true; {26316#(<= main_~i~1 10)} is VALID [2018-11-14 18:57:30,484 INFO L273 TraceCheckUtils]: 37: Hoare triple {26316#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26316#(<= main_~i~1 10)} is VALID [2018-11-14 18:57:30,484 INFO L273 TraceCheckUtils]: 38: Hoare triple {26316#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26317#(<= main_~i~1 11)} is VALID [2018-11-14 18:57:30,485 INFO L273 TraceCheckUtils]: 39: Hoare triple {26317#(<= main_~i~1 11)} assume true; {26317#(<= main_~i~1 11)} is VALID [2018-11-14 18:57:30,485 INFO L273 TraceCheckUtils]: 40: Hoare triple {26317#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26317#(<= main_~i~1 11)} is VALID [2018-11-14 18:57:30,486 INFO L273 TraceCheckUtils]: 41: Hoare triple {26317#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26318#(<= main_~i~1 12)} is VALID [2018-11-14 18:57:30,486 INFO L273 TraceCheckUtils]: 42: Hoare triple {26318#(<= main_~i~1 12)} assume true; {26318#(<= main_~i~1 12)} is VALID [2018-11-14 18:57:30,487 INFO L273 TraceCheckUtils]: 43: Hoare triple {26318#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26318#(<= main_~i~1 12)} is VALID [2018-11-14 18:57:30,487 INFO L273 TraceCheckUtils]: 44: Hoare triple {26318#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26319#(<= main_~i~1 13)} is VALID [2018-11-14 18:57:30,488 INFO L273 TraceCheckUtils]: 45: Hoare triple {26319#(<= main_~i~1 13)} assume true; {26319#(<= main_~i~1 13)} is VALID [2018-11-14 18:57:30,488 INFO L273 TraceCheckUtils]: 46: Hoare triple {26319#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26319#(<= main_~i~1 13)} is VALID [2018-11-14 18:57:30,489 INFO L273 TraceCheckUtils]: 47: Hoare triple {26319#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26320#(<= main_~i~1 14)} is VALID [2018-11-14 18:57:30,490 INFO L273 TraceCheckUtils]: 48: Hoare triple {26320#(<= main_~i~1 14)} assume true; {26320#(<= main_~i~1 14)} is VALID [2018-11-14 18:57:30,490 INFO L273 TraceCheckUtils]: 49: Hoare triple {26320#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26320#(<= main_~i~1 14)} is VALID [2018-11-14 18:57:30,491 INFO L273 TraceCheckUtils]: 50: Hoare triple {26320#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26321#(<= main_~i~1 15)} is VALID [2018-11-14 18:57:30,491 INFO L273 TraceCheckUtils]: 51: Hoare triple {26321#(<= main_~i~1 15)} assume true; {26321#(<= main_~i~1 15)} is VALID [2018-11-14 18:57:30,492 INFO L273 TraceCheckUtils]: 52: Hoare triple {26321#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26321#(<= main_~i~1 15)} is VALID [2018-11-14 18:57:30,492 INFO L273 TraceCheckUtils]: 53: Hoare triple {26321#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26322#(<= main_~i~1 16)} is VALID [2018-11-14 18:57:30,493 INFO L273 TraceCheckUtils]: 54: Hoare triple {26322#(<= main_~i~1 16)} assume true; {26322#(<= main_~i~1 16)} is VALID [2018-11-14 18:57:30,493 INFO L273 TraceCheckUtils]: 55: Hoare triple {26322#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26322#(<= main_~i~1 16)} is VALID [2018-11-14 18:57:30,494 INFO L273 TraceCheckUtils]: 56: Hoare triple {26322#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26323#(<= main_~i~1 17)} is VALID [2018-11-14 18:57:30,494 INFO L273 TraceCheckUtils]: 57: Hoare triple {26323#(<= main_~i~1 17)} assume true; {26323#(<= main_~i~1 17)} is VALID [2018-11-14 18:57:30,495 INFO L273 TraceCheckUtils]: 58: Hoare triple {26323#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26323#(<= main_~i~1 17)} is VALID [2018-11-14 18:57:30,495 INFO L273 TraceCheckUtils]: 59: Hoare triple {26323#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26324#(<= main_~i~1 18)} is VALID [2018-11-14 18:57:30,496 INFO L273 TraceCheckUtils]: 60: Hoare triple {26324#(<= main_~i~1 18)} assume true; {26324#(<= main_~i~1 18)} is VALID [2018-11-14 18:57:30,496 INFO L273 TraceCheckUtils]: 61: Hoare triple {26324#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26324#(<= main_~i~1 18)} is VALID [2018-11-14 18:57:30,497 INFO L273 TraceCheckUtils]: 62: Hoare triple {26324#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26325#(<= main_~i~1 19)} is VALID [2018-11-14 18:57:30,498 INFO L273 TraceCheckUtils]: 63: Hoare triple {26325#(<= main_~i~1 19)} assume true; {26325#(<= main_~i~1 19)} is VALID [2018-11-14 18:57:30,498 INFO L273 TraceCheckUtils]: 64: Hoare triple {26325#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26325#(<= main_~i~1 19)} is VALID [2018-11-14 18:57:30,499 INFO L273 TraceCheckUtils]: 65: Hoare triple {26325#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26326#(<= main_~i~1 20)} is VALID [2018-11-14 18:57:30,499 INFO L273 TraceCheckUtils]: 66: Hoare triple {26326#(<= main_~i~1 20)} assume true; {26326#(<= main_~i~1 20)} is VALID [2018-11-14 18:57:30,500 INFO L273 TraceCheckUtils]: 67: Hoare triple {26326#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26326#(<= main_~i~1 20)} is VALID [2018-11-14 18:57:30,500 INFO L273 TraceCheckUtils]: 68: Hoare triple {26326#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26327#(<= main_~i~1 21)} is VALID [2018-11-14 18:57:30,501 INFO L273 TraceCheckUtils]: 69: Hoare triple {26327#(<= main_~i~1 21)} assume true; {26327#(<= main_~i~1 21)} is VALID [2018-11-14 18:57:30,501 INFO L273 TraceCheckUtils]: 70: Hoare triple {26327#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26327#(<= main_~i~1 21)} is VALID [2018-11-14 18:57:30,502 INFO L273 TraceCheckUtils]: 71: Hoare triple {26327#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26328#(<= main_~i~1 22)} is VALID [2018-11-14 18:57:30,502 INFO L273 TraceCheckUtils]: 72: Hoare triple {26328#(<= main_~i~1 22)} assume true; {26328#(<= main_~i~1 22)} is VALID [2018-11-14 18:57:30,503 INFO L273 TraceCheckUtils]: 73: Hoare triple {26328#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26328#(<= main_~i~1 22)} is VALID [2018-11-14 18:57:30,504 INFO L273 TraceCheckUtils]: 74: Hoare triple {26328#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26329#(<= main_~i~1 23)} is VALID [2018-11-14 18:57:30,504 INFO L273 TraceCheckUtils]: 75: Hoare triple {26329#(<= main_~i~1 23)} assume true; {26329#(<= main_~i~1 23)} is VALID [2018-11-14 18:57:30,504 INFO L273 TraceCheckUtils]: 76: Hoare triple {26329#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26329#(<= main_~i~1 23)} is VALID [2018-11-14 18:57:30,505 INFO L273 TraceCheckUtils]: 77: Hoare triple {26329#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26330#(<= main_~i~1 24)} is VALID [2018-11-14 18:57:30,506 INFO L273 TraceCheckUtils]: 78: Hoare triple {26330#(<= main_~i~1 24)} assume true; {26330#(<= main_~i~1 24)} is VALID [2018-11-14 18:57:30,506 INFO L273 TraceCheckUtils]: 79: Hoare triple {26330#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26330#(<= main_~i~1 24)} is VALID [2018-11-14 18:57:30,507 INFO L273 TraceCheckUtils]: 80: Hoare triple {26330#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26331#(<= main_~i~1 25)} is VALID [2018-11-14 18:57:30,507 INFO L273 TraceCheckUtils]: 81: Hoare triple {26331#(<= main_~i~1 25)} assume true; {26331#(<= main_~i~1 25)} is VALID [2018-11-14 18:57:30,508 INFO L273 TraceCheckUtils]: 82: Hoare triple {26331#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26331#(<= main_~i~1 25)} is VALID [2018-11-14 18:57:30,508 INFO L273 TraceCheckUtils]: 83: Hoare triple {26331#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26332#(<= main_~i~1 26)} is VALID [2018-11-14 18:57:30,509 INFO L273 TraceCheckUtils]: 84: Hoare triple {26332#(<= main_~i~1 26)} assume true; {26332#(<= main_~i~1 26)} is VALID [2018-11-14 18:57:30,509 INFO L273 TraceCheckUtils]: 85: Hoare triple {26332#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26332#(<= main_~i~1 26)} is VALID [2018-11-14 18:57:30,510 INFO L273 TraceCheckUtils]: 86: Hoare triple {26332#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26333#(<= main_~i~1 27)} is VALID [2018-11-14 18:57:30,510 INFO L273 TraceCheckUtils]: 87: Hoare triple {26333#(<= main_~i~1 27)} assume true; {26333#(<= main_~i~1 27)} is VALID [2018-11-14 18:57:30,511 INFO L273 TraceCheckUtils]: 88: Hoare triple {26333#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26333#(<= main_~i~1 27)} is VALID [2018-11-14 18:57:30,512 INFO L273 TraceCheckUtils]: 89: Hoare triple {26333#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26334#(<= main_~i~1 28)} is VALID [2018-11-14 18:57:30,512 INFO L273 TraceCheckUtils]: 90: Hoare triple {26334#(<= main_~i~1 28)} assume true; {26334#(<= main_~i~1 28)} is VALID [2018-11-14 18:57:30,513 INFO L273 TraceCheckUtils]: 91: Hoare triple {26334#(<= main_~i~1 28)} assume !(~i~1 < 100000); {26305#false} is VALID [2018-11-14 18:57:30,513 INFO L256 TraceCheckUtils]: 92: Hoare triple {26305#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {26304#true} is VALID [2018-11-14 18:57:30,513 INFO L273 TraceCheckUtils]: 93: Hoare triple {26304#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {26304#true} is VALID [2018-11-14 18:57:30,513 INFO L273 TraceCheckUtils]: 94: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 18:57:30,513 INFO L273 TraceCheckUtils]: 95: Hoare triple {26304#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 18:57:30,513 INFO L273 TraceCheckUtils]: 96: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 18:57:30,514 INFO L273 TraceCheckUtils]: 97: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 18:57:30,514 INFO L273 TraceCheckUtils]: 98: Hoare triple {26304#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 18:57:30,514 INFO L273 TraceCheckUtils]: 99: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 18:57:30,514 INFO L273 TraceCheckUtils]: 100: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 18:57:30,514 INFO L273 TraceCheckUtils]: 101: Hoare triple {26304#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 18:57:30,514 INFO L273 TraceCheckUtils]: 102: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 18:57:30,515 INFO L273 TraceCheckUtils]: 103: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 18:57:30,515 INFO L273 TraceCheckUtils]: 104: Hoare triple {26304#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 18:57:30,515 INFO L273 TraceCheckUtils]: 105: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 18:57:30,515 INFO L273 TraceCheckUtils]: 106: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 18:57:30,515 INFO L273 TraceCheckUtils]: 107: Hoare triple {26304#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 18:57:30,515 INFO L273 TraceCheckUtils]: 108: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 18:57:30,516 INFO L273 TraceCheckUtils]: 109: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 18:57:30,516 INFO L273 TraceCheckUtils]: 110: Hoare triple {26304#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 18:57:30,516 INFO L273 TraceCheckUtils]: 111: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 18:57:30,516 INFO L273 TraceCheckUtils]: 112: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 18:57:30,516 INFO L273 TraceCheckUtils]: 113: Hoare triple {26304#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 18:57:30,516 INFO L273 TraceCheckUtils]: 114: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 18:57:30,516 INFO L273 TraceCheckUtils]: 115: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 18:57:30,516 INFO L273 TraceCheckUtils]: 116: Hoare triple {26304#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 18:57:30,517 INFO L273 TraceCheckUtils]: 117: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 18:57:30,517 INFO L273 TraceCheckUtils]: 118: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 18:57:30,517 INFO L273 TraceCheckUtils]: 119: Hoare triple {26304#true} assume !(~i~0 < 100000); {26304#true} is VALID [2018-11-14 18:57:30,517 INFO L273 TraceCheckUtils]: 120: Hoare triple {26304#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {26304#true} is VALID [2018-11-14 18:57:30,517 INFO L273 TraceCheckUtils]: 121: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 18:57:30,517 INFO L268 TraceCheckUtils]: 122: Hoare quadruple {26304#true} {26305#false} #73#return; {26305#false} is VALID [2018-11-14 18:57:30,517 INFO L273 TraceCheckUtils]: 123: Hoare triple {26305#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {26305#false} is VALID [2018-11-14 18:57:30,517 INFO L256 TraceCheckUtils]: 124: Hoare triple {26305#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {26304#true} is VALID [2018-11-14 18:57:30,517 INFO L273 TraceCheckUtils]: 125: Hoare triple {26304#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {26304#true} is VALID [2018-11-14 18:57:30,517 INFO L273 TraceCheckUtils]: 126: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 18:57:30,518 INFO L273 TraceCheckUtils]: 127: Hoare triple {26304#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 18:57:30,518 INFO L273 TraceCheckUtils]: 128: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 18:57:30,518 INFO L273 TraceCheckUtils]: 129: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 18:57:30,518 INFO L273 TraceCheckUtils]: 130: Hoare triple {26304#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 18:57:30,518 INFO L273 TraceCheckUtils]: 131: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 18:57:30,518 INFO L273 TraceCheckUtils]: 132: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 18:57:30,518 INFO L273 TraceCheckUtils]: 133: Hoare triple {26304#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 18:57:30,518 INFO L273 TraceCheckUtils]: 134: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 18:57:30,518 INFO L273 TraceCheckUtils]: 135: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 18:57:30,518 INFO L273 TraceCheckUtils]: 136: Hoare triple {26304#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 18:57:30,519 INFO L273 TraceCheckUtils]: 137: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 18:57:30,519 INFO L273 TraceCheckUtils]: 138: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 18:57:30,519 INFO L273 TraceCheckUtils]: 139: Hoare triple {26304#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 18:57:30,519 INFO L273 TraceCheckUtils]: 140: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 18:57:30,519 INFO L273 TraceCheckUtils]: 141: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 18:57:30,519 INFO L273 TraceCheckUtils]: 142: Hoare triple {26304#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 18:57:30,519 INFO L273 TraceCheckUtils]: 143: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 18:57:30,519 INFO L273 TraceCheckUtils]: 144: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 18:57:30,519 INFO L273 TraceCheckUtils]: 145: Hoare triple {26304#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 18:57:30,519 INFO L273 TraceCheckUtils]: 146: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 18:57:30,520 INFO L273 TraceCheckUtils]: 147: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 18:57:30,520 INFO L273 TraceCheckUtils]: 148: Hoare triple {26304#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 18:57:30,520 INFO L273 TraceCheckUtils]: 149: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 18:57:30,520 INFO L273 TraceCheckUtils]: 150: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 18:57:30,520 INFO L273 TraceCheckUtils]: 151: Hoare triple {26304#true} assume !(~i~0 < 100000); {26304#true} is VALID [2018-11-14 18:57:30,520 INFO L273 TraceCheckUtils]: 152: Hoare triple {26304#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {26304#true} is VALID [2018-11-14 18:57:30,520 INFO L273 TraceCheckUtils]: 153: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 18:57:30,520 INFO L268 TraceCheckUtils]: 154: Hoare quadruple {26304#true} {26305#false} #75#return; {26305#false} is VALID [2018-11-14 18:57:30,520 INFO L273 TraceCheckUtils]: 155: Hoare triple {26305#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {26305#false} is VALID [2018-11-14 18:57:30,521 INFO L273 TraceCheckUtils]: 156: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 18:57:30,521 INFO L273 TraceCheckUtils]: 157: Hoare triple {26305#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26305#false} is VALID [2018-11-14 18:57:30,521 INFO L273 TraceCheckUtils]: 158: Hoare triple {26305#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26305#false} is VALID [2018-11-14 18:57:30,521 INFO L273 TraceCheckUtils]: 159: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 18:57:30,521 INFO L273 TraceCheckUtils]: 160: Hoare triple {26305#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26305#false} is VALID [2018-11-14 18:57:30,521 INFO L273 TraceCheckUtils]: 161: Hoare triple {26305#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26305#false} is VALID [2018-11-14 18:57:30,521 INFO L273 TraceCheckUtils]: 162: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 18:57:30,521 INFO L273 TraceCheckUtils]: 163: Hoare triple {26305#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26305#false} is VALID [2018-11-14 18:57:30,521 INFO L273 TraceCheckUtils]: 164: Hoare triple {26305#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26305#false} is VALID [2018-11-14 18:57:30,521 INFO L273 TraceCheckUtils]: 165: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 18:57:30,522 INFO L273 TraceCheckUtils]: 166: Hoare triple {26305#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26305#false} is VALID [2018-11-14 18:57:30,522 INFO L273 TraceCheckUtils]: 167: Hoare triple {26305#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26305#false} is VALID [2018-11-14 18:57:30,522 INFO L273 TraceCheckUtils]: 168: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 18:57:30,522 INFO L273 TraceCheckUtils]: 169: Hoare triple {26305#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26305#false} is VALID [2018-11-14 18:57:30,522 INFO L273 TraceCheckUtils]: 170: Hoare triple {26305#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26305#false} is VALID [2018-11-14 18:57:30,522 INFO L273 TraceCheckUtils]: 171: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 18:57:30,522 INFO L273 TraceCheckUtils]: 172: Hoare triple {26305#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26305#false} is VALID [2018-11-14 18:57:30,522 INFO L273 TraceCheckUtils]: 173: Hoare triple {26305#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26305#false} is VALID [2018-11-14 18:57:30,522 INFO L273 TraceCheckUtils]: 174: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 18:57:30,522 INFO L273 TraceCheckUtils]: 175: Hoare triple {26305#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26305#false} is VALID [2018-11-14 18:57:30,523 INFO L273 TraceCheckUtils]: 176: Hoare triple {26305#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26305#false} is VALID [2018-11-14 18:57:30,523 INFO L273 TraceCheckUtils]: 177: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 18:57:30,523 INFO L273 TraceCheckUtils]: 178: Hoare triple {26305#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26305#false} is VALID [2018-11-14 18:57:30,523 INFO L273 TraceCheckUtils]: 179: Hoare triple {26305#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26305#false} is VALID [2018-11-14 18:57:30,523 INFO L273 TraceCheckUtils]: 180: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 18:57:30,523 INFO L273 TraceCheckUtils]: 181: Hoare triple {26305#false} assume !(~i~2 < 99999); {26305#false} is VALID [2018-11-14 18:57:30,523 INFO L273 TraceCheckUtils]: 182: Hoare triple {26305#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {26305#false} is VALID [2018-11-14 18:57:30,523 INFO L256 TraceCheckUtils]: 183: Hoare triple {26305#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {26304#true} is VALID [2018-11-14 18:57:30,523 INFO L273 TraceCheckUtils]: 184: Hoare triple {26304#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {26304#true} is VALID [2018-11-14 18:57:30,523 INFO L273 TraceCheckUtils]: 185: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 18:57:30,524 INFO L273 TraceCheckUtils]: 186: Hoare triple {26304#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 18:57:30,524 INFO L273 TraceCheckUtils]: 187: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 18:57:30,524 INFO L273 TraceCheckUtils]: 188: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 18:57:30,524 INFO L273 TraceCheckUtils]: 189: Hoare triple {26304#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 18:57:30,524 INFO L273 TraceCheckUtils]: 190: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 18:57:30,524 INFO L273 TraceCheckUtils]: 191: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 18:57:30,524 INFO L273 TraceCheckUtils]: 192: Hoare triple {26304#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 18:57:30,524 INFO L273 TraceCheckUtils]: 193: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 18:57:30,524 INFO L273 TraceCheckUtils]: 194: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 18:57:30,524 INFO L273 TraceCheckUtils]: 195: Hoare triple {26304#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 18:57:30,525 INFO L273 TraceCheckUtils]: 196: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 18:57:30,525 INFO L273 TraceCheckUtils]: 197: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 18:57:30,525 INFO L273 TraceCheckUtils]: 198: Hoare triple {26304#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 18:57:30,525 INFO L273 TraceCheckUtils]: 199: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 18:57:30,525 INFO L273 TraceCheckUtils]: 200: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 18:57:30,525 INFO L273 TraceCheckUtils]: 201: Hoare triple {26304#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 18:57:30,525 INFO L273 TraceCheckUtils]: 202: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 18:57:30,525 INFO L273 TraceCheckUtils]: 203: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 18:57:30,525 INFO L273 TraceCheckUtils]: 204: Hoare triple {26304#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 18:57:30,525 INFO L273 TraceCheckUtils]: 205: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 18:57:30,526 INFO L273 TraceCheckUtils]: 206: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 18:57:30,526 INFO L273 TraceCheckUtils]: 207: Hoare triple {26304#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26304#true} is VALID [2018-11-14 18:57:30,526 INFO L273 TraceCheckUtils]: 208: Hoare triple {26304#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26304#true} is VALID [2018-11-14 18:57:30,526 INFO L273 TraceCheckUtils]: 209: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 18:57:30,526 INFO L273 TraceCheckUtils]: 210: Hoare triple {26304#true} assume !(~i~0 < 100000); {26304#true} is VALID [2018-11-14 18:57:30,526 INFO L273 TraceCheckUtils]: 211: Hoare triple {26304#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {26304#true} is VALID [2018-11-14 18:57:30,526 INFO L273 TraceCheckUtils]: 212: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 18:57:30,526 INFO L268 TraceCheckUtils]: 213: Hoare quadruple {26304#true} {26305#false} #77#return; {26305#false} is VALID [2018-11-14 18:57:30,526 INFO L273 TraceCheckUtils]: 214: Hoare triple {26305#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {26305#false} is VALID [2018-11-14 18:57:30,527 INFO L273 TraceCheckUtils]: 215: Hoare triple {26305#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {26305#false} is VALID [2018-11-14 18:57:30,527 INFO L273 TraceCheckUtils]: 216: Hoare triple {26305#false} assume !false; {26305#false} is VALID [2018-11-14 18:57:30,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2280 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 1090 trivial. 0 not checked. [2018-11-14 18:57:30,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:57:30,548 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-14 18:57:30,556 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:57:30,627 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:57:30,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:57:30,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:57:30,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:57:30,990 INFO L256 TraceCheckUtils]: 0: Hoare triple {26304#true} call ULTIMATE.init(); {26304#true} is VALID [2018-11-14 18:57:30,991 INFO L273 TraceCheckUtils]: 1: Hoare triple {26304#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26304#true} is VALID [2018-11-14 18:57:30,991 INFO L273 TraceCheckUtils]: 2: Hoare triple {26304#true} assume true; {26304#true} is VALID [2018-11-14 18:57:30,991 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26304#true} {26304#true} #69#return; {26304#true} is VALID [2018-11-14 18:57:30,991 INFO L256 TraceCheckUtils]: 4: Hoare triple {26304#true} call #t~ret13 := main(); {26304#true} is VALID [2018-11-14 18:57:30,992 INFO L273 TraceCheckUtils]: 5: Hoare triple {26304#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; {26353#(<= main_~i~1 0)} is VALID [2018-11-14 18:57:30,993 INFO L273 TraceCheckUtils]: 6: Hoare triple {26353#(<= main_~i~1 0)} assume true; {26353#(<= main_~i~1 0)} is VALID [2018-11-14 18:57:30,993 INFO L273 TraceCheckUtils]: 7: Hoare triple {26353#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26353#(<= main_~i~1 0)} is VALID [2018-11-14 18:57:30,993 INFO L273 TraceCheckUtils]: 8: Hoare triple {26353#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26307#(<= main_~i~1 1)} is VALID [2018-11-14 18:57:30,994 INFO L273 TraceCheckUtils]: 9: Hoare triple {26307#(<= main_~i~1 1)} assume true; {26307#(<= main_~i~1 1)} is VALID [2018-11-14 18:57:30,994 INFO L273 TraceCheckUtils]: 10: Hoare triple {26307#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26307#(<= main_~i~1 1)} is VALID [2018-11-14 18:57:30,994 INFO L273 TraceCheckUtils]: 11: Hoare triple {26307#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26308#(<= main_~i~1 2)} is VALID [2018-11-14 18:57:30,995 INFO L273 TraceCheckUtils]: 12: Hoare triple {26308#(<= main_~i~1 2)} assume true; {26308#(<= main_~i~1 2)} is VALID [2018-11-14 18:57:30,995 INFO L273 TraceCheckUtils]: 13: Hoare triple {26308#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26308#(<= main_~i~1 2)} is VALID [2018-11-14 18:57:30,996 INFO L273 TraceCheckUtils]: 14: Hoare triple {26308#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26309#(<= main_~i~1 3)} is VALID [2018-11-14 18:57:30,996 INFO L273 TraceCheckUtils]: 15: Hoare triple {26309#(<= main_~i~1 3)} assume true; {26309#(<= main_~i~1 3)} is VALID [2018-11-14 18:57:30,997 INFO L273 TraceCheckUtils]: 16: Hoare triple {26309#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26309#(<= main_~i~1 3)} is VALID [2018-11-14 18:57:30,997 INFO L273 TraceCheckUtils]: 17: Hoare triple {26309#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26310#(<= main_~i~1 4)} is VALID [2018-11-14 18:57:30,998 INFO L273 TraceCheckUtils]: 18: Hoare triple {26310#(<= main_~i~1 4)} assume true; {26310#(<= main_~i~1 4)} is VALID [2018-11-14 18:57:30,998 INFO L273 TraceCheckUtils]: 19: Hoare triple {26310#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26310#(<= main_~i~1 4)} is VALID [2018-11-14 18:57:30,999 INFO L273 TraceCheckUtils]: 20: Hoare triple {26310#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26311#(<= main_~i~1 5)} is VALID [2018-11-14 18:57:31,000 INFO L273 TraceCheckUtils]: 21: Hoare triple {26311#(<= main_~i~1 5)} assume true; {26311#(<= main_~i~1 5)} is VALID [2018-11-14 18:57:31,000 INFO L273 TraceCheckUtils]: 22: Hoare triple {26311#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26311#(<= main_~i~1 5)} is VALID [2018-11-14 18:57:31,001 INFO L273 TraceCheckUtils]: 23: Hoare triple {26311#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26312#(<= main_~i~1 6)} is VALID [2018-11-14 18:57:31,001 INFO L273 TraceCheckUtils]: 24: Hoare triple {26312#(<= main_~i~1 6)} assume true; {26312#(<= main_~i~1 6)} is VALID [2018-11-14 18:57:31,002 INFO L273 TraceCheckUtils]: 25: Hoare triple {26312#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26312#(<= main_~i~1 6)} is VALID [2018-11-14 18:57:31,002 INFO L273 TraceCheckUtils]: 26: Hoare triple {26312#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26313#(<= main_~i~1 7)} is VALID [2018-11-14 18:57:31,003 INFO L273 TraceCheckUtils]: 27: Hoare triple {26313#(<= main_~i~1 7)} assume true; {26313#(<= main_~i~1 7)} is VALID [2018-11-14 18:57:31,003 INFO L273 TraceCheckUtils]: 28: Hoare triple {26313#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26313#(<= main_~i~1 7)} is VALID [2018-11-14 18:57:31,004 INFO L273 TraceCheckUtils]: 29: Hoare triple {26313#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26314#(<= main_~i~1 8)} is VALID [2018-11-14 18:57:31,004 INFO L273 TraceCheckUtils]: 30: Hoare triple {26314#(<= main_~i~1 8)} assume true; {26314#(<= main_~i~1 8)} is VALID [2018-11-14 18:57:31,005 INFO L273 TraceCheckUtils]: 31: Hoare triple {26314#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26314#(<= main_~i~1 8)} is VALID [2018-11-14 18:57:31,006 INFO L273 TraceCheckUtils]: 32: Hoare triple {26314#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26315#(<= main_~i~1 9)} is VALID [2018-11-14 18:57:31,006 INFO L273 TraceCheckUtils]: 33: Hoare triple {26315#(<= main_~i~1 9)} assume true; {26315#(<= main_~i~1 9)} is VALID [2018-11-14 18:57:31,006 INFO L273 TraceCheckUtils]: 34: Hoare triple {26315#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26315#(<= main_~i~1 9)} is VALID [2018-11-14 18:57:31,007 INFO L273 TraceCheckUtils]: 35: Hoare triple {26315#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26316#(<= main_~i~1 10)} is VALID [2018-11-14 18:57:31,008 INFO L273 TraceCheckUtils]: 36: Hoare triple {26316#(<= main_~i~1 10)} assume true; {26316#(<= main_~i~1 10)} is VALID [2018-11-14 18:57:31,008 INFO L273 TraceCheckUtils]: 37: Hoare triple {26316#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26316#(<= main_~i~1 10)} is VALID [2018-11-14 18:57:31,009 INFO L273 TraceCheckUtils]: 38: Hoare triple {26316#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26317#(<= main_~i~1 11)} is VALID [2018-11-14 18:57:31,009 INFO L273 TraceCheckUtils]: 39: Hoare triple {26317#(<= main_~i~1 11)} assume true; {26317#(<= main_~i~1 11)} is VALID [2018-11-14 18:57:31,010 INFO L273 TraceCheckUtils]: 40: Hoare triple {26317#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26317#(<= main_~i~1 11)} is VALID [2018-11-14 18:57:31,010 INFO L273 TraceCheckUtils]: 41: Hoare triple {26317#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26318#(<= main_~i~1 12)} is VALID [2018-11-14 18:57:31,011 INFO L273 TraceCheckUtils]: 42: Hoare triple {26318#(<= main_~i~1 12)} assume true; {26318#(<= main_~i~1 12)} is VALID [2018-11-14 18:57:31,011 INFO L273 TraceCheckUtils]: 43: Hoare triple {26318#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26318#(<= main_~i~1 12)} is VALID [2018-11-14 18:57:31,012 INFO L273 TraceCheckUtils]: 44: Hoare triple {26318#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26319#(<= main_~i~1 13)} is VALID [2018-11-14 18:57:31,013 INFO L273 TraceCheckUtils]: 45: Hoare triple {26319#(<= main_~i~1 13)} assume true; {26319#(<= main_~i~1 13)} is VALID [2018-11-14 18:57:31,013 INFO L273 TraceCheckUtils]: 46: Hoare triple {26319#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26319#(<= main_~i~1 13)} is VALID [2018-11-14 18:57:31,014 INFO L273 TraceCheckUtils]: 47: Hoare triple {26319#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26320#(<= main_~i~1 14)} is VALID [2018-11-14 18:57:31,014 INFO L273 TraceCheckUtils]: 48: Hoare triple {26320#(<= main_~i~1 14)} assume true; {26320#(<= main_~i~1 14)} is VALID [2018-11-14 18:57:31,015 INFO L273 TraceCheckUtils]: 49: Hoare triple {26320#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26320#(<= main_~i~1 14)} is VALID [2018-11-14 18:57:31,016 INFO L273 TraceCheckUtils]: 50: Hoare triple {26320#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26321#(<= main_~i~1 15)} is VALID [2018-11-14 18:57:31,016 INFO L273 TraceCheckUtils]: 51: Hoare triple {26321#(<= main_~i~1 15)} assume true; {26321#(<= main_~i~1 15)} is VALID [2018-11-14 18:57:31,017 INFO L273 TraceCheckUtils]: 52: Hoare triple {26321#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26321#(<= main_~i~1 15)} is VALID [2018-11-14 18:57:31,017 INFO L273 TraceCheckUtils]: 53: Hoare triple {26321#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26322#(<= main_~i~1 16)} is VALID [2018-11-14 18:57:31,018 INFO L273 TraceCheckUtils]: 54: Hoare triple {26322#(<= main_~i~1 16)} assume true; {26322#(<= main_~i~1 16)} is VALID [2018-11-14 18:57:31,018 INFO L273 TraceCheckUtils]: 55: Hoare triple {26322#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26322#(<= main_~i~1 16)} is VALID [2018-11-14 18:57:31,019 INFO L273 TraceCheckUtils]: 56: Hoare triple {26322#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26323#(<= main_~i~1 17)} is VALID [2018-11-14 18:57:31,019 INFO L273 TraceCheckUtils]: 57: Hoare triple {26323#(<= main_~i~1 17)} assume true; {26323#(<= main_~i~1 17)} is VALID [2018-11-14 18:57:31,020 INFO L273 TraceCheckUtils]: 58: Hoare triple {26323#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26323#(<= main_~i~1 17)} is VALID [2018-11-14 18:57:31,021 INFO L273 TraceCheckUtils]: 59: Hoare triple {26323#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26324#(<= main_~i~1 18)} is VALID [2018-11-14 18:57:31,021 INFO L273 TraceCheckUtils]: 60: Hoare triple {26324#(<= main_~i~1 18)} assume true; {26324#(<= main_~i~1 18)} is VALID [2018-11-14 18:57:31,022 INFO L273 TraceCheckUtils]: 61: Hoare triple {26324#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26324#(<= main_~i~1 18)} is VALID [2018-11-14 18:57:31,022 INFO L273 TraceCheckUtils]: 62: Hoare triple {26324#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26325#(<= main_~i~1 19)} is VALID [2018-11-14 18:57:31,023 INFO L273 TraceCheckUtils]: 63: Hoare triple {26325#(<= main_~i~1 19)} assume true; {26325#(<= main_~i~1 19)} is VALID [2018-11-14 18:57:31,023 INFO L273 TraceCheckUtils]: 64: Hoare triple {26325#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26325#(<= main_~i~1 19)} is VALID [2018-11-14 18:57:31,024 INFO L273 TraceCheckUtils]: 65: Hoare triple {26325#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26326#(<= main_~i~1 20)} is VALID [2018-11-14 18:57:31,025 INFO L273 TraceCheckUtils]: 66: Hoare triple {26326#(<= main_~i~1 20)} assume true; {26326#(<= main_~i~1 20)} is VALID [2018-11-14 18:57:31,025 INFO L273 TraceCheckUtils]: 67: Hoare triple {26326#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26326#(<= main_~i~1 20)} is VALID [2018-11-14 18:57:31,026 INFO L273 TraceCheckUtils]: 68: Hoare triple {26326#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26327#(<= main_~i~1 21)} is VALID [2018-11-14 18:57:31,026 INFO L273 TraceCheckUtils]: 69: Hoare triple {26327#(<= main_~i~1 21)} assume true; {26327#(<= main_~i~1 21)} is VALID [2018-11-14 18:57:31,027 INFO L273 TraceCheckUtils]: 70: Hoare triple {26327#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26327#(<= main_~i~1 21)} is VALID [2018-11-14 18:57:31,028 INFO L273 TraceCheckUtils]: 71: Hoare triple {26327#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26328#(<= main_~i~1 22)} is VALID [2018-11-14 18:57:31,028 INFO L273 TraceCheckUtils]: 72: Hoare triple {26328#(<= main_~i~1 22)} assume true; {26328#(<= main_~i~1 22)} is VALID [2018-11-14 18:57:31,029 INFO L273 TraceCheckUtils]: 73: Hoare triple {26328#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26328#(<= main_~i~1 22)} is VALID [2018-11-14 18:57:31,029 INFO L273 TraceCheckUtils]: 74: Hoare triple {26328#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26329#(<= main_~i~1 23)} is VALID [2018-11-14 18:57:31,030 INFO L273 TraceCheckUtils]: 75: Hoare triple {26329#(<= main_~i~1 23)} assume true; {26329#(<= main_~i~1 23)} is VALID [2018-11-14 18:57:31,030 INFO L273 TraceCheckUtils]: 76: Hoare triple {26329#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26329#(<= main_~i~1 23)} is VALID [2018-11-14 18:57:31,031 INFO L273 TraceCheckUtils]: 77: Hoare triple {26329#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26330#(<= main_~i~1 24)} is VALID [2018-11-14 18:57:31,032 INFO L273 TraceCheckUtils]: 78: Hoare triple {26330#(<= main_~i~1 24)} assume true; {26330#(<= main_~i~1 24)} is VALID [2018-11-14 18:57:31,032 INFO L273 TraceCheckUtils]: 79: Hoare triple {26330#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26330#(<= main_~i~1 24)} is VALID [2018-11-14 18:57:31,033 INFO L273 TraceCheckUtils]: 80: Hoare triple {26330#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26331#(<= main_~i~1 25)} is VALID [2018-11-14 18:57:31,033 INFO L273 TraceCheckUtils]: 81: Hoare triple {26331#(<= main_~i~1 25)} assume true; {26331#(<= main_~i~1 25)} is VALID [2018-11-14 18:57:31,034 INFO L273 TraceCheckUtils]: 82: Hoare triple {26331#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26331#(<= main_~i~1 25)} is VALID [2018-11-14 18:57:31,035 INFO L273 TraceCheckUtils]: 83: Hoare triple {26331#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26332#(<= main_~i~1 26)} is VALID [2018-11-14 18:57:31,035 INFO L273 TraceCheckUtils]: 84: Hoare triple {26332#(<= main_~i~1 26)} assume true; {26332#(<= main_~i~1 26)} is VALID [2018-11-14 18:57:31,036 INFO L273 TraceCheckUtils]: 85: Hoare triple {26332#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26332#(<= main_~i~1 26)} is VALID [2018-11-14 18:57:31,036 INFO L273 TraceCheckUtils]: 86: Hoare triple {26332#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26333#(<= main_~i~1 27)} is VALID [2018-11-14 18:57:31,037 INFO L273 TraceCheckUtils]: 87: Hoare triple {26333#(<= main_~i~1 27)} assume true; {26333#(<= main_~i~1 27)} is VALID [2018-11-14 18:57:31,037 INFO L273 TraceCheckUtils]: 88: Hoare triple {26333#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {26333#(<= main_~i~1 27)} is VALID [2018-11-14 18:57:31,038 INFO L273 TraceCheckUtils]: 89: Hoare triple {26333#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26334#(<= main_~i~1 28)} is VALID [2018-11-14 18:57:31,039 INFO L273 TraceCheckUtils]: 90: Hoare triple {26334#(<= main_~i~1 28)} assume true; {26334#(<= main_~i~1 28)} is VALID [2018-11-14 18:57:31,039 INFO L273 TraceCheckUtils]: 91: Hoare triple {26334#(<= main_~i~1 28)} assume !(~i~1 < 100000); {26305#false} is VALID [2018-11-14 18:57:31,040 INFO L256 TraceCheckUtils]: 92: Hoare triple {26305#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {26305#false} is VALID [2018-11-14 18:57:31,040 INFO L273 TraceCheckUtils]: 93: Hoare triple {26305#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {26305#false} is VALID [2018-11-14 18:57:31,040 INFO L273 TraceCheckUtils]: 94: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 18:57:31,040 INFO L273 TraceCheckUtils]: 95: Hoare triple {26305#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 18:57:31,040 INFO L273 TraceCheckUtils]: 96: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 18:57:31,040 INFO L273 TraceCheckUtils]: 97: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 18:57:31,041 INFO L273 TraceCheckUtils]: 98: Hoare triple {26305#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 18:57:31,041 INFO L273 TraceCheckUtils]: 99: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 18:57:31,041 INFO L273 TraceCheckUtils]: 100: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 18:57:31,041 INFO L273 TraceCheckUtils]: 101: Hoare triple {26305#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 18:57:31,041 INFO L273 TraceCheckUtils]: 102: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 18:57:31,041 INFO L273 TraceCheckUtils]: 103: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 18:57:31,042 INFO L273 TraceCheckUtils]: 104: Hoare triple {26305#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 18:57:31,042 INFO L273 TraceCheckUtils]: 105: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 18:57:31,042 INFO L273 TraceCheckUtils]: 106: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 18:57:31,042 INFO L273 TraceCheckUtils]: 107: Hoare triple {26305#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 18:57:31,042 INFO L273 TraceCheckUtils]: 108: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 18:57:31,043 INFO L273 TraceCheckUtils]: 109: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 18:57:31,043 INFO L273 TraceCheckUtils]: 110: Hoare triple {26305#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 18:57:31,043 INFO L273 TraceCheckUtils]: 111: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 18:57:31,043 INFO L273 TraceCheckUtils]: 112: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 18:57:31,043 INFO L273 TraceCheckUtils]: 113: Hoare triple {26305#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 18:57:31,043 INFO L273 TraceCheckUtils]: 114: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 18:57:31,043 INFO L273 TraceCheckUtils]: 115: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 18:57:31,043 INFO L273 TraceCheckUtils]: 116: Hoare triple {26305#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 18:57:31,043 INFO L273 TraceCheckUtils]: 117: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 18:57:31,044 INFO L273 TraceCheckUtils]: 118: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 18:57:31,044 INFO L273 TraceCheckUtils]: 119: Hoare triple {26305#false} assume !(~i~0 < 100000); {26305#false} is VALID [2018-11-14 18:57:31,044 INFO L273 TraceCheckUtils]: 120: Hoare triple {26305#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {26305#false} is VALID [2018-11-14 18:57:31,044 INFO L273 TraceCheckUtils]: 121: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 18:57:31,044 INFO L268 TraceCheckUtils]: 122: Hoare quadruple {26305#false} {26305#false} #73#return; {26305#false} is VALID [2018-11-14 18:57:31,044 INFO L273 TraceCheckUtils]: 123: Hoare triple {26305#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {26305#false} is VALID [2018-11-14 18:57:31,044 INFO L256 TraceCheckUtils]: 124: Hoare triple {26305#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {26305#false} is VALID [2018-11-14 18:57:31,044 INFO L273 TraceCheckUtils]: 125: Hoare triple {26305#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {26305#false} is VALID [2018-11-14 18:57:31,044 INFO L273 TraceCheckUtils]: 126: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 18:57:31,044 INFO L273 TraceCheckUtils]: 127: Hoare triple {26305#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 18:57:31,045 INFO L273 TraceCheckUtils]: 128: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 18:57:31,045 INFO L273 TraceCheckUtils]: 129: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 18:57:31,045 INFO L273 TraceCheckUtils]: 130: Hoare triple {26305#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 18:57:31,045 INFO L273 TraceCheckUtils]: 131: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 18:57:31,045 INFO L273 TraceCheckUtils]: 132: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 18:57:31,045 INFO L273 TraceCheckUtils]: 133: Hoare triple {26305#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 18:57:31,045 INFO L273 TraceCheckUtils]: 134: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 18:57:31,045 INFO L273 TraceCheckUtils]: 135: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 18:57:31,045 INFO L273 TraceCheckUtils]: 136: Hoare triple {26305#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 18:57:31,045 INFO L273 TraceCheckUtils]: 137: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 18:57:31,046 INFO L273 TraceCheckUtils]: 138: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 18:57:31,046 INFO L273 TraceCheckUtils]: 139: Hoare triple {26305#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 18:57:31,046 INFO L273 TraceCheckUtils]: 140: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 18:57:31,046 INFO L273 TraceCheckUtils]: 141: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 18:57:31,046 INFO L273 TraceCheckUtils]: 142: Hoare triple {26305#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 18:57:31,046 INFO L273 TraceCheckUtils]: 143: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 18:57:31,046 INFO L273 TraceCheckUtils]: 144: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 18:57:31,046 INFO L273 TraceCheckUtils]: 145: Hoare triple {26305#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 18:57:31,046 INFO L273 TraceCheckUtils]: 146: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 18:57:31,047 INFO L273 TraceCheckUtils]: 147: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 18:57:31,047 INFO L273 TraceCheckUtils]: 148: Hoare triple {26305#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 18:57:31,047 INFO L273 TraceCheckUtils]: 149: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 18:57:31,047 INFO L273 TraceCheckUtils]: 150: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 18:57:31,047 INFO L273 TraceCheckUtils]: 151: Hoare triple {26305#false} assume !(~i~0 < 100000); {26305#false} is VALID [2018-11-14 18:57:31,047 INFO L273 TraceCheckUtils]: 152: Hoare triple {26305#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {26305#false} is VALID [2018-11-14 18:57:31,047 INFO L273 TraceCheckUtils]: 153: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 18:57:31,047 INFO L268 TraceCheckUtils]: 154: Hoare quadruple {26305#false} {26305#false} #75#return; {26305#false} is VALID [2018-11-14 18:57:31,047 INFO L273 TraceCheckUtils]: 155: Hoare triple {26305#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {26305#false} is VALID [2018-11-14 18:57:31,047 INFO L273 TraceCheckUtils]: 156: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 18:57:31,048 INFO L273 TraceCheckUtils]: 157: Hoare triple {26305#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26305#false} is VALID [2018-11-14 18:57:31,048 INFO L273 TraceCheckUtils]: 158: Hoare triple {26305#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26305#false} is VALID [2018-11-14 18:57:31,048 INFO L273 TraceCheckUtils]: 159: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 18:57:31,048 INFO L273 TraceCheckUtils]: 160: Hoare triple {26305#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26305#false} is VALID [2018-11-14 18:57:31,048 INFO L273 TraceCheckUtils]: 161: Hoare triple {26305#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26305#false} is VALID [2018-11-14 18:57:31,048 INFO L273 TraceCheckUtils]: 162: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 18:57:31,048 INFO L273 TraceCheckUtils]: 163: Hoare triple {26305#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26305#false} is VALID [2018-11-14 18:57:31,048 INFO L273 TraceCheckUtils]: 164: Hoare triple {26305#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26305#false} is VALID [2018-11-14 18:57:31,048 INFO L273 TraceCheckUtils]: 165: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 18:57:31,048 INFO L273 TraceCheckUtils]: 166: Hoare triple {26305#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26305#false} is VALID [2018-11-14 18:57:31,049 INFO L273 TraceCheckUtils]: 167: Hoare triple {26305#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26305#false} is VALID [2018-11-14 18:57:31,049 INFO L273 TraceCheckUtils]: 168: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 18:57:31,049 INFO L273 TraceCheckUtils]: 169: Hoare triple {26305#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26305#false} is VALID [2018-11-14 18:57:31,049 INFO L273 TraceCheckUtils]: 170: Hoare triple {26305#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26305#false} is VALID [2018-11-14 18:57:31,049 INFO L273 TraceCheckUtils]: 171: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 18:57:31,049 INFO L273 TraceCheckUtils]: 172: Hoare triple {26305#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26305#false} is VALID [2018-11-14 18:57:31,049 INFO L273 TraceCheckUtils]: 173: Hoare triple {26305#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26305#false} is VALID [2018-11-14 18:57:31,049 INFO L273 TraceCheckUtils]: 174: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 18:57:31,049 INFO L273 TraceCheckUtils]: 175: Hoare triple {26305#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26305#false} is VALID [2018-11-14 18:57:31,049 INFO L273 TraceCheckUtils]: 176: Hoare triple {26305#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26305#false} is VALID [2018-11-14 18:57:31,050 INFO L273 TraceCheckUtils]: 177: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 18:57:31,050 INFO L273 TraceCheckUtils]: 178: Hoare triple {26305#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26305#false} is VALID [2018-11-14 18:57:31,050 INFO L273 TraceCheckUtils]: 179: Hoare triple {26305#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26305#false} is VALID [2018-11-14 18:57:31,050 INFO L273 TraceCheckUtils]: 180: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 18:57:31,050 INFO L273 TraceCheckUtils]: 181: Hoare triple {26305#false} assume !(~i~2 < 99999); {26305#false} is VALID [2018-11-14 18:57:31,050 INFO L273 TraceCheckUtils]: 182: Hoare triple {26305#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {26305#false} is VALID [2018-11-14 18:57:31,050 INFO L256 TraceCheckUtils]: 183: Hoare triple {26305#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {26305#false} is VALID [2018-11-14 18:57:31,050 INFO L273 TraceCheckUtils]: 184: Hoare triple {26305#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {26305#false} is VALID [2018-11-14 18:57:31,050 INFO L273 TraceCheckUtils]: 185: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 18:57:31,051 INFO L273 TraceCheckUtils]: 186: Hoare triple {26305#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 18:57:31,051 INFO L273 TraceCheckUtils]: 187: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 18:57:31,051 INFO L273 TraceCheckUtils]: 188: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 18:57:31,051 INFO L273 TraceCheckUtils]: 189: Hoare triple {26305#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 18:57:31,051 INFO L273 TraceCheckUtils]: 190: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 18:57:31,051 INFO L273 TraceCheckUtils]: 191: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 18:57:31,051 INFO L273 TraceCheckUtils]: 192: Hoare triple {26305#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 18:57:31,051 INFO L273 TraceCheckUtils]: 193: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 18:57:31,051 INFO L273 TraceCheckUtils]: 194: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 18:57:31,051 INFO L273 TraceCheckUtils]: 195: Hoare triple {26305#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 18:57:31,052 INFO L273 TraceCheckUtils]: 196: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 18:57:31,052 INFO L273 TraceCheckUtils]: 197: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 18:57:31,052 INFO L273 TraceCheckUtils]: 198: Hoare triple {26305#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 18:57:31,052 INFO L273 TraceCheckUtils]: 199: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 18:57:31,052 INFO L273 TraceCheckUtils]: 200: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 18:57:31,052 INFO L273 TraceCheckUtils]: 201: Hoare triple {26305#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 18:57:31,052 INFO L273 TraceCheckUtils]: 202: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 18:57:31,052 INFO L273 TraceCheckUtils]: 203: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 18:57:31,052 INFO L273 TraceCheckUtils]: 204: Hoare triple {26305#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 18:57:31,052 INFO L273 TraceCheckUtils]: 205: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 18:57:31,053 INFO L273 TraceCheckUtils]: 206: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 18:57:31,053 INFO L273 TraceCheckUtils]: 207: Hoare triple {26305#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26305#false} is VALID [2018-11-14 18:57:31,053 INFO L273 TraceCheckUtils]: 208: Hoare triple {26305#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26305#false} is VALID [2018-11-14 18:57:31,053 INFO L273 TraceCheckUtils]: 209: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 18:57:31,053 INFO L273 TraceCheckUtils]: 210: Hoare triple {26305#false} assume !(~i~0 < 100000); {26305#false} is VALID [2018-11-14 18:57:31,053 INFO L273 TraceCheckUtils]: 211: Hoare triple {26305#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {26305#false} is VALID [2018-11-14 18:57:31,053 INFO L273 TraceCheckUtils]: 212: Hoare triple {26305#false} assume true; {26305#false} is VALID [2018-11-14 18:57:31,053 INFO L268 TraceCheckUtils]: 213: Hoare quadruple {26305#false} {26305#false} #77#return; {26305#false} is VALID [2018-11-14 18:57:31,053 INFO L273 TraceCheckUtils]: 214: Hoare triple {26305#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {26305#false} is VALID [2018-11-14 18:57:31,053 INFO L273 TraceCheckUtils]: 215: Hoare triple {26305#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {26305#false} is VALID [2018-11-14 18:57:31,054 INFO L273 TraceCheckUtils]: 216: Hoare triple {26305#false} assume !false; {26305#false} is VALID [2018-11-14 18:57:31,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2280 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 1090 trivial. 0 not checked. [2018-11-14 18:57:31,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:57:31,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2018-11-14 18:57:31,096 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 217 [2018-11-14 18:57:31,097 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:57:31,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-14 18:57:31,222 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-14 18:57:31,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-14 18:57:31,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-14 18:57:31,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-14 18:57:31,223 INFO L87 Difference]: Start difference. First operand 158 states and 162 transitions. Second operand 32 states. [2018-11-14 18:57:32,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:57:32,504 INFO L93 Difference]: Finished difference Result 228 states and 236 transitions. [2018-11-14 18:57:32,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-14 18:57:32,504 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 217 [2018-11-14 18:57:32,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:57:32,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 18:57:32,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 144 transitions. [2018-11-14 18:57:32,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 18:57:32,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 144 transitions. [2018-11-14 18:57:32,506 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 144 transitions. [2018-11-14 18:57:32,631 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:57:32,635 INFO L225 Difference]: With dead ends: 228 [2018-11-14 18:57:32,635 INFO L226 Difference]: Without dead ends: 162 [2018-11-14 18:57:32,636 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-14 18:57:32,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-11-14 18:57:32,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2018-11-14 18:57:32,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:57:32,953 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand 161 states. [2018-11-14 18:57:32,953 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand 161 states. [2018-11-14 18:57:32,954 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 161 states. [2018-11-14 18:57:32,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:57:32,957 INFO L93 Difference]: Finished difference Result 162 states and 166 transitions. [2018-11-14 18:57:32,957 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 166 transitions. [2018-11-14 18:57:32,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:57:32,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:57:32,957 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand 162 states. [2018-11-14 18:57:32,958 INFO L87 Difference]: Start difference. First operand 161 states. Second operand 162 states. [2018-11-14 18:57:32,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:57:32,960 INFO L93 Difference]: Finished difference Result 162 states and 166 transitions. [2018-11-14 18:57:32,960 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 166 transitions. [2018-11-14 18:57:32,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:57:32,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:57:32,961 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:57:32,961 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:57:32,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-11-14 18:57:32,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 165 transitions. [2018-11-14 18:57:32,964 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 165 transitions. Word has length 217 [2018-11-14 18:57:32,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:57:32,964 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 165 transitions. [2018-11-14 18:57:32,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-14 18:57:32,965 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 165 transitions. [2018-11-14 18:57:32,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-11-14 18:57:32,966 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:57:32,966 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 29, 27, 24, 24, 9, 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-14 18:57:32,966 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:57:32,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:57:32,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1788125590, now seen corresponding path program 29 times [2018-11-14 18:57:32,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:57:32,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:57:32,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:57:32,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:57:32,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:57:32,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:57:33,596 INFO L256 TraceCheckUtils]: 0: Hoare triple {27833#true} call ULTIMATE.init(); {27833#true} is VALID [2018-11-14 18:57:33,597 INFO L273 TraceCheckUtils]: 1: Hoare triple {27833#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27833#true} is VALID [2018-11-14 18:57:33,597 INFO L273 TraceCheckUtils]: 2: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 18:57:33,597 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27833#true} {27833#true} #69#return; {27833#true} is VALID [2018-11-14 18:57:33,597 INFO L256 TraceCheckUtils]: 4: Hoare triple {27833#true} call #t~ret13 := main(); {27833#true} is VALID [2018-11-14 18:57:33,598 INFO L273 TraceCheckUtils]: 5: Hoare triple {27833#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; {27835#(= main_~i~1 0)} is VALID [2018-11-14 18:57:33,598 INFO L273 TraceCheckUtils]: 6: Hoare triple {27835#(= main_~i~1 0)} assume true; {27835#(= main_~i~1 0)} is VALID [2018-11-14 18:57:33,599 INFO L273 TraceCheckUtils]: 7: Hoare triple {27835#(= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {27835#(= main_~i~1 0)} is VALID [2018-11-14 18:57:33,600 INFO L273 TraceCheckUtils]: 8: Hoare triple {27835#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27836#(<= main_~i~1 1)} is VALID [2018-11-14 18:57:33,600 INFO L273 TraceCheckUtils]: 9: Hoare triple {27836#(<= main_~i~1 1)} assume true; {27836#(<= main_~i~1 1)} is VALID [2018-11-14 18:57:33,601 INFO L273 TraceCheckUtils]: 10: Hoare triple {27836#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {27836#(<= main_~i~1 1)} is VALID [2018-11-14 18:57:33,601 INFO L273 TraceCheckUtils]: 11: Hoare triple {27836#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27837#(<= main_~i~1 2)} is VALID [2018-11-14 18:57:33,602 INFO L273 TraceCheckUtils]: 12: Hoare triple {27837#(<= main_~i~1 2)} assume true; {27837#(<= main_~i~1 2)} is VALID [2018-11-14 18:57:33,602 INFO L273 TraceCheckUtils]: 13: Hoare triple {27837#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {27837#(<= main_~i~1 2)} is VALID [2018-11-14 18:57:33,603 INFO L273 TraceCheckUtils]: 14: Hoare triple {27837#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27838#(<= main_~i~1 3)} is VALID [2018-11-14 18:57:33,604 INFO L273 TraceCheckUtils]: 15: Hoare triple {27838#(<= main_~i~1 3)} assume true; {27838#(<= main_~i~1 3)} is VALID [2018-11-14 18:57:33,604 INFO L273 TraceCheckUtils]: 16: Hoare triple {27838#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {27838#(<= main_~i~1 3)} is VALID [2018-11-14 18:57:33,605 INFO L273 TraceCheckUtils]: 17: Hoare triple {27838#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27839#(<= main_~i~1 4)} is VALID [2018-11-14 18:57:33,605 INFO L273 TraceCheckUtils]: 18: Hoare triple {27839#(<= main_~i~1 4)} assume true; {27839#(<= main_~i~1 4)} is VALID [2018-11-14 18:57:33,606 INFO L273 TraceCheckUtils]: 19: Hoare triple {27839#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {27839#(<= main_~i~1 4)} is VALID [2018-11-14 18:57:33,607 INFO L273 TraceCheckUtils]: 20: Hoare triple {27839#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27840#(<= main_~i~1 5)} is VALID [2018-11-14 18:57:33,607 INFO L273 TraceCheckUtils]: 21: Hoare triple {27840#(<= main_~i~1 5)} assume true; {27840#(<= main_~i~1 5)} is VALID [2018-11-14 18:57:33,608 INFO L273 TraceCheckUtils]: 22: Hoare triple {27840#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {27840#(<= main_~i~1 5)} is VALID [2018-11-14 18:57:33,608 INFO L273 TraceCheckUtils]: 23: Hoare triple {27840#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27841#(<= main_~i~1 6)} is VALID [2018-11-14 18:57:33,609 INFO L273 TraceCheckUtils]: 24: Hoare triple {27841#(<= main_~i~1 6)} assume true; {27841#(<= main_~i~1 6)} is VALID [2018-11-14 18:57:33,609 INFO L273 TraceCheckUtils]: 25: Hoare triple {27841#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {27841#(<= main_~i~1 6)} is VALID [2018-11-14 18:57:33,610 INFO L273 TraceCheckUtils]: 26: Hoare triple {27841#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27842#(<= main_~i~1 7)} is VALID [2018-11-14 18:57:33,611 INFO L273 TraceCheckUtils]: 27: Hoare triple {27842#(<= main_~i~1 7)} assume true; {27842#(<= main_~i~1 7)} is VALID [2018-11-14 18:57:33,611 INFO L273 TraceCheckUtils]: 28: Hoare triple {27842#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {27842#(<= main_~i~1 7)} is VALID [2018-11-14 18:57:33,612 INFO L273 TraceCheckUtils]: 29: Hoare triple {27842#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27843#(<= main_~i~1 8)} is VALID [2018-11-14 18:57:33,612 INFO L273 TraceCheckUtils]: 30: Hoare triple {27843#(<= main_~i~1 8)} assume true; {27843#(<= main_~i~1 8)} is VALID [2018-11-14 18:57:33,613 INFO L273 TraceCheckUtils]: 31: Hoare triple {27843#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {27843#(<= main_~i~1 8)} is VALID [2018-11-14 18:57:33,613 INFO L273 TraceCheckUtils]: 32: Hoare triple {27843#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27844#(<= main_~i~1 9)} is VALID [2018-11-14 18:57:33,614 INFO L273 TraceCheckUtils]: 33: Hoare triple {27844#(<= main_~i~1 9)} assume true; {27844#(<= main_~i~1 9)} is VALID [2018-11-14 18:57:33,614 INFO L273 TraceCheckUtils]: 34: Hoare triple {27844#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {27844#(<= main_~i~1 9)} is VALID [2018-11-14 18:57:33,615 INFO L273 TraceCheckUtils]: 35: Hoare triple {27844#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27845#(<= main_~i~1 10)} is VALID [2018-11-14 18:57:33,616 INFO L273 TraceCheckUtils]: 36: Hoare triple {27845#(<= main_~i~1 10)} assume true; {27845#(<= main_~i~1 10)} is VALID [2018-11-14 18:57:33,616 INFO L273 TraceCheckUtils]: 37: Hoare triple {27845#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {27845#(<= main_~i~1 10)} is VALID [2018-11-14 18:57:33,617 INFO L273 TraceCheckUtils]: 38: Hoare triple {27845#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27846#(<= main_~i~1 11)} is VALID [2018-11-14 18:57:33,617 INFO L273 TraceCheckUtils]: 39: Hoare triple {27846#(<= main_~i~1 11)} assume true; {27846#(<= main_~i~1 11)} is VALID [2018-11-14 18:57:33,618 INFO L273 TraceCheckUtils]: 40: Hoare triple {27846#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {27846#(<= main_~i~1 11)} is VALID [2018-11-14 18:57:33,619 INFO L273 TraceCheckUtils]: 41: Hoare triple {27846#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27847#(<= main_~i~1 12)} is VALID [2018-11-14 18:57:33,619 INFO L273 TraceCheckUtils]: 42: Hoare triple {27847#(<= main_~i~1 12)} assume true; {27847#(<= main_~i~1 12)} is VALID [2018-11-14 18:57:33,620 INFO L273 TraceCheckUtils]: 43: Hoare triple {27847#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {27847#(<= main_~i~1 12)} is VALID [2018-11-14 18:57:33,620 INFO L273 TraceCheckUtils]: 44: Hoare triple {27847#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27848#(<= main_~i~1 13)} is VALID [2018-11-14 18:57:33,621 INFO L273 TraceCheckUtils]: 45: Hoare triple {27848#(<= main_~i~1 13)} assume true; {27848#(<= main_~i~1 13)} is VALID [2018-11-14 18:57:33,621 INFO L273 TraceCheckUtils]: 46: Hoare triple {27848#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {27848#(<= main_~i~1 13)} is VALID [2018-11-14 18:57:33,622 INFO L273 TraceCheckUtils]: 47: Hoare triple {27848#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27849#(<= main_~i~1 14)} is VALID [2018-11-14 18:57:33,623 INFO L273 TraceCheckUtils]: 48: Hoare triple {27849#(<= main_~i~1 14)} assume true; {27849#(<= main_~i~1 14)} is VALID [2018-11-14 18:57:33,623 INFO L273 TraceCheckUtils]: 49: Hoare triple {27849#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {27849#(<= main_~i~1 14)} is VALID [2018-11-14 18:57:33,624 INFO L273 TraceCheckUtils]: 50: Hoare triple {27849#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27850#(<= main_~i~1 15)} is VALID [2018-11-14 18:57:33,624 INFO L273 TraceCheckUtils]: 51: Hoare triple {27850#(<= main_~i~1 15)} assume true; {27850#(<= main_~i~1 15)} is VALID [2018-11-14 18:57:33,625 INFO L273 TraceCheckUtils]: 52: Hoare triple {27850#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {27850#(<= main_~i~1 15)} is VALID [2018-11-14 18:57:33,625 INFO L273 TraceCheckUtils]: 53: Hoare triple {27850#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27851#(<= main_~i~1 16)} is VALID [2018-11-14 18:57:33,626 INFO L273 TraceCheckUtils]: 54: Hoare triple {27851#(<= main_~i~1 16)} assume true; {27851#(<= main_~i~1 16)} is VALID [2018-11-14 18:57:33,626 INFO L273 TraceCheckUtils]: 55: Hoare triple {27851#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {27851#(<= main_~i~1 16)} is VALID [2018-11-14 18:57:33,627 INFO L273 TraceCheckUtils]: 56: Hoare triple {27851#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27852#(<= main_~i~1 17)} is VALID [2018-11-14 18:57:33,628 INFO L273 TraceCheckUtils]: 57: Hoare triple {27852#(<= main_~i~1 17)} assume true; {27852#(<= main_~i~1 17)} is VALID [2018-11-14 18:57:33,628 INFO L273 TraceCheckUtils]: 58: Hoare triple {27852#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {27852#(<= main_~i~1 17)} is VALID [2018-11-14 18:57:33,629 INFO L273 TraceCheckUtils]: 59: Hoare triple {27852#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27853#(<= main_~i~1 18)} is VALID [2018-11-14 18:57:33,629 INFO L273 TraceCheckUtils]: 60: Hoare triple {27853#(<= main_~i~1 18)} assume true; {27853#(<= main_~i~1 18)} is VALID [2018-11-14 18:57:33,630 INFO L273 TraceCheckUtils]: 61: Hoare triple {27853#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {27853#(<= main_~i~1 18)} is VALID [2018-11-14 18:57:33,631 INFO L273 TraceCheckUtils]: 62: Hoare triple {27853#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27854#(<= main_~i~1 19)} is VALID [2018-11-14 18:57:33,631 INFO L273 TraceCheckUtils]: 63: Hoare triple {27854#(<= main_~i~1 19)} assume true; {27854#(<= main_~i~1 19)} is VALID [2018-11-14 18:57:33,632 INFO L273 TraceCheckUtils]: 64: Hoare triple {27854#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {27854#(<= main_~i~1 19)} is VALID [2018-11-14 18:57:33,632 INFO L273 TraceCheckUtils]: 65: Hoare triple {27854#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27855#(<= main_~i~1 20)} is VALID [2018-11-14 18:57:33,633 INFO L273 TraceCheckUtils]: 66: Hoare triple {27855#(<= main_~i~1 20)} assume true; {27855#(<= main_~i~1 20)} is VALID [2018-11-14 18:57:33,633 INFO L273 TraceCheckUtils]: 67: Hoare triple {27855#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {27855#(<= main_~i~1 20)} is VALID [2018-11-14 18:57:33,634 INFO L273 TraceCheckUtils]: 68: Hoare triple {27855#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27856#(<= main_~i~1 21)} is VALID [2018-11-14 18:57:33,635 INFO L273 TraceCheckUtils]: 69: Hoare triple {27856#(<= main_~i~1 21)} assume true; {27856#(<= main_~i~1 21)} is VALID [2018-11-14 18:57:33,635 INFO L273 TraceCheckUtils]: 70: Hoare triple {27856#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {27856#(<= main_~i~1 21)} is VALID [2018-11-14 18:57:33,636 INFO L273 TraceCheckUtils]: 71: Hoare triple {27856#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27857#(<= main_~i~1 22)} is VALID [2018-11-14 18:57:33,636 INFO L273 TraceCheckUtils]: 72: Hoare triple {27857#(<= main_~i~1 22)} assume true; {27857#(<= main_~i~1 22)} is VALID [2018-11-14 18:57:33,637 INFO L273 TraceCheckUtils]: 73: Hoare triple {27857#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {27857#(<= main_~i~1 22)} is VALID [2018-11-14 18:57:33,637 INFO L273 TraceCheckUtils]: 74: Hoare triple {27857#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27858#(<= main_~i~1 23)} is VALID [2018-11-14 18:57:33,638 INFO L273 TraceCheckUtils]: 75: Hoare triple {27858#(<= main_~i~1 23)} assume true; {27858#(<= main_~i~1 23)} is VALID [2018-11-14 18:57:33,638 INFO L273 TraceCheckUtils]: 76: Hoare triple {27858#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {27858#(<= main_~i~1 23)} is VALID [2018-11-14 18:57:33,639 INFO L273 TraceCheckUtils]: 77: Hoare triple {27858#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27859#(<= main_~i~1 24)} is VALID [2018-11-14 18:57:33,640 INFO L273 TraceCheckUtils]: 78: Hoare triple {27859#(<= main_~i~1 24)} assume true; {27859#(<= main_~i~1 24)} is VALID [2018-11-14 18:57:33,640 INFO L273 TraceCheckUtils]: 79: Hoare triple {27859#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {27859#(<= main_~i~1 24)} is VALID [2018-11-14 18:57:33,641 INFO L273 TraceCheckUtils]: 80: Hoare triple {27859#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27860#(<= main_~i~1 25)} is VALID [2018-11-14 18:57:33,641 INFO L273 TraceCheckUtils]: 81: Hoare triple {27860#(<= main_~i~1 25)} assume true; {27860#(<= main_~i~1 25)} is VALID [2018-11-14 18:57:33,642 INFO L273 TraceCheckUtils]: 82: Hoare triple {27860#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {27860#(<= main_~i~1 25)} is VALID [2018-11-14 18:57:33,643 INFO L273 TraceCheckUtils]: 83: Hoare triple {27860#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27861#(<= main_~i~1 26)} is VALID [2018-11-14 18:57:33,643 INFO L273 TraceCheckUtils]: 84: Hoare triple {27861#(<= main_~i~1 26)} assume true; {27861#(<= main_~i~1 26)} is VALID [2018-11-14 18:57:33,644 INFO L273 TraceCheckUtils]: 85: Hoare triple {27861#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {27861#(<= main_~i~1 26)} is VALID [2018-11-14 18:57:33,644 INFO L273 TraceCheckUtils]: 86: Hoare triple {27861#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27862#(<= main_~i~1 27)} is VALID [2018-11-14 18:57:33,645 INFO L273 TraceCheckUtils]: 87: Hoare triple {27862#(<= main_~i~1 27)} assume true; {27862#(<= main_~i~1 27)} is VALID [2018-11-14 18:57:33,645 INFO L273 TraceCheckUtils]: 88: Hoare triple {27862#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {27862#(<= main_~i~1 27)} is VALID [2018-11-14 18:57:33,646 INFO L273 TraceCheckUtils]: 89: Hoare triple {27862#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27863#(<= main_~i~1 28)} is VALID [2018-11-14 18:57:33,647 INFO L273 TraceCheckUtils]: 90: Hoare triple {27863#(<= main_~i~1 28)} assume true; {27863#(<= main_~i~1 28)} is VALID [2018-11-14 18:57:33,647 INFO L273 TraceCheckUtils]: 91: Hoare triple {27863#(<= 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 + ~i~1 * 4, 4);havoc #t~nondet4; {27863#(<= main_~i~1 28)} is VALID [2018-11-14 18:57:33,648 INFO L273 TraceCheckUtils]: 92: Hoare triple {27863#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {27864#(<= main_~i~1 29)} is VALID [2018-11-14 18:57:33,648 INFO L273 TraceCheckUtils]: 93: Hoare triple {27864#(<= main_~i~1 29)} assume true; {27864#(<= main_~i~1 29)} is VALID [2018-11-14 18:57:33,649 INFO L273 TraceCheckUtils]: 94: Hoare triple {27864#(<= main_~i~1 29)} assume !(~i~1 < 100000); {27834#false} is VALID [2018-11-14 18:57:33,649 INFO L256 TraceCheckUtils]: 95: Hoare triple {27834#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {27833#true} is VALID [2018-11-14 18:57:33,649 INFO L273 TraceCheckUtils]: 96: Hoare triple {27833#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {27833#true} is VALID [2018-11-14 18:57:33,650 INFO L273 TraceCheckUtils]: 97: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 18:57:33,650 INFO L273 TraceCheckUtils]: 98: Hoare triple {27833#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 18:57:33,650 INFO L273 TraceCheckUtils]: 99: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 18:57:33,650 INFO L273 TraceCheckUtils]: 100: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 18:57:33,650 INFO L273 TraceCheckUtils]: 101: Hoare triple {27833#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 18:57:33,650 INFO L273 TraceCheckUtils]: 102: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 18:57:33,651 INFO L273 TraceCheckUtils]: 103: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 18:57:33,651 INFO L273 TraceCheckUtils]: 104: Hoare triple {27833#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 18:57:33,651 INFO L273 TraceCheckUtils]: 105: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 18:57:33,651 INFO L273 TraceCheckUtils]: 106: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 18:57:33,651 INFO L273 TraceCheckUtils]: 107: Hoare triple {27833#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 18:57:33,651 INFO L273 TraceCheckUtils]: 108: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 18:57:33,652 INFO L273 TraceCheckUtils]: 109: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 18:57:33,652 INFO L273 TraceCheckUtils]: 110: Hoare triple {27833#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 18:57:33,652 INFO L273 TraceCheckUtils]: 111: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 18:57:33,652 INFO L273 TraceCheckUtils]: 112: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 18:57:33,652 INFO L273 TraceCheckUtils]: 113: Hoare triple {27833#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 18:57:33,653 INFO L273 TraceCheckUtils]: 114: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 18:57:33,653 INFO L273 TraceCheckUtils]: 115: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 18:57:33,653 INFO L273 TraceCheckUtils]: 116: Hoare triple {27833#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 18:57:33,653 INFO L273 TraceCheckUtils]: 117: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 18:57:33,653 INFO L273 TraceCheckUtils]: 118: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 18:57:33,653 INFO L273 TraceCheckUtils]: 119: Hoare triple {27833#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 18:57:33,654 INFO L273 TraceCheckUtils]: 120: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 18:57:33,654 INFO L273 TraceCheckUtils]: 121: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 18:57:33,654 INFO L273 TraceCheckUtils]: 122: Hoare triple {27833#true} assume !(~i~0 < 100000); {27833#true} is VALID [2018-11-14 18:57:33,654 INFO L273 TraceCheckUtils]: 123: Hoare triple {27833#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {27833#true} is VALID [2018-11-14 18:57:33,654 INFO L273 TraceCheckUtils]: 124: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 18:57:33,654 INFO L268 TraceCheckUtils]: 125: Hoare quadruple {27833#true} {27834#false} #73#return; {27834#false} is VALID [2018-11-14 18:57:33,654 INFO L273 TraceCheckUtils]: 126: Hoare triple {27834#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {27834#false} is VALID [2018-11-14 18:57:33,654 INFO L256 TraceCheckUtils]: 127: Hoare triple {27834#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {27833#true} is VALID [2018-11-14 18:57:33,654 INFO L273 TraceCheckUtils]: 128: Hoare triple {27833#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {27833#true} is VALID [2018-11-14 18:57:33,655 INFO L273 TraceCheckUtils]: 129: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 18:57:33,655 INFO L273 TraceCheckUtils]: 130: Hoare triple {27833#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 18:57:33,655 INFO L273 TraceCheckUtils]: 131: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 18:57:33,655 INFO L273 TraceCheckUtils]: 132: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 18:57:33,655 INFO L273 TraceCheckUtils]: 133: Hoare triple {27833#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 18:57:33,655 INFO L273 TraceCheckUtils]: 134: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 18:57:33,655 INFO L273 TraceCheckUtils]: 135: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 18:57:33,655 INFO L273 TraceCheckUtils]: 136: Hoare triple {27833#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 18:57:33,655 INFO L273 TraceCheckUtils]: 137: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 18:57:33,656 INFO L273 TraceCheckUtils]: 138: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 18:57:33,656 INFO L273 TraceCheckUtils]: 139: Hoare triple {27833#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 18:57:33,656 INFO L273 TraceCheckUtils]: 140: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 18:57:33,656 INFO L273 TraceCheckUtils]: 141: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 18:57:33,656 INFO L273 TraceCheckUtils]: 142: Hoare triple {27833#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 18:57:33,656 INFO L273 TraceCheckUtils]: 143: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 18:57:33,656 INFO L273 TraceCheckUtils]: 144: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 18:57:33,656 INFO L273 TraceCheckUtils]: 145: Hoare triple {27833#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 18:57:33,656 INFO L273 TraceCheckUtils]: 146: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 18:57:33,656 INFO L273 TraceCheckUtils]: 147: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 18:57:33,657 INFO L273 TraceCheckUtils]: 148: Hoare triple {27833#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 18:57:33,657 INFO L273 TraceCheckUtils]: 149: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 18:57:33,657 INFO L273 TraceCheckUtils]: 150: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 18:57:33,657 INFO L273 TraceCheckUtils]: 151: Hoare triple {27833#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 18:57:33,657 INFO L273 TraceCheckUtils]: 152: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 18:57:33,657 INFO L273 TraceCheckUtils]: 153: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 18:57:33,657 INFO L273 TraceCheckUtils]: 154: Hoare triple {27833#true} assume !(~i~0 < 100000); {27833#true} is VALID [2018-11-14 18:57:33,657 INFO L273 TraceCheckUtils]: 155: Hoare triple {27833#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {27833#true} is VALID [2018-11-14 18:57:33,657 INFO L273 TraceCheckUtils]: 156: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 18:57:33,657 INFO L268 TraceCheckUtils]: 157: Hoare quadruple {27833#true} {27834#false} #75#return; {27834#false} is VALID [2018-11-14 18:57:33,658 INFO L273 TraceCheckUtils]: 158: Hoare triple {27834#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {27834#false} is VALID [2018-11-14 18:57:33,658 INFO L273 TraceCheckUtils]: 159: Hoare triple {27834#false} assume true; {27834#false} is VALID [2018-11-14 18:57:33,658 INFO L273 TraceCheckUtils]: 160: Hoare triple {27834#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {27834#false} is VALID [2018-11-14 18:57:33,658 INFO L273 TraceCheckUtils]: 161: Hoare triple {27834#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {27834#false} is VALID [2018-11-14 18:57:33,658 INFO L273 TraceCheckUtils]: 162: Hoare triple {27834#false} assume true; {27834#false} is VALID [2018-11-14 18:57:33,658 INFO L273 TraceCheckUtils]: 163: Hoare triple {27834#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {27834#false} is VALID [2018-11-14 18:57:33,658 INFO L273 TraceCheckUtils]: 164: Hoare triple {27834#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {27834#false} is VALID [2018-11-14 18:57:33,658 INFO L273 TraceCheckUtils]: 165: Hoare triple {27834#false} assume true; {27834#false} is VALID [2018-11-14 18:57:33,658 INFO L273 TraceCheckUtils]: 166: Hoare triple {27834#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {27834#false} is VALID [2018-11-14 18:57:33,658 INFO L273 TraceCheckUtils]: 167: Hoare triple {27834#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {27834#false} is VALID [2018-11-14 18:57:33,659 INFO L273 TraceCheckUtils]: 168: Hoare triple {27834#false} assume true; {27834#false} is VALID [2018-11-14 18:57:33,659 INFO L273 TraceCheckUtils]: 169: Hoare triple {27834#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {27834#false} is VALID [2018-11-14 18:57:33,659 INFO L273 TraceCheckUtils]: 170: Hoare triple {27834#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {27834#false} is VALID [2018-11-14 18:57:33,659 INFO L273 TraceCheckUtils]: 171: Hoare triple {27834#false} assume true; {27834#false} is VALID [2018-11-14 18:57:33,659 INFO L273 TraceCheckUtils]: 172: Hoare triple {27834#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {27834#false} is VALID [2018-11-14 18:57:33,659 INFO L273 TraceCheckUtils]: 173: Hoare triple {27834#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {27834#false} is VALID [2018-11-14 18:57:33,659 INFO L273 TraceCheckUtils]: 174: Hoare triple {27834#false} assume true; {27834#false} is VALID [2018-11-14 18:57:33,659 INFO L273 TraceCheckUtils]: 175: Hoare triple {27834#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {27834#false} is VALID [2018-11-14 18:57:33,659 INFO L273 TraceCheckUtils]: 176: Hoare triple {27834#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {27834#false} is VALID [2018-11-14 18:57:33,659 INFO L273 TraceCheckUtils]: 177: Hoare triple {27834#false} assume true; {27834#false} is VALID [2018-11-14 18:57:33,660 INFO L273 TraceCheckUtils]: 178: Hoare triple {27834#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {27834#false} is VALID [2018-11-14 18:57:33,660 INFO L273 TraceCheckUtils]: 179: Hoare triple {27834#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {27834#false} is VALID [2018-11-14 18:57:33,660 INFO L273 TraceCheckUtils]: 180: Hoare triple {27834#false} assume true; {27834#false} is VALID [2018-11-14 18:57:33,660 INFO L273 TraceCheckUtils]: 181: Hoare triple {27834#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {27834#false} is VALID [2018-11-14 18:57:33,660 INFO L273 TraceCheckUtils]: 182: Hoare triple {27834#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {27834#false} is VALID [2018-11-14 18:57:33,660 INFO L273 TraceCheckUtils]: 183: Hoare triple {27834#false} assume true; {27834#false} is VALID [2018-11-14 18:57:33,660 INFO L273 TraceCheckUtils]: 184: Hoare triple {27834#false} assume !(~i~2 < 99999); {27834#false} is VALID [2018-11-14 18:57:33,660 INFO L273 TraceCheckUtils]: 185: Hoare triple {27834#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 399996, 4); {27834#false} is VALID [2018-11-14 18:57:33,660 INFO L256 TraceCheckUtils]: 186: Hoare triple {27834#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {27833#true} is VALID [2018-11-14 18:57:33,660 INFO L273 TraceCheckUtils]: 187: Hoare triple {27833#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {27833#true} is VALID [2018-11-14 18:57:33,661 INFO L273 TraceCheckUtils]: 188: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 18:57:33,661 INFO L273 TraceCheckUtils]: 189: Hoare triple {27833#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 18:57:33,661 INFO L273 TraceCheckUtils]: 190: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 18:57:33,661 INFO L273 TraceCheckUtils]: 191: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 18:57:33,661 INFO L273 TraceCheckUtils]: 192: Hoare triple {27833#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 18:57:33,661 INFO L273 TraceCheckUtils]: 193: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 18:57:33,661 INFO L273 TraceCheckUtils]: 194: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 18:57:33,661 INFO L273 TraceCheckUtils]: 195: Hoare triple {27833#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 18:57:33,661 INFO L273 TraceCheckUtils]: 196: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 18:57:33,661 INFO L273 TraceCheckUtils]: 197: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 18:57:33,662 INFO L273 TraceCheckUtils]: 198: Hoare triple {27833#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 18:57:33,662 INFO L273 TraceCheckUtils]: 199: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 18:57:33,662 INFO L273 TraceCheckUtils]: 200: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 18:57:33,662 INFO L273 TraceCheckUtils]: 201: Hoare triple {27833#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 18:57:33,662 INFO L273 TraceCheckUtils]: 202: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 18:57:33,662 INFO L273 TraceCheckUtils]: 203: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 18:57:33,662 INFO L273 TraceCheckUtils]: 204: Hoare triple {27833#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 18:57:33,662 INFO L273 TraceCheckUtils]: 205: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 18:57:33,662 INFO L273 TraceCheckUtils]: 206: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 18:57:33,663 INFO L273 TraceCheckUtils]: 207: Hoare triple {27833#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 18:57:33,663 INFO L273 TraceCheckUtils]: 208: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 18:57:33,663 INFO L273 TraceCheckUtils]: 209: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 18:57:33,663 INFO L273 TraceCheckUtils]: 210: Hoare triple {27833#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {27833#true} is VALID [2018-11-14 18:57:33,663 INFO L273 TraceCheckUtils]: 211: Hoare triple {27833#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {27833#true} is VALID [2018-11-14 18:57:33,663 INFO L273 TraceCheckUtils]: 212: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 18:57:33,663 INFO L273 TraceCheckUtils]: 213: Hoare triple {27833#true} assume !(~i~0 < 100000); {27833#true} is VALID [2018-11-14 18:57:33,663 INFO L273 TraceCheckUtils]: 214: Hoare triple {27833#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {27833#true} is VALID [2018-11-14 18:57:33,663 INFO L273 TraceCheckUtils]: 215: Hoare triple {27833#true} assume true; {27833#true} is VALID [2018-11-14 18:57:33,663 INFO L268 TraceCheckUtils]: 216: Hoare quadruple {27833#true} {27834#false} #77#return; {27834#false} is VALID [2018-11-14 18:57:33,664 INFO L273 TraceCheckUtils]: 217: Hoare triple {27834#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {27834#false} is VALID [2018-11-14 18:57:33,664 INFO L273 TraceCheckUtils]: 218: Hoare triple {27834#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {27834#false} is VALID [2018-11-14 18:57:33,664 INFO L273 TraceCheckUtils]: 219: Hoare triple {27834#false} assume !false; {27834#false} is VALID [2018-11-14 18:57:33,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2366 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 1090 trivial. 0 not checked. [2018-11-14 18:57:33,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:57:33,686 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-14 18:57:33,701 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1