java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-crafted/bor4_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:25:54,117 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:25:54,119 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:25:54,131 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:25:54,132 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:25:54,133 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:25:54,134 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:25:54,136 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:25:54,138 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:25:54,139 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:25:54,140 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:25:54,140 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:25:54,141 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:25:54,142 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:25:54,143 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:25:54,144 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:25:54,145 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:25:54,147 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:25:54,149 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:25:54,151 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:25:54,152 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:25:54,153 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:25:54,156 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:25:54,156 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:25:54,157 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:25:54,158 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:25:54,159 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:25:54,160 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:25:54,161 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:25:54,162 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:25:54,162 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:25:54,163 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:25:54,163 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:25:54,164 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:25:54,165 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:25:54,166 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:25:54,166 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:25:54,182 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:25:54,182 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:25:54,183 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:25:54,183 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:25:54,184 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:25:54,184 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:25:54,184 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:25:54,185 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:25:54,185 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:25:54,185 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:25:54,185 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:25:54,185 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:25:54,186 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:25:54,186 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:25:54,186 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:25:54,186 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:25:54,186 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:25:54,187 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:25:54,187 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:25:54,187 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:25:54,187 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:25:54,187 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:25:54,188 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:25:54,188 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:25:54,188 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:25:54,188 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:25:54,188 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:25:54,189 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:25:54,189 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:25:54,189 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:25:54,189 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:25:54,237 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:25:54,253 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:25:54,257 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:25:54,259 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:25:54,259 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:25:54,260 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/bor4_true-unreach-call.i [2018-11-23 12:25:54,325 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f69b61c4/58e1b014178b44b8994040d32c71eb62/FLAGb266c8fde [2018-11-23 12:25:54,788 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:25:54,789 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/bor4_true-unreach-call.i [2018-11-23 12:25:54,798 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f69b61c4/58e1b014178b44b8994040d32c71eb62/FLAGb266c8fde [2018-11-23 12:25:55,120 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f69b61c4/58e1b014178b44b8994040d32c71eb62 [2018-11-23 12:25:55,130 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:25:55,131 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:25:55,132 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:25:55,132 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:25:55,136 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:25:55,140 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:25:55" (1/1) ... [2018-11-23 12:25:55,143 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@360eea2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:25:55, skipping insertion in model container [2018-11-23 12:25:55,143 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:25:55" (1/1) ... [2018-11-23 12:25:55,154 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:25:55,178 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:25:55,445 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:25:55,468 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:25:55,502 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:25:55,525 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:25:55,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:25:55 WrapperNode [2018-11-23 12:25:55,526 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:25:55,527 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:25:55,527 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:25:55,527 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:25:55,538 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:25:55" (1/1) ... [2018-11-23 12:25:55,552 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:25:55" (1/1) ... [2018-11-23 12:25:55,565 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:25:55,565 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:25:55,566 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:25:55,566 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:25:55,577 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:25:55" (1/1) ... [2018-11-23 12:25:55,577 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:25:55" (1/1) ... [2018-11-23 12:25:55,580 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:25:55" (1/1) ... [2018-11-23 12:25:55,581 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:25:55" (1/1) ... [2018-11-23 12:25:55,610 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:25:55" (1/1) ... [2018-11-23 12:25:55,627 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:25:55" (1/1) ... [2018-11-23 12:25:55,630 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:25:55" (1/1) ... [2018-11-23 12:25:55,634 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:25:55,634 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:25:55,638 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:25:55,638 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:25:55,641 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:25:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:25:55,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:25:55,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:25:55,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:25:55,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:25:55,787 INFO L130 BoogieDeclarations]: Found specification of procedure bor [2018-11-23 12:25:55,787 INFO L138 BoogieDeclarations]: Found implementation of procedure bor [2018-11-23 12:25:55,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:25:55,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:25:55,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:25:55,788 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:25:55,788 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:25:55,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:25:56,495 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:25:56,496 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 12:25:56,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:25:56 BoogieIcfgContainer [2018-11-23 12:25:56,497 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:25:56,498 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:25:56,499 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:25:56,503 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:25:56,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:25:55" (1/3) ... [2018-11-23 12:25:56,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a93bd0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:25:56, skipping insertion in model container [2018-11-23 12:25:56,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:25:55" (2/3) ... [2018-11-23 12:25:56,505 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a93bd0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:25:56, skipping insertion in model container [2018-11-23 12:25:56,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:25:56" (3/3) ... [2018-11-23 12:25:56,507 INFO L112 eAbstractionObserver]: Analyzing ICFG bor4_true-unreach-call.i [2018-11-23 12:25:56,516 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:25:56,524 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:25:56,543 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:25:56,577 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:25:56,578 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:25:56,578 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:25:56,578 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:25:56,579 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:25:56,579 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:25:56,579 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:25:56,579 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:25:56,579 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:25:56,600 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-23 12:25:56,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:25:56,608 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:25:56,609 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:25:56,612 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:25:56,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:25:56,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1283808693, now seen corresponding path program 1 times [2018-11-23 12:25:56,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:25:56,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:25:56,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:25:56,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:25:56,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:25:56,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:25:56,844 INFO L256 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {34#true} is VALID [2018-11-23 12:25:56,849 INFO L273 TraceCheckUtils]: 1: Hoare triple {34#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {34#true} is VALID [2018-11-23 12:25:56,850 INFO L273 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:25:56,850 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #66#return; {34#true} is VALID [2018-11-23 12:25:56,851 INFO L256 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret13 := main(); {34#true} is VALID [2018-11-23 12:25:56,851 INFO L273 TraceCheckUtils]: 5: Hoare triple {34#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {34#true} is VALID [2018-11-23 12:25:56,858 INFO L273 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2018-11-23 12:25:56,858 INFO L256 TraceCheckUtils]: 7: Hoare triple {35#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {34#true} is VALID [2018-11-23 12:25:56,859 INFO L273 TraceCheckUtils]: 8: Hoare triple {34#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {34#true} is VALID [2018-11-23 12:25:56,859 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#true} assume !(~i~0 < 100000); {34#true} is VALID [2018-11-23 12:25:56,860 INFO L273 TraceCheckUtils]: 10: Hoare triple {34#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {34#true} is VALID [2018-11-23 12:25:56,860 INFO L273 TraceCheckUtils]: 11: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:25:56,860 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {34#true} {35#false} #70#return; {35#false} is VALID [2018-11-23 12:25:56,861 INFO L273 TraceCheckUtils]: 13: Hoare triple {35#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {35#false} is VALID [2018-11-23 12:25:56,861 INFO L256 TraceCheckUtils]: 14: Hoare triple {35#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {34#true} is VALID [2018-11-23 12:25:56,862 INFO L273 TraceCheckUtils]: 15: Hoare triple {34#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {34#true} is VALID [2018-11-23 12:25:56,862 INFO L273 TraceCheckUtils]: 16: Hoare triple {34#true} assume !(~i~0 < 100000); {34#true} is VALID [2018-11-23 12:25:56,862 INFO L273 TraceCheckUtils]: 17: Hoare triple {34#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {34#true} is VALID [2018-11-23 12:25:56,863 INFO L273 TraceCheckUtils]: 18: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:25:56,863 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {34#true} {35#false} #72#return; {35#false} is VALID [2018-11-23 12:25:56,863 INFO L273 TraceCheckUtils]: 20: Hoare triple {35#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {35#false} is VALID [2018-11-23 12:25:56,864 INFO L273 TraceCheckUtils]: 21: Hoare triple {35#false} assume !true; {35#false} is VALID [2018-11-23 12:25:56,864 INFO L273 TraceCheckUtils]: 22: Hoare triple {35#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {35#false} is VALID [2018-11-23 12:25:56,864 INFO L256 TraceCheckUtils]: 23: Hoare triple {35#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {34#true} is VALID [2018-11-23 12:25:56,865 INFO L273 TraceCheckUtils]: 24: Hoare triple {34#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {34#true} is VALID [2018-11-23 12:25:56,865 INFO L273 TraceCheckUtils]: 25: Hoare triple {34#true} assume !(~i~0 < 100000); {34#true} is VALID [2018-11-23 12:25:56,865 INFO L273 TraceCheckUtils]: 26: Hoare triple {34#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {34#true} is VALID [2018-11-23 12:25:56,866 INFO L273 TraceCheckUtils]: 27: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:25:56,866 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {34#true} {35#false} #74#return; {35#false} is VALID [2018-11-23 12:25:56,866 INFO L273 TraceCheckUtils]: 29: Hoare triple {35#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {35#false} is VALID [2018-11-23 12:25:56,867 INFO L273 TraceCheckUtils]: 30: Hoare triple {35#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {35#false} is VALID [2018-11-23 12:25:56,867 INFO L273 TraceCheckUtils]: 31: Hoare triple {35#false} assume !false; {35#false} is VALID [2018-11-23 12:25:56,873 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 12:25:56,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:25:56,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:25:56,882 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-23 12:25:56,886 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:25:56,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:25:57,139 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:25:57,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:25:57,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:25:57,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:25:57,153 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-11-23 12:25:57,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:57,291 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2018-11-23 12:25:57,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:25:57,291 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-23 12:25:57,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:25:57,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:25:57,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-23 12:25:57,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:25:57,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-23 12:25:57,311 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 71 transitions. [2018-11-23 12:25:57,555 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:25:57,568 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:25:57,568 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 12:25:57,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:25:57,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 12:25:57,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 12:25:57,615 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:25:57,616 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-23 12:25:57,616 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 12:25:57,616 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 12:25:57,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:57,622 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-23 12:25:57,623 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 12:25:57,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:25:57,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:25:57,624 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 12:25:57,624 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 12:25:57,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:57,629 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-23 12:25:57,630 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 12:25:57,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:25:57,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:25:57,631 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:25:57,631 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:25:57,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:25:57,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-11-23 12:25:57,637 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 32 [2018-11-23 12:25:57,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:25:57,638 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-23 12:25:57,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:25:57,638 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 12:25:57,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:25:57,640 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:25:57,640 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:25:57,640 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:25:57,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:25:57,641 INFO L82 PathProgramCache]: Analyzing trace with hash 721846027, now seen corresponding path program 1 times [2018-11-23 12:25:57,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:25:57,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:25:57,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:25:57,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:25:57,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:25:57,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:25:57,743 INFO L256 TraceCheckUtils]: 0: Hoare triple {198#true} call ULTIMATE.init(); {198#true} is VALID [2018-11-23 12:25:57,744 INFO L273 TraceCheckUtils]: 1: Hoare triple {198#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {198#true} is VALID [2018-11-23 12:25:57,744 INFO L273 TraceCheckUtils]: 2: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:25:57,744 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {198#true} {198#true} #66#return; {198#true} is VALID [2018-11-23 12:25:57,745 INFO L256 TraceCheckUtils]: 4: Hoare triple {198#true} call #t~ret13 := main(); {198#true} is VALID [2018-11-23 12:25:57,749 INFO L273 TraceCheckUtils]: 5: Hoare triple {198#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {200#(= main_~i~1 0)} is VALID [2018-11-23 12:25:57,752 INFO L273 TraceCheckUtils]: 6: Hoare triple {200#(= main_~i~1 0)} assume !(~i~1 < 100000); {199#false} is VALID [2018-11-23 12:25:57,752 INFO L256 TraceCheckUtils]: 7: Hoare triple {199#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {198#true} is VALID [2018-11-23 12:25:57,752 INFO L273 TraceCheckUtils]: 8: Hoare triple {198#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {198#true} is VALID [2018-11-23 12:25:57,753 INFO L273 TraceCheckUtils]: 9: Hoare triple {198#true} assume !(~i~0 < 100000); {198#true} is VALID [2018-11-23 12:25:57,753 INFO L273 TraceCheckUtils]: 10: Hoare triple {198#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {198#true} is VALID [2018-11-23 12:25:57,753 INFO L273 TraceCheckUtils]: 11: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:25:57,753 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {198#true} {199#false} #70#return; {199#false} is VALID [2018-11-23 12:25:57,754 INFO L273 TraceCheckUtils]: 13: Hoare triple {199#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {199#false} is VALID [2018-11-23 12:25:57,754 INFO L256 TraceCheckUtils]: 14: Hoare triple {199#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {198#true} is VALID [2018-11-23 12:25:57,754 INFO L273 TraceCheckUtils]: 15: Hoare triple {198#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {198#true} is VALID [2018-11-23 12:25:57,754 INFO L273 TraceCheckUtils]: 16: Hoare triple {198#true} assume !(~i~0 < 100000); {198#true} is VALID [2018-11-23 12:25:57,754 INFO L273 TraceCheckUtils]: 17: Hoare triple {198#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {198#true} is VALID [2018-11-23 12:25:57,755 INFO L273 TraceCheckUtils]: 18: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:25:57,755 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {198#true} {199#false} #72#return; {199#false} is VALID [2018-11-23 12:25:57,755 INFO L273 TraceCheckUtils]: 20: Hoare triple {199#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {199#false} is VALID [2018-11-23 12:25:57,756 INFO L273 TraceCheckUtils]: 21: Hoare triple {199#false} assume !(~i~2 < 99999); {199#false} is VALID [2018-11-23 12:25:57,756 INFO L273 TraceCheckUtils]: 22: Hoare triple {199#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {199#false} is VALID [2018-11-23 12:25:57,756 INFO L256 TraceCheckUtils]: 23: Hoare triple {199#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {198#true} is VALID [2018-11-23 12:25:57,757 INFO L273 TraceCheckUtils]: 24: Hoare triple {198#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {198#true} is VALID [2018-11-23 12:25:57,757 INFO L273 TraceCheckUtils]: 25: Hoare triple {198#true} assume !(~i~0 < 100000); {198#true} is VALID [2018-11-23 12:25:57,757 INFO L273 TraceCheckUtils]: 26: Hoare triple {198#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {198#true} is VALID [2018-11-23 12:25:57,758 INFO L273 TraceCheckUtils]: 27: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:25:57,758 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {198#true} {199#false} #74#return; {199#false} is VALID [2018-11-23 12:25:57,758 INFO L273 TraceCheckUtils]: 29: Hoare triple {199#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {199#false} is VALID [2018-11-23 12:25:57,759 INFO L273 TraceCheckUtils]: 30: Hoare triple {199#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {199#false} is VALID [2018-11-23 12:25:57,759 INFO L273 TraceCheckUtils]: 31: Hoare triple {199#false} assume !false; {199#false} is VALID [2018-11-23 12:25:57,761 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 12:25:57,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:25:57,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:25:57,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 12:25:57,764 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:25:57,765 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:25:57,848 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:25:57,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:25:57,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:25:57,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:25:57,850 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 3 states. [2018-11-23 12:25:58,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:58,480 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-23 12:25:58,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:25:58,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 12:25:58,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:25:58,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:25:58,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2018-11-23 12:25:58,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:25:58,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2018-11-23 12:25:58,488 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2018-11-23 12:25:58,589 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:25:58,592 INFO L225 Difference]: With dead ends: 46 [2018-11-23 12:25:58,593 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 12:25:58,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:25:58,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 12:25:58,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-23 12:25:58,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:25:58,613 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 27 states. [2018-11-23 12:25:58,613 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 27 states. [2018-11-23 12:25:58,613 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 27 states. [2018-11-23 12:25:58,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:58,620 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 12:25:58,621 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 12:25:58,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:25:58,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:25:58,622 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states. [2018-11-23 12:25:58,622 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states. [2018-11-23 12:25:58,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:58,627 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 12:25:58,627 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 12:25:58,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:25:58,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:25:58,628 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:25:58,629 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:25:58,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:25:58,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-23 12:25:58,632 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 32 [2018-11-23 12:25:58,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:25:58,632 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 12:25:58,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:25:58,633 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-23 12:25:58,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 12:25:58,634 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:25:58,634 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:25:58,635 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:25:58,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:25:58,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1487444845, now seen corresponding path program 1 times [2018-11-23 12:25:58,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:25:58,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:25:58,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:25:58,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:25:58,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:25:58,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:25:58,755 INFO L256 TraceCheckUtils]: 0: Hoare triple {362#true} call ULTIMATE.init(); {362#true} is VALID [2018-11-23 12:25:58,755 INFO L273 TraceCheckUtils]: 1: Hoare triple {362#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {362#true} is VALID [2018-11-23 12:25:58,756 INFO L273 TraceCheckUtils]: 2: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:25:58,757 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {362#true} {362#true} #66#return; {362#true} is VALID [2018-11-23 12:25:58,757 INFO L256 TraceCheckUtils]: 4: Hoare triple {362#true} call #t~ret13 := main(); {362#true} is VALID [2018-11-23 12:25:58,757 INFO L273 TraceCheckUtils]: 5: Hoare triple {362#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {362#true} is VALID [2018-11-23 12:25:58,758 INFO L273 TraceCheckUtils]: 6: Hoare triple {362#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {362#true} is VALID [2018-11-23 12:25:58,758 INFO L273 TraceCheckUtils]: 7: Hoare triple {362#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {362#true} is VALID [2018-11-23 12:25:58,758 INFO L273 TraceCheckUtils]: 8: Hoare triple {362#true} assume !(~i~1 < 100000); {362#true} is VALID [2018-11-23 12:25:58,759 INFO L256 TraceCheckUtils]: 9: Hoare triple {362#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {362#true} is VALID [2018-11-23 12:25:58,759 INFO L273 TraceCheckUtils]: 10: Hoare triple {362#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {364#(= bor_~i~0 1)} is VALID [2018-11-23 12:25:58,762 INFO L273 TraceCheckUtils]: 11: Hoare triple {364#(= bor_~i~0 1)} assume !(~i~0 < 100000); {363#false} is VALID [2018-11-23 12:25:58,762 INFO L273 TraceCheckUtils]: 12: Hoare triple {363#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {363#false} is VALID [2018-11-23 12:25:58,762 INFO L273 TraceCheckUtils]: 13: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:25:58,763 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {363#false} {362#true} #70#return; {363#false} is VALID [2018-11-23 12:25:58,763 INFO L273 TraceCheckUtils]: 15: Hoare triple {363#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {363#false} is VALID [2018-11-23 12:25:58,763 INFO L256 TraceCheckUtils]: 16: Hoare triple {363#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {362#true} is VALID [2018-11-23 12:25:58,763 INFO L273 TraceCheckUtils]: 17: Hoare triple {362#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {362#true} is VALID [2018-11-23 12:25:58,764 INFO L273 TraceCheckUtils]: 18: Hoare triple {362#true} assume !(~i~0 < 100000); {362#true} is VALID [2018-11-23 12:25:58,764 INFO L273 TraceCheckUtils]: 19: Hoare triple {362#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {362#true} is VALID [2018-11-23 12:25:58,764 INFO L273 TraceCheckUtils]: 20: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:25:58,765 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {362#true} {363#false} #72#return; {363#false} is VALID [2018-11-23 12:25:58,765 INFO L273 TraceCheckUtils]: 22: Hoare triple {363#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {363#false} is VALID [2018-11-23 12:25:58,765 INFO L273 TraceCheckUtils]: 23: Hoare triple {363#false} assume !(~i~2 < 99999); {363#false} is VALID [2018-11-23 12:25:58,765 INFO L273 TraceCheckUtils]: 24: Hoare triple {363#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {363#false} is VALID [2018-11-23 12:25:58,766 INFO L256 TraceCheckUtils]: 25: Hoare triple {363#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {362#true} is VALID [2018-11-23 12:25:58,766 INFO L273 TraceCheckUtils]: 26: Hoare triple {362#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {362#true} is VALID [2018-11-23 12:25:58,766 INFO L273 TraceCheckUtils]: 27: Hoare triple {362#true} assume !(~i~0 < 100000); {362#true} is VALID [2018-11-23 12:25:58,767 INFO L273 TraceCheckUtils]: 28: Hoare triple {362#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {362#true} is VALID [2018-11-23 12:25:58,767 INFO L273 TraceCheckUtils]: 29: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:25:58,767 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {362#true} {363#false} #74#return; {363#false} is VALID [2018-11-23 12:25:58,768 INFO L273 TraceCheckUtils]: 31: Hoare triple {363#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {363#false} is VALID [2018-11-23 12:25:58,768 INFO L273 TraceCheckUtils]: 32: Hoare triple {363#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {363#false} is VALID [2018-11-23 12:25:58,768 INFO L273 TraceCheckUtils]: 33: Hoare triple {363#false} assume !false; {363#false} is VALID [2018-11-23 12:25:58,771 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 12:25:58,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:25:58,771 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:25:58,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:25:58,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:25:58,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:25:58,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:25:59,010 INFO L256 TraceCheckUtils]: 0: Hoare triple {362#true} call ULTIMATE.init(); {362#true} is VALID [2018-11-23 12:25:59,011 INFO L273 TraceCheckUtils]: 1: Hoare triple {362#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {362#true} is VALID [2018-11-23 12:25:59,011 INFO L273 TraceCheckUtils]: 2: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:25:59,011 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {362#true} {362#true} #66#return; {362#true} is VALID [2018-11-23 12:25:59,012 INFO L256 TraceCheckUtils]: 4: Hoare triple {362#true} call #t~ret13 := main(); {362#true} is VALID [2018-11-23 12:25:59,012 INFO L273 TraceCheckUtils]: 5: Hoare triple {362#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {362#true} is VALID [2018-11-23 12:25:59,012 INFO L273 TraceCheckUtils]: 6: Hoare triple {362#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {362#true} is VALID [2018-11-23 12:25:59,012 INFO L273 TraceCheckUtils]: 7: Hoare triple {362#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {362#true} is VALID [2018-11-23 12:25:59,013 INFO L273 TraceCheckUtils]: 8: Hoare triple {362#true} assume !(~i~1 < 100000); {362#true} is VALID [2018-11-23 12:25:59,013 INFO L256 TraceCheckUtils]: 9: Hoare triple {362#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {362#true} is VALID [2018-11-23 12:25:59,018 INFO L273 TraceCheckUtils]: 10: Hoare triple {362#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {398#(<= bor_~i~0 1)} is VALID [2018-11-23 12:25:59,019 INFO L273 TraceCheckUtils]: 11: Hoare triple {398#(<= bor_~i~0 1)} assume !(~i~0 < 100000); {363#false} is VALID [2018-11-23 12:25:59,020 INFO L273 TraceCheckUtils]: 12: Hoare triple {363#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {363#false} is VALID [2018-11-23 12:25:59,020 INFO L273 TraceCheckUtils]: 13: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:25:59,020 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {363#false} {362#true} #70#return; {363#false} is VALID [2018-11-23 12:25:59,020 INFO L273 TraceCheckUtils]: 15: Hoare triple {363#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {363#false} is VALID [2018-11-23 12:25:59,021 INFO L256 TraceCheckUtils]: 16: Hoare triple {363#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {363#false} is VALID [2018-11-23 12:25:59,021 INFO L273 TraceCheckUtils]: 17: Hoare triple {363#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {363#false} is VALID [2018-11-23 12:25:59,021 INFO L273 TraceCheckUtils]: 18: Hoare triple {363#false} assume !(~i~0 < 100000); {363#false} is VALID [2018-11-23 12:25:59,022 INFO L273 TraceCheckUtils]: 19: Hoare triple {363#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {363#false} is VALID [2018-11-23 12:25:59,022 INFO L273 TraceCheckUtils]: 20: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:25:59,022 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {363#false} {363#false} #72#return; {363#false} is VALID [2018-11-23 12:25:59,022 INFO L273 TraceCheckUtils]: 22: Hoare triple {363#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {363#false} is VALID [2018-11-23 12:25:59,023 INFO L273 TraceCheckUtils]: 23: Hoare triple {363#false} assume !(~i~2 < 99999); {363#false} is VALID [2018-11-23 12:25:59,023 INFO L273 TraceCheckUtils]: 24: Hoare triple {363#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {363#false} is VALID [2018-11-23 12:25:59,023 INFO L256 TraceCheckUtils]: 25: Hoare triple {363#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {363#false} is VALID [2018-11-23 12:25:59,023 INFO L273 TraceCheckUtils]: 26: Hoare triple {363#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {363#false} is VALID [2018-11-23 12:25:59,024 INFO L273 TraceCheckUtils]: 27: Hoare triple {363#false} assume !(~i~0 < 100000); {363#false} is VALID [2018-11-23 12:25:59,024 INFO L273 TraceCheckUtils]: 28: Hoare triple {363#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {363#false} is VALID [2018-11-23 12:25:59,024 INFO L273 TraceCheckUtils]: 29: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:25:59,025 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {363#false} {363#false} #74#return; {363#false} is VALID [2018-11-23 12:25:59,025 INFO L273 TraceCheckUtils]: 31: Hoare triple {363#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {363#false} is VALID [2018-11-23 12:25:59,025 INFO L273 TraceCheckUtils]: 32: Hoare triple {363#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {363#false} is VALID [2018-11-23 12:25:59,026 INFO L273 TraceCheckUtils]: 33: Hoare triple {363#false} assume !false; {363#false} is VALID [2018-11-23 12:25:59,028 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 12:25:59,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:25:59,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-11-23 12:25:59,058 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 12:25:59,060 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:25:59,060 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:25:59,134 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:25:59,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:25:59,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:25:59,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:25:59,135 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 4 states. [2018-11-23 12:25:59,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:59,532 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2018-11-23 12:25:59,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:25:59,533 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 12:25:59,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:25:59,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:25:59,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2018-11-23 12:25:59,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:25:59,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2018-11-23 12:25:59,540 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2018-11-23 12:25:59,667 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:25:59,670 INFO L225 Difference]: With dead ends: 46 [2018-11-23 12:25:59,670 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 12:25:59,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:25:59,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 12:25:59,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-11-23 12:25:59,694 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:25:59,694 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 28 states. [2018-11-23 12:25:59,694 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 28 states. [2018-11-23 12:25:59,694 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 28 states. [2018-11-23 12:25:59,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:59,697 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-23 12:25:59,698 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 12:25:59,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:25:59,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:25:59,699 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 29 states. [2018-11-23 12:25:59,699 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 29 states. [2018-11-23 12:25:59,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:59,702 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-23 12:25:59,702 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 12:25:59,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:25:59,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:25:59,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:25:59,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:25:59,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:25:59,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-11-23 12:25:59,706 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 34 [2018-11-23 12:25:59,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:25:59,706 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-23 12:25:59,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:25:59,706 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 12:25:59,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 12:25:59,708 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:25:59,708 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:25:59,708 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:25:59,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:25:59,709 INFO L82 PathProgramCache]: Analyzing trace with hash 2063023467, now seen corresponding path program 1 times [2018-11-23 12:25:59,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:25:59,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:25:59,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:25:59,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:25:59,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:25:59,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:25:59,829 INFO L256 TraceCheckUtils]: 0: Hoare triple {630#true} call ULTIMATE.init(); {630#true} is VALID [2018-11-23 12:25:59,829 INFO L273 TraceCheckUtils]: 1: Hoare triple {630#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {630#true} is VALID [2018-11-23 12:25:59,830 INFO L273 TraceCheckUtils]: 2: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:25:59,830 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {630#true} {630#true} #66#return; {630#true} is VALID [2018-11-23 12:25:59,830 INFO L256 TraceCheckUtils]: 4: Hoare triple {630#true} call #t~ret13 := main(); {630#true} is VALID [2018-11-23 12:25:59,830 INFO L273 TraceCheckUtils]: 5: Hoare triple {630#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {630#true} is VALID [2018-11-23 12:25:59,830 INFO L273 TraceCheckUtils]: 6: Hoare triple {630#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {630#true} is VALID [2018-11-23 12:25:59,831 INFO L273 TraceCheckUtils]: 7: Hoare triple {630#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {630#true} is VALID [2018-11-23 12:25:59,831 INFO L273 TraceCheckUtils]: 8: Hoare triple {630#true} assume !(~i~1 < 100000); {630#true} is VALID [2018-11-23 12:25:59,831 INFO L256 TraceCheckUtils]: 9: Hoare triple {630#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {630#true} is VALID [2018-11-23 12:25:59,831 INFO L273 TraceCheckUtils]: 10: Hoare triple {630#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {630#true} is VALID [2018-11-23 12:25:59,832 INFO L273 TraceCheckUtils]: 11: Hoare triple {630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {630#true} is VALID [2018-11-23 12:25:59,832 INFO L273 TraceCheckUtils]: 12: Hoare triple {630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {630#true} is VALID [2018-11-23 12:25:59,832 INFO L273 TraceCheckUtils]: 13: Hoare triple {630#true} assume !(~i~0 < 100000); {630#true} is VALID [2018-11-23 12:25:59,832 INFO L273 TraceCheckUtils]: 14: Hoare triple {630#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {630#true} is VALID [2018-11-23 12:25:59,832 INFO L273 TraceCheckUtils]: 15: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:25:59,833 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {630#true} {630#true} #70#return; {630#true} is VALID [2018-11-23 12:25:59,833 INFO L273 TraceCheckUtils]: 17: Hoare triple {630#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {630#true} is VALID [2018-11-23 12:25:59,834 INFO L256 TraceCheckUtils]: 18: Hoare triple {630#true} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {630#true} is VALID [2018-11-23 12:25:59,834 INFO L273 TraceCheckUtils]: 19: Hoare triple {630#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {630#true} is VALID [2018-11-23 12:25:59,834 INFO L273 TraceCheckUtils]: 20: Hoare triple {630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {630#true} is VALID [2018-11-23 12:25:59,834 INFO L273 TraceCheckUtils]: 21: Hoare triple {630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {630#true} is VALID [2018-11-23 12:25:59,835 INFO L273 TraceCheckUtils]: 22: Hoare triple {630#true} assume !(~i~0 < 100000); {630#true} is VALID [2018-11-23 12:25:59,835 INFO L273 TraceCheckUtils]: 23: Hoare triple {630#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {630#true} is VALID [2018-11-23 12:25:59,835 INFO L273 TraceCheckUtils]: 24: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:25:59,836 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {630#true} {630#true} #72#return; {630#true} is VALID [2018-11-23 12:25:59,843 INFO L273 TraceCheckUtils]: 26: Hoare triple {630#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {632#(= main_~i~2 0)} is VALID [2018-11-23 12:25:59,844 INFO L273 TraceCheckUtils]: 27: Hoare triple {632#(= main_~i~2 0)} assume !(~i~2 < 99999); {631#false} is VALID [2018-11-23 12:25:59,844 INFO L273 TraceCheckUtils]: 28: Hoare triple {631#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {631#false} is VALID [2018-11-23 12:25:59,844 INFO L256 TraceCheckUtils]: 29: Hoare triple {631#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {630#true} is VALID [2018-11-23 12:25:59,844 INFO L273 TraceCheckUtils]: 30: Hoare triple {630#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {630#true} is VALID [2018-11-23 12:25:59,845 INFO L273 TraceCheckUtils]: 31: Hoare triple {630#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {630#true} is VALID [2018-11-23 12:25:59,845 INFO L273 TraceCheckUtils]: 32: Hoare triple {630#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {630#true} is VALID [2018-11-23 12:25:59,845 INFO L273 TraceCheckUtils]: 33: Hoare triple {630#true} assume !(~i~0 < 100000); {630#true} is VALID [2018-11-23 12:25:59,845 INFO L273 TraceCheckUtils]: 34: Hoare triple {630#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {630#true} is VALID [2018-11-23 12:25:59,845 INFO L273 TraceCheckUtils]: 35: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:25:59,846 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {630#true} {631#false} #74#return; {631#false} is VALID [2018-11-23 12:25:59,846 INFO L273 TraceCheckUtils]: 37: Hoare triple {631#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {631#false} is VALID [2018-11-23 12:25:59,846 INFO L273 TraceCheckUtils]: 38: Hoare triple {631#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {631#false} is VALID [2018-11-23 12:25:59,846 INFO L273 TraceCheckUtils]: 39: Hoare triple {631#false} assume !false; {631#false} is VALID [2018-11-23 12:25:59,849 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-23 12:25:59,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:25:59,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:25:59,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-23 12:25:59,850 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:25:59,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:25:59,933 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:25:59,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:25:59,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:25:59,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:25:59,934 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 3 states. [2018-11-23 12:26:00,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:00,024 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-11-23 12:26:00,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:26:00,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-23 12:26:00,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:00,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:26:00,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2018-11-23 12:26:00,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:26:00,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2018-11-23 12:26:00,030 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 45 transitions. [2018-11-23 12:26:00,129 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:00,131 INFO L225 Difference]: With dead ends: 43 [2018-11-23 12:26:00,131 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 12:26:00,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:26:00,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 12:26:00,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-23 12:26:00,142 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:00,142 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2018-11-23 12:26:00,142 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2018-11-23 12:26:00,142 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2018-11-23 12:26:00,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:00,146 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-23 12:26:00,146 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-23 12:26:00,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:00,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:00,147 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2018-11-23 12:26:00,147 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2018-11-23 12:26:00,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:00,150 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-23 12:26:00,150 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-23 12:26:00,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:00,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:00,151 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:00,151 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:00,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:26:00,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-11-23 12:26:00,153 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 40 [2018-11-23 12:26:00,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:00,154 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-23 12:26:00,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:26:00,154 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 12:26:00,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 12:26:00,155 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:00,156 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:26:00,156 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:00,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:00,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1550668567, now seen corresponding path program 1 times [2018-11-23 12:26:00,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:00,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:00,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:00,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:26:00,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:00,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:00,266 INFO L256 TraceCheckUtils]: 0: Hoare triple {799#true} call ULTIMATE.init(); {799#true} is VALID [2018-11-23 12:26:00,266 INFO L273 TraceCheckUtils]: 1: Hoare triple {799#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {799#true} is VALID [2018-11-23 12:26:00,266 INFO L273 TraceCheckUtils]: 2: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:26:00,267 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {799#true} {799#true} #66#return; {799#true} is VALID [2018-11-23 12:26:00,267 INFO L256 TraceCheckUtils]: 4: Hoare triple {799#true} call #t~ret13 := main(); {799#true} is VALID [2018-11-23 12:26:00,267 INFO L273 TraceCheckUtils]: 5: Hoare triple {799#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {801#(= main_~i~1 0)} is VALID [2018-11-23 12:26:00,268 INFO L273 TraceCheckUtils]: 6: Hoare triple {801#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {801#(= main_~i~1 0)} is VALID [2018-11-23 12:26:00,269 INFO L273 TraceCheckUtils]: 7: Hoare triple {801#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {802#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:00,269 INFO L273 TraceCheckUtils]: 8: Hoare triple {802#(<= main_~i~1 1)} assume !(~i~1 < 100000); {800#false} is VALID [2018-11-23 12:26:00,269 INFO L256 TraceCheckUtils]: 9: Hoare triple {800#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {799#true} is VALID [2018-11-23 12:26:00,270 INFO L273 TraceCheckUtils]: 10: Hoare triple {799#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {799#true} is VALID [2018-11-23 12:26:00,270 INFO L273 TraceCheckUtils]: 11: Hoare triple {799#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {799#true} is VALID [2018-11-23 12:26:00,270 INFO L273 TraceCheckUtils]: 12: Hoare triple {799#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {799#true} is VALID [2018-11-23 12:26:00,270 INFO L273 TraceCheckUtils]: 13: Hoare triple {799#true} assume !(~i~0 < 100000); {799#true} is VALID [2018-11-23 12:26:00,270 INFO L273 TraceCheckUtils]: 14: Hoare triple {799#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {799#true} is VALID [2018-11-23 12:26:00,271 INFO L273 TraceCheckUtils]: 15: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:26:00,271 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {799#true} {800#false} #70#return; {800#false} is VALID [2018-11-23 12:26:00,271 INFO L273 TraceCheckUtils]: 17: Hoare triple {800#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {800#false} is VALID [2018-11-23 12:26:00,272 INFO L256 TraceCheckUtils]: 18: Hoare triple {800#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {799#true} is VALID [2018-11-23 12:26:00,272 INFO L273 TraceCheckUtils]: 19: Hoare triple {799#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {799#true} is VALID [2018-11-23 12:26:00,272 INFO L273 TraceCheckUtils]: 20: Hoare triple {799#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {799#true} is VALID [2018-11-23 12:26:00,273 INFO L273 TraceCheckUtils]: 21: Hoare triple {799#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {799#true} is VALID [2018-11-23 12:26:00,273 INFO L273 TraceCheckUtils]: 22: Hoare triple {799#true} assume !(~i~0 < 100000); {799#true} is VALID [2018-11-23 12:26:00,274 INFO L273 TraceCheckUtils]: 23: Hoare triple {799#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {799#true} is VALID [2018-11-23 12:26:00,274 INFO L273 TraceCheckUtils]: 24: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:26:00,274 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {799#true} {800#false} #72#return; {800#false} is VALID [2018-11-23 12:26:00,274 INFO L273 TraceCheckUtils]: 26: Hoare triple {800#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {800#false} is VALID [2018-11-23 12:26:00,275 INFO L273 TraceCheckUtils]: 27: Hoare triple {800#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {800#false} is VALID [2018-11-23 12:26:00,275 INFO L273 TraceCheckUtils]: 28: Hoare triple {800#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {800#false} is VALID [2018-11-23 12:26:00,275 INFO L273 TraceCheckUtils]: 29: Hoare triple {800#false} assume !(~i~2 < 99999); {800#false} is VALID [2018-11-23 12:26:00,276 INFO L273 TraceCheckUtils]: 30: Hoare triple {800#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {800#false} is VALID [2018-11-23 12:26:00,276 INFO L256 TraceCheckUtils]: 31: Hoare triple {800#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {799#true} is VALID [2018-11-23 12:26:00,276 INFO L273 TraceCheckUtils]: 32: Hoare triple {799#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {799#true} is VALID [2018-11-23 12:26:00,277 INFO L273 TraceCheckUtils]: 33: Hoare triple {799#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {799#true} is VALID [2018-11-23 12:26:00,277 INFO L273 TraceCheckUtils]: 34: Hoare triple {799#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {799#true} is VALID [2018-11-23 12:26:00,277 INFO L273 TraceCheckUtils]: 35: Hoare triple {799#true} assume !(~i~0 < 100000); {799#true} is VALID [2018-11-23 12:26:00,277 INFO L273 TraceCheckUtils]: 36: Hoare triple {799#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {799#true} is VALID [2018-11-23 12:26:00,277 INFO L273 TraceCheckUtils]: 37: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:26:00,278 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {799#true} {800#false} #74#return; {800#false} is VALID [2018-11-23 12:26:00,278 INFO L273 TraceCheckUtils]: 39: Hoare triple {800#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {800#false} is VALID [2018-11-23 12:26:00,278 INFO L273 TraceCheckUtils]: 40: Hoare triple {800#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {800#false} is VALID [2018-11-23 12:26:00,279 INFO L273 TraceCheckUtils]: 41: Hoare triple {800#false} assume !false; {800#false} is VALID [2018-11-23 12:26:00,281 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-23 12:26:00,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:00,282 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:00,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:26:00,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:00,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:00,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:00,717 INFO L256 TraceCheckUtils]: 0: Hoare triple {799#true} call ULTIMATE.init(); {799#true} is VALID [2018-11-23 12:26:00,718 INFO L273 TraceCheckUtils]: 1: Hoare triple {799#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {799#true} is VALID [2018-11-23 12:26:00,718 INFO L273 TraceCheckUtils]: 2: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:26:00,718 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {799#true} {799#true} #66#return; {799#true} is VALID [2018-11-23 12:26:00,719 INFO L256 TraceCheckUtils]: 4: Hoare triple {799#true} call #t~ret13 := main(); {799#true} is VALID [2018-11-23 12:26:00,719 INFO L273 TraceCheckUtils]: 5: Hoare triple {799#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {821#(<= main_~i~1 0)} is VALID [2018-11-23 12:26:00,720 INFO L273 TraceCheckUtils]: 6: Hoare triple {821#(<= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {821#(<= main_~i~1 0)} is VALID [2018-11-23 12:26:00,721 INFO L273 TraceCheckUtils]: 7: Hoare triple {821#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {802#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:00,721 INFO L273 TraceCheckUtils]: 8: Hoare triple {802#(<= main_~i~1 1)} assume !(~i~1 < 100000); {800#false} is VALID [2018-11-23 12:26:00,721 INFO L256 TraceCheckUtils]: 9: Hoare triple {800#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {800#false} is VALID [2018-11-23 12:26:00,722 INFO L273 TraceCheckUtils]: 10: Hoare triple {800#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {800#false} is VALID [2018-11-23 12:26:00,722 INFO L273 TraceCheckUtils]: 11: Hoare triple {800#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {800#false} is VALID [2018-11-23 12:26:00,722 INFO L273 TraceCheckUtils]: 12: Hoare triple {800#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {800#false} is VALID [2018-11-23 12:26:00,722 INFO L273 TraceCheckUtils]: 13: Hoare triple {800#false} assume !(~i~0 < 100000); {800#false} is VALID [2018-11-23 12:26:00,723 INFO L273 TraceCheckUtils]: 14: Hoare triple {800#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {800#false} is VALID [2018-11-23 12:26:00,723 INFO L273 TraceCheckUtils]: 15: Hoare triple {800#false} assume true; {800#false} is VALID [2018-11-23 12:26:00,724 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {800#false} {800#false} #70#return; {800#false} is VALID [2018-11-23 12:26:00,724 INFO L273 TraceCheckUtils]: 17: Hoare triple {800#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {800#false} is VALID [2018-11-23 12:26:00,724 INFO L256 TraceCheckUtils]: 18: Hoare triple {800#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {800#false} is VALID [2018-11-23 12:26:00,725 INFO L273 TraceCheckUtils]: 19: Hoare triple {800#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {800#false} is VALID [2018-11-23 12:26:00,725 INFO L273 TraceCheckUtils]: 20: Hoare triple {800#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {800#false} is VALID [2018-11-23 12:26:00,725 INFO L273 TraceCheckUtils]: 21: Hoare triple {800#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {800#false} is VALID [2018-11-23 12:26:00,725 INFO L273 TraceCheckUtils]: 22: Hoare triple {800#false} assume !(~i~0 < 100000); {800#false} is VALID [2018-11-23 12:26:00,726 INFO L273 TraceCheckUtils]: 23: Hoare triple {800#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {800#false} is VALID [2018-11-23 12:26:00,726 INFO L273 TraceCheckUtils]: 24: Hoare triple {800#false} assume true; {800#false} is VALID [2018-11-23 12:26:00,726 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {800#false} {800#false} #72#return; {800#false} is VALID [2018-11-23 12:26:00,726 INFO L273 TraceCheckUtils]: 26: Hoare triple {800#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {800#false} is VALID [2018-11-23 12:26:00,726 INFO L273 TraceCheckUtils]: 27: Hoare triple {800#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {800#false} is VALID [2018-11-23 12:26:00,727 INFO L273 TraceCheckUtils]: 28: Hoare triple {800#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {800#false} is VALID [2018-11-23 12:26:00,727 INFO L273 TraceCheckUtils]: 29: Hoare triple {800#false} assume !(~i~2 < 99999); {800#false} is VALID [2018-11-23 12:26:00,727 INFO L273 TraceCheckUtils]: 30: Hoare triple {800#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {800#false} is VALID [2018-11-23 12:26:00,727 INFO L256 TraceCheckUtils]: 31: Hoare triple {800#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {800#false} is VALID [2018-11-23 12:26:00,727 INFO L273 TraceCheckUtils]: 32: Hoare triple {800#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {800#false} is VALID [2018-11-23 12:26:00,728 INFO L273 TraceCheckUtils]: 33: Hoare triple {800#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {800#false} is VALID [2018-11-23 12:26:00,728 INFO L273 TraceCheckUtils]: 34: Hoare triple {800#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {800#false} is VALID [2018-11-23 12:26:00,728 INFO L273 TraceCheckUtils]: 35: Hoare triple {800#false} assume !(~i~0 < 100000); {800#false} is VALID [2018-11-23 12:26:00,728 INFO L273 TraceCheckUtils]: 36: Hoare triple {800#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {800#false} is VALID [2018-11-23 12:26:00,729 INFO L273 TraceCheckUtils]: 37: Hoare triple {800#false} assume true; {800#false} is VALID [2018-11-23 12:26:00,729 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {800#false} {800#false} #74#return; {800#false} is VALID [2018-11-23 12:26:00,729 INFO L273 TraceCheckUtils]: 39: Hoare triple {800#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {800#false} is VALID [2018-11-23 12:26:00,729 INFO L273 TraceCheckUtils]: 40: Hoare triple {800#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {800#false} is VALID [2018-11-23 12:26:00,730 INFO L273 TraceCheckUtils]: 41: Hoare triple {800#false} assume !false; {800#false} is VALID [2018-11-23 12:26:00,732 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-23 12:26:00,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:00,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 12:26:00,763 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-11-23 12:26:00,764 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:00,764 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:26:00,845 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:00,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:26:00,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:26:00,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:26:00,846 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 5 states. [2018-11-23 12:26:01,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:01,064 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-11-23 12:26:01,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:26:01,064 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-11-23 12:26:01,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:01,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:26:01,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2018-11-23 12:26:01,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:26:01,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2018-11-23 12:26:01,069 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2018-11-23 12:26:01,146 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:01,147 INFO L225 Difference]: With dead ends: 52 [2018-11-23 12:26:01,148 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 12:26:01,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:26:01,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 12:26:01,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-23 12:26:01,221 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:01,221 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 31 states. [2018-11-23 12:26:01,221 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 31 states. [2018-11-23 12:26:01,221 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 31 states. [2018-11-23 12:26:01,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:01,224 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 12:26:01,225 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 12:26:01,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:01,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:01,226 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 32 states. [2018-11-23 12:26:01,226 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 32 states. [2018-11-23 12:26:01,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:01,228 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 12:26:01,228 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 12:26:01,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:01,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:01,229 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:01,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:01,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:26:01,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-23 12:26:01,232 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 42 [2018-11-23 12:26:01,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:01,232 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-23 12:26:01,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:26:01,232 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-23 12:26:01,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 12:26:01,233 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:01,234 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:26:01,234 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:01,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:01,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1311885621, now seen corresponding path program 2 times [2018-11-23 12:26:01,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:01,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:01,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:01,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:26:01,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:01,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:01,464 INFO L256 TraceCheckUtils]: 0: Hoare triple {1114#true} call ULTIMATE.init(); {1114#true} is VALID [2018-11-23 12:26:01,465 INFO L273 TraceCheckUtils]: 1: Hoare triple {1114#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1114#true} is VALID [2018-11-23 12:26:01,465 INFO L273 TraceCheckUtils]: 2: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:26:01,465 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1114#true} {1114#true} #66#return; {1114#true} is VALID [2018-11-23 12:26:01,465 INFO L256 TraceCheckUtils]: 4: Hoare triple {1114#true} call #t~ret13 := main(); {1114#true} is VALID [2018-11-23 12:26:01,467 INFO L273 TraceCheckUtils]: 5: Hoare triple {1114#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1116#(= main_~i~1 0)} is VALID [2018-11-23 12:26:01,469 INFO L273 TraceCheckUtils]: 6: Hoare triple {1116#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1116#(= main_~i~1 0)} is VALID [2018-11-23 12:26:01,470 INFO L273 TraceCheckUtils]: 7: Hoare triple {1116#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1117#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:01,470 INFO L273 TraceCheckUtils]: 8: Hoare triple {1117#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1117#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:01,472 INFO L273 TraceCheckUtils]: 9: Hoare triple {1117#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1118#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:01,472 INFO L273 TraceCheckUtils]: 10: Hoare triple {1118#(<= main_~i~1 2)} assume !(~i~1 < 100000); {1115#false} is VALID [2018-11-23 12:26:01,472 INFO L256 TraceCheckUtils]: 11: Hoare triple {1115#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {1114#true} is VALID [2018-11-23 12:26:01,473 INFO L273 TraceCheckUtils]: 12: Hoare triple {1114#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1114#true} is VALID [2018-11-23 12:26:01,473 INFO L273 TraceCheckUtils]: 13: Hoare triple {1114#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1114#true} is VALID [2018-11-23 12:26:01,473 INFO L273 TraceCheckUtils]: 14: Hoare triple {1114#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1114#true} is VALID [2018-11-23 12:26:01,474 INFO L273 TraceCheckUtils]: 15: Hoare triple {1114#true} assume !(~i~0 < 100000); {1114#true} is VALID [2018-11-23 12:26:01,474 INFO L273 TraceCheckUtils]: 16: Hoare triple {1114#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1114#true} is VALID [2018-11-23 12:26:01,474 INFO L273 TraceCheckUtils]: 17: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:26:01,475 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1114#true} {1115#false} #70#return; {1115#false} is VALID [2018-11-23 12:26:01,475 INFO L273 TraceCheckUtils]: 19: Hoare triple {1115#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1115#false} is VALID [2018-11-23 12:26:01,475 INFO L256 TraceCheckUtils]: 20: Hoare triple {1115#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {1114#true} is VALID [2018-11-23 12:26:01,476 INFO L273 TraceCheckUtils]: 21: Hoare triple {1114#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1114#true} is VALID [2018-11-23 12:26:01,476 INFO L273 TraceCheckUtils]: 22: Hoare triple {1114#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1114#true} is VALID [2018-11-23 12:26:01,476 INFO L273 TraceCheckUtils]: 23: Hoare triple {1114#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1114#true} is VALID [2018-11-23 12:26:01,476 INFO L273 TraceCheckUtils]: 24: Hoare triple {1114#true} assume !(~i~0 < 100000); {1114#true} is VALID [2018-11-23 12:26:01,476 INFO L273 TraceCheckUtils]: 25: Hoare triple {1114#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1114#true} is VALID [2018-11-23 12:26:01,477 INFO L273 TraceCheckUtils]: 26: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:26:01,477 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1114#true} {1115#false} #72#return; {1115#false} is VALID [2018-11-23 12:26:01,477 INFO L273 TraceCheckUtils]: 28: Hoare triple {1115#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {1115#false} is VALID [2018-11-23 12:26:01,477 INFO L273 TraceCheckUtils]: 29: Hoare triple {1115#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {1115#false} is VALID [2018-11-23 12:26:01,478 INFO L273 TraceCheckUtils]: 30: Hoare triple {1115#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {1115#false} is VALID [2018-11-23 12:26:01,478 INFO L273 TraceCheckUtils]: 31: Hoare triple {1115#false} assume !(~i~2 < 99999); {1115#false} is VALID [2018-11-23 12:26:01,478 INFO L273 TraceCheckUtils]: 32: Hoare triple {1115#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {1115#false} is VALID [2018-11-23 12:26:01,478 INFO L256 TraceCheckUtils]: 33: Hoare triple {1115#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {1114#true} is VALID [2018-11-23 12:26:01,479 INFO L273 TraceCheckUtils]: 34: Hoare triple {1114#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1114#true} is VALID [2018-11-23 12:26:01,479 INFO L273 TraceCheckUtils]: 35: Hoare triple {1114#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1114#true} is VALID [2018-11-23 12:26:01,479 INFO L273 TraceCheckUtils]: 36: Hoare triple {1114#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1114#true} is VALID [2018-11-23 12:26:01,480 INFO L273 TraceCheckUtils]: 37: Hoare triple {1114#true} assume !(~i~0 < 100000); {1114#true} is VALID [2018-11-23 12:26:01,480 INFO L273 TraceCheckUtils]: 38: Hoare triple {1114#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1114#true} is VALID [2018-11-23 12:26:01,480 INFO L273 TraceCheckUtils]: 39: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:26:01,480 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1114#true} {1115#false} #74#return; {1115#false} is VALID [2018-11-23 12:26:01,481 INFO L273 TraceCheckUtils]: 41: Hoare triple {1115#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {1115#false} is VALID [2018-11-23 12:26:01,481 INFO L273 TraceCheckUtils]: 42: Hoare triple {1115#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {1115#false} is VALID [2018-11-23 12:26:01,481 INFO L273 TraceCheckUtils]: 43: Hoare triple {1115#false} assume !false; {1115#false} is VALID [2018-11-23 12:26:01,483 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-23 12:26:01,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:01,484 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:01,493 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:26:01,527 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:26:01,527 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:01,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:01,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:01,659 INFO L256 TraceCheckUtils]: 0: Hoare triple {1114#true} call ULTIMATE.init(); {1114#true} is VALID [2018-11-23 12:26:01,660 INFO L273 TraceCheckUtils]: 1: Hoare triple {1114#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1114#true} is VALID [2018-11-23 12:26:01,660 INFO L273 TraceCheckUtils]: 2: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:26:01,661 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1114#true} {1114#true} #66#return; {1114#true} is VALID [2018-11-23 12:26:01,661 INFO L256 TraceCheckUtils]: 4: Hoare triple {1114#true} call #t~ret13 := main(); {1114#true} is VALID [2018-11-23 12:26:01,662 INFO L273 TraceCheckUtils]: 5: Hoare triple {1114#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1137#(<= main_~i~1 0)} is VALID [2018-11-23 12:26:01,663 INFO L273 TraceCheckUtils]: 6: Hoare triple {1137#(<= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1137#(<= main_~i~1 0)} is VALID [2018-11-23 12:26:01,663 INFO L273 TraceCheckUtils]: 7: Hoare triple {1137#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1117#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:01,664 INFO L273 TraceCheckUtils]: 8: Hoare triple {1117#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1117#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:01,664 INFO L273 TraceCheckUtils]: 9: Hoare triple {1117#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1118#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:01,670 INFO L273 TraceCheckUtils]: 10: Hoare triple {1118#(<= main_~i~1 2)} assume !(~i~1 < 100000); {1115#false} is VALID [2018-11-23 12:26:01,671 INFO L256 TraceCheckUtils]: 11: Hoare triple {1115#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {1115#false} is VALID [2018-11-23 12:26:01,671 INFO L273 TraceCheckUtils]: 12: Hoare triple {1115#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1115#false} is VALID [2018-11-23 12:26:01,671 INFO L273 TraceCheckUtils]: 13: Hoare triple {1115#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1115#false} is VALID [2018-11-23 12:26:01,672 INFO L273 TraceCheckUtils]: 14: Hoare triple {1115#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1115#false} is VALID [2018-11-23 12:26:01,672 INFO L273 TraceCheckUtils]: 15: Hoare triple {1115#false} assume !(~i~0 < 100000); {1115#false} is VALID [2018-11-23 12:26:01,672 INFO L273 TraceCheckUtils]: 16: Hoare triple {1115#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1115#false} is VALID [2018-11-23 12:26:01,672 INFO L273 TraceCheckUtils]: 17: Hoare triple {1115#false} assume true; {1115#false} is VALID [2018-11-23 12:26:01,673 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1115#false} {1115#false} #70#return; {1115#false} is VALID [2018-11-23 12:26:01,673 INFO L273 TraceCheckUtils]: 19: Hoare triple {1115#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1115#false} is VALID [2018-11-23 12:26:01,673 INFO L256 TraceCheckUtils]: 20: Hoare triple {1115#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {1115#false} is VALID [2018-11-23 12:26:01,673 INFO L273 TraceCheckUtils]: 21: Hoare triple {1115#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1115#false} is VALID [2018-11-23 12:26:01,673 INFO L273 TraceCheckUtils]: 22: Hoare triple {1115#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1115#false} is VALID [2018-11-23 12:26:01,674 INFO L273 TraceCheckUtils]: 23: Hoare triple {1115#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1115#false} is VALID [2018-11-23 12:26:01,674 INFO L273 TraceCheckUtils]: 24: Hoare triple {1115#false} assume !(~i~0 < 100000); {1115#false} is VALID [2018-11-23 12:26:01,674 INFO L273 TraceCheckUtils]: 25: Hoare triple {1115#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1115#false} is VALID [2018-11-23 12:26:01,674 INFO L273 TraceCheckUtils]: 26: Hoare triple {1115#false} assume true; {1115#false} is VALID [2018-11-23 12:26:01,674 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1115#false} {1115#false} #72#return; {1115#false} is VALID [2018-11-23 12:26:01,674 INFO L273 TraceCheckUtils]: 28: Hoare triple {1115#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {1115#false} is VALID [2018-11-23 12:26:01,675 INFO L273 TraceCheckUtils]: 29: Hoare triple {1115#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {1115#false} is VALID [2018-11-23 12:26:01,675 INFO L273 TraceCheckUtils]: 30: Hoare triple {1115#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {1115#false} is VALID [2018-11-23 12:26:01,675 INFO L273 TraceCheckUtils]: 31: Hoare triple {1115#false} assume !(~i~2 < 99999); {1115#false} is VALID [2018-11-23 12:26:01,675 INFO L273 TraceCheckUtils]: 32: Hoare triple {1115#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {1115#false} is VALID [2018-11-23 12:26:01,675 INFO L256 TraceCheckUtils]: 33: Hoare triple {1115#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {1115#false} is VALID [2018-11-23 12:26:01,676 INFO L273 TraceCheckUtils]: 34: Hoare triple {1115#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1115#false} is VALID [2018-11-23 12:26:01,676 INFO L273 TraceCheckUtils]: 35: Hoare triple {1115#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1115#false} is VALID [2018-11-23 12:26:01,676 INFO L273 TraceCheckUtils]: 36: Hoare triple {1115#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1115#false} is VALID [2018-11-23 12:26:01,676 INFO L273 TraceCheckUtils]: 37: Hoare triple {1115#false} assume !(~i~0 < 100000); {1115#false} is VALID [2018-11-23 12:26:01,677 INFO L273 TraceCheckUtils]: 38: Hoare triple {1115#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1115#false} is VALID [2018-11-23 12:26:01,677 INFO L273 TraceCheckUtils]: 39: Hoare triple {1115#false} assume true; {1115#false} is VALID [2018-11-23 12:26:01,677 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1115#false} {1115#false} #74#return; {1115#false} is VALID [2018-11-23 12:26:01,677 INFO L273 TraceCheckUtils]: 41: Hoare triple {1115#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {1115#false} is VALID [2018-11-23 12:26:01,678 INFO L273 TraceCheckUtils]: 42: Hoare triple {1115#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {1115#false} is VALID [2018-11-23 12:26:01,678 INFO L273 TraceCheckUtils]: 43: Hoare triple {1115#false} assume !false; {1115#false} is VALID [2018-11-23 12:26:01,680 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-23 12:26:01,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:01,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 12:26:01,699 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-11-23 12:26:01,700 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:01,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:26:01,751 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:01,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:26:01,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:26:01,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:26:01,752 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 6 states. [2018-11-23 12:26:01,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:01,931 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2018-11-23 12:26:01,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:26:01,931 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-11-23 12:26:01,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:01,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:26:01,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2018-11-23 12:26:01,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:26:01,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2018-11-23 12:26:01,936 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 58 transitions. [2018-11-23 12:26:02,087 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:02,089 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:26:02,089 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 12:26:02,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:26:02,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 12:26:02,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-23 12:26:02,180 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:02,180 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2018-11-23 12:26:02,180 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2018-11-23 12:26:02,180 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2018-11-23 12:26:02,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:02,182 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 12:26:02,182 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 12:26:02,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:02,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:02,186 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2018-11-23 12:26:02,186 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2018-11-23 12:26:02,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:02,188 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 12:26:02,188 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 12:26:02,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:02,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:02,189 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:02,189 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:02,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:26:02,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-23 12:26:02,191 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 44 [2018-11-23 12:26:02,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:02,191 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-23 12:26:02,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:26:02,191 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 12:26:02,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 12:26:02,193 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:02,193 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:26:02,193 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:02,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:02,194 INFO L82 PathProgramCache]: Analyzing trace with hash 525258797, now seen corresponding path program 3 times [2018-11-23 12:26:02,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:02,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:02,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:02,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:02,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:02,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:02,328 INFO L256 TraceCheckUtils]: 0: Hoare triple {1446#true} call ULTIMATE.init(); {1446#true} is VALID [2018-11-23 12:26:02,328 INFO L273 TraceCheckUtils]: 1: Hoare triple {1446#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1446#true} is VALID [2018-11-23 12:26:02,329 INFO L273 TraceCheckUtils]: 2: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:26:02,329 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1446#true} {1446#true} #66#return; {1446#true} is VALID [2018-11-23 12:26:02,329 INFO L256 TraceCheckUtils]: 4: Hoare triple {1446#true} call #t~ret13 := main(); {1446#true} is VALID [2018-11-23 12:26:02,330 INFO L273 TraceCheckUtils]: 5: Hoare triple {1446#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1448#(= main_~i~1 0)} is VALID [2018-11-23 12:26:02,331 INFO L273 TraceCheckUtils]: 6: Hoare triple {1448#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1448#(= main_~i~1 0)} is VALID [2018-11-23 12:26:02,331 INFO L273 TraceCheckUtils]: 7: Hoare triple {1448#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1449#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:02,333 INFO L273 TraceCheckUtils]: 8: Hoare triple {1449#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1449#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:02,333 INFO L273 TraceCheckUtils]: 9: Hoare triple {1449#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1450#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:02,335 INFO L273 TraceCheckUtils]: 10: Hoare triple {1450#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1450#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:02,336 INFO L273 TraceCheckUtils]: 11: Hoare triple {1450#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1451#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:02,337 INFO L273 TraceCheckUtils]: 12: Hoare triple {1451#(<= main_~i~1 3)} assume !(~i~1 < 100000); {1447#false} is VALID [2018-11-23 12:26:02,337 INFO L256 TraceCheckUtils]: 13: Hoare triple {1447#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {1446#true} is VALID [2018-11-23 12:26:02,337 INFO L273 TraceCheckUtils]: 14: Hoare triple {1446#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1446#true} is VALID [2018-11-23 12:26:02,338 INFO L273 TraceCheckUtils]: 15: Hoare triple {1446#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1446#true} is VALID [2018-11-23 12:26:02,338 INFO L273 TraceCheckUtils]: 16: Hoare triple {1446#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1446#true} is VALID [2018-11-23 12:26:02,339 INFO L273 TraceCheckUtils]: 17: Hoare triple {1446#true} assume !(~i~0 < 100000); {1446#true} is VALID [2018-11-23 12:26:02,339 INFO L273 TraceCheckUtils]: 18: Hoare triple {1446#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1446#true} is VALID [2018-11-23 12:26:02,340 INFO L273 TraceCheckUtils]: 19: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:26:02,340 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1446#true} {1447#false} #70#return; {1447#false} is VALID [2018-11-23 12:26:02,340 INFO L273 TraceCheckUtils]: 21: Hoare triple {1447#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1447#false} is VALID [2018-11-23 12:26:02,341 INFO L256 TraceCheckUtils]: 22: Hoare triple {1447#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {1446#true} is VALID [2018-11-23 12:26:02,341 INFO L273 TraceCheckUtils]: 23: Hoare triple {1446#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1446#true} is VALID [2018-11-23 12:26:02,342 INFO L273 TraceCheckUtils]: 24: Hoare triple {1446#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1446#true} is VALID [2018-11-23 12:26:02,342 INFO L273 TraceCheckUtils]: 25: Hoare triple {1446#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1446#true} is VALID [2018-11-23 12:26:02,342 INFO L273 TraceCheckUtils]: 26: Hoare triple {1446#true} assume !(~i~0 < 100000); {1446#true} is VALID [2018-11-23 12:26:02,343 INFO L273 TraceCheckUtils]: 27: Hoare triple {1446#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1446#true} is VALID [2018-11-23 12:26:02,343 INFO L273 TraceCheckUtils]: 28: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:26:02,343 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1446#true} {1447#false} #72#return; {1447#false} is VALID [2018-11-23 12:26:02,343 INFO L273 TraceCheckUtils]: 30: Hoare triple {1447#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {1447#false} is VALID [2018-11-23 12:26:02,344 INFO L273 TraceCheckUtils]: 31: Hoare triple {1447#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {1447#false} is VALID [2018-11-23 12:26:02,344 INFO L273 TraceCheckUtils]: 32: Hoare triple {1447#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {1447#false} is VALID [2018-11-23 12:26:02,344 INFO L273 TraceCheckUtils]: 33: Hoare triple {1447#false} assume !(~i~2 < 99999); {1447#false} is VALID [2018-11-23 12:26:02,344 INFO L273 TraceCheckUtils]: 34: Hoare triple {1447#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {1447#false} is VALID [2018-11-23 12:26:02,345 INFO L256 TraceCheckUtils]: 35: Hoare triple {1447#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {1446#true} is VALID [2018-11-23 12:26:02,345 INFO L273 TraceCheckUtils]: 36: Hoare triple {1446#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1446#true} is VALID [2018-11-23 12:26:02,345 INFO L273 TraceCheckUtils]: 37: Hoare triple {1446#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1446#true} is VALID [2018-11-23 12:26:02,345 INFO L273 TraceCheckUtils]: 38: Hoare triple {1446#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1446#true} is VALID [2018-11-23 12:26:02,346 INFO L273 TraceCheckUtils]: 39: Hoare triple {1446#true} assume !(~i~0 < 100000); {1446#true} is VALID [2018-11-23 12:26:02,346 INFO L273 TraceCheckUtils]: 40: Hoare triple {1446#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1446#true} is VALID [2018-11-23 12:26:02,346 INFO L273 TraceCheckUtils]: 41: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:26:02,347 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1446#true} {1447#false} #74#return; {1447#false} is VALID [2018-11-23 12:26:02,347 INFO L273 TraceCheckUtils]: 43: Hoare triple {1447#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {1447#false} is VALID [2018-11-23 12:26:02,347 INFO L273 TraceCheckUtils]: 44: Hoare triple {1447#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {1447#false} is VALID [2018-11-23 12:26:02,347 INFO L273 TraceCheckUtils]: 45: Hoare triple {1447#false} assume !false; {1447#false} is VALID [2018-11-23 12:26:02,350 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-23 12:26:02,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:02,351 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:02,367 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:26:02,400 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 12:26:02,400 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:02,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:02,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:02,589 INFO L256 TraceCheckUtils]: 0: Hoare triple {1446#true} call ULTIMATE.init(); {1446#true} is VALID [2018-11-23 12:26:02,590 INFO L273 TraceCheckUtils]: 1: Hoare triple {1446#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1446#true} is VALID [2018-11-23 12:26:02,590 INFO L273 TraceCheckUtils]: 2: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:26:02,590 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1446#true} {1446#true} #66#return; {1446#true} is VALID [2018-11-23 12:26:02,590 INFO L256 TraceCheckUtils]: 4: Hoare triple {1446#true} call #t~ret13 := main(); {1446#true} is VALID [2018-11-23 12:26:02,591 INFO L273 TraceCheckUtils]: 5: Hoare triple {1446#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1446#true} is VALID [2018-11-23 12:26:02,591 INFO L273 TraceCheckUtils]: 6: Hoare triple {1446#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1446#true} is VALID [2018-11-23 12:26:02,591 INFO L273 TraceCheckUtils]: 7: Hoare triple {1446#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1446#true} is VALID [2018-11-23 12:26:02,591 INFO L273 TraceCheckUtils]: 8: Hoare triple {1446#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1446#true} is VALID [2018-11-23 12:26:02,591 INFO L273 TraceCheckUtils]: 9: Hoare triple {1446#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1446#true} is VALID [2018-11-23 12:26:02,591 INFO L273 TraceCheckUtils]: 10: Hoare triple {1446#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1446#true} is VALID [2018-11-23 12:26:02,592 INFO L273 TraceCheckUtils]: 11: Hoare triple {1446#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1446#true} is VALID [2018-11-23 12:26:02,592 INFO L273 TraceCheckUtils]: 12: Hoare triple {1446#true} assume !(~i~1 < 100000); {1446#true} is VALID [2018-11-23 12:26:02,592 INFO L256 TraceCheckUtils]: 13: Hoare triple {1446#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {1446#true} is VALID [2018-11-23 12:26:02,592 INFO L273 TraceCheckUtils]: 14: Hoare triple {1446#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1446#true} is VALID [2018-11-23 12:26:02,592 INFO L273 TraceCheckUtils]: 15: Hoare triple {1446#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1446#true} is VALID [2018-11-23 12:26:02,592 INFO L273 TraceCheckUtils]: 16: Hoare triple {1446#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1446#true} is VALID [2018-11-23 12:26:02,593 INFO L273 TraceCheckUtils]: 17: Hoare triple {1446#true} assume !(~i~0 < 100000); {1446#true} is VALID [2018-11-23 12:26:02,593 INFO L273 TraceCheckUtils]: 18: Hoare triple {1446#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1446#true} is VALID [2018-11-23 12:26:02,593 INFO L273 TraceCheckUtils]: 19: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:26:02,593 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1446#true} {1446#true} #70#return; {1446#true} is VALID [2018-11-23 12:26:02,593 INFO L273 TraceCheckUtils]: 21: Hoare triple {1446#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1446#true} is VALID [2018-11-23 12:26:02,593 INFO L256 TraceCheckUtils]: 22: Hoare triple {1446#true} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {1446#true} is VALID [2018-11-23 12:26:02,594 INFO L273 TraceCheckUtils]: 23: Hoare triple {1446#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1446#true} is VALID [2018-11-23 12:26:02,594 INFO L273 TraceCheckUtils]: 24: Hoare triple {1446#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1446#true} is VALID [2018-11-23 12:26:02,594 INFO L273 TraceCheckUtils]: 25: Hoare triple {1446#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1446#true} is VALID [2018-11-23 12:26:02,594 INFO L273 TraceCheckUtils]: 26: Hoare triple {1446#true} assume !(~i~0 < 100000); {1446#true} is VALID [2018-11-23 12:26:02,595 INFO L273 TraceCheckUtils]: 27: Hoare triple {1446#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1446#true} is VALID [2018-11-23 12:26:02,595 INFO L273 TraceCheckUtils]: 28: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:26:02,595 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1446#true} {1446#true} #72#return; {1446#true} is VALID [2018-11-23 12:26:02,595 INFO L273 TraceCheckUtils]: 30: Hoare triple {1446#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {1446#true} is VALID [2018-11-23 12:26:02,596 INFO L273 TraceCheckUtils]: 31: Hoare triple {1446#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {1446#true} is VALID [2018-11-23 12:26:02,596 INFO L273 TraceCheckUtils]: 32: Hoare triple {1446#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {1446#true} is VALID [2018-11-23 12:26:02,596 INFO L273 TraceCheckUtils]: 33: Hoare triple {1446#true} assume !(~i~2 < 99999); {1446#true} is VALID [2018-11-23 12:26:02,596 INFO L273 TraceCheckUtils]: 34: Hoare triple {1446#true} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {1446#true} is VALID [2018-11-23 12:26:02,596 INFO L256 TraceCheckUtils]: 35: Hoare triple {1446#true} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {1446#true} is VALID [2018-11-23 12:26:02,597 INFO L273 TraceCheckUtils]: 36: Hoare triple {1446#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1563#(<= bor_~i~0 1)} is VALID [2018-11-23 12:26:02,598 INFO L273 TraceCheckUtils]: 37: Hoare triple {1563#(<= bor_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1563#(<= bor_~i~0 1)} is VALID [2018-11-23 12:26:02,598 INFO L273 TraceCheckUtils]: 38: Hoare triple {1563#(<= bor_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1570#(<= bor_~i~0 2)} is VALID [2018-11-23 12:26:02,599 INFO L273 TraceCheckUtils]: 39: Hoare triple {1570#(<= bor_~i~0 2)} assume !(~i~0 < 100000); {1447#false} is VALID [2018-11-23 12:26:02,599 INFO L273 TraceCheckUtils]: 40: Hoare triple {1447#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1447#false} is VALID [2018-11-23 12:26:02,599 INFO L273 TraceCheckUtils]: 41: Hoare triple {1447#false} assume true; {1447#false} is VALID [2018-11-23 12:26:02,599 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1447#false} {1446#true} #74#return; {1447#false} is VALID [2018-11-23 12:26:02,599 INFO L273 TraceCheckUtils]: 43: Hoare triple {1447#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {1447#false} is VALID [2018-11-23 12:26:02,600 INFO L273 TraceCheckUtils]: 44: Hoare triple {1447#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {1447#false} is VALID [2018-11-23 12:26:02,600 INFO L273 TraceCheckUtils]: 45: Hoare triple {1447#false} assume !false; {1447#false} is VALID [2018-11-23 12:26:02,602 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-23 12:26:02,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:02,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-11-23 12:26:02,623 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-11-23 12:26:02,624 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:02,624 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:26:02,731 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:02,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:26:02,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:26:02,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:26:02,732 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 8 states. [2018-11-23 12:26:02,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:02,963 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2018-11-23 12:26:02,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:26:02,963 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-11-23 12:26:02,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:02,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:26:02,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2018-11-23 12:26:02,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:26:02,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2018-11-23 12:26:02,968 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 68 transitions. [2018-11-23 12:26:03,076 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:03,078 INFO L225 Difference]: With dead ends: 59 [2018-11-23 12:26:03,078 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 12:26:03,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 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-23 12:26:03,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 12:26:03,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-11-23 12:26:03,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:03,149 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 37 states. [2018-11-23 12:26:03,149 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 37 states. [2018-11-23 12:26:03,149 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 37 states. [2018-11-23 12:26:03,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:03,152 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-23 12:26:03,153 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 12:26:03,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:03,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:03,153 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 39 states. [2018-11-23 12:26:03,153 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 39 states. [2018-11-23 12:26:03,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:03,156 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-23 12:26:03,156 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 12:26:03,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:03,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:03,157 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:03,157 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:03,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:26:03,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-23 12:26:03,159 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 46 [2018-11-23 12:26:03,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:03,159 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-23 12:26:03,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:26:03,160 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-23 12:26:03,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 12:26:03,161 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:03,161 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:26:03,161 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:03,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:03,161 INFO L82 PathProgramCache]: Analyzing trace with hash -174499699, now seen corresponding path program 4 times [2018-11-23 12:26:03,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:03,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:03,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:03,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:03,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:03,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:03,311 INFO L256 TraceCheckUtils]: 0: Hoare triple {1809#true} call ULTIMATE.init(); {1809#true} is VALID [2018-11-23 12:26:03,312 INFO L273 TraceCheckUtils]: 1: Hoare triple {1809#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1809#true} is VALID [2018-11-23 12:26:03,312 INFO L273 TraceCheckUtils]: 2: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:26:03,313 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1809#true} {1809#true} #66#return; {1809#true} is VALID [2018-11-23 12:26:03,313 INFO L256 TraceCheckUtils]: 4: Hoare triple {1809#true} call #t~ret13 := main(); {1809#true} is VALID [2018-11-23 12:26:03,314 INFO L273 TraceCheckUtils]: 5: Hoare triple {1809#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1811#(= main_~i~1 0)} is VALID [2018-11-23 12:26:03,315 INFO L273 TraceCheckUtils]: 6: Hoare triple {1811#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1811#(= main_~i~1 0)} is VALID [2018-11-23 12:26:03,315 INFO L273 TraceCheckUtils]: 7: Hoare triple {1811#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1812#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:03,316 INFO L273 TraceCheckUtils]: 8: Hoare triple {1812#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1812#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:03,316 INFO L273 TraceCheckUtils]: 9: Hoare triple {1812#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1813#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:03,317 INFO L273 TraceCheckUtils]: 10: Hoare triple {1813#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1813#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:03,317 INFO L273 TraceCheckUtils]: 11: Hoare triple {1813#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1814#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:03,318 INFO L273 TraceCheckUtils]: 12: Hoare triple {1814#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1814#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:03,319 INFO L273 TraceCheckUtils]: 13: Hoare triple {1814#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1815#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:03,320 INFO L273 TraceCheckUtils]: 14: Hoare triple {1815#(<= main_~i~1 4)} assume !(~i~1 < 100000); {1810#false} is VALID [2018-11-23 12:26:03,320 INFO L256 TraceCheckUtils]: 15: Hoare triple {1810#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {1809#true} is VALID [2018-11-23 12:26:03,321 INFO L273 TraceCheckUtils]: 16: Hoare triple {1809#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1809#true} is VALID [2018-11-23 12:26:03,321 INFO L273 TraceCheckUtils]: 17: Hoare triple {1809#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1809#true} is VALID [2018-11-23 12:26:03,321 INFO L273 TraceCheckUtils]: 18: Hoare triple {1809#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1809#true} is VALID [2018-11-23 12:26:03,322 INFO L273 TraceCheckUtils]: 19: Hoare triple {1809#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1809#true} is VALID [2018-11-23 12:26:03,322 INFO L273 TraceCheckUtils]: 20: Hoare triple {1809#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1809#true} is VALID [2018-11-23 12:26:03,322 INFO L273 TraceCheckUtils]: 21: Hoare triple {1809#true} assume !(~i~0 < 100000); {1809#true} is VALID [2018-11-23 12:26:03,323 INFO L273 TraceCheckUtils]: 22: Hoare triple {1809#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1809#true} is VALID [2018-11-23 12:26:03,323 INFO L273 TraceCheckUtils]: 23: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:26:03,323 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1809#true} {1810#false} #70#return; {1810#false} is VALID [2018-11-23 12:26:03,324 INFO L273 TraceCheckUtils]: 25: Hoare triple {1810#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1810#false} is VALID [2018-11-23 12:26:03,324 INFO L256 TraceCheckUtils]: 26: Hoare triple {1810#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {1809#true} is VALID [2018-11-23 12:26:03,324 INFO L273 TraceCheckUtils]: 27: Hoare triple {1809#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1809#true} is VALID [2018-11-23 12:26:03,324 INFO L273 TraceCheckUtils]: 28: Hoare triple {1809#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1809#true} is VALID [2018-11-23 12:26:03,325 INFO L273 TraceCheckUtils]: 29: Hoare triple {1809#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1809#true} is VALID [2018-11-23 12:26:03,325 INFO L273 TraceCheckUtils]: 30: Hoare triple {1809#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1809#true} is VALID [2018-11-23 12:26:03,325 INFO L273 TraceCheckUtils]: 31: Hoare triple {1809#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1809#true} is VALID [2018-11-23 12:26:03,325 INFO L273 TraceCheckUtils]: 32: Hoare triple {1809#true} assume !(~i~0 < 100000); {1809#true} is VALID [2018-11-23 12:26:03,326 INFO L273 TraceCheckUtils]: 33: Hoare triple {1809#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1809#true} is VALID [2018-11-23 12:26:03,326 INFO L273 TraceCheckUtils]: 34: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:26:03,326 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1809#true} {1810#false} #72#return; {1810#false} is VALID [2018-11-23 12:26:03,326 INFO L273 TraceCheckUtils]: 36: Hoare triple {1810#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {1810#false} is VALID [2018-11-23 12:26:03,327 INFO L273 TraceCheckUtils]: 37: Hoare triple {1810#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {1810#false} is VALID [2018-11-23 12:26:03,327 INFO L273 TraceCheckUtils]: 38: Hoare triple {1810#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {1810#false} is VALID [2018-11-23 12:26:03,327 INFO L273 TraceCheckUtils]: 39: Hoare triple {1810#false} assume !(~i~2 < 99999); {1810#false} is VALID [2018-11-23 12:26:03,327 INFO L273 TraceCheckUtils]: 40: Hoare triple {1810#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {1810#false} is VALID [2018-11-23 12:26:03,328 INFO L256 TraceCheckUtils]: 41: Hoare triple {1810#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {1809#true} is VALID [2018-11-23 12:26:03,328 INFO L273 TraceCheckUtils]: 42: Hoare triple {1809#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1809#true} is VALID [2018-11-23 12:26:03,328 INFO L273 TraceCheckUtils]: 43: Hoare triple {1809#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1809#true} is VALID [2018-11-23 12:26:03,328 INFO L273 TraceCheckUtils]: 44: Hoare triple {1809#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1809#true} is VALID [2018-11-23 12:26:03,329 INFO L273 TraceCheckUtils]: 45: Hoare triple {1809#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1809#true} is VALID [2018-11-23 12:26:03,329 INFO L273 TraceCheckUtils]: 46: Hoare triple {1809#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1809#true} is VALID [2018-11-23 12:26:03,329 INFO L273 TraceCheckUtils]: 47: Hoare triple {1809#true} assume !(~i~0 < 100000); {1809#true} is VALID [2018-11-23 12:26:03,329 INFO L273 TraceCheckUtils]: 48: Hoare triple {1809#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1809#true} is VALID [2018-11-23 12:26:03,329 INFO L273 TraceCheckUtils]: 49: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:26:03,330 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {1809#true} {1810#false} #74#return; {1810#false} is VALID [2018-11-23 12:26:03,330 INFO L273 TraceCheckUtils]: 51: Hoare triple {1810#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {1810#false} is VALID [2018-11-23 12:26:03,330 INFO L273 TraceCheckUtils]: 52: Hoare triple {1810#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {1810#false} is VALID [2018-11-23 12:26:03,330 INFO L273 TraceCheckUtils]: 53: Hoare triple {1810#false} assume !false; {1810#false} is VALID [2018-11-23 12:26:03,334 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-23 12:26:03,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:03,334 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:03,352 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:26:03,405 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:26:03,406 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:03,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:03,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:03,558 INFO L256 TraceCheckUtils]: 0: Hoare triple {1809#true} call ULTIMATE.init(); {1809#true} is VALID [2018-11-23 12:26:03,558 INFO L273 TraceCheckUtils]: 1: Hoare triple {1809#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1809#true} is VALID [2018-11-23 12:26:03,559 INFO L273 TraceCheckUtils]: 2: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:26:03,559 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1809#true} {1809#true} #66#return; {1809#true} is VALID [2018-11-23 12:26:03,559 INFO L256 TraceCheckUtils]: 4: Hoare triple {1809#true} call #t~ret13 := main(); {1809#true} is VALID [2018-11-23 12:26:03,560 INFO L273 TraceCheckUtils]: 5: Hoare triple {1809#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1834#(<= main_~i~1 0)} is VALID [2018-11-23 12:26:03,562 INFO L273 TraceCheckUtils]: 6: Hoare triple {1834#(<= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1834#(<= main_~i~1 0)} is VALID [2018-11-23 12:26:03,562 INFO L273 TraceCheckUtils]: 7: Hoare triple {1834#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1812#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:03,563 INFO L273 TraceCheckUtils]: 8: Hoare triple {1812#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1812#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:03,563 INFO L273 TraceCheckUtils]: 9: Hoare triple {1812#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1813#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:03,564 INFO L273 TraceCheckUtils]: 10: Hoare triple {1813#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1813#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:03,565 INFO L273 TraceCheckUtils]: 11: Hoare triple {1813#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1814#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:03,565 INFO L273 TraceCheckUtils]: 12: Hoare triple {1814#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {1814#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:03,571 INFO L273 TraceCheckUtils]: 13: Hoare triple {1814#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {1815#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:03,572 INFO L273 TraceCheckUtils]: 14: Hoare triple {1815#(<= main_~i~1 4)} assume !(~i~1 < 100000); {1810#false} is VALID [2018-11-23 12:26:03,572 INFO L256 TraceCheckUtils]: 15: Hoare triple {1810#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {1810#false} is VALID [2018-11-23 12:26:03,572 INFO L273 TraceCheckUtils]: 16: Hoare triple {1810#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1810#false} is VALID [2018-11-23 12:26:03,572 INFO L273 TraceCheckUtils]: 17: Hoare triple {1810#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1810#false} is VALID [2018-11-23 12:26:03,572 INFO L273 TraceCheckUtils]: 18: Hoare triple {1810#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1810#false} is VALID [2018-11-23 12:26:03,573 INFO L273 TraceCheckUtils]: 19: Hoare triple {1810#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1810#false} is VALID [2018-11-23 12:26:03,573 INFO L273 TraceCheckUtils]: 20: Hoare triple {1810#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1810#false} is VALID [2018-11-23 12:26:03,573 INFO L273 TraceCheckUtils]: 21: Hoare triple {1810#false} assume !(~i~0 < 100000); {1810#false} is VALID [2018-11-23 12:26:03,573 INFO L273 TraceCheckUtils]: 22: Hoare triple {1810#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1810#false} is VALID [2018-11-23 12:26:03,574 INFO L273 TraceCheckUtils]: 23: Hoare triple {1810#false} assume true; {1810#false} is VALID [2018-11-23 12:26:03,574 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1810#false} {1810#false} #70#return; {1810#false} is VALID [2018-11-23 12:26:03,574 INFO L273 TraceCheckUtils]: 25: Hoare triple {1810#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {1810#false} is VALID [2018-11-23 12:26:03,574 INFO L256 TraceCheckUtils]: 26: Hoare triple {1810#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {1810#false} is VALID [2018-11-23 12:26:03,575 INFO L273 TraceCheckUtils]: 27: Hoare triple {1810#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1810#false} is VALID [2018-11-23 12:26:03,575 INFO L273 TraceCheckUtils]: 28: Hoare triple {1810#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1810#false} is VALID [2018-11-23 12:26:03,575 INFO L273 TraceCheckUtils]: 29: Hoare triple {1810#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1810#false} is VALID [2018-11-23 12:26:03,575 INFO L273 TraceCheckUtils]: 30: Hoare triple {1810#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1810#false} is VALID [2018-11-23 12:26:03,576 INFO L273 TraceCheckUtils]: 31: Hoare triple {1810#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1810#false} is VALID [2018-11-23 12:26:03,576 INFO L273 TraceCheckUtils]: 32: Hoare triple {1810#false} assume !(~i~0 < 100000); {1810#false} is VALID [2018-11-23 12:26:03,576 INFO L273 TraceCheckUtils]: 33: Hoare triple {1810#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1810#false} is VALID [2018-11-23 12:26:03,576 INFO L273 TraceCheckUtils]: 34: Hoare triple {1810#false} assume true; {1810#false} is VALID [2018-11-23 12:26:03,577 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1810#false} {1810#false} #72#return; {1810#false} is VALID [2018-11-23 12:26:03,577 INFO L273 TraceCheckUtils]: 36: Hoare triple {1810#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {1810#false} is VALID [2018-11-23 12:26:03,577 INFO L273 TraceCheckUtils]: 37: Hoare triple {1810#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {1810#false} is VALID [2018-11-23 12:26:03,577 INFO L273 TraceCheckUtils]: 38: Hoare triple {1810#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {1810#false} is VALID [2018-11-23 12:26:03,578 INFO L273 TraceCheckUtils]: 39: Hoare triple {1810#false} assume !(~i~2 < 99999); {1810#false} is VALID [2018-11-23 12:26:03,578 INFO L273 TraceCheckUtils]: 40: Hoare triple {1810#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {1810#false} is VALID [2018-11-23 12:26:03,578 INFO L256 TraceCheckUtils]: 41: Hoare triple {1810#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {1810#false} is VALID [2018-11-23 12:26:03,578 INFO L273 TraceCheckUtils]: 42: Hoare triple {1810#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1810#false} is VALID [2018-11-23 12:26:03,579 INFO L273 TraceCheckUtils]: 43: Hoare triple {1810#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1810#false} is VALID [2018-11-23 12:26:03,579 INFO L273 TraceCheckUtils]: 44: Hoare triple {1810#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1810#false} is VALID [2018-11-23 12:26:03,579 INFO L273 TraceCheckUtils]: 45: Hoare triple {1810#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {1810#false} is VALID [2018-11-23 12:26:03,579 INFO L273 TraceCheckUtils]: 46: Hoare triple {1810#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1810#false} is VALID [2018-11-23 12:26:03,579 INFO L273 TraceCheckUtils]: 47: Hoare triple {1810#false} assume !(~i~0 < 100000); {1810#false} is VALID [2018-11-23 12:26:03,580 INFO L273 TraceCheckUtils]: 48: Hoare triple {1810#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1810#false} is VALID [2018-11-23 12:26:03,580 INFO L273 TraceCheckUtils]: 49: Hoare triple {1810#false} assume true; {1810#false} is VALID [2018-11-23 12:26:03,580 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {1810#false} {1810#false} #74#return; {1810#false} is VALID [2018-11-23 12:26:03,580 INFO L273 TraceCheckUtils]: 51: Hoare triple {1810#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {1810#false} is VALID [2018-11-23 12:26:03,581 INFO L273 TraceCheckUtils]: 52: Hoare triple {1810#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {1810#false} is VALID [2018-11-23 12:26:03,581 INFO L273 TraceCheckUtils]: 53: Hoare triple {1810#false} assume !false; {1810#false} is VALID [2018-11-23 12:26:03,585 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-23 12:26:03,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:03,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 12:26:03,607 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-11-23 12:26:03,608 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:03,608 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:26:03,670 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:03,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:26:03,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:26:03,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:26:03,671 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 8 states. [2018-11-23 12:26:03,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:03,943 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-11-23 12:26:03,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:26:03,943 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-11-23 12:26:03,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:03,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:26:03,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2018-11-23 12:26:03,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:26:03,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2018-11-23 12:26:03,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 62 transitions. [2018-11-23 12:26:04,051 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:04,053 INFO L225 Difference]: With dead ends: 62 [2018-11-23 12:26:04,053 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 12:26:04,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:26:04,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 12:26:04,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-23 12:26:04,075 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:04,075 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 39 states. [2018-11-23 12:26:04,075 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 39 states. [2018-11-23 12:26:04,075 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 39 states. [2018-11-23 12:26:04,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:04,078 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-23 12:26:04,078 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-23 12:26:04,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:04,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:04,079 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 40 states. [2018-11-23 12:26:04,079 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 40 states. [2018-11-23 12:26:04,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:04,081 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-23 12:26:04,081 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-23 12:26:04,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:04,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:04,082 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:04,082 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:04,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:26:04,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-11-23 12:26:04,084 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 54 [2018-11-23 12:26:04,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:04,084 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-23 12:26:04,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:26:04,084 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 12:26:04,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 12:26:04,085 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:04,085 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:26:04,085 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:04,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:04,086 INFO L82 PathProgramCache]: Analyzing trace with hash 830152559, now seen corresponding path program 5 times [2018-11-23 12:26:04,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:04,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:04,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:04,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:04,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:04,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:04,249 INFO L256 TraceCheckUtils]: 0: Hoare triple {2206#true} call ULTIMATE.init(); {2206#true} is VALID [2018-11-23 12:26:04,249 INFO L273 TraceCheckUtils]: 1: Hoare triple {2206#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2206#true} is VALID [2018-11-23 12:26:04,249 INFO L273 TraceCheckUtils]: 2: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:26:04,250 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2206#true} {2206#true} #66#return; {2206#true} is VALID [2018-11-23 12:26:04,250 INFO L256 TraceCheckUtils]: 4: Hoare triple {2206#true} call #t~ret13 := main(); {2206#true} is VALID [2018-11-23 12:26:04,258 INFO L273 TraceCheckUtils]: 5: Hoare triple {2206#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2208#(= main_~i~1 0)} is VALID [2018-11-23 12:26:04,258 INFO L273 TraceCheckUtils]: 6: Hoare triple {2208#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2208#(= main_~i~1 0)} is VALID [2018-11-23 12:26:04,259 INFO L273 TraceCheckUtils]: 7: Hoare triple {2208#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2209#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:04,259 INFO L273 TraceCheckUtils]: 8: Hoare triple {2209#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2209#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:04,260 INFO L273 TraceCheckUtils]: 9: Hoare triple {2209#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2210#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:04,260 INFO L273 TraceCheckUtils]: 10: Hoare triple {2210#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2210#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:04,260 INFO L273 TraceCheckUtils]: 11: Hoare triple {2210#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2211#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:04,261 INFO L273 TraceCheckUtils]: 12: Hoare triple {2211#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2211#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:04,261 INFO L273 TraceCheckUtils]: 13: Hoare triple {2211#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2212#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:04,262 INFO L273 TraceCheckUtils]: 14: Hoare triple {2212#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2212#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:04,262 INFO L273 TraceCheckUtils]: 15: Hoare triple {2212#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2213#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:04,263 INFO L273 TraceCheckUtils]: 16: Hoare triple {2213#(<= main_~i~1 5)} assume !(~i~1 < 100000); {2207#false} is VALID [2018-11-23 12:26:04,263 INFO L256 TraceCheckUtils]: 17: Hoare triple {2207#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {2206#true} is VALID [2018-11-23 12:26:04,264 INFO L273 TraceCheckUtils]: 18: Hoare triple {2206#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2206#true} is VALID [2018-11-23 12:26:04,264 INFO L273 TraceCheckUtils]: 19: Hoare triple {2206#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2206#true} is VALID [2018-11-23 12:26:04,264 INFO L273 TraceCheckUtils]: 20: Hoare triple {2206#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2206#true} is VALID [2018-11-23 12:26:04,264 INFO L273 TraceCheckUtils]: 21: Hoare triple {2206#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2206#true} is VALID [2018-11-23 12:26:04,265 INFO L273 TraceCheckUtils]: 22: Hoare triple {2206#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2206#true} is VALID [2018-11-23 12:26:04,265 INFO L273 TraceCheckUtils]: 23: Hoare triple {2206#true} assume !(~i~0 < 100000); {2206#true} is VALID [2018-11-23 12:26:04,265 INFO L273 TraceCheckUtils]: 24: Hoare triple {2206#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2206#true} is VALID [2018-11-23 12:26:04,265 INFO L273 TraceCheckUtils]: 25: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:26:04,266 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {2206#true} {2207#false} #70#return; {2207#false} is VALID [2018-11-23 12:26:04,266 INFO L273 TraceCheckUtils]: 27: Hoare triple {2207#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {2207#false} is VALID [2018-11-23 12:26:04,266 INFO L256 TraceCheckUtils]: 28: Hoare triple {2207#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {2206#true} is VALID [2018-11-23 12:26:04,266 INFO L273 TraceCheckUtils]: 29: Hoare triple {2206#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2206#true} is VALID [2018-11-23 12:26:04,266 INFO L273 TraceCheckUtils]: 30: Hoare triple {2206#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2206#true} is VALID [2018-11-23 12:26:04,267 INFO L273 TraceCheckUtils]: 31: Hoare triple {2206#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2206#true} is VALID [2018-11-23 12:26:04,267 INFO L273 TraceCheckUtils]: 32: Hoare triple {2206#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2206#true} is VALID [2018-11-23 12:26:04,267 INFO L273 TraceCheckUtils]: 33: Hoare triple {2206#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2206#true} is VALID [2018-11-23 12:26:04,267 INFO L273 TraceCheckUtils]: 34: Hoare triple {2206#true} assume !(~i~0 < 100000); {2206#true} is VALID [2018-11-23 12:26:04,268 INFO L273 TraceCheckUtils]: 35: Hoare triple {2206#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2206#true} is VALID [2018-11-23 12:26:04,268 INFO L273 TraceCheckUtils]: 36: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:26:04,268 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {2206#true} {2207#false} #72#return; {2207#false} is VALID [2018-11-23 12:26:04,268 INFO L273 TraceCheckUtils]: 38: Hoare triple {2207#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {2207#false} is VALID [2018-11-23 12:26:04,268 INFO L273 TraceCheckUtils]: 39: Hoare triple {2207#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {2207#false} is VALID [2018-11-23 12:26:04,268 INFO L273 TraceCheckUtils]: 40: Hoare triple {2207#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {2207#false} is VALID [2018-11-23 12:26:04,268 INFO L273 TraceCheckUtils]: 41: Hoare triple {2207#false} assume !(~i~2 < 99999); {2207#false} is VALID [2018-11-23 12:26:04,269 INFO L273 TraceCheckUtils]: 42: Hoare triple {2207#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {2207#false} is VALID [2018-11-23 12:26:04,269 INFO L256 TraceCheckUtils]: 43: Hoare triple {2207#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {2206#true} is VALID [2018-11-23 12:26:04,269 INFO L273 TraceCheckUtils]: 44: Hoare triple {2206#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2206#true} is VALID [2018-11-23 12:26:04,269 INFO L273 TraceCheckUtils]: 45: Hoare triple {2206#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2206#true} is VALID [2018-11-23 12:26:04,269 INFO L273 TraceCheckUtils]: 46: Hoare triple {2206#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2206#true} is VALID [2018-11-23 12:26:04,269 INFO L273 TraceCheckUtils]: 47: Hoare triple {2206#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2206#true} is VALID [2018-11-23 12:26:04,269 INFO L273 TraceCheckUtils]: 48: Hoare triple {2206#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2206#true} is VALID [2018-11-23 12:26:04,269 INFO L273 TraceCheckUtils]: 49: Hoare triple {2206#true} assume !(~i~0 < 100000); {2206#true} is VALID [2018-11-23 12:26:04,270 INFO L273 TraceCheckUtils]: 50: Hoare triple {2206#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2206#true} is VALID [2018-11-23 12:26:04,270 INFO L273 TraceCheckUtils]: 51: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:26:04,270 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {2206#true} {2207#false} #74#return; {2207#false} is VALID [2018-11-23 12:26:04,270 INFO L273 TraceCheckUtils]: 53: Hoare triple {2207#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {2207#false} is VALID [2018-11-23 12:26:04,270 INFO L273 TraceCheckUtils]: 54: Hoare triple {2207#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {2207#false} is VALID [2018-11-23 12:26:04,270 INFO L273 TraceCheckUtils]: 55: Hoare triple {2207#false} assume !false; {2207#false} is VALID [2018-11-23 12:26:04,272 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-23 12:26:04,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:04,272 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:04,281 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:26:04,387 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 12:26:04,387 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:04,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:04,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:04,986 INFO L256 TraceCheckUtils]: 0: Hoare triple {2206#true} call ULTIMATE.init(); {2206#true} is VALID [2018-11-23 12:26:04,986 INFO L273 TraceCheckUtils]: 1: Hoare triple {2206#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2206#true} is VALID [2018-11-23 12:26:04,986 INFO L273 TraceCheckUtils]: 2: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:26:04,986 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2206#true} {2206#true} #66#return; {2206#true} is VALID [2018-11-23 12:26:04,987 INFO L256 TraceCheckUtils]: 4: Hoare triple {2206#true} call #t~ret13 := main(); {2206#true} is VALID [2018-11-23 12:26:04,987 INFO L273 TraceCheckUtils]: 5: Hoare triple {2206#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2206#true} is VALID [2018-11-23 12:26:04,987 INFO L273 TraceCheckUtils]: 6: Hoare triple {2206#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2206#true} is VALID [2018-11-23 12:26:04,987 INFO L273 TraceCheckUtils]: 7: Hoare triple {2206#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2206#true} is VALID [2018-11-23 12:26:04,987 INFO L273 TraceCheckUtils]: 8: Hoare triple {2206#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2206#true} is VALID [2018-11-23 12:26:04,987 INFO L273 TraceCheckUtils]: 9: Hoare triple {2206#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2206#true} is VALID [2018-11-23 12:26:04,987 INFO L273 TraceCheckUtils]: 10: Hoare triple {2206#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2206#true} is VALID [2018-11-23 12:26:04,987 INFO L273 TraceCheckUtils]: 11: Hoare triple {2206#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2206#true} is VALID [2018-11-23 12:26:04,988 INFO L273 TraceCheckUtils]: 12: Hoare triple {2206#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2206#true} is VALID [2018-11-23 12:26:04,988 INFO L273 TraceCheckUtils]: 13: Hoare triple {2206#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2206#true} is VALID [2018-11-23 12:26:04,988 INFO L273 TraceCheckUtils]: 14: Hoare triple {2206#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2206#true} is VALID [2018-11-23 12:26:04,988 INFO L273 TraceCheckUtils]: 15: Hoare triple {2206#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2206#true} is VALID [2018-11-23 12:26:04,988 INFO L273 TraceCheckUtils]: 16: Hoare triple {2206#true} assume !(~i~1 < 100000); {2206#true} is VALID [2018-11-23 12:26:04,988 INFO L256 TraceCheckUtils]: 17: Hoare triple {2206#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {2206#true} is VALID [2018-11-23 12:26:04,989 INFO L273 TraceCheckUtils]: 18: Hoare triple {2206#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2271#(<= bor_~i~0 1)} is VALID [2018-11-23 12:26:04,989 INFO L273 TraceCheckUtils]: 19: Hoare triple {2271#(<= bor_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2271#(<= bor_~i~0 1)} is VALID [2018-11-23 12:26:05,000 INFO L273 TraceCheckUtils]: 20: Hoare triple {2271#(<= bor_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2278#(<= bor_~i~0 2)} is VALID [2018-11-23 12:26:05,001 INFO L273 TraceCheckUtils]: 21: Hoare triple {2278#(<= bor_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2278#(<= bor_~i~0 2)} is VALID [2018-11-23 12:26:05,001 INFO L273 TraceCheckUtils]: 22: Hoare triple {2278#(<= bor_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2285#(<= bor_~i~0 3)} is VALID [2018-11-23 12:26:05,004 INFO L273 TraceCheckUtils]: 23: Hoare triple {2285#(<= bor_~i~0 3)} assume !(~i~0 < 100000); {2207#false} is VALID [2018-11-23 12:26:05,004 INFO L273 TraceCheckUtils]: 24: Hoare triple {2207#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2207#false} is VALID [2018-11-23 12:26:05,004 INFO L273 TraceCheckUtils]: 25: Hoare triple {2207#false} assume true; {2207#false} is VALID [2018-11-23 12:26:05,004 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {2207#false} {2206#true} #70#return; {2207#false} is VALID [2018-11-23 12:26:05,004 INFO L273 TraceCheckUtils]: 27: Hoare triple {2207#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {2207#false} is VALID [2018-11-23 12:26:05,004 INFO L256 TraceCheckUtils]: 28: Hoare triple {2207#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {2207#false} is VALID [2018-11-23 12:26:05,005 INFO L273 TraceCheckUtils]: 29: Hoare triple {2207#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2207#false} is VALID [2018-11-23 12:26:05,005 INFO L273 TraceCheckUtils]: 30: Hoare triple {2207#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2207#false} is VALID [2018-11-23 12:26:05,005 INFO L273 TraceCheckUtils]: 31: Hoare triple {2207#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2207#false} is VALID [2018-11-23 12:26:05,005 INFO L273 TraceCheckUtils]: 32: Hoare triple {2207#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2207#false} is VALID [2018-11-23 12:26:05,005 INFO L273 TraceCheckUtils]: 33: Hoare triple {2207#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2207#false} is VALID [2018-11-23 12:26:05,005 INFO L273 TraceCheckUtils]: 34: Hoare triple {2207#false} assume !(~i~0 < 100000); {2207#false} is VALID [2018-11-23 12:26:05,005 INFO L273 TraceCheckUtils]: 35: Hoare triple {2207#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2207#false} is VALID [2018-11-23 12:26:05,005 INFO L273 TraceCheckUtils]: 36: Hoare triple {2207#false} assume true; {2207#false} is VALID [2018-11-23 12:26:05,006 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {2207#false} {2207#false} #72#return; {2207#false} is VALID [2018-11-23 12:26:05,006 INFO L273 TraceCheckUtils]: 38: Hoare triple {2207#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {2207#false} is VALID [2018-11-23 12:26:05,006 INFO L273 TraceCheckUtils]: 39: Hoare triple {2207#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {2207#false} is VALID [2018-11-23 12:26:05,006 INFO L273 TraceCheckUtils]: 40: Hoare triple {2207#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {2207#false} is VALID [2018-11-23 12:26:05,006 INFO L273 TraceCheckUtils]: 41: Hoare triple {2207#false} assume !(~i~2 < 99999); {2207#false} is VALID [2018-11-23 12:26:05,006 INFO L273 TraceCheckUtils]: 42: Hoare triple {2207#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {2207#false} is VALID [2018-11-23 12:26:05,007 INFO L256 TraceCheckUtils]: 43: Hoare triple {2207#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {2207#false} is VALID [2018-11-23 12:26:05,007 INFO L273 TraceCheckUtils]: 44: Hoare triple {2207#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2207#false} is VALID [2018-11-23 12:26:05,007 INFO L273 TraceCheckUtils]: 45: Hoare triple {2207#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2207#false} is VALID [2018-11-23 12:26:05,007 INFO L273 TraceCheckUtils]: 46: Hoare triple {2207#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2207#false} is VALID [2018-11-23 12:26:05,007 INFO L273 TraceCheckUtils]: 47: Hoare triple {2207#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2207#false} is VALID [2018-11-23 12:26:05,008 INFO L273 TraceCheckUtils]: 48: Hoare triple {2207#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2207#false} is VALID [2018-11-23 12:26:05,008 INFO L273 TraceCheckUtils]: 49: Hoare triple {2207#false} assume !(~i~0 < 100000); {2207#false} is VALID [2018-11-23 12:26:05,008 INFO L273 TraceCheckUtils]: 50: Hoare triple {2207#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2207#false} is VALID [2018-11-23 12:26:05,008 INFO L273 TraceCheckUtils]: 51: Hoare triple {2207#false} assume true; {2207#false} is VALID [2018-11-23 12:26:05,008 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {2207#false} {2207#false} #74#return; {2207#false} is VALID [2018-11-23 12:26:05,008 INFO L273 TraceCheckUtils]: 53: Hoare triple {2207#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {2207#false} is VALID [2018-11-23 12:26:05,008 INFO L273 TraceCheckUtils]: 54: Hoare triple {2207#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {2207#false} is VALID [2018-11-23 12:26:05,008 INFO L273 TraceCheckUtils]: 55: Hoare triple {2207#false} assume !false; {2207#false} is VALID [2018-11-23 12:26:05,010 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 28 proven. 4 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-23 12:26:05,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:05,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-11-23 12:26:05,029 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2018-11-23 12:26:05,030 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:05,030 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:26:05,207 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:05,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:26:05,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:26:05,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:26:05,208 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 11 states. [2018-11-23 12:26:05,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:05,759 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2018-11-23 12:26:05,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:26:05,759 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2018-11-23 12:26:05,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:05,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:26:05,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 74 transitions. [2018-11-23 12:26:05,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:26:05,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 74 transitions. [2018-11-23 12:26:05,763 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 74 transitions. [2018-11-23 12:26:05,858 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:05,859 INFO L225 Difference]: With dead ends: 67 [2018-11-23 12:26:05,859 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 12:26:05,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:26:05,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 12:26:05,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-11-23 12:26:05,918 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:05,918 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 43 states. [2018-11-23 12:26:05,918 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 43 states. [2018-11-23 12:26:05,918 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 43 states. [2018-11-23 12:26:05,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:05,920 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-11-23 12:26:05,921 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-23 12:26:05,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:05,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:05,921 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 45 states. [2018-11-23 12:26:05,922 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 45 states. [2018-11-23 12:26:05,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:05,924 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-11-23 12:26:05,924 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-23 12:26:05,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:05,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:05,925 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:05,925 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:05,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:26:05,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-11-23 12:26:05,927 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 56 [2018-11-23 12:26:05,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:05,927 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-11-23 12:26:05,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:26:05,928 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-23 12:26:05,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 12:26:05,929 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:05,929 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:26:05,929 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:05,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:05,929 INFO L82 PathProgramCache]: Analyzing trace with hash 968039375, now seen corresponding path program 6 times [2018-11-23 12:26:05,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:05,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:05,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:05,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:05,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:05,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:06,293 INFO L256 TraceCheckUtils]: 0: Hoare triple {2635#true} call ULTIMATE.init(); {2635#true} is VALID [2018-11-23 12:26:06,294 INFO L273 TraceCheckUtils]: 1: Hoare triple {2635#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2635#true} is VALID [2018-11-23 12:26:06,294 INFO L273 TraceCheckUtils]: 2: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:26:06,294 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2635#true} {2635#true} #66#return; {2635#true} is VALID [2018-11-23 12:26:06,295 INFO L256 TraceCheckUtils]: 4: Hoare triple {2635#true} call #t~ret13 := main(); {2635#true} is VALID [2018-11-23 12:26:06,308 INFO L273 TraceCheckUtils]: 5: Hoare triple {2635#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2637#(= main_~i~1 0)} is VALID [2018-11-23 12:26:06,318 INFO L273 TraceCheckUtils]: 6: Hoare triple {2637#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2637#(= main_~i~1 0)} is VALID [2018-11-23 12:26:06,318 INFO L273 TraceCheckUtils]: 7: Hoare triple {2637#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2638#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:06,321 INFO L273 TraceCheckUtils]: 8: Hoare triple {2638#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2638#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:06,321 INFO L273 TraceCheckUtils]: 9: Hoare triple {2638#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2639#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:06,324 INFO L273 TraceCheckUtils]: 10: Hoare triple {2639#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2639#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:06,324 INFO L273 TraceCheckUtils]: 11: Hoare triple {2639#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2640#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:06,324 INFO L273 TraceCheckUtils]: 12: Hoare triple {2640#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2640#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:06,325 INFO L273 TraceCheckUtils]: 13: Hoare triple {2640#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2641#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:06,325 INFO L273 TraceCheckUtils]: 14: Hoare triple {2641#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2641#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:06,326 INFO L273 TraceCheckUtils]: 15: Hoare triple {2641#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2642#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:06,326 INFO L273 TraceCheckUtils]: 16: Hoare triple {2642#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2642#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:06,326 INFO L273 TraceCheckUtils]: 17: Hoare triple {2642#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2643#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:06,327 INFO L273 TraceCheckUtils]: 18: Hoare triple {2643#(<= main_~i~1 6)} assume !(~i~1 < 100000); {2636#false} is VALID [2018-11-23 12:26:06,327 INFO L256 TraceCheckUtils]: 19: Hoare triple {2636#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {2635#true} is VALID [2018-11-23 12:26:06,327 INFO L273 TraceCheckUtils]: 20: Hoare triple {2635#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2635#true} is VALID [2018-11-23 12:26:06,327 INFO L273 TraceCheckUtils]: 21: Hoare triple {2635#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:26:06,327 INFO L273 TraceCheckUtils]: 22: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:26:06,328 INFO L273 TraceCheckUtils]: 23: Hoare triple {2635#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:26:06,328 INFO L273 TraceCheckUtils]: 24: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:26:06,328 INFO L273 TraceCheckUtils]: 25: Hoare triple {2635#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:26:06,328 INFO L273 TraceCheckUtils]: 26: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:26:06,328 INFO L273 TraceCheckUtils]: 27: Hoare triple {2635#true} assume !(~i~0 < 100000); {2635#true} is VALID [2018-11-23 12:26:06,328 INFO L273 TraceCheckUtils]: 28: Hoare triple {2635#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2635#true} is VALID [2018-11-23 12:26:06,328 INFO L273 TraceCheckUtils]: 29: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:26:06,328 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {2635#true} {2636#false} #70#return; {2636#false} is VALID [2018-11-23 12:26:06,329 INFO L273 TraceCheckUtils]: 31: Hoare triple {2636#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {2636#false} is VALID [2018-11-23 12:26:06,329 INFO L256 TraceCheckUtils]: 32: Hoare triple {2636#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {2635#true} is VALID [2018-11-23 12:26:06,329 INFO L273 TraceCheckUtils]: 33: Hoare triple {2635#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2635#true} is VALID [2018-11-23 12:26:06,329 INFO L273 TraceCheckUtils]: 34: Hoare triple {2635#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:26:06,329 INFO L273 TraceCheckUtils]: 35: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:26:06,330 INFO L273 TraceCheckUtils]: 36: Hoare triple {2635#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:26:06,330 INFO L273 TraceCheckUtils]: 37: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:26:06,330 INFO L273 TraceCheckUtils]: 38: Hoare triple {2635#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:26:06,330 INFO L273 TraceCheckUtils]: 39: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:26:06,330 INFO L273 TraceCheckUtils]: 40: Hoare triple {2635#true} assume !(~i~0 < 100000); {2635#true} is VALID [2018-11-23 12:26:06,331 INFO L273 TraceCheckUtils]: 41: Hoare triple {2635#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2635#true} is VALID [2018-11-23 12:26:06,331 INFO L273 TraceCheckUtils]: 42: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:26:06,331 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {2635#true} {2636#false} #72#return; {2636#false} is VALID [2018-11-23 12:26:06,331 INFO L273 TraceCheckUtils]: 44: Hoare triple {2636#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {2636#false} is VALID [2018-11-23 12:26:06,331 INFO L273 TraceCheckUtils]: 45: Hoare triple {2636#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {2636#false} is VALID [2018-11-23 12:26:06,331 INFO L273 TraceCheckUtils]: 46: Hoare triple {2636#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {2636#false} is VALID [2018-11-23 12:26:06,331 INFO L273 TraceCheckUtils]: 47: Hoare triple {2636#false} assume !(~i~2 < 99999); {2636#false} is VALID [2018-11-23 12:26:06,332 INFO L273 TraceCheckUtils]: 48: Hoare triple {2636#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {2636#false} is VALID [2018-11-23 12:26:06,332 INFO L256 TraceCheckUtils]: 49: Hoare triple {2636#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {2635#true} is VALID [2018-11-23 12:26:06,332 INFO L273 TraceCheckUtils]: 50: Hoare triple {2635#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2635#true} is VALID [2018-11-23 12:26:06,332 INFO L273 TraceCheckUtils]: 51: Hoare triple {2635#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:26:06,332 INFO L273 TraceCheckUtils]: 52: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:26:06,332 INFO L273 TraceCheckUtils]: 53: Hoare triple {2635#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:26:06,332 INFO L273 TraceCheckUtils]: 54: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:26:06,332 INFO L273 TraceCheckUtils]: 55: Hoare triple {2635#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:26:06,333 INFO L273 TraceCheckUtils]: 56: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:26:06,333 INFO L273 TraceCheckUtils]: 57: Hoare triple {2635#true} assume !(~i~0 < 100000); {2635#true} is VALID [2018-11-23 12:26:06,333 INFO L273 TraceCheckUtils]: 58: Hoare triple {2635#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2635#true} is VALID [2018-11-23 12:26:06,333 INFO L273 TraceCheckUtils]: 59: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:26:06,333 INFO L268 TraceCheckUtils]: 60: Hoare quadruple {2635#true} {2636#false} #74#return; {2636#false} is VALID [2018-11-23 12:26:06,333 INFO L273 TraceCheckUtils]: 61: Hoare triple {2636#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {2636#false} is VALID [2018-11-23 12:26:06,333 INFO L273 TraceCheckUtils]: 62: Hoare triple {2636#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {2636#false} is VALID [2018-11-23 12:26:06,333 INFO L273 TraceCheckUtils]: 63: Hoare triple {2636#false} assume !false; {2636#false} is VALID [2018-11-23 12:26:06,335 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-11-23 12:26:06,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:06,336 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:06,347 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:26:06,386 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-11-23 12:26:06,386 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:06,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:06,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:06,574 INFO L256 TraceCheckUtils]: 0: Hoare triple {2635#true} call ULTIMATE.init(); {2635#true} is VALID [2018-11-23 12:26:06,574 INFO L273 TraceCheckUtils]: 1: Hoare triple {2635#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2635#true} is VALID [2018-11-23 12:26:06,574 INFO L273 TraceCheckUtils]: 2: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:26:06,575 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2635#true} {2635#true} #66#return; {2635#true} is VALID [2018-11-23 12:26:06,575 INFO L256 TraceCheckUtils]: 4: Hoare triple {2635#true} call #t~ret13 := main(); {2635#true} is VALID [2018-11-23 12:26:06,575 INFO L273 TraceCheckUtils]: 5: Hoare triple {2635#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2635#true} is VALID [2018-11-23 12:26:06,575 INFO L273 TraceCheckUtils]: 6: Hoare triple {2635#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2635#true} is VALID [2018-11-23 12:26:06,576 INFO L273 TraceCheckUtils]: 7: Hoare triple {2635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2635#true} is VALID [2018-11-23 12:26:06,576 INFO L273 TraceCheckUtils]: 8: Hoare triple {2635#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2635#true} is VALID [2018-11-23 12:26:06,576 INFO L273 TraceCheckUtils]: 9: Hoare triple {2635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2635#true} is VALID [2018-11-23 12:26:06,576 INFO L273 TraceCheckUtils]: 10: Hoare triple {2635#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2635#true} is VALID [2018-11-23 12:26:06,576 INFO L273 TraceCheckUtils]: 11: Hoare triple {2635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2635#true} is VALID [2018-11-23 12:26:06,577 INFO L273 TraceCheckUtils]: 12: Hoare triple {2635#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2635#true} is VALID [2018-11-23 12:26:06,577 INFO L273 TraceCheckUtils]: 13: Hoare triple {2635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2635#true} is VALID [2018-11-23 12:26:06,577 INFO L273 TraceCheckUtils]: 14: Hoare triple {2635#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2635#true} is VALID [2018-11-23 12:26:06,577 INFO L273 TraceCheckUtils]: 15: Hoare triple {2635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2635#true} is VALID [2018-11-23 12:26:06,577 INFO L273 TraceCheckUtils]: 16: Hoare triple {2635#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {2635#true} is VALID [2018-11-23 12:26:06,578 INFO L273 TraceCheckUtils]: 17: Hoare triple {2635#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {2635#true} is VALID [2018-11-23 12:26:06,578 INFO L273 TraceCheckUtils]: 18: Hoare triple {2635#true} assume !(~i~1 < 100000); {2635#true} is VALID [2018-11-23 12:26:06,578 INFO L256 TraceCheckUtils]: 19: Hoare triple {2635#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {2635#true} is VALID [2018-11-23 12:26:06,578 INFO L273 TraceCheckUtils]: 20: Hoare triple {2635#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2635#true} is VALID [2018-11-23 12:26:06,578 INFO L273 TraceCheckUtils]: 21: Hoare triple {2635#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:26:06,578 INFO L273 TraceCheckUtils]: 22: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:26:06,579 INFO L273 TraceCheckUtils]: 23: Hoare triple {2635#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:26:06,579 INFO L273 TraceCheckUtils]: 24: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:26:06,579 INFO L273 TraceCheckUtils]: 25: Hoare triple {2635#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:26:06,579 INFO L273 TraceCheckUtils]: 26: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:26:06,579 INFO L273 TraceCheckUtils]: 27: Hoare triple {2635#true} assume !(~i~0 < 100000); {2635#true} is VALID [2018-11-23 12:26:06,579 INFO L273 TraceCheckUtils]: 28: Hoare triple {2635#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2635#true} is VALID [2018-11-23 12:26:06,579 INFO L273 TraceCheckUtils]: 29: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:26:06,579 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {2635#true} {2635#true} #70#return; {2635#true} is VALID [2018-11-23 12:26:06,580 INFO L273 TraceCheckUtils]: 31: Hoare triple {2635#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {2635#true} is VALID [2018-11-23 12:26:06,580 INFO L256 TraceCheckUtils]: 32: Hoare triple {2635#true} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {2635#true} is VALID [2018-11-23 12:26:06,580 INFO L273 TraceCheckUtils]: 33: Hoare triple {2635#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2635#true} is VALID [2018-11-23 12:26:06,580 INFO L273 TraceCheckUtils]: 34: Hoare triple {2635#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:26:06,580 INFO L273 TraceCheckUtils]: 35: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:26:06,580 INFO L273 TraceCheckUtils]: 36: Hoare triple {2635#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:26:06,580 INFO L273 TraceCheckUtils]: 37: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:26:06,581 INFO L273 TraceCheckUtils]: 38: Hoare triple {2635#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:26:06,581 INFO L273 TraceCheckUtils]: 39: Hoare triple {2635#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2635#true} is VALID [2018-11-23 12:26:06,581 INFO L273 TraceCheckUtils]: 40: Hoare triple {2635#true} assume !(~i~0 < 100000); {2635#true} is VALID [2018-11-23 12:26:06,581 INFO L273 TraceCheckUtils]: 41: Hoare triple {2635#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2635#true} is VALID [2018-11-23 12:26:06,581 INFO L273 TraceCheckUtils]: 42: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:26:06,581 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {2635#true} {2635#true} #72#return; {2635#true} is VALID [2018-11-23 12:26:06,601 INFO L273 TraceCheckUtils]: 44: Hoare triple {2635#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {2779#(<= main_~i~2 0)} is VALID [2018-11-23 12:26:06,610 INFO L273 TraceCheckUtils]: 45: Hoare triple {2779#(<= main_~i~2 0)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {2779#(<= main_~i~2 0)} is VALID [2018-11-23 12:26:06,619 INFO L273 TraceCheckUtils]: 46: Hoare triple {2779#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {2786#(<= main_~i~2 1)} is VALID [2018-11-23 12:26:06,619 INFO L273 TraceCheckUtils]: 47: Hoare triple {2786#(<= main_~i~2 1)} assume !(~i~2 < 99999); {2636#false} is VALID [2018-11-23 12:26:06,620 INFO L273 TraceCheckUtils]: 48: Hoare triple {2636#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {2636#false} is VALID [2018-11-23 12:26:06,620 INFO L256 TraceCheckUtils]: 49: Hoare triple {2636#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {2636#false} is VALID [2018-11-23 12:26:06,620 INFO L273 TraceCheckUtils]: 50: Hoare triple {2636#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2636#false} is VALID [2018-11-23 12:26:06,620 INFO L273 TraceCheckUtils]: 51: Hoare triple {2636#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2636#false} is VALID [2018-11-23 12:26:06,620 INFO L273 TraceCheckUtils]: 52: Hoare triple {2636#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2636#false} is VALID [2018-11-23 12:26:06,620 INFO L273 TraceCheckUtils]: 53: Hoare triple {2636#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2636#false} is VALID [2018-11-23 12:26:06,620 INFO L273 TraceCheckUtils]: 54: Hoare triple {2636#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2636#false} is VALID [2018-11-23 12:26:06,621 INFO L273 TraceCheckUtils]: 55: Hoare triple {2636#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {2636#false} is VALID [2018-11-23 12:26:06,621 INFO L273 TraceCheckUtils]: 56: Hoare triple {2636#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2636#false} is VALID [2018-11-23 12:26:06,621 INFO L273 TraceCheckUtils]: 57: Hoare triple {2636#false} assume !(~i~0 < 100000); {2636#false} is VALID [2018-11-23 12:26:06,621 INFO L273 TraceCheckUtils]: 58: Hoare triple {2636#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2636#false} is VALID [2018-11-23 12:26:06,621 INFO L273 TraceCheckUtils]: 59: Hoare triple {2636#false} assume true; {2636#false} is VALID [2018-11-23 12:26:06,622 INFO L268 TraceCheckUtils]: 60: Hoare quadruple {2636#false} {2636#false} #74#return; {2636#false} is VALID [2018-11-23 12:26:06,622 INFO L273 TraceCheckUtils]: 61: Hoare triple {2636#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {2636#false} is VALID [2018-11-23 12:26:06,622 INFO L273 TraceCheckUtils]: 62: Hoare triple {2636#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {2636#false} is VALID [2018-11-23 12:26:06,622 INFO L273 TraceCheckUtils]: 63: Hoare triple {2636#false} assume !false; {2636#false} is VALID [2018-11-23 12:26:06,625 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 58 proven. 1 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-11-23 12:26:06,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:06,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2018-11-23 12:26:06,654 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2018-11-23 12:26:06,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:06,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:26:06,787 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:06,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:26:06,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:26:06,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:26:06,788 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 11 states. [2018-11-23 12:26:07,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:07,041 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-11-23 12:26:07,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:26:07,042 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2018-11-23 12:26:07,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:07,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:26:07,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 71 transitions. [2018-11-23 12:26:07,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:26:07,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 71 transitions. [2018-11-23 12:26:07,045 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 71 transitions. [2018-11-23 12:26:07,167 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:07,169 INFO L225 Difference]: With dead ends: 73 [2018-11-23 12:26:07,169 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 12:26:07,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:26:07,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 12:26:07,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-11-23 12:26:07,236 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:07,237 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 47 states. [2018-11-23 12:26:07,237 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 47 states. [2018-11-23 12:26:07,237 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 47 states. [2018-11-23 12:26:07,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:07,242 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-23 12:26:07,242 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-23 12:26:07,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:07,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:07,243 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 49 states. [2018-11-23 12:26:07,243 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 49 states. [2018-11-23 12:26:07,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:07,245 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-23 12:26:07,245 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-23 12:26:07,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:07,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:07,245 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:07,245 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:07,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:26:07,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-11-23 12:26:07,247 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 64 [2018-11-23 12:26:07,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:07,247 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-11-23 12:26:07,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:26:07,248 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-23 12:26:07,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 12:26:07,248 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:07,249 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 7, 7, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:26:07,249 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:07,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:07,249 INFO L82 PathProgramCache]: Analyzing trace with hash -117250513, now seen corresponding path program 7 times [2018-11-23 12:26:07,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:07,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:07,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:07,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:07,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:07,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:07,517 INFO L256 TraceCheckUtils]: 0: Hoare triple {3111#true} call ULTIMATE.init(); {3111#true} is VALID [2018-11-23 12:26:07,518 INFO L273 TraceCheckUtils]: 1: Hoare triple {3111#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3111#true} is VALID [2018-11-23 12:26:07,518 INFO L273 TraceCheckUtils]: 2: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:26:07,519 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3111#true} {3111#true} #66#return; {3111#true} is VALID [2018-11-23 12:26:07,519 INFO L256 TraceCheckUtils]: 4: Hoare triple {3111#true} call #t~ret13 := main(); {3111#true} is VALID [2018-11-23 12:26:07,519 INFO L273 TraceCheckUtils]: 5: Hoare triple {3111#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3113#(= main_~i~1 0)} is VALID [2018-11-23 12:26:07,520 INFO L273 TraceCheckUtils]: 6: Hoare triple {3113#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3113#(= main_~i~1 0)} is VALID [2018-11-23 12:26:07,520 INFO L273 TraceCheckUtils]: 7: Hoare triple {3113#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3114#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:07,521 INFO L273 TraceCheckUtils]: 8: Hoare triple {3114#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3114#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:07,521 INFO L273 TraceCheckUtils]: 9: Hoare triple {3114#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3115#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:07,522 INFO L273 TraceCheckUtils]: 10: Hoare triple {3115#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3115#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:07,522 INFO L273 TraceCheckUtils]: 11: Hoare triple {3115#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3116#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:07,523 INFO L273 TraceCheckUtils]: 12: Hoare triple {3116#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3116#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:07,523 INFO L273 TraceCheckUtils]: 13: Hoare triple {3116#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3117#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:07,524 INFO L273 TraceCheckUtils]: 14: Hoare triple {3117#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3117#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:07,525 INFO L273 TraceCheckUtils]: 15: Hoare triple {3117#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3118#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:07,525 INFO L273 TraceCheckUtils]: 16: Hoare triple {3118#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3118#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:07,526 INFO L273 TraceCheckUtils]: 17: Hoare triple {3118#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3119#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:07,527 INFO L273 TraceCheckUtils]: 18: Hoare triple {3119#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3119#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:07,527 INFO L273 TraceCheckUtils]: 19: Hoare triple {3119#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3120#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:07,528 INFO L273 TraceCheckUtils]: 20: Hoare triple {3120#(<= main_~i~1 7)} assume !(~i~1 < 100000); {3112#false} is VALID [2018-11-23 12:26:07,528 INFO L256 TraceCheckUtils]: 21: Hoare triple {3112#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {3111#true} is VALID [2018-11-23 12:26:07,528 INFO L273 TraceCheckUtils]: 22: Hoare triple {3111#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3111#true} is VALID [2018-11-23 12:26:07,529 INFO L273 TraceCheckUtils]: 23: Hoare triple {3111#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3111#true} is VALID [2018-11-23 12:26:07,529 INFO L273 TraceCheckUtils]: 24: Hoare triple {3111#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3111#true} is VALID [2018-11-23 12:26:07,529 INFO L273 TraceCheckUtils]: 25: Hoare triple {3111#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3111#true} is VALID [2018-11-23 12:26:07,529 INFO L273 TraceCheckUtils]: 26: Hoare triple {3111#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3111#true} is VALID [2018-11-23 12:26:07,530 INFO L273 TraceCheckUtils]: 27: Hoare triple {3111#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3111#true} is VALID [2018-11-23 12:26:07,530 INFO L273 TraceCheckUtils]: 28: Hoare triple {3111#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3111#true} is VALID [2018-11-23 12:26:07,530 INFO L273 TraceCheckUtils]: 29: Hoare triple {3111#true} assume !(~i~0 < 100000); {3111#true} is VALID [2018-11-23 12:26:07,530 INFO L273 TraceCheckUtils]: 30: Hoare triple {3111#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3111#true} is VALID [2018-11-23 12:26:07,530 INFO L273 TraceCheckUtils]: 31: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:26:07,531 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {3111#true} {3112#false} #70#return; {3112#false} is VALID [2018-11-23 12:26:07,531 INFO L273 TraceCheckUtils]: 33: Hoare triple {3112#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {3112#false} is VALID [2018-11-23 12:26:07,531 INFO L256 TraceCheckUtils]: 34: Hoare triple {3112#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {3111#true} is VALID [2018-11-23 12:26:07,531 INFO L273 TraceCheckUtils]: 35: Hoare triple {3111#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3111#true} is VALID [2018-11-23 12:26:07,531 INFO L273 TraceCheckUtils]: 36: Hoare triple {3111#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3111#true} is VALID [2018-11-23 12:26:07,532 INFO L273 TraceCheckUtils]: 37: Hoare triple {3111#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3111#true} is VALID [2018-11-23 12:26:07,532 INFO L273 TraceCheckUtils]: 38: Hoare triple {3111#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3111#true} is VALID [2018-11-23 12:26:07,532 INFO L273 TraceCheckUtils]: 39: Hoare triple {3111#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3111#true} is VALID [2018-11-23 12:26:07,532 INFO L273 TraceCheckUtils]: 40: Hoare triple {3111#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3111#true} is VALID [2018-11-23 12:26:07,532 INFO L273 TraceCheckUtils]: 41: Hoare triple {3111#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3111#true} is VALID [2018-11-23 12:26:07,532 INFO L273 TraceCheckUtils]: 42: Hoare triple {3111#true} assume !(~i~0 < 100000); {3111#true} is VALID [2018-11-23 12:26:07,532 INFO L273 TraceCheckUtils]: 43: Hoare triple {3111#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3111#true} is VALID [2018-11-23 12:26:07,533 INFO L273 TraceCheckUtils]: 44: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:26:07,533 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {3111#true} {3112#false} #72#return; {3112#false} is VALID [2018-11-23 12:26:07,533 INFO L273 TraceCheckUtils]: 46: Hoare triple {3112#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {3112#false} is VALID [2018-11-23 12:26:07,533 INFO L273 TraceCheckUtils]: 47: Hoare triple {3112#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {3112#false} is VALID [2018-11-23 12:26:07,533 INFO L273 TraceCheckUtils]: 48: Hoare triple {3112#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {3112#false} is VALID [2018-11-23 12:26:07,533 INFO L273 TraceCheckUtils]: 49: Hoare triple {3112#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {3112#false} is VALID [2018-11-23 12:26:07,533 INFO L273 TraceCheckUtils]: 50: Hoare triple {3112#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {3112#false} is VALID [2018-11-23 12:26:07,533 INFO L273 TraceCheckUtils]: 51: Hoare triple {3112#false} assume !(~i~2 < 99999); {3112#false} is VALID [2018-11-23 12:26:07,534 INFO L273 TraceCheckUtils]: 52: Hoare triple {3112#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {3112#false} is VALID [2018-11-23 12:26:07,534 INFO L256 TraceCheckUtils]: 53: Hoare triple {3112#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {3111#true} is VALID [2018-11-23 12:26:07,534 INFO L273 TraceCheckUtils]: 54: Hoare triple {3111#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3111#true} is VALID [2018-11-23 12:26:07,534 INFO L273 TraceCheckUtils]: 55: Hoare triple {3111#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3111#true} is VALID [2018-11-23 12:26:07,534 INFO L273 TraceCheckUtils]: 56: Hoare triple {3111#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3111#true} is VALID [2018-11-23 12:26:07,534 INFO L273 TraceCheckUtils]: 57: Hoare triple {3111#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3111#true} is VALID [2018-11-23 12:26:07,534 INFO L273 TraceCheckUtils]: 58: Hoare triple {3111#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3111#true} is VALID [2018-11-23 12:26:07,534 INFO L273 TraceCheckUtils]: 59: Hoare triple {3111#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3111#true} is VALID [2018-11-23 12:26:07,534 INFO L273 TraceCheckUtils]: 60: Hoare triple {3111#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3111#true} is VALID [2018-11-23 12:26:07,535 INFO L273 TraceCheckUtils]: 61: Hoare triple {3111#true} assume !(~i~0 < 100000); {3111#true} is VALID [2018-11-23 12:26:07,535 INFO L273 TraceCheckUtils]: 62: Hoare triple {3111#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3111#true} is VALID [2018-11-23 12:26:07,535 INFO L273 TraceCheckUtils]: 63: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:26:07,535 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {3111#true} {3112#false} #74#return; {3112#false} is VALID [2018-11-23 12:26:07,535 INFO L273 TraceCheckUtils]: 65: Hoare triple {3112#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {3112#false} is VALID [2018-11-23 12:26:07,535 INFO L273 TraceCheckUtils]: 66: Hoare triple {3112#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {3112#false} is VALID [2018-11-23 12:26:07,535 INFO L273 TraceCheckUtils]: 67: Hoare triple {3112#false} assume !false; {3112#false} is VALID [2018-11-23 12:26:07,538 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-11-23 12:26:07,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:07,538 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:07,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:26:07,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:07,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:07,846 INFO L256 TraceCheckUtils]: 0: Hoare triple {3111#true} call ULTIMATE.init(); {3111#true} is VALID [2018-11-23 12:26:07,846 INFO L273 TraceCheckUtils]: 1: Hoare triple {3111#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3111#true} is VALID [2018-11-23 12:26:07,846 INFO L273 TraceCheckUtils]: 2: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:26:07,847 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3111#true} {3111#true} #66#return; {3111#true} is VALID [2018-11-23 12:26:07,847 INFO L256 TraceCheckUtils]: 4: Hoare triple {3111#true} call #t~ret13 := main(); {3111#true} is VALID [2018-11-23 12:26:07,848 INFO L273 TraceCheckUtils]: 5: Hoare triple {3111#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3139#(<= main_~i~1 0)} is VALID [2018-11-23 12:26:07,848 INFO L273 TraceCheckUtils]: 6: Hoare triple {3139#(<= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3139#(<= main_~i~1 0)} is VALID [2018-11-23 12:26:07,849 INFO L273 TraceCheckUtils]: 7: Hoare triple {3139#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3114#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:07,849 INFO L273 TraceCheckUtils]: 8: Hoare triple {3114#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3114#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:07,850 INFO L273 TraceCheckUtils]: 9: Hoare triple {3114#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3115#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:07,850 INFO L273 TraceCheckUtils]: 10: Hoare triple {3115#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3115#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:07,850 INFO L273 TraceCheckUtils]: 11: Hoare triple {3115#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3116#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:07,851 INFO L273 TraceCheckUtils]: 12: Hoare triple {3116#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3116#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:07,851 INFO L273 TraceCheckUtils]: 13: Hoare triple {3116#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3117#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:07,852 INFO L273 TraceCheckUtils]: 14: Hoare triple {3117#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3117#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:07,853 INFO L273 TraceCheckUtils]: 15: Hoare triple {3117#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3118#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:07,853 INFO L273 TraceCheckUtils]: 16: Hoare triple {3118#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3118#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:07,854 INFO L273 TraceCheckUtils]: 17: Hoare triple {3118#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3119#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:07,855 INFO L273 TraceCheckUtils]: 18: Hoare triple {3119#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3119#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:07,855 INFO L273 TraceCheckUtils]: 19: Hoare triple {3119#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3120#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:07,856 INFO L273 TraceCheckUtils]: 20: Hoare triple {3120#(<= main_~i~1 7)} assume !(~i~1 < 100000); {3112#false} is VALID [2018-11-23 12:26:07,856 INFO L256 TraceCheckUtils]: 21: Hoare triple {3112#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {3112#false} is VALID [2018-11-23 12:26:07,856 INFO L273 TraceCheckUtils]: 22: Hoare triple {3112#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3112#false} is VALID [2018-11-23 12:26:07,856 INFO L273 TraceCheckUtils]: 23: Hoare triple {3112#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3112#false} is VALID [2018-11-23 12:26:07,857 INFO L273 TraceCheckUtils]: 24: Hoare triple {3112#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3112#false} is VALID [2018-11-23 12:26:07,857 INFO L273 TraceCheckUtils]: 25: Hoare triple {3112#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3112#false} is VALID [2018-11-23 12:26:07,857 INFO L273 TraceCheckUtils]: 26: Hoare triple {3112#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3112#false} is VALID [2018-11-23 12:26:07,857 INFO L273 TraceCheckUtils]: 27: Hoare triple {3112#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3112#false} is VALID [2018-11-23 12:26:07,857 INFO L273 TraceCheckUtils]: 28: Hoare triple {3112#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3112#false} is VALID [2018-11-23 12:26:07,858 INFO L273 TraceCheckUtils]: 29: Hoare triple {3112#false} assume !(~i~0 < 100000); {3112#false} is VALID [2018-11-23 12:26:07,858 INFO L273 TraceCheckUtils]: 30: Hoare triple {3112#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3112#false} is VALID [2018-11-23 12:26:07,858 INFO L273 TraceCheckUtils]: 31: Hoare triple {3112#false} assume true; {3112#false} is VALID [2018-11-23 12:26:07,858 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {3112#false} {3112#false} #70#return; {3112#false} is VALID [2018-11-23 12:26:07,859 INFO L273 TraceCheckUtils]: 33: Hoare triple {3112#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {3112#false} is VALID [2018-11-23 12:26:07,859 INFO L256 TraceCheckUtils]: 34: Hoare triple {3112#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {3112#false} is VALID [2018-11-23 12:26:07,859 INFO L273 TraceCheckUtils]: 35: Hoare triple {3112#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3112#false} is VALID [2018-11-23 12:26:07,859 INFO L273 TraceCheckUtils]: 36: Hoare triple {3112#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3112#false} is VALID [2018-11-23 12:26:07,859 INFO L273 TraceCheckUtils]: 37: Hoare triple {3112#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3112#false} is VALID [2018-11-23 12:26:07,859 INFO L273 TraceCheckUtils]: 38: Hoare triple {3112#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3112#false} is VALID [2018-11-23 12:26:07,859 INFO L273 TraceCheckUtils]: 39: Hoare triple {3112#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3112#false} is VALID [2018-11-23 12:26:07,859 INFO L273 TraceCheckUtils]: 40: Hoare triple {3112#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3112#false} is VALID [2018-11-23 12:26:07,859 INFO L273 TraceCheckUtils]: 41: Hoare triple {3112#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3112#false} is VALID [2018-11-23 12:26:07,860 INFO L273 TraceCheckUtils]: 42: Hoare triple {3112#false} assume !(~i~0 < 100000); {3112#false} is VALID [2018-11-23 12:26:07,860 INFO L273 TraceCheckUtils]: 43: Hoare triple {3112#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3112#false} is VALID [2018-11-23 12:26:07,860 INFO L273 TraceCheckUtils]: 44: Hoare triple {3112#false} assume true; {3112#false} is VALID [2018-11-23 12:26:07,860 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {3112#false} {3112#false} #72#return; {3112#false} is VALID [2018-11-23 12:26:07,860 INFO L273 TraceCheckUtils]: 46: Hoare triple {3112#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {3112#false} is VALID [2018-11-23 12:26:07,860 INFO L273 TraceCheckUtils]: 47: Hoare triple {3112#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {3112#false} is VALID [2018-11-23 12:26:07,860 INFO L273 TraceCheckUtils]: 48: Hoare triple {3112#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {3112#false} is VALID [2018-11-23 12:26:07,861 INFO L273 TraceCheckUtils]: 49: Hoare triple {3112#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {3112#false} is VALID [2018-11-23 12:26:07,861 INFO L273 TraceCheckUtils]: 50: Hoare triple {3112#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {3112#false} is VALID [2018-11-23 12:26:07,861 INFO L273 TraceCheckUtils]: 51: Hoare triple {3112#false} assume !(~i~2 < 99999); {3112#false} is VALID [2018-11-23 12:26:07,861 INFO L273 TraceCheckUtils]: 52: Hoare triple {3112#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {3112#false} is VALID [2018-11-23 12:26:07,861 INFO L256 TraceCheckUtils]: 53: Hoare triple {3112#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {3112#false} is VALID [2018-11-23 12:26:07,861 INFO L273 TraceCheckUtils]: 54: Hoare triple {3112#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3112#false} is VALID [2018-11-23 12:26:07,862 INFO L273 TraceCheckUtils]: 55: Hoare triple {3112#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3112#false} is VALID [2018-11-23 12:26:07,862 INFO L273 TraceCheckUtils]: 56: Hoare triple {3112#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3112#false} is VALID [2018-11-23 12:26:07,862 INFO L273 TraceCheckUtils]: 57: Hoare triple {3112#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3112#false} is VALID [2018-11-23 12:26:07,862 INFO L273 TraceCheckUtils]: 58: Hoare triple {3112#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3112#false} is VALID [2018-11-23 12:26:07,862 INFO L273 TraceCheckUtils]: 59: Hoare triple {3112#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3112#false} is VALID [2018-11-23 12:26:07,862 INFO L273 TraceCheckUtils]: 60: Hoare triple {3112#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3112#false} is VALID [2018-11-23 12:26:07,863 INFO L273 TraceCheckUtils]: 61: Hoare triple {3112#false} assume !(~i~0 < 100000); {3112#false} is VALID [2018-11-23 12:26:07,863 INFO L273 TraceCheckUtils]: 62: Hoare triple {3112#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3112#false} is VALID [2018-11-23 12:26:07,863 INFO L273 TraceCheckUtils]: 63: Hoare triple {3112#false} assume true; {3112#false} is VALID [2018-11-23 12:26:07,863 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {3112#false} {3112#false} #74#return; {3112#false} is VALID [2018-11-23 12:26:07,863 INFO L273 TraceCheckUtils]: 65: Hoare triple {3112#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {3112#false} is VALID [2018-11-23 12:26:07,863 INFO L273 TraceCheckUtils]: 66: Hoare triple {3112#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {3112#false} is VALID [2018-11-23 12:26:07,864 INFO L273 TraceCheckUtils]: 67: Hoare triple {3112#false} assume !false; {3112#false} is VALID [2018-11-23 12:26:07,866 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-11-23 12:26:07,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:07,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 12:26:07,888 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-11-23 12:26:07,889 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:07,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:26:08,005 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:08,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:26:08,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:26:08,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:26:08,006 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 11 states. [2018-11-23 12:26:08,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:08,234 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2018-11-23 12:26:08,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:26:08,234 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-11-23 12:26:08,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:08,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:26:08,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 68 transitions. [2018-11-23 12:26:08,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:26:08,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 68 transitions. [2018-11-23 12:26:08,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 68 transitions. [2018-11-23 12:26:08,304 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:08,305 INFO L225 Difference]: With dead ends: 76 [2018-11-23 12:26:08,305 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 12:26:08,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:26:08,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 12:26:08,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-11-23 12:26:08,333 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:08,333 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 49 states. [2018-11-23 12:26:08,333 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 49 states. [2018-11-23 12:26:08,333 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 49 states. [2018-11-23 12:26:08,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:08,335 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-11-23 12:26:08,335 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-23 12:26:08,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:08,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:08,335 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 50 states. [2018-11-23 12:26:08,335 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 50 states. [2018-11-23 12:26:08,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:08,337 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-11-23 12:26:08,337 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-23 12:26:08,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:08,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:08,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:08,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:08,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:26:08,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-11-23 12:26:08,339 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 68 [2018-11-23 12:26:08,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:08,340 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-11-23 12:26:08,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:26:08,340 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-23 12:26:08,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 12:26:08,341 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:08,341 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:26:08,341 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:08,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:08,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1594227089, now seen corresponding path program 8 times [2018-11-23 12:26:08,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:08,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:08,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:08,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:26:08,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:08,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:08,537 INFO L256 TraceCheckUtils]: 0: Hoare triple {3609#true} call ULTIMATE.init(); {3609#true} is VALID [2018-11-23 12:26:08,538 INFO L273 TraceCheckUtils]: 1: Hoare triple {3609#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3609#true} is VALID [2018-11-23 12:26:08,538 INFO L273 TraceCheckUtils]: 2: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:26:08,538 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3609#true} {3609#true} #66#return; {3609#true} is VALID [2018-11-23 12:26:08,539 INFO L256 TraceCheckUtils]: 4: Hoare triple {3609#true} call #t~ret13 := main(); {3609#true} is VALID [2018-11-23 12:26:08,539 INFO L273 TraceCheckUtils]: 5: Hoare triple {3609#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3611#(= main_~i~1 0)} is VALID [2018-11-23 12:26:08,540 INFO L273 TraceCheckUtils]: 6: Hoare triple {3611#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3611#(= main_~i~1 0)} is VALID [2018-11-23 12:26:08,541 INFO L273 TraceCheckUtils]: 7: Hoare triple {3611#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3612#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:08,541 INFO L273 TraceCheckUtils]: 8: Hoare triple {3612#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3612#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:08,542 INFO L273 TraceCheckUtils]: 9: Hoare triple {3612#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3613#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:08,543 INFO L273 TraceCheckUtils]: 10: Hoare triple {3613#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3613#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:08,544 INFO L273 TraceCheckUtils]: 11: Hoare triple {3613#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3614#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:08,545 INFO L273 TraceCheckUtils]: 12: Hoare triple {3614#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3614#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:08,545 INFO L273 TraceCheckUtils]: 13: Hoare triple {3614#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3615#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:08,546 INFO L273 TraceCheckUtils]: 14: Hoare triple {3615#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3615#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:08,547 INFO L273 TraceCheckUtils]: 15: Hoare triple {3615#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3616#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:08,547 INFO L273 TraceCheckUtils]: 16: Hoare triple {3616#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3616#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:08,548 INFO L273 TraceCheckUtils]: 17: Hoare triple {3616#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3617#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:08,548 INFO L273 TraceCheckUtils]: 18: Hoare triple {3617#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3617#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:08,549 INFO L273 TraceCheckUtils]: 19: Hoare triple {3617#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3618#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:08,550 INFO L273 TraceCheckUtils]: 20: Hoare triple {3618#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3618#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:08,551 INFO L273 TraceCheckUtils]: 21: Hoare triple {3618#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3619#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:08,551 INFO L273 TraceCheckUtils]: 22: Hoare triple {3619#(<= main_~i~1 8)} assume !(~i~1 < 100000); {3610#false} is VALID [2018-11-23 12:26:08,551 INFO L256 TraceCheckUtils]: 23: Hoare triple {3610#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {3609#true} is VALID [2018-11-23 12:26:08,552 INFO L273 TraceCheckUtils]: 24: Hoare triple {3609#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3609#true} is VALID [2018-11-23 12:26:08,552 INFO L273 TraceCheckUtils]: 25: Hoare triple {3609#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3609#true} is VALID [2018-11-23 12:26:08,552 INFO L273 TraceCheckUtils]: 26: Hoare triple {3609#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3609#true} is VALID [2018-11-23 12:26:08,552 INFO L273 TraceCheckUtils]: 27: Hoare triple {3609#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3609#true} is VALID [2018-11-23 12:26:08,553 INFO L273 TraceCheckUtils]: 28: Hoare triple {3609#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3609#true} is VALID [2018-11-23 12:26:08,553 INFO L273 TraceCheckUtils]: 29: Hoare triple {3609#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3609#true} is VALID [2018-11-23 12:26:08,553 INFO L273 TraceCheckUtils]: 30: Hoare triple {3609#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3609#true} is VALID [2018-11-23 12:26:08,553 INFO L273 TraceCheckUtils]: 31: Hoare triple {3609#true} assume !(~i~0 < 100000); {3609#true} is VALID [2018-11-23 12:26:08,553 INFO L273 TraceCheckUtils]: 32: Hoare triple {3609#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3609#true} is VALID [2018-11-23 12:26:08,554 INFO L273 TraceCheckUtils]: 33: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:26:08,554 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {3609#true} {3610#false} #70#return; {3610#false} is VALID [2018-11-23 12:26:08,554 INFO L273 TraceCheckUtils]: 35: Hoare triple {3610#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {3610#false} is VALID [2018-11-23 12:26:08,554 INFO L256 TraceCheckUtils]: 36: Hoare triple {3610#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {3609#true} is VALID [2018-11-23 12:26:08,554 INFO L273 TraceCheckUtils]: 37: Hoare triple {3609#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3609#true} is VALID [2018-11-23 12:26:08,554 INFO L273 TraceCheckUtils]: 38: Hoare triple {3609#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3609#true} is VALID [2018-11-23 12:26:08,554 INFO L273 TraceCheckUtils]: 39: Hoare triple {3609#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3609#true} is VALID [2018-11-23 12:26:08,555 INFO L273 TraceCheckUtils]: 40: Hoare triple {3609#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3609#true} is VALID [2018-11-23 12:26:08,555 INFO L273 TraceCheckUtils]: 41: Hoare triple {3609#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3609#true} is VALID [2018-11-23 12:26:08,555 INFO L273 TraceCheckUtils]: 42: Hoare triple {3609#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3609#true} is VALID [2018-11-23 12:26:08,555 INFO L273 TraceCheckUtils]: 43: Hoare triple {3609#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3609#true} is VALID [2018-11-23 12:26:08,555 INFO L273 TraceCheckUtils]: 44: Hoare triple {3609#true} assume !(~i~0 < 100000); {3609#true} is VALID [2018-11-23 12:26:08,555 INFO L273 TraceCheckUtils]: 45: Hoare triple {3609#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3609#true} is VALID [2018-11-23 12:26:08,555 INFO L273 TraceCheckUtils]: 46: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:26:08,555 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {3609#true} {3610#false} #72#return; {3610#false} is VALID [2018-11-23 12:26:08,556 INFO L273 TraceCheckUtils]: 48: Hoare triple {3610#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {3610#false} is VALID [2018-11-23 12:26:08,556 INFO L273 TraceCheckUtils]: 49: Hoare triple {3610#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {3610#false} is VALID [2018-11-23 12:26:08,556 INFO L273 TraceCheckUtils]: 50: Hoare triple {3610#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {3610#false} is VALID [2018-11-23 12:26:08,556 INFO L273 TraceCheckUtils]: 51: Hoare triple {3610#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {3610#false} is VALID [2018-11-23 12:26:08,556 INFO L273 TraceCheckUtils]: 52: Hoare triple {3610#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {3610#false} is VALID [2018-11-23 12:26:08,557 INFO L273 TraceCheckUtils]: 53: Hoare triple {3610#false} assume !(~i~2 < 99999); {3610#false} is VALID [2018-11-23 12:26:08,557 INFO L273 TraceCheckUtils]: 54: Hoare triple {3610#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {3610#false} is VALID [2018-11-23 12:26:08,557 INFO L256 TraceCheckUtils]: 55: Hoare triple {3610#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {3609#true} is VALID [2018-11-23 12:26:08,557 INFO L273 TraceCheckUtils]: 56: Hoare triple {3609#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3609#true} is VALID [2018-11-23 12:26:08,557 INFO L273 TraceCheckUtils]: 57: Hoare triple {3609#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3609#true} is VALID [2018-11-23 12:26:08,557 INFO L273 TraceCheckUtils]: 58: Hoare triple {3609#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3609#true} is VALID [2018-11-23 12:26:08,557 INFO L273 TraceCheckUtils]: 59: Hoare triple {3609#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3609#true} is VALID [2018-11-23 12:26:08,558 INFO L273 TraceCheckUtils]: 60: Hoare triple {3609#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3609#true} is VALID [2018-11-23 12:26:08,558 INFO L273 TraceCheckUtils]: 61: Hoare triple {3609#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3609#true} is VALID [2018-11-23 12:26:08,558 INFO L273 TraceCheckUtils]: 62: Hoare triple {3609#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3609#true} is VALID [2018-11-23 12:26:08,558 INFO L273 TraceCheckUtils]: 63: Hoare triple {3609#true} assume !(~i~0 < 100000); {3609#true} is VALID [2018-11-23 12:26:08,558 INFO L273 TraceCheckUtils]: 64: Hoare triple {3609#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3609#true} is VALID [2018-11-23 12:26:08,558 INFO L273 TraceCheckUtils]: 65: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:26:08,558 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {3609#true} {3610#false} #74#return; {3610#false} is VALID [2018-11-23 12:26:08,558 INFO L273 TraceCheckUtils]: 67: Hoare triple {3610#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {3610#false} is VALID [2018-11-23 12:26:08,559 INFO L273 TraceCheckUtils]: 68: Hoare triple {3610#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {3610#false} is VALID [2018-11-23 12:26:08,559 INFO L273 TraceCheckUtils]: 69: Hoare triple {3610#false} assume !false; {3610#false} is VALID [2018-11-23 12:26:08,561 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-11-23 12:26:08,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:08,561 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:08,571 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:26:08,630 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:26:08,630 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:08,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:08,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:08,787 INFO L256 TraceCheckUtils]: 0: Hoare triple {3609#true} call ULTIMATE.init(); {3609#true} is VALID [2018-11-23 12:26:08,787 INFO L273 TraceCheckUtils]: 1: Hoare triple {3609#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3609#true} is VALID [2018-11-23 12:26:08,787 INFO L273 TraceCheckUtils]: 2: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:26:08,787 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3609#true} {3609#true} #66#return; {3609#true} is VALID [2018-11-23 12:26:08,788 INFO L256 TraceCheckUtils]: 4: Hoare triple {3609#true} call #t~ret13 := main(); {3609#true} is VALID [2018-11-23 12:26:08,788 INFO L273 TraceCheckUtils]: 5: Hoare triple {3609#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3638#(<= main_~i~1 0)} is VALID [2018-11-23 12:26:08,789 INFO L273 TraceCheckUtils]: 6: Hoare triple {3638#(<= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3638#(<= main_~i~1 0)} is VALID [2018-11-23 12:26:08,789 INFO L273 TraceCheckUtils]: 7: Hoare triple {3638#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3612#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:08,789 INFO L273 TraceCheckUtils]: 8: Hoare triple {3612#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3612#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:08,790 INFO L273 TraceCheckUtils]: 9: Hoare triple {3612#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3613#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:08,790 INFO L273 TraceCheckUtils]: 10: Hoare triple {3613#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3613#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:08,791 INFO L273 TraceCheckUtils]: 11: Hoare triple {3613#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3614#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:08,791 INFO L273 TraceCheckUtils]: 12: Hoare triple {3614#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3614#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:08,792 INFO L273 TraceCheckUtils]: 13: Hoare triple {3614#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3615#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:08,792 INFO L273 TraceCheckUtils]: 14: Hoare triple {3615#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3615#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:08,793 INFO L273 TraceCheckUtils]: 15: Hoare triple {3615#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3616#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:08,793 INFO L273 TraceCheckUtils]: 16: Hoare triple {3616#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3616#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:08,794 INFO L273 TraceCheckUtils]: 17: Hoare triple {3616#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3617#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:08,795 INFO L273 TraceCheckUtils]: 18: Hoare triple {3617#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3617#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:08,796 INFO L273 TraceCheckUtils]: 19: Hoare triple {3617#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3618#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:08,796 INFO L273 TraceCheckUtils]: 20: Hoare triple {3618#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {3618#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:08,797 INFO L273 TraceCheckUtils]: 21: Hoare triple {3618#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {3619#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:08,798 INFO L273 TraceCheckUtils]: 22: Hoare triple {3619#(<= main_~i~1 8)} assume !(~i~1 < 100000); {3610#false} is VALID [2018-11-23 12:26:08,798 INFO L256 TraceCheckUtils]: 23: Hoare triple {3610#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {3610#false} is VALID [2018-11-23 12:26:08,798 INFO L273 TraceCheckUtils]: 24: Hoare triple {3610#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3610#false} is VALID [2018-11-23 12:26:08,798 INFO L273 TraceCheckUtils]: 25: Hoare triple {3610#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3610#false} is VALID [2018-11-23 12:26:08,798 INFO L273 TraceCheckUtils]: 26: Hoare triple {3610#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3610#false} is VALID [2018-11-23 12:26:08,799 INFO L273 TraceCheckUtils]: 27: Hoare triple {3610#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3610#false} is VALID [2018-11-23 12:26:08,799 INFO L273 TraceCheckUtils]: 28: Hoare triple {3610#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3610#false} is VALID [2018-11-23 12:26:08,799 INFO L273 TraceCheckUtils]: 29: Hoare triple {3610#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3610#false} is VALID [2018-11-23 12:26:08,799 INFO L273 TraceCheckUtils]: 30: Hoare triple {3610#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3610#false} is VALID [2018-11-23 12:26:08,799 INFO L273 TraceCheckUtils]: 31: Hoare triple {3610#false} assume !(~i~0 < 100000); {3610#false} is VALID [2018-11-23 12:26:08,800 INFO L273 TraceCheckUtils]: 32: Hoare triple {3610#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3610#false} is VALID [2018-11-23 12:26:08,800 INFO L273 TraceCheckUtils]: 33: Hoare triple {3610#false} assume true; {3610#false} is VALID [2018-11-23 12:26:08,800 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {3610#false} {3610#false} #70#return; {3610#false} is VALID [2018-11-23 12:26:08,800 INFO L273 TraceCheckUtils]: 35: Hoare triple {3610#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {3610#false} is VALID [2018-11-23 12:26:08,800 INFO L256 TraceCheckUtils]: 36: Hoare triple {3610#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {3610#false} is VALID [2018-11-23 12:26:08,801 INFO L273 TraceCheckUtils]: 37: Hoare triple {3610#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3610#false} is VALID [2018-11-23 12:26:08,801 INFO L273 TraceCheckUtils]: 38: Hoare triple {3610#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3610#false} is VALID [2018-11-23 12:26:08,801 INFO L273 TraceCheckUtils]: 39: Hoare triple {3610#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3610#false} is VALID [2018-11-23 12:26:08,801 INFO L273 TraceCheckUtils]: 40: Hoare triple {3610#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3610#false} is VALID [2018-11-23 12:26:08,801 INFO L273 TraceCheckUtils]: 41: Hoare triple {3610#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3610#false} is VALID [2018-11-23 12:26:08,801 INFO L273 TraceCheckUtils]: 42: Hoare triple {3610#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3610#false} is VALID [2018-11-23 12:26:08,801 INFO L273 TraceCheckUtils]: 43: Hoare triple {3610#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3610#false} is VALID [2018-11-23 12:26:08,801 INFO L273 TraceCheckUtils]: 44: Hoare triple {3610#false} assume !(~i~0 < 100000); {3610#false} is VALID [2018-11-23 12:26:08,802 INFO L273 TraceCheckUtils]: 45: Hoare triple {3610#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3610#false} is VALID [2018-11-23 12:26:08,802 INFO L273 TraceCheckUtils]: 46: Hoare triple {3610#false} assume true; {3610#false} is VALID [2018-11-23 12:26:08,802 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {3610#false} {3610#false} #72#return; {3610#false} is VALID [2018-11-23 12:26:08,802 INFO L273 TraceCheckUtils]: 48: Hoare triple {3610#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {3610#false} is VALID [2018-11-23 12:26:08,802 INFO L273 TraceCheckUtils]: 49: Hoare triple {3610#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {3610#false} is VALID [2018-11-23 12:26:08,802 INFO L273 TraceCheckUtils]: 50: Hoare triple {3610#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {3610#false} is VALID [2018-11-23 12:26:08,802 INFO L273 TraceCheckUtils]: 51: Hoare triple {3610#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {3610#false} is VALID [2018-11-23 12:26:08,802 INFO L273 TraceCheckUtils]: 52: Hoare triple {3610#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {3610#false} is VALID [2018-11-23 12:26:08,802 INFO L273 TraceCheckUtils]: 53: Hoare triple {3610#false} assume !(~i~2 < 99999); {3610#false} is VALID [2018-11-23 12:26:08,803 INFO L273 TraceCheckUtils]: 54: Hoare triple {3610#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {3610#false} is VALID [2018-11-23 12:26:08,803 INFO L256 TraceCheckUtils]: 55: Hoare triple {3610#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {3610#false} is VALID [2018-11-23 12:26:08,803 INFO L273 TraceCheckUtils]: 56: Hoare triple {3610#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3610#false} is VALID [2018-11-23 12:26:08,803 INFO L273 TraceCheckUtils]: 57: Hoare triple {3610#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3610#false} is VALID [2018-11-23 12:26:08,803 INFO L273 TraceCheckUtils]: 58: Hoare triple {3610#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3610#false} is VALID [2018-11-23 12:26:08,803 INFO L273 TraceCheckUtils]: 59: Hoare triple {3610#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3610#false} is VALID [2018-11-23 12:26:08,803 INFO L273 TraceCheckUtils]: 60: Hoare triple {3610#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3610#false} is VALID [2018-11-23 12:26:08,803 INFO L273 TraceCheckUtils]: 61: Hoare triple {3610#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {3610#false} is VALID [2018-11-23 12:26:08,804 INFO L273 TraceCheckUtils]: 62: Hoare triple {3610#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3610#false} is VALID [2018-11-23 12:26:08,804 INFO L273 TraceCheckUtils]: 63: Hoare triple {3610#false} assume !(~i~0 < 100000); {3610#false} is VALID [2018-11-23 12:26:08,804 INFO L273 TraceCheckUtils]: 64: Hoare triple {3610#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3610#false} is VALID [2018-11-23 12:26:08,804 INFO L273 TraceCheckUtils]: 65: Hoare triple {3610#false} assume true; {3610#false} is VALID [2018-11-23 12:26:08,804 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {3610#false} {3610#false} #74#return; {3610#false} is VALID [2018-11-23 12:26:08,804 INFO L273 TraceCheckUtils]: 67: Hoare triple {3610#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {3610#false} is VALID [2018-11-23 12:26:08,804 INFO L273 TraceCheckUtils]: 68: Hoare triple {3610#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {3610#false} is VALID [2018-11-23 12:26:08,804 INFO L273 TraceCheckUtils]: 69: Hoare triple {3610#false} assume !false; {3610#false} is VALID [2018-11-23 12:26:08,807 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-11-23 12:26:08,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:08,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 12:26:08,827 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-11-23 12:26:08,827 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:08,827 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:26:08,882 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:08,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:26:08,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:26:08,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:26:08,884 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 12 states. [2018-11-23 12:26:09,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:09,064 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2018-11-23 12:26:09,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:26:09,064 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-11-23 12:26:09,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:09,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:26:09,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2018-11-23 12:26:09,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:26:09,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2018-11-23 12:26:09,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 70 transitions. [2018-11-23 12:26:09,129 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:09,130 INFO L225 Difference]: With dead ends: 78 [2018-11-23 12:26:09,131 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 12:26:09,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 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-23 12:26:09,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 12:26:09,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-11-23 12:26:09,153 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:09,153 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 51 states. [2018-11-23 12:26:09,153 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 51 states. [2018-11-23 12:26:09,153 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 51 states. [2018-11-23 12:26:09,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:09,156 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-11-23 12:26:09,156 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-23 12:26:09,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:09,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:09,157 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 52 states. [2018-11-23 12:26:09,157 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 52 states. [2018-11-23 12:26:09,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:09,159 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-11-23 12:26:09,159 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-23 12:26:09,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:09,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:09,160 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:09,160 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:09,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:26:09,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-11-23 12:26:09,162 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 70 [2018-11-23 12:26:09,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:09,162 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-11-23 12:26:09,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:26:09,162 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-23 12:26:09,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-23 12:26:09,163 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:09,164 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:26:09,164 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:09,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:09,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1351728243, now seen corresponding path program 9 times [2018-11-23 12:26:09,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:09,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:09,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:09,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:09,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:09,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:09,401 INFO L256 TraceCheckUtils]: 0: Hoare triple {4124#true} call ULTIMATE.init(); {4124#true} is VALID [2018-11-23 12:26:09,402 INFO L273 TraceCheckUtils]: 1: Hoare triple {4124#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4124#true} is VALID [2018-11-23 12:26:09,402 INFO L273 TraceCheckUtils]: 2: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:26:09,402 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4124#true} {4124#true} #66#return; {4124#true} is VALID [2018-11-23 12:26:09,402 INFO L256 TraceCheckUtils]: 4: Hoare triple {4124#true} call #t~ret13 := main(); {4124#true} is VALID [2018-11-23 12:26:09,403 INFO L273 TraceCheckUtils]: 5: Hoare triple {4124#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {4126#(= main_~i~1 0)} is VALID [2018-11-23 12:26:09,404 INFO L273 TraceCheckUtils]: 6: Hoare triple {4126#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4126#(= main_~i~1 0)} is VALID [2018-11-23 12:26:09,404 INFO L273 TraceCheckUtils]: 7: Hoare triple {4126#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4127#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:09,404 INFO L273 TraceCheckUtils]: 8: Hoare triple {4127#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4127#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:09,405 INFO L273 TraceCheckUtils]: 9: Hoare triple {4127#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4128#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:09,405 INFO L273 TraceCheckUtils]: 10: Hoare triple {4128#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4128#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:09,406 INFO L273 TraceCheckUtils]: 11: Hoare triple {4128#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4129#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:09,406 INFO L273 TraceCheckUtils]: 12: Hoare triple {4129#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4129#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:09,407 INFO L273 TraceCheckUtils]: 13: Hoare triple {4129#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4130#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:09,407 INFO L273 TraceCheckUtils]: 14: Hoare triple {4130#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4130#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:09,408 INFO L273 TraceCheckUtils]: 15: Hoare triple {4130#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4131#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:09,409 INFO L273 TraceCheckUtils]: 16: Hoare triple {4131#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4131#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:09,409 INFO L273 TraceCheckUtils]: 17: Hoare triple {4131#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4132#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:09,410 INFO L273 TraceCheckUtils]: 18: Hoare triple {4132#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4132#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:09,410 INFO L273 TraceCheckUtils]: 19: Hoare triple {4132#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4133#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:09,411 INFO L273 TraceCheckUtils]: 20: Hoare triple {4133#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4133#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:09,412 INFO L273 TraceCheckUtils]: 21: Hoare triple {4133#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4134#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:09,412 INFO L273 TraceCheckUtils]: 22: Hoare triple {4134#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4134#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:09,413 INFO L273 TraceCheckUtils]: 23: Hoare triple {4134#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4135#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:09,414 INFO L273 TraceCheckUtils]: 24: Hoare triple {4135#(<= main_~i~1 9)} assume !(~i~1 < 100000); {4125#false} is VALID [2018-11-23 12:26:09,414 INFO L256 TraceCheckUtils]: 25: Hoare triple {4125#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {4124#true} is VALID [2018-11-23 12:26:09,414 INFO L273 TraceCheckUtils]: 26: Hoare triple {4124#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4124#true} is VALID [2018-11-23 12:26:09,414 INFO L273 TraceCheckUtils]: 27: Hoare triple {4124#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:26:09,415 INFO L273 TraceCheckUtils]: 28: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:26:09,415 INFO L273 TraceCheckUtils]: 29: Hoare triple {4124#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:26:09,415 INFO L273 TraceCheckUtils]: 30: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:26:09,415 INFO L273 TraceCheckUtils]: 31: Hoare triple {4124#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:26:09,416 INFO L273 TraceCheckUtils]: 32: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:26:09,416 INFO L273 TraceCheckUtils]: 33: Hoare triple {4124#true} assume !(~i~0 < 100000); {4124#true} is VALID [2018-11-23 12:26:09,416 INFO L273 TraceCheckUtils]: 34: Hoare triple {4124#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4124#true} is VALID [2018-11-23 12:26:09,416 INFO L273 TraceCheckUtils]: 35: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:26:09,416 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {4124#true} {4125#false} #70#return; {4125#false} is VALID [2018-11-23 12:26:09,417 INFO L273 TraceCheckUtils]: 37: Hoare triple {4125#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {4125#false} is VALID [2018-11-23 12:26:09,417 INFO L256 TraceCheckUtils]: 38: Hoare triple {4125#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {4124#true} is VALID [2018-11-23 12:26:09,417 INFO L273 TraceCheckUtils]: 39: Hoare triple {4124#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4124#true} is VALID [2018-11-23 12:26:09,417 INFO L273 TraceCheckUtils]: 40: Hoare triple {4124#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:26:09,417 INFO L273 TraceCheckUtils]: 41: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:26:09,418 INFO L273 TraceCheckUtils]: 42: Hoare triple {4124#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:26:09,418 INFO L273 TraceCheckUtils]: 43: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:26:09,418 INFO L273 TraceCheckUtils]: 44: Hoare triple {4124#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:26:09,418 INFO L273 TraceCheckUtils]: 45: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:26:09,418 INFO L273 TraceCheckUtils]: 46: Hoare triple {4124#true} assume !(~i~0 < 100000); {4124#true} is VALID [2018-11-23 12:26:09,418 INFO L273 TraceCheckUtils]: 47: Hoare triple {4124#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4124#true} is VALID [2018-11-23 12:26:09,418 INFO L273 TraceCheckUtils]: 48: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:26:09,418 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {4124#true} {4125#false} #72#return; {4125#false} is VALID [2018-11-23 12:26:09,418 INFO L273 TraceCheckUtils]: 50: Hoare triple {4125#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {4125#false} is VALID [2018-11-23 12:26:09,419 INFO L273 TraceCheckUtils]: 51: Hoare triple {4125#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {4125#false} is VALID [2018-11-23 12:26:09,419 INFO L273 TraceCheckUtils]: 52: Hoare triple {4125#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {4125#false} is VALID [2018-11-23 12:26:09,419 INFO L273 TraceCheckUtils]: 53: Hoare triple {4125#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {4125#false} is VALID [2018-11-23 12:26:09,419 INFO L273 TraceCheckUtils]: 54: Hoare triple {4125#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {4125#false} is VALID [2018-11-23 12:26:09,419 INFO L273 TraceCheckUtils]: 55: Hoare triple {4125#false} assume !(~i~2 < 99999); {4125#false} is VALID [2018-11-23 12:26:09,419 INFO L273 TraceCheckUtils]: 56: Hoare triple {4125#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {4125#false} is VALID [2018-11-23 12:26:09,419 INFO L256 TraceCheckUtils]: 57: Hoare triple {4125#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {4124#true} is VALID [2018-11-23 12:26:09,419 INFO L273 TraceCheckUtils]: 58: Hoare triple {4124#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4124#true} is VALID [2018-11-23 12:26:09,420 INFO L273 TraceCheckUtils]: 59: Hoare triple {4124#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:26:09,420 INFO L273 TraceCheckUtils]: 60: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:26:09,420 INFO L273 TraceCheckUtils]: 61: Hoare triple {4124#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:26:09,420 INFO L273 TraceCheckUtils]: 62: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:26:09,420 INFO L273 TraceCheckUtils]: 63: Hoare triple {4124#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:26:09,420 INFO L273 TraceCheckUtils]: 64: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:26:09,420 INFO L273 TraceCheckUtils]: 65: Hoare triple {4124#true} assume !(~i~0 < 100000); {4124#true} is VALID [2018-11-23 12:26:09,420 INFO L273 TraceCheckUtils]: 66: Hoare triple {4124#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4124#true} is VALID [2018-11-23 12:26:09,421 INFO L273 TraceCheckUtils]: 67: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:26:09,421 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {4124#true} {4125#false} #74#return; {4125#false} is VALID [2018-11-23 12:26:09,421 INFO L273 TraceCheckUtils]: 69: Hoare triple {4125#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {4125#false} is VALID [2018-11-23 12:26:09,421 INFO L273 TraceCheckUtils]: 70: Hoare triple {4125#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {4125#false} is VALID [2018-11-23 12:26:09,421 INFO L273 TraceCheckUtils]: 71: Hoare triple {4125#false} assume !false; {4125#false} is VALID [2018-11-23 12:26:09,423 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-11-23 12:26:09,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:09,424 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:09,434 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:26:09,461 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 12:26:09,461 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:09,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:09,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:09,612 INFO L256 TraceCheckUtils]: 0: Hoare triple {4124#true} call ULTIMATE.init(); {4124#true} is VALID [2018-11-23 12:26:09,612 INFO L273 TraceCheckUtils]: 1: Hoare triple {4124#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4124#true} is VALID [2018-11-23 12:26:09,613 INFO L273 TraceCheckUtils]: 2: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:26:09,613 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4124#true} {4124#true} #66#return; {4124#true} is VALID [2018-11-23 12:26:09,613 INFO L256 TraceCheckUtils]: 4: Hoare triple {4124#true} call #t~ret13 := main(); {4124#true} is VALID [2018-11-23 12:26:09,614 INFO L273 TraceCheckUtils]: 5: Hoare triple {4124#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {4124#true} is VALID [2018-11-23 12:26:09,614 INFO L273 TraceCheckUtils]: 6: Hoare triple {4124#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4124#true} is VALID [2018-11-23 12:26:09,614 INFO L273 TraceCheckUtils]: 7: Hoare triple {4124#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4124#true} is VALID [2018-11-23 12:26:09,614 INFO L273 TraceCheckUtils]: 8: Hoare triple {4124#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4124#true} is VALID [2018-11-23 12:26:09,615 INFO L273 TraceCheckUtils]: 9: Hoare triple {4124#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4124#true} is VALID [2018-11-23 12:26:09,615 INFO L273 TraceCheckUtils]: 10: Hoare triple {4124#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4124#true} is VALID [2018-11-23 12:26:09,615 INFO L273 TraceCheckUtils]: 11: Hoare triple {4124#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4124#true} is VALID [2018-11-23 12:26:09,615 INFO L273 TraceCheckUtils]: 12: Hoare triple {4124#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4124#true} is VALID [2018-11-23 12:26:09,615 INFO L273 TraceCheckUtils]: 13: Hoare triple {4124#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4124#true} is VALID [2018-11-23 12:26:09,615 INFO L273 TraceCheckUtils]: 14: Hoare triple {4124#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4124#true} is VALID [2018-11-23 12:26:09,616 INFO L273 TraceCheckUtils]: 15: Hoare triple {4124#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4124#true} is VALID [2018-11-23 12:26:09,616 INFO L273 TraceCheckUtils]: 16: Hoare triple {4124#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4124#true} is VALID [2018-11-23 12:26:09,616 INFO L273 TraceCheckUtils]: 17: Hoare triple {4124#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4124#true} is VALID [2018-11-23 12:26:09,616 INFO L273 TraceCheckUtils]: 18: Hoare triple {4124#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4124#true} is VALID [2018-11-23 12:26:09,616 INFO L273 TraceCheckUtils]: 19: Hoare triple {4124#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4124#true} is VALID [2018-11-23 12:26:09,616 INFO L273 TraceCheckUtils]: 20: Hoare triple {4124#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4124#true} is VALID [2018-11-23 12:26:09,617 INFO L273 TraceCheckUtils]: 21: Hoare triple {4124#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4124#true} is VALID [2018-11-23 12:26:09,617 INFO L273 TraceCheckUtils]: 22: Hoare triple {4124#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4124#true} is VALID [2018-11-23 12:26:09,617 INFO L273 TraceCheckUtils]: 23: Hoare triple {4124#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4124#true} is VALID [2018-11-23 12:26:09,617 INFO L273 TraceCheckUtils]: 24: Hoare triple {4124#true} assume !(~i~1 < 100000); {4124#true} is VALID [2018-11-23 12:26:09,617 INFO L256 TraceCheckUtils]: 25: Hoare triple {4124#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {4124#true} is VALID [2018-11-23 12:26:09,617 INFO L273 TraceCheckUtils]: 26: Hoare triple {4124#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4124#true} is VALID [2018-11-23 12:26:09,617 INFO L273 TraceCheckUtils]: 27: Hoare triple {4124#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:26:09,618 INFO L273 TraceCheckUtils]: 28: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:26:09,618 INFO L273 TraceCheckUtils]: 29: Hoare triple {4124#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:26:09,618 INFO L273 TraceCheckUtils]: 30: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:26:09,618 INFO L273 TraceCheckUtils]: 31: Hoare triple {4124#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:26:09,618 INFO L273 TraceCheckUtils]: 32: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:26:09,618 INFO L273 TraceCheckUtils]: 33: Hoare triple {4124#true} assume !(~i~0 < 100000); {4124#true} is VALID [2018-11-23 12:26:09,619 INFO L273 TraceCheckUtils]: 34: Hoare triple {4124#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4124#true} is VALID [2018-11-23 12:26:09,619 INFO L273 TraceCheckUtils]: 35: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:26:09,619 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {4124#true} {4124#true} #70#return; {4124#true} is VALID [2018-11-23 12:26:09,619 INFO L273 TraceCheckUtils]: 37: Hoare triple {4124#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {4124#true} is VALID [2018-11-23 12:26:09,619 INFO L256 TraceCheckUtils]: 38: Hoare triple {4124#true} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {4124#true} is VALID [2018-11-23 12:26:09,619 INFO L273 TraceCheckUtils]: 39: Hoare triple {4124#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4124#true} is VALID [2018-11-23 12:26:09,619 INFO L273 TraceCheckUtils]: 40: Hoare triple {4124#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:26:09,620 INFO L273 TraceCheckUtils]: 41: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:26:09,620 INFO L273 TraceCheckUtils]: 42: Hoare triple {4124#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:26:09,620 INFO L273 TraceCheckUtils]: 43: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:26:09,620 INFO L273 TraceCheckUtils]: 44: Hoare triple {4124#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:26:09,620 INFO L273 TraceCheckUtils]: 45: Hoare triple {4124#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4124#true} is VALID [2018-11-23 12:26:09,620 INFO L273 TraceCheckUtils]: 46: Hoare triple {4124#true} assume !(~i~0 < 100000); {4124#true} is VALID [2018-11-23 12:26:09,621 INFO L273 TraceCheckUtils]: 47: Hoare triple {4124#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4124#true} is VALID [2018-11-23 12:26:09,621 INFO L273 TraceCheckUtils]: 48: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:26:09,621 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {4124#true} {4124#true} #72#return; {4124#true} is VALID [2018-11-23 12:26:09,622 INFO L273 TraceCheckUtils]: 50: Hoare triple {4124#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {4289#(<= main_~i~2 0)} is VALID [2018-11-23 12:26:09,622 INFO L273 TraceCheckUtils]: 51: Hoare triple {4289#(<= main_~i~2 0)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {4289#(<= main_~i~2 0)} is VALID [2018-11-23 12:26:09,622 INFO L273 TraceCheckUtils]: 52: Hoare triple {4289#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {4296#(<= main_~i~2 1)} is VALID [2018-11-23 12:26:09,623 INFO L273 TraceCheckUtils]: 53: Hoare triple {4296#(<= main_~i~2 1)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {4296#(<= main_~i~2 1)} is VALID [2018-11-23 12:26:09,623 INFO L273 TraceCheckUtils]: 54: Hoare triple {4296#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {4303#(<= main_~i~2 2)} is VALID [2018-11-23 12:26:09,624 INFO L273 TraceCheckUtils]: 55: Hoare triple {4303#(<= main_~i~2 2)} assume !(~i~2 < 99999); {4125#false} is VALID [2018-11-23 12:26:09,624 INFO L273 TraceCheckUtils]: 56: Hoare triple {4125#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {4125#false} is VALID [2018-11-23 12:26:09,624 INFO L256 TraceCheckUtils]: 57: Hoare triple {4125#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {4125#false} is VALID [2018-11-23 12:26:09,624 INFO L273 TraceCheckUtils]: 58: Hoare triple {4125#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4125#false} is VALID [2018-11-23 12:26:09,624 INFO L273 TraceCheckUtils]: 59: Hoare triple {4125#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4125#false} is VALID [2018-11-23 12:26:09,625 INFO L273 TraceCheckUtils]: 60: Hoare triple {4125#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4125#false} is VALID [2018-11-23 12:26:09,625 INFO L273 TraceCheckUtils]: 61: Hoare triple {4125#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4125#false} is VALID [2018-11-23 12:26:09,625 INFO L273 TraceCheckUtils]: 62: Hoare triple {4125#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4125#false} is VALID [2018-11-23 12:26:09,625 INFO L273 TraceCheckUtils]: 63: Hoare triple {4125#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4125#false} is VALID [2018-11-23 12:26:09,625 INFO L273 TraceCheckUtils]: 64: Hoare triple {4125#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4125#false} is VALID [2018-11-23 12:26:09,625 INFO L273 TraceCheckUtils]: 65: Hoare triple {4125#false} assume !(~i~0 < 100000); {4125#false} is VALID [2018-11-23 12:26:09,626 INFO L273 TraceCheckUtils]: 66: Hoare triple {4125#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4125#false} is VALID [2018-11-23 12:26:09,626 INFO L273 TraceCheckUtils]: 67: Hoare triple {4125#false} assume true; {4125#false} is VALID [2018-11-23 12:26:09,626 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {4125#false} {4125#false} #74#return; {4125#false} is VALID [2018-11-23 12:26:09,626 INFO L273 TraceCheckUtils]: 69: Hoare triple {4125#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {4125#false} is VALID [2018-11-23 12:26:09,626 INFO L273 TraceCheckUtils]: 70: Hoare triple {4125#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {4125#false} is VALID [2018-11-23 12:26:09,626 INFO L273 TraceCheckUtils]: 71: Hoare triple {4125#false} assume !false; {4125#false} is VALID [2018-11-23 12:26:09,631 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 58 proven. 4 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2018-11-23 12:26:09,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:09,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2018-11-23 12:26:09,651 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2018-11-23 12:26:09,651 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:09,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 12:26:09,739 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:09,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 12:26:09,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 12:26:09,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:26:09,740 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 15 states. [2018-11-23 12:26:10,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:10,212 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2018-11-23 12:26:10,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 12:26:10,213 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2018-11-23 12:26:10,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:10,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:26:10,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 79 transitions. [2018-11-23 12:26:10,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:26:10,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 79 transitions. [2018-11-23 12:26:10,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 79 transitions. [2018-11-23 12:26:10,297 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:10,299 INFO L225 Difference]: With dead ends: 83 [2018-11-23 12:26:10,299 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 12:26:10,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:26:10,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 12:26:10,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-11-23 12:26:10,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:10,331 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 55 states. [2018-11-23 12:26:10,331 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 55 states. [2018-11-23 12:26:10,331 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 55 states. [2018-11-23 12:26:10,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:10,334 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-11-23 12:26:10,334 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-11-23 12:26:10,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:10,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:10,335 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 57 states. [2018-11-23 12:26:10,335 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 57 states. [2018-11-23 12:26:10,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:10,336 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-11-23 12:26:10,336 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-11-23 12:26:10,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:10,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:10,337 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:10,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:10,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 12:26:10,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-11-23 12:26:10,339 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 72 [2018-11-23 12:26:10,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:10,339 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-11-23 12:26:10,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 12:26:10,339 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-11-23 12:26:10,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 12:26:10,340 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:10,340 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:26:10,341 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:10,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:10,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1743973331, now seen corresponding path program 10 times [2018-11-23 12:26:10,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:10,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:10,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:10,342 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:10,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:10,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:10,701 INFO L256 TraceCheckUtils]: 0: Hoare triple {4671#true} call ULTIMATE.init(); {4671#true} is VALID [2018-11-23 12:26:10,701 INFO L273 TraceCheckUtils]: 1: Hoare triple {4671#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4671#true} is VALID [2018-11-23 12:26:10,701 INFO L273 TraceCheckUtils]: 2: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:26:10,702 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4671#true} {4671#true} #66#return; {4671#true} is VALID [2018-11-23 12:26:10,702 INFO L256 TraceCheckUtils]: 4: Hoare triple {4671#true} call #t~ret13 := main(); {4671#true} is VALID [2018-11-23 12:26:10,702 INFO L273 TraceCheckUtils]: 5: Hoare triple {4671#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {4673#(= main_~i~1 0)} is VALID [2018-11-23 12:26:10,703 INFO L273 TraceCheckUtils]: 6: Hoare triple {4673#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4673#(= main_~i~1 0)} is VALID [2018-11-23 12:26:10,722 INFO L273 TraceCheckUtils]: 7: Hoare triple {4673#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4674#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:10,736 INFO L273 TraceCheckUtils]: 8: Hoare triple {4674#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4674#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:10,745 INFO L273 TraceCheckUtils]: 9: Hoare triple {4674#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4675#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:10,745 INFO L273 TraceCheckUtils]: 10: Hoare triple {4675#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4675#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:10,746 INFO L273 TraceCheckUtils]: 11: Hoare triple {4675#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4676#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:10,746 INFO L273 TraceCheckUtils]: 12: Hoare triple {4676#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4676#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:10,747 INFO L273 TraceCheckUtils]: 13: Hoare triple {4676#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4677#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:10,747 INFO L273 TraceCheckUtils]: 14: Hoare triple {4677#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4677#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:10,747 INFO L273 TraceCheckUtils]: 15: Hoare triple {4677#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4678#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:10,748 INFO L273 TraceCheckUtils]: 16: Hoare triple {4678#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4678#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:10,748 INFO L273 TraceCheckUtils]: 17: Hoare triple {4678#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4679#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:10,748 INFO L273 TraceCheckUtils]: 18: Hoare triple {4679#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4679#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:10,749 INFO L273 TraceCheckUtils]: 19: Hoare triple {4679#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4680#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:10,749 INFO L273 TraceCheckUtils]: 20: Hoare triple {4680#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4680#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:10,750 INFO L273 TraceCheckUtils]: 21: Hoare triple {4680#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4681#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:10,751 INFO L273 TraceCheckUtils]: 22: Hoare triple {4681#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4681#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:10,751 INFO L273 TraceCheckUtils]: 23: Hoare triple {4681#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4682#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:10,752 INFO L273 TraceCheckUtils]: 24: Hoare triple {4682#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4682#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:10,753 INFO L273 TraceCheckUtils]: 25: Hoare triple {4682#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4683#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:10,753 INFO L273 TraceCheckUtils]: 26: Hoare triple {4683#(<= main_~i~1 10)} assume !(~i~1 < 100000); {4672#false} is VALID [2018-11-23 12:26:10,754 INFO L256 TraceCheckUtils]: 27: Hoare triple {4672#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {4671#true} is VALID [2018-11-23 12:26:10,754 INFO L273 TraceCheckUtils]: 28: Hoare triple {4671#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4671#true} is VALID [2018-11-23 12:26:10,754 INFO L273 TraceCheckUtils]: 29: Hoare triple {4671#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:26:10,754 INFO L273 TraceCheckUtils]: 30: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:26:10,754 INFO L273 TraceCheckUtils]: 31: Hoare triple {4671#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:26:10,755 INFO L273 TraceCheckUtils]: 32: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:26:10,755 INFO L273 TraceCheckUtils]: 33: Hoare triple {4671#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:26:10,755 INFO L273 TraceCheckUtils]: 34: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:26:10,755 INFO L273 TraceCheckUtils]: 35: Hoare triple {4671#true} assume !(~i~0 < 100000); {4671#true} is VALID [2018-11-23 12:26:10,755 INFO L273 TraceCheckUtils]: 36: Hoare triple {4671#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4671#true} is VALID [2018-11-23 12:26:10,756 INFO L273 TraceCheckUtils]: 37: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:26:10,756 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {4671#true} {4672#false} #70#return; {4672#false} is VALID [2018-11-23 12:26:10,756 INFO L273 TraceCheckUtils]: 39: Hoare triple {4672#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {4672#false} is VALID [2018-11-23 12:26:10,756 INFO L256 TraceCheckUtils]: 40: Hoare triple {4672#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {4671#true} is VALID [2018-11-23 12:26:10,756 INFO L273 TraceCheckUtils]: 41: Hoare triple {4671#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4671#true} is VALID [2018-11-23 12:26:10,757 INFO L273 TraceCheckUtils]: 42: Hoare triple {4671#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:26:10,757 INFO L273 TraceCheckUtils]: 43: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:26:10,757 INFO L273 TraceCheckUtils]: 44: Hoare triple {4671#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:26:10,757 INFO L273 TraceCheckUtils]: 45: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:26:10,757 INFO L273 TraceCheckUtils]: 46: Hoare triple {4671#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:26:10,757 INFO L273 TraceCheckUtils]: 47: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:26:10,757 INFO L273 TraceCheckUtils]: 48: Hoare triple {4671#true} assume !(~i~0 < 100000); {4671#true} is VALID [2018-11-23 12:26:10,758 INFO L273 TraceCheckUtils]: 49: Hoare triple {4671#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4671#true} is VALID [2018-11-23 12:26:10,758 INFO L273 TraceCheckUtils]: 50: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:26:10,758 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {4671#true} {4672#false} #72#return; {4672#false} is VALID [2018-11-23 12:26:10,758 INFO L273 TraceCheckUtils]: 52: Hoare triple {4672#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {4672#false} is VALID [2018-11-23 12:26:10,758 INFO L273 TraceCheckUtils]: 53: Hoare triple {4672#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {4672#false} is VALID [2018-11-23 12:26:10,758 INFO L273 TraceCheckUtils]: 54: Hoare triple {4672#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {4672#false} is VALID [2018-11-23 12:26:10,758 INFO L273 TraceCheckUtils]: 55: Hoare triple {4672#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {4672#false} is VALID [2018-11-23 12:26:10,758 INFO L273 TraceCheckUtils]: 56: Hoare triple {4672#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {4672#false} is VALID [2018-11-23 12:26:10,759 INFO L273 TraceCheckUtils]: 57: Hoare triple {4672#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {4672#false} is VALID [2018-11-23 12:26:10,759 INFO L273 TraceCheckUtils]: 58: Hoare triple {4672#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {4672#false} is VALID [2018-11-23 12:26:10,759 INFO L273 TraceCheckUtils]: 59: Hoare triple {4672#false} assume !(~i~2 < 99999); {4672#false} is VALID [2018-11-23 12:26:10,759 INFO L273 TraceCheckUtils]: 60: Hoare triple {4672#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {4672#false} is VALID [2018-11-23 12:26:10,759 INFO L256 TraceCheckUtils]: 61: Hoare triple {4672#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {4671#true} is VALID [2018-11-23 12:26:10,759 INFO L273 TraceCheckUtils]: 62: Hoare triple {4671#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4671#true} is VALID [2018-11-23 12:26:10,759 INFO L273 TraceCheckUtils]: 63: Hoare triple {4671#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:26:10,759 INFO L273 TraceCheckUtils]: 64: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:26:10,759 INFO L273 TraceCheckUtils]: 65: Hoare triple {4671#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:26:10,760 INFO L273 TraceCheckUtils]: 66: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:26:10,760 INFO L273 TraceCheckUtils]: 67: Hoare triple {4671#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:26:10,760 INFO L273 TraceCheckUtils]: 68: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:26:10,760 INFO L273 TraceCheckUtils]: 69: Hoare triple {4671#true} assume !(~i~0 < 100000); {4671#true} is VALID [2018-11-23 12:26:10,760 INFO L273 TraceCheckUtils]: 70: Hoare triple {4671#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4671#true} is VALID [2018-11-23 12:26:10,760 INFO L273 TraceCheckUtils]: 71: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:26:10,760 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {4671#true} {4672#false} #74#return; {4672#false} is VALID [2018-11-23 12:26:10,760 INFO L273 TraceCheckUtils]: 73: Hoare triple {4672#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {4672#false} is VALID [2018-11-23 12:26:10,761 INFO L273 TraceCheckUtils]: 74: Hoare triple {4672#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {4672#false} is VALID [2018-11-23 12:26:10,761 INFO L273 TraceCheckUtils]: 75: Hoare triple {4672#false} assume !false; {4672#false} is VALID [2018-11-23 12:26:10,764 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-11-23 12:26:10,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:10,764 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:10,776 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:26:10,837 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:26:10,837 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:10,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:10,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:11,133 INFO L256 TraceCheckUtils]: 0: Hoare triple {4671#true} call ULTIMATE.init(); {4671#true} is VALID [2018-11-23 12:26:11,133 INFO L273 TraceCheckUtils]: 1: Hoare triple {4671#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4671#true} is VALID [2018-11-23 12:26:11,133 INFO L273 TraceCheckUtils]: 2: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:26:11,133 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4671#true} {4671#true} #66#return; {4671#true} is VALID [2018-11-23 12:26:11,133 INFO L256 TraceCheckUtils]: 4: Hoare triple {4671#true} call #t~ret13 := main(); {4671#true} is VALID [2018-11-23 12:26:11,134 INFO L273 TraceCheckUtils]: 5: Hoare triple {4671#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {4671#true} is VALID [2018-11-23 12:26:11,134 INFO L273 TraceCheckUtils]: 6: Hoare triple {4671#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4671#true} is VALID [2018-11-23 12:26:11,134 INFO L273 TraceCheckUtils]: 7: Hoare triple {4671#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4671#true} is VALID [2018-11-23 12:26:11,134 INFO L273 TraceCheckUtils]: 8: Hoare triple {4671#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4671#true} is VALID [2018-11-23 12:26:11,134 INFO L273 TraceCheckUtils]: 9: Hoare triple {4671#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4671#true} is VALID [2018-11-23 12:26:11,134 INFO L273 TraceCheckUtils]: 10: Hoare triple {4671#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4671#true} is VALID [2018-11-23 12:26:11,134 INFO L273 TraceCheckUtils]: 11: Hoare triple {4671#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4671#true} is VALID [2018-11-23 12:26:11,134 INFO L273 TraceCheckUtils]: 12: Hoare triple {4671#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4671#true} is VALID [2018-11-23 12:26:11,135 INFO L273 TraceCheckUtils]: 13: Hoare triple {4671#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4671#true} is VALID [2018-11-23 12:26:11,135 INFO L273 TraceCheckUtils]: 14: Hoare triple {4671#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4671#true} is VALID [2018-11-23 12:26:11,135 INFO L273 TraceCheckUtils]: 15: Hoare triple {4671#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4671#true} is VALID [2018-11-23 12:26:11,135 INFO L273 TraceCheckUtils]: 16: Hoare triple {4671#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4671#true} is VALID [2018-11-23 12:26:11,135 INFO L273 TraceCheckUtils]: 17: Hoare triple {4671#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4671#true} is VALID [2018-11-23 12:26:11,135 INFO L273 TraceCheckUtils]: 18: Hoare triple {4671#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4671#true} is VALID [2018-11-23 12:26:11,135 INFO L273 TraceCheckUtils]: 19: Hoare triple {4671#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4671#true} is VALID [2018-11-23 12:26:11,135 INFO L273 TraceCheckUtils]: 20: Hoare triple {4671#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4671#true} is VALID [2018-11-23 12:26:11,136 INFO L273 TraceCheckUtils]: 21: Hoare triple {4671#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4671#true} is VALID [2018-11-23 12:26:11,136 INFO L273 TraceCheckUtils]: 22: Hoare triple {4671#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4671#true} is VALID [2018-11-23 12:26:11,136 INFO L273 TraceCheckUtils]: 23: Hoare triple {4671#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4671#true} is VALID [2018-11-23 12:26:11,136 INFO L273 TraceCheckUtils]: 24: Hoare triple {4671#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {4671#true} is VALID [2018-11-23 12:26:11,136 INFO L273 TraceCheckUtils]: 25: Hoare triple {4671#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {4671#true} is VALID [2018-11-23 12:26:11,136 INFO L273 TraceCheckUtils]: 26: Hoare triple {4671#true} assume !(~i~1 < 100000); {4671#true} is VALID [2018-11-23 12:26:11,136 INFO L256 TraceCheckUtils]: 27: Hoare triple {4671#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {4671#true} is VALID [2018-11-23 12:26:11,136 INFO L273 TraceCheckUtils]: 28: Hoare triple {4671#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4671#true} is VALID [2018-11-23 12:26:11,136 INFO L273 TraceCheckUtils]: 29: Hoare triple {4671#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:26:11,137 INFO L273 TraceCheckUtils]: 30: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:26:11,137 INFO L273 TraceCheckUtils]: 31: Hoare triple {4671#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:26:11,137 INFO L273 TraceCheckUtils]: 32: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:26:11,137 INFO L273 TraceCheckUtils]: 33: Hoare triple {4671#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:26:11,137 INFO L273 TraceCheckUtils]: 34: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:26:11,137 INFO L273 TraceCheckUtils]: 35: Hoare triple {4671#true} assume !(~i~0 < 100000); {4671#true} is VALID [2018-11-23 12:26:11,137 INFO L273 TraceCheckUtils]: 36: Hoare triple {4671#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4671#true} is VALID [2018-11-23 12:26:11,137 INFO L273 TraceCheckUtils]: 37: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:26:11,138 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {4671#true} {4671#true} #70#return; {4671#true} is VALID [2018-11-23 12:26:11,138 INFO L273 TraceCheckUtils]: 39: Hoare triple {4671#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {4671#true} is VALID [2018-11-23 12:26:11,138 INFO L256 TraceCheckUtils]: 40: Hoare triple {4671#true} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {4671#true} is VALID [2018-11-23 12:26:11,138 INFO L273 TraceCheckUtils]: 41: Hoare triple {4671#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4671#true} is VALID [2018-11-23 12:26:11,138 INFO L273 TraceCheckUtils]: 42: Hoare triple {4671#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:26:11,138 INFO L273 TraceCheckUtils]: 43: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:26:11,138 INFO L273 TraceCheckUtils]: 44: Hoare triple {4671#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:26:11,138 INFO L273 TraceCheckUtils]: 45: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:26:11,139 INFO L273 TraceCheckUtils]: 46: Hoare triple {4671#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:26:11,139 INFO L273 TraceCheckUtils]: 47: Hoare triple {4671#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4671#true} is VALID [2018-11-23 12:26:11,139 INFO L273 TraceCheckUtils]: 48: Hoare triple {4671#true} assume !(~i~0 < 100000); {4671#true} is VALID [2018-11-23 12:26:11,139 INFO L273 TraceCheckUtils]: 49: Hoare triple {4671#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4671#true} is VALID [2018-11-23 12:26:11,139 INFO L273 TraceCheckUtils]: 50: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:26:11,139 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {4671#true} {4671#true} #72#return; {4671#true} is VALID [2018-11-23 12:26:11,139 INFO L273 TraceCheckUtils]: 52: Hoare triple {4671#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {4671#true} is VALID [2018-11-23 12:26:11,139 INFO L273 TraceCheckUtils]: 53: Hoare triple {4671#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {4671#true} is VALID [2018-11-23 12:26:11,139 INFO L273 TraceCheckUtils]: 54: Hoare triple {4671#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {4671#true} is VALID [2018-11-23 12:26:11,140 INFO L273 TraceCheckUtils]: 55: Hoare triple {4671#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {4671#true} is VALID [2018-11-23 12:26:11,140 INFO L273 TraceCheckUtils]: 56: Hoare triple {4671#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {4671#true} is VALID [2018-11-23 12:26:11,140 INFO L273 TraceCheckUtils]: 57: Hoare triple {4671#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {4671#true} is VALID [2018-11-23 12:26:11,140 INFO L273 TraceCheckUtils]: 58: Hoare triple {4671#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {4671#true} is VALID [2018-11-23 12:26:11,140 INFO L273 TraceCheckUtils]: 59: Hoare triple {4671#true} assume !(~i~2 < 99999); {4671#true} is VALID [2018-11-23 12:26:11,140 INFO L273 TraceCheckUtils]: 60: Hoare triple {4671#true} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {4671#true} is VALID [2018-11-23 12:26:11,140 INFO L256 TraceCheckUtils]: 61: Hoare triple {4671#true} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {4671#true} is VALID [2018-11-23 12:26:11,141 INFO L273 TraceCheckUtils]: 62: Hoare triple {4671#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4873#(<= bor_~i~0 1)} is VALID [2018-11-23 12:26:11,141 INFO L273 TraceCheckUtils]: 63: Hoare triple {4873#(<= bor_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4873#(<= bor_~i~0 1)} is VALID [2018-11-23 12:26:11,143 INFO L273 TraceCheckUtils]: 64: Hoare triple {4873#(<= bor_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4880#(<= bor_~i~0 2)} is VALID [2018-11-23 12:26:11,143 INFO L273 TraceCheckUtils]: 65: Hoare triple {4880#(<= bor_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4880#(<= bor_~i~0 2)} is VALID [2018-11-23 12:26:11,145 INFO L273 TraceCheckUtils]: 66: Hoare triple {4880#(<= bor_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4887#(<= bor_~i~0 3)} is VALID [2018-11-23 12:26:11,145 INFO L273 TraceCheckUtils]: 67: Hoare triple {4887#(<= bor_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {4887#(<= bor_~i~0 3)} is VALID [2018-11-23 12:26:11,147 INFO L273 TraceCheckUtils]: 68: Hoare triple {4887#(<= bor_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4894#(<= bor_~i~0 4)} is VALID [2018-11-23 12:26:11,147 INFO L273 TraceCheckUtils]: 69: Hoare triple {4894#(<= bor_~i~0 4)} assume !(~i~0 < 100000); {4672#false} is VALID [2018-11-23 12:26:11,147 INFO L273 TraceCheckUtils]: 70: Hoare triple {4672#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4672#false} is VALID [2018-11-23 12:26:11,147 INFO L273 TraceCheckUtils]: 71: Hoare triple {4672#false} assume true; {4672#false} is VALID [2018-11-23 12:26:11,147 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {4672#false} {4671#true} #74#return; {4672#false} is VALID [2018-11-23 12:26:11,148 INFO L273 TraceCheckUtils]: 73: Hoare triple {4672#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {4672#false} is VALID [2018-11-23 12:26:11,148 INFO L273 TraceCheckUtils]: 74: Hoare triple {4672#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {4672#false} is VALID [2018-11-23 12:26:11,148 INFO L273 TraceCheckUtils]: 75: Hoare triple {4672#false} assume !false; {4672#false} is VALID [2018-11-23 12:26:11,150 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 56 proven. 9 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2018-11-23 12:26:11,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:11,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6] total 17 [2018-11-23 12:26:11,170 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 76 [2018-11-23 12:26:11,170 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:11,170 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:26:11,384 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:11,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:26:11,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:26:11,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:26:11,385 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 17 states. [2018-11-23 12:26:11,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:11,879 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2018-11-23 12:26:11,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:26:11,879 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 76 [2018-11-23 12:26:11,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:11,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:26:11,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 86 transitions. [2018-11-23 12:26:11,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:26:11,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 86 transitions. [2018-11-23 12:26:11,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 86 transitions. [2018-11-23 12:26:12,278 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:12,280 INFO L225 Difference]: With dead ends: 89 [2018-11-23 12:26:12,280 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 12:26:12,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:26:12,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 12:26:12,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-11-23 12:26:12,305 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:12,305 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 59 states. [2018-11-23 12:26:12,305 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 59 states. [2018-11-23 12:26:12,305 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 59 states. [2018-11-23 12:26:12,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:12,307 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-11-23 12:26:12,308 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-11-23 12:26:12,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:12,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:12,308 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 61 states. [2018-11-23 12:26:12,308 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 61 states. [2018-11-23 12:26:12,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:12,310 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-11-23 12:26:12,311 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-11-23 12:26:12,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:12,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:12,311 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:12,311 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:12,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 12:26:12,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-11-23 12:26:12,313 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 76 [2018-11-23 12:26:12,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:12,314 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-11-23 12:26:12,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:26:12,314 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-11-23 12:26:12,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-23 12:26:12,315 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:12,315 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:26:12,315 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:12,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:12,316 INFO L82 PathProgramCache]: Analyzing trace with hash -506591693, now seen corresponding path program 11 times [2018-11-23 12:26:12,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:12,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:12,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:12,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:12,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:12,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:13,651 INFO L256 TraceCheckUtils]: 0: Hoare triple {5255#true} call ULTIMATE.init(); {5255#true} is VALID [2018-11-23 12:26:13,651 INFO L273 TraceCheckUtils]: 1: Hoare triple {5255#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5255#true} is VALID [2018-11-23 12:26:13,651 INFO L273 TraceCheckUtils]: 2: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:26:13,651 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5255#true} {5255#true} #66#return; {5255#true} is VALID [2018-11-23 12:26:13,651 INFO L256 TraceCheckUtils]: 4: Hoare triple {5255#true} call #t~ret13 := main(); {5255#true} is VALID [2018-11-23 12:26:13,652 INFO L273 TraceCheckUtils]: 5: Hoare triple {5255#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5257#(= main_~i~1 0)} is VALID [2018-11-23 12:26:13,652 INFO L273 TraceCheckUtils]: 6: Hoare triple {5257#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5257#(= main_~i~1 0)} is VALID [2018-11-23 12:26:13,653 INFO L273 TraceCheckUtils]: 7: Hoare triple {5257#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5258#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:13,653 INFO L273 TraceCheckUtils]: 8: Hoare triple {5258#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5258#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:13,653 INFO L273 TraceCheckUtils]: 9: Hoare triple {5258#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5259#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:13,654 INFO L273 TraceCheckUtils]: 10: Hoare triple {5259#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5259#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:13,654 INFO L273 TraceCheckUtils]: 11: Hoare triple {5259#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5260#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:13,655 INFO L273 TraceCheckUtils]: 12: Hoare triple {5260#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5260#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:13,655 INFO L273 TraceCheckUtils]: 13: Hoare triple {5260#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5261#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:13,655 INFO L273 TraceCheckUtils]: 14: Hoare triple {5261#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5261#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:13,656 INFO L273 TraceCheckUtils]: 15: Hoare triple {5261#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5262#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:13,656 INFO L273 TraceCheckUtils]: 16: Hoare triple {5262#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5262#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:13,657 INFO L273 TraceCheckUtils]: 17: Hoare triple {5262#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5263#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:13,658 INFO L273 TraceCheckUtils]: 18: Hoare triple {5263#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5263#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:13,658 INFO L273 TraceCheckUtils]: 19: Hoare triple {5263#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5264#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:13,659 INFO L273 TraceCheckUtils]: 20: Hoare triple {5264#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5264#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:13,660 INFO L273 TraceCheckUtils]: 21: Hoare triple {5264#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5265#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:13,677 INFO L273 TraceCheckUtils]: 22: Hoare triple {5265#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5265#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:13,680 INFO L273 TraceCheckUtils]: 23: Hoare triple {5265#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5266#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:13,680 INFO L273 TraceCheckUtils]: 24: Hoare triple {5266#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5266#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:13,681 INFO L273 TraceCheckUtils]: 25: Hoare triple {5266#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5267#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:13,681 INFO L273 TraceCheckUtils]: 26: Hoare triple {5267#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5267#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:13,682 INFO L273 TraceCheckUtils]: 27: Hoare triple {5267#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5268#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:13,682 INFO L273 TraceCheckUtils]: 28: Hoare triple {5268#(<= main_~i~1 11)} assume !(~i~1 < 100000); {5256#false} is VALID [2018-11-23 12:26:13,682 INFO L256 TraceCheckUtils]: 29: Hoare triple {5256#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {5255#true} is VALID [2018-11-23 12:26:13,682 INFO L273 TraceCheckUtils]: 30: Hoare triple {5255#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5255#true} is VALID [2018-11-23 12:26:13,682 INFO L273 TraceCheckUtils]: 31: Hoare triple {5255#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:26:13,683 INFO L273 TraceCheckUtils]: 32: Hoare triple {5255#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5255#true} is VALID [2018-11-23 12:26:13,683 INFO L273 TraceCheckUtils]: 33: Hoare triple {5255#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:26:13,683 INFO L273 TraceCheckUtils]: 34: Hoare triple {5255#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5255#true} is VALID [2018-11-23 12:26:13,683 INFO L273 TraceCheckUtils]: 35: Hoare triple {5255#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:26:13,683 INFO L273 TraceCheckUtils]: 36: Hoare triple {5255#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5255#true} is VALID [2018-11-23 12:26:13,683 INFO L273 TraceCheckUtils]: 37: Hoare triple {5255#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:26:13,683 INFO L273 TraceCheckUtils]: 38: Hoare triple {5255#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5255#true} is VALID [2018-11-23 12:26:13,683 INFO L273 TraceCheckUtils]: 39: Hoare triple {5255#true} assume !(~i~0 < 100000); {5255#true} is VALID [2018-11-23 12:26:13,683 INFO L273 TraceCheckUtils]: 40: Hoare triple {5255#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5255#true} is VALID [2018-11-23 12:26:13,684 INFO L273 TraceCheckUtils]: 41: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:26:13,684 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {5255#true} {5256#false} #70#return; {5256#false} is VALID [2018-11-23 12:26:13,684 INFO L273 TraceCheckUtils]: 43: Hoare triple {5256#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {5256#false} is VALID [2018-11-23 12:26:13,684 INFO L256 TraceCheckUtils]: 44: Hoare triple {5256#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {5255#true} is VALID [2018-11-23 12:26:13,684 INFO L273 TraceCheckUtils]: 45: Hoare triple {5255#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5255#true} is VALID [2018-11-23 12:26:13,684 INFO L273 TraceCheckUtils]: 46: Hoare triple {5255#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:26:13,684 INFO L273 TraceCheckUtils]: 47: Hoare triple {5255#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5255#true} is VALID [2018-11-23 12:26:13,684 INFO L273 TraceCheckUtils]: 48: Hoare triple {5255#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:26:13,685 INFO L273 TraceCheckUtils]: 49: Hoare triple {5255#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5255#true} is VALID [2018-11-23 12:26:13,685 INFO L273 TraceCheckUtils]: 50: Hoare triple {5255#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:26:13,685 INFO L273 TraceCheckUtils]: 51: Hoare triple {5255#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5255#true} is VALID [2018-11-23 12:26:13,685 INFO L273 TraceCheckUtils]: 52: Hoare triple {5255#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:26:13,685 INFO L273 TraceCheckUtils]: 53: Hoare triple {5255#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5255#true} is VALID [2018-11-23 12:26:13,685 INFO L273 TraceCheckUtils]: 54: Hoare triple {5255#true} assume !(~i~0 < 100000); {5255#true} is VALID [2018-11-23 12:26:13,685 INFO L273 TraceCheckUtils]: 55: Hoare triple {5255#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5255#true} is VALID [2018-11-23 12:26:13,685 INFO L273 TraceCheckUtils]: 56: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:26:13,686 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {5255#true} {5256#false} #72#return; {5256#false} is VALID [2018-11-23 12:26:13,686 INFO L273 TraceCheckUtils]: 58: Hoare triple {5256#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {5256#false} is VALID [2018-11-23 12:26:13,686 INFO L273 TraceCheckUtils]: 59: Hoare triple {5256#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {5256#false} is VALID [2018-11-23 12:26:13,686 INFO L273 TraceCheckUtils]: 60: Hoare triple {5256#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {5256#false} is VALID [2018-11-23 12:26:13,686 INFO L273 TraceCheckUtils]: 61: Hoare triple {5256#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {5256#false} is VALID [2018-11-23 12:26:13,686 INFO L273 TraceCheckUtils]: 62: Hoare triple {5256#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {5256#false} is VALID [2018-11-23 12:26:13,686 INFO L273 TraceCheckUtils]: 63: Hoare triple {5256#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {5256#false} is VALID [2018-11-23 12:26:13,686 INFO L273 TraceCheckUtils]: 64: Hoare triple {5256#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {5256#false} is VALID [2018-11-23 12:26:13,686 INFO L273 TraceCheckUtils]: 65: Hoare triple {5256#false} assume !(~i~2 < 99999); {5256#false} is VALID [2018-11-23 12:26:13,687 INFO L273 TraceCheckUtils]: 66: Hoare triple {5256#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {5256#false} is VALID [2018-11-23 12:26:13,687 INFO L256 TraceCheckUtils]: 67: Hoare triple {5256#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {5255#true} is VALID [2018-11-23 12:26:13,687 INFO L273 TraceCheckUtils]: 68: Hoare triple {5255#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5255#true} is VALID [2018-11-23 12:26:13,687 INFO L273 TraceCheckUtils]: 69: Hoare triple {5255#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:26:13,687 INFO L273 TraceCheckUtils]: 70: Hoare triple {5255#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5255#true} is VALID [2018-11-23 12:26:13,687 INFO L273 TraceCheckUtils]: 71: Hoare triple {5255#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:26:13,687 INFO L273 TraceCheckUtils]: 72: Hoare triple {5255#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5255#true} is VALID [2018-11-23 12:26:13,687 INFO L273 TraceCheckUtils]: 73: Hoare triple {5255#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:26:13,688 INFO L273 TraceCheckUtils]: 74: Hoare triple {5255#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5255#true} is VALID [2018-11-23 12:26:13,688 INFO L273 TraceCheckUtils]: 75: Hoare triple {5255#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:26:13,688 INFO L273 TraceCheckUtils]: 76: Hoare triple {5255#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5255#true} is VALID [2018-11-23 12:26:13,688 INFO L273 TraceCheckUtils]: 77: Hoare triple {5255#true} assume !(~i~0 < 100000); {5255#true} is VALID [2018-11-23 12:26:13,688 INFO L273 TraceCheckUtils]: 78: Hoare triple {5255#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5255#true} is VALID [2018-11-23 12:26:13,688 INFO L273 TraceCheckUtils]: 79: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:26:13,688 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {5255#true} {5256#false} #74#return; {5256#false} is VALID [2018-11-23 12:26:13,688 INFO L273 TraceCheckUtils]: 81: Hoare triple {5256#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {5256#false} is VALID [2018-11-23 12:26:13,689 INFO L273 TraceCheckUtils]: 82: Hoare triple {5256#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {5256#false} is VALID [2018-11-23 12:26:13,689 INFO L273 TraceCheckUtils]: 83: Hoare triple {5256#false} assume !false; {5256#false} is VALID [2018-11-23 12:26:13,692 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-11-23 12:26:13,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:13,692 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:13,700 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:26:13,884 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-11-23 12:26:13,884 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:13,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:13,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:14,045 INFO L256 TraceCheckUtils]: 0: Hoare triple {5255#true} call ULTIMATE.init(); {5255#true} is VALID [2018-11-23 12:26:14,045 INFO L273 TraceCheckUtils]: 1: Hoare triple {5255#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5255#true} is VALID [2018-11-23 12:26:14,045 INFO L273 TraceCheckUtils]: 2: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:26:14,045 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5255#true} {5255#true} #66#return; {5255#true} is VALID [2018-11-23 12:26:14,046 INFO L256 TraceCheckUtils]: 4: Hoare triple {5255#true} call #t~ret13 := main(); {5255#true} is VALID [2018-11-23 12:26:14,046 INFO L273 TraceCheckUtils]: 5: Hoare triple {5255#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5255#true} is VALID [2018-11-23 12:26:14,046 INFO L273 TraceCheckUtils]: 6: Hoare triple {5255#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5255#true} is VALID [2018-11-23 12:26:14,046 INFO L273 TraceCheckUtils]: 7: Hoare triple {5255#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5255#true} is VALID [2018-11-23 12:26:14,046 INFO L273 TraceCheckUtils]: 8: Hoare triple {5255#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5255#true} is VALID [2018-11-23 12:26:14,047 INFO L273 TraceCheckUtils]: 9: Hoare triple {5255#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5255#true} is VALID [2018-11-23 12:26:14,047 INFO L273 TraceCheckUtils]: 10: Hoare triple {5255#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5255#true} is VALID [2018-11-23 12:26:14,047 INFO L273 TraceCheckUtils]: 11: Hoare triple {5255#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5255#true} is VALID [2018-11-23 12:26:14,047 INFO L273 TraceCheckUtils]: 12: Hoare triple {5255#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5255#true} is VALID [2018-11-23 12:26:14,047 INFO L273 TraceCheckUtils]: 13: Hoare triple {5255#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5255#true} is VALID [2018-11-23 12:26:14,047 INFO L273 TraceCheckUtils]: 14: Hoare triple {5255#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5255#true} is VALID [2018-11-23 12:26:14,047 INFO L273 TraceCheckUtils]: 15: Hoare triple {5255#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5255#true} is VALID [2018-11-23 12:26:14,047 INFO L273 TraceCheckUtils]: 16: Hoare triple {5255#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5255#true} is VALID [2018-11-23 12:26:14,047 INFO L273 TraceCheckUtils]: 17: Hoare triple {5255#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5255#true} is VALID [2018-11-23 12:26:14,048 INFO L273 TraceCheckUtils]: 18: Hoare triple {5255#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5255#true} is VALID [2018-11-23 12:26:14,048 INFO L273 TraceCheckUtils]: 19: Hoare triple {5255#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5255#true} is VALID [2018-11-23 12:26:14,048 INFO L273 TraceCheckUtils]: 20: Hoare triple {5255#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5255#true} is VALID [2018-11-23 12:26:14,048 INFO L273 TraceCheckUtils]: 21: Hoare triple {5255#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5255#true} is VALID [2018-11-23 12:26:14,048 INFO L273 TraceCheckUtils]: 22: Hoare triple {5255#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5255#true} is VALID [2018-11-23 12:26:14,048 INFO L273 TraceCheckUtils]: 23: Hoare triple {5255#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5255#true} is VALID [2018-11-23 12:26:14,048 INFO L273 TraceCheckUtils]: 24: Hoare triple {5255#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5255#true} is VALID [2018-11-23 12:26:14,048 INFO L273 TraceCheckUtils]: 25: Hoare triple {5255#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5255#true} is VALID [2018-11-23 12:26:14,049 INFO L273 TraceCheckUtils]: 26: Hoare triple {5255#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5255#true} is VALID [2018-11-23 12:26:14,049 INFO L273 TraceCheckUtils]: 27: Hoare triple {5255#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5255#true} is VALID [2018-11-23 12:26:14,049 INFO L273 TraceCheckUtils]: 28: Hoare triple {5255#true} assume !(~i~1 < 100000); {5255#true} is VALID [2018-11-23 12:26:14,049 INFO L256 TraceCheckUtils]: 29: Hoare triple {5255#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {5255#true} is VALID [2018-11-23 12:26:14,049 INFO L273 TraceCheckUtils]: 30: Hoare triple {5255#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5362#(<= bor_~i~0 1)} is VALID [2018-11-23 12:26:14,050 INFO L273 TraceCheckUtils]: 31: Hoare triple {5362#(<= bor_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5362#(<= bor_~i~0 1)} is VALID [2018-11-23 12:26:14,050 INFO L273 TraceCheckUtils]: 32: Hoare triple {5362#(<= bor_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5369#(<= bor_~i~0 2)} is VALID [2018-11-23 12:26:14,051 INFO L273 TraceCheckUtils]: 33: Hoare triple {5369#(<= bor_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5369#(<= bor_~i~0 2)} is VALID [2018-11-23 12:26:14,051 INFO L273 TraceCheckUtils]: 34: Hoare triple {5369#(<= bor_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5376#(<= bor_~i~0 3)} is VALID [2018-11-23 12:26:14,051 INFO L273 TraceCheckUtils]: 35: Hoare triple {5376#(<= bor_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5376#(<= bor_~i~0 3)} is VALID [2018-11-23 12:26:14,052 INFO L273 TraceCheckUtils]: 36: Hoare triple {5376#(<= bor_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5383#(<= bor_~i~0 4)} is VALID [2018-11-23 12:26:14,052 INFO L273 TraceCheckUtils]: 37: Hoare triple {5383#(<= bor_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5383#(<= bor_~i~0 4)} is VALID [2018-11-23 12:26:14,053 INFO L273 TraceCheckUtils]: 38: Hoare triple {5383#(<= bor_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5390#(<= bor_~i~0 5)} is VALID [2018-11-23 12:26:14,053 INFO L273 TraceCheckUtils]: 39: Hoare triple {5390#(<= bor_~i~0 5)} assume !(~i~0 < 100000); {5256#false} is VALID [2018-11-23 12:26:14,053 INFO L273 TraceCheckUtils]: 40: Hoare triple {5256#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5256#false} is VALID [2018-11-23 12:26:14,053 INFO L273 TraceCheckUtils]: 41: Hoare triple {5256#false} assume true; {5256#false} is VALID [2018-11-23 12:26:14,053 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {5256#false} {5255#true} #70#return; {5256#false} is VALID [2018-11-23 12:26:14,054 INFO L273 TraceCheckUtils]: 43: Hoare triple {5256#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {5256#false} is VALID [2018-11-23 12:26:14,054 INFO L256 TraceCheckUtils]: 44: Hoare triple {5256#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {5256#false} is VALID [2018-11-23 12:26:14,054 INFO L273 TraceCheckUtils]: 45: Hoare triple {5256#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5256#false} is VALID [2018-11-23 12:26:14,054 INFO L273 TraceCheckUtils]: 46: Hoare triple {5256#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5256#false} is VALID [2018-11-23 12:26:14,054 INFO L273 TraceCheckUtils]: 47: Hoare triple {5256#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5256#false} is VALID [2018-11-23 12:26:14,054 INFO L273 TraceCheckUtils]: 48: Hoare triple {5256#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5256#false} is VALID [2018-11-23 12:26:14,054 INFO L273 TraceCheckUtils]: 49: Hoare triple {5256#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5256#false} is VALID [2018-11-23 12:26:14,054 INFO L273 TraceCheckUtils]: 50: Hoare triple {5256#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5256#false} is VALID [2018-11-23 12:26:14,055 INFO L273 TraceCheckUtils]: 51: Hoare triple {5256#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5256#false} is VALID [2018-11-23 12:26:14,055 INFO L273 TraceCheckUtils]: 52: Hoare triple {5256#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5256#false} is VALID [2018-11-23 12:26:14,055 INFO L273 TraceCheckUtils]: 53: Hoare triple {5256#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5256#false} is VALID [2018-11-23 12:26:14,055 INFO L273 TraceCheckUtils]: 54: Hoare triple {5256#false} assume !(~i~0 < 100000); {5256#false} is VALID [2018-11-23 12:26:14,055 INFO L273 TraceCheckUtils]: 55: Hoare triple {5256#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5256#false} is VALID [2018-11-23 12:26:14,056 INFO L273 TraceCheckUtils]: 56: Hoare triple {5256#false} assume true; {5256#false} is VALID [2018-11-23 12:26:14,056 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {5256#false} {5256#false} #72#return; {5256#false} is VALID [2018-11-23 12:26:14,056 INFO L273 TraceCheckUtils]: 58: Hoare triple {5256#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {5256#false} is VALID [2018-11-23 12:26:14,056 INFO L273 TraceCheckUtils]: 59: Hoare triple {5256#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {5256#false} is VALID [2018-11-23 12:26:14,056 INFO L273 TraceCheckUtils]: 60: Hoare triple {5256#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {5256#false} is VALID [2018-11-23 12:26:14,057 INFO L273 TraceCheckUtils]: 61: Hoare triple {5256#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {5256#false} is VALID [2018-11-23 12:26:14,057 INFO L273 TraceCheckUtils]: 62: Hoare triple {5256#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {5256#false} is VALID [2018-11-23 12:26:14,057 INFO L273 TraceCheckUtils]: 63: Hoare triple {5256#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {5256#false} is VALID [2018-11-23 12:26:14,057 INFO L273 TraceCheckUtils]: 64: Hoare triple {5256#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {5256#false} is VALID [2018-11-23 12:26:14,057 INFO L273 TraceCheckUtils]: 65: Hoare triple {5256#false} assume !(~i~2 < 99999); {5256#false} is VALID [2018-11-23 12:26:14,057 INFO L273 TraceCheckUtils]: 66: Hoare triple {5256#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {5256#false} is VALID [2018-11-23 12:26:14,057 INFO L256 TraceCheckUtils]: 67: Hoare triple {5256#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {5256#false} is VALID [2018-11-23 12:26:14,057 INFO L273 TraceCheckUtils]: 68: Hoare triple {5256#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5256#false} is VALID [2018-11-23 12:26:14,057 INFO L273 TraceCheckUtils]: 69: Hoare triple {5256#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5256#false} is VALID [2018-11-23 12:26:14,058 INFO L273 TraceCheckUtils]: 70: Hoare triple {5256#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5256#false} is VALID [2018-11-23 12:26:14,058 INFO L273 TraceCheckUtils]: 71: Hoare triple {5256#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5256#false} is VALID [2018-11-23 12:26:14,058 INFO L273 TraceCheckUtils]: 72: Hoare triple {5256#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5256#false} is VALID [2018-11-23 12:26:14,058 INFO L273 TraceCheckUtils]: 73: Hoare triple {5256#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5256#false} is VALID [2018-11-23 12:26:14,058 INFO L273 TraceCheckUtils]: 74: Hoare triple {5256#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5256#false} is VALID [2018-11-23 12:26:14,058 INFO L273 TraceCheckUtils]: 75: Hoare triple {5256#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5256#false} is VALID [2018-11-23 12:26:14,058 INFO L273 TraceCheckUtils]: 76: Hoare triple {5256#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5256#false} is VALID [2018-11-23 12:26:14,059 INFO L273 TraceCheckUtils]: 77: Hoare triple {5256#false} assume !(~i~0 < 100000); {5256#false} is VALID [2018-11-23 12:26:14,059 INFO L273 TraceCheckUtils]: 78: Hoare triple {5256#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5256#false} is VALID [2018-11-23 12:26:14,059 INFO L273 TraceCheckUtils]: 79: Hoare triple {5256#false} assume true; {5256#false} is VALID [2018-11-23 12:26:14,059 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {5256#false} {5256#false} #74#return; {5256#false} is VALID [2018-11-23 12:26:14,059 INFO L273 TraceCheckUtils]: 81: Hoare triple {5256#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {5256#false} is VALID [2018-11-23 12:26:14,059 INFO L273 TraceCheckUtils]: 82: Hoare triple {5256#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {5256#false} is VALID [2018-11-23 12:26:14,060 INFO L273 TraceCheckUtils]: 83: Hoare triple {5256#false} assume !false; {5256#false} is VALID [2018-11-23 12:26:14,063 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 84 proven. 16 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2018-11-23 12:26:14,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:14,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 19 [2018-11-23 12:26:14,095 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 84 [2018-11-23 12:26:14,096 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:14,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 12:26:14,190 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:14,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 12:26:14,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 12:26:14,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:26:14,192 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 19 states. [2018-11-23 12:26:14,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:14,679 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2018-11-23 12:26:14,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:26:14,679 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 84 [2018-11-23 12:26:14,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:14,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:26:14,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 90 transitions. [2018-11-23 12:26:14,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:26:14,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 90 transitions. [2018-11-23 12:26:14,683 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 90 transitions. [2018-11-23 12:26:14,845 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:14,847 INFO L225 Difference]: With dead ends: 95 [2018-11-23 12:26:14,847 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 12:26:14,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:26:14,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 12:26:14,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-11-23 12:26:14,872 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:14,872 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 63 states. [2018-11-23 12:26:14,872 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 63 states. [2018-11-23 12:26:14,872 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 63 states. [2018-11-23 12:26:14,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:14,875 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-11-23 12:26:14,875 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-11-23 12:26:14,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:14,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:14,876 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 65 states. [2018-11-23 12:26:14,876 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 65 states. [2018-11-23 12:26:14,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:14,877 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-11-23 12:26:14,878 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-11-23 12:26:14,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:14,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:14,878 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:14,878 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:14,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 12:26:14,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-11-23 12:26:14,880 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 84 [2018-11-23 12:26:14,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:14,880 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-11-23 12:26:14,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 12:26:14,881 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-11-23 12:26:14,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-23 12:26:14,882 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:14,882 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:26:14,882 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:14,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:14,882 INFO L82 PathProgramCache]: Analyzing trace with hash -416573805, now seen corresponding path program 12 times [2018-11-23 12:26:14,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:14,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:14,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:14,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:14,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:14,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:15,425 INFO L256 TraceCheckUtils]: 0: Hoare triple {5888#true} call ULTIMATE.init(); {5888#true} is VALID [2018-11-23 12:26:15,425 INFO L273 TraceCheckUtils]: 1: Hoare triple {5888#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5888#true} is VALID [2018-11-23 12:26:15,425 INFO L273 TraceCheckUtils]: 2: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:26:15,425 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5888#true} {5888#true} #66#return; {5888#true} is VALID [2018-11-23 12:26:15,426 INFO L256 TraceCheckUtils]: 4: Hoare triple {5888#true} call #t~ret13 := main(); {5888#true} is VALID [2018-11-23 12:26:15,426 INFO L273 TraceCheckUtils]: 5: Hoare triple {5888#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5890#(= main_~i~1 0)} is VALID [2018-11-23 12:26:15,426 INFO L273 TraceCheckUtils]: 6: Hoare triple {5890#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5890#(= main_~i~1 0)} is VALID [2018-11-23 12:26:15,427 INFO L273 TraceCheckUtils]: 7: Hoare triple {5890#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5891#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:15,428 INFO L273 TraceCheckUtils]: 8: Hoare triple {5891#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5891#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:15,428 INFO L273 TraceCheckUtils]: 9: Hoare triple {5891#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5892#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:15,429 INFO L273 TraceCheckUtils]: 10: Hoare triple {5892#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5892#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:15,429 INFO L273 TraceCheckUtils]: 11: Hoare triple {5892#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5893#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:15,430 INFO L273 TraceCheckUtils]: 12: Hoare triple {5893#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5893#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:15,431 INFO L273 TraceCheckUtils]: 13: Hoare triple {5893#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5894#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:15,431 INFO L273 TraceCheckUtils]: 14: Hoare triple {5894#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5894#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:15,432 INFO L273 TraceCheckUtils]: 15: Hoare triple {5894#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5895#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:15,433 INFO L273 TraceCheckUtils]: 16: Hoare triple {5895#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5895#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:15,434 INFO L273 TraceCheckUtils]: 17: Hoare triple {5895#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5896#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:15,434 INFO L273 TraceCheckUtils]: 18: Hoare triple {5896#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5896#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:15,435 INFO L273 TraceCheckUtils]: 19: Hoare triple {5896#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5897#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:15,435 INFO L273 TraceCheckUtils]: 20: Hoare triple {5897#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5897#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:15,436 INFO L273 TraceCheckUtils]: 21: Hoare triple {5897#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5898#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:15,437 INFO L273 TraceCheckUtils]: 22: Hoare triple {5898#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5898#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:15,437 INFO L273 TraceCheckUtils]: 23: Hoare triple {5898#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5899#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:15,438 INFO L273 TraceCheckUtils]: 24: Hoare triple {5899#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5899#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:15,439 INFO L273 TraceCheckUtils]: 25: Hoare triple {5899#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5900#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:15,439 INFO L273 TraceCheckUtils]: 26: Hoare triple {5900#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5900#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:15,440 INFO L273 TraceCheckUtils]: 27: Hoare triple {5900#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5901#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:15,440 INFO L273 TraceCheckUtils]: 28: Hoare triple {5901#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5901#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:15,441 INFO L273 TraceCheckUtils]: 29: Hoare triple {5901#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5902#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:15,442 INFO L273 TraceCheckUtils]: 30: Hoare triple {5902#(<= main_~i~1 12)} assume !(~i~1 < 100000); {5889#false} is VALID [2018-11-23 12:26:15,442 INFO L256 TraceCheckUtils]: 31: Hoare triple {5889#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {5888#true} is VALID [2018-11-23 12:26:15,442 INFO L273 TraceCheckUtils]: 32: Hoare triple {5888#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5888#true} is VALID [2018-11-23 12:26:15,443 INFO L273 TraceCheckUtils]: 33: Hoare triple {5888#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:26:15,443 INFO L273 TraceCheckUtils]: 34: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:26:15,443 INFO L273 TraceCheckUtils]: 35: Hoare triple {5888#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:26:15,443 INFO L273 TraceCheckUtils]: 36: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:26:15,443 INFO L273 TraceCheckUtils]: 37: Hoare triple {5888#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:26:15,444 INFO L273 TraceCheckUtils]: 38: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:26:15,444 INFO L273 TraceCheckUtils]: 39: Hoare triple {5888#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:26:15,444 INFO L273 TraceCheckUtils]: 40: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:26:15,444 INFO L273 TraceCheckUtils]: 41: Hoare triple {5888#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:26:15,444 INFO L273 TraceCheckUtils]: 42: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:26:15,445 INFO L273 TraceCheckUtils]: 43: Hoare triple {5888#true} assume !(~i~0 < 100000); {5888#true} is VALID [2018-11-23 12:26:15,445 INFO L273 TraceCheckUtils]: 44: Hoare triple {5888#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5888#true} is VALID [2018-11-23 12:26:15,445 INFO L273 TraceCheckUtils]: 45: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:26:15,445 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {5888#true} {5889#false} #70#return; {5889#false} is VALID [2018-11-23 12:26:15,445 INFO L273 TraceCheckUtils]: 47: Hoare triple {5889#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {5889#false} is VALID [2018-11-23 12:26:15,446 INFO L256 TraceCheckUtils]: 48: Hoare triple {5889#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {5888#true} is VALID [2018-11-23 12:26:15,446 INFO L273 TraceCheckUtils]: 49: Hoare triple {5888#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5888#true} is VALID [2018-11-23 12:26:15,446 INFO L273 TraceCheckUtils]: 50: Hoare triple {5888#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:26:15,446 INFO L273 TraceCheckUtils]: 51: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:26:15,446 INFO L273 TraceCheckUtils]: 52: Hoare triple {5888#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:26:15,446 INFO L273 TraceCheckUtils]: 53: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:26:15,446 INFO L273 TraceCheckUtils]: 54: Hoare triple {5888#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:26:15,447 INFO L273 TraceCheckUtils]: 55: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:26:15,447 INFO L273 TraceCheckUtils]: 56: Hoare triple {5888#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:26:15,447 INFO L273 TraceCheckUtils]: 57: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:26:15,447 INFO L273 TraceCheckUtils]: 58: Hoare triple {5888#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:26:15,447 INFO L273 TraceCheckUtils]: 59: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:26:15,447 INFO L273 TraceCheckUtils]: 60: Hoare triple {5888#true} assume !(~i~0 < 100000); {5888#true} is VALID [2018-11-23 12:26:15,447 INFO L273 TraceCheckUtils]: 61: Hoare triple {5888#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5888#true} is VALID [2018-11-23 12:26:15,447 INFO L273 TraceCheckUtils]: 62: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:26:15,448 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {5888#true} {5889#false} #72#return; {5889#false} is VALID [2018-11-23 12:26:15,448 INFO L273 TraceCheckUtils]: 64: Hoare triple {5889#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {5889#false} is VALID [2018-11-23 12:26:15,448 INFO L273 TraceCheckUtils]: 65: Hoare triple {5889#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {5889#false} is VALID [2018-11-23 12:26:15,448 INFO L273 TraceCheckUtils]: 66: Hoare triple {5889#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {5889#false} is VALID [2018-11-23 12:26:15,448 INFO L273 TraceCheckUtils]: 67: Hoare triple {5889#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {5889#false} is VALID [2018-11-23 12:26:15,448 INFO L273 TraceCheckUtils]: 68: Hoare triple {5889#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {5889#false} is VALID [2018-11-23 12:26:15,449 INFO L273 TraceCheckUtils]: 69: Hoare triple {5889#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {5889#false} is VALID [2018-11-23 12:26:15,449 INFO L273 TraceCheckUtils]: 70: Hoare triple {5889#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {5889#false} is VALID [2018-11-23 12:26:15,449 INFO L273 TraceCheckUtils]: 71: Hoare triple {5889#false} assume !(~i~2 < 99999); {5889#false} is VALID [2018-11-23 12:26:15,449 INFO L273 TraceCheckUtils]: 72: Hoare triple {5889#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {5889#false} is VALID [2018-11-23 12:26:15,449 INFO L256 TraceCheckUtils]: 73: Hoare triple {5889#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {5888#true} is VALID [2018-11-23 12:26:15,449 INFO L273 TraceCheckUtils]: 74: Hoare triple {5888#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5888#true} is VALID [2018-11-23 12:26:15,450 INFO L273 TraceCheckUtils]: 75: Hoare triple {5888#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:26:15,450 INFO L273 TraceCheckUtils]: 76: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:26:15,450 INFO L273 TraceCheckUtils]: 77: Hoare triple {5888#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:26:15,450 INFO L273 TraceCheckUtils]: 78: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:26:15,450 INFO L273 TraceCheckUtils]: 79: Hoare triple {5888#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:26:15,450 INFO L273 TraceCheckUtils]: 80: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:26:15,450 INFO L273 TraceCheckUtils]: 81: Hoare triple {5888#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:26:15,451 INFO L273 TraceCheckUtils]: 82: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:26:15,451 INFO L273 TraceCheckUtils]: 83: Hoare triple {5888#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:26:15,451 INFO L273 TraceCheckUtils]: 84: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:26:15,451 INFO L273 TraceCheckUtils]: 85: Hoare triple {5888#true} assume !(~i~0 < 100000); {5888#true} is VALID [2018-11-23 12:26:15,451 INFO L273 TraceCheckUtils]: 86: Hoare triple {5888#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5888#true} is VALID [2018-11-23 12:26:15,451 INFO L273 TraceCheckUtils]: 87: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:26:15,451 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {5888#true} {5889#false} #74#return; {5889#false} is VALID [2018-11-23 12:26:15,452 INFO L273 TraceCheckUtils]: 89: Hoare triple {5889#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {5889#false} is VALID [2018-11-23 12:26:15,452 INFO L273 TraceCheckUtils]: 90: Hoare triple {5889#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {5889#false} is VALID [2018-11-23 12:26:15,452 INFO L273 TraceCheckUtils]: 91: Hoare triple {5889#false} assume !false; {5889#false} is VALID [2018-11-23 12:26:15,456 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2018-11-23 12:26:15,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:15,457 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:15,467 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:26:15,654 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-11-23 12:26:15,654 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:15,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:15,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:15,869 INFO L256 TraceCheckUtils]: 0: Hoare triple {5888#true} call ULTIMATE.init(); {5888#true} is VALID [2018-11-23 12:26:15,869 INFO L273 TraceCheckUtils]: 1: Hoare triple {5888#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5888#true} is VALID [2018-11-23 12:26:15,870 INFO L273 TraceCheckUtils]: 2: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:26:15,870 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5888#true} {5888#true} #66#return; {5888#true} is VALID [2018-11-23 12:26:15,870 INFO L256 TraceCheckUtils]: 4: Hoare triple {5888#true} call #t~ret13 := main(); {5888#true} is VALID [2018-11-23 12:26:15,870 INFO L273 TraceCheckUtils]: 5: Hoare triple {5888#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5888#true} is VALID [2018-11-23 12:26:15,870 INFO L273 TraceCheckUtils]: 6: Hoare triple {5888#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5888#true} is VALID [2018-11-23 12:26:15,870 INFO L273 TraceCheckUtils]: 7: Hoare triple {5888#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5888#true} is VALID [2018-11-23 12:26:15,870 INFO L273 TraceCheckUtils]: 8: Hoare triple {5888#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5888#true} is VALID [2018-11-23 12:26:15,870 INFO L273 TraceCheckUtils]: 9: Hoare triple {5888#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5888#true} is VALID [2018-11-23 12:26:15,871 INFO L273 TraceCheckUtils]: 10: Hoare triple {5888#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5888#true} is VALID [2018-11-23 12:26:15,871 INFO L273 TraceCheckUtils]: 11: Hoare triple {5888#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5888#true} is VALID [2018-11-23 12:26:15,871 INFO L273 TraceCheckUtils]: 12: Hoare triple {5888#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5888#true} is VALID [2018-11-23 12:26:15,871 INFO L273 TraceCheckUtils]: 13: Hoare triple {5888#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5888#true} is VALID [2018-11-23 12:26:15,871 INFO L273 TraceCheckUtils]: 14: Hoare triple {5888#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5888#true} is VALID [2018-11-23 12:26:15,871 INFO L273 TraceCheckUtils]: 15: Hoare triple {5888#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5888#true} is VALID [2018-11-23 12:26:15,871 INFO L273 TraceCheckUtils]: 16: Hoare triple {5888#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5888#true} is VALID [2018-11-23 12:26:15,871 INFO L273 TraceCheckUtils]: 17: Hoare triple {5888#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5888#true} is VALID [2018-11-23 12:26:15,871 INFO L273 TraceCheckUtils]: 18: Hoare triple {5888#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5888#true} is VALID [2018-11-23 12:26:15,872 INFO L273 TraceCheckUtils]: 19: Hoare triple {5888#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5888#true} is VALID [2018-11-23 12:26:15,872 INFO L273 TraceCheckUtils]: 20: Hoare triple {5888#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5888#true} is VALID [2018-11-23 12:26:15,872 INFO L273 TraceCheckUtils]: 21: Hoare triple {5888#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5888#true} is VALID [2018-11-23 12:26:15,872 INFO L273 TraceCheckUtils]: 22: Hoare triple {5888#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5888#true} is VALID [2018-11-23 12:26:15,872 INFO L273 TraceCheckUtils]: 23: Hoare triple {5888#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5888#true} is VALID [2018-11-23 12:26:15,872 INFO L273 TraceCheckUtils]: 24: Hoare triple {5888#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5888#true} is VALID [2018-11-23 12:26:15,872 INFO L273 TraceCheckUtils]: 25: Hoare triple {5888#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5888#true} is VALID [2018-11-23 12:26:15,872 INFO L273 TraceCheckUtils]: 26: Hoare triple {5888#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5888#true} is VALID [2018-11-23 12:26:15,873 INFO L273 TraceCheckUtils]: 27: Hoare triple {5888#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5888#true} is VALID [2018-11-23 12:26:15,873 INFO L273 TraceCheckUtils]: 28: Hoare triple {5888#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {5888#true} is VALID [2018-11-23 12:26:15,873 INFO L273 TraceCheckUtils]: 29: Hoare triple {5888#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {5888#true} is VALID [2018-11-23 12:26:15,873 INFO L273 TraceCheckUtils]: 30: Hoare triple {5888#true} assume !(~i~1 < 100000); {5888#true} is VALID [2018-11-23 12:26:15,873 INFO L256 TraceCheckUtils]: 31: Hoare triple {5888#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {5888#true} is VALID [2018-11-23 12:26:15,873 INFO L273 TraceCheckUtils]: 32: Hoare triple {5888#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5888#true} is VALID [2018-11-23 12:26:15,873 INFO L273 TraceCheckUtils]: 33: Hoare triple {5888#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:26:15,873 INFO L273 TraceCheckUtils]: 34: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:26:15,873 INFO L273 TraceCheckUtils]: 35: Hoare triple {5888#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:26:15,874 INFO L273 TraceCheckUtils]: 36: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:26:15,874 INFO L273 TraceCheckUtils]: 37: Hoare triple {5888#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:26:15,874 INFO L273 TraceCheckUtils]: 38: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:26:15,874 INFO L273 TraceCheckUtils]: 39: Hoare triple {5888#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:26:15,874 INFO L273 TraceCheckUtils]: 40: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:26:15,874 INFO L273 TraceCheckUtils]: 41: Hoare triple {5888#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:26:15,874 INFO L273 TraceCheckUtils]: 42: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:26:15,874 INFO L273 TraceCheckUtils]: 43: Hoare triple {5888#true} assume !(~i~0 < 100000); {5888#true} is VALID [2018-11-23 12:26:15,875 INFO L273 TraceCheckUtils]: 44: Hoare triple {5888#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5888#true} is VALID [2018-11-23 12:26:15,875 INFO L273 TraceCheckUtils]: 45: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:26:15,875 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {5888#true} {5888#true} #70#return; {5888#true} is VALID [2018-11-23 12:26:15,875 INFO L273 TraceCheckUtils]: 47: Hoare triple {5888#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {5888#true} is VALID [2018-11-23 12:26:15,875 INFO L256 TraceCheckUtils]: 48: Hoare triple {5888#true} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {5888#true} is VALID [2018-11-23 12:26:15,875 INFO L273 TraceCheckUtils]: 49: Hoare triple {5888#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5888#true} is VALID [2018-11-23 12:26:15,875 INFO L273 TraceCheckUtils]: 50: Hoare triple {5888#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:26:15,875 INFO L273 TraceCheckUtils]: 51: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:26:15,875 INFO L273 TraceCheckUtils]: 52: Hoare triple {5888#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:26:15,876 INFO L273 TraceCheckUtils]: 53: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:26:15,876 INFO L273 TraceCheckUtils]: 54: Hoare triple {5888#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:26:15,876 INFO L273 TraceCheckUtils]: 55: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:26:15,876 INFO L273 TraceCheckUtils]: 56: Hoare triple {5888#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:26:15,876 INFO L273 TraceCheckUtils]: 57: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:26:15,876 INFO L273 TraceCheckUtils]: 58: Hoare triple {5888#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:26:15,876 INFO L273 TraceCheckUtils]: 59: Hoare triple {5888#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5888#true} is VALID [2018-11-23 12:26:15,876 INFO L273 TraceCheckUtils]: 60: Hoare triple {5888#true} assume !(~i~0 < 100000); {5888#true} is VALID [2018-11-23 12:26:15,877 INFO L273 TraceCheckUtils]: 61: Hoare triple {5888#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5888#true} is VALID [2018-11-23 12:26:15,877 INFO L273 TraceCheckUtils]: 62: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:26:15,877 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {5888#true} {5888#true} #72#return; {5888#true} is VALID [2018-11-23 12:26:15,877 INFO L273 TraceCheckUtils]: 64: Hoare triple {5888#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {6098#(<= main_~i~2 0)} is VALID [2018-11-23 12:26:15,878 INFO L273 TraceCheckUtils]: 65: Hoare triple {6098#(<= main_~i~2 0)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {6098#(<= main_~i~2 0)} is VALID [2018-11-23 12:26:15,878 INFO L273 TraceCheckUtils]: 66: Hoare triple {6098#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {6105#(<= main_~i~2 1)} is VALID [2018-11-23 12:26:15,878 INFO L273 TraceCheckUtils]: 67: Hoare triple {6105#(<= main_~i~2 1)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {6105#(<= main_~i~2 1)} is VALID [2018-11-23 12:26:15,879 INFO L273 TraceCheckUtils]: 68: Hoare triple {6105#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {6112#(<= main_~i~2 2)} is VALID [2018-11-23 12:26:15,879 INFO L273 TraceCheckUtils]: 69: Hoare triple {6112#(<= main_~i~2 2)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {6112#(<= main_~i~2 2)} is VALID [2018-11-23 12:26:15,880 INFO L273 TraceCheckUtils]: 70: Hoare triple {6112#(<= main_~i~2 2)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {6119#(<= main_~i~2 3)} is VALID [2018-11-23 12:26:15,880 INFO L273 TraceCheckUtils]: 71: Hoare triple {6119#(<= main_~i~2 3)} assume !(~i~2 < 99999); {5889#false} is VALID [2018-11-23 12:26:15,881 INFO L273 TraceCheckUtils]: 72: Hoare triple {5889#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {5889#false} is VALID [2018-11-23 12:26:15,881 INFO L256 TraceCheckUtils]: 73: Hoare triple {5889#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {5889#false} is VALID [2018-11-23 12:26:15,881 INFO L273 TraceCheckUtils]: 74: Hoare triple {5889#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5889#false} is VALID [2018-11-23 12:26:15,881 INFO L273 TraceCheckUtils]: 75: Hoare triple {5889#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5889#false} is VALID [2018-11-23 12:26:15,881 INFO L273 TraceCheckUtils]: 76: Hoare triple {5889#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5889#false} is VALID [2018-11-23 12:26:15,882 INFO L273 TraceCheckUtils]: 77: Hoare triple {5889#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5889#false} is VALID [2018-11-23 12:26:15,882 INFO L273 TraceCheckUtils]: 78: Hoare triple {5889#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5889#false} is VALID [2018-11-23 12:26:15,882 INFO L273 TraceCheckUtils]: 79: Hoare triple {5889#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5889#false} is VALID [2018-11-23 12:26:15,882 INFO L273 TraceCheckUtils]: 80: Hoare triple {5889#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5889#false} is VALID [2018-11-23 12:26:15,882 INFO L273 TraceCheckUtils]: 81: Hoare triple {5889#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5889#false} is VALID [2018-11-23 12:26:15,883 INFO L273 TraceCheckUtils]: 82: Hoare triple {5889#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5889#false} is VALID [2018-11-23 12:26:15,883 INFO L273 TraceCheckUtils]: 83: Hoare triple {5889#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {5889#false} is VALID [2018-11-23 12:26:15,883 INFO L273 TraceCheckUtils]: 84: Hoare triple {5889#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5889#false} is VALID [2018-11-23 12:26:15,884 INFO L273 TraceCheckUtils]: 85: Hoare triple {5889#false} assume !(~i~0 < 100000); {5889#false} is VALID [2018-11-23 12:26:15,884 INFO L273 TraceCheckUtils]: 86: Hoare triple {5889#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5889#false} is VALID [2018-11-23 12:26:15,884 INFO L273 TraceCheckUtils]: 87: Hoare triple {5889#false} assume true; {5889#false} is VALID [2018-11-23 12:26:15,884 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {5889#false} {5889#false} #74#return; {5889#false} is VALID [2018-11-23 12:26:15,885 INFO L273 TraceCheckUtils]: 89: Hoare triple {5889#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {5889#false} is VALID [2018-11-23 12:26:15,885 INFO L273 TraceCheckUtils]: 90: Hoare triple {5889#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {5889#false} is VALID [2018-11-23 12:26:15,885 INFO L273 TraceCheckUtils]: 91: Hoare triple {5889#false} assume !false; {5889#false} is VALID [2018-11-23 12:26:15,889 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 130 proven. 9 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2018-11-23 12:26:15,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:15,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6] total 19 [2018-11-23 12:26:15,911 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2018-11-23 12:26:15,911 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:15,911 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 12:26:15,984 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:15,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 12:26:15,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 12:26:15,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:26:15,985 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 19 states. [2018-11-23 12:26:16,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:16,727 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2018-11-23 12:26:16,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:26:16,728 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2018-11-23 12:26:16,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:16,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:26:16,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 87 transitions. [2018-11-23 12:26:16,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:26:16,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 87 transitions. [2018-11-23 12:26:16,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 87 transitions. [2018-11-23 12:26:17,207 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:17,209 INFO L225 Difference]: With dead ends: 101 [2018-11-23 12:26:17,210 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 12:26:17,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:26:17,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 12:26:17,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-11-23 12:26:17,607 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:17,607 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 67 states. [2018-11-23 12:26:17,607 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 67 states. [2018-11-23 12:26:17,607 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 67 states. [2018-11-23 12:26:17,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:17,612 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-23 12:26:17,612 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-23 12:26:17,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:17,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:17,612 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 69 states. [2018-11-23 12:26:17,612 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 69 states. [2018-11-23 12:26:17,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:17,614 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-23 12:26:17,614 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-23 12:26:17,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:17,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:17,615 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:17,615 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:17,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 12:26:17,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-11-23 12:26:17,617 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 92 [2018-11-23 12:26:17,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:17,617 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-11-23 12:26:17,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 12:26:17,617 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-23 12:26:17,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-23 12:26:17,618 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:17,618 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 13, 13, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:26:17,619 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:17,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:17,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1508563187, now seen corresponding path program 13 times [2018-11-23 12:26:17,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:17,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:17,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:17,620 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:17,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:17,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:17,935 INFO L256 TraceCheckUtils]: 0: Hoare triple {6568#true} call ULTIMATE.init(); {6568#true} is VALID [2018-11-23 12:26:17,936 INFO L273 TraceCheckUtils]: 1: Hoare triple {6568#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6568#true} is VALID [2018-11-23 12:26:17,936 INFO L273 TraceCheckUtils]: 2: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:26:17,936 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6568#true} {6568#true} #66#return; {6568#true} is VALID [2018-11-23 12:26:17,936 INFO L256 TraceCheckUtils]: 4: Hoare triple {6568#true} call #t~ret13 := main(); {6568#true} is VALID [2018-11-23 12:26:17,937 INFO L273 TraceCheckUtils]: 5: Hoare triple {6568#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {6570#(= main_~i~1 0)} is VALID [2018-11-23 12:26:17,937 INFO L273 TraceCheckUtils]: 6: Hoare triple {6570#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6570#(= main_~i~1 0)} is VALID [2018-11-23 12:26:17,938 INFO L273 TraceCheckUtils]: 7: Hoare triple {6570#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6571#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:17,938 INFO L273 TraceCheckUtils]: 8: Hoare triple {6571#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6571#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:17,939 INFO L273 TraceCheckUtils]: 9: Hoare triple {6571#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6572#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:17,939 INFO L273 TraceCheckUtils]: 10: Hoare triple {6572#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6572#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:17,939 INFO L273 TraceCheckUtils]: 11: Hoare triple {6572#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6573#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:17,940 INFO L273 TraceCheckUtils]: 12: Hoare triple {6573#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6573#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:17,940 INFO L273 TraceCheckUtils]: 13: Hoare triple {6573#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6574#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:17,941 INFO L273 TraceCheckUtils]: 14: Hoare triple {6574#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6574#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:17,942 INFO L273 TraceCheckUtils]: 15: Hoare triple {6574#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6575#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:17,942 INFO L273 TraceCheckUtils]: 16: Hoare triple {6575#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6575#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:17,943 INFO L273 TraceCheckUtils]: 17: Hoare triple {6575#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6576#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:17,944 INFO L273 TraceCheckUtils]: 18: Hoare triple {6576#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6576#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:17,944 INFO L273 TraceCheckUtils]: 19: Hoare triple {6576#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6577#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:17,945 INFO L273 TraceCheckUtils]: 20: Hoare triple {6577#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6577#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:17,946 INFO L273 TraceCheckUtils]: 21: Hoare triple {6577#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6578#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:17,946 INFO L273 TraceCheckUtils]: 22: Hoare triple {6578#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6578#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:17,947 INFO L273 TraceCheckUtils]: 23: Hoare triple {6578#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6579#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:17,947 INFO L273 TraceCheckUtils]: 24: Hoare triple {6579#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6579#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:17,948 INFO L273 TraceCheckUtils]: 25: Hoare triple {6579#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6580#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:17,949 INFO L273 TraceCheckUtils]: 26: Hoare triple {6580#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6580#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:17,949 INFO L273 TraceCheckUtils]: 27: Hoare triple {6580#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6581#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:17,950 INFO L273 TraceCheckUtils]: 28: Hoare triple {6581#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6581#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:17,951 INFO L273 TraceCheckUtils]: 29: Hoare triple {6581#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6582#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:17,951 INFO L273 TraceCheckUtils]: 30: Hoare triple {6582#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6582#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:17,952 INFO L273 TraceCheckUtils]: 31: Hoare triple {6582#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6583#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:17,953 INFO L273 TraceCheckUtils]: 32: Hoare triple {6583#(<= main_~i~1 13)} assume !(~i~1 < 100000); {6569#false} is VALID [2018-11-23 12:26:17,953 INFO L256 TraceCheckUtils]: 33: Hoare triple {6569#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {6568#true} is VALID [2018-11-23 12:26:17,953 INFO L273 TraceCheckUtils]: 34: Hoare triple {6568#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {6568#true} is VALID [2018-11-23 12:26:17,953 INFO L273 TraceCheckUtils]: 35: Hoare triple {6568#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:26:17,953 INFO L273 TraceCheckUtils]: 36: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:26:17,954 INFO L273 TraceCheckUtils]: 37: Hoare triple {6568#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:26:17,954 INFO L273 TraceCheckUtils]: 38: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:26:17,954 INFO L273 TraceCheckUtils]: 39: Hoare triple {6568#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:26:17,954 INFO L273 TraceCheckUtils]: 40: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:26:17,954 INFO L273 TraceCheckUtils]: 41: Hoare triple {6568#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:26:17,955 INFO L273 TraceCheckUtils]: 42: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:26:17,955 INFO L273 TraceCheckUtils]: 43: Hoare triple {6568#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:26:17,955 INFO L273 TraceCheckUtils]: 44: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:26:17,955 INFO L273 TraceCheckUtils]: 45: Hoare triple {6568#true} assume !(~i~0 < 100000); {6568#true} is VALID [2018-11-23 12:26:17,955 INFO L273 TraceCheckUtils]: 46: Hoare triple {6568#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6568#true} is VALID [2018-11-23 12:26:17,956 INFO L273 TraceCheckUtils]: 47: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:26:17,956 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {6568#true} {6569#false} #70#return; {6569#false} is VALID [2018-11-23 12:26:17,956 INFO L273 TraceCheckUtils]: 49: Hoare triple {6569#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {6569#false} is VALID [2018-11-23 12:26:17,956 INFO L256 TraceCheckUtils]: 50: Hoare triple {6569#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {6568#true} is VALID [2018-11-23 12:26:17,956 INFO L273 TraceCheckUtils]: 51: Hoare triple {6568#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {6568#true} is VALID [2018-11-23 12:26:17,956 INFO L273 TraceCheckUtils]: 52: Hoare triple {6568#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:26:17,956 INFO L273 TraceCheckUtils]: 53: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:26:17,957 INFO L273 TraceCheckUtils]: 54: Hoare triple {6568#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:26:17,957 INFO L273 TraceCheckUtils]: 55: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:26:17,957 INFO L273 TraceCheckUtils]: 56: Hoare triple {6568#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:26:17,957 INFO L273 TraceCheckUtils]: 57: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:26:17,957 INFO L273 TraceCheckUtils]: 58: Hoare triple {6568#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:26:17,957 INFO L273 TraceCheckUtils]: 59: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:26:17,957 INFO L273 TraceCheckUtils]: 60: Hoare triple {6568#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:26:17,957 INFO L273 TraceCheckUtils]: 61: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:26:17,957 INFO L273 TraceCheckUtils]: 62: Hoare triple {6568#true} assume !(~i~0 < 100000); {6568#true} is VALID [2018-11-23 12:26:17,958 INFO L273 TraceCheckUtils]: 63: Hoare triple {6568#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6568#true} is VALID [2018-11-23 12:26:17,958 INFO L273 TraceCheckUtils]: 64: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:26:17,958 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {6568#true} {6569#false} #72#return; {6569#false} is VALID [2018-11-23 12:26:17,958 INFO L273 TraceCheckUtils]: 66: Hoare triple {6569#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {6569#false} is VALID [2018-11-23 12:26:17,958 INFO L273 TraceCheckUtils]: 67: Hoare triple {6569#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {6569#false} is VALID [2018-11-23 12:26:17,958 INFO L273 TraceCheckUtils]: 68: Hoare triple {6569#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {6569#false} is VALID [2018-11-23 12:26:17,958 INFO L273 TraceCheckUtils]: 69: Hoare triple {6569#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {6569#false} is VALID [2018-11-23 12:26:17,958 INFO L273 TraceCheckUtils]: 70: Hoare triple {6569#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {6569#false} is VALID [2018-11-23 12:26:17,958 INFO L273 TraceCheckUtils]: 71: Hoare triple {6569#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {6569#false} is VALID [2018-11-23 12:26:17,959 INFO L273 TraceCheckUtils]: 72: Hoare triple {6569#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {6569#false} is VALID [2018-11-23 12:26:17,959 INFO L273 TraceCheckUtils]: 73: Hoare triple {6569#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {6569#false} is VALID [2018-11-23 12:26:17,959 INFO L273 TraceCheckUtils]: 74: Hoare triple {6569#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {6569#false} is VALID [2018-11-23 12:26:17,959 INFO L273 TraceCheckUtils]: 75: Hoare triple {6569#false} assume !(~i~2 < 99999); {6569#false} is VALID [2018-11-23 12:26:17,959 INFO L273 TraceCheckUtils]: 76: Hoare triple {6569#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {6569#false} is VALID [2018-11-23 12:26:17,959 INFO L256 TraceCheckUtils]: 77: Hoare triple {6569#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {6568#true} is VALID [2018-11-23 12:26:17,959 INFO L273 TraceCheckUtils]: 78: Hoare triple {6568#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {6568#true} is VALID [2018-11-23 12:26:17,959 INFO L273 TraceCheckUtils]: 79: Hoare triple {6568#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:26:17,960 INFO L273 TraceCheckUtils]: 80: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:26:17,960 INFO L273 TraceCheckUtils]: 81: Hoare triple {6568#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:26:17,960 INFO L273 TraceCheckUtils]: 82: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:26:17,960 INFO L273 TraceCheckUtils]: 83: Hoare triple {6568#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:26:17,960 INFO L273 TraceCheckUtils]: 84: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:26:17,960 INFO L273 TraceCheckUtils]: 85: Hoare triple {6568#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:26:17,960 INFO L273 TraceCheckUtils]: 86: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:26:17,960 INFO L273 TraceCheckUtils]: 87: Hoare triple {6568#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:26:17,960 INFO L273 TraceCheckUtils]: 88: Hoare triple {6568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6568#true} is VALID [2018-11-23 12:26:17,961 INFO L273 TraceCheckUtils]: 89: Hoare triple {6568#true} assume !(~i~0 < 100000); {6568#true} is VALID [2018-11-23 12:26:17,961 INFO L273 TraceCheckUtils]: 90: Hoare triple {6568#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6568#true} is VALID [2018-11-23 12:26:17,961 INFO L273 TraceCheckUtils]: 91: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:26:17,961 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {6568#true} {6569#false} #74#return; {6569#false} is VALID [2018-11-23 12:26:17,961 INFO L273 TraceCheckUtils]: 93: Hoare triple {6569#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {6569#false} is VALID [2018-11-23 12:26:17,961 INFO L273 TraceCheckUtils]: 94: Hoare triple {6569#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {6569#false} is VALID [2018-11-23 12:26:17,961 INFO L273 TraceCheckUtils]: 95: Hoare triple {6569#false} assume !false; {6569#false} is VALID [2018-11-23 12:26:17,965 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2018-11-23 12:26:17,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:17,966 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:17,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:26:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:18,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:18,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:18,380 INFO L256 TraceCheckUtils]: 0: Hoare triple {6568#true} call ULTIMATE.init(); {6568#true} is VALID [2018-11-23 12:26:18,381 INFO L273 TraceCheckUtils]: 1: Hoare triple {6568#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6568#true} is VALID [2018-11-23 12:26:18,381 INFO L273 TraceCheckUtils]: 2: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:26:18,381 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6568#true} {6568#true} #66#return; {6568#true} is VALID [2018-11-23 12:26:18,381 INFO L256 TraceCheckUtils]: 4: Hoare triple {6568#true} call #t~ret13 := main(); {6568#true} is VALID [2018-11-23 12:26:18,382 INFO L273 TraceCheckUtils]: 5: Hoare triple {6568#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {6602#(<= main_~i~1 0)} is VALID [2018-11-23 12:26:18,383 INFO L273 TraceCheckUtils]: 6: Hoare triple {6602#(<= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6602#(<= main_~i~1 0)} is VALID [2018-11-23 12:26:18,384 INFO L273 TraceCheckUtils]: 7: Hoare triple {6602#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6571#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:18,384 INFO L273 TraceCheckUtils]: 8: Hoare triple {6571#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6571#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:18,385 INFO L273 TraceCheckUtils]: 9: Hoare triple {6571#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6572#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:18,386 INFO L273 TraceCheckUtils]: 10: Hoare triple {6572#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6572#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:18,387 INFO L273 TraceCheckUtils]: 11: Hoare triple {6572#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6573#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:18,387 INFO L273 TraceCheckUtils]: 12: Hoare triple {6573#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6573#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:18,388 INFO L273 TraceCheckUtils]: 13: Hoare triple {6573#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6574#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:18,389 INFO L273 TraceCheckUtils]: 14: Hoare triple {6574#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6574#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:18,390 INFO L273 TraceCheckUtils]: 15: Hoare triple {6574#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6575#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:18,390 INFO L273 TraceCheckUtils]: 16: Hoare triple {6575#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6575#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:18,391 INFO L273 TraceCheckUtils]: 17: Hoare triple {6575#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6576#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:18,392 INFO L273 TraceCheckUtils]: 18: Hoare triple {6576#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6576#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:18,393 INFO L273 TraceCheckUtils]: 19: Hoare triple {6576#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6577#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:18,393 INFO L273 TraceCheckUtils]: 20: Hoare triple {6577#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6577#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:18,394 INFO L273 TraceCheckUtils]: 21: Hoare triple {6577#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6578#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:18,395 INFO L273 TraceCheckUtils]: 22: Hoare triple {6578#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6578#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:18,396 INFO L273 TraceCheckUtils]: 23: Hoare triple {6578#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6579#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:18,396 INFO L273 TraceCheckUtils]: 24: Hoare triple {6579#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6579#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:18,397 INFO L273 TraceCheckUtils]: 25: Hoare triple {6579#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6580#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:18,398 INFO L273 TraceCheckUtils]: 26: Hoare triple {6580#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6580#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:18,399 INFO L273 TraceCheckUtils]: 27: Hoare triple {6580#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6581#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:18,399 INFO L273 TraceCheckUtils]: 28: Hoare triple {6581#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6581#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:18,400 INFO L273 TraceCheckUtils]: 29: Hoare triple {6581#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6582#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:18,401 INFO L273 TraceCheckUtils]: 30: Hoare triple {6582#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {6582#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:18,402 INFO L273 TraceCheckUtils]: 31: Hoare triple {6582#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {6583#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:18,402 INFO L273 TraceCheckUtils]: 32: Hoare triple {6583#(<= main_~i~1 13)} assume !(~i~1 < 100000); {6569#false} is VALID [2018-11-23 12:26:18,403 INFO L256 TraceCheckUtils]: 33: Hoare triple {6569#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {6569#false} is VALID [2018-11-23 12:26:18,403 INFO L273 TraceCheckUtils]: 34: Hoare triple {6569#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {6569#false} is VALID [2018-11-23 12:26:18,403 INFO L273 TraceCheckUtils]: 35: Hoare triple {6569#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:26:18,404 INFO L273 TraceCheckUtils]: 36: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:26:18,404 INFO L273 TraceCheckUtils]: 37: Hoare triple {6569#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:26:18,404 INFO L273 TraceCheckUtils]: 38: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:26:18,404 INFO L273 TraceCheckUtils]: 39: Hoare triple {6569#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:26:18,405 INFO L273 TraceCheckUtils]: 40: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:26:18,405 INFO L273 TraceCheckUtils]: 41: Hoare triple {6569#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:26:18,405 INFO L273 TraceCheckUtils]: 42: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:26:18,405 INFO L273 TraceCheckUtils]: 43: Hoare triple {6569#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:26:18,406 INFO L273 TraceCheckUtils]: 44: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:26:18,406 INFO L273 TraceCheckUtils]: 45: Hoare triple {6569#false} assume !(~i~0 < 100000); {6569#false} is VALID [2018-11-23 12:26:18,406 INFO L273 TraceCheckUtils]: 46: Hoare triple {6569#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6569#false} is VALID [2018-11-23 12:26:18,406 INFO L273 TraceCheckUtils]: 47: Hoare triple {6569#false} assume true; {6569#false} is VALID [2018-11-23 12:26:18,407 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {6569#false} {6569#false} #70#return; {6569#false} is VALID [2018-11-23 12:26:18,407 INFO L273 TraceCheckUtils]: 49: Hoare triple {6569#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {6569#false} is VALID [2018-11-23 12:26:18,407 INFO L256 TraceCheckUtils]: 50: Hoare triple {6569#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {6569#false} is VALID [2018-11-23 12:26:18,407 INFO L273 TraceCheckUtils]: 51: Hoare triple {6569#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {6569#false} is VALID [2018-11-23 12:26:18,408 INFO L273 TraceCheckUtils]: 52: Hoare triple {6569#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:26:18,408 INFO L273 TraceCheckUtils]: 53: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:26:18,408 INFO L273 TraceCheckUtils]: 54: Hoare triple {6569#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:26:18,408 INFO L273 TraceCheckUtils]: 55: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:26:18,408 INFO L273 TraceCheckUtils]: 56: Hoare triple {6569#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:26:18,408 INFO L273 TraceCheckUtils]: 57: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:26:18,408 INFO L273 TraceCheckUtils]: 58: Hoare triple {6569#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:26:18,409 INFO L273 TraceCheckUtils]: 59: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:26:18,409 INFO L273 TraceCheckUtils]: 60: Hoare triple {6569#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:26:18,409 INFO L273 TraceCheckUtils]: 61: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:26:18,409 INFO L273 TraceCheckUtils]: 62: Hoare triple {6569#false} assume !(~i~0 < 100000); {6569#false} is VALID [2018-11-23 12:26:18,409 INFO L273 TraceCheckUtils]: 63: Hoare triple {6569#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6569#false} is VALID [2018-11-23 12:26:18,409 INFO L273 TraceCheckUtils]: 64: Hoare triple {6569#false} assume true; {6569#false} is VALID [2018-11-23 12:26:18,409 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {6569#false} {6569#false} #72#return; {6569#false} is VALID [2018-11-23 12:26:18,410 INFO L273 TraceCheckUtils]: 66: Hoare triple {6569#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {6569#false} is VALID [2018-11-23 12:26:18,410 INFO L273 TraceCheckUtils]: 67: Hoare triple {6569#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {6569#false} is VALID [2018-11-23 12:26:18,410 INFO L273 TraceCheckUtils]: 68: Hoare triple {6569#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {6569#false} is VALID [2018-11-23 12:26:18,410 INFO L273 TraceCheckUtils]: 69: Hoare triple {6569#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {6569#false} is VALID [2018-11-23 12:26:18,410 INFO L273 TraceCheckUtils]: 70: Hoare triple {6569#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {6569#false} is VALID [2018-11-23 12:26:18,410 INFO L273 TraceCheckUtils]: 71: Hoare triple {6569#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {6569#false} is VALID [2018-11-23 12:26:18,411 INFO L273 TraceCheckUtils]: 72: Hoare triple {6569#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {6569#false} is VALID [2018-11-23 12:26:18,411 INFO L273 TraceCheckUtils]: 73: Hoare triple {6569#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {6569#false} is VALID [2018-11-23 12:26:18,411 INFO L273 TraceCheckUtils]: 74: Hoare triple {6569#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {6569#false} is VALID [2018-11-23 12:26:18,411 INFO L273 TraceCheckUtils]: 75: Hoare triple {6569#false} assume !(~i~2 < 99999); {6569#false} is VALID [2018-11-23 12:26:18,411 INFO L273 TraceCheckUtils]: 76: Hoare triple {6569#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {6569#false} is VALID [2018-11-23 12:26:18,411 INFO L256 TraceCheckUtils]: 77: Hoare triple {6569#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {6569#false} is VALID [2018-11-23 12:26:18,411 INFO L273 TraceCheckUtils]: 78: Hoare triple {6569#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {6569#false} is VALID [2018-11-23 12:26:18,412 INFO L273 TraceCheckUtils]: 79: Hoare triple {6569#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:26:18,412 INFO L273 TraceCheckUtils]: 80: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:26:18,412 INFO L273 TraceCheckUtils]: 81: Hoare triple {6569#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:26:18,412 INFO L273 TraceCheckUtils]: 82: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:26:18,412 INFO L273 TraceCheckUtils]: 83: Hoare triple {6569#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:26:18,412 INFO L273 TraceCheckUtils]: 84: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:26:18,412 INFO L273 TraceCheckUtils]: 85: Hoare triple {6569#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:26:18,413 INFO L273 TraceCheckUtils]: 86: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:26:18,413 INFO L273 TraceCheckUtils]: 87: Hoare triple {6569#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:26:18,413 INFO L273 TraceCheckUtils]: 88: Hoare triple {6569#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6569#false} is VALID [2018-11-23 12:26:18,413 INFO L273 TraceCheckUtils]: 89: Hoare triple {6569#false} assume !(~i~0 < 100000); {6569#false} is VALID [2018-11-23 12:26:18,413 INFO L273 TraceCheckUtils]: 90: Hoare triple {6569#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6569#false} is VALID [2018-11-23 12:26:18,413 INFO L273 TraceCheckUtils]: 91: Hoare triple {6569#false} assume true; {6569#false} is VALID [2018-11-23 12:26:18,414 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {6569#false} {6569#false} #74#return; {6569#false} is VALID [2018-11-23 12:26:18,414 INFO L273 TraceCheckUtils]: 93: Hoare triple {6569#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {6569#false} is VALID [2018-11-23 12:26:18,414 INFO L273 TraceCheckUtils]: 94: Hoare triple {6569#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {6569#false} is VALID [2018-11-23 12:26:18,414 INFO L273 TraceCheckUtils]: 95: Hoare triple {6569#false} assume !false; {6569#false} is VALID [2018-11-23 12:26:18,423 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2018-11-23 12:26:18,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:18,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 12:26:18,443 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2018-11-23 12:26:18,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:18,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:26:18,532 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:18,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:26:18,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:26:18,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:26:18,533 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 17 states. [2018-11-23 12:26:19,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:19,215 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2018-11-23 12:26:19,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:26:19,215 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2018-11-23 12:26:19,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:19,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:26:19,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 80 transitions. [2018-11-23 12:26:19,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:26:19,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 80 transitions. [2018-11-23 12:26:19,218 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 80 transitions. [2018-11-23 12:26:19,325 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:19,327 INFO L225 Difference]: With dead ends: 104 [2018-11-23 12:26:19,328 INFO L226 Difference]: Without dead ends: 70 [2018-11-23 12:26:19,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:26:19,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-23 12:26:19,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-11-23 12:26:19,363 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:19,363 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 69 states. [2018-11-23 12:26:19,363 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 69 states. [2018-11-23 12:26:19,363 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 69 states. [2018-11-23 12:26:19,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:19,366 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-11-23 12:26:19,366 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-11-23 12:26:19,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:19,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:19,367 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 70 states. [2018-11-23 12:26:19,367 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 70 states. [2018-11-23 12:26:19,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:19,368 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-11-23 12:26:19,369 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-11-23 12:26:19,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:19,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:19,369 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:19,369 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:19,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 12:26:19,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-11-23 12:26:19,371 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 96 [2018-11-23 12:26:19,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:19,371 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-11-23 12:26:19,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:26:19,371 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-23 12:26:19,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-23 12:26:19,372 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:19,373 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:26:19,373 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:19,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:19,373 INFO L82 PathProgramCache]: Analyzing trace with hash 737731925, now seen corresponding path program 14 times [2018-11-23 12:26:19,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:19,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:19,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:19,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:26:19,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:19,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:19,759 INFO L256 TraceCheckUtils]: 0: Hoare triple {7268#true} call ULTIMATE.init(); {7268#true} is VALID [2018-11-23 12:26:19,759 INFO L273 TraceCheckUtils]: 1: Hoare triple {7268#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7268#true} is VALID [2018-11-23 12:26:19,760 INFO L273 TraceCheckUtils]: 2: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:26:19,760 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7268#true} {7268#true} #66#return; {7268#true} is VALID [2018-11-23 12:26:19,760 INFO L256 TraceCheckUtils]: 4: Hoare triple {7268#true} call #t~ret13 := main(); {7268#true} is VALID [2018-11-23 12:26:19,761 INFO L273 TraceCheckUtils]: 5: Hoare triple {7268#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {7270#(= main_~i~1 0)} is VALID [2018-11-23 12:26:19,761 INFO L273 TraceCheckUtils]: 6: Hoare triple {7270#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7270#(= main_~i~1 0)} is VALID [2018-11-23 12:26:19,762 INFO L273 TraceCheckUtils]: 7: Hoare triple {7270#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7271#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:19,763 INFO L273 TraceCheckUtils]: 8: Hoare triple {7271#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7271#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:19,763 INFO L273 TraceCheckUtils]: 9: Hoare triple {7271#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7272#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:19,764 INFO L273 TraceCheckUtils]: 10: Hoare triple {7272#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7272#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:19,764 INFO L273 TraceCheckUtils]: 11: Hoare triple {7272#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7273#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:19,764 INFO L273 TraceCheckUtils]: 12: Hoare triple {7273#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7273#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:19,765 INFO L273 TraceCheckUtils]: 13: Hoare triple {7273#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7274#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:19,765 INFO L273 TraceCheckUtils]: 14: Hoare triple {7274#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7274#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:19,766 INFO L273 TraceCheckUtils]: 15: Hoare triple {7274#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7275#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:19,766 INFO L273 TraceCheckUtils]: 16: Hoare triple {7275#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7275#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:19,767 INFO L273 TraceCheckUtils]: 17: Hoare triple {7275#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7276#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:19,768 INFO L273 TraceCheckUtils]: 18: Hoare triple {7276#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7276#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:19,768 INFO L273 TraceCheckUtils]: 19: Hoare triple {7276#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7277#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:19,769 INFO L273 TraceCheckUtils]: 20: Hoare triple {7277#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7277#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:19,770 INFO L273 TraceCheckUtils]: 21: Hoare triple {7277#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7278#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:19,770 INFO L273 TraceCheckUtils]: 22: Hoare triple {7278#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7278#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:19,771 INFO L273 TraceCheckUtils]: 23: Hoare triple {7278#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7279#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:19,771 INFO L273 TraceCheckUtils]: 24: Hoare triple {7279#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7279#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:19,772 INFO L273 TraceCheckUtils]: 25: Hoare triple {7279#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7280#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:19,773 INFO L273 TraceCheckUtils]: 26: Hoare triple {7280#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7280#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:19,773 INFO L273 TraceCheckUtils]: 27: Hoare triple {7280#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7281#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:19,774 INFO L273 TraceCheckUtils]: 28: Hoare triple {7281#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7281#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:19,774 INFO L273 TraceCheckUtils]: 29: Hoare triple {7281#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7282#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:19,775 INFO L273 TraceCheckUtils]: 30: Hoare triple {7282#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7282#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:19,776 INFO L273 TraceCheckUtils]: 31: Hoare triple {7282#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7283#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:19,776 INFO L273 TraceCheckUtils]: 32: Hoare triple {7283#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7283#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:19,777 INFO L273 TraceCheckUtils]: 33: Hoare triple {7283#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7284#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:19,778 INFO L273 TraceCheckUtils]: 34: Hoare triple {7284#(<= main_~i~1 14)} assume !(~i~1 < 100000); {7269#false} is VALID [2018-11-23 12:26:19,778 INFO L256 TraceCheckUtils]: 35: Hoare triple {7269#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {7268#true} is VALID [2018-11-23 12:26:19,778 INFO L273 TraceCheckUtils]: 36: Hoare triple {7268#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7268#true} is VALID [2018-11-23 12:26:19,778 INFO L273 TraceCheckUtils]: 37: Hoare triple {7268#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:26:19,779 INFO L273 TraceCheckUtils]: 38: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:26:19,779 INFO L273 TraceCheckUtils]: 39: Hoare triple {7268#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:26:19,779 INFO L273 TraceCheckUtils]: 40: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:26:19,779 INFO L273 TraceCheckUtils]: 41: Hoare triple {7268#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:26:19,779 INFO L273 TraceCheckUtils]: 42: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:26:19,780 INFO L273 TraceCheckUtils]: 43: Hoare triple {7268#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:26:19,780 INFO L273 TraceCheckUtils]: 44: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:26:19,780 INFO L273 TraceCheckUtils]: 45: Hoare triple {7268#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:26:19,780 INFO L273 TraceCheckUtils]: 46: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:26:19,780 INFO L273 TraceCheckUtils]: 47: Hoare triple {7268#true} assume !(~i~0 < 100000); {7268#true} is VALID [2018-11-23 12:26:19,781 INFO L273 TraceCheckUtils]: 48: Hoare triple {7268#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7268#true} is VALID [2018-11-23 12:26:19,781 INFO L273 TraceCheckUtils]: 49: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:26:19,781 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {7268#true} {7269#false} #70#return; {7269#false} is VALID [2018-11-23 12:26:19,781 INFO L273 TraceCheckUtils]: 51: Hoare triple {7269#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {7269#false} is VALID [2018-11-23 12:26:19,781 INFO L256 TraceCheckUtils]: 52: Hoare triple {7269#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {7268#true} is VALID [2018-11-23 12:26:19,782 INFO L273 TraceCheckUtils]: 53: Hoare triple {7268#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7268#true} is VALID [2018-11-23 12:26:19,782 INFO L273 TraceCheckUtils]: 54: Hoare triple {7268#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:26:19,782 INFO L273 TraceCheckUtils]: 55: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:26:19,782 INFO L273 TraceCheckUtils]: 56: Hoare triple {7268#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:26:19,782 INFO L273 TraceCheckUtils]: 57: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:26:19,783 INFO L273 TraceCheckUtils]: 58: Hoare triple {7268#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:26:19,783 INFO L273 TraceCheckUtils]: 59: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:26:19,783 INFO L273 TraceCheckUtils]: 60: Hoare triple {7268#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:26:19,783 INFO L273 TraceCheckUtils]: 61: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:26:19,783 INFO L273 TraceCheckUtils]: 62: Hoare triple {7268#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:26:19,783 INFO L273 TraceCheckUtils]: 63: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:26:19,783 INFO L273 TraceCheckUtils]: 64: Hoare triple {7268#true} assume !(~i~0 < 100000); {7268#true} is VALID [2018-11-23 12:26:19,784 INFO L273 TraceCheckUtils]: 65: Hoare triple {7268#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7268#true} is VALID [2018-11-23 12:26:19,784 INFO L273 TraceCheckUtils]: 66: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:26:19,784 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {7268#true} {7269#false} #72#return; {7269#false} is VALID [2018-11-23 12:26:19,784 INFO L273 TraceCheckUtils]: 68: Hoare triple {7269#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {7269#false} is VALID [2018-11-23 12:26:19,784 INFO L273 TraceCheckUtils]: 69: Hoare triple {7269#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7269#false} is VALID [2018-11-23 12:26:19,784 INFO L273 TraceCheckUtils]: 70: Hoare triple {7269#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7269#false} is VALID [2018-11-23 12:26:19,784 INFO L273 TraceCheckUtils]: 71: Hoare triple {7269#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7269#false} is VALID [2018-11-23 12:26:19,784 INFO L273 TraceCheckUtils]: 72: Hoare triple {7269#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7269#false} is VALID [2018-11-23 12:26:19,785 INFO L273 TraceCheckUtils]: 73: Hoare triple {7269#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7269#false} is VALID [2018-11-23 12:26:19,785 INFO L273 TraceCheckUtils]: 74: Hoare triple {7269#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7269#false} is VALID [2018-11-23 12:26:19,785 INFO L273 TraceCheckUtils]: 75: Hoare triple {7269#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7269#false} is VALID [2018-11-23 12:26:19,785 INFO L273 TraceCheckUtils]: 76: Hoare triple {7269#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7269#false} is VALID [2018-11-23 12:26:19,785 INFO L273 TraceCheckUtils]: 77: Hoare triple {7269#false} assume !(~i~2 < 99999); {7269#false} is VALID [2018-11-23 12:26:19,785 INFO L273 TraceCheckUtils]: 78: Hoare triple {7269#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {7269#false} is VALID [2018-11-23 12:26:19,785 INFO L256 TraceCheckUtils]: 79: Hoare triple {7269#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {7268#true} is VALID [2018-11-23 12:26:19,785 INFO L273 TraceCheckUtils]: 80: Hoare triple {7268#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7268#true} is VALID [2018-11-23 12:26:19,786 INFO L273 TraceCheckUtils]: 81: Hoare triple {7268#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:26:19,786 INFO L273 TraceCheckUtils]: 82: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:26:19,786 INFO L273 TraceCheckUtils]: 83: Hoare triple {7268#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:26:19,786 INFO L273 TraceCheckUtils]: 84: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:26:19,786 INFO L273 TraceCheckUtils]: 85: Hoare triple {7268#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:26:19,786 INFO L273 TraceCheckUtils]: 86: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:26:19,786 INFO L273 TraceCheckUtils]: 87: Hoare triple {7268#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:26:19,786 INFO L273 TraceCheckUtils]: 88: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:26:19,786 INFO L273 TraceCheckUtils]: 89: Hoare triple {7268#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:26:19,787 INFO L273 TraceCheckUtils]: 90: Hoare triple {7268#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7268#true} is VALID [2018-11-23 12:26:19,787 INFO L273 TraceCheckUtils]: 91: Hoare triple {7268#true} assume !(~i~0 < 100000); {7268#true} is VALID [2018-11-23 12:26:19,787 INFO L273 TraceCheckUtils]: 92: Hoare triple {7268#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7268#true} is VALID [2018-11-23 12:26:19,787 INFO L273 TraceCheckUtils]: 93: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:26:19,787 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {7268#true} {7269#false} #74#return; {7269#false} is VALID [2018-11-23 12:26:19,787 INFO L273 TraceCheckUtils]: 95: Hoare triple {7269#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {7269#false} is VALID [2018-11-23 12:26:19,787 INFO L273 TraceCheckUtils]: 96: Hoare triple {7269#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {7269#false} is VALID [2018-11-23 12:26:19,787 INFO L273 TraceCheckUtils]: 97: Hoare triple {7269#false} assume !false; {7269#false} is VALID [2018-11-23 12:26:19,792 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2018-11-23 12:26:19,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:19,792 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:19,801 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:26:19,849 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:26:19,849 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:19,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:19,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:20,113 INFO L256 TraceCheckUtils]: 0: Hoare triple {7268#true} call ULTIMATE.init(); {7268#true} is VALID [2018-11-23 12:26:20,113 INFO L273 TraceCheckUtils]: 1: Hoare triple {7268#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7268#true} is VALID [2018-11-23 12:26:20,114 INFO L273 TraceCheckUtils]: 2: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:26:20,114 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7268#true} {7268#true} #66#return; {7268#true} is VALID [2018-11-23 12:26:20,114 INFO L256 TraceCheckUtils]: 4: Hoare triple {7268#true} call #t~ret13 := main(); {7268#true} is VALID [2018-11-23 12:26:20,115 INFO L273 TraceCheckUtils]: 5: Hoare triple {7268#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {7303#(<= main_~i~1 0)} is VALID [2018-11-23 12:26:20,115 INFO L273 TraceCheckUtils]: 6: Hoare triple {7303#(<= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7303#(<= main_~i~1 0)} is VALID [2018-11-23 12:26:20,116 INFO L273 TraceCheckUtils]: 7: Hoare triple {7303#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7271#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:20,116 INFO L273 TraceCheckUtils]: 8: Hoare triple {7271#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7271#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:20,117 INFO L273 TraceCheckUtils]: 9: Hoare triple {7271#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7272#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:20,117 INFO L273 TraceCheckUtils]: 10: Hoare triple {7272#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7272#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:20,118 INFO L273 TraceCheckUtils]: 11: Hoare triple {7272#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7273#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:20,118 INFO L273 TraceCheckUtils]: 12: Hoare triple {7273#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7273#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:20,119 INFO L273 TraceCheckUtils]: 13: Hoare triple {7273#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7274#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:20,119 INFO L273 TraceCheckUtils]: 14: Hoare triple {7274#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7274#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:20,120 INFO L273 TraceCheckUtils]: 15: Hoare triple {7274#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7275#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:20,121 INFO L273 TraceCheckUtils]: 16: Hoare triple {7275#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7275#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:20,121 INFO L273 TraceCheckUtils]: 17: Hoare triple {7275#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7276#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:20,122 INFO L273 TraceCheckUtils]: 18: Hoare triple {7276#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7276#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:20,123 INFO L273 TraceCheckUtils]: 19: Hoare triple {7276#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7277#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:20,123 INFO L273 TraceCheckUtils]: 20: Hoare triple {7277#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7277#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:20,124 INFO L273 TraceCheckUtils]: 21: Hoare triple {7277#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7278#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:20,124 INFO L273 TraceCheckUtils]: 22: Hoare triple {7278#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7278#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:20,125 INFO L273 TraceCheckUtils]: 23: Hoare triple {7278#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7279#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:20,126 INFO L273 TraceCheckUtils]: 24: Hoare triple {7279#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7279#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:20,127 INFO L273 TraceCheckUtils]: 25: Hoare triple {7279#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7280#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:20,127 INFO L273 TraceCheckUtils]: 26: Hoare triple {7280#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7280#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:20,128 INFO L273 TraceCheckUtils]: 27: Hoare triple {7280#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7281#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:20,128 INFO L273 TraceCheckUtils]: 28: Hoare triple {7281#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7281#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:20,129 INFO L273 TraceCheckUtils]: 29: Hoare triple {7281#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7282#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:20,130 INFO L273 TraceCheckUtils]: 30: Hoare triple {7282#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7282#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:20,130 INFO L273 TraceCheckUtils]: 31: Hoare triple {7282#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7283#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:20,131 INFO L273 TraceCheckUtils]: 32: Hoare triple {7283#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7283#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:20,131 INFO L273 TraceCheckUtils]: 33: Hoare triple {7283#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7284#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:20,132 INFO L273 TraceCheckUtils]: 34: Hoare triple {7284#(<= main_~i~1 14)} assume !(~i~1 < 100000); {7269#false} is VALID [2018-11-23 12:26:20,132 INFO L256 TraceCheckUtils]: 35: Hoare triple {7269#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {7269#false} is VALID [2018-11-23 12:26:20,133 INFO L273 TraceCheckUtils]: 36: Hoare triple {7269#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7269#false} is VALID [2018-11-23 12:26:20,133 INFO L273 TraceCheckUtils]: 37: Hoare triple {7269#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:26:20,133 INFO L273 TraceCheckUtils]: 38: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:26:20,133 INFO L273 TraceCheckUtils]: 39: Hoare triple {7269#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:26:20,133 INFO L273 TraceCheckUtils]: 40: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:26:20,133 INFO L273 TraceCheckUtils]: 41: Hoare triple {7269#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:26:20,134 INFO L273 TraceCheckUtils]: 42: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:26:20,134 INFO L273 TraceCheckUtils]: 43: Hoare triple {7269#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:26:20,134 INFO L273 TraceCheckUtils]: 44: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:26:20,134 INFO L273 TraceCheckUtils]: 45: Hoare triple {7269#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:26:20,134 INFO L273 TraceCheckUtils]: 46: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:26:20,135 INFO L273 TraceCheckUtils]: 47: Hoare triple {7269#false} assume !(~i~0 < 100000); {7269#false} is VALID [2018-11-23 12:26:20,135 INFO L273 TraceCheckUtils]: 48: Hoare triple {7269#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7269#false} is VALID [2018-11-23 12:26:20,135 INFO L273 TraceCheckUtils]: 49: Hoare triple {7269#false} assume true; {7269#false} is VALID [2018-11-23 12:26:20,135 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {7269#false} {7269#false} #70#return; {7269#false} is VALID [2018-11-23 12:26:20,135 INFO L273 TraceCheckUtils]: 51: Hoare triple {7269#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {7269#false} is VALID [2018-11-23 12:26:20,135 INFO L256 TraceCheckUtils]: 52: Hoare triple {7269#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {7269#false} is VALID [2018-11-23 12:26:20,135 INFO L273 TraceCheckUtils]: 53: Hoare triple {7269#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7269#false} is VALID [2018-11-23 12:26:20,136 INFO L273 TraceCheckUtils]: 54: Hoare triple {7269#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:26:20,136 INFO L273 TraceCheckUtils]: 55: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:26:20,136 INFO L273 TraceCheckUtils]: 56: Hoare triple {7269#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:26:20,136 INFO L273 TraceCheckUtils]: 57: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:26:20,136 INFO L273 TraceCheckUtils]: 58: Hoare triple {7269#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:26:20,136 INFO L273 TraceCheckUtils]: 59: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:26:20,136 INFO L273 TraceCheckUtils]: 60: Hoare triple {7269#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:26:20,136 INFO L273 TraceCheckUtils]: 61: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:26:20,136 INFO L273 TraceCheckUtils]: 62: Hoare triple {7269#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:26:20,137 INFO L273 TraceCheckUtils]: 63: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:26:20,137 INFO L273 TraceCheckUtils]: 64: Hoare triple {7269#false} assume !(~i~0 < 100000); {7269#false} is VALID [2018-11-23 12:26:20,137 INFO L273 TraceCheckUtils]: 65: Hoare triple {7269#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7269#false} is VALID [2018-11-23 12:26:20,137 INFO L273 TraceCheckUtils]: 66: Hoare triple {7269#false} assume true; {7269#false} is VALID [2018-11-23 12:26:20,137 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {7269#false} {7269#false} #72#return; {7269#false} is VALID [2018-11-23 12:26:20,137 INFO L273 TraceCheckUtils]: 68: Hoare triple {7269#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {7269#false} is VALID [2018-11-23 12:26:20,137 INFO L273 TraceCheckUtils]: 69: Hoare triple {7269#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7269#false} is VALID [2018-11-23 12:26:20,137 INFO L273 TraceCheckUtils]: 70: Hoare triple {7269#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7269#false} is VALID [2018-11-23 12:26:20,138 INFO L273 TraceCheckUtils]: 71: Hoare triple {7269#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7269#false} is VALID [2018-11-23 12:26:20,138 INFO L273 TraceCheckUtils]: 72: Hoare triple {7269#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7269#false} is VALID [2018-11-23 12:26:20,138 INFO L273 TraceCheckUtils]: 73: Hoare triple {7269#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7269#false} is VALID [2018-11-23 12:26:20,138 INFO L273 TraceCheckUtils]: 74: Hoare triple {7269#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7269#false} is VALID [2018-11-23 12:26:20,138 INFO L273 TraceCheckUtils]: 75: Hoare triple {7269#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7269#false} is VALID [2018-11-23 12:26:20,138 INFO L273 TraceCheckUtils]: 76: Hoare triple {7269#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7269#false} is VALID [2018-11-23 12:26:20,138 INFO L273 TraceCheckUtils]: 77: Hoare triple {7269#false} assume !(~i~2 < 99999); {7269#false} is VALID [2018-11-23 12:26:20,138 INFO L273 TraceCheckUtils]: 78: Hoare triple {7269#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {7269#false} is VALID [2018-11-23 12:26:20,138 INFO L256 TraceCheckUtils]: 79: Hoare triple {7269#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {7269#false} is VALID [2018-11-23 12:26:20,139 INFO L273 TraceCheckUtils]: 80: Hoare triple {7269#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7269#false} is VALID [2018-11-23 12:26:20,139 INFO L273 TraceCheckUtils]: 81: Hoare triple {7269#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:26:20,139 INFO L273 TraceCheckUtils]: 82: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:26:20,139 INFO L273 TraceCheckUtils]: 83: Hoare triple {7269#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:26:20,139 INFO L273 TraceCheckUtils]: 84: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:26:20,139 INFO L273 TraceCheckUtils]: 85: Hoare triple {7269#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:26:20,139 INFO L273 TraceCheckUtils]: 86: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:26:20,139 INFO L273 TraceCheckUtils]: 87: Hoare triple {7269#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:26:20,139 INFO L273 TraceCheckUtils]: 88: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:26:20,140 INFO L273 TraceCheckUtils]: 89: Hoare triple {7269#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:26:20,140 INFO L273 TraceCheckUtils]: 90: Hoare triple {7269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7269#false} is VALID [2018-11-23 12:26:20,140 INFO L273 TraceCheckUtils]: 91: Hoare triple {7269#false} assume !(~i~0 < 100000); {7269#false} is VALID [2018-11-23 12:26:20,140 INFO L273 TraceCheckUtils]: 92: Hoare triple {7269#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7269#false} is VALID [2018-11-23 12:26:20,140 INFO L273 TraceCheckUtils]: 93: Hoare triple {7269#false} assume true; {7269#false} is VALID [2018-11-23 12:26:20,140 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {7269#false} {7269#false} #74#return; {7269#false} is VALID [2018-11-23 12:26:20,140 INFO L273 TraceCheckUtils]: 95: Hoare triple {7269#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {7269#false} is VALID [2018-11-23 12:26:20,140 INFO L273 TraceCheckUtils]: 96: Hoare triple {7269#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {7269#false} is VALID [2018-11-23 12:26:20,141 INFO L273 TraceCheckUtils]: 97: Hoare triple {7269#false} assume !false; {7269#false} is VALID [2018-11-23 12:26:20,145 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2018-11-23 12:26:20,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:20,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 12:26:20,165 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 98 [2018-11-23 12:26:20,166 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:20,166 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 12:26:20,235 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:20,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 12:26:20,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 12:26:20,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:26:20,236 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 18 states. [2018-11-23 12:26:20,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:20,656 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2018-11-23 12:26:20,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:26:20,656 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 98 [2018-11-23 12:26:20,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:20,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:26:20,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions. [2018-11-23 12:26:20,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:26:20,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions. [2018-11-23 12:26:20,659 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 82 transitions. [2018-11-23 12:26:20,757 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:20,759 INFO L225 Difference]: With dead ends: 106 [2018-11-23 12:26:20,759 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 12:26:20,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:26:20,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 12:26:20,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2018-11-23 12:26:20,790 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:20,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 71 states. [2018-11-23 12:26:20,791 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 71 states. [2018-11-23 12:26:20,791 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 71 states. [2018-11-23 12:26:20,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:20,793 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-11-23 12:26:20,793 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-11-23 12:26:20,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:20,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:20,793 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 72 states. [2018-11-23 12:26:20,794 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 72 states. [2018-11-23 12:26:20,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:20,795 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-11-23 12:26:20,795 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-11-23 12:26:20,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:20,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:20,796 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:20,796 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:20,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-23 12:26:20,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-11-23 12:26:20,798 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 98 [2018-11-23 12:26:20,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:20,798 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-11-23 12:26:20,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 12:26:20,798 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-11-23 12:26:20,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-23 12:26:20,799 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:20,799 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:26:20,800 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:20,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:20,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1296735945, now seen corresponding path program 15 times [2018-11-23 12:26:20,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:20,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:20,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:20,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:20,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:20,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:21,555 INFO L256 TraceCheckUtils]: 0: Hoare triple {7985#true} call ULTIMATE.init(); {7985#true} is VALID [2018-11-23 12:26:21,555 INFO L273 TraceCheckUtils]: 1: Hoare triple {7985#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7985#true} is VALID [2018-11-23 12:26:21,555 INFO L273 TraceCheckUtils]: 2: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:26:21,556 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7985#true} {7985#true} #66#return; {7985#true} is VALID [2018-11-23 12:26:21,556 INFO L256 TraceCheckUtils]: 4: Hoare triple {7985#true} call #t~ret13 := main(); {7985#true} is VALID [2018-11-23 12:26:21,556 INFO L273 TraceCheckUtils]: 5: Hoare triple {7985#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {7987#(= main_~i~1 0)} is VALID [2018-11-23 12:26:21,556 INFO L273 TraceCheckUtils]: 6: Hoare triple {7987#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7987#(= main_~i~1 0)} is VALID [2018-11-23 12:26:21,557 INFO L273 TraceCheckUtils]: 7: Hoare triple {7987#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7988#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:21,558 INFO L273 TraceCheckUtils]: 8: Hoare triple {7988#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7988#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:21,558 INFO L273 TraceCheckUtils]: 9: Hoare triple {7988#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7989#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:21,559 INFO L273 TraceCheckUtils]: 10: Hoare triple {7989#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7989#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:21,560 INFO L273 TraceCheckUtils]: 11: Hoare triple {7989#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7990#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:21,560 INFO L273 TraceCheckUtils]: 12: Hoare triple {7990#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7990#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:21,561 INFO L273 TraceCheckUtils]: 13: Hoare triple {7990#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7991#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:21,561 INFO L273 TraceCheckUtils]: 14: Hoare triple {7991#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7991#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:21,562 INFO L273 TraceCheckUtils]: 15: Hoare triple {7991#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7992#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:21,563 INFO L273 TraceCheckUtils]: 16: Hoare triple {7992#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7992#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:21,563 INFO L273 TraceCheckUtils]: 17: Hoare triple {7992#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7993#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:21,564 INFO L273 TraceCheckUtils]: 18: Hoare triple {7993#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7993#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:21,565 INFO L273 TraceCheckUtils]: 19: Hoare triple {7993#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7994#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:21,565 INFO L273 TraceCheckUtils]: 20: Hoare triple {7994#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7994#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:21,566 INFO L273 TraceCheckUtils]: 21: Hoare triple {7994#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7995#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:21,567 INFO L273 TraceCheckUtils]: 22: Hoare triple {7995#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7995#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:21,567 INFO L273 TraceCheckUtils]: 23: Hoare triple {7995#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7996#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:21,568 INFO L273 TraceCheckUtils]: 24: Hoare triple {7996#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7996#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:21,569 INFO L273 TraceCheckUtils]: 25: Hoare triple {7996#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7997#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:21,569 INFO L273 TraceCheckUtils]: 26: Hoare triple {7997#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7997#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:21,570 INFO L273 TraceCheckUtils]: 27: Hoare triple {7997#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7998#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:21,570 INFO L273 TraceCheckUtils]: 28: Hoare triple {7998#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7998#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:21,571 INFO L273 TraceCheckUtils]: 29: Hoare triple {7998#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7999#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:21,572 INFO L273 TraceCheckUtils]: 30: Hoare triple {7999#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7999#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:21,572 INFO L273 TraceCheckUtils]: 31: Hoare triple {7999#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8000#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:21,573 INFO L273 TraceCheckUtils]: 32: Hoare triple {8000#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8000#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:21,574 INFO L273 TraceCheckUtils]: 33: Hoare triple {8000#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8001#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:21,574 INFO L273 TraceCheckUtils]: 34: Hoare triple {8001#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8001#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:21,575 INFO L273 TraceCheckUtils]: 35: Hoare triple {8001#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8002#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:21,576 INFO L273 TraceCheckUtils]: 36: Hoare triple {8002#(<= main_~i~1 15)} assume !(~i~1 < 100000); {7986#false} is VALID [2018-11-23 12:26:21,576 INFO L256 TraceCheckUtils]: 37: Hoare triple {7986#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {7985#true} is VALID [2018-11-23 12:26:21,576 INFO L273 TraceCheckUtils]: 38: Hoare triple {7985#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7985#true} is VALID [2018-11-23 12:26:21,576 INFO L273 TraceCheckUtils]: 39: Hoare triple {7985#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:26:21,577 INFO L273 TraceCheckUtils]: 40: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:26:21,577 INFO L273 TraceCheckUtils]: 41: Hoare triple {7985#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:26:21,577 INFO L273 TraceCheckUtils]: 42: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:26:21,577 INFO L273 TraceCheckUtils]: 43: Hoare triple {7985#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:26:21,577 INFO L273 TraceCheckUtils]: 44: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:26:21,578 INFO L273 TraceCheckUtils]: 45: Hoare triple {7985#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:26:21,578 INFO L273 TraceCheckUtils]: 46: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:26:21,578 INFO L273 TraceCheckUtils]: 47: Hoare triple {7985#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:26:21,578 INFO L273 TraceCheckUtils]: 48: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:26:21,578 INFO L273 TraceCheckUtils]: 49: Hoare triple {7985#true} assume !(~i~0 < 100000); {7985#true} is VALID [2018-11-23 12:26:21,579 INFO L273 TraceCheckUtils]: 50: Hoare triple {7985#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7985#true} is VALID [2018-11-23 12:26:21,579 INFO L273 TraceCheckUtils]: 51: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:26:21,579 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {7985#true} {7986#false} #70#return; {7986#false} is VALID [2018-11-23 12:26:21,579 INFO L273 TraceCheckUtils]: 53: Hoare triple {7986#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {7986#false} is VALID [2018-11-23 12:26:21,579 INFO L256 TraceCheckUtils]: 54: Hoare triple {7986#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {7985#true} is VALID [2018-11-23 12:26:21,580 INFO L273 TraceCheckUtils]: 55: Hoare triple {7985#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7985#true} is VALID [2018-11-23 12:26:21,580 INFO L273 TraceCheckUtils]: 56: Hoare triple {7985#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:26:21,580 INFO L273 TraceCheckUtils]: 57: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:26:21,580 INFO L273 TraceCheckUtils]: 58: Hoare triple {7985#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:26:21,580 INFO L273 TraceCheckUtils]: 59: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:26:21,581 INFO L273 TraceCheckUtils]: 60: Hoare triple {7985#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:26:21,581 INFO L273 TraceCheckUtils]: 61: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:26:21,581 INFO L273 TraceCheckUtils]: 62: Hoare triple {7985#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:26:21,581 INFO L273 TraceCheckUtils]: 63: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:26:21,581 INFO L273 TraceCheckUtils]: 64: Hoare triple {7985#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:26:21,581 INFO L273 TraceCheckUtils]: 65: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:26:21,581 INFO L273 TraceCheckUtils]: 66: Hoare triple {7985#true} assume !(~i~0 < 100000); {7985#true} is VALID [2018-11-23 12:26:21,581 INFO L273 TraceCheckUtils]: 67: Hoare triple {7985#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7985#true} is VALID [2018-11-23 12:26:21,581 INFO L273 TraceCheckUtils]: 68: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:26:21,582 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {7985#true} {7986#false} #72#return; {7986#false} is VALID [2018-11-23 12:26:21,582 INFO L273 TraceCheckUtils]: 70: Hoare triple {7986#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {7986#false} is VALID [2018-11-23 12:26:21,582 INFO L273 TraceCheckUtils]: 71: Hoare triple {7986#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7986#false} is VALID [2018-11-23 12:26:21,582 INFO L273 TraceCheckUtils]: 72: Hoare triple {7986#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7986#false} is VALID [2018-11-23 12:26:21,582 INFO L273 TraceCheckUtils]: 73: Hoare triple {7986#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7986#false} is VALID [2018-11-23 12:26:21,582 INFO L273 TraceCheckUtils]: 74: Hoare triple {7986#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7986#false} is VALID [2018-11-23 12:26:21,582 INFO L273 TraceCheckUtils]: 75: Hoare triple {7986#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7986#false} is VALID [2018-11-23 12:26:21,582 INFO L273 TraceCheckUtils]: 76: Hoare triple {7986#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7986#false} is VALID [2018-11-23 12:26:21,582 INFO L273 TraceCheckUtils]: 77: Hoare triple {7986#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7986#false} is VALID [2018-11-23 12:26:21,583 INFO L273 TraceCheckUtils]: 78: Hoare triple {7986#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7986#false} is VALID [2018-11-23 12:26:21,583 INFO L273 TraceCheckUtils]: 79: Hoare triple {7986#false} assume !(~i~2 < 99999); {7986#false} is VALID [2018-11-23 12:26:21,583 INFO L273 TraceCheckUtils]: 80: Hoare triple {7986#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {7986#false} is VALID [2018-11-23 12:26:21,583 INFO L256 TraceCheckUtils]: 81: Hoare triple {7986#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {7985#true} is VALID [2018-11-23 12:26:21,583 INFO L273 TraceCheckUtils]: 82: Hoare triple {7985#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7985#true} is VALID [2018-11-23 12:26:21,583 INFO L273 TraceCheckUtils]: 83: Hoare triple {7985#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:26:21,583 INFO L273 TraceCheckUtils]: 84: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:26:21,583 INFO L273 TraceCheckUtils]: 85: Hoare triple {7985#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:26:21,584 INFO L273 TraceCheckUtils]: 86: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:26:21,584 INFO L273 TraceCheckUtils]: 87: Hoare triple {7985#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:26:21,584 INFO L273 TraceCheckUtils]: 88: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:26:21,584 INFO L273 TraceCheckUtils]: 89: Hoare triple {7985#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:26:21,584 INFO L273 TraceCheckUtils]: 90: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:26:21,584 INFO L273 TraceCheckUtils]: 91: Hoare triple {7985#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:26:21,584 INFO L273 TraceCheckUtils]: 92: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:26:21,584 INFO L273 TraceCheckUtils]: 93: Hoare triple {7985#true} assume !(~i~0 < 100000); {7985#true} is VALID [2018-11-23 12:26:21,584 INFO L273 TraceCheckUtils]: 94: Hoare triple {7985#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7985#true} is VALID [2018-11-23 12:26:21,585 INFO L273 TraceCheckUtils]: 95: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:26:21,585 INFO L268 TraceCheckUtils]: 96: Hoare quadruple {7985#true} {7986#false} #74#return; {7986#false} is VALID [2018-11-23 12:26:21,585 INFO L273 TraceCheckUtils]: 97: Hoare triple {7986#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {7986#false} is VALID [2018-11-23 12:26:21,585 INFO L273 TraceCheckUtils]: 98: Hoare triple {7986#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {7986#false} is VALID [2018-11-23 12:26:21,585 INFO L273 TraceCheckUtils]: 99: Hoare triple {7986#false} assume !false; {7986#false} is VALID [2018-11-23 12:26:21,589 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2018-11-23 12:26:21,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:21,590 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:21,599 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:26:21,682 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 12:26:21,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:21,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:21,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:21,871 INFO L256 TraceCheckUtils]: 0: Hoare triple {7985#true} call ULTIMATE.init(); {7985#true} is VALID [2018-11-23 12:26:21,871 INFO L273 TraceCheckUtils]: 1: Hoare triple {7985#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7985#true} is VALID [2018-11-23 12:26:21,871 INFO L273 TraceCheckUtils]: 2: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:26:21,871 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7985#true} {7985#true} #66#return; {7985#true} is VALID [2018-11-23 12:26:21,872 INFO L256 TraceCheckUtils]: 4: Hoare triple {7985#true} call #t~ret13 := main(); {7985#true} is VALID [2018-11-23 12:26:21,872 INFO L273 TraceCheckUtils]: 5: Hoare triple {7985#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {7985#true} is VALID [2018-11-23 12:26:21,872 INFO L273 TraceCheckUtils]: 6: Hoare triple {7985#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:26:21,872 INFO L273 TraceCheckUtils]: 7: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:26:21,872 INFO L273 TraceCheckUtils]: 8: Hoare triple {7985#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:26:21,873 INFO L273 TraceCheckUtils]: 9: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:26:21,873 INFO L273 TraceCheckUtils]: 10: Hoare triple {7985#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:26:21,873 INFO L273 TraceCheckUtils]: 11: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:26:21,873 INFO L273 TraceCheckUtils]: 12: Hoare triple {7985#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:26:21,873 INFO L273 TraceCheckUtils]: 13: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:26:21,873 INFO L273 TraceCheckUtils]: 14: Hoare triple {7985#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:26:21,874 INFO L273 TraceCheckUtils]: 15: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:26:21,874 INFO L273 TraceCheckUtils]: 16: Hoare triple {7985#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:26:21,874 INFO L273 TraceCheckUtils]: 17: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:26:21,874 INFO L273 TraceCheckUtils]: 18: Hoare triple {7985#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:26:21,874 INFO L273 TraceCheckUtils]: 19: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:26:21,874 INFO L273 TraceCheckUtils]: 20: Hoare triple {7985#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:26:21,874 INFO L273 TraceCheckUtils]: 21: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:26:21,874 INFO L273 TraceCheckUtils]: 22: Hoare triple {7985#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:26:21,874 INFO L273 TraceCheckUtils]: 23: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:26:21,875 INFO L273 TraceCheckUtils]: 24: Hoare triple {7985#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:26:21,875 INFO L273 TraceCheckUtils]: 25: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:26:21,875 INFO L273 TraceCheckUtils]: 26: Hoare triple {7985#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:26:21,875 INFO L273 TraceCheckUtils]: 27: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:26:21,875 INFO L273 TraceCheckUtils]: 28: Hoare triple {7985#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:26:21,875 INFO L273 TraceCheckUtils]: 29: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:26:21,875 INFO L273 TraceCheckUtils]: 30: Hoare triple {7985#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:26:21,875 INFO L273 TraceCheckUtils]: 31: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:26:21,875 INFO L273 TraceCheckUtils]: 32: Hoare triple {7985#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:26:21,876 INFO L273 TraceCheckUtils]: 33: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:26:21,876 INFO L273 TraceCheckUtils]: 34: Hoare triple {7985#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {7985#true} is VALID [2018-11-23 12:26:21,876 INFO L273 TraceCheckUtils]: 35: Hoare triple {7985#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {7985#true} is VALID [2018-11-23 12:26:21,876 INFO L273 TraceCheckUtils]: 36: Hoare triple {7985#true} assume !(~i~1 < 100000); {7985#true} is VALID [2018-11-23 12:26:21,876 INFO L256 TraceCheckUtils]: 37: Hoare triple {7985#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {7985#true} is VALID [2018-11-23 12:26:21,876 INFO L273 TraceCheckUtils]: 38: Hoare triple {7985#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7985#true} is VALID [2018-11-23 12:26:21,876 INFO L273 TraceCheckUtils]: 39: Hoare triple {7985#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:26:21,876 INFO L273 TraceCheckUtils]: 40: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:26:21,877 INFO L273 TraceCheckUtils]: 41: Hoare triple {7985#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:26:21,877 INFO L273 TraceCheckUtils]: 42: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:26:21,877 INFO L273 TraceCheckUtils]: 43: Hoare triple {7985#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:26:21,877 INFO L273 TraceCheckUtils]: 44: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:26:21,877 INFO L273 TraceCheckUtils]: 45: Hoare triple {7985#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:26:21,877 INFO L273 TraceCheckUtils]: 46: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:26:21,877 INFO L273 TraceCheckUtils]: 47: Hoare triple {7985#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:26:21,877 INFO L273 TraceCheckUtils]: 48: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:26:21,877 INFO L273 TraceCheckUtils]: 49: Hoare triple {7985#true} assume !(~i~0 < 100000); {7985#true} is VALID [2018-11-23 12:26:21,878 INFO L273 TraceCheckUtils]: 50: Hoare triple {7985#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7985#true} is VALID [2018-11-23 12:26:21,878 INFO L273 TraceCheckUtils]: 51: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:26:21,878 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {7985#true} {7985#true} #70#return; {7985#true} is VALID [2018-11-23 12:26:21,878 INFO L273 TraceCheckUtils]: 53: Hoare triple {7985#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {7985#true} is VALID [2018-11-23 12:26:21,878 INFO L256 TraceCheckUtils]: 54: Hoare triple {7985#true} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {7985#true} is VALID [2018-11-23 12:26:21,878 INFO L273 TraceCheckUtils]: 55: Hoare triple {7985#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7985#true} is VALID [2018-11-23 12:26:21,878 INFO L273 TraceCheckUtils]: 56: Hoare triple {7985#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:26:21,878 INFO L273 TraceCheckUtils]: 57: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:26:21,879 INFO L273 TraceCheckUtils]: 58: Hoare triple {7985#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:26:21,879 INFO L273 TraceCheckUtils]: 59: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:26:21,879 INFO L273 TraceCheckUtils]: 60: Hoare triple {7985#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:26:21,879 INFO L273 TraceCheckUtils]: 61: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:26:21,879 INFO L273 TraceCheckUtils]: 62: Hoare triple {7985#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:26:21,879 INFO L273 TraceCheckUtils]: 63: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:26:21,879 INFO L273 TraceCheckUtils]: 64: Hoare triple {7985#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:26:21,879 INFO L273 TraceCheckUtils]: 65: Hoare triple {7985#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7985#true} is VALID [2018-11-23 12:26:21,879 INFO L273 TraceCheckUtils]: 66: Hoare triple {7985#true} assume !(~i~0 < 100000); {7985#true} is VALID [2018-11-23 12:26:21,880 INFO L273 TraceCheckUtils]: 67: Hoare triple {7985#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7985#true} is VALID [2018-11-23 12:26:21,880 INFO L273 TraceCheckUtils]: 68: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:26:21,880 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {7985#true} {7985#true} #72#return; {7985#true} is VALID [2018-11-23 12:26:21,880 INFO L273 TraceCheckUtils]: 70: Hoare triple {7985#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {7985#true} is VALID [2018-11-23 12:26:21,880 INFO L273 TraceCheckUtils]: 71: Hoare triple {7985#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7985#true} is VALID [2018-11-23 12:26:21,880 INFO L273 TraceCheckUtils]: 72: Hoare triple {7985#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7985#true} is VALID [2018-11-23 12:26:21,880 INFO L273 TraceCheckUtils]: 73: Hoare triple {7985#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7985#true} is VALID [2018-11-23 12:26:21,880 INFO L273 TraceCheckUtils]: 74: Hoare triple {7985#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7985#true} is VALID [2018-11-23 12:26:21,881 INFO L273 TraceCheckUtils]: 75: Hoare triple {7985#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7985#true} is VALID [2018-11-23 12:26:21,881 INFO L273 TraceCheckUtils]: 76: Hoare triple {7985#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7985#true} is VALID [2018-11-23 12:26:21,881 INFO L273 TraceCheckUtils]: 77: Hoare triple {7985#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {7985#true} is VALID [2018-11-23 12:26:21,881 INFO L273 TraceCheckUtils]: 78: Hoare triple {7985#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {7985#true} is VALID [2018-11-23 12:26:21,881 INFO L273 TraceCheckUtils]: 79: Hoare triple {7985#true} assume !(~i~2 < 99999); {7985#true} is VALID [2018-11-23 12:26:21,881 INFO L273 TraceCheckUtils]: 80: Hoare triple {7985#true} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {7985#true} is VALID [2018-11-23 12:26:21,881 INFO L256 TraceCheckUtils]: 81: Hoare triple {7985#true} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {7985#true} is VALID [2018-11-23 12:26:21,882 INFO L273 TraceCheckUtils]: 82: Hoare triple {7985#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {8252#(<= bor_~i~0 1)} is VALID [2018-11-23 12:26:21,882 INFO L273 TraceCheckUtils]: 83: Hoare triple {8252#(<= bor_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8252#(<= bor_~i~0 1)} is VALID [2018-11-23 12:26:21,883 INFO L273 TraceCheckUtils]: 84: Hoare triple {8252#(<= bor_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8259#(<= bor_~i~0 2)} is VALID [2018-11-23 12:26:21,883 INFO L273 TraceCheckUtils]: 85: Hoare triple {8259#(<= bor_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8259#(<= bor_~i~0 2)} is VALID [2018-11-23 12:26:21,883 INFO L273 TraceCheckUtils]: 86: Hoare triple {8259#(<= bor_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8266#(<= bor_~i~0 3)} is VALID [2018-11-23 12:26:21,884 INFO L273 TraceCheckUtils]: 87: Hoare triple {8266#(<= bor_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8266#(<= bor_~i~0 3)} is VALID [2018-11-23 12:26:21,884 INFO L273 TraceCheckUtils]: 88: Hoare triple {8266#(<= bor_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8273#(<= bor_~i~0 4)} is VALID [2018-11-23 12:26:21,884 INFO L273 TraceCheckUtils]: 89: Hoare triple {8273#(<= bor_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8273#(<= bor_~i~0 4)} is VALID [2018-11-23 12:26:21,885 INFO L273 TraceCheckUtils]: 90: Hoare triple {8273#(<= bor_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8280#(<= bor_~i~0 5)} is VALID [2018-11-23 12:26:21,885 INFO L273 TraceCheckUtils]: 91: Hoare triple {8280#(<= bor_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8280#(<= bor_~i~0 5)} is VALID [2018-11-23 12:26:21,886 INFO L273 TraceCheckUtils]: 92: Hoare triple {8280#(<= bor_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8287#(<= bor_~i~0 6)} is VALID [2018-11-23 12:26:21,886 INFO L273 TraceCheckUtils]: 93: Hoare triple {8287#(<= bor_~i~0 6)} assume !(~i~0 < 100000); {7986#false} is VALID [2018-11-23 12:26:21,886 INFO L273 TraceCheckUtils]: 94: Hoare triple {7986#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7986#false} is VALID [2018-11-23 12:26:21,886 INFO L273 TraceCheckUtils]: 95: Hoare triple {7986#false} assume true; {7986#false} is VALID [2018-11-23 12:26:21,887 INFO L268 TraceCheckUtils]: 96: Hoare quadruple {7986#false} {7985#true} #74#return; {7986#false} is VALID [2018-11-23 12:26:21,887 INFO L273 TraceCheckUtils]: 97: Hoare triple {7986#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {7986#false} is VALID [2018-11-23 12:26:21,887 INFO L273 TraceCheckUtils]: 98: Hoare triple {7986#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {7986#false} is VALID [2018-11-23 12:26:21,887 INFO L273 TraceCheckUtils]: 99: Hoare triple {7986#false} assume !false; {7986#false} is VALID [2018-11-23 12:26:21,892 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 128 proven. 25 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2018-11-23 12:26:21,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:21,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8] total 24 [2018-11-23 12:26:21,911 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 100 [2018-11-23 12:26:21,912 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:21,912 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 12:26:22,029 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:22,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 12:26:22,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 12:26:22,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:26:22,030 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 24 states. [2018-11-23 12:26:22,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:22,380 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2018-11-23 12:26:22,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 12:26:22,381 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 100 [2018-11-23 12:26:22,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:22,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:26:22,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 100 transitions. [2018-11-23 12:26:22,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:26:22,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 100 transitions. [2018-11-23 12:26:22,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 100 transitions. [2018-11-23 12:26:22,488 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:22,491 INFO L225 Difference]: With dead ends: 111 [2018-11-23 12:26:22,491 INFO L226 Difference]: Without dead ends: 77 [2018-11-23 12:26:22,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:26:22,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-23 12:26:22,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-11-23 12:26:22,520 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:22,520 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 75 states. [2018-11-23 12:26:22,520 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 75 states. [2018-11-23 12:26:22,521 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 75 states. [2018-11-23 12:26:22,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:22,522 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-11-23 12:26:22,522 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-23 12:26:22,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:22,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:22,523 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 77 states. [2018-11-23 12:26:22,523 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 77 states. [2018-11-23 12:26:22,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:22,524 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-11-23 12:26:22,524 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-23 12:26:22,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:22,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:22,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:22,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:22,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 12:26:22,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-11-23 12:26:22,526 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 100 [2018-11-23 12:26:22,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:22,527 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-11-23 12:26:22,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 12:26:22,527 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-11-23 12:26:22,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-23 12:26:22,528 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:22,528 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 16, 16, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:26:22,528 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:22,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:22,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1648969321, now seen corresponding path program 16 times [2018-11-23 12:26:22,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:22,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:22,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:22,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:22,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:22,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:22,942 INFO L256 TraceCheckUtils]: 0: Hoare triple {8737#true} call ULTIMATE.init(); {8737#true} is VALID [2018-11-23 12:26:22,942 INFO L273 TraceCheckUtils]: 1: Hoare triple {8737#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8737#true} is VALID [2018-11-23 12:26:22,942 INFO L273 TraceCheckUtils]: 2: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:26:22,942 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8737#true} {8737#true} #66#return; {8737#true} is VALID [2018-11-23 12:26:22,943 INFO L256 TraceCheckUtils]: 4: Hoare triple {8737#true} call #t~ret13 := main(); {8737#true} is VALID [2018-11-23 12:26:22,943 INFO L273 TraceCheckUtils]: 5: Hoare triple {8737#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {8739#(= main_~i~1 0)} is VALID [2018-11-23 12:26:22,943 INFO L273 TraceCheckUtils]: 6: Hoare triple {8739#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8739#(= main_~i~1 0)} is VALID [2018-11-23 12:26:22,944 INFO L273 TraceCheckUtils]: 7: Hoare triple {8739#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8740#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:22,944 INFO L273 TraceCheckUtils]: 8: Hoare triple {8740#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8740#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:22,945 INFO L273 TraceCheckUtils]: 9: Hoare triple {8740#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8741#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:22,945 INFO L273 TraceCheckUtils]: 10: Hoare triple {8741#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8741#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:22,945 INFO L273 TraceCheckUtils]: 11: Hoare triple {8741#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8742#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:22,946 INFO L273 TraceCheckUtils]: 12: Hoare triple {8742#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8742#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:22,946 INFO L273 TraceCheckUtils]: 13: Hoare triple {8742#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8743#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:22,947 INFO L273 TraceCheckUtils]: 14: Hoare triple {8743#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8743#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:22,947 INFO L273 TraceCheckUtils]: 15: Hoare triple {8743#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8744#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:22,948 INFO L273 TraceCheckUtils]: 16: Hoare triple {8744#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8744#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:22,952 INFO L273 TraceCheckUtils]: 17: Hoare triple {8744#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8745#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:22,952 INFO L273 TraceCheckUtils]: 18: Hoare triple {8745#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8745#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:22,953 INFO L273 TraceCheckUtils]: 19: Hoare triple {8745#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8746#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:22,953 INFO L273 TraceCheckUtils]: 20: Hoare triple {8746#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8746#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:22,954 INFO L273 TraceCheckUtils]: 21: Hoare triple {8746#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8747#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:22,954 INFO L273 TraceCheckUtils]: 22: Hoare triple {8747#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8747#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:22,954 INFO L273 TraceCheckUtils]: 23: Hoare triple {8747#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8748#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:22,955 INFO L273 TraceCheckUtils]: 24: Hoare triple {8748#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8748#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:22,955 INFO L273 TraceCheckUtils]: 25: Hoare triple {8748#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8749#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:22,956 INFO L273 TraceCheckUtils]: 26: Hoare triple {8749#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8749#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:22,957 INFO L273 TraceCheckUtils]: 27: Hoare triple {8749#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8750#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:22,957 INFO L273 TraceCheckUtils]: 28: Hoare triple {8750#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8750#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:22,958 INFO L273 TraceCheckUtils]: 29: Hoare triple {8750#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8751#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:22,958 INFO L273 TraceCheckUtils]: 30: Hoare triple {8751#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8751#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:22,959 INFO L273 TraceCheckUtils]: 31: Hoare triple {8751#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8752#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:22,960 INFO L273 TraceCheckUtils]: 32: Hoare triple {8752#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8752#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:22,960 INFO L273 TraceCheckUtils]: 33: Hoare triple {8752#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8753#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:22,961 INFO L273 TraceCheckUtils]: 34: Hoare triple {8753#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8753#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:22,962 INFO L273 TraceCheckUtils]: 35: Hoare triple {8753#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8754#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:22,962 INFO L273 TraceCheckUtils]: 36: Hoare triple {8754#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8754#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:22,963 INFO L273 TraceCheckUtils]: 37: Hoare triple {8754#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8755#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:22,964 INFO L273 TraceCheckUtils]: 38: Hoare triple {8755#(<= main_~i~1 16)} assume !(~i~1 < 100000); {8738#false} is VALID [2018-11-23 12:26:22,964 INFO L256 TraceCheckUtils]: 39: Hoare triple {8738#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {8737#true} is VALID [2018-11-23 12:26:22,964 INFO L273 TraceCheckUtils]: 40: Hoare triple {8737#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {8737#true} is VALID [2018-11-23 12:26:22,964 INFO L273 TraceCheckUtils]: 41: Hoare triple {8737#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:26:22,964 INFO L273 TraceCheckUtils]: 42: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:26:22,965 INFO L273 TraceCheckUtils]: 43: Hoare triple {8737#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:26:22,965 INFO L273 TraceCheckUtils]: 44: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:26:22,965 INFO L273 TraceCheckUtils]: 45: Hoare triple {8737#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:26:22,965 INFO L273 TraceCheckUtils]: 46: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:26:22,965 INFO L273 TraceCheckUtils]: 47: Hoare triple {8737#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:26:22,966 INFO L273 TraceCheckUtils]: 48: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:26:22,966 INFO L273 TraceCheckUtils]: 49: Hoare triple {8737#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:26:22,966 INFO L273 TraceCheckUtils]: 50: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:26:22,966 INFO L273 TraceCheckUtils]: 51: Hoare triple {8737#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:26:22,966 INFO L273 TraceCheckUtils]: 52: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:26:22,966 INFO L273 TraceCheckUtils]: 53: Hoare triple {8737#true} assume !(~i~0 < 100000); {8737#true} is VALID [2018-11-23 12:26:22,967 INFO L273 TraceCheckUtils]: 54: Hoare triple {8737#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8737#true} is VALID [2018-11-23 12:26:22,967 INFO L273 TraceCheckUtils]: 55: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:26:22,967 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {8737#true} {8738#false} #70#return; {8738#false} is VALID [2018-11-23 12:26:22,967 INFO L273 TraceCheckUtils]: 57: Hoare triple {8738#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {8738#false} is VALID [2018-11-23 12:26:22,967 INFO L256 TraceCheckUtils]: 58: Hoare triple {8738#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {8737#true} is VALID [2018-11-23 12:26:22,968 INFO L273 TraceCheckUtils]: 59: Hoare triple {8737#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {8737#true} is VALID [2018-11-23 12:26:22,968 INFO L273 TraceCheckUtils]: 60: Hoare triple {8737#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:26:22,968 INFO L273 TraceCheckUtils]: 61: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:26:22,968 INFO L273 TraceCheckUtils]: 62: Hoare triple {8737#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:26:22,968 INFO L273 TraceCheckUtils]: 63: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:26:22,969 INFO L273 TraceCheckUtils]: 64: Hoare triple {8737#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:26:22,969 INFO L273 TraceCheckUtils]: 65: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:26:22,969 INFO L273 TraceCheckUtils]: 66: Hoare triple {8737#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:26:22,969 INFO L273 TraceCheckUtils]: 67: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:26:22,969 INFO L273 TraceCheckUtils]: 68: Hoare triple {8737#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:26:22,969 INFO L273 TraceCheckUtils]: 69: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:26:22,970 INFO L273 TraceCheckUtils]: 70: Hoare triple {8737#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:26:22,970 INFO L273 TraceCheckUtils]: 71: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:26:22,970 INFO L273 TraceCheckUtils]: 72: Hoare triple {8737#true} assume !(~i~0 < 100000); {8737#true} is VALID [2018-11-23 12:26:22,970 INFO L273 TraceCheckUtils]: 73: Hoare triple {8737#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8737#true} is VALID [2018-11-23 12:26:22,970 INFO L273 TraceCheckUtils]: 74: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:26:22,970 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {8737#true} {8738#false} #72#return; {8738#false} is VALID [2018-11-23 12:26:22,970 INFO L273 TraceCheckUtils]: 76: Hoare triple {8738#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {8738#false} is VALID [2018-11-23 12:26:22,970 INFO L273 TraceCheckUtils]: 77: Hoare triple {8738#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {8738#false} is VALID [2018-11-23 12:26:22,970 INFO L273 TraceCheckUtils]: 78: Hoare triple {8738#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {8738#false} is VALID [2018-11-23 12:26:22,971 INFO L273 TraceCheckUtils]: 79: Hoare triple {8738#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {8738#false} is VALID [2018-11-23 12:26:22,971 INFO L273 TraceCheckUtils]: 80: Hoare triple {8738#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {8738#false} is VALID [2018-11-23 12:26:22,971 INFO L273 TraceCheckUtils]: 81: Hoare triple {8738#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {8738#false} is VALID [2018-11-23 12:26:22,971 INFO L273 TraceCheckUtils]: 82: Hoare triple {8738#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {8738#false} is VALID [2018-11-23 12:26:22,971 INFO L273 TraceCheckUtils]: 83: Hoare triple {8738#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {8738#false} is VALID [2018-11-23 12:26:22,971 INFO L273 TraceCheckUtils]: 84: Hoare triple {8738#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {8738#false} is VALID [2018-11-23 12:26:22,971 INFO L273 TraceCheckUtils]: 85: Hoare triple {8738#false} assume !(~i~2 < 99999); {8738#false} is VALID [2018-11-23 12:26:22,971 INFO L273 TraceCheckUtils]: 86: Hoare triple {8738#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {8738#false} is VALID [2018-11-23 12:26:22,972 INFO L256 TraceCheckUtils]: 87: Hoare triple {8738#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {8737#true} is VALID [2018-11-23 12:26:22,972 INFO L273 TraceCheckUtils]: 88: Hoare triple {8737#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {8737#true} is VALID [2018-11-23 12:26:22,972 INFO L273 TraceCheckUtils]: 89: Hoare triple {8737#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:26:22,972 INFO L273 TraceCheckUtils]: 90: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:26:22,972 INFO L273 TraceCheckUtils]: 91: Hoare triple {8737#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:26:22,972 INFO L273 TraceCheckUtils]: 92: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:26:22,972 INFO L273 TraceCheckUtils]: 93: Hoare triple {8737#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:26:22,972 INFO L273 TraceCheckUtils]: 94: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:26:22,972 INFO L273 TraceCheckUtils]: 95: Hoare triple {8737#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:26:22,973 INFO L273 TraceCheckUtils]: 96: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:26:22,973 INFO L273 TraceCheckUtils]: 97: Hoare triple {8737#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:26:22,973 INFO L273 TraceCheckUtils]: 98: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:26:22,973 INFO L273 TraceCheckUtils]: 99: Hoare triple {8737#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:26:22,973 INFO L273 TraceCheckUtils]: 100: Hoare triple {8737#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8737#true} is VALID [2018-11-23 12:26:22,973 INFO L273 TraceCheckUtils]: 101: Hoare triple {8737#true} assume !(~i~0 < 100000); {8737#true} is VALID [2018-11-23 12:26:22,973 INFO L273 TraceCheckUtils]: 102: Hoare triple {8737#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8737#true} is VALID [2018-11-23 12:26:22,973 INFO L273 TraceCheckUtils]: 103: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:26:22,973 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {8737#true} {8738#false} #74#return; {8738#false} is VALID [2018-11-23 12:26:22,974 INFO L273 TraceCheckUtils]: 105: Hoare triple {8738#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {8738#false} is VALID [2018-11-23 12:26:22,974 INFO L273 TraceCheckUtils]: 106: Hoare triple {8738#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {8738#false} is VALID [2018-11-23 12:26:22,974 INFO L273 TraceCheckUtils]: 107: Hoare triple {8738#false} assume !false; {8738#false} is VALID [2018-11-23 12:26:22,979 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2018-11-23 12:26:22,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:22,979 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:22,988 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:26:23,038 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:26:23,038 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:23,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:23,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:23,241 INFO L256 TraceCheckUtils]: 0: Hoare triple {8737#true} call ULTIMATE.init(); {8737#true} is VALID [2018-11-23 12:26:23,241 INFO L273 TraceCheckUtils]: 1: Hoare triple {8737#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8737#true} is VALID [2018-11-23 12:26:23,241 INFO L273 TraceCheckUtils]: 2: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:26:23,242 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8737#true} {8737#true} #66#return; {8737#true} is VALID [2018-11-23 12:26:23,242 INFO L256 TraceCheckUtils]: 4: Hoare triple {8737#true} call #t~ret13 := main(); {8737#true} is VALID [2018-11-23 12:26:23,243 INFO L273 TraceCheckUtils]: 5: Hoare triple {8737#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {8774#(<= main_~i~1 0)} is VALID [2018-11-23 12:26:23,243 INFO L273 TraceCheckUtils]: 6: Hoare triple {8774#(<= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8774#(<= main_~i~1 0)} is VALID [2018-11-23 12:26:23,244 INFO L273 TraceCheckUtils]: 7: Hoare triple {8774#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8740#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:23,244 INFO L273 TraceCheckUtils]: 8: Hoare triple {8740#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8740#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:23,245 INFO L273 TraceCheckUtils]: 9: Hoare triple {8740#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8741#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:23,245 INFO L273 TraceCheckUtils]: 10: Hoare triple {8741#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8741#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:23,245 INFO L273 TraceCheckUtils]: 11: Hoare triple {8741#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8742#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:23,246 INFO L273 TraceCheckUtils]: 12: Hoare triple {8742#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8742#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:23,246 INFO L273 TraceCheckUtils]: 13: Hoare triple {8742#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8743#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:23,247 INFO L273 TraceCheckUtils]: 14: Hoare triple {8743#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8743#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:23,248 INFO L273 TraceCheckUtils]: 15: Hoare triple {8743#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8744#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:23,248 INFO L273 TraceCheckUtils]: 16: Hoare triple {8744#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8744#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:23,249 INFO L273 TraceCheckUtils]: 17: Hoare triple {8744#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8745#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:23,250 INFO L273 TraceCheckUtils]: 18: Hoare triple {8745#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8745#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:23,250 INFO L273 TraceCheckUtils]: 19: Hoare triple {8745#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8746#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:23,251 INFO L273 TraceCheckUtils]: 20: Hoare triple {8746#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8746#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:23,252 INFO L273 TraceCheckUtils]: 21: Hoare triple {8746#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8747#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:23,252 INFO L273 TraceCheckUtils]: 22: Hoare triple {8747#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8747#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:23,253 INFO L273 TraceCheckUtils]: 23: Hoare triple {8747#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8748#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:23,253 INFO L273 TraceCheckUtils]: 24: Hoare triple {8748#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8748#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:23,254 INFO L273 TraceCheckUtils]: 25: Hoare triple {8748#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8749#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:23,255 INFO L273 TraceCheckUtils]: 26: Hoare triple {8749#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8749#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:23,255 INFO L273 TraceCheckUtils]: 27: Hoare triple {8749#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8750#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:23,256 INFO L273 TraceCheckUtils]: 28: Hoare triple {8750#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8750#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:23,257 INFO L273 TraceCheckUtils]: 29: Hoare triple {8750#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8751#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:23,257 INFO L273 TraceCheckUtils]: 30: Hoare triple {8751#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8751#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:23,258 INFO L273 TraceCheckUtils]: 31: Hoare triple {8751#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8752#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:23,258 INFO L273 TraceCheckUtils]: 32: Hoare triple {8752#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8752#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:23,259 INFO L273 TraceCheckUtils]: 33: Hoare triple {8752#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8753#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:23,260 INFO L273 TraceCheckUtils]: 34: Hoare triple {8753#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8753#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:23,261 INFO L273 TraceCheckUtils]: 35: Hoare triple {8753#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8754#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:23,261 INFO L273 TraceCheckUtils]: 36: Hoare triple {8754#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {8754#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:23,262 INFO L273 TraceCheckUtils]: 37: Hoare triple {8754#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {8755#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:23,262 INFO L273 TraceCheckUtils]: 38: Hoare triple {8755#(<= main_~i~1 16)} assume !(~i~1 < 100000); {8738#false} is VALID [2018-11-23 12:26:23,263 INFO L256 TraceCheckUtils]: 39: Hoare triple {8738#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {8738#false} is VALID [2018-11-23 12:26:23,263 INFO L273 TraceCheckUtils]: 40: Hoare triple {8738#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {8738#false} is VALID [2018-11-23 12:26:23,263 INFO L273 TraceCheckUtils]: 41: Hoare triple {8738#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:26:23,263 INFO L273 TraceCheckUtils]: 42: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:26:23,264 INFO L273 TraceCheckUtils]: 43: Hoare triple {8738#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:26:23,264 INFO L273 TraceCheckUtils]: 44: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:26:23,264 INFO L273 TraceCheckUtils]: 45: Hoare triple {8738#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:26:23,264 INFO L273 TraceCheckUtils]: 46: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:26:23,264 INFO L273 TraceCheckUtils]: 47: Hoare triple {8738#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:26:23,265 INFO L273 TraceCheckUtils]: 48: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:26:23,265 INFO L273 TraceCheckUtils]: 49: Hoare triple {8738#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:26:23,265 INFO L273 TraceCheckUtils]: 50: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:26:23,265 INFO L273 TraceCheckUtils]: 51: Hoare triple {8738#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:26:23,265 INFO L273 TraceCheckUtils]: 52: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:26:23,266 INFO L273 TraceCheckUtils]: 53: Hoare triple {8738#false} assume !(~i~0 < 100000); {8738#false} is VALID [2018-11-23 12:26:23,266 INFO L273 TraceCheckUtils]: 54: Hoare triple {8738#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8738#false} is VALID [2018-11-23 12:26:23,266 INFO L273 TraceCheckUtils]: 55: Hoare triple {8738#false} assume true; {8738#false} is VALID [2018-11-23 12:26:23,266 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {8738#false} {8738#false} #70#return; {8738#false} is VALID [2018-11-23 12:26:23,266 INFO L273 TraceCheckUtils]: 57: Hoare triple {8738#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {8738#false} is VALID [2018-11-23 12:26:23,266 INFO L256 TraceCheckUtils]: 58: Hoare triple {8738#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {8738#false} is VALID [2018-11-23 12:26:23,266 INFO L273 TraceCheckUtils]: 59: Hoare triple {8738#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {8738#false} is VALID [2018-11-23 12:26:23,266 INFO L273 TraceCheckUtils]: 60: Hoare triple {8738#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:26:23,266 INFO L273 TraceCheckUtils]: 61: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:26:23,267 INFO L273 TraceCheckUtils]: 62: Hoare triple {8738#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:26:23,267 INFO L273 TraceCheckUtils]: 63: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:26:23,267 INFO L273 TraceCheckUtils]: 64: Hoare triple {8738#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:26:23,267 INFO L273 TraceCheckUtils]: 65: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:26:23,267 INFO L273 TraceCheckUtils]: 66: Hoare triple {8738#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:26:23,267 INFO L273 TraceCheckUtils]: 67: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:26:23,267 INFO L273 TraceCheckUtils]: 68: Hoare triple {8738#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:26:23,267 INFO L273 TraceCheckUtils]: 69: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:26:23,268 INFO L273 TraceCheckUtils]: 70: Hoare triple {8738#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:26:23,268 INFO L273 TraceCheckUtils]: 71: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:26:23,268 INFO L273 TraceCheckUtils]: 72: Hoare triple {8738#false} assume !(~i~0 < 100000); {8738#false} is VALID [2018-11-23 12:26:23,268 INFO L273 TraceCheckUtils]: 73: Hoare triple {8738#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8738#false} is VALID [2018-11-23 12:26:23,268 INFO L273 TraceCheckUtils]: 74: Hoare triple {8738#false} assume true; {8738#false} is VALID [2018-11-23 12:26:23,268 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {8738#false} {8738#false} #72#return; {8738#false} is VALID [2018-11-23 12:26:23,268 INFO L273 TraceCheckUtils]: 76: Hoare triple {8738#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {8738#false} is VALID [2018-11-23 12:26:23,268 INFO L273 TraceCheckUtils]: 77: Hoare triple {8738#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {8738#false} is VALID [2018-11-23 12:26:23,268 INFO L273 TraceCheckUtils]: 78: Hoare triple {8738#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {8738#false} is VALID [2018-11-23 12:26:23,269 INFO L273 TraceCheckUtils]: 79: Hoare triple {8738#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {8738#false} is VALID [2018-11-23 12:26:23,269 INFO L273 TraceCheckUtils]: 80: Hoare triple {8738#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {8738#false} is VALID [2018-11-23 12:26:23,269 INFO L273 TraceCheckUtils]: 81: Hoare triple {8738#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {8738#false} is VALID [2018-11-23 12:26:23,269 INFO L273 TraceCheckUtils]: 82: Hoare triple {8738#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {8738#false} is VALID [2018-11-23 12:26:23,269 INFO L273 TraceCheckUtils]: 83: Hoare triple {8738#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {8738#false} is VALID [2018-11-23 12:26:23,269 INFO L273 TraceCheckUtils]: 84: Hoare triple {8738#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {8738#false} is VALID [2018-11-23 12:26:23,269 INFO L273 TraceCheckUtils]: 85: Hoare triple {8738#false} assume !(~i~2 < 99999); {8738#false} is VALID [2018-11-23 12:26:23,269 INFO L273 TraceCheckUtils]: 86: Hoare triple {8738#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {8738#false} is VALID [2018-11-23 12:26:23,270 INFO L256 TraceCheckUtils]: 87: Hoare triple {8738#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {8738#false} is VALID [2018-11-23 12:26:23,270 INFO L273 TraceCheckUtils]: 88: Hoare triple {8738#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {8738#false} is VALID [2018-11-23 12:26:23,270 INFO L273 TraceCheckUtils]: 89: Hoare triple {8738#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:26:23,270 INFO L273 TraceCheckUtils]: 90: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:26:23,270 INFO L273 TraceCheckUtils]: 91: Hoare triple {8738#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:26:23,270 INFO L273 TraceCheckUtils]: 92: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:26:23,270 INFO L273 TraceCheckUtils]: 93: Hoare triple {8738#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:26:23,270 INFO L273 TraceCheckUtils]: 94: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:26:23,270 INFO L273 TraceCheckUtils]: 95: Hoare triple {8738#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:26:23,271 INFO L273 TraceCheckUtils]: 96: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:26:23,271 INFO L273 TraceCheckUtils]: 97: Hoare triple {8738#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:26:23,271 INFO L273 TraceCheckUtils]: 98: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:26:23,271 INFO L273 TraceCheckUtils]: 99: Hoare triple {8738#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:26:23,271 INFO L273 TraceCheckUtils]: 100: Hoare triple {8738#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8738#false} is VALID [2018-11-23 12:26:23,271 INFO L273 TraceCheckUtils]: 101: Hoare triple {8738#false} assume !(~i~0 < 100000); {8738#false} is VALID [2018-11-23 12:26:23,271 INFO L273 TraceCheckUtils]: 102: Hoare triple {8738#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8738#false} is VALID [2018-11-23 12:26:23,271 INFO L273 TraceCheckUtils]: 103: Hoare triple {8738#false} assume true; {8738#false} is VALID [2018-11-23 12:26:23,271 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {8738#false} {8738#false} #74#return; {8738#false} is VALID [2018-11-23 12:26:23,272 INFO L273 TraceCheckUtils]: 105: Hoare triple {8738#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {8738#false} is VALID [2018-11-23 12:26:23,272 INFO L273 TraceCheckUtils]: 106: Hoare triple {8738#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {8738#false} is VALID [2018-11-23 12:26:23,272 INFO L273 TraceCheckUtils]: 107: Hoare triple {8738#false} assume !false; {8738#false} is VALID [2018-11-23 12:26:23,277 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2018-11-23 12:26:23,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:23,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 12:26:23,296 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 108 [2018-11-23 12:26:23,297 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:23,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 12:26:23,373 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:23,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 12:26:23,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 12:26:23,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:26:23,374 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 20 states. [2018-11-23 12:26:23,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:23,869 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2018-11-23 12:26:23,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:26:23,869 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 108 [2018-11-23 12:26:23,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:23,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:26:23,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 86 transitions. [2018-11-23 12:26:23,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:26:23,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 86 transitions. [2018-11-23 12:26:23,872 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 86 transitions. [2018-11-23 12:26:23,975 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:23,977 INFO L225 Difference]: With dead ends: 114 [2018-11-23 12:26:23,977 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 12:26:23,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:26:23,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 12:26:24,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-11-23 12:26:24,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:24,014 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 77 states. [2018-11-23 12:26:24,015 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 77 states. [2018-11-23 12:26:24,015 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 77 states. [2018-11-23 12:26:24,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:24,016 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-11-23 12:26:24,016 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-11-23 12:26:24,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:24,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:24,017 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 78 states. [2018-11-23 12:26:24,017 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 78 states. [2018-11-23 12:26:24,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:24,019 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-11-23 12:26:24,019 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-11-23 12:26:24,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:24,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:24,020 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:24,020 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:24,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-23 12:26:24,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-11-23 12:26:24,021 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 108 [2018-11-23 12:26:24,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:24,022 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-11-23 12:26:24,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 12:26:24,022 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-23 12:26:24,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-23 12:26:24,023 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:24,023 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:26:24,023 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:24,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:24,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1027293945, now seen corresponding path program 17 times [2018-11-23 12:26:24,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:24,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:24,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:24,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:24,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:24,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:24,873 INFO L256 TraceCheckUtils]: 0: Hoare triple {9519#true} call ULTIMATE.init(); {9519#true} is VALID [2018-11-23 12:26:24,873 INFO L273 TraceCheckUtils]: 1: Hoare triple {9519#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9519#true} is VALID [2018-11-23 12:26:24,873 INFO L273 TraceCheckUtils]: 2: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:26:24,873 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9519#true} {9519#true} #66#return; {9519#true} is VALID [2018-11-23 12:26:24,874 INFO L256 TraceCheckUtils]: 4: Hoare triple {9519#true} call #t~ret13 := main(); {9519#true} is VALID [2018-11-23 12:26:24,874 INFO L273 TraceCheckUtils]: 5: Hoare triple {9519#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {9521#(= main_~i~1 0)} is VALID [2018-11-23 12:26:24,875 INFO L273 TraceCheckUtils]: 6: Hoare triple {9521#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9521#(= main_~i~1 0)} is VALID [2018-11-23 12:26:24,876 INFO L273 TraceCheckUtils]: 7: Hoare triple {9521#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9522#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:24,876 INFO L273 TraceCheckUtils]: 8: Hoare triple {9522#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9522#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:24,877 INFO L273 TraceCheckUtils]: 9: Hoare triple {9522#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9523#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:24,877 INFO L273 TraceCheckUtils]: 10: Hoare triple {9523#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9523#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:24,878 INFO L273 TraceCheckUtils]: 11: Hoare triple {9523#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9524#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:24,879 INFO L273 TraceCheckUtils]: 12: Hoare triple {9524#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9524#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:24,879 INFO L273 TraceCheckUtils]: 13: Hoare triple {9524#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9525#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:24,880 INFO L273 TraceCheckUtils]: 14: Hoare triple {9525#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9525#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:24,881 INFO L273 TraceCheckUtils]: 15: Hoare triple {9525#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9526#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:24,881 INFO L273 TraceCheckUtils]: 16: Hoare triple {9526#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9526#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:24,882 INFO L273 TraceCheckUtils]: 17: Hoare triple {9526#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9527#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:24,883 INFO L273 TraceCheckUtils]: 18: Hoare triple {9527#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9527#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:24,883 INFO L273 TraceCheckUtils]: 19: Hoare triple {9527#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9528#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:24,884 INFO L273 TraceCheckUtils]: 20: Hoare triple {9528#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9528#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:24,904 INFO L273 TraceCheckUtils]: 21: Hoare triple {9528#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9529#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:24,904 INFO L273 TraceCheckUtils]: 22: Hoare triple {9529#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9529#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:24,905 INFO L273 TraceCheckUtils]: 23: Hoare triple {9529#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9530#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:24,905 INFO L273 TraceCheckUtils]: 24: Hoare triple {9530#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9530#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:24,906 INFO L273 TraceCheckUtils]: 25: Hoare triple {9530#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9531#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:24,906 INFO L273 TraceCheckUtils]: 26: Hoare triple {9531#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9531#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:24,907 INFO L273 TraceCheckUtils]: 27: Hoare triple {9531#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9532#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:24,907 INFO L273 TraceCheckUtils]: 28: Hoare triple {9532#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9532#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:24,908 INFO L273 TraceCheckUtils]: 29: Hoare triple {9532#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9533#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:24,908 INFO L273 TraceCheckUtils]: 30: Hoare triple {9533#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9533#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:24,909 INFO L273 TraceCheckUtils]: 31: Hoare triple {9533#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9534#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:24,910 INFO L273 TraceCheckUtils]: 32: Hoare triple {9534#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9534#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:24,910 INFO L273 TraceCheckUtils]: 33: Hoare triple {9534#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9535#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:24,911 INFO L273 TraceCheckUtils]: 34: Hoare triple {9535#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9535#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:24,912 INFO L273 TraceCheckUtils]: 35: Hoare triple {9535#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9536#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:24,912 INFO L273 TraceCheckUtils]: 36: Hoare triple {9536#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9536#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:24,913 INFO L273 TraceCheckUtils]: 37: Hoare triple {9536#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9537#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:24,913 INFO L273 TraceCheckUtils]: 38: Hoare triple {9537#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9537#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:24,914 INFO L273 TraceCheckUtils]: 39: Hoare triple {9537#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9538#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:24,915 INFO L273 TraceCheckUtils]: 40: Hoare triple {9538#(<= main_~i~1 17)} assume !(~i~1 < 100000); {9520#false} is VALID [2018-11-23 12:26:24,915 INFO L256 TraceCheckUtils]: 41: Hoare triple {9520#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {9519#true} is VALID [2018-11-23 12:26:24,915 INFO L273 TraceCheckUtils]: 42: Hoare triple {9519#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {9519#true} is VALID [2018-11-23 12:26:24,915 INFO L273 TraceCheckUtils]: 43: Hoare triple {9519#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:26:24,916 INFO L273 TraceCheckUtils]: 44: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:26:24,916 INFO L273 TraceCheckUtils]: 45: Hoare triple {9519#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:26:24,916 INFO L273 TraceCheckUtils]: 46: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:26:24,916 INFO L273 TraceCheckUtils]: 47: Hoare triple {9519#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:26:24,916 INFO L273 TraceCheckUtils]: 48: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:26:24,917 INFO L273 TraceCheckUtils]: 49: Hoare triple {9519#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:26:24,917 INFO L273 TraceCheckUtils]: 50: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:26:24,917 INFO L273 TraceCheckUtils]: 51: Hoare triple {9519#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:26:24,917 INFO L273 TraceCheckUtils]: 52: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:26:24,917 INFO L273 TraceCheckUtils]: 53: Hoare triple {9519#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:26:24,918 INFO L273 TraceCheckUtils]: 54: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:26:24,918 INFO L273 TraceCheckUtils]: 55: Hoare triple {9519#true} assume !(~i~0 < 100000); {9519#true} is VALID [2018-11-23 12:26:24,918 INFO L273 TraceCheckUtils]: 56: Hoare triple {9519#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {9519#true} is VALID [2018-11-23 12:26:24,918 INFO L273 TraceCheckUtils]: 57: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:26:24,918 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {9519#true} {9520#false} #70#return; {9520#false} is VALID [2018-11-23 12:26:24,919 INFO L273 TraceCheckUtils]: 59: Hoare triple {9520#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {9520#false} is VALID [2018-11-23 12:26:24,919 INFO L256 TraceCheckUtils]: 60: Hoare triple {9520#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {9519#true} is VALID [2018-11-23 12:26:24,919 INFO L273 TraceCheckUtils]: 61: Hoare triple {9519#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {9519#true} is VALID [2018-11-23 12:26:24,919 INFO L273 TraceCheckUtils]: 62: Hoare triple {9519#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:26:24,919 INFO L273 TraceCheckUtils]: 63: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:26:24,920 INFO L273 TraceCheckUtils]: 64: Hoare triple {9519#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:26:24,920 INFO L273 TraceCheckUtils]: 65: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:26:24,920 INFO L273 TraceCheckUtils]: 66: Hoare triple {9519#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:26:24,920 INFO L273 TraceCheckUtils]: 67: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:26:24,920 INFO L273 TraceCheckUtils]: 68: Hoare triple {9519#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:26:24,920 INFO L273 TraceCheckUtils]: 69: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:26:24,920 INFO L273 TraceCheckUtils]: 70: Hoare triple {9519#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:26:24,921 INFO L273 TraceCheckUtils]: 71: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:26:24,921 INFO L273 TraceCheckUtils]: 72: Hoare triple {9519#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:26:24,921 INFO L273 TraceCheckUtils]: 73: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:26:24,921 INFO L273 TraceCheckUtils]: 74: Hoare triple {9519#true} assume !(~i~0 < 100000); {9519#true} is VALID [2018-11-23 12:26:24,921 INFO L273 TraceCheckUtils]: 75: Hoare triple {9519#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {9519#true} is VALID [2018-11-23 12:26:24,921 INFO L273 TraceCheckUtils]: 76: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:26:24,921 INFO L268 TraceCheckUtils]: 77: Hoare quadruple {9519#true} {9520#false} #72#return; {9520#false} is VALID [2018-11-23 12:26:24,921 INFO L273 TraceCheckUtils]: 78: Hoare triple {9520#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {9520#false} is VALID [2018-11-23 12:26:24,921 INFO L273 TraceCheckUtils]: 79: Hoare triple {9520#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {9520#false} is VALID [2018-11-23 12:26:24,922 INFO L273 TraceCheckUtils]: 80: Hoare triple {9520#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {9520#false} is VALID [2018-11-23 12:26:24,922 INFO L273 TraceCheckUtils]: 81: Hoare triple {9520#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {9520#false} is VALID [2018-11-23 12:26:24,922 INFO L273 TraceCheckUtils]: 82: Hoare triple {9520#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {9520#false} is VALID [2018-11-23 12:26:24,922 INFO L273 TraceCheckUtils]: 83: Hoare triple {9520#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {9520#false} is VALID [2018-11-23 12:26:24,922 INFO L273 TraceCheckUtils]: 84: Hoare triple {9520#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {9520#false} is VALID [2018-11-23 12:26:24,922 INFO L273 TraceCheckUtils]: 85: Hoare triple {9520#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {9520#false} is VALID [2018-11-23 12:26:24,922 INFO L273 TraceCheckUtils]: 86: Hoare triple {9520#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {9520#false} is VALID [2018-11-23 12:26:24,922 INFO L273 TraceCheckUtils]: 87: Hoare triple {9520#false} assume !(~i~2 < 99999); {9520#false} is VALID [2018-11-23 12:26:24,922 INFO L273 TraceCheckUtils]: 88: Hoare triple {9520#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {9520#false} is VALID [2018-11-23 12:26:24,923 INFO L256 TraceCheckUtils]: 89: Hoare triple {9520#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {9519#true} is VALID [2018-11-23 12:26:24,923 INFO L273 TraceCheckUtils]: 90: Hoare triple {9519#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {9519#true} is VALID [2018-11-23 12:26:24,923 INFO L273 TraceCheckUtils]: 91: Hoare triple {9519#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:26:24,923 INFO L273 TraceCheckUtils]: 92: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:26:24,923 INFO L273 TraceCheckUtils]: 93: Hoare triple {9519#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:26:24,923 INFO L273 TraceCheckUtils]: 94: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:26:24,923 INFO L273 TraceCheckUtils]: 95: Hoare triple {9519#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:26:24,923 INFO L273 TraceCheckUtils]: 96: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:26:24,923 INFO L273 TraceCheckUtils]: 97: Hoare triple {9519#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:26:24,924 INFO L273 TraceCheckUtils]: 98: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:26:24,924 INFO L273 TraceCheckUtils]: 99: Hoare triple {9519#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:26:24,924 INFO L273 TraceCheckUtils]: 100: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:26:24,924 INFO L273 TraceCheckUtils]: 101: Hoare triple {9519#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:26:24,924 INFO L273 TraceCheckUtils]: 102: Hoare triple {9519#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9519#true} is VALID [2018-11-23 12:26:24,924 INFO L273 TraceCheckUtils]: 103: Hoare triple {9519#true} assume !(~i~0 < 100000); {9519#true} is VALID [2018-11-23 12:26:24,924 INFO L273 TraceCheckUtils]: 104: Hoare triple {9519#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {9519#true} is VALID [2018-11-23 12:26:24,924 INFO L273 TraceCheckUtils]: 105: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:26:24,925 INFO L268 TraceCheckUtils]: 106: Hoare quadruple {9519#true} {9520#false} #74#return; {9520#false} is VALID [2018-11-23 12:26:24,925 INFO L273 TraceCheckUtils]: 107: Hoare triple {9520#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {9520#false} is VALID [2018-11-23 12:26:24,925 INFO L273 TraceCheckUtils]: 108: Hoare triple {9520#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {9520#false} is VALID [2018-11-23 12:26:24,925 INFO L273 TraceCheckUtils]: 109: Hoare triple {9520#false} assume !false; {9520#false} is VALID [2018-11-23 12:26:24,930 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2018-11-23 12:26:24,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:24,931 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:24,940 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:26:25,405 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2018-11-23 12:26:25,406 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:25,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:25,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:25,664 INFO L256 TraceCheckUtils]: 0: Hoare triple {9519#true} call ULTIMATE.init(); {9519#true} is VALID [2018-11-23 12:26:25,664 INFO L273 TraceCheckUtils]: 1: Hoare triple {9519#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9519#true} is VALID [2018-11-23 12:26:25,664 INFO L273 TraceCheckUtils]: 2: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:26:25,664 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9519#true} {9519#true} #66#return; {9519#true} is VALID [2018-11-23 12:26:25,665 INFO L256 TraceCheckUtils]: 4: Hoare triple {9519#true} call #t~ret13 := main(); {9519#true} is VALID [2018-11-23 12:26:25,665 INFO L273 TraceCheckUtils]: 5: Hoare triple {9519#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {9519#true} is VALID [2018-11-23 12:26:25,665 INFO L273 TraceCheckUtils]: 6: Hoare triple {9519#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:26:25,666 INFO L273 TraceCheckUtils]: 7: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:26:25,666 INFO L273 TraceCheckUtils]: 8: Hoare triple {9519#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:26:25,666 INFO L273 TraceCheckUtils]: 9: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:26:25,666 INFO L273 TraceCheckUtils]: 10: Hoare triple {9519#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:26:25,667 INFO L273 TraceCheckUtils]: 11: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:26:25,667 INFO L273 TraceCheckUtils]: 12: Hoare triple {9519#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:26:25,667 INFO L273 TraceCheckUtils]: 13: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:26:25,667 INFO L273 TraceCheckUtils]: 14: Hoare triple {9519#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:26:25,667 INFO L273 TraceCheckUtils]: 15: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:26:25,667 INFO L273 TraceCheckUtils]: 16: Hoare triple {9519#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:26:25,668 INFO L273 TraceCheckUtils]: 17: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:26:25,668 INFO L273 TraceCheckUtils]: 18: Hoare triple {9519#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:26:25,668 INFO L273 TraceCheckUtils]: 19: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:26:25,668 INFO L273 TraceCheckUtils]: 20: Hoare triple {9519#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:26:25,668 INFO L273 TraceCheckUtils]: 21: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:26:25,669 INFO L273 TraceCheckUtils]: 22: Hoare triple {9519#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:26:25,669 INFO L273 TraceCheckUtils]: 23: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:26:25,669 INFO L273 TraceCheckUtils]: 24: Hoare triple {9519#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:26:25,669 INFO L273 TraceCheckUtils]: 25: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:26:25,669 INFO L273 TraceCheckUtils]: 26: Hoare triple {9519#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:26:25,669 INFO L273 TraceCheckUtils]: 27: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:26:25,670 INFO L273 TraceCheckUtils]: 28: Hoare triple {9519#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:26:25,670 INFO L273 TraceCheckUtils]: 29: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:26:25,670 INFO L273 TraceCheckUtils]: 30: Hoare triple {9519#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:26:25,670 INFO L273 TraceCheckUtils]: 31: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:26:25,670 INFO L273 TraceCheckUtils]: 32: Hoare triple {9519#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:26:25,670 INFO L273 TraceCheckUtils]: 33: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:26:25,670 INFO L273 TraceCheckUtils]: 34: Hoare triple {9519#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:26:25,671 INFO L273 TraceCheckUtils]: 35: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:26:25,671 INFO L273 TraceCheckUtils]: 36: Hoare triple {9519#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:26:25,671 INFO L273 TraceCheckUtils]: 37: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:26:25,671 INFO L273 TraceCheckUtils]: 38: Hoare triple {9519#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {9519#true} is VALID [2018-11-23 12:26:25,671 INFO L273 TraceCheckUtils]: 39: Hoare triple {9519#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {9519#true} is VALID [2018-11-23 12:26:25,671 INFO L273 TraceCheckUtils]: 40: Hoare triple {9519#true} assume !(~i~1 < 100000); {9519#true} is VALID [2018-11-23 12:26:25,672 INFO L256 TraceCheckUtils]: 41: Hoare triple {9519#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {9519#true} is VALID [2018-11-23 12:26:25,686 INFO L273 TraceCheckUtils]: 42: Hoare triple {9519#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {9668#(<= bor_~i~0 1)} is VALID [2018-11-23 12:26:25,695 INFO L273 TraceCheckUtils]: 43: Hoare triple {9668#(<= bor_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9668#(<= bor_~i~0 1)} is VALID [2018-11-23 12:26:25,697 INFO L273 TraceCheckUtils]: 44: Hoare triple {9668#(<= bor_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9675#(<= bor_~i~0 2)} is VALID [2018-11-23 12:26:25,698 INFO L273 TraceCheckUtils]: 45: Hoare triple {9675#(<= bor_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9675#(<= bor_~i~0 2)} is VALID [2018-11-23 12:26:25,699 INFO L273 TraceCheckUtils]: 46: Hoare triple {9675#(<= bor_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9682#(<= bor_~i~0 3)} is VALID [2018-11-23 12:26:25,699 INFO L273 TraceCheckUtils]: 47: Hoare triple {9682#(<= bor_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9682#(<= bor_~i~0 3)} is VALID [2018-11-23 12:26:25,701 INFO L273 TraceCheckUtils]: 48: Hoare triple {9682#(<= bor_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9689#(<= bor_~i~0 4)} is VALID [2018-11-23 12:26:25,701 INFO L273 TraceCheckUtils]: 49: Hoare triple {9689#(<= bor_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9689#(<= bor_~i~0 4)} is VALID [2018-11-23 12:26:25,701 INFO L273 TraceCheckUtils]: 50: Hoare triple {9689#(<= bor_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9696#(<= bor_~i~0 5)} is VALID [2018-11-23 12:26:25,702 INFO L273 TraceCheckUtils]: 51: Hoare triple {9696#(<= bor_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9696#(<= bor_~i~0 5)} is VALID [2018-11-23 12:26:25,702 INFO L273 TraceCheckUtils]: 52: Hoare triple {9696#(<= bor_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9703#(<= bor_~i~0 6)} is VALID [2018-11-23 12:26:25,703 INFO L273 TraceCheckUtils]: 53: Hoare triple {9703#(<= bor_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9703#(<= bor_~i~0 6)} is VALID [2018-11-23 12:26:25,703 INFO L273 TraceCheckUtils]: 54: Hoare triple {9703#(<= bor_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9710#(<= bor_~i~0 7)} is VALID [2018-11-23 12:26:25,703 INFO L273 TraceCheckUtils]: 55: Hoare triple {9710#(<= bor_~i~0 7)} assume !(~i~0 < 100000); {9520#false} is VALID [2018-11-23 12:26:25,703 INFO L273 TraceCheckUtils]: 56: Hoare triple {9520#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {9520#false} is VALID [2018-11-23 12:26:25,704 INFO L273 TraceCheckUtils]: 57: Hoare triple {9520#false} assume true; {9520#false} is VALID [2018-11-23 12:26:25,704 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {9520#false} {9519#true} #70#return; {9520#false} is VALID [2018-11-23 12:26:25,704 INFO L273 TraceCheckUtils]: 59: Hoare triple {9520#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {9520#false} is VALID [2018-11-23 12:26:25,704 INFO L256 TraceCheckUtils]: 60: Hoare triple {9520#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {9520#false} is VALID [2018-11-23 12:26:25,704 INFO L273 TraceCheckUtils]: 61: Hoare triple {9520#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {9520#false} is VALID [2018-11-23 12:26:25,704 INFO L273 TraceCheckUtils]: 62: Hoare triple {9520#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9520#false} is VALID [2018-11-23 12:26:25,704 INFO L273 TraceCheckUtils]: 63: Hoare triple {9520#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9520#false} is VALID [2018-11-23 12:26:25,705 INFO L273 TraceCheckUtils]: 64: Hoare triple {9520#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9520#false} is VALID [2018-11-23 12:26:25,705 INFO L273 TraceCheckUtils]: 65: Hoare triple {9520#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9520#false} is VALID [2018-11-23 12:26:25,705 INFO L273 TraceCheckUtils]: 66: Hoare triple {9520#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9520#false} is VALID [2018-11-23 12:26:25,705 INFO L273 TraceCheckUtils]: 67: Hoare triple {9520#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9520#false} is VALID [2018-11-23 12:26:25,705 INFO L273 TraceCheckUtils]: 68: Hoare triple {9520#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9520#false} is VALID [2018-11-23 12:26:25,706 INFO L273 TraceCheckUtils]: 69: Hoare triple {9520#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9520#false} is VALID [2018-11-23 12:26:25,706 INFO L273 TraceCheckUtils]: 70: Hoare triple {9520#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9520#false} is VALID [2018-11-23 12:26:25,706 INFO L273 TraceCheckUtils]: 71: Hoare triple {9520#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9520#false} is VALID [2018-11-23 12:26:25,706 INFO L273 TraceCheckUtils]: 72: Hoare triple {9520#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9520#false} is VALID [2018-11-23 12:26:25,706 INFO L273 TraceCheckUtils]: 73: Hoare triple {9520#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9520#false} is VALID [2018-11-23 12:26:25,706 INFO L273 TraceCheckUtils]: 74: Hoare triple {9520#false} assume !(~i~0 < 100000); {9520#false} is VALID [2018-11-23 12:26:25,707 INFO L273 TraceCheckUtils]: 75: Hoare triple {9520#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {9520#false} is VALID [2018-11-23 12:26:25,707 INFO L273 TraceCheckUtils]: 76: Hoare triple {9520#false} assume true; {9520#false} is VALID [2018-11-23 12:26:25,707 INFO L268 TraceCheckUtils]: 77: Hoare quadruple {9520#false} {9520#false} #72#return; {9520#false} is VALID [2018-11-23 12:26:25,707 INFO L273 TraceCheckUtils]: 78: Hoare triple {9520#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {9520#false} is VALID [2018-11-23 12:26:25,707 INFO L273 TraceCheckUtils]: 79: Hoare triple {9520#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {9520#false} is VALID [2018-11-23 12:26:25,707 INFO L273 TraceCheckUtils]: 80: Hoare triple {9520#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {9520#false} is VALID [2018-11-23 12:26:25,707 INFO L273 TraceCheckUtils]: 81: Hoare triple {9520#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {9520#false} is VALID [2018-11-23 12:26:25,707 INFO L273 TraceCheckUtils]: 82: Hoare triple {9520#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {9520#false} is VALID [2018-11-23 12:26:25,707 INFO L273 TraceCheckUtils]: 83: Hoare triple {9520#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {9520#false} is VALID [2018-11-23 12:26:25,708 INFO L273 TraceCheckUtils]: 84: Hoare triple {9520#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {9520#false} is VALID [2018-11-23 12:26:25,708 INFO L273 TraceCheckUtils]: 85: Hoare triple {9520#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {9520#false} is VALID [2018-11-23 12:26:25,708 INFO L273 TraceCheckUtils]: 86: Hoare triple {9520#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {9520#false} is VALID [2018-11-23 12:26:25,708 INFO L273 TraceCheckUtils]: 87: Hoare triple {9520#false} assume !(~i~2 < 99999); {9520#false} is VALID [2018-11-23 12:26:25,708 INFO L273 TraceCheckUtils]: 88: Hoare triple {9520#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {9520#false} is VALID [2018-11-23 12:26:25,708 INFO L256 TraceCheckUtils]: 89: Hoare triple {9520#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {9520#false} is VALID [2018-11-23 12:26:25,709 INFO L273 TraceCheckUtils]: 90: Hoare triple {9520#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {9520#false} is VALID [2018-11-23 12:26:25,709 INFO L273 TraceCheckUtils]: 91: Hoare triple {9520#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9520#false} is VALID [2018-11-23 12:26:25,709 INFO L273 TraceCheckUtils]: 92: Hoare triple {9520#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9520#false} is VALID [2018-11-23 12:26:25,709 INFO L273 TraceCheckUtils]: 93: Hoare triple {9520#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9520#false} is VALID [2018-11-23 12:26:25,709 INFO L273 TraceCheckUtils]: 94: Hoare triple {9520#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9520#false} is VALID [2018-11-23 12:26:25,709 INFO L273 TraceCheckUtils]: 95: Hoare triple {9520#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9520#false} is VALID [2018-11-23 12:26:25,710 INFO L273 TraceCheckUtils]: 96: Hoare triple {9520#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9520#false} is VALID [2018-11-23 12:26:25,710 INFO L273 TraceCheckUtils]: 97: Hoare triple {9520#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9520#false} is VALID [2018-11-23 12:26:25,710 INFO L273 TraceCheckUtils]: 98: Hoare triple {9520#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9520#false} is VALID [2018-11-23 12:26:25,710 INFO L273 TraceCheckUtils]: 99: Hoare triple {9520#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9520#false} is VALID [2018-11-23 12:26:25,710 INFO L273 TraceCheckUtils]: 100: Hoare triple {9520#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9520#false} is VALID [2018-11-23 12:26:25,710 INFO L273 TraceCheckUtils]: 101: Hoare triple {9520#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {9520#false} is VALID [2018-11-23 12:26:25,711 INFO L273 TraceCheckUtils]: 102: Hoare triple {9520#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9520#false} is VALID [2018-11-23 12:26:25,711 INFO L273 TraceCheckUtils]: 103: Hoare triple {9520#false} assume !(~i~0 < 100000); {9520#false} is VALID [2018-11-23 12:26:25,711 INFO L273 TraceCheckUtils]: 104: Hoare triple {9520#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {9520#false} is VALID [2018-11-23 12:26:25,711 INFO L273 TraceCheckUtils]: 105: Hoare triple {9520#false} assume true; {9520#false} is VALID [2018-11-23 12:26:25,711 INFO L268 TraceCheckUtils]: 106: Hoare quadruple {9520#false} {9520#false} #74#return; {9520#false} is VALID [2018-11-23 12:26:25,711 INFO L273 TraceCheckUtils]: 107: Hoare triple {9520#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {9520#false} is VALID [2018-11-23 12:26:25,711 INFO L273 TraceCheckUtils]: 108: Hoare triple {9520#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {9520#false} is VALID [2018-11-23 12:26:25,712 INFO L273 TraceCheckUtils]: 109: Hoare triple {9520#false} assume !false; {9520#false} is VALID [2018-11-23 12:26:25,716 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 172 proven. 36 refuted. 0 times theorem prover too weak. 472 trivial. 0 not checked. [2018-11-23 12:26:25,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:25,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9] total 27 [2018-11-23 12:26:25,736 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 110 [2018-11-23 12:26:25,737 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:25,737 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-23 12:26:25,833 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:25,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 12:26:25,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 12:26:25,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2018-11-23 12:26:25,835 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 27 states. [2018-11-23 12:26:26,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:26,741 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2018-11-23 12:26:26,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 12:26:26,742 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 110 [2018-11-23 12:26:26,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:26,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:26:26,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 106 transitions. [2018-11-23 12:26:26,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:26:26,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 106 transitions. [2018-11-23 12:26:26,745 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 106 transitions. [2018-11-23 12:26:26,874 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:26,875 INFO L225 Difference]: With dead ends: 119 [2018-11-23 12:26:26,876 INFO L226 Difference]: Without dead ends: 83 [2018-11-23 12:26:26,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2018-11-23 12:26:26,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-23 12:26:26,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-11-23 12:26:26,914 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:26,914 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 81 states. [2018-11-23 12:26:26,914 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 81 states. [2018-11-23 12:26:26,914 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 81 states. [2018-11-23 12:26:26,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:26,917 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-11-23 12:26:26,917 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-11-23 12:26:26,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:26,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:26,918 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 83 states. [2018-11-23 12:26:26,918 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 83 states. [2018-11-23 12:26:26,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:26,920 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-11-23 12:26:26,920 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-11-23 12:26:26,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:26,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:26,921 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:26,921 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:26,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-23 12:26:26,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2018-11-23 12:26:26,923 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 110 [2018-11-23 12:26:26,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:26,923 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-11-23 12:26:26,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 12:26:26,923 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-11-23 12:26:26,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-23 12:26:26,924 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:26,924 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 18, 18, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:26:26,924 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:26,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:26,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1680928935, now seen corresponding path program 18 times [2018-11-23 12:26:26,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:26,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:26,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:26,926 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:26,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:26,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:27,451 INFO L256 TraceCheckUtils]: 0: Hoare triple {10337#true} call ULTIMATE.init(); {10337#true} is VALID [2018-11-23 12:26:27,452 INFO L273 TraceCheckUtils]: 1: Hoare triple {10337#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10337#true} is VALID [2018-11-23 12:26:27,452 INFO L273 TraceCheckUtils]: 2: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:26:27,452 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10337#true} {10337#true} #66#return; {10337#true} is VALID [2018-11-23 12:26:27,452 INFO L256 TraceCheckUtils]: 4: Hoare triple {10337#true} call #t~ret13 := main(); {10337#true} is VALID [2018-11-23 12:26:27,453 INFO L273 TraceCheckUtils]: 5: Hoare triple {10337#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; {10339#(= main_~i~1 0)} is VALID [2018-11-23 12:26:27,453 INFO L273 TraceCheckUtils]: 6: Hoare triple {10339#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10339#(= main_~i~1 0)} is VALID [2018-11-23 12:26:27,454 INFO L273 TraceCheckUtils]: 7: Hoare triple {10339#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10340#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:27,454 INFO L273 TraceCheckUtils]: 8: Hoare triple {10340#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10340#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:27,455 INFO L273 TraceCheckUtils]: 9: Hoare triple {10340#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10341#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:27,455 INFO L273 TraceCheckUtils]: 10: Hoare triple {10341#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10341#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:27,455 INFO L273 TraceCheckUtils]: 11: Hoare triple {10341#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10342#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:27,456 INFO L273 TraceCheckUtils]: 12: Hoare triple {10342#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10342#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:27,456 INFO L273 TraceCheckUtils]: 13: Hoare triple {10342#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10343#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:27,457 INFO L273 TraceCheckUtils]: 14: Hoare triple {10343#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10343#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:27,458 INFO L273 TraceCheckUtils]: 15: Hoare triple {10343#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10344#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:27,458 INFO L273 TraceCheckUtils]: 16: Hoare triple {10344#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10344#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:27,459 INFO L273 TraceCheckUtils]: 17: Hoare triple {10344#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10345#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:27,459 INFO L273 TraceCheckUtils]: 18: Hoare triple {10345#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10345#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:27,460 INFO L273 TraceCheckUtils]: 19: Hoare triple {10345#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10346#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:27,463 INFO L273 TraceCheckUtils]: 20: Hoare triple {10346#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10346#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:27,463 INFO L273 TraceCheckUtils]: 21: Hoare triple {10346#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10347#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:27,465 INFO L273 TraceCheckUtils]: 22: Hoare triple {10347#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10347#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:27,465 INFO L273 TraceCheckUtils]: 23: Hoare triple {10347#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10348#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:27,466 INFO L273 TraceCheckUtils]: 24: Hoare triple {10348#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10348#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:27,466 INFO L273 TraceCheckUtils]: 25: Hoare triple {10348#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10349#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:27,466 INFO L273 TraceCheckUtils]: 26: Hoare triple {10349#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10349#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:27,467 INFO L273 TraceCheckUtils]: 27: Hoare triple {10349#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10350#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:27,467 INFO L273 TraceCheckUtils]: 28: Hoare triple {10350#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10350#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:27,467 INFO L273 TraceCheckUtils]: 29: Hoare triple {10350#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10351#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:27,468 INFO L273 TraceCheckUtils]: 30: Hoare triple {10351#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10351#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:27,471 INFO L273 TraceCheckUtils]: 31: Hoare triple {10351#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10352#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:27,472 INFO L273 TraceCheckUtils]: 32: Hoare triple {10352#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10352#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:27,472 INFO L273 TraceCheckUtils]: 33: Hoare triple {10352#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10353#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:27,472 INFO L273 TraceCheckUtils]: 34: Hoare triple {10353#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10353#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:27,473 INFO L273 TraceCheckUtils]: 35: Hoare triple {10353#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10354#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:27,473 INFO L273 TraceCheckUtils]: 36: Hoare triple {10354#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10354#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:27,474 INFO L273 TraceCheckUtils]: 37: Hoare triple {10354#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10355#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:27,474 INFO L273 TraceCheckUtils]: 38: Hoare triple {10355#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10355#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:27,474 INFO L273 TraceCheckUtils]: 39: Hoare triple {10355#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10356#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:27,475 INFO L273 TraceCheckUtils]: 40: Hoare triple {10356#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10356#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:27,475 INFO L273 TraceCheckUtils]: 41: Hoare triple {10356#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10357#(<= main_~i~1 18)} is VALID [2018-11-23 12:26:27,476 INFO L273 TraceCheckUtils]: 42: Hoare triple {10357#(<= main_~i~1 18)} assume !(~i~1 < 100000); {10338#false} is VALID [2018-11-23 12:26:27,476 INFO L256 TraceCheckUtils]: 43: Hoare triple {10338#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {10337#true} is VALID [2018-11-23 12:26:27,476 INFO L273 TraceCheckUtils]: 44: Hoare triple {10337#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10337#true} is VALID [2018-11-23 12:26:27,476 INFO L273 TraceCheckUtils]: 45: Hoare triple {10337#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:27,476 INFO L273 TraceCheckUtils]: 46: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:27,477 INFO L273 TraceCheckUtils]: 47: Hoare triple {10337#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:27,477 INFO L273 TraceCheckUtils]: 48: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:27,477 INFO L273 TraceCheckUtils]: 49: Hoare triple {10337#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:27,477 INFO L273 TraceCheckUtils]: 50: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:27,477 INFO L273 TraceCheckUtils]: 51: Hoare triple {10337#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:27,478 INFO L273 TraceCheckUtils]: 52: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:27,478 INFO L273 TraceCheckUtils]: 53: Hoare triple {10337#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:27,478 INFO L273 TraceCheckUtils]: 54: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:27,478 INFO L273 TraceCheckUtils]: 55: Hoare triple {10337#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:27,478 INFO L273 TraceCheckUtils]: 56: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:27,479 INFO L273 TraceCheckUtils]: 57: Hoare triple {10337#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:27,479 INFO L273 TraceCheckUtils]: 58: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:27,479 INFO L273 TraceCheckUtils]: 59: Hoare triple {10337#true} assume !(~i~0 < 100000); {10337#true} is VALID [2018-11-23 12:26:27,479 INFO L273 TraceCheckUtils]: 60: Hoare triple {10337#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10337#true} is VALID [2018-11-23 12:26:27,479 INFO L273 TraceCheckUtils]: 61: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:26:27,479 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {10337#true} {10338#false} #70#return; {10338#false} is VALID [2018-11-23 12:26:27,480 INFO L273 TraceCheckUtils]: 63: Hoare triple {10338#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {10338#false} is VALID [2018-11-23 12:26:27,480 INFO L256 TraceCheckUtils]: 64: Hoare triple {10338#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {10337#true} is VALID [2018-11-23 12:26:27,480 INFO L273 TraceCheckUtils]: 65: Hoare triple {10337#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10337#true} is VALID [2018-11-23 12:26:27,480 INFO L273 TraceCheckUtils]: 66: Hoare triple {10337#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:27,480 INFO L273 TraceCheckUtils]: 67: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:27,481 INFO L273 TraceCheckUtils]: 68: Hoare triple {10337#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:27,481 INFO L273 TraceCheckUtils]: 69: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:27,481 INFO L273 TraceCheckUtils]: 70: Hoare triple {10337#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:27,481 INFO L273 TraceCheckUtils]: 71: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:27,481 INFO L273 TraceCheckUtils]: 72: Hoare triple {10337#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:27,481 INFO L273 TraceCheckUtils]: 73: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:27,481 INFO L273 TraceCheckUtils]: 74: Hoare triple {10337#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:27,482 INFO L273 TraceCheckUtils]: 75: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:27,482 INFO L273 TraceCheckUtils]: 76: Hoare triple {10337#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:27,482 INFO L273 TraceCheckUtils]: 77: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:27,482 INFO L273 TraceCheckUtils]: 78: Hoare triple {10337#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:27,482 INFO L273 TraceCheckUtils]: 79: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:27,482 INFO L273 TraceCheckUtils]: 80: Hoare triple {10337#true} assume !(~i~0 < 100000); {10337#true} is VALID [2018-11-23 12:26:27,482 INFO L273 TraceCheckUtils]: 81: Hoare triple {10337#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10337#true} is VALID [2018-11-23 12:26:27,482 INFO L273 TraceCheckUtils]: 82: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:26:27,482 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {10337#true} {10338#false} #72#return; {10338#false} is VALID [2018-11-23 12:26:27,483 INFO L273 TraceCheckUtils]: 84: Hoare triple {10338#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {10338#false} is VALID [2018-11-23 12:26:27,483 INFO L273 TraceCheckUtils]: 85: Hoare triple {10338#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {10338#false} is VALID [2018-11-23 12:26:27,483 INFO L273 TraceCheckUtils]: 86: Hoare triple {10338#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {10338#false} is VALID [2018-11-23 12:26:27,483 INFO L273 TraceCheckUtils]: 87: Hoare triple {10338#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {10338#false} is VALID [2018-11-23 12:26:27,483 INFO L273 TraceCheckUtils]: 88: Hoare triple {10338#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {10338#false} is VALID [2018-11-23 12:26:27,483 INFO L273 TraceCheckUtils]: 89: Hoare triple {10338#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {10338#false} is VALID [2018-11-23 12:26:27,483 INFO L273 TraceCheckUtils]: 90: Hoare triple {10338#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {10338#false} is VALID [2018-11-23 12:26:27,483 INFO L273 TraceCheckUtils]: 91: Hoare triple {10338#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {10338#false} is VALID [2018-11-23 12:26:27,483 INFO L273 TraceCheckUtils]: 92: Hoare triple {10338#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {10338#false} is VALID [2018-11-23 12:26:27,484 INFO L273 TraceCheckUtils]: 93: Hoare triple {10338#false} assume !(~i~2 < 99999); {10338#false} is VALID [2018-11-23 12:26:27,484 INFO L273 TraceCheckUtils]: 94: Hoare triple {10338#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {10338#false} is VALID [2018-11-23 12:26:27,484 INFO L256 TraceCheckUtils]: 95: Hoare triple {10338#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {10337#true} is VALID [2018-11-23 12:26:27,484 INFO L273 TraceCheckUtils]: 96: Hoare triple {10337#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10337#true} is VALID [2018-11-23 12:26:27,484 INFO L273 TraceCheckUtils]: 97: Hoare triple {10337#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:27,484 INFO L273 TraceCheckUtils]: 98: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:27,484 INFO L273 TraceCheckUtils]: 99: Hoare triple {10337#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:27,484 INFO L273 TraceCheckUtils]: 100: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:27,484 INFO L273 TraceCheckUtils]: 101: Hoare triple {10337#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:27,485 INFO L273 TraceCheckUtils]: 102: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:27,485 INFO L273 TraceCheckUtils]: 103: Hoare triple {10337#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:27,485 INFO L273 TraceCheckUtils]: 104: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:27,485 INFO L273 TraceCheckUtils]: 105: Hoare triple {10337#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:27,485 INFO L273 TraceCheckUtils]: 106: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:27,485 INFO L273 TraceCheckUtils]: 107: Hoare triple {10337#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:27,485 INFO L273 TraceCheckUtils]: 108: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:27,485 INFO L273 TraceCheckUtils]: 109: Hoare triple {10337#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:27,485 INFO L273 TraceCheckUtils]: 110: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:27,486 INFO L273 TraceCheckUtils]: 111: Hoare triple {10337#true} assume !(~i~0 < 100000); {10337#true} is VALID [2018-11-23 12:26:27,486 INFO L273 TraceCheckUtils]: 112: Hoare triple {10337#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10337#true} is VALID [2018-11-23 12:26:27,486 INFO L273 TraceCheckUtils]: 113: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:26:27,486 INFO L268 TraceCheckUtils]: 114: Hoare quadruple {10337#true} {10338#false} #74#return; {10338#false} is VALID [2018-11-23 12:26:27,486 INFO L273 TraceCheckUtils]: 115: Hoare triple {10338#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {10338#false} is VALID [2018-11-23 12:26:27,486 INFO L273 TraceCheckUtils]: 116: Hoare triple {10338#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {10338#false} is VALID [2018-11-23 12:26:27,486 INFO L273 TraceCheckUtils]: 117: Hoare triple {10338#false} assume !false; {10338#false} is VALID [2018-11-23 12:26:27,492 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 514 trivial. 0 not checked. [2018-11-23 12:26:27,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:27,493 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:27,501 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:26:27,759 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-11-23 12:26:27,759 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:27,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:27,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:27,945 INFO L256 TraceCheckUtils]: 0: Hoare triple {10337#true} call ULTIMATE.init(); {10337#true} is VALID [2018-11-23 12:26:27,946 INFO L273 TraceCheckUtils]: 1: Hoare triple {10337#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10337#true} is VALID [2018-11-23 12:26:27,946 INFO L273 TraceCheckUtils]: 2: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:26:27,946 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10337#true} {10337#true} #66#return; {10337#true} is VALID [2018-11-23 12:26:27,946 INFO L256 TraceCheckUtils]: 4: Hoare triple {10337#true} call #t~ret13 := main(); {10337#true} is VALID [2018-11-23 12:26:27,947 INFO L273 TraceCheckUtils]: 5: Hoare triple {10337#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {10337#true} is VALID [2018-11-23 12:26:27,947 INFO L273 TraceCheckUtils]: 6: Hoare triple {10337#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10337#true} is VALID [2018-11-23 12:26:27,947 INFO L273 TraceCheckUtils]: 7: Hoare triple {10337#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10337#true} is VALID [2018-11-23 12:26:27,947 INFO L273 TraceCheckUtils]: 8: Hoare triple {10337#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10337#true} is VALID [2018-11-23 12:26:27,947 INFO L273 TraceCheckUtils]: 9: Hoare triple {10337#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10337#true} is VALID [2018-11-23 12:26:27,948 INFO L273 TraceCheckUtils]: 10: Hoare triple {10337#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10337#true} is VALID [2018-11-23 12:26:27,948 INFO L273 TraceCheckUtils]: 11: Hoare triple {10337#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10337#true} is VALID [2018-11-23 12:26:27,948 INFO L273 TraceCheckUtils]: 12: Hoare triple {10337#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10337#true} is VALID [2018-11-23 12:26:27,948 INFO L273 TraceCheckUtils]: 13: Hoare triple {10337#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10337#true} is VALID [2018-11-23 12:26:27,948 INFO L273 TraceCheckUtils]: 14: Hoare triple {10337#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10337#true} is VALID [2018-11-23 12:26:27,948 INFO L273 TraceCheckUtils]: 15: Hoare triple {10337#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10337#true} is VALID [2018-11-23 12:26:27,948 INFO L273 TraceCheckUtils]: 16: Hoare triple {10337#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10337#true} is VALID [2018-11-23 12:26:27,948 INFO L273 TraceCheckUtils]: 17: Hoare triple {10337#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10337#true} is VALID [2018-11-23 12:26:27,948 INFO L273 TraceCheckUtils]: 18: Hoare triple {10337#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10337#true} is VALID [2018-11-23 12:26:27,949 INFO L273 TraceCheckUtils]: 19: Hoare triple {10337#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10337#true} is VALID [2018-11-23 12:26:27,949 INFO L273 TraceCheckUtils]: 20: Hoare triple {10337#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10337#true} is VALID [2018-11-23 12:26:27,949 INFO L273 TraceCheckUtils]: 21: Hoare triple {10337#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10337#true} is VALID [2018-11-23 12:26:27,949 INFO L273 TraceCheckUtils]: 22: Hoare triple {10337#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10337#true} is VALID [2018-11-23 12:26:27,949 INFO L273 TraceCheckUtils]: 23: Hoare triple {10337#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10337#true} is VALID [2018-11-23 12:26:27,949 INFO L273 TraceCheckUtils]: 24: Hoare triple {10337#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10337#true} is VALID [2018-11-23 12:26:27,949 INFO L273 TraceCheckUtils]: 25: Hoare triple {10337#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10337#true} is VALID [2018-11-23 12:26:27,949 INFO L273 TraceCheckUtils]: 26: Hoare triple {10337#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10337#true} is VALID [2018-11-23 12:26:27,949 INFO L273 TraceCheckUtils]: 27: Hoare triple {10337#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10337#true} is VALID [2018-11-23 12:26:27,950 INFO L273 TraceCheckUtils]: 28: Hoare triple {10337#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10337#true} is VALID [2018-11-23 12:26:27,950 INFO L273 TraceCheckUtils]: 29: Hoare triple {10337#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10337#true} is VALID [2018-11-23 12:26:27,950 INFO L273 TraceCheckUtils]: 30: Hoare triple {10337#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10337#true} is VALID [2018-11-23 12:26:27,950 INFO L273 TraceCheckUtils]: 31: Hoare triple {10337#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10337#true} is VALID [2018-11-23 12:26:27,950 INFO L273 TraceCheckUtils]: 32: Hoare triple {10337#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10337#true} is VALID [2018-11-23 12:26:27,950 INFO L273 TraceCheckUtils]: 33: Hoare triple {10337#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10337#true} is VALID [2018-11-23 12:26:27,950 INFO L273 TraceCheckUtils]: 34: Hoare triple {10337#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10337#true} is VALID [2018-11-23 12:26:27,950 INFO L273 TraceCheckUtils]: 35: Hoare triple {10337#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10337#true} is VALID [2018-11-23 12:26:27,950 INFO L273 TraceCheckUtils]: 36: Hoare triple {10337#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10337#true} is VALID [2018-11-23 12:26:27,951 INFO L273 TraceCheckUtils]: 37: Hoare triple {10337#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10337#true} is VALID [2018-11-23 12:26:27,951 INFO L273 TraceCheckUtils]: 38: Hoare triple {10337#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10337#true} is VALID [2018-11-23 12:26:27,951 INFO L273 TraceCheckUtils]: 39: Hoare triple {10337#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10337#true} is VALID [2018-11-23 12:26:27,951 INFO L273 TraceCheckUtils]: 40: Hoare triple {10337#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {10337#true} is VALID [2018-11-23 12:26:27,951 INFO L273 TraceCheckUtils]: 41: Hoare triple {10337#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {10337#true} is VALID [2018-11-23 12:26:27,951 INFO L273 TraceCheckUtils]: 42: Hoare triple {10337#true} assume !(~i~1 < 100000); {10337#true} is VALID [2018-11-23 12:26:27,951 INFO L256 TraceCheckUtils]: 43: Hoare triple {10337#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {10337#true} is VALID [2018-11-23 12:26:27,951 INFO L273 TraceCheckUtils]: 44: Hoare triple {10337#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10337#true} is VALID [2018-11-23 12:26:27,952 INFO L273 TraceCheckUtils]: 45: Hoare triple {10337#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:27,952 INFO L273 TraceCheckUtils]: 46: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:27,952 INFO L273 TraceCheckUtils]: 47: Hoare triple {10337#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:27,952 INFO L273 TraceCheckUtils]: 48: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:27,952 INFO L273 TraceCheckUtils]: 49: Hoare triple {10337#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:27,952 INFO L273 TraceCheckUtils]: 50: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:27,952 INFO L273 TraceCheckUtils]: 51: Hoare triple {10337#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:27,952 INFO L273 TraceCheckUtils]: 52: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:27,952 INFO L273 TraceCheckUtils]: 53: Hoare triple {10337#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:27,953 INFO L273 TraceCheckUtils]: 54: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:27,953 INFO L273 TraceCheckUtils]: 55: Hoare triple {10337#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:27,953 INFO L273 TraceCheckUtils]: 56: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:27,953 INFO L273 TraceCheckUtils]: 57: Hoare triple {10337#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:27,953 INFO L273 TraceCheckUtils]: 58: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:27,953 INFO L273 TraceCheckUtils]: 59: Hoare triple {10337#true} assume !(~i~0 < 100000); {10337#true} is VALID [2018-11-23 12:26:27,953 INFO L273 TraceCheckUtils]: 60: Hoare triple {10337#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10337#true} is VALID [2018-11-23 12:26:27,953 INFO L273 TraceCheckUtils]: 61: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:26:27,953 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {10337#true} {10337#true} #70#return; {10337#true} is VALID [2018-11-23 12:26:27,954 INFO L273 TraceCheckUtils]: 63: Hoare triple {10337#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {10337#true} is VALID [2018-11-23 12:26:27,954 INFO L256 TraceCheckUtils]: 64: Hoare triple {10337#true} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {10337#true} is VALID [2018-11-23 12:26:27,954 INFO L273 TraceCheckUtils]: 65: Hoare triple {10337#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10337#true} is VALID [2018-11-23 12:26:27,954 INFO L273 TraceCheckUtils]: 66: Hoare triple {10337#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:27,954 INFO L273 TraceCheckUtils]: 67: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:27,954 INFO L273 TraceCheckUtils]: 68: Hoare triple {10337#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:27,954 INFO L273 TraceCheckUtils]: 69: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:27,954 INFO L273 TraceCheckUtils]: 70: Hoare triple {10337#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:27,954 INFO L273 TraceCheckUtils]: 71: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:27,955 INFO L273 TraceCheckUtils]: 72: Hoare triple {10337#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:27,955 INFO L273 TraceCheckUtils]: 73: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:27,955 INFO L273 TraceCheckUtils]: 74: Hoare triple {10337#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:27,955 INFO L273 TraceCheckUtils]: 75: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:27,955 INFO L273 TraceCheckUtils]: 76: Hoare triple {10337#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:27,955 INFO L273 TraceCheckUtils]: 77: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:27,955 INFO L273 TraceCheckUtils]: 78: Hoare triple {10337#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:26:27,955 INFO L273 TraceCheckUtils]: 79: Hoare triple {10337#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10337#true} is VALID [2018-11-23 12:26:27,955 INFO L273 TraceCheckUtils]: 80: Hoare triple {10337#true} assume !(~i~0 < 100000); {10337#true} is VALID [2018-11-23 12:26:27,956 INFO L273 TraceCheckUtils]: 81: Hoare triple {10337#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10337#true} is VALID [2018-11-23 12:26:27,956 INFO L273 TraceCheckUtils]: 82: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:26:27,956 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {10337#true} {10337#true} #72#return; {10337#true} is VALID [2018-11-23 12:26:27,956 INFO L273 TraceCheckUtils]: 84: Hoare triple {10337#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {10613#(<= main_~i~2 0)} is VALID [2018-11-23 12:26:27,957 INFO L273 TraceCheckUtils]: 85: Hoare triple {10613#(<= main_~i~2 0)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {10613#(<= main_~i~2 0)} is VALID [2018-11-23 12:26:27,957 INFO L273 TraceCheckUtils]: 86: Hoare triple {10613#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {10620#(<= main_~i~2 1)} is VALID [2018-11-23 12:26:27,957 INFO L273 TraceCheckUtils]: 87: Hoare triple {10620#(<= main_~i~2 1)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {10620#(<= main_~i~2 1)} is VALID [2018-11-23 12:26:27,958 INFO L273 TraceCheckUtils]: 88: Hoare triple {10620#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {10627#(<= main_~i~2 2)} is VALID [2018-11-23 12:26:27,958 INFO L273 TraceCheckUtils]: 89: Hoare triple {10627#(<= main_~i~2 2)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {10627#(<= main_~i~2 2)} is VALID [2018-11-23 12:26:27,959 INFO L273 TraceCheckUtils]: 90: Hoare triple {10627#(<= main_~i~2 2)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {10634#(<= main_~i~2 3)} is VALID [2018-11-23 12:26:27,959 INFO L273 TraceCheckUtils]: 91: Hoare triple {10634#(<= main_~i~2 3)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {10634#(<= main_~i~2 3)} is VALID [2018-11-23 12:26:27,959 INFO L273 TraceCheckUtils]: 92: Hoare triple {10634#(<= main_~i~2 3)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {10641#(<= main_~i~2 4)} is VALID [2018-11-23 12:26:27,960 INFO L273 TraceCheckUtils]: 93: Hoare triple {10641#(<= main_~i~2 4)} assume !(~i~2 < 99999); {10338#false} is VALID [2018-11-23 12:26:27,960 INFO L273 TraceCheckUtils]: 94: Hoare triple {10338#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {10338#false} is VALID [2018-11-23 12:26:27,960 INFO L256 TraceCheckUtils]: 95: Hoare triple {10338#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {10338#false} is VALID [2018-11-23 12:26:27,960 INFO L273 TraceCheckUtils]: 96: Hoare triple {10338#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10338#false} is VALID [2018-11-23 12:26:27,960 INFO L273 TraceCheckUtils]: 97: Hoare triple {10338#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10338#false} is VALID [2018-11-23 12:26:27,960 INFO L273 TraceCheckUtils]: 98: Hoare triple {10338#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10338#false} is VALID [2018-11-23 12:26:27,960 INFO L273 TraceCheckUtils]: 99: Hoare triple {10338#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10338#false} is VALID [2018-11-23 12:26:27,961 INFO L273 TraceCheckUtils]: 100: Hoare triple {10338#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10338#false} is VALID [2018-11-23 12:26:27,961 INFO L273 TraceCheckUtils]: 101: Hoare triple {10338#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10338#false} is VALID [2018-11-23 12:26:27,961 INFO L273 TraceCheckUtils]: 102: Hoare triple {10338#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10338#false} is VALID [2018-11-23 12:26:27,961 INFO L273 TraceCheckUtils]: 103: Hoare triple {10338#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10338#false} is VALID [2018-11-23 12:26:27,961 INFO L273 TraceCheckUtils]: 104: Hoare triple {10338#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10338#false} is VALID [2018-11-23 12:26:27,961 INFO L273 TraceCheckUtils]: 105: Hoare triple {10338#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10338#false} is VALID [2018-11-23 12:26:27,962 INFO L273 TraceCheckUtils]: 106: Hoare triple {10338#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10338#false} is VALID [2018-11-23 12:26:27,962 INFO L273 TraceCheckUtils]: 107: Hoare triple {10338#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10338#false} is VALID [2018-11-23 12:26:27,962 INFO L273 TraceCheckUtils]: 108: Hoare triple {10338#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10338#false} is VALID [2018-11-23 12:26:27,962 INFO L273 TraceCheckUtils]: 109: Hoare triple {10338#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {10338#false} is VALID [2018-11-23 12:26:27,962 INFO L273 TraceCheckUtils]: 110: Hoare triple {10338#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10338#false} is VALID [2018-11-23 12:26:27,963 INFO L273 TraceCheckUtils]: 111: Hoare triple {10338#false} assume !(~i~0 < 100000); {10338#false} is VALID [2018-11-23 12:26:27,963 INFO L273 TraceCheckUtils]: 112: Hoare triple {10338#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10338#false} is VALID [2018-11-23 12:26:27,963 INFO L273 TraceCheckUtils]: 113: Hoare triple {10338#false} assume true; {10338#false} is VALID [2018-11-23 12:26:27,963 INFO L268 TraceCheckUtils]: 114: Hoare quadruple {10338#false} {10338#false} #74#return; {10338#false} is VALID [2018-11-23 12:26:27,963 INFO L273 TraceCheckUtils]: 115: Hoare triple {10338#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {10338#false} is VALID [2018-11-23 12:26:27,964 INFO L273 TraceCheckUtils]: 116: Hoare triple {10338#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {10338#false} is VALID [2018-11-23 12:26:27,964 INFO L273 TraceCheckUtils]: 117: Hoare triple {10338#false} assume !false; {10338#false} is VALID [2018-11-23 12:26:27,969 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 234 proven. 16 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2018-11-23 12:26:27,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:27,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7] total 26 [2018-11-23 12:26:27,990 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 118 [2018-11-23 12:26:27,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:27,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 12:26:28,080 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:28,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 12:26:28,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 12:26:28,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:26:28,081 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 26 states. [2018-11-23 12:26:28,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:28,942 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2018-11-23 12:26:28,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 12:26:28,942 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 118 [2018-11-23 12:26:28,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:28,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:26:28,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 101 transitions. [2018-11-23 12:26:28,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:26:28,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 101 transitions. [2018-11-23 12:26:28,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 101 transitions. [2018-11-23 12:26:29,176 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:29,178 INFO L225 Difference]: With dead ends: 125 [2018-11-23 12:26:29,179 INFO L226 Difference]: Without dead ends: 87 [2018-11-23 12:26:29,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:26:29,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-23 12:26:29,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-11-23 12:26:29,208 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:29,208 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 85 states. [2018-11-23 12:26:29,208 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 85 states. [2018-11-23 12:26:29,209 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 85 states. [2018-11-23 12:26:29,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:29,211 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2018-11-23 12:26:29,211 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-11-23 12:26:29,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:29,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:29,212 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 87 states. [2018-11-23 12:26:29,212 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 87 states. [2018-11-23 12:26:29,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:29,213 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2018-11-23 12:26:29,213 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-11-23 12:26:29,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:29,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:29,214 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:29,214 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:29,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-23 12:26:29,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2018-11-23 12:26:29,215 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 118 [2018-11-23 12:26:29,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:29,215 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-11-23 12:26:29,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 12:26:29,215 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-11-23 12:26:29,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-23 12:26:29,216 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:29,216 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 19, 19, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:26:29,216 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:29,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:29,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1116806727, now seen corresponding path program 19 times [2018-11-23 12:26:29,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:29,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:29,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:29,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:29,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:29,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:29,778 INFO L256 TraceCheckUtils]: 0: Hoare triple {11201#true} call ULTIMATE.init(); {11201#true} is VALID [2018-11-23 12:26:29,778 INFO L273 TraceCheckUtils]: 1: Hoare triple {11201#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11201#true} is VALID [2018-11-23 12:26:29,778 INFO L273 TraceCheckUtils]: 2: Hoare triple {11201#true} assume true; {11201#true} is VALID [2018-11-23 12:26:29,778 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11201#true} {11201#true} #66#return; {11201#true} is VALID [2018-11-23 12:26:29,778 INFO L256 TraceCheckUtils]: 4: Hoare triple {11201#true} call #t~ret13 := main(); {11201#true} is VALID [2018-11-23 12:26:29,779 INFO L273 TraceCheckUtils]: 5: Hoare triple {11201#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; {11203#(= main_~i~1 0)} is VALID [2018-11-23 12:26:29,779 INFO L273 TraceCheckUtils]: 6: Hoare triple {11203#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11203#(= main_~i~1 0)} is VALID [2018-11-23 12:26:29,780 INFO L273 TraceCheckUtils]: 7: Hoare triple {11203#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11204#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:29,781 INFO L273 TraceCheckUtils]: 8: Hoare triple {11204#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11204#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:29,781 INFO L273 TraceCheckUtils]: 9: Hoare triple {11204#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11205#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:29,782 INFO L273 TraceCheckUtils]: 10: Hoare triple {11205#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11205#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:29,782 INFO L273 TraceCheckUtils]: 11: Hoare triple {11205#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11206#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:29,782 INFO L273 TraceCheckUtils]: 12: Hoare triple {11206#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11206#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:29,783 INFO L273 TraceCheckUtils]: 13: Hoare triple {11206#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11207#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:29,783 INFO L273 TraceCheckUtils]: 14: Hoare triple {11207#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11207#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:29,784 INFO L273 TraceCheckUtils]: 15: Hoare triple {11207#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11208#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:29,784 INFO L273 TraceCheckUtils]: 16: Hoare triple {11208#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11208#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:29,785 INFO L273 TraceCheckUtils]: 17: Hoare triple {11208#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11209#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:29,786 INFO L273 TraceCheckUtils]: 18: Hoare triple {11209#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11209#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:29,786 INFO L273 TraceCheckUtils]: 19: Hoare triple {11209#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11210#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:29,787 INFO L273 TraceCheckUtils]: 20: Hoare triple {11210#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11210#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:29,788 INFO L273 TraceCheckUtils]: 21: Hoare triple {11210#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11211#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:29,788 INFO L273 TraceCheckUtils]: 22: Hoare triple {11211#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11211#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:29,789 INFO L273 TraceCheckUtils]: 23: Hoare triple {11211#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11212#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:29,789 INFO L273 TraceCheckUtils]: 24: Hoare triple {11212#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11212#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:29,790 INFO L273 TraceCheckUtils]: 25: Hoare triple {11212#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11213#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:29,791 INFO L273 TraceCheckUtils]: 26: Hoare triple {11213#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11213#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:29,791 INFO L273 TraceCheckUtils]: 27: Hoare triple {11213#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11214#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:29,792 INFO L273 TraceCheckUtils]: 28: Hoare triple {11214#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11214#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:29,793 INFO L273 TraceCheckUtils]: 29: Hoare triple {11214#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11215#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:29,793 INFO L273 TraceCheckUtils]: 30: Hoare triple {11215#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11215#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:29,794 INFO L273 TraceCheckUtils]: 31: Hoare triple {11215#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11216#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:29,794 INFO L273 TraceCheckUtils]: 32: Hoare triple {11216#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11216#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:29,795 INFO L273 TraceCheckUtils]: 33: Hoare triple {11216#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11217#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:29,796 INFO L273 TraceCheckUtils]: 34: Hoare triple {11217#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11217#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:29,796 INFO L273 TraceCheckUtils]: 35: Hoare triple {11217#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11218#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:29,797 INFO L273 TraceCheckUtils]: 36: Hoare triple {11218#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11218#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:29,798 INFO L273 TraceCheckUtils]: 37: Hoare triple {11218#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11219#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:29,798 INFO L273 TraceCheckUtils]: 38: Hoare triple {11219#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11219#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:29,799 INFO L273 TraceCheckUtils]: 39: Hoare triple {11219#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11220#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:29,799 INFO L273 TraceCheckUtils]: 40: Hoare triple {11220#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11220#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:29,800 INFO L273 TraceCheckUtils]: 41: Hoare triple {11220#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11221#(<= main_~i~1 18)} is VALID [2018-11-23 12:26:29,800 INFO L273 TraceCheckUtils]: 42: Hoare triple {11221#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11221#(<= main_~i~1 18)} is VALID [2018-11-23 12:26:29,801 INFO L273 TraceCheckUtils]: 43: Hoare triple {11221#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11222#(<= main_~i~1 19)} is VALID [2018-11-23 12:26:29,802 INFO L273 TraceCheckUtils]: 44: Hoare triple {11222#(<= main_~i~1 19)} assume !(~i~1 < 100000); {11202#false} is VALID [2018-11-23 12:26:29,802 INFO L256 TraceCheckUtils]: 45: Hoare triple {11202#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {11201#true} is VALID [2018-11-23 12:26:29,802 INFO L273 TraceCheckUtils]: 46: Hoare triple {11201#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {11201#true} is VALID [2018-11-23 12:26:29,803 INFO L273 TraceCheckUtils]: 47: Hoare triple {11201#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:26:29,803 INFO L273 TraceCheckUtils]: 48: Hoare triple {11201#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11201#true} is VALID [2018-11-23 12:26:29,803 INFO L273 TraceCheckUtils]: 49: Hoare triple {11201#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:26:29,803 INFO L273 TraceCheckUtils]: 50: Hoare triple {11201#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11201#true} is VALID [2018-11-23 12:26:29,803 INFO L273 TraceCheckUtils]: 51: Hoare triple {11201#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:26:29,804 INFO L273 TraceCheckUtils]: 52: Hoare triple {11201#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11201#true} is VALID [2018-11-23 12:26:29,804 INFO L273 TraceCheckUtils]: 53: Hoare triple {11201#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:26:29,804 INFO L273 TraceCheckUtils]: 54: Hoare triple {11201#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11201#true} is VALID [2018-11-23 12:26:29,804 INFO L273 TraceCheckUtils]: 55: Hoare triple {11201#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:26:29,804 INFO L273 TraceCheckUtils]: 56: Hoare triple {11201#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11201#true} is VALID [2018-11-23 12:26:29,804 INFO L273 TraceCheckUtils]: 57: Hoare triple {11201#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:26:29,805 INFO L273 TraceCheckUtils]: 58: Hoare triple {11201#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11201#true} is VALID [2018-11-23 12:26:29,805 INFO L273 TraceCheckUtils]: 59: Hoare triple {11201#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:26:29,805 INFO L273 TraceCheckUtils]: 60: Hoare triple {11201#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11201#true} is VALID [2018-11-23 12:26:29,805 INFO L273 TraceCheckUtils]: 61: Hoare triple {11201#true} assume !(~i~0 < 100000); {11201#true} is VALID [2018-11-23 12:26:29,805 INFO L273 TraceCheckUtils]: 62: Hoare triple {11201#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11201#true} is VALID [2018-11-23 12:26:29,805 INFO L273 TraceCheckUtils]: 63: Hoare triple {11201#true} assume true; {11201#true} is VALID [2018-11-23 12:26:29,805 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {11201#true} {11202#false} #70#return; {11202#false} is VALID [2018-11-23 12:26:29,806 INFO L273 TraceCheckUtils]: 65: Hoare triple {11202#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {11202#false} is VALID [2018-11-23 12:26:29,806 INFO L256 TraceCheckUtils]: 66: Hoare triple {11202#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {11201#true} is VALID [2018-11-23 12:26:29,806 INFO L273 TraceCheckUtils]: 67: Hoare triple {11201#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {11201#true} is VALID [2018-11-23 12:26:29,806 INFO L273 TraceCheckUtils]: 68: Hoare triple {11201#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:26:29,806 INFO L273 TraceCheckUtils]: 69: Hoare triple {11201#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11201#true} is VALID [2018-11-23 12:26:29,806 INFO L273 TraceCheckUtils]: 70: Hoare triple {11201#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:26:29,806 INFO L273 TraceCheckUtils]: 71: Hoare triple {11201#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11201#true} is VALID [2018-11-23 12:26:29,806 INFO L273 TraceCheckUtils]: 72: Hoare triple {11201#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:26:29,807 INFO L273 TraceCheckUtils]: 73: Hoare triple {11201#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11201#true} is VALID [2018-11-23 12:26:29,807 INFO L273 TraceCheckUtils]: 74: Hoare triple {11201#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:26:29,807 INFO L273 TraceCheckUtils]: 75: Hoare triple {11201#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11201#true} is VALID [2018-11-23 12:26:29,807 INFO L273 TraceCheckUtils]: 76: Hoare triple {11201#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:26:29,807 INFO L273 TraceCheckUtils]: 77: Hoare triple {11201#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11201#true} is VALID [2018-11-23 12:26:29,807 INFO L273 TraceCheckUtils]: 78: Hoare triple {11201#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:26:29,807 INFO L273 TraceCheckUtils]: 79: Hoare triple {11201#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11201#true} is VALID [2018-11-23 12:26:29,807 INFO L273 TraceCheckUtils]: 80: Hoare triple {11201#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:26:29,807 INFO L273 TraceCheckUtils]: 81: Hoare triple {11201#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11201#true} is VALID [2018-11-23 12:26:29,808 INFO L273 TraceCheckUtils]: 82: Hoare triple {11201#true} assume !(~i~0 < 100000); {11201#true} is VALID [2018-11-23 12:26:29,808 INFO L273 TraceCheckUtils]: 83: Hoare triple {11201#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11201#true} is VALID [2018-11-23 12:26:29,808 INFO L273 TraceCheckUtils]: 84: Hoare triple {11201#true} assume true; {11201#true} is VALID [2018-11-23 12:26:29,808 INFO L268 TraceCheckUtils]: 85: Hoare quadruple {11201#true} {11202#false} #72#return; {11202#false} is VALID [2018-11-23 12:26:29,808 INFO L273 TraceCheckUtils]: 86: Hoare triple {11202#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {11202#false} is VALID [2018-11-23 12:26:29,808 INFO L273 TraceCheckUtils]: 87: Hoare triple {11202#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {11202#false} is VALID [2018-11-23 12:26:29,808 INFO L273 TraceCheckUtils]: 88: Hoare triple {11202#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {11202#false} is VALID [2018-11-23 12:26:29,808 INFO L273 TraceCheckUtils]: 89: Hoare triple {11202#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {11202#false} is VALID [2018-11-23 12:26:29,808 INFO L273 TraceCheckUtils]: 90: Hoare triple {11202#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {11202#false} is VALID [2018-11-23 12:26:29,809 INFO L273 TraceCheckUtils]: 91: Hoare triple {11202#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {11202#false} is VALID [2018-11-23 12:26:29,809 INFO L273 TraceCheckUtils]: 92: Hoare triple {11202#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {11202#false} is VALID [2018-11-23 12:26:29,809 INFO L273 TraceCheckUtils]: 93: Hoare triple {11202#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {11202#false} is VALID [2018-11-23 12:26:29,809 INFO L273 TraceCheckUtils]: 94: Hoare triple {11202#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {11202#false} is VALID [2018-11-23 12:26:29,809 INFO L273 TraceCheckUtils]: 95: Hoare triple {11202#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {11202#false} is VALID [2018-11-23 12:26:29,809 INFO L273 TraceCheckUtils]: 96: Hoare triple {11202#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {11202#false} is VALID [2018-11-23 12:26:29,809 INFO L273 TraceCheckUtils]: 97: Hoare triple {11202#false} assume !(~i~2 < 99999); {11202#false} is VALID [2018-11-23 12:26:29,809 INFO L273 TraceCheckUtils]: 98: Hoare triple {11202#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {11202#false} is VALID [2018-11-23 12:26:29,809 INFO L256 TraceCheckUtils]: 99: Hoare triple {11202#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {11201#true} is VALID [2018-11-23 12:26:29,810 INFO L273 TraceCheckUtils]: 100: Hoare triple {11201#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {11201#true} is VALID [2018-11-23 12:26:29,810 INFO L273 TraceCheckUtils]: 101: Hoare triple {11201#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:26:29,810 INFO L273 TraceCheckUtils]: 102: Hoare triple {11201#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11201#true} is VALID [2018-11-23 12:26:29,810 INFO L273 TraceCheckUtils]: 103: Hoare triple {11201#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:26:29,810 INFO L273 TraceCheckUtils]: 104: Hoare triple {11201#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11201#true} is VALID [2018-11-23 12:26:29,810 INFO L273 TraceCheckUtils]: 105: Hoare triple {11201#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:26:29,810 INFO L273 TraceCheckUtils]: 106: Hoare triple {11201#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11201#true} is VALID [2018-11-23 12:26:29,810 INFO L273 TraceCheckUtils]: 107: Hoare triple {11201#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:26:29,810 INFO L273 TraceCheckUtils]: 108: Hoare triple {11201#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11201#true} is VALID [2018-11-23 12:26:29,811 INFO L273 TraceCheckUtils]: 109: Hoare triple {11201#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:26:29,811 INFO L273 TraceCheckUtils]: 110: Hoare triple {11201#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11201#true} is VALID [2018-11-23 12:26:29,811 INFO L273 TraceCheckUtils]: 111: Hoare triple {11201#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:26:29,811 INFO L273 TraceCheckUtils]: 112: Hoare triple {11201#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11201#true} is VALID [2018-11-23 12:26:29,811 INFO L273 TraceCheckUtils]: 113: Hoare triple {11201#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:26:29,811 INFO L273 TraceCheckUtils]: 114: Hoare triple {11201#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11201#true} is VALID [2018-11-23 12:26:29,811 INFO L273 TraceCheckUtils]: 115: Hoare triple {11201#true} assume !(~i~0 < 100000); {11201#true} is VALID [2018-11-23 12:26:29,811 INFO L273 TraceCheckUtils]: 116: Hoare triple {11201#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11201#true} is VALID [2018-11-23 12:26:29,812 INFO L273 TraceCheckUtils]: 117: Hoare triple {11201#true} assume true; {11201#true} is VALID [2018-11-23 12:26:29,812 INFO L268 TraceCheckUtils]: 118: Hoare quadruple {11201#true} {11202#false} #74#return; {11202#false} is VALID [2018-11-23 12:26:29,812 INFO L273 TraceCheckUtils]: 119: Hoare triple {11202#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {11202#false} is VALID [2018-11-23 12:26:29,812 INFO L273 TraceCheckUtils]: 120: Hoare triple {11202#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {11202#false} is VALID [2018-11-23 12:26:29,812 INFO L273 TraceCheckUtils]: 121: Hoare triple {11202#false} assume !false; {11202#false} is VALID [2018-11-23 12:26:29,818 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2018-11-23 12:26:29,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:29,819 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:29,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:26:29,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:29,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:29,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:30,231 INFO L256 TraceCheckUtils]: 0: Hoare triple {11201#true} call ULTIMATE.init(); {11201#true} is VALID [2018-11-23 12:26:30,231 INFO L273 TraceCheckUtils]: 1: Hoare triple {11201#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11201#true} is VALID [2018-11-23 12:26:30,231 INFO L273 TraceCheckUtils]: 2: Hoare triple {11201#true} assume true; {11201#true} is VALID [2018-11-23 12:26:30,232 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11201#true} {11201#true} #66#return; {11201#true} is VALID [2018-11-23 12:26:30,232 INFO L256 TraceCheckUtils]: 4: Hoare triple {11201#true} call #t~ret13 := main(); {11201#true} is VALID [2018-11-23 12:26:30,233 INFO L273 TraceCheckUtils]: 5: Hoare triple {11201#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; {11241#(<= main_~i~1 0)} is VALID [2018-11-23 12:26:30,233 INFO L273 TraceCheckUtils]: 6: Hoare triple {11241#(<= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11241#(<= main_~i~1 0)} is VALID [2018-11-23 12:26:30,234 INFO L273 TraceCheckUtils]: 7: Hoare triple {11241#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11204#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:30,234 INFO L273 TraceCheckUtils]: 8: Hoare triple {11204#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11204#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:30,235 INFO L273 TraceCheckUtils]: 9: Hoare triple {11204#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11205#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:30,235 INFO L273 TraceCheckUtils]: 10: Hoare triple {11205#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11205#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:30,235 INFO L273 TraceCheckUtils]: 11: Hoare triple {11205#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11206#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:30,236 INFO L273 TraceCheckUtils]: 12: Hoare triple {11206#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11206#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:30,236 INFO L273 TraceCheckUtils]: 13: Hoare triple {11206#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11207#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:30,237 INFO L273 TraceCheckUtils]: 14: Hoare triple {11207#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11207#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:30,237 INFO L273 TraceCheckUtils]: 15: Hoare triple {11207#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11208#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:30,238 INFO L273 TraceCheckUtils]: 16: Hoare triple {11208#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11208#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:30,239 INFO L273 TraceCheckUtils]: 17: Hoare triple {11208#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11209#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:30,239 INFO L273 TraceCheckUtils]: 18: Hoare triple {11209#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11209#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:30,240 INFO L273 TraceCheckUtils]: 19: Hoare triple {11209#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11210#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:30,241 INFO L273 TraceCheckUtils]: 20: Hoare triple {11210#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11210#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:30,241 INFO L273 TraceCheckUtils]: 21: Hoare triple {11210#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11211#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:30,242 INFO L273 TraceCheckUtils]: 22: Hoare triple {11211#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11211#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:30,243 INFO L273 TraceCheckUtils]: 23: Hoare triple {11211#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11212#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:30,243 INFO L273 TraceCheckUtils]: 24: Hoare triple {11212#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11212#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:30,244 INFO L273 TraceCheckUtils]: 25: Hoare triple {11212#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11213#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:30,244 INFO L273 TraceCheckUtils]: 26: Hoare triple {11213#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11213#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:30,245 INFO L273 TraceCheckUtils]: 27: Hoare triple {11213#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11214#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:30,246 INFO L273 TraceCheckUtils]: 28: Hoare triple {11214#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11214#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:30,246 INFO L273 TraceCheckUtils]: 29: Hoare triple {11214#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11215#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:30,247 INFO L273 TraceCheckUtils]: 30: Hoare triple {11215#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11215#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:30,248 INFO L273 TraceCheckUtils]: 31: Hoare triple {11215#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11216#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:30,248 INFO L273 TraceCheckUtils]: 32: Hoare triple {11216#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11216#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:30,249 INFO L273 TraceCheckUtils]: 33: Hoare triple {11216#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11217#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:30,249 INFO L273 TraceCheckUtils]: 34: Hoare triple {11217#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11217#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:30,250 INFO L273 TraceCheckUtils]: 35: Hoare triple {11217#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11218#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:30,250 INFO L273 TraceCheckUtils]: 36: Hoare triple {11218#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11218#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:30,251 INFO L273 TraceCheckUtils]: 37: Hoare triple {11218#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11219#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:30,252 INFO L273 TraceCheckUtils]: 38: Hoare triple {11219#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11219#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:30,252 INFO L273 TraceCheckUtils]: 39: Hoare triple {11219#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11220#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:30,253 INFO L273 TraceCheckUtils]: 40: Hoare triple {11220#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11220#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:30,254 INFO L273 TraceCheckUtils]: 41: Hoare triple {11220#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11221#(<= main_~i~1 18)} is VALID [2018-11-23 12:26:30,254 INFO L273 TraceCheckUtils]: 42: Hoare triple {11221#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {11221#(<= main_~i~1 18)} is VALID [2018-11-23 12:26:30,255 INFO L273 TraceCheckUtils]: 43: Hoare triple {11221#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {11222#(<= main_~i~1 19)} is VALID [2018-11-23 12:26:30,256 INFO L273 TraceCheckUtils]: 44: Hoare triple {11222#(<= main_~i~1 19)} assume !(~i~1 < 100000); {11202#false} is VALID [2018-11-23 12:26:30,256 INFO L256 TraceCheckUtils]: 45: Hoare triple {11202#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {11202#false} is VALID [2018-11-23 12:26:30,256 INFO L273 TraceCheckUtils]: 46: Hoare triple {11202#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {11202#false} is VALID [2018-11-23 12:26:30,256 INFO L273 TraceCheckUtils]: 47: Hoare triple {11202#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:26:30,256 INFO L273 TraceCheckUtils]: 48: Hoare triple {11202#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11202#false} is VALID [2018-11-23 12:26:30,257 INFO L273 TraceCheckUtils]: 49: Hoare triple {11202#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:26:30,257 INFO L273 TraceCheckUtils]: 50: Hoare triple {11202#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11202#false} is VALID [2018-11-23 12:26:30,257 INFO L273 TraceCheckUtils]: 51: Hoare triple {11202#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:26:30,257 INFO L273 TraceCheckUtils]: 52: Hoare triple {11202#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11202#false} is VALID [2018-11-23 12:26:30,257 INFO L273 TraceCheckUtils]: 53: Hoare triple {11202#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:26:30,258 INFO L273 TraceCheckUtils]: 54: Hoare triple {11202#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11202#false} is VALID [2018-11-23 12:26:30,258 INFO L273 TraceCheckUtils]: 55: Hoare triple {11202#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:26:30,258 INFO L273 TraceCheckUtils]: 56: Hoare triple {11202#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11202#false} is VALID [2018-11-23 12:26:30,258 INFO L273 TraceCheckUtils]: 57: Hoare triple {11202#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:26:30,258 INFO L273 TraceCheckUtils]: 58: Hoare triple {11202#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11202#false} is VALID [2018-11-23 12:26:30,258 INFO L273 TraceCheckUtils]: 59: Hoare triple {11202#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:26:30,259 INFO L273 TraceCheckUtils]: 60: Hoare triple {11202#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11202#false} is VALID [2018-11-23 12:26:30,259 INFO L273 TraceCheckUtils]: 61: Hoare triple {11202#false} assume !(~i~0 < 100000); {11202#false} is VALID [2018-11-23 12:26:30,259 INFO L273 TraceCheckUtils]: 62: Hoare triple {11202#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11202#false} is VALID [2018-11-23 12:26:30,259 INFO L273 TraceCheckUtils]: 63: Hoare triple {11202#false} assume true; {11202#false} is VALID [2018-11-23 12:26:30,259 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {11202#false} {11202#false} #70#return; {11202#false} is VALID [2018-11-23 12:26:30,260 INFO L273 TraceCheckUtils]: 65: Hoare triple {11202#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {11202#false} is VALID [2018-11-23 12:26:30,260 INFO L256 TraceCheckUtils]: 66: Hoare triple {11202#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {11202#false} is VALID [2018-11-23 12:26:30,260 INFO L273 TraceCheckUtils]: 67: Hoare triple {11202#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {11202#false} is VALID [2018-11-23 12:26:30,260 INFO L273 TraceCheckUtils]: 68: Hoare triple {11202#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:26:30,260 INFO L273 TraceCheckUtils]: 69: Hoare triple {11202#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11202#false} is VALID [2018-11-23 12:26:30,260 INFO L273 TraceCheckUtils]: 70: Hoare triple {11202#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:26:30,261 INFO L273 TraceCheckUtils]: 71: Hoare triple {11202#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11202#false} is VALID [2018-11-23 12:26:30,261 INFO L273 TraceCheckUtils]: 72: Hoare triple {11202#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:26:30,261 INFO L273 TraceCheckUtils]: 73: Hoare triple {11202#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11202#false} is VALID [2018-11-23 12:26:30,261 INFO L273 TraceCheckUtils]: 74: Hoare triple {11202#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:26:30,261 INFO L273 TraceCheckUtils]: 75: Hoare triple {11202#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11202#false} is VALID [2018-11-23 12:26:30,261 INFO L273 TraceCheckUtils]: 76: Hoare triple {11202#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:26:30,261 INFO L273 TraceCheckUtils]: 77: Hoare triple {11202#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11202#false} is VALID [2018-11-23 12:26:30,262 INFO L273 TraceCheckUtils]: 78: Hoare triple {11202#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:26:30,262 INFO L273 TraceCheckUtils]: 79: Hoare triple {11202#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11202#false} is VALID [2018-11-23 12:26:30,262 INFO L273 TraceCheckUtils]: 80: Hoare triple {11202#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:26:30,262 INFO L273 TraceCheckUtils]: 81: Hoare triple {11202#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11202#false} is VALID [2018-11-23 12:26:30,262 INFO L273 TraceCheckUtils]: 82: Hoare triple {11202#false} assume !(~i~0 < 100000); {11202#false} is VALID [2018-11-23 12:26:30,262 INFO L273 TraceCheckUtils]: 83: Hoare triple {11202#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11202#false} is VALID [2018-11-23 12:26:30,262 INFO L273 TraceCheckUtils]: 84: Hoare triple {11202#false} assume true; {11202#false} is VALID [2018-11-23 12:26:30,262 INFO L268 TraceCheckUtils]: 85: Hoare quadruple {11202#false} {11202#false} #72#return; {11202#false} is VALID [2018-11-23 12:26:30,262 INFO L273 TraceCheckUtils]: 86: Hoare triple {11202#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {11202#false} is VALID [2018-11-23 12:26:30,263 INFO L273 TraceCheckUtils]: 87: Hoare triple {11202#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {11202#false} is VALID [2018-11-23 12:26:30,263 INFO L273 TraceCheckUtils]: 88: Hoare triple {11202#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {11202#false} is VALID [2018-11-23 12:26:30,263 INFO L273 TraceCheckUtils]: 89: Hoare triple {11202#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {11202#false} is VALID [2018-11-23 12:26:30,263 INFO L273 TraceCheckUtils]: 90: Hoare triple {11202#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {11202#false} is VALID [2018-11-23 12:26:30,263 INFO L273 TraceCheckUtils]: 91: Hoare triple {11202#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {11202#false} is VALID [2018-11-23 12:26:30,263 INFO L273 TraceCheckUtils]: 92: Hoare triple {11202#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {11202#false} is VALID [2018-11-23 12:26:30,263 INFO L273 TraceCheckUtils]: 93: Hoare triple {11202#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {11202#false} is VALID [2018-11-23 12:26:30,263 INFO L273 TraceCheckUtils]: 94: Hoare triple {11202#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {11202#false} is VALID [2018-11-23 12:26:30,263 INFO L273 TraceCheckUtils]: 95: Hoare triple {11202#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {11202#false} is VALID [2018-11-23 12:26:30,264 INFO L273 TraceCheckUtils]: 96: Hoare triple {11202#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {11202#false} is VALID [2018-11-23 12:26:30,264 INFO L273 TraceCheckUtils]: 97: Hoare triple {11202#false} assume !(~i~2 < 99999); {11202#false} is VALID [2018-11-23 12:26:30,264 INFO L273 TraceCheckUtils]: 98: Hoare triple {11202#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {11202#false} is VALID [2018-11-23 12:26:30,264 INFO L256 TraceCheckUtils]: 99: Hoare triple {11202#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {11202#false} is VALID [2018-11-23 12:26:30,264 INFO L273 TraceCheckUtils]: 100: Hoare triple {11202#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {11202#false} is VALID [2018-11-23 12:26:30,264 INFO L273 TraceCheckUtils]: 101: Hoare triple {11202#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:26:30,264 INFO L273 TraceCheckUtils]: 102: Hoare triple {11202#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11202#false} is VALID [2018-11-23 12:26:30,264 INFO L273 TraceCheckUtils]: 103: Hoare triple {11202#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:26:30,264 INFO L273 TraceCheckUtils]: 104: Hoare triple {11202#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11202#false} is VALID [2018-11-23 12:26:30,265 INFO L273 TraceCheckUtils]: 105: Hoare triple {11202#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:26:30,265 INFO L273 TraceCheckUtils]: 106: Hoare triple {11202#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11202#false} is VALID [2018-11-23 12:26:30,265 INFO L273 TraceCheckUtils]: 107: Hoare triple {11202#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:26:30,265 INFO L273 TraceCheckUtils]: 108: Hoare triple {11202#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11202#false} is VALID [2018-11-23 12:26:30,265 INFO L273 TraceCheckUtils]: 109: Hoare triple {11202#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:26:30,265 INFO L273 TraceCheckUtils]: 110: Hoare triple {11202#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11202#false} is VALID [2018-11-23 12:26:30,265 INFO L273 TraceCheckUtils]: 111: Hoare triple {11202#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:26:30,265 INFO L273 TraceCheckUtils]: 112: Hoare triple {11202#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11202#false} is VALID [2018-11-23 12:26:30,265 INFO L273 TraceCheckUtils]: 113: Hoare triple {11202#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:26:30,266 INFO L273 TraceCheckUtils]: 114: Hoare triple {11202#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11202#false} is VALID [2018-11-23 12:26:30,266 INFO L273 TraceCheckUtils]: 115: Hoare triple {11202#false} assume !(~i~0 < 100000); {11202#false} is VALID [2018-11-23 12:26:30,266 INFO L273 TraceCheckUtils]: 116: Hoare triple {11202#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11202#false} is VALID [2018-11-23 12:26:30,266 INFO L273 TraceCheckUtils]: 117: Hoare triple {11202#false} assume true; {11202#false} is VALID [2018-11-23 12:26:30,266 INFO L268 TraceCheckUtils]: 118: Hoare quadruple {11202#false} {11202#false} #74#return; {11202#false} is VALID [2018-11-23 12:26:30,266 INFO L273 TraceCheckUtils]: 119: Hoare triple {11202#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {11202#false} is VALID [2018-11-23 12:26:30,266 INFO L273 TraceCheckUtils]: 120: Hoare triple {11202#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {11202#false} is VALID [2018-11-23 12:26:30,266 INFO L273 TraceCheckUtils]: 121: Hoare triple {11202#false} assume !false; {11202#false} is VALID [2018-11-23 12:26:30,273 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2018-11-23 12:26:30,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:30,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-23 12:26:30,293 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 122 [2018-11-23 12:26:30,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:30,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 12:26:30,370 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:30,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 12:26:30,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 12:26:30,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:26:30,371 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 23 states. [2018-11-23 12:26:30,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:30,992 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-11-23 12:26:30,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 12:26:30,992 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 122 [2018-11-23 12:26:30,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:30,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:26:30,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 92 transitions. [2018-11-23 12:26:30,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:26:30,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 92 transitions. [2018-11-23 12:26:30,994 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 92 transitions. [2018-11-23 12:26:31,080 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:31,082 INFO L225 Difference]: With dead ends: 128 [2018-11-23 12:26:31,082 INFO L226 Difference]: Without dead ends: 88 [2018-11-23 12:26:31,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:26:31,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-23 12:26:31,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2018-11-23 12:26:31,114 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:31,114 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 87 states. [2018-11-23 12:26:31,115 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 87 states. [2018-11-23 12:26:31,115 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 87 states. [2018-11-23 12:26:31,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:31,116 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2018-11-23 12:26:31,116 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-11-23 12:26:31,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:31,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:31,117 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 88 states. [2018-11-23 12:26:31,117 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 88 states. [2018-11-23 12:26:31,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:31,118 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2018-11-23 12:26:31,118 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-11-23 12:26:31,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:31,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:31,119 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:31,119 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:31,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-23 12:26:31,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2018-11-23 12:26:31,121 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 122 [2018-11-23 12:26:31,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:31,121 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2018-11-23 12:26:31,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 12:26:31,122 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-11-23 12:26:31,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-23 12:26:31,122 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:31,123 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:26:31,123 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:31,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:31,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1211213925, now seen corresponding path program 20 times [2018-11-23 12:26:31,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:31,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:31,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:31,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:26:31,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:31,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:31,858 INFO L256 TraceCheckUtils]: 0: Hoare triple {12084#true} call ULTIMATE.init(); {12084#true} is VALID [2018-11-23 12:26:31,859 INFO L273 TraceCheckUtils]: 1: Hoare triple {12084#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12084#true} is VALID [2018-11-23 12:26:31,859 INFO L273 TraceCheckUtils]: 2: Hoare triple {12084#true} assume true; {12084#true} is VALID [2018-11-23 12:26:31,859 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12084#true} {12084#true} #66#return; {12084#true} is VALID [2018-11-23 12:26:31,859 INFO L256 TraceCheckUtils]: 4: Hoare triple {12084#true} call #t~ret13 := main(); {12084#true} is VALID [2018-11-23 12:26:31,860 INFO L273 TraceCheckUtils]: 5: Hoare triple {12084#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; {12086#(= main_~i~1 0)} is VALID [2018-11-23 12:26:31,860 INFO L273 TraceCheckUtils]: 6: Hoare triple {12086#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12086#(= main_~i~1 0)} is VALID [2018-11-23 12:26:31,860 INFO L273 TraceCheckUtils]: 7: Hoare triple {12086#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12087#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:31,861 INFO L273 TraceCheckUtils]: 8: Hoare triple {12087#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12087#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:31,861 INFO L273 TraceCheckUtils]: 9: Hoare triple {12087#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12088#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:31,862 INFO L273 TraceCheckUtils]: 10: Hoare triple {12088#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12088#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:31,862 INFO L273 TraceCheckUtils]: 11: Hoare triple {12088#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12089#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:31,863 INFO L273 TraceCheckUtils]: 12: Hoare triple {12089#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12089#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:31,863 INFO L273 TraceCheckUtils]: 13: Hoare triple {12089#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12090#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:31,864 INFO L273 TraceCheckUtils]: 14: Hoare triple {12090#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12090#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:31,865 INFO L273 TraceCheckUtils]: 15: Hoare triple {12090#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12091#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:31,865 INFO L273 TraceCheckUtils]: 16: Hoare triple {12091#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12091#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:31,866 INFO L273 TraceCheckUtils]: 17: Hoare triple {12091#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12092#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:31,867 INFO L273 TraceCheckUtils]: 18: Hoare triple {12092#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12092#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:31,868 INFO L273 TraceCheckUtils]: 19: Hoare triple {12092#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12093#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:31,868 INFO L273 TraceCheckUtils]: 20: Hoare triple {12093#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12093#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:31,869 INFO L273 TraceCheckUtils]: 21: Hoare triple {12093#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12094#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:31,870 INFO L273 TraceCheckUtils]: 22: Hoare triple {12094#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12094#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:31,871 INFO L273 TraceCheckUtils]: 23: Hoare triple {12094#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12095#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:31,871 INFO L273 TraceCheckUtils]: 24: Hoare triple {12095#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12095#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:31,872 INFO L273 TraceCheckUtils]: 25: Hoare triple {12095#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12096#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:31,873 INFO L273 TraceCheckUtils]: 26: Hoare triple {12096#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12096#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:31,874 INFO L273 TraceCheckUtils]: 27: Hoare triple {12096#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12097#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:31,874 INFO L273 TraceCheckUtils]: 28: Hoare triple {12097#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12097#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:31,875 INFO L273 TraceCheckUtils]: 29: Hoare triple {12097#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12098#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:31,876 INFO L273 TraceCheckUtils]: 30: Hoare triple {12098#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12098#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:31,876 INFO L273 TraceCheckUtils]: 31: Hoare triple {12098#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12099#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:31,877 INFO L273 TraceCheckUtils]: 32: Hoare triple {12099#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12099#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:31,878 INFO L273 TraceCheckUtils]: 33: Hoare triple {12099#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12100#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:31,879 INFO L273 TraceCheckUtils]: 34: Hoare triple {12100#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12100#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:31,879 INFO L273 TraceCheckUtils]: 35: Hoare triple {12100#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12101#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:31,880 INFO L273 TraceCheckUtils]: 36: Hoare triple {12101#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12101#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:31,881 INFO L273 TraceCheckUtils]: 37: Hoare triple {12101#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12102#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:31,881 INFO L273 TraceCheckUtils]: 38: Hoare triple {12102#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12102#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:31,882 INFO L273 TraceCheckUtils]: 39: Hoare triple {12102#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12103#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:31,883 INFO L273 TraceCheckUtils]: 40: Hoare triple {12103#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12103#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:31,884 INFO L273 TraceCheckUtils]: 41: Hoare triple {12103#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12104#(<= main_~i~1 18)} is VALID [2018-11-23 12:26:31,884 INFO L273 TraceCheckUtils]: 42: Hoare triple {12104#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12104#(<= main_~i~1 18)} is VALID [2018-11-23 12:26:31,885 INFO L273 TraceCheckUtils]: 43: Hoare triple {12104#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12105#(<= main_~i~1 19)} is VALID [2018-11-23 12:26:31,886 INFO L273 TraceCheckUtils]: 44: Hoare triple {12105#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12105#(<= main_~i~1 19)} is VALID [2018-11-23 12:26:31,887 INFO L273 TraceCheckUtils]: 45: Hoare triple {12105#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12106#(<= main_~i~1 20)} is VALID [2018-11-23 12:26:31,887 INFO L273 TraceCheckUtils]: 46: Hoare triple {12106#(<= main_~i~1 20)} assume !(~i~1 < 100000); {12085#false} is VALID [2018-11-23 12:26:31,888 INFO L256 TraceCheckUtils]: 47: Hoare triple {12085#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {12084#true} is VALID [2018-11-23 12:26:31,888 INFO L273 TraceCheckUtils]: 48: Hoare triple {12084#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {12084#true} is VALID [2018-11-23 12:26:31,888 INFO L273 TraceCheckUtils]: 49: Hoare triple {12084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:26:31,889 INFO L273 TraceCheckUtils]: 50: Hoare triple {12084#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12084#true} is VALID [2018-11-23 12:26:31,889 INFO L273 TraceCheckUtils]: 51: Hoare triple {12084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:26:31,889 INFO L273 TraceCheckUtils]: 52: Hoare triple {12084#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12084#true} is VALID [2018-11-23 12:26:31,889 INFO L273 TraceCheckUtils]: 53: Hoare triple {12084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:26:31,890 INFO L273 TraceCheckUtils]: 54: Hoare triple {12084#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12084#true} is VALID [2018-11-23 12:26:31,890 INFO L273 TraceCheckUtils]: 55: Hoare triple {12084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:26:31,890 INFO L273 TraceCheckUtils]: 56: Hoare triple {12084#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12084#true} is VALID [2018-11-23 12:26:31,890 INFO L273 TraceCheckUtils]: 57: Hoare triple {12084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:26:31,891 INFO L273 TraceCheckUtils]: 58: Hoare triple {12084#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12084#true} is VALID [2018-11-23 12:26:31,891 INFO L273 TraceCheckUtils]: 59: Hoare triple {12084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:26:31,891 INFO L273 TraceCheckUtils]: 60: Hoare triple {12084#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12084#true} is VALID [2018-11-23 12:26:31,891 INFO L273 TraceCheckUtils]: 61: Hoare triple {12084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:26:31,891 INFO L273 TraceCheckUtils]: 62: Hoare triple {12084#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12084#true} is VALID [2018-11-23 12:26:31,891 INFO L273 TraceCheckUtils]: 63: Hoare triple {12084#true} assume !(~i~0 < 100000); {12084#true} is VALID [2018-11-23 12:26:31,892 INFO L273 TraceCheckUtils]: 64: Hoare triple {12084#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {12084#true} is VALID [2018-11-23 12:26:31,892 INFO L273 TraceCheckUtils]: 65: Hoare triple {12084#true} assume true; {12084#true} is VALID [2018-11-23 12:26:31,892 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {12084#true} {12085#false} #70#return; {12085#false} is VALID [2018-11-23 12:26:31,892 INFO L273 TraceCheckUtils]: 67: Hoare triple {12085#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {12085#false} is VALID [2018-11-23 12:26:31,892 INFO L256 TraceCheckUtils]: 68: Hoare triple {12085#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {12084#true} is VALID [2018-11-23 12:26:31,892 INFO L273 TraceCheckUtils]: 69: Hoare triple {12084#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {12084#true} is VALID [2018-11-23 12:26:31,892 INFO L273 TraceCheckUtils]: 70: Hoare triple {12084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:26:31,893 INFO L273 TraceCheckUtils]: 71: Hoare triple {12084#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12084#true} is VALID [2018-11-23 12:26:31,893 INFO L273 TraceCheckUtils]: 72: Hoare triple {12084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:26:31,893 INFO L273 TraceCheckUtils]: 73: Hoare triple {12084#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12084#true} is VALID [2018-11-23 12:26:31,893 INFO L273 TraceCheckUtils]: 74: Hoare triple {12084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:26:31,893 INFO L273 TraceCheckUtils]: 75: Hoare triple {12084#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12084#true} is VALID [2018-11-23 12:26:31,893 INFO L273 TraceCheckUtils]: 76: Hoare triple {12084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:26:31,894 INFO L273 TraceCheckUtils]: 77: Hoare triple {12084#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12084#true} is VALID [2018-11-23 12:26:31,894 INFO L273 TraceCheckUtils]: 78: Hoare triple {12084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:26:31,894 INFO L273 TraceCheckUtils]: 79: Hoare triple {12084#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12084#true} is VALID [2018-11-23 12:26:31,894 INFO L273 TraceCheckUtils]: 80: Hoare triple {12084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:26:31,894 INFO L273 TraceCheckUtils]: 81: Hoare triple {12084#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12084#true} is VALID [2018-11-23 12:26:31,895 INFO L273 TraceCheckUtils]: 82: Hoare triple {12084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:26:31,895 INFO L273 TraceCheckUtils]: 83: Hoare triple {12084#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12084#true} is VALID [2018-11-23 12:26:31,895 INFO L273 TraceCheckUtils]: 84: Hoare triple {12084#true} assume !(~i~0 < 100000); {12084#true} is VALID [2018-11-23 12:26:31,895 INFO L273 TraceCheckUtils]: 85: Hoare triple {12084#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {12084#true} is VALID [2018-11-23 12:26:31,895 INFO L273 TraceCheckUtils]: 86: Hoare triple {12084#true} assume true; {12084#true} is VALID [2018-11-23 12:26:31,896 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {12084#true} {12085#false} #72#return; {12085#false} is VALID [2018-11-23 12:26:31,896 INFO L273 TraceCheckUtils]: 88: Hoare triple {12085#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {12085#false} is VALID [2018-11-23 12:26:31,896 INFO L273 TraceCheckUtils]: 89: Hoare triple {12085#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12085#false} is VALID [2018-11-23 12:26:31,896 INFO L273 TraceCheckUtils]: 90: Hoare triple {12085#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12085#false} is VALID [2018-11-23 12:26:31,896 INFO L273 TraceCheckUtils]: 91: Hoare triple {12085#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12085#false} is VALID [2018-11-23 12:26:31,897 INFO L273 TraceCheckUtils]: 92: Hoare triple {12085#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12085#false} is VALID [2018-11-23 12:26:31,897 INFO L273 TraceCheckUtils]: 93: Hoare triple {12085#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12085#false} is VALID [2018-11-23 12:26:31,897 INFO L273 TraceCheckUtils]: 94: Hoare triple {12085#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12085#false} is VALID [2018-11-23 12:26:31,897 INFO L273 TraceCheckUtils]: 95: Hoare triple {12085#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12085#false} is VALID [2018-11-23 12:26:31,898 INFO L273 TraceCheckUtils]: 96: Hoare triple {12085#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12085#false} is VALID [2018-11-23 12:26:31,898 INFO L273 TraceCheckUtils]: 97: Hoare triple {12085#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12085#false} is VALID [2018-11-23 12:26:31,898 INFO L273 TraceCheckUtils]: 98: Hoare triple {12085#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12085#false} is VALID [2018-11-23 12:26:31,898 INFO L273 TraceCheckUtils]: 99: Hoare triple {12085#false} assume !(~i~2 < 99999); {12085#false} is VALID [2018-11-23 12:26:31,898 INFO L273 TraceCheckUtils]: 100: Hoare triple {12085#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {12085#false} is VALID [2018-11-23 12:26:31,899 INFO L256 TraceCheckUtils]: 101: Hoare triple {12085#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {12084#true} is VALID [2018-11-23 12:26:31,899 INFO L273 TraceCheckUtils]: 102: Hoare triple {12084#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {12084#true} is VALID [2018-11-23 12:26:31,899 INFO L273 TraceCheckUtils]: 103: Hoare triple {12084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:26:31,899 INFO L273 TraceCheckUtils]: 104: Hoare triple {12084#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12084#true} is VALID [2018-11-23 12:26:31,899 INFO L273 TraceCheckUtils]: 105: Hoare triple {12084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:26:31,900 INFO L273 TraceCheckUtils]: 106: Hoare triple {12084#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12084#true} is VALID [2018-11-23 12:26:31,900 INFO L273 TraceCheckUtils]: 107: Hoare triple {12084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:26:31,900 INFO L273 TraceCheckUtils]: 108: Hoare triple {12084#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12084#true} is VALID [2018-11-23 12:26:31,900 INFO L273 TraceCheckUtils]: 109: Hoare triple {12084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:26:31,900 INFO L273 TraceCheckUtils]: 110: Hoare triple {12084#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12084#true} is VALID [2018-11-23 12:26:31,901 INFO L273 TraceCheckUtils]: 111: Hoare triple {12084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:26:31,901 INFO L273 TraceCheckUtils]: 112: Hoare triple {12084#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12084#true} is VALID [2018-11-23 12:26:31,901 INFO L273 TraceCheckUtils]: 113: Hoare triple {12084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:26:31,901 INFO L273 TraceCheckUtils]: 114: Hoare triple {12084#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12084#true} is VALID [2018-11-23 12:26:31,902 INFO L273 TraceCheckUtils]: 115: Hoare triple {12084#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:26:31,902 INFO L273 TraceCheckUtils]: 116: Hoare triple {12084#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12084#true} is VALID [2018-11-23 12:26:31,902 INFO L273 TraceCheckUtils]: 117: Hoare triple {12084#true} assume !(~i~0 < 100000); {12084#true} is VALID [2018-11-23 12:26:31,902 INFO L273 TraceCheckUtils]: 118: Hoare triple {12084#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {12084#true} is VALID [2018-11-23 12:26:31,902 INFO L273 TraceCheckUtils]: 119: Hoare triple {12084#true} assume true; {12084#true} is VALID [2018-11-23 12:26:31,903 INFO L268 TraceCheckUtils]: 120: Hoare quadruple {12084#true} {12085#false} #74#return; {12085#false} is VALID [2018-11-23 12:26:31,903 INFO L273 TraceCheckUtils]: 121: Hoare triple {12085#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {12085#false} is VALID [2018-11-23 12:26:31,903 INFO L273 TraceCheckUtils]: 122: Hoare triple {12085#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {12085#false} is VALID [2018-11-23 12:26:31,903 INFO L273 TraceCheckUtils]: 123: Hoare triple {12085#false} assume !false; {12085#false} is VALID [2018-11-23 12:26:31,917 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2018-11-23 12:26:31,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:31,917 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:31,930 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:26:32,008 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:26:32,008 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:32,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:32,473 INFO L256 TraceCheckUtils]: 0: Hoare triple {12084#true} call ULTIMATE.init(); {12084#true} is VALID [2018-11-23 12:26:32,474 INFO L273 TraceCheckUtils]: 1: Hoare triple {12084#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12084#true} is VALID [2018-11-23 12:26:32,474 INFO L273 TraceCheckUtils]: 2: Hoare triple {12084#true} assume true; {12084#true} is VALID [2018-11-23 12:26:32,474 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12084#true} {12084#true} #66#return; {12084#true} is VALID [2018-11-23 12:26:32,474 INFO L256 TraceCheckUtils]: 4: Hoare triple {12084#true} call #t~ret13 := main(); {12084#true} is VALID [2018-11-23 12:26:32,475 INFO L273 TraceCheckUtils]: 5: Hoare triple {12084#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; {12125#(<= main_~i~1 0)} is VALID [2018-11-23 12:26:32,476 INFO L273 TraceCheckUtils]: 6: Hoare triple {12125#(<= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12125#(<= main_~i~1 0)} is VALID [2018-11-23 12:26:32,476 INFO L273 TraceCheckUtils]: 7: Hoare triple {12125#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12087#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:32,476 INFO L273 TraceCheckUtils]: 8: Hoare triple {12087#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12087#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:32,477 INFO L273 TraceCheckUtils]: 9: Hoare triple {12087#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12088#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:32,477 INFO L273 TraceCheckUtils]: 10: Hoare triple {12088#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12088#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:32,478 INFO L273 TraceCheckUtils]: 11: Hoare triple {12088#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12089#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:32,479 INFO L273 TraceCheckUtils]: 12: Hoare triple {12089#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12089#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:32,503 INFO L273 TraceCheckUtils]: 13: Hoare triple {12089#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12090#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:32,504 INFO L273 TraceCheckUtils]: 14: Hoare triple {12090#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12090#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:32,505 INFO L273 TraceCheckUtils]: 15: Hoare triple {12090#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12091#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:32,505 INFO L273 TraceCheckUtils]: 16: Hoare triple {12091#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12091#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:32,505 INFO L273 TraceCheckUtils]: 17: Hoare triple {12091#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12092#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:32,506 INFO L273 TraceCheckUtils]: 18: Hoare triple {12092#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12092#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:32,506 INFO L273 TraceCheckUtils]: 19: Hoare triple {12092#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12093#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:32,506 INFO L273 TraceCheckUtils]: 20: Hoare triple {12093#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12093#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:32,507 INFO L273 TraceCheckUtils]: 21: Hoare triple {12093#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12094#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:32,507 INFO L273 TraceCheckUtils]: 22: Hoare triple {12094#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12094#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:32,508 INFO L273 TraceCheckUtils]: 23: Hoare triple {12094#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12095#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:32,508 INFO L273 TraceCheckUtils]: 24: Hoare triple {12095#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12095#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:32,508 INFO L273 TraceCheckUtils]: 25: Hoare triple {12095#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12096#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:32,509 INFO L273 TraceCheckUtils]: 26: Hoare triple {12096#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12096#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:32,510 INFO L273 TraceCheckUtils]: 27: Hoare triple {12096#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12097#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:32,510 INFO L273 TraceCheckUtils]: 28: Hoare triple {12097#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12097#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:32,511 INFO L273 TraceCheckUtils]: 29: Hoare triple {12097#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12098#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:32,511 INFO L273 TraceCheckUtils]: 30: Hoare triple {12098#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12098#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:32,512 INFO L273 TraceCheckUtils]: 31: Hoare triple {12098#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12099#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:32,513 INFO L273 TraceCheckUtils]: 32: Hoare triple {12099#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12099#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:32,513 INFO L273 TraceCheckUtils]: 33: Hoare triple {12099#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12100#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:32,514 INFO L273 TraceCheckUtils]: 34: Hoare triple {12100#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12100#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:32,515 INFO L273 TraceCheckUtils]: 35: Hoare triple {12100#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12101#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:32,515 INFO L273 TraceCheckUtils]: 36: Hoare triple {12101#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12101#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:32,516 INFO L273 TraceCheckUtils]: 37: Hoare triple {12101#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12102#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:32,516 INFO L273 TraceCheckUtils]: 38: Hoare triple {12102#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12102#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:32,517 INFO L273 TraceCheckUtils]: 39: Hoare triple {12102#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12103#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:32,518 INFO L273 TraceCheckUtils]: 40: Hoare triple {12103#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12103#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:32,518 INFO L273 TraceCheckUtils]: 41: Hoare triple {12103#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12104#(<= main_~i~1 18)} is VALID [2018-11-23 12:26:32,519 INFO L273 TraceCheckUtils]: 42: Hoare triple {12104#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12104#(<= main_~i~1 18)} is VALID [2018-11-23 12:26:32,520 INFO L273 TraceCheckUtils]: 43: Hoare triple {12104#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12105#(<= main_~i~1 19)} is VALID [2018-11-23 12:26:32,520 INFO L273 TraceCheckUtils]: 44: Hoare triple {12105#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12105#(<= main_~i~1 19)} is VALID [2018-11-23 12:26:32,521 INFO L273 TraceCheckUtils]: 45: Hoare triple {12105#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12106#(<= main_~i~1 20)} is VALID [2018-11-23 12:26:32,521 INFO L273 TraceCheckUtils]: 46: Hoare triple {12106#(<= main_~i~1 20)} assume !(~i~1 < 100000); {12085#false} is VALID [2018-11-23 12:26:32,522 INFO L256 TraceCheckUtils]: 47: Hoare triple {12085#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {12085#false} is VALID [2018-11-23 12:26:32,522 INFO L273 TraceCheckUtils]: 48: Hoare triple {12085#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {12085#false} is VALID [2018-11-23 12:26:32,522 INFO L273 TraceCheckUtils]: 49: Hoare triple {12085#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:26:32,522 INFO L273 TraceCheckUtils]: 50: Hoare triple {12085#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12085#false} is VALID [2018-11-23 12:26:32,522 INFO L273 TraceCheckUtils]: 51: Hoare triple {12085#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:26:32,523 INFO L273 TraceCheckUtils]: 52: Hoare triple {12085#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12085#false} is VALID [2018-11-23 12:26:32,523 INFO L273 TraceCheckUtils]: 53: Hoare triple {12085#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:26:32,523 INFO L273 TraceCheckUtils]: 54: Hoare triple {12085#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12085#false} is VALID [2018-11-23 12:26:32,523 INFO L273 TraceCheckUtils]: 55: Hoare triple {12085#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:26:32,523 INFO L273 TraceCheckUtils]: 56: Hoare triple {12085#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12085#false} is VALID [2018-11-23 12:26:32,524 INFO L273 TraceCheckUtils]: 57: Hoare triple {12085#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:26:32,524 INFO L273 TraceCheckUtils]: 58: Hoare triple {12085#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12085#false} is VALID [2018-11-23 12:26:32,524 INFO L273 TraceCheckUtils]: 59: Hoare triple {12085#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:26:32,524 INFO L273 TraceCheckUtils]: 60: Hoare triple {12085#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12085#false} is VALID [2018-11-23 12:26:32,524 INFO L273 TraceCheckUtils]: 61: Hoare triple {12085#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:26:32,525 INFO L273 TraceCheckUtils]: 62: Hoare triple {12085#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12085#false} is VALID [2018-11-23 12:26:32,525 INFO L273 TraceCheckUtils]: 63: Hoare triple {12085#false} assume !(~i~0 < 100000); {12085#false} is VALID [2018-11-23 12:26:32,525 INFO L273 TraceCheckUtils]: 64: Hoare triple {12085#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {12085#false} is VALID [2018-11-23 12:26:32,525 INFO L273 TraceCheckUtils]: 65: Hoare triple {12085#false} assume true; {12085#false} is VALID [2018-11-23 12:26:32,525 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {12085#false} {12085#false} #70#return; {12085#false} is VALID [2018-11-23 12:26:32,525 INFO L273 TraceCheckUtils]: 67: Hoare triple {12085#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {12085#false} is VALID [2018-11-23 12:26:32,526 INFO L256 TraceCheckUtils]: 68: Hoare triple {12085#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {12085#false} is VALID [2018-11-23 12:26:32,526 INFO L273 TraceCheckUtils]: 69: Hoare triple {12085#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {12085#false} is VALID [2018-11-23 12:26:32,526 INFO L273 TraceCheckUtils]: 70: Hoare triple {12085#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:26:32,526 INFO L273 TraceCheckUtils]: 71: Hoare triple {12085#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12085#false} is VALID [2018-11-23 12:26:32,526 INFO L273 TraceCheckUtils]: 72: Hoare triple {12085#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:26:32,526 INFO L273 TraceCheckUtils]: 73: Hoare triple {12085#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12085#false} is VALID [2018-11-23 12:26:32,527 INFO L273 TraceCheckUtils]: 74: Hoare triple {12085#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:26:32,527 INFO L273 TraceCheckUtils]: 75: Hoare triple {12085#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12085#false} is VALID [2018-11-23 12:26:32,527 INFO L273 TraceCheckUtils]: 76: Hoare triple {12085#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:26:32,527 INFO L273 TraceCheckUtils]: 77: Hoare triple {12085#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12085#false} is VALID [2018-11-23 12:26:32,527 INFO L273 TraceCheckUtils]: 78: Hoare triple {12085#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:26:32,527 INFO L273 TraceCheckUtils]: 79: Hoare triple {12085#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12085#false} is VALID [2018-11-23 12:26:32,527 INFO L273 TraceCheckUtils]: 80: Hoare triple {12085#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:26:32,527 INFO L273 TraceCheckUtils]: 81: Hoare triple {12085#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12085#false} is VALID [2018-11-23 12:26:32,527 INFO L273 TraceCheckUtils]: 82: Hoare triple {12085#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:26:32,527 INFO L273 TraceCheckUtils]: 83: Hoare triple {12085#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12085#false} is VALID [2018-11-23 12:26:32,528 INFO L273 TraceCheckUtils]: 84: Hoare triple {12085#false} assume !(~i~0 < 100000); {12085#false} is VALID [2018-11-23 12:26:32,528 INFO L273 TraceCheckUtils]: 85: Hoare triple {12085#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {12085#false} is VALID [2018-11-23 12:26:32,528 INFO L273 TraceCheckUtils]: 86: Hoare triple {12085#false} assume true; {12085#false} is VALID [2018-11-23 12:26:32,528 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {12085#false} {12085#false} #72#return; {12085#false} is VALID [2018-11-23 12:26:32,528 INFO L273 TraceCheckUtils]: 88: Hoare triple {12085#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {12085#false} is VALID [2018-11-23 12:26:32,528 INFO L273 TraceCheckUtils]: 89: Hoare triple {12085#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12085#false} is VALID [2018-11-23 12:26:32,528 INFO L273 TraceCheckUtils]: 90: Hoare triple {12085#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12085#false} is VALID [2018-11-23 12:26:32,528 INFO L273 TraceCheckUtils]: 91: Hoare triple {12085#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12085#false} is VALID [2018-11-23 12:26:32,528 INFO L273 TraceCheckUtils]: 92: Hoare triple {12085#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12085#false} is VALID [2018-11-23 12:26:32,529 INFO L273 TraceCheckUtils]: 93: Hoare triple {12085#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12085#false} is VALID [2018-11-23 12:26:32,529 INFO L273 TraceCheckUtils]: 94: Hoare triple {12085#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12085#false} is VALID [2018-11-23 12:26:32,529 INFO L273 TraceCheckUtils]: 95: Hoare triple {12085#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12085#false} is VALID [2018-11-23 12:26:32,529 INFO L273 TraceCheckUtils]: 96: Hoare triple {12085#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12085#false} is VALID [2018-11-23 12:26:32,529 INFO L273 TraceCheckUtils]: 97: Hoare triple {12085#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12085#false} is VALID [2018-11-23 12:26:32,529 INFO L273 TraceCheckUtils]: 98: Hoare triple {12085#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12085#false} is VALID [2018-11-23 12:26:32,529 INFO L273 TraceCheckUtils]: 99: Hoare triple {12085#false} assume !(~i~2 < 99999); {12085#false} is VALID [2018-11-23 12:26:32,529 INFO L273 TraceCheckUtils]: 100: Hoare triple {12085#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {12085#false} is VALID [2018-11-23 12:26:32,529 INFO L256 TraceCheckUtils]: 101: Hoare triple {12085#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {12085#false} is VALID [2018-11-23 12:26:32,530 INFO L273 TraceCheckUtils]: 102: Hoare triple {12085#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {12085#false} is VALID [2018-11-23 12:26:32,530 INFO L273 TraceCheckUtils]: 103: Hoare triple {12085#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:26:32,530 INFO L273 TraceCheckUtils]: 104: Hoare triple {12085#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12085#false} is VALID [2018-11-23 12:26:32,530 INFO L273 TraceCheckUtils]: 105: Hoare triple {12085#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:26:32,530 INFO L273 TraceCheckUtils]: 106: Hoare triple {12085#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12085#false} is VALID [2018-11-23 12:26:32,530 INFO L273 TraceCheckUtils]: 107: Hoare triple {12085#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:26:32,530 INFO L273 TraceCheckUtils]: 108: Hoare triple {12085#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12085#false} is VALID [2018-11-23 12:26:32,530 INFO L273 TraceCheckUtils]: 109: Hoare triple {12085#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:26:32,530 INFO L273 TraceCheckUtils]: 110: Hoare triple {12085#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12085#false} is VALID [2018-11-23 12:26:32,530 INFO L273 TraceCheckUtils]: 111: Hoare triple {12085#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:26:32,531 INFO L273 TraceCheckUtils]: 112: Hoare triple {12085#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12085#false} is VALID [2018-11-23 12:26:32,531 INFO L273 TraceCheckUtils]: 113: Hoare triple {12085#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:26:32,531 INFO L273 TraceCheckUtils]: 114: Hoare triple {12085#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12085#false} is VALID [2018-11-23 12:26:32,531 INFO L273 TraceCheckUtils]: 115: Hoare triple {12085#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:26:32,531 INFO L273 TraceCheckUtils]: 116: Hoare triple {12085#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12085#false} is VALID [2018-11-23 12:26:32,531 INFO L273 TraceCheckUtils]: 117: Hoare triple {12085#false} assume !(~i~0 < 100000); {12085#false} is VALID [2018-11-23 12:26:32,531 INFO L273 TraceCheckUtils]: 118: Hoare triple {12085#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {12085#false} is VALID [2018-11-23 12:26:32,531 INFO L273 TraceCheckUtils]: 119: Hoare triple {12085#false} assume true; {12085#false} is VALID [2018-11-23 12:26:32,531 INFO L268 TraceCheckUtils]: 120: Hoare quadruple {12085#false} {12085#false} #74#return; {12085#false} is VALID [2018-11-23 12:26:32,532 INFO L273 TraceCheckUtils]: 121: Hoare triple {12085#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {12085#false} is VALID [2018-11-23 12:26:32,532 INFO L273 TraceCheckUtils]: 122: Hoare triple {12085#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {12085#false} is VALID [2018-11-23 12:26:32,532 INFO L273 TraceCheckUtils]: 123: Hoare triple {12085#false} assume !false; {12085#false} is VALID [2018-11-23 12:26:32,539 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2018-11-23 12:26:32,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:32,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-23 12:26:32,558 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 124 [2018-11-23 12:26:32,558 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:32,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 12:26:32,639 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:32,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 12:26:32,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 12:26:32,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:26:32,641 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 24 states. [2018-11-23 12:26:33,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:33,055 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2018-11-23 12:26:33,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 12:26:33,056 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 124 [2018-11-23 12:26:33,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:33,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:26:33,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 94 transitions. [2018-11-23 12:26:33,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:26:33,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 94 transitions. [2018-11-23 12:26:33,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 94 transitions. [2018-11-23 12:26:33,195 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:33,197 INFO L225 Difference]: With dead ends: 130 [2018-11-23 12:26:33,197 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 12:26:33,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:26:33,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 12:26:33,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-11-23 12:26:33,228 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:33,229 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 89 states. [2018-11-23 12:26:33,229 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 89 states. [2018-11-23 12:26:33,229 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 89 states. [2018-11-23 12:26:33,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:33,231 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-11-23 12:26:33,231 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-11-23 12:26:33,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:33,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:33,233 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 90 states. [2018-11-23 12:26:33,233 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 90 states. [2018-11-23 12:26:33,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:33,234 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-11-23 12:26:33,235 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-11-23 12:26:33,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:33,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:33,235 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:33,235 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:33,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-23 12:26:33,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-11-23 12:26:33,237 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 124 [2018-11-23 12:26:33,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:33,237 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-11-23 12:26:33,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 12:26:33,238 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-11-23 12:26:33,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-23 12:26:33,238 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:33,239 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:26:33,239 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:33,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:33,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1742217987, now seen corresponding path program 21 times [2018-11-23 12:26:33,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:33,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:33,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:33,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:33,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:33,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:34,371 INFO L256 TraceCheckUtils]: 0: Hoare triple {12984#true} call ULTIMATE.init(); {12984#true} is VALID [2018-11-23 12:26:34,372 INFO L273 TraceCheckUtils]: 1: Hoare triple {12984#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12984#true} is VALID [2018-11-23 12:26:34,372 INFO L273 TraceCheckUtils]: 2: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:26:34,372 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12984#true} {12984#true} #66#return; {12984#true} is VALID [2018-11-23 12:26:34,372 INFO L256 TraceCheckUtils]: 4: Hoare triple {12984#true} call #t~ret13 := main(); {12984#true} is VALID [2018-11-23 12:26:34,373 INFO L273 TraceCheckUtils]: 5: Hoare triple {12984#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; {12986#(= main_~i~1 0)} is VALID [2018-11-23 12:26:34,373 INFO L273 TraceCheckUtils]: 6: Hoare triple {12986#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12986#(= main_~i~1 0)} is VALID [2018-11-23 12:26:34,374 INFO L273 TraceCheckUtils]: 7: Hoare triple {12986#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12987#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:34,375 INFO L273 TraceCheckUtils]: 8: Hoare triple {12987#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12987#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:34,375 INFO L273 TraceCheckUtils]: 9: Hoare triple {12987#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12988#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:34,375 INFO L273 TraceCheckUtils]: 10: Hoare triple {12988#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12988#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:34,376 INFO L273 TraceCheckUtils]: 11: Hoare triple {12988#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12989#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:34,376 INFO L273 TraceCheckUtils]: 12: Hoare triple {12989#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12989#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:34,376 INFO L273 TraceCheckUtils]: 13: Hoare triple {12989#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12990#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:34,377 INFO L273 TraceCheckUtils]: 14: Hoare triple {12990#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12990#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:34,378 INFO L273 TraceCheckUtils]: 15: Hoare triple {12990#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12991#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:34,378 INFO L273 TraceCheckUtils]: 16: Hoare triple {12991#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12991#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:34,379 INFO L273 TraceCheckUtils]: 17: Hoare triple {12991#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12992#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:34,379 INFO L273 TraceCheckUtils]: 18: Hoare triple {12992#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12992#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:34,380 INFO L273 TraceCheckUtils]: 19: Hoare triple {12992#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12993#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:34,381 INFO L273 TraceCheckUtils]: 20: Hoare triple {12993#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12993#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:34,381 INFO L273 TraceCheckUtils]: 21: Hoare triple {12993#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12994#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:34,382 INFO L273 TraceCheckUtils]: 22: Hoare triple {12994#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12994#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:34,383 INFO L273 TraceCheckUtils]: 23: Hoare triple {12994#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12995#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:34,383 INFO L273 TraceCheckUtils]: 24: Hoare triple {12995#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12995#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:34,384 INFO L273 TraceCheckUtils]: 25: Hoare triple {12995#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12996#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:34,384 INFO L273 TraceCheckUtils]: 26: Hoare triple {12996#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12996#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:34,385 INFO L273 TraceCheckUtils]: 27: Hoare triple {12996#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12997#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:34,386 INFO L273 TraceCheckUtils]: 28: Hoare triple {12997#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12997#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:34,386 INFO L273 TraceCheckUtils]: 29: Hoare triple {12997#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12998#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:34,387 INFO L273 TraceCheckUtils]: 30: Hoare triple {12998#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12998#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:34,387 INFO L273 TraceCheckUtils]: 31: Hoare triple {12998#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12999#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:34,388 INFO L273 TraceCheckUtils]: 32: Hoare triple {12999#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12999#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:34,389 INFO L273 TraceCheckUtils]: 33: Hoare triple {12999#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13000#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:34,389 INFO L273 TraceCheckUtils]: 34: Hoare triple {13000#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13000#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:34,390 INFO L273 TraceCheckUtils]: 35: Hoare triple {13000#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13001#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:34,390 INFO L273 TraceCheckUtils]: 36: Hoare triple {13001#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13001#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:34,391 INFO L273 TraceCheckUtils]: 37: Hoare triple {13001#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13002#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:34,392 INFO L273 TraceCheckUtils]: 38: Hoare triple {13002#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13002#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:34,392 INFO L273 TraceCheckUtils]: 39: Hoare triple {13002#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13003#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:34,393 INFO L273 TraceCheckUtils]: 40: Hoare triple {13003#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13003#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:34,394 INFO L273 TraceCheckUtils]: 41: Hoare triple {13003#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13004#(<= main_~i~1 18)} is VALID [2018-11-23 12:26:34,394 INFO L273 TraceCheckUtils]: 42: Hoare triple {13004#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13004#(<= main_~i~1 18)} is VALID [2018-11-23 12:26:34,395 INFO L273 TraceCheckUtils]: 43: Hoare triple {13004#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13005#(<= main_~i~1 19)} is VALID [2018-11-23 12:26:34,395 INFO L273 TraceCheckUtils]: 44: Hoare triple {13005#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13005#(<= main_~i~1 19)} is VALID [2018-11-23 12:26:34,396 INFO L273 TraceCheckUtils]: 45: Hoare triple {13005#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13006#(<= main_~i~1 20)} is VALID [2018-11-23 12:26:34,397 INFO L273 TraceCheckUtils]: 46: Hoare triple {13006#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13006#(<= main_~i~1 20)} is VALID [2018-11-23 12:26:34,397 INFO L273 TraceCheckUtils]: 47: Hoare triple {13006#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13007#(<= main_~i~1 21)} is VALID [2018-11-23 12:26:34,398 INFO L273 TraceCheckUtils]: 48: Hoare triple {13007#(<= main_~i~1 21)} assume !(~i~1 < 100000); {12985#false} is VALID [2018-11-23 12:26:34,398 INFO L256 TraceCheckUtils]: 49: Hoare triple {12985#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {12984#true} is VALID [2018-11-23 12:26:34,398 INFO L273 TraceCheckUtils]: 50: Hoare triple {12984#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {12984#true} is VALID [2018-11-23 12:26:34,399 INFO L273 TraceCheckUtils]: 51: Hoare triple {12984#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:34,399 INFO L273 TraceCheckUtils]: 52: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:34,399 INFO L273 TraceCheckUtils]: 53: Hoare triple {12984#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:34,399 INFO L273 TraceCheckUtils]: 54: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:34,399 INFO L273 TraceCheckUtils]: 55: Hoare triple {12984#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:34,400 INFO L273 TraceCheckUtils]: 56: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:34,400 INFO L273 TraceCheckUtils]: 57: Hoare triple {12984#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:34,400 INFO L273 TraceCheckUtils]: 58: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:34,400 INFO L273 TraceCheckUtils]: 59: Hoare triple {12984#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:34,400 INFO L273 TraceCheckUtils]: 60: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:34,401 INFO L273 TraceCheckUtils]: 61: Hoare triple {12984#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:34,401 INFO L273 TraceCheckUtils]: 62: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:34,401 INFO L273 TraceCheckUtils]: 63: Hoare triple {12984#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:34,401 INFO L273 TraceCheckUtils]: 64: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:34,401 INFO L273 TraceCheckUtils]: 65: Hoare triple {12984#true} assume !(~i~0 < 100000); {12984#true} is VALID [2018-11-23 12:26:34,402 INFO L273 TraceCheckUtils]: 66: Hoare triple {12984#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {12984#true} is VALID [2018-11-23 12:26:34,402 INFO L273 TraceCheckUtils]: 67: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:26:34,402 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {12984#true} {12985#false} #70#return; {12985#false} is VALID [2018-11-23 12:26:34,402 INFO L273 TraceCheckUtils]: 69: Hoare triple {12985#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {12985#false} is VALID [2018-11-23 12:26:34,403 INFO L256 TraceCheckUtils]: 70: Hoare triple {12985#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {12984#true} is VALID [2018-11-23 12:26:34,403 INFO L273 TraceCheckUtils]: 71: Hoare triple {12984#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {12984#true} is VALID [2018-11-23 12:26:34,403 INFO L273 TraceCheckUtils]: 72: Hoare triple {12984#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:34,403 INFO L273 TraceCheckUtils]: 73: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:34,403 INFO L273 TraceCheckUtils]: 74: Hoare triple {12984#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:34,404 INFO L273 TraceCheckUtils]: 75: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:34,404 INFO L273 TraceCheckUtils]: 76: Hoare triple {12984#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:34,404 INFO L273 TraceCheckUtils]: 77: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:34,404 INFO L273 TraceCheckUtils]: 78: Hoare triple {12984#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:34,404 INFO L273 TraceCheckUtils]: 79: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:34,404 INFO L273 TraceCheckUtils]: 80: Hoare triple {12984#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:34,404 INFO L273 TraceCheckUtils]: 81: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:34,405 INFO L273 TraceCheckUtils]: 82: Hoare triple {12984#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:34,405 INFO L273 TraceCheckUtils]: 83: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:34,405 INFO L273 TraceCheckUtils]: 84: Hoare triple {12984#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:34,405 INFO L273 TraceCheckUtils]: 85: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:34,405 INFO L273 TraceCheckUtils]: 86: Hoare triple {12984#true} assume !(~i~0 < 100000); {12984#true} is VALID [2018-11-23 12:26:34,405 INFO L273 TraceCheckUtils]: 87: Hoare triple {12984#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {12984#true} is VALID [2018-11-23 12:26:34,406 INFO L273 TraceCheckUtils]: 88: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:26:34,406 INFO L268 TraceCheckUtils]: 89: Hoare quadruple {12984#true} {12985#false} #72#return; {12985#false} is VALID [2018-11-23 12:26:34,406 INFO L273 TraceCheckUtils]: 90: Hoare triple {12985#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {12985#false} is VALID [2018-11-23 12:26:34,406 INFO L273 TraceCheckUtils]: 91: Hoare triple {12985#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12985#false} is VALID [2018-11-23 12:26:34,406 INFO L273 TraceCheckUtils]: 92: Hoare triple {12985#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12985#false} is VALID [2018-11-23 12:26:34,406 INFO L273 TraceCheckUtils]: 93: Hoare triple {12985#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12985#false} is VALID [2018-11-23 12:26:34,407 INFO L273 TraceCheckUtils]: 94: Hoare triple {12985#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12985#false} is VALID [2018-11-23 12:26:34,407 INFO L273 TraceCheckUtils]: 95: Hoare triple {12985#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12985#false} is VALID [2018-11-23 12:26:34,407 INFO L273 TraceCheckUtils]: 96: Hoare triple {12985#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12985#false} is VALID [2018-11-23 12:26:34,407 INFO L273 TraceCheckUtils]: 97: Hoare triple {12985#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12985#false} is VALID [2018-11-23 12:26:34,407 INFO L273 TraceCheckUtils]: 98: Hoare triple {12985#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12985#false} is VALID [2018-11-23 12:26:34,407 INFO L273 TraceCheckUtils]: 99: Hoare triple {12985#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {12985#false} is VALID [2018-11-23 12:26:34,407 INFO L273 TraceCheckUtils]: 100: Hoare triple {12985#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {12985#false} is VALID [2018-11-23 12:26:34,408 INFO L273 TraceCheckUtils]: 101: Hoare triple {12985#false} assume !(~i~2 < 99999); {12985#false} is VALID [2018-11-23 12:26:34,408 INFO L273 TraceCheckUtils]: 102: Hoare triple {12985#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {12985#false} is VALID [2018-11-23 12:26:34,408 INFO L256 TraceCheckUtils]: 103: Hoare triple {12985#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {12984#true} is VALID [2018-11-23 12:26:34,408 INFO L273 TraceCheckUtils]: 104: Hoare triple {12984#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {12984#true} is VALID [2018-11-23 12:26:34,408 INFO L273 TraceCheckUtils]: 105: Hoare triple {12984#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:34,408 INFO L273 TraceCheckUtils]: 106: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:34,409 INFO L273 TraceCheckUtils]: 107: Hoare triple {12984#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:34,409 INFO L273 TraceCheckUtils]: 108: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:34,409 INFO L273 TraceCheckUtils]: 109: Hoare triple {12984#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:34,409 INFO L273 TraceCheckUtils]: 110: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:34,409 INFO L273 TraceCheckUtils]: 111: Hoare triple {12984#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:34,409 INFO L273 TraceCheckUtils]: 112: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:34,410 INFO L273 TraceCheckUtils]: 113: Hoare triple {12984#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:34,410 INFO L273 TraceCheckUtils]: 114: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:34,410 INFO L273 TraceCheckUtils]: 115: Hoare triple {12984#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:34,410 INFO L273 TraceCheckUtils]: 116: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:34,410 INFO L273 TraceCheckUtils]: 117: Hoare triple {12984#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:34,410 INFO L273 TraceCheckUtils]: 118: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:34,410 INFO L273 TraceCheckUtils]: 119: Hoare triple {12984#true} assume !(~i~0 < 100000); {12984#true} is VALID [2018-11-23 12:26:34,411 INFO L273 TraceCheckUtils]: 120: Hoare triple {12984#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {12984#true} is VALID [2018-11-23 12:26:34,411 INFO L273 TraceCheckUtils]: 121: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:26:34,411 INFO L268 TraceCheckUtils]: 122: Hoare quadruple {12984#true} {12985#false} #74#return; {12985#false} is VALID [2018-11-23 12:26:34,411 INFO L273 TraceCheckUtils]: 123: Hoare triple {12985#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {12985#false} is VALID [2018-11-23 12:26:34,411 INFO L273 TraceCheckUtils]: 124: Hoare triple {12985#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {12985#false} is VALID [2018-11-23 12:26:34,411 INFO L273 TraceCheckUtils]: 125: Hoare triple {12985#false} assume !false; {12985#false} is VALID [2018-11-23 12:26:34,418 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2018-11-23 12:26:34,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:34,419 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:34,429 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:26:34,495 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-23 12:26:34,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:34,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:34,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:34,710 INFO L256 TraceCheckUtils]: 0: Hoare triple {12984#true} call ULTIMATE.init(); {12984#true} is VALID [2018-11-23 12:26:34,711 INFO L273 TraceCheckUtils]: 1: Hoare triple {12984#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12984#true} is VALID [2018-11-23 12:26:34,711 INFO L273 TraceCheckUtils]: 2: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:26:34,711 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12984#true} {12984#true} #66#return; {12984#true} is VALID [2018-11-23 12:26:34,711 INFO L256 TraceCheckUtils]: 4: Hoare triple {12984#true} call #t~ret13 := main(); {12984#true} is VALID [2018-11-23 12:26:34,711 INFO L273 TraceCheckUtils]: 5: Hoare triple {12984#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; {12984#true} is VALID [2018-11-23 12:26:34,712 INFO L273 TraceCheckUtils]: 6: Hoare triple {12984#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12984#true} is VALID [2018-11-23 12:26:34,712 INFO L273 TraceCheckUtils]: 7: Hoare triple {12984#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12984#true} is VALID [2018-11-23 12:26:34,712 INFO L273 TraceCheckUtils]: 8: Hoare triple {12984#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12984#true} is VALID [2018-11-23 12:26:34,712 INFO L273 TraceCheckUtils]: 9: Hoare triple {12984#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12984#true} is VALID [2018-11-23 12:26:34,712 INFO L273 TraceCheckUtils]: 10: Hoare triple {12984#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12984#true} is VALID [2018-11-23 12:26:34,712 INFO L273 TraceCheckUtils]: 11: Hoare triple {12984#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12984#true} is VALID [2018-11-23 12:26:34,713 INFO L273 TraceCheckUtils]: 12: Hoare triple {12984#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12984#true} is VALID [2018-11-23 12:26:34,713 INFO L273 TraceCheckUtils]: 13: Hoare triple {12984#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12984#true} is VALID [2018-11-23 12:26:34,713 INFO L273 TraceCheckUtils]: 14: Hoare triple {12984#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12984#true} is VALID [2018-11-23 12:26:34,713 INFO L273 TraceCheckUtils]: 15: Hoare triple {12984#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12984#true} is VALID [2018-11-23 12:26:34,713 INFO L273 TraceCheckUtils]: 16: Hoare triple {12984#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12984#true} is VALID [2018-11-23 12:26:34,713 INFO L273 TraceCheckUtils]: 17: Hoare triple {12984#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12984#true} is VALID [2018-11-23 12:26:34,713 INFO L273 TraceCheckUtils]: 18: Hoare triple {12984#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12984#true} is VALID [2018-11-23 12:26:34,713 INFO L273 TraceCheckUtils]: 19: Hoare triple {12984#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12984#true} is VALID [2018-11-23 12:26:34,713 INFO L273 TraceCheckUtils]: 20: Hoare triple {12984#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12984#true} is VALID [2018-11-23 12:26:34,713 INFO L273 TraceCheckUtils]: 21: Hoare triple {12984#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12984#true} is VALID [2018-11-23 12:26:34,714 INFO L273 TraceCheckUtils]: 22: Hoare triple {12984#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12984#true} is VALID [2018-11-23 12:26:34,714 INFO L273 TraceCheckUtils]: 23: Hoare triple {12984#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12984#true} is VALID [2018-11-23 12:26:34,714 INFO L273 TraceCheckUtils]: 24: Hoare triple {12984#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12984#true} is VALID [2018-11-23 12:26:34,714 INFO L273 TraceCheckUtils]: 25: Hoare triple {12984#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12984#true} is VALID [2018-11-23 12:26:34,714 INFO L273 TraceCheckUtils]: 26: Hoare triple {12984#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12984#true} is VALID [2018-11-23 12:26:34,714 INFO L273 TraceCheckUtils]: 27: Hoare triple {12984#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12984#true} is VALID [2018-11-23 12:26:34,714 INFO L273 TraceCheckUtils]: 28: Hoare triple {12984#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12984#true} is VALID [2018-11-23 12:26:34,715 INFO L273 TraceCheckUtils]: 29: Hoare triple {12984#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12984#true} is VALID [2018-11-23 12:26:34,715 INFO L273 TraceCheckUtils]: 30: Hoare triple {12984#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12984#true} is VALID [2018-11-23 12:26:34,715 INFO L273 TraceCheckUtils]: 31: Hoare triple {12984#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12984#true} is VALID [2018-11-23 12:26:34,715 INFO L273 TraceCheckUtils]: 32: Hoare triple {12984#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12984#true} is VALID [2018-11-23 12:26:34,715 INFO L273 TraceCheckUtils]: 33: Hoare triple {12984#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12984#true} is VALID [2018-11-23 12:26:34,715 INFO L273 TraceCheckUtils]: 34: Hoare triple {12984#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12984#true} is VALID [2018-11-23 12:26:34,715 INFO L273 TraceCheckUtils]: 35: Hoare triple {12984#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12984#true} is VALID [2018-11-23 12:26:34,716 INFO L273 TraceCheckUtils]: 36: Hoare triple {12984#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12984#true} is VALID [2018-11-23 12:26:34,716 INFO L273 TraceCheckUtils]: 37: Hoare triple {12984#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12984#true} is VALID [2018-11-23 12:26:34,716 INFO L273 TraceCheckUtils]: 38: Hoare triple {12984#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12984#true} is VALID [2018-11-23 12:26:34,716 INFO L273 TraceCheckUtils]: 39: Hoare triple {12984#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12984#true} is VALID [2018-11-23 12:26:34,716 INFO L273 TraceCheckUtils]: 40: Hoare triple {12984#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12984#true} is VALID [2018-11-23 12:26:34,716 INFO L273 TraceCheckUtils]: 41: Hoare triple {12984#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12984#true} is VALID [2018-11-23 12:26:34,717 INFO L273 TraceCheckUtils]: 42: Hoare triple {12984#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12984#true} is VALID [2018-11-23 12:26:34,717 INFO L273 TraceCheckUtils]: 43: Hoare triple {12984#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12984#true} is VALID [2018-11-23 12:26:34,717 INFO L273 TraceCheckUtils]: 44: Hoare triple {12984#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12984#true} is VALID [2018-11-23 12:26:34,717 INFO L273 TraceCheckUtils]: 45: Hoare triple {12984#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12984#true} is VALID [2018-11-23 12:26:34,717 INFO L273 TraceCheckUtils]: 46: Hoare triple {12984#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {12984#true} is VALID [2018-11-23 12:26:34,717 INFO L273 TraceCheckUtils]: 47: Hoare triple {12984#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {12984#true} is VALID [2018-11-23 12:26:34,717 INFO L273 TraceCheckUtils]: 48: Hoare triple {12984#true} assume !(~i~1 < 100000); {12984#true} is VALID [2018-11-23 12:26:34,718 INFO L256 TraceCheckUtils]: 49: Hoare triple {12984#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {12984#true} is VALID [2018-11-23 12:26:34,718 INFO L273 TraceCheckUtils]: 50: Hoare triple {12984#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {12984#true} is VALID [2018-11-23 12:26:34,718 INFO L273 TraceCheckUtils]: 51: Hoare triple {12984#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:34,718 INFO L273 TraceCheckUtils]: 52: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:34,718 INFO L273 TraceCheckUtils]: 53: Hoare triple {12984#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:34,718 INFO L273 TraceCheckUtils]: 54: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:34,718 INFO L273 TraceCheckUtils]: 55: Hoare triple {12984#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:34,718 INFO L273 TraceCheckUtils]: 56: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:34,718 INFO L273 TraceCheckUtils]: 57: Hoare triple {12984#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:34,718 INFO L273 TraceCheckUtils]: 58: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:34,719 INFO L273 TraceCheckUtils]: 59: Hoare triple {12984#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:34,719 INFO L273 TraceCheckUtils]: 60: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:34,719 INFO L273 TraceCheckUtils]: 61: Hoare triple {12984#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:34,719 INFO L273 TraceCheckUtils]: 62: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:34,719 INFO L273 TraceCheckUtils]: 63: Hoare triple {12984#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:34,719 INFO L273 TraceCheckUtils]: 64: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:34,719 INFO L273 TraceCheckUtils]: 65: Hoare triple {12984#true} assume !(~i~0 < 100000); {12984#true} is VALID [2018-11-23 12:26:34,719 INFO L273 TraceCheckUtils]: 66: Hoare triple {12984#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {12984#true} is VALID [2018-11-23 12:26:34,719 INFO L273 TraceCheckUtils]: 67: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:26:34,720 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {12984#true} {12984#true} #70#return; {12984#true} is VALID [2018-11-23 12:26:34,720 INFO L273 TraceCheckUtils]: 69: Hoare triple {12984#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {12984#true} is VALID [2018-11-23 12:26:34,720 INFO L256 TraceCheckUtils]: 70: Hoare triple {12984#true} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {12984#true} is VALID [2018-11-23 12:26:34,720 INFO L273 TraceCheckUtils]: 71: Hoare triple {12984#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {12984#true} is VALID [2018-11-23 12:26:34,720 INFO L273 TraceCheckUtils]: 72: Hoare triple {12984#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:34,720 INFO L273 TraceCheckUtils]: 73: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:34,720 INFO L273 TraceCheckUtils]: 74: Hoare triple {12984#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:34,720 INFO L273 TraceCheckUtils]: 75: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:34,720 INFO L273 TraceCheckUtils]: 76: Hoare triple {12984#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:34,721 INFO L273 TraceCheckUtils]: 77: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:34,721 INFO L273 TraceCheckUtils]: 78: Hoare triple {12984#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:34,721 INFO L273 TraceCheckUtils]: 79: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:34,721 INFO L273 TraceCheckUtils]: 80: Hoare triple {12984#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:34,721 INFO L273 TraceCheckUtils]: 81: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:34,721 INFO L273 TraceCheckUtils]: 82: Hoare triple {12984#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:34,721 INFO L273 TraceCheckUtils]: 83: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:34,721 INFO L273 TraceCheckUtils]: 84: Hoare triple {12984#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:26:34,721 INFO L273 TraceCheckUtils]: 85: Hoare triple {12984#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12984#true} is VALID [2018-11-23 12:26:34,721 INFO L273 TraceCheckUtils]: 86: Hoare triple {12984#true} assume !(~i~0 < 100000); {12984#true} is VALID [2018-11-23 12:26:34,722 INFO L273 TraceCheckUtils]: 87: Hoare triple {12984#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {12984#true} is VALID [2018-11-23 12:26:34,722 INFO L273 TraceCheckUtils]: 88: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:26:34,722 INFO L268 TraceCheckUtils]: 89: Hoare quadruple {12984#true} {12984#true} #72#return; {12984#true} is VALID [2018-11-23 12:26:34,722 INFO L273 TraceCheckUtils]: 90: Hoare triple {12984#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {13281#(<= main_~i~2 0)} is VALID [2018-11-23 12:26:34,723 INFO L273 TraceCheckUtils]: 91: Hoare triple {13281#(<= main_~i~2 0)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13281#(<= main_~i~2 0)} is VALID [2018-11-23 12:26:34,723 INFO L273 TraceCheckUtils]: 92: Hoare triple {13281#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13288#(<= main_~i~2 1)} is VALID [2018-11-23 12:26:34,723 INFO L273 TraceCheckUtils]: 93: Hoare triple {13288#(<= main_~i~2 1)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13288#(<= main_~i~2 1)} is VALID [2018-11-23 12:26:34,724 INFO L273 TraceCheckUtils]: 94: Hoare triple {13288#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13295#(<= main_~i~2 2)} is VALID [2018-11-23 12:26:34,724 INFO L273 TraceCheckUtils]: 95: Hoare triple {13295#(<= main_~i~2 2)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13295#(<= main_~i~2 2)} is VALID [2018-11-23 12:26:34,725 INFO L273 TraceCheckUtils]: 96: Hoare triple {13295#(<= main_~i~2 2)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13302#(<= main_~i~2 3)} is VALID [2018-11-23 12:26:34,725 INFO L273 TraceCheckUtils]: 97: Hoare triple {13302#(<= main_~i~2 3)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13302#(<= main_~i~2 3)} is VALID [2018-11-23 12:26:34,725 INFO L273 TraceCheckUtils]: 98: Hoare triple {13302#(<= main_~i~2 3)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13309#(<= main_~i~2 4)} is VALID [2018-11-23 12:26:34,726 INFO L273 TraceCheckUtils]: 99: Hoare triple {13309#(<= main_~i~2 4)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13309#(<= main_~i~2 4)} is VALID [2018-11-23 12:26:34,727 INFO L273 TraceCheckUtils]: 100: Hoare triple {13309#(<= main_~i~2 4)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13316#(<= main_~i~2 5)} is VALID [2018-11-23 12:26:34,727 INFO L273 TraceCheckUtils]: 101: Hoare triple {13316#(<= main_~i~2 5)} assume !(~i~2 < 99999); {12985#false} is VALID [2018-11-23 12:26:34,728 INFO L273 TraceCheckUtils]: 102: Hoare triple {12985#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {12985#false} is VALID [2018-11-23 12:26:34,728 INFO L256 TraceCheckUtils]: 103: Hoare triple {12985#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {12985#false} is VALID [2018-11-23 12:26:34,728 INFO L273 TraceCheckUtils]: 104: Hoare triple {12985#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {12985#false} is VALID [2018-11-23 12:26:34,728 INFO L273 TraceCheckUtils]: 105: Hoare triple {12985#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12985#false} is VALID [2018-11-23 12:26:34,728 INFO L273 TraceCheckUtils]: 106: Hoare triple {12985#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12985#false} is VALID [2018-11-23 12:26:34,728 INFO L273 TraceCheckUtils]: 107: Hoare triple {12985#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12985#false} is VALID [2018-11-23 12:26:34,729 INFO L273 TraceCheckUtils]: 108: Hoare triple {12985#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12985#false} is VALID [2018-11-23 12:26:34,729 INFO L273 TraceCheckUtils]: 109: Hoare triple {12985#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12985#false} is VALID [2018-11-23 12:26:34,729 INFO L273 TraceCheckUtils]: 110: Hoare triple {12985#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12985#false} is VALID [2018-11-23 12:26:34,729 INFO L273 TraceCheckUtils]: 111: Hoare triple {12985#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12985#false} is VALID [2018-11-23 12:26:34,729 INFO L273 TraceCheckUtils]: 112: Hoare triple {12985#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12985#false} is VALID [2018-11-23 12:26:34,730 INFO L273 TraceCheckUtils]: 113: Hoare triple {12985#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12985#false} is VALID [2018-11-23 12:26:34,730 INFO L273 TraceCheckUtils]: 114: Hoare triple {12985#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12985#false} is VALID [2018-11-23 12:26:34,730 INFO L273 TraceCheckUtils]: 115: Hoare triple {12985#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12985#false} is VALID [2018-11-23 12:26:34,730 INFO L273 TraceCheckUtils]: 116: Hoare triple {12985#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12985#false} is VALID [2018-11-23 12:26:34,730 INFO L273 TraceCheckUtils]: 117: Hoare triple {12985#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {12985#false} is VALID [2018-11-23 12:26:34,730 INFO L273 TraceCheckUtils]: 118: Hoare triple {12985#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12985#false} is VALID [2018-11-23 12:26:34,730 INFO L273 TraceCheckUtils]: 119: Hoare triple {12985#false} assume !(~i~0 < 100000); {12985#false} is VALID [2018-11-23 12:26:34,730 INFO L273 TraceCheckUtils]: 120: Hoare triple {12985#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {12985#false} is VALID [2018-11-23 12:26:34,730 INFO L273 TraceCheckUtils]: 121: Hoare triple {12985#false} assume true; {12985#false} is VALID [2018-11-23 12:26:34,730 INFO L268 TraceCheckUtils]: 122: Hoare quadruple {12985#false} {12985#false} #74#return; {12985#false} is VALID [2018-11-23 12:26:34,731 INFO L273 TraceCheckUtils]: 123: Hoare triple {12985#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {12985#false} is VALID [2018-11-23 12:26:34,731 INFO L273 TraceCheckUtils]: 124: Hoare triple {12985#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {12985#false} is VALID [2018-11-23 12:26:34,731 INFO L273 TraceCheckUtils]: 125: Hoare triple {12985#false} assume !false; {12985#false} is VALID [2018-11-23 12:26:34,737 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 234 proven. 25 refuted. 0 times theorem prover too weak. 705 trivial. 0 not checked. [2018-11-23 12:26:34,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:34,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 8] total 30 [2018-11-23 12:26:34,756 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 126 [2018-11-23 12:26:34,757 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:34,757 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 12:26:34,862 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:34,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 12:26:34,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 12:26:34,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=567, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:26:34,864 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 30 states. [2018-11-23 12:26:35,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:35,472 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2018-11-23 12:26:35,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 12:26:35,472 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 126 [2018-11-23 12:26:35,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:35,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:26:35,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 109 transitions. [2018-11-23 12:26:35,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:26:35,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 109 transitions. [2018-11-23 12:26:35,475 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 109 transitions. [2018-11-23 12:26:35,626 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:35,628 INFO L225 Difference]: With dead ends: 135 [2018-11-23 12:26:35,628 INFO L226 Difference]: Without dead ends: 95 [2018-11-23 12:26:35,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 121 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-23 12:26:35,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-23 12:26:35,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2018-11-23 12:26:35,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:35,674 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 93 states. [2018-11-23 12:26:35,674 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 93 states. [2018-11-23 12:26:35,674 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 93 states. [2018-11-23 12:26:35,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:35,677 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2018-11-23 12:26:35,677 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-11-23 12:26:35,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:35,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:35,678 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 95 states. [2018-11-23 12:26:35,678 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 95 states. [2018-11-23 12:26:35,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:35,679 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2018-11-23 12:26:35,679 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-11-23 12:26:35,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:35,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:35,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:35,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:35,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-23 12:26:35,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2018-11-23 12:26:35,682 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 126 [2018-11-23 12:26:35,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:35,682 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2018-11-23 12:26:35,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 12:26:35,683 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2018-11-23 12:26:35,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-23 12:26:35,683 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:35,684 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:26:35,684 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:35,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:35,684 INFO L82 PathProgramCache]: Analyzing trace with hash -2078845859, now seen corresponding path program 22 times [2018-11-23 12:26:35,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:35,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:35,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:35,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:35,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:35,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:36,287 INFO L256 TraceCheckUtils]: 0: Hoare triple {13919#true} call ULTIMATE.init(); {13919#true} is VALID [2018-11-23 12:26:36,288 INFO L273 TraceCheckUtils]: 1: Hoare triple {13919#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13919#true} is VALID [2018-11-23 12:26:36,288 INFO L273 TraceCheckUtils]: 2: Hoare triple {13919#true} assume true; {13919#true} is VALID [2018-11-23 12:26:36,288 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13919#true} {13919#true} #66#return; {13919#true} is VALID [2018-11-23 12:26:36,288 INFO L256 TraceCheckUtils]: 4: Hoare triple {13919#true} call #t~ret13 := main(); {13919#true} is VALID [2018-11-23 12:26:36,289 INFO L273 TraceCheckUtils]: 5: Hoare triple {13919#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; {13921#(= main_~i~1 0)} is VALID [2018-11-23 12:26:36,289 INFO L273 TraceCheckUtils]: 6: Hoare triple {13921#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13921#(= main_~i~1 0)} is VALID [2018-11-23 12:26:36,290 INFO L273 TraceCheckUtils]: 7: Hoare triple {13921#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13922#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:36,290 INFO L273 TraceCheckUtils]: 8: Hoare triple {13922#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13922#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:36,291 INFO L273 TraceCheckUtils]: 9: Hoare triple {13922#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13923#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:36,291 INFO L273 TraceCheckUtils]: 10: Hoare triple {13923#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13923#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:36,292 INFO L273 TraceCheckUtils]: 11: Hoare triple {13923#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13924#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:36,292 INFO L273 TraceCheckUtils]: 12: Hoare triple {13924#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13924#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:36,293 INFO L273 TraceCheckUtils]: 13: Hoare triple {13924#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13925#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:36,293 INFO L273 TraceCheckUtils]: 14: Hoare triple {13925#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13925#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:36,294 INFO L273 TraceCheckUtils]: 15: Hoare triple {13925#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13926#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:36,295 INFO L273 TraceCheckUtils]: 16: Hoare triple {13926#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13926#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:36,295 INFO L273 TraceCheckUtils]: 17: Hoare triple {13926#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13927#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:36,296 INFO L273 TraceCheckUtils]: 18: Hoare triple {13927#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13927#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:36,296 INFO L273 TraceCheckUtils]: 19: Hoare triple {13927#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13928#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:36,297 INFO L273 TraceCheckUtils]: 20: Hoare triple {13928#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13928#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:36,298 INFO L273 TraceCheckUtils]: 21: Hoare triple {13928#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13929#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:36,298 INFO L273 TraceCheckUtils]: 22: Hoare triple {13929#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13929#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:36,299 INFO L273 TraceCheckUtils]: 23: Hoare triple {13929#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13930#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:36,299 INFO L273 TraceCheckUtils]: 24: Hoare triple {13930#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13930#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:36,300 INFO L273 TraceCheckUtils]: 25: Hoare triple {13930#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13931#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:36,300 INFO L273 TraceCheckUtils]: 26: Hoare triple {13931#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13931#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:36,301 INFO L273 TraceCheckUtils]: 27: Hoare triple {13931#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13932#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:36,302 INFO L273 TraceCheckUtils]: 28: Hoare triple {13932#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13932#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:36,302 INFO L273 TraceCheckUtils]: 29: Hoare triple {13932#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13933#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:36,303 INFO L273 TraceCheckUtils]: 30: Hoare triple {13933#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13933#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:36,303 INFO L273 TraceCheckUtils]: 31: Hoare triple {13933#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13934#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:36,304 INFO L273 TraceCheckUtils]: 32: Hoare triple {13934#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13934#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:36,305 INFO L273 TraceCheckUtils]: 33: Hoare triple {13934#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13935#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:36,305 INFO L273 TraceCheckUtils]: 34: Hoare triple {13935#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13935#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:36,306 INFO L273 TraceCheckUtils]: 35: Hoare triple {13935#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13936#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:36,306 INFO L273 TraceCheckUtils]: 36: Hoare triple {13936#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13936#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:36,307 INFO L273 TraceCheckUtils]: 37: Hoare triple {13936#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13937#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:36,307 INFO L273 TraceCheckUtils]: 38: Hoare triple {13937#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13937#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:36,308 INFO L273 TraceCheckUtils]: 39: Hoare triple {13937#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13938#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:36,309 INFO L273 TraceCheckUtils]: 40: Hoare triple {13938#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13938#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:36,309 INFO L273 TraceCheckUtils]: 41: Hoare triple {13938#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13939#(<= main_~i~1 18)} is VALID [2018-11-23 12:26:36,310 INFO L273 TraceCheckUtils]: 42: Hoare triple {13939#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13939#(<= main_~i~1 18)} is VALID [2018-11-23 12:26:36,311 INFO L273 TraceCheckUtils]: 43: Hoare triple {13939#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13940#(<= main_~i~1 19)} is VALID [2018-11-23 12:26:36,311 INFO L273 TraceCheckUtils]: 44: Hoare triple {13940#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13940#(<= main_~i~1 19)} is VALID [2018-11-23 12:26:36,312 INFO L273 TraceCheckUtils]: 45: Hoare triple {13940#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13941#(<= main_~i~1 20)} is VALID [2018-11-23 12:26:36,312 INFO L273 TraceCheckUtils]: 46: Hoare triple {13941#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13941#(<= main_~i~1 20)} is VALID [2018-11-23 12:26:36,313 INFO L273 TraceCheckUtils]: 47: Hoare triple {13941#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13942#(<= main_~i~1 21)} is VALID [2018-11-23 12:26:36,313 INFO L273 TraceCheckUtils]: 48: Hoare triple {13942#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13942#(<= main_~i~1 21)} is VALID [2018-11-23 12:26:36,315 INFO L273 TraceCheckUtils]: 49: Hoare triple {13942#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13943#(<= main_~i~1 22)} is VALID [2018-11-23 12:26:36,316 INFO L273 TraceCheckUtils]: 50: Hoare triple {13943#(<= main_~i~1 22)} assume !(~i~1 < 100000); {13920#false} is VALID [2018-11-23 12:26:36,316 INFO L256 TraceCheckUtils]: 51: Hoare triple {13920#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {13919#true} is VALID [2018-11-23 12:26:36,316 INFO L273 TraceCheckUtils]: 52: Hoare triple {13919#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {13919#true} is VALID [2018-11-23 12:26:36,316 INFO L273 TraceCheckUtils]: 53: Hoare triple {13919#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:26:36,316 INFO L273 TraceCheckUtils]: 54: Hoare triple {13919#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13919#true} is VALID [2018-11-23 12:26:36,317 INFO L273 TraceCheckUtils]: 55: Hoare triple {13919#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:26:36,317 INFO L273 TraceCheckUtils]: 56: Hoare triple {13919#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13919#true} is VALID [2018-11-23 12:26:36,317 INFO L273 TraceCheckUtils]: 57: Hoare triple {13919#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:26:36,317 INFO L273 TraceCheckUtils]: 58: Hoare triple {13919#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13919#true} is VALID [2018-11-23 12:26:36,317 INFO L273 TraceCheckUtils]: 59: Hoare triple {13919#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:26:36,317 INFO L273 TraceCheckUtils]: 60: Hoare triple {13919#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13919#true} is VALID [2018-11-23 12:26:36,318 INFO L273 TraceCheckUtils]: 61: Hoare triple {13919#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:26:36,318 INFO L273 TraceCheckUtils]: 62: Hoare triple {13919#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13919#true} is VALID [2018-11-23 12:26:36,318 INFO L273 TraceCheckUtils]: 63: Hoare triple {13919#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:26:36,318 INFO L273 TraceCheckUtils]: 64: Hoare triple {13919#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13919#true} is VALID [2018-11-23 12:26:36,318 INFO L273 TraceCheckUtils]: 65: Hoare triple {13919#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:26:36,319 INFO L273 TraceCheckUtils]: 66: Hoare triple {13919#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13919#true} is VALID [2018-11-23 12:26:36,319 INFO L273 TraceCheckUtils]: 67: Hoare triple {13919#true} assume !(~i~0 < 100000); {13919#true} is VALID [2018-11-23 12:26:36,319 INFO L273 TraceCheckUtils]: 68: Hoare triple {13919#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {13919#true} is VALID [2018-11-23 12:26:36,319 INFO L273 TraceCheckUtils]: 69: Hoare triple {13919#true} assume true; {13919#true} is VALID [2018-11-23 12:26:36,319 INFO L268 TraceCheckUtils]: 70: Hoare quadruple {13919#true} {13920#false} #70#return; {13920#false} is VALID [2018-11-23 12:26:36,319 INFO L273 TraceCheckUtils]: 71: Hoare triple {13920#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {13920#false} is VALID [2018-11-23 12:26:36,320 INFO L256 TraceCheckUtils]: 72: Hoare triple {13920#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {13919#true} is VALID [2018-11-23 12:26:36,320 INFO L273 TraceCheckUtils]: 73: Hoare triple {13919#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {13919#true} is VALID [2018-11-23 12:26:36,320 INFO L273 TraceCheckUtils]: 74: Hoare triple {13919#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:26:36,320 INFO L273 TraceCheckUtils]: 75: Hoare triple {13919#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13919#true} is VALID [2018-11-23 12:26:36,320 INFO L273 TraceCheckUtils]: 76: Hoare triple {13919#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:26:36,320 INFO L273 TraceCheckUtils]: 77: Hoare triple {13919#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13919#true} is VALID [2018-11-23 12:26:36,321 INFO L273 TraceCheckUtils]: 78: Hoare triple {13919#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:26:36,321 INFO L273 TraceCheckUtils]: 79: Hoare triple {13919#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13919#true} is VALID [2018-11-23 12:26:36,321 INFO L273 TraceCheckUtils]: 80: Hoare triple {13919#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:26:36,321 INFO L273 TraceCheckUtils]: 81: Hoare triple {13919#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13919#true} is VALID [2018-11-23 12:26:36,321 INFO L273 TraceCheckUtils]: 82: Hoare triple {13919#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:26:36,321 INFO L273 TraceCheckUtils]: 83: Hoare triple {13919#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13919#true} is VALID [2018-11-23 12:26:36,321 INFO L273 TraceCheckUtils]: 84: Hoare triple {13919#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:26:36,321 INFO L273 TraceCheckUtils]: 85: Hoare triple {13919#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13919#true} is VALID [2018-11-23 12:26:36,321 INFO L273 TraceCheckUtils]: 86: Hoare triple {13919#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:26:36,322 INFO L273 TraceCheckUtils]: 87: Hoare triple {13919#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13919#true} is VALID [2018-11-23 12:26:36,322 INFO L273 TraceCheckUtils]: 88: Hoare triple {13919#true} assume !(~i~0 < 100000); {13919#true} is VALID [2018-11-23 12:26:36,322 INFO L273 TraceCheckUtils]: 89: Hoare triple {13919#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {13919#true} is VALID [2018-11-23 12:26:36,322 INFO L273 TraceCheckUtils]: 90: Hoare triple {13919#true} assume true; {13919#true} is VALID [2018-11-23 12:26:36,322 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {13919#true} {13920#false} #72#return; {13920#false} is VALID [2018-11-23 12:26:36,322 INFO L273 TraceCheckUtils]: 92: Hoare triple {13920#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {13920#false} is VALID [2018-11-23 12:26:36,322 INFO L273 TraceCheckUtils]: 93: Hoare triple {13920#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13920#false} is VALID [2018-11-23 12:26:36,322 INFO L273 TraceCheckUtils]: 94: Hoare triple {13920#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13920#false} is VALID [2018-11-23 12:26:36,322 INFO L273 TraceCheckUtils]: 95: Hoare triple {13920#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13920#false} is VALID [2018-11-23 12:26:36,323 INFO L273 TraceCheckUtils]: 96: Hoare triple {13920#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13920#false} is VALID [2018-11-23 12:26:36,323 INFO L273 TraceCheckUtils]: 97: Hoare triple {13920#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13920#false} is VALID [2018-11-23 12:26:36,323 INFO L273 TraceCheckUtils]: 98: Hoare triple {13920#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13920#false} is VALID [2018-11-23 12:26:36,323 INFO L273 TraceCheckUtils]: 99: Hoare triple {13920#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13920#false} is VALID [2018-11-23 12:26:36,323 INFO L273 TraceCheckUtils]: 100: Hoare triple {13920#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13920#false} is VALID [2018-11-23 12:26:36,323 INFO L273 TraceCheckUtils]: 101: Hoare triple {13920#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13920#false} is VALID [2018-11-23 12:26:36,323 INFO L273 TraceCheckUtils]: 102: Hoare triple {13920#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13920#false} is VALID [2018-11-23 12:26:36,323 INFO L273 TraceCheckUtils]: 103: Hoare triple {13920#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13920#false} is VALID [2018-11-23 12:26:36,323 INFO L273 TraceCheckUtils]: 104: Hoare triple {13920#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13920#false} is VALID [2018-11-23 12:26:36,324 INFO L273 TraceCheckUtils]: 105: Hoare triple {13920#false} assume !(~i~2 < 99999); {13920#false} is VALID [2018-11-23 12:26:36,324 INFO L273 TraceCheckUtils]: 106: Hoare triple {13920#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {13920#false} is VALID [2018-11-23 12:26:36,324 INFO L256 TraceCheckUtils]: 107: Hoare triple {13920#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {13919#true} is VALID [2018-11-23 12:26:36,324 INFO L273 TraceCheckUtils]: 108: Hoare triple {13919#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {13919#true} is VALID [2018-11-23 12:26:36,324 INFO L273 TraceCheckUtils]: 109: Hoare triple {13919#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:26:36,324 INFO L273 TraceCheckUtils]: 110: Hoare triple {13919#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13919#true} is VALID [2018-11-23 12:26:36,324 INFO L273 TraceCheckUtils]: 111: Hoare triple {13919#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:26:36,324 INFO L273 TraceCheckUtils]: 112: Hoare triple {13919#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13919#true} is VALID [2018-11-23 12:26:36,324 INFO L273 TraceCheckUtils]: 113: Hoare triple {13919#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:26:36,324 INFO L273 TraceCheckUtils]: 114: Hoare triple {13919#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13919#true} is VALID [2018-11-23 12:26:36,325 INFO L273 TraceCheckUtils]: 115: Hoare triple {13919#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:26:36,325 INFO L273 TraceCheckUtils]: 116: Hoare triple {13919#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13919#true} is VALID [2018-11-23 12:26:36,325 INFO L273 TraceCheckUtils]: 117: Hoare triple {13919#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:26:36,325 INFO L273 TraceCheckUtils]: 118: Hoare triple {13919#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13919#true} is VALID [2018-11-23 12:26:36,325 INFO L273 TraceCheckUtils]: 119: Hoare triple {13919#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:26:36,325 INFO L273 TraceCheckUtils]: 120: Hoare triple {13919#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13919#true} is VALID [2018-11-23 12:26:36,325 INFO L273 TraceCheckUtils]: 121: Hoare triple {13919#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:26:36,325 INFO L273 TraceCheckUtils]: 122: Hoare triple {13919#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13919#true} is VALID [2018-11-23 12:26:36,325 INFO L273 TraceCheckUtils]: 123: Hoare triple {13919#true} assume !(~i~0 < 100000); {13919#true} is VALID [2018-11-23 12:26:36,326 INFO L273 TraceCheckUtils]: 124: Hoare triple {13919#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {13919#true} is VALID [2018-11-23 12:26:36,326 INFO L273 TraceCheckUtils]: 125: Hoare triple {13919#true} assume true; {13919#true} is VALID [2018-11-23 12:26:36,326 INFO L268 TraceCheckUtils]: 126: Hoare quadruple {13919#true} {13920#false} #74#return; {13920#false} is VALID [2018-11-23 12:26:36,326 INFO L273 TraceCheckUtils]: 127: Hoare triple {13920#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {13920#false} is VALID [2018-11-23 12:26:36,326 INFO L273 TraceCheckUtils]: 128: Hoare triple {13920#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {13920#false} is VALID [2018-11-23 12:26:36,326 INFO L273 TraceCheckUtils]: 129: Hoare triple {13920#false} assume !false; {13920#false} is VALID [2018-11-23 12:26:36,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2018-11-23 12:26:36,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:36,334 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:36,342 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:26:36,393 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:26:36,393 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:36,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:36,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:36,913 INFO L256 TraceCheckUtils]: 0: Hoare triple {13919#true} call ULTIMATE.init(); {13919#true} is VALID [2018-11-23 12:26:36,914 INFO L273 TraceCheckUtils]: 1: Hoare triple {13919#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13919#true} is VALID [2018-11-23 12:26:36,914 INFO L273 TraceCheckUtils]: 2: Hoare triple {13919#true} assume true; {13919#true} is VALID [2018-11-23 12:26:36,914 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13919#true} {13919#true} #66#return; {13919#true} is VALID [2018-11-23 12:26:36,914 INFO L256 TraceCheckUtils]: 4: Hoare triple {13919#true} call #t~ret13 := main(); {13919#true} is VALID [2018-11-23 12:26:36,915 INFO L273 TraceCheckUtils]: 5: Hoare triple {13919#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; {13962#(<= main_~i~1 0)} is VALID [2018-11-23 12:26:36,916 INFO L273 TraceCheckUtils]: 6: Hoare triple {13962#(<= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13962#(<= main_~i~1 0)} is VALID [2018-11-23 12:26:36,916 INFO L273 TraceCheckUtils]: 7: Hoare triple {13962#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13922#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:36,917 INFO L273 TraceCheckUtils]: 8: Hoare triple {13922#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13922#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:36,917 INFO L273 TraceCheckUtils]: 9: Hoare triple {13922#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13923#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:36,917 INFO L273 TraceCheckUtils]: 10: Hoare triple {13923#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13923#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:36,918 INFO L273 TraceCheckUtils]: 11: Hoare triple {13923#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13924#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:36,918 INFO L273 TraceCheckUtils]: 12: Hoare triple {13924#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13924#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:36,918 INFO L273 TraceCheckUtils]: 13: Hoare triple {13924#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13925#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:36,919 INFO L273 TraceCheckUtils]: 14: Hoare triple {13925#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13925#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:36,920 INFO L273 TraceCheckUtils]: 15: Hoare triple {13925#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13926#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:36,920 INFO L273 TraceCheckUtils]: 16: Hoare triple {13926#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13926#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:36,921 INFO L273 TraceCheckUtils]: 17: Hoare triple {13926#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13927#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:36,921 INFO L273 TraceCheckUtils]: 18: Hoare triple {13927#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13927#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:36,922 INFO L273 TraceCheckUtils]: 19: Hoare triple {13927#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13928#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:36,923 INFO L273 TraceCheckUtils]: 20: Hoare triple {13928#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13928#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:36,923 INFO L273 TraceCheckUtils]: 21: Hoare triple {13928#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13929#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:36,924 INFO L273 TraceCheckUtils]: 22: Hoare triple {13929#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13929#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:36,924 INFO L273 TraceCheckUtils]: 23: Hoare triple {13929#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13930#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:36,925 INFO L273 TraceCheckUtils]: 24: Hoare triple {13930#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13930#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:36,926 INFO L273 TraceCheckUtils]: 25: Hoare triple {13930#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13931#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:36,926 INFO L273 TraceCheckUtils]: 26: Hoare triple {13931#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13931#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:36,927 INFO L273 TraceCheckUtils]: 27: Hoare triple {13931#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13932#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:36,927 INFO L273 TraceCheckUtils]: 28: Hoare triple {13932#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13932#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:36,928 INFO L273 TraceCheckUtils]: 29: Hoare triple {13932#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13933#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:36,929 INFO L273 TraceCheckUtils]: 30: Hoare triple {13933#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13933#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:36,929 INFO L273 TraceCheckUtils]: 31: Hoare triple {13933#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13934#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:36,930 INFO L273 TraceCheckUtils]: 32: Hoare triple {13934#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13934#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:36,930 INFO L273 TraceCheckUtils]: 33: Hoare triple {13934#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13935#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:36,931 INFO L273 TraceCheckUtils]: 34: Hoare triple {13935#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13935#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:36,932 INFO L273 TraceCheckUtils]: 35: Hoare triple {13935#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13936#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:36,932 INFO L273 TraceCheckUtils]: 36: Hoare triple {13936#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13936#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:36,933 INFO L273 TraceCheckUtils]: 37: Hoare triple {13936#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13937#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:36,933 INFO L273 TraceCheckUtils]: 38: Hoare triple {13937#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13937#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:36,934 INFO L273 TraceCheckUtils]: 39: Hoare triple {13937#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13938#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:36,934 INFO L273 TraceCheckUtils]: 40: Hoare triple {13938#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13938#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:36,935 INFO L273 TraceCheckUtils]: 41: Hoare triple {13938#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13939#(<= main_~i~1 18)} is VALID [2018-11-23 12:26:36,936 INFO L273 TraceCheckUtils]: 42: Hoare triple {13939#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13939#(<= main_~i~1 18)} is VALID [2018-11-23 12:26:36,936 INFO L273 TraceCheckUtils]: 43: Hoare triple {13939#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13940#(<= main_~i~1 19)} is VALID [2018-11-23 12:26:36,937 INFO L273 TraceCheckUtils]: 44: Hoare triple {13940#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13940#(<= main_~i~1 19)} is VALID [2018-11-23 12:26:36,937 INFO L273 TraceCheckUtils]: 45: Hoare triple {13940#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13941#(<= main_~i~1 20)} is VALID [2018-11-23 12:26:36,938 INFO L273 TraceCheckUtils]: 46: Hoare triple {13941#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13941#(<= main_~i~1 20)} is VALID [2018-11-23 12:26:36,939 INFO L273 TraceCheckUtils]: 47: Hoare triple {13941#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13942#(<= main_~i~1 21)} is VALID [2018-11-23 12:26:36,939 INFO L273 TraceCheckUtils]: 48: Hoare triple {13942#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {13942#(<= main_~i~1 21)} is VALID [2018-11-23 12:26:36,940 INFO L273 TraceCheckUtils]: 49: Hoare triple {13942#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {13943#(<= main_~i~1 22)} is VALID [2018-11-23 12:26:36,940 INFO L273 TraceCheckUtils]: 50: Hoare triple {13943#(<= main_~i~1 22)} assume !(~i~1 < 100000); {13920#false} is VALID [2018-11-23 12:26:36,941 INFO L256 TraceCheckUtils]: 51: Hoare triple {13920#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {13920#false} is VALID [2018-11-23 12:26:36,941 INFO L273 TraceCheckUtils]: 52: Hoare triple {13920#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {13920#false} is VALID [2018-11-23 12:26:36,941 INFO L273 TraceCheckUtils]: 53: Hoare triple {13920#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:26:36,941 INFO L273 TraceCheckUtils]: 54: Hoare triple {13920#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13920#false} is VALID [2018-11-23 12:26:36,941 INFO L273 TraceCheckUtils]: 55: Hoare triple {13920#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:26:36,942 INFO L273 TraceCheckUtils]: 56: Hoare triple {13920#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13920#false} is VALID [2018-11-23 12:26:36,942 INFO L273 TraceCheckUtils]: 57: Hoare triple {13920#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:26:36,942 INFO L273 TraceCheckUtils]: 58: Hoare triple {13920#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13920#false} is VALID [2018-11-23 12:26:36,942 INFO L273 TraceCheckUtils]: 59: Hoare triple {13920#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:26:36,942 INFO L273 TraceCheckUtils]: 60: Hoare triple {13920#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13920#false} is VALID [2018-11-23 12:26:36,942 INFO L273 TraceCheckUtils]: 61: Hoare triple {13920#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:26:36,943 INFO L273 TraceCheckUtils]: 62: Hoare triple {13920#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13920#false} is VALID [2018-11-23 12:26:36,943 INFO L273 TraceCheckUtils]: 63: Hoare triple {13920#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:26:36,943 INFO L273 TraceCheckUtils]: 64: Hoare triple {13920#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13920#false} is VALID [2018-11-23 12:26:36,943 INFO L273 TraceCheckUtils]: 65: Hoare triple {13920#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:26:36,943 INFO L273 TraceCheckUtils]: 66: Hoare triple {13920#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13920#false} is VALID [2018-11-23 12:26:36,943 INFO L273 TraceCheckUtils]: 67: Hoare triple {13920#false} assume !(~i~0 < 100000); {13920#false} is VALID [2018-11-23 12:26:36,944 INFO L273 TraceCheckUtils]: 68: Hoare triple {13920#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {13920#false} is VALID [2018-11-23 12:26:36,944 INFO L273 TraceCheckUtils]: 69: Hoare triple {13920#false} assume true; {13920#false} is VALID [2018-11-23 12:26:36,944 INFO L268 TraceCheckUtils]: 70: Hoare quadruple {13920#false} {13920#false} #70#return; {13920#false} is VALID [2018-11-23 12:26:36,944 INFO L273 TraceCheckUtils]: 71: Hoare triple {13920#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {13920#false} is VALID [2018-11-23 12:26:36,944 INFO L256 TraceCheckUtils]: 72: Hoare triple {13920#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {13920#false} is VALID [2018-11-23 12:26:36,945 INFO L273 TraceCheckUtils]: 73: Hoare triple {13920#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {13920#false} is VALID [2018-11-23 12:26:36,945 INFO L273 TraceCheckUtils]: 74: Hoare triple {13920#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:26:36,945 INFO L273 TraceCheckUtils]: 75: Hoare triple {13920#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13920#false} is VALID [2018-11-23 12:26:36,945 INFO L273 TraceCheckUtils]: 76: Hoare triple {13920#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:26:36,945 INFO L273 TraceCheckUtils]: 77: Hoare triple {13920#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13920#false} is VALID [2018-11-23 12:26:36,945 INFO L273 TraceCheckUtils]: 78: Hoare triple {13920#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:26:36,945 INFO L273 TraceCheckUtils]: 79: Hoare triple {13920#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13920#false} is VALID [2018-11-23 12:26:36,945 INFO L273 TraceCheckUtils]: 80: Hoare triple {13920#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:26:36,945 INFO L273 TraceCheckUtils]: 81: Hoare triple {13920#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13920#false} is VALID [2018-11-23 12:26:36,946 INFO L273 TraceCheckUtils]: 82: Hoare triple {13920#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:26:36,946 INFO L273 TraceCheckUtils]: 83: Hoare triple {13920#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13920#false} is VALID [2018-11-23 12:26:36,946 INFO L273 TraceCheckUtils]: 84: Hoare triple {13920#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:26:36,946 INFO L273 TraceCheckUtils]: 85: Hoare triple {13920#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13920#false} is VALID [2018-11-23 12:26:36,946 INFO L273 TraceCheckUtils]: 86: Hoare triple {13920#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:26:36,946 INFO L273 TraceCheckUtils]: 87: Hoare triple {13920#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13920#false} is VALID [2018-11-23 12:26:36,946 INFO L273 TraceCheckUtils]: 88: Hoare triple {13920#false} assume !(~i~0 < 100000); {13920#false} is VALID [2018-11-23 12:26:36,946 INFO L273 TraceCheckUtils]: 89: Hoare triple {13920#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {13920#false} is VALID [2018-11-23 12:26:36,946 INFO L273 TraceCheckUtils]: 90: Hoare triple {13920#false} assume true; {13920#false} is VALID [2018-11-23 12:26:36,946 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {13920#false} {13920#false} #72#return; {13920#false} is VALID [2018-11-23 12:26:36,947 INFO L273 TraceCheckUtils]: 92: Hoare triple {13920#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {13920#false} is VALID [2018-11-23 12:26:36,947 INFO L273 TraceCheckUtils]: 93: Hoare triple {13920#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13920#false} is VALID [2018-11-23 12:26:36,947 INFO L273 TraceCheckUtils]: 94: Hoare triple {13920#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13920#false} is VALID [2018-11-23 12:26:36,947 INFO L273 TraceCheckUtils]: 95: Hoare triple {13920#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13920#false} is VALID [2018-11-23 12:26:36,947 INFO L273 TraceCheckUtils]: 96: Hoare triple {13920#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13920#false} is VALID [2018-11-23 12:26:36,947 INFO L273 TraceCheckUtils]: 97: Hoare triple {13920#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13920#false} is VALID [2018-11-23 12:26:36,947 INFO L273 TraceCheckUtils]: 98: Hoare triple {13920#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13920#false} is VALID [2018-11-23 12:26:36,947 INFO L273 TraceCheckUtils]: 99: Hoare triple {13920#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13920#false} is VALID [2018-11-23 12:26:36,947 INFO L273 TraceCheckUtils]: 100: Hoare triple {13920#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13920#false} is VALID [2018-11-23 12:26:36,948 INFO L273 TraceCheckUtils]: 101: Hoare triple {13920#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13920#false} is VALID [2018-11-23 12:26:36,948 INFO L273 TraceCheckUtils]: 102: Hoare triple {13920#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13920#false} is VALID [2018-11-23 12:26:36,948 INFO L273 TraceCheckUtils]: 103: Hoare triple {13920#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {13920#false} is VALID [2018-11-23 12:26:36,948 INFO L273 TraceCheckUtils]: 104: Hoare triple {13920#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {13920#false} is VALID [2018-11-23 12:26:36,948 INFO L273 TraceCheckUtils]: 105: Hoare triple {13920#false} assume !(~i~2 < 99999); {13920#false} is VALID [2018-11-23 12:26:36,948 INFO L273 TraceCheckUtils]: 106: Hoare triple {13920#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {13920#false} is VALID [2018-11-23 12:26:36,948 INFO L256 TraceCheckUtils]: 107: Hoare triple {13920#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {13920#false} is VALID [2018-11-23 12:26:36,948 INFO L273 TraceCheckUtils]: 108: Hoare triple {13920#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {13920#false} is VALID [2018-11-23 12:26:36,948 INFO L273 TraceCheckUtils]: 109: Hoare triple {13920#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:26:36,949 INFO L273 TraceCheckUtils]: 110: Hoare triple {13920#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13920#false} is VALID [2018-11-23 12:26:36,949 INFO L273 TraceCheckUtils]: 111: Hoare triple {13920#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:26:36,949 INFO L273 TraceCheckUtils]: 112: Hoare triple {13920#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13920#false} is VALID [2018-11-23 12:26:36,949 INFO L273 TraceCheckUtils]: 113: Hoare triple {13920#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:26:36,949 INFO L273 TraceCheckUtils]: 114: Hoare triple {13920#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13920#false} is VALID [2018-11-23 12:26:36,949 INFO L273 TraceCheckUtils]: 115: Hoare triple {13920#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:26:36,949 INFO L273 TraceCheckUtils]: 116: Hoare triple {13920#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13920#false} is VALID [2018-11-23 12:26:36,949 INFO L273 TraceCheckUtils]: 117: Hoare triple {13920#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:26:36,949 INFO L273 TraceCheckUtils]: 118: Hoare triple {13920#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13920#false} is VALID [2018-11-23 12:26:36,949 INFO L273 TraceCheckUtils]: 119: Hoare triple {13920#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:26:36,950 INFO L273 TraceCheckUtils]: 120: Hoare triple {13920#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13920#false} is VALID [2018-11-23 12:26:36,950 INFO L273 TraceCheckUtils]: 121: Hoare triple {13920#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:26:36,950 INFO L273 TraceCheckUtils]: 122: Hoare triple {13920#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13920#false} is VALID [2018-11-23 12:26:36,950 INFO L273 TraceCheckUtils]: 123: Hoare triple {13920#false} assume !(~i~0 < 100000); {13920#false} is VALID [2018-11-23 12:26:36,950 INFO L273 TraceCheckUtils]: 124: Hoare triple {13920#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {13920#false} is VALID [2018-11-23 12:26:36,950 INFO L273 TraceCheckUtils]: 125: Hoare triple {13920#false} assume true; {13920#false} is VALID [2018-11-23 12:26:36,950 INFO L268 TraceCheckUtils]: 126: Hoare quadruple {13920#false} {13920#false} #74#return; {13920#false} is VALID [2018-11-23 12:26:36,950 INFO L273 TraceCheckUtils]: 127: Hoare triple {13920#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {13920#false} is VALID [2018-11-23 12:26:36,950 INFO L273 TraceCheckUtils]: 128: Hoare triple {13920#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {13920#false} is VALID [2018-11-23 12:26:36,951 INFO L273 TraceCheckUtils]: 129: Hoare triple {13920#false} assume !false; {13920#false} is VALID [2018-11-23 12:26:36,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2018-11-23 12:26:36,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:36,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-11-23 12:26:36,983 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 130 [2018-11-23 12:26:36,984 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:36,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 12:26:37,067 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:37,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 12:26:37,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 12:26:37,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:26:37,068 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand 26 states. [2018-11-23 12:26:37,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:37,998 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2018-11-23 12:26:37,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 12:26:37,998 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 130 [2018-11-23 12:26:37,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:37,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:26:37,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 98 transitions. [2018-11-23 12:26:37,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:26:38,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 98 transitions. [2018-11-23 12:26:38,000 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 98 transitions. [2018-11-23 12:26:38,094 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:38,096 INFO L225 Difference]: With dead ends: 138 [2018-11-23 12:26:38,096 INFO L226 Difference]: Without dead ends: 96 [2018-11-23 12:26:38,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 130 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-23 12:26:38,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-23 12:26:38,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2018-11-23 12:26:38,139 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:38,139 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 95 states. [2018-11-23 12:26:38,139 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 95 states. [2018-11-23 12:26:38,139 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 95 states. [2018-11-23 12:26:38,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:38,142 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-11-23 12:26:38,142 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-11-23 12:26:38,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:38,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:38,143 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 96 states. [2018-11-23 12:26:38,143 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 96 states. [2018-11-23 12:26:38,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:38,145 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-11-23 12:26:38,145 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-11-23 12:26:38,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:38,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:38,146 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:38,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:38,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-23 12:26:38,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2018-11-23 12:26:38,148 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 130 [2018-11-23 12:26:38,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:38,148 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2018-11-23 12:26:38,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 12:26:38,148 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-11-23 12:26:38,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-23 12:26:38,149 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:38,149 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 21, 21, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:26:38,149 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:38,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:38,150 INFO L82 PathProgramCache]: Analyzing trace with hash -627324865, now seen corresponding path program 23 times [2018-11-23 12:26:38,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:38,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:38,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:38,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:38,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:38,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:39,522 INFO L256 TraceCheckUtils]: 0: Hoare triple {14872#true} call ULTIMATE.init(); {14872#true} is VALID [2018-11-23 12:26:39,523 INFO L273 TraceCheckUtils]: 1: Hoare triple {14872#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14872#true} is VALID [2018-11-23 12:26:39,523 INFO L273 TraceCheckUtils]: 2: Hoare triple {14872#true} assume true; {14872#true} is VALID [2018-11-23 12:26:39,523 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14872#true} {14872#true} #66#return; {14872#true} is VALID [2018-11-23 12:26:39,523 INFO L256 TraceCheckUtils]: 4: Hoare triple {14872#true} call #t~ret13 := main(); {14872#true} is VALID [2018-11-23 12:26:39,523 INFO L273 TraceCheckUtils]: 5: Hoare triple {14872#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; {14874#(= main_~i~1 0)} is VALID [2018-11-23 12:26:39,524 INFO L273 TraceCheckUtils]: 6: Hoare triple {14874#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14874#(= main_~i~1 0)} is VALID [2018-11-23 12:26:39,525 INFO L273 TraceCheckUtils]: 7: Hoare triple {14874#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14875#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:39,525 INFO L273 TraceCheckUtils]: 8: Hoare triple {14875#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14875#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:39,526 INFO L273 TraceCheckUtils]: 9: Hoare triple {14875#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14876#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:39,526 INFO L273 TraceCheckUtils]: 10: Hoare triple {14876#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14876#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:39,527 INFO L273 TraceCheckUtils]: 11: Hoare triple {14876#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14877#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:39,527 INFO L273 TraceCheckUtils]: 12: Hoare triple {14877#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14877#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:39,528 INFO L273 TraceCheckUtils]: 13: Hoare triple {14877#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14878#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:39,529 INFO L273 TraceCheckUtils]: 14: Hoare triple {14878#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14878#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:39,529 INFO L273 TraceCheckUtils]: 15: Hoare triple {14878#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14879#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:39,530 INFO L273 TraceCheckUtils]: 16: Hoare triple {14879#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14879#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:39,530 INFO L273 TraceCheckUtils]: 17: Hoare triple {14879#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14880#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:39,531 INFO L273 TraceCheckUtils]: 18: Hoare triple {14880#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14880#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:39,532 INFO L273 TraceCheckUtils]: 19: Hoare triple {14880#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14881#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:39,532 INFO L273 TraceCheckUtils]: 20: Hoare triple {14881#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14881#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:39,533 INFO L273 TraceCheckUtils]: 21: Hoare triple {14881#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14882#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:39,533 INFO L273 TraceCheckUtils]: 22: Hoare triple {14882#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14882#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:39,534 INFO L273 TraceCheckUtils]: 23: Hoare triple {14882#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14883#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:39,534 INFO L273 TraceCheckUtils]: 24: Hoare triple {14883#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14883#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:39,535 INFO L273 TraceCheckUtils]: 25: Hoare triple {14883#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14884#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:39,536 INFO L273 TraceCheckUtils]: 26: Hoare triple {14884#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14884#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:39,536 INFO L273 TraceCheckUtils]: 27: Hoare triple {14884#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14885#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:39,537 INFO L273 TraceCheckUtils]: 28: Hoare triple {14885#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14885#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:39,537 INFO L273 TraceCheckUtils]: 29: Hoare triple {14885#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14886#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:39,538 INFO L273 TraceCheckUtils]: 30: Hoare triple {14886#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14886#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:39,539 INFO L273 TraceCheckUtils]: 31: Hoare triple {14886#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14887#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:39,539 INFO L273 TraceCheckUtils]: 32: Hoare triple {14887#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14887#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:39,540 INFO L273 TraceCheckUtils]: 33: Hoare triple {14887#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14888#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:39,540 INFO L273 TraceCheckUtils]: 34: Hoare triple {14888#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14888#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:39,541 INFO L273 TraceCheckUtils]: 35: Hoare triple {14888#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14889#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:39,541 INFO L273 TraceCheckUtils]: 36: Hoare triple {14889#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14889#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:39,542 INFO L273 TraceCheckUtils]: 37: Hoare triple {14889#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14890#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:39,543 INFO L273 TraceCheckUtils]: 38: Hoare triple {14890#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14890#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:39,543 INFO L273 TraceCheckUtils]: 39: Hoare triple {14890#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14891#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:39,544 INFO L273 TraceCheckUtils]: 40: Hoare triple {14891#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14891#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:39,545 INFO L273 TraceCheckUtils]: 41: Hoare triple {14891#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14892#(<= main_~i~1 18)} is VALID [2018-11-23 12:26:39,545 INFO L273 TraceCheckUtils]: 42: Hoare triple {14892#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14892#(<= main_~i~1 18)} is VALID [2018-11-23 12:26:39,546 INFO L273 TraceCheckUtils]: 43: Hoare triple {14892#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14893#(<= main_~i~1 19)} is VALID [2018-11-23 12:26:39,546 INFO L273 TraceCheckUtils]: 44: Hoare triple {14893#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14893#(<= main_~i~1 19)} is VALID [2018-11-23 12:26:39,547 INFO L273 TraceCheckUtils]: 45: Hoare triple {14893#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14894#(<= main_~i~1 20)} is VALID [2018-11-23 12:26:39,548 INFO L273 TraceCheckUtils]: 46: Hoare triple {14894#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14894#(<= main_~i~1 20)} is VALID [2018-11-23 12:26:39,548 INFO L273 TraceCheckUtils]: 47: Hoare triple {14894#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14895#(<= main_~i~1 21)} is VALID [2018-11-23 12:26:39,549 INFO L273 TraceCheckUtils]: 48: Hoare triple {14895#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14895#(<= main_~i~1 21)} is VALID [2018-11-23 12:26:39,550 INFO L273 TraceCheckUtils]: 49: Hoare triple {14895#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14896#(<= main_~i~1 22)} is VALID [2018-11-23 12:26:39,550 INFO L273 TraceCheckUtils]: 50: Hoare triple {14896#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14896#(<= main_~i~1 22)} is VALID [2018-11-23 12:26:39,551 INFO L273 TraceCheckUtils]: 51: Hoare triple {14896#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14897#(<= main_~i~1 23)} is VALID [2018-11-23 12:26:39,552 INFO L273 TraceCheckUtils]: 52: Hoare triple {14897#(<= main_~i~1 23)} assume !(~i~1 < 100000); {14873#false} is VALID [2018-11-23 12:26:39,552 INFO L256 TraceCheckUtils]: 53: Hoare triple {14873#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {14872#true} is VALID [2018-11-23 12:26:39,552 INFO L273 TraceCheckUtils]: 54: Hoare triple {14872#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {14872#true} is VALID [2018-11-23 12:26:39,552 INFO L273 TraceCheckUtils]: 55: Hoare triple {14872#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:26:39,552 INFO L273 TraceCheckUtils]: 56: Hoare triple {14872#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14872#true} is VALID [2018-11-23 12:26:39,553 INFO L273 TraceCheckUtils]: 57: Hoare triple {14872#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:26:39,553 INFO L273 TraceCheckUtils]: 58: Hoare triple {14872#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14872#true} is VALID [2018-11-23 12:26:39,553 INFO L273 TraceCheckUtils]: 59: Hoare triple {14872#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:26:39,553 INFO L273 TraceCheckUtils]: 60: Hoare triple {14872#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14872#true} is VALID [2018-11-23 12:26:39,553 INFO L273 TraceCheckUtils]: 61: Hoare triple {14872#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:26:39,553 INFO L273 TraceCheckUtils]: 62: Hoare triple {14872#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14872#true} is VALID [2018-11-23 12:26:39,554 INFO L273 TraceCheckUtils]: 63: Hoare triple {14872#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:26:39,554 INFO L273 TraceCheckUtils]: 64: Hoare triple {14872#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14872#true} is VALID [2018-11-23 12:26:39,554 INFO L273 TraceCheckUtils]: 65: Hoare triple {14872#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:26:39,554 INFO L273 TraceCheckUtils]: 66: Hoare triple {14872#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14872#true} is VALID [2018-11-23 12:26:39,554 INFO L273 TraceCheckUtils]: 67: Hoare triple {14872#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:26:39,554 INFO L273 TraceCheckUtils]: 68: Hoare triple {14872#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14872#true} is VALID [2018-11-23 12:26:39,555 INFO L273 TraceCheckUtils]: 69: Hoare triple {14872#true} assume !(~i~0 < 100000); {14872#true} is VALID [2018-11-23 12:26:39,555 INFO L273 TraceCheckUtils]: 70: Hoare triple {14872#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {14872#true} is VALID [2018-11-23 12:26:39,555 INFO L273 TraceCheckUtils]: 71: Hoare triple {14872#true} assume true; {14872#true} is VALID [2018-11-23 12:26:39,555 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {14872#true} {14873#false} #70#return; {14873#false} is VALID [2018-11-23 12:26:39,555 INFO L273 TraceCheckUtils]: 73: Hoare triple {14873#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {14873#false} is VALID [2018-11-23 12:26:39,556 INFO L256 TraceCheckUtils]: 74: Hoare triple {14873#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {14872#true} is VALID [2018-11-23 12:26:39,556 INFO L273 TraceCheckUtils]: 75: Hoare triple {14872#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {14872#true} is VALID [2018-11-23 12:26:39,556 INFO L273 TraceCheckUtils]: 76: Hoare triple {14872#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:26:39,556 INFO L273 TraceCheckUtils]: 77: Hoare triple {14872#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14872#true} is VALID [2018-11-23 12:26:39,556 INFO L273 TraceCheckUtils]: 78: Hoare triple {14872#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:26:39,556 INFO L273 TraceCheckUtils]: 79: Hoare triple {14872#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14872#true} is VALID [2018-11-23 12:26:39,556 INFO L273 TraceCheckUtils]: 80: Hoare triple {14872#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:26:39,556 INFO L273 TraceCheckUtils]: 81: Hoare triple {14872#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14872#true} is VALID [2018-11-23 12:26:39,556 INFO L273 TraceCheckUtils]: 82: Hoare triple {14872#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:26:39,557 INFO L273 TraceCheckUtils]: 83: Hoare triple {14872#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14872#true} is VALID [2018-11-23 12:26:39,557 INFO L273 TraceCheckUtils]: 84: Hoare triple {14872#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:26:39,557 INFO L273 TraceCheckUtils]: 85: Hoare triple {14872#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14872#true} is VALID [2018-11-23 12:26:39,557 INFO L273 TraceCheckUtils]: 86: Hoare triple {14872#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:26:39,557 INFO L273 TraceCheckUtils]: 87: Hoare triple {14872#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14872#true} is VALID [2018-11-23 12:26:39,557 INFO L273 TraceCheckUtils]: 88: Hoare triple {14872#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:26:39,557 INFO L273 TraceCheckUtils]: 89: Hoare triple {14872#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14872#true} is VALID [2018-11-23 12:26:39,557 INFO L273 TraceCheckUtils]: 90: Hoare triple {14872#true} assume !(~i~0 < 100000); {14872#true} is VALID [2018-11-23 12:26:39,557 INFO L273 TraceCheckUtils]: 91: Hoare triple {14872#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {14872#true} is VALID [2018-11-23 12:26:39,557 INFO L273 TraceCheckUtils]: 92: Hoare triple {14872#true} assume true; {14872#true} is VALID [2018-11-23 12:26:39,558 INFO L268 TraceCheckUtils]: 93: Hoare quadruple {14872#true} {14873#false} #72#return; {14873#false} is VALID [2018-11-23 12:26:39,558 INFO L273 TraceCheckUtils]: 94: Hoare triple {14873#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {14873#false} is VALID [2018-11-23 12:26:39,558 INFO L273 TraceCheckUtils]: 95: Hoare triple {14873#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {14873#false} is VALID [2018-11-23 12:26:39,558 INFO L273 TraceCheckUtils]: 96: Hoare triple {14873#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {14873#false} is VALID [2018-11-23 12:26:39,558 INFO L273 TraceCheckUtils]: 97: Hoare triple {14873#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {14873#false} is VALID [2018-11-23 12:26:39,558 INFO L273 TraceCheckUtils]: 98: Hoare triple {14873#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {14873#false} is VALID [2018-11-23 12:26:39,558 INFO L273 TraceCheckUtils]: 99: Hoare triple {14873#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {14873#false} is VALID [2018-11-23 12:26:39,558 INFO L273 TraceCheckUtils]: 100: Hoare triple {14873#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {14873#false} is VALID [2018-11-23 12:26:39,558 INFO L273 TraceCheckUtils]: 101: Hoare triple {14873#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {14873#false} is VALID [2018-11-23 12:26:39,559 INFO L273 TraceCheckUtils]: 102: Hoare triple {14873#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {14873#false} is VALID [2018-11-23 12:26:39,559 INFO L273 TraceCheckUtils]: 103: Hoare triple {14873#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {14873#false} is VALID [2018-11-23 12:26:39,559 INFO L273 TraceCheckUtils]: 104: Hoare triple {14873#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {14873#false} is VALID [2018-11-23 12:26:39,559 INFO L273 TraceCheckUtils]: 105: Hoare triple {14873#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {14873#false} is VALID [2018-11-23 12:26:39,559 INFO L273 TraceCheckUtils]: 106: Hoare triple {14873#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {14873#false} is VALID [2018-11-23 12:26:39,559 INFO L273 TraceCheckUtils]: 107: Hoare triple {14873#false} assume !(~i~2 < 99999); {14873#false} is VALID [2018-11-23 12:26:39,559 INFO L273 TraceCheckUtils]: 108: Hoare triple {14873#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {14873#false} is VALID [2018-11-23 12:26:39,559 INFO L256 TraceCheckUtils]: 109: Hoare triple {14873#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {14872#true} is VALID [2018-11-23 12:26:39,559 INFO L273 TraceCheckUtils]: 110: Hoare triple {14872#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {14872#true} is VALID [2018-11-23 12:26:39,560 INFO L273 TraceCheckUtils]: 111: Hoare triple {14872#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:26:39,560 INFO L273 TraceCheckUtils]: 112: Hoare triple {14872#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14872#true} is VALID [2018-11-23 12:26:39,560 INFO L273 TraceCheckUtils]: 113: Hoare triple {14872#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:26:39,560 INFO L273 TraceCheckUtils]: 114: Hoare triple {14872#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14872#true} is VALID [2018-11-23 12:26:39,560 INFO L273 TraceCheckUtils]: 115: Hoare triple {14872#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:26:39,560 INFO L273 TraceCheckUtils]: 116: Hoare triple {14872#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14872#true} is VALID [2018-11-23 12:26:39,560 INFO L273 TraceCheckUtils]: 117: Hoare triple {14872#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:26:39,560 INFO L273 TraceCheckUtils]: 118: Hoare triple {14872#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14872#true} is VALID [2018-11-23 12:26:39,560 INFO L273 TraceCheckUtils]: 119: Hoare triple {14872#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:26:39,561 INFO L273 TraceCheckUtils]: 120: Hoare triple {14872#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14872#true} is VALID [2018-11-23 12:26:39,561 INFO L273 TraceCheckUtils]: 121: Hoare triple {14872#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:26:39,561 INFO L273 TraceCheckUtils]: 122: Hoare triple {14872#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14872#true} is VALID [2018-11-23 12:26:39,561 INFO L273 TraceCheckUtils]: 123: Hoare triple {14872#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:26:39,561 INFO L273 TraceCheckUtils]: 124: Hoare triple {14872#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14872#true} is VALID [2018-11-23 12:26:39,561 INFO L273 TraceCheckUtils]: 125: Hoare triple {14872#true} assume !(~i~0 < 100000); {14872#true} is VALID [2018-11-23 12:26:39,561 INFO L273 TraceCheckUtils]: 126: Hoare triple {14872#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {14872#true} is VALID [2018-11-23 12:26:39,561 INFO L273 TraceCheckUtils]: 127: Hoare triple {14872#true} assume true; {14872#true} is VALID [2018-11-23 12:26:39,561 INFO L268 TraceCheckUtils]: 128: Hoare quadruple {14872#true} {14873#false} #74#return; {14873#false} is VALID [2018-11-23 12:26:39,562 INFO L273 TraceCheckUtils]: 129: Hoare triple {14873#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {14873#false} is VALID [2018-11-23 12:26:39,562 INFO L273 TraceCheckUtils]: 130: Hoare triple {14873#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {14873#false} is VALID [2018-11-23 12:26:39,562 INFO L273 TraceCheckUtils]: 131: Hoare triple {14873#false} assume !false; {14873#false} is VALID [2018-11-23 12:26:39,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1063 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2018-11-23 12:26:39,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:39,575 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:39,586 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:26:40,889 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2018-11-23 12:26:40,890 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:40,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:40,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:41,763 INFO L256 TraceCheckUtils]: 0: Hoare triple {14872#true} call ULTIMATE.init(); {14872#true} is VALID [2018-11-23 12:26:41,763 INFO L273 TraceCheckUtils]: 1: Hoare triple {14872#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14872#true} is VALID [2018-11-23 12:26:41,763 INFO L273 TraceCheckUtils]: 2: Hoare triple {14872#true} assume true; {14872#true} is VALID [2018-11-23 12:26:41,763 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14872#true} {14872#true} #66#return; {14872#true} is VALID [2018-11-23 12:26:41,764 INFO L256 TraceCheckUtils]: 4: Hoare triple {14872#true} call #t~ret13 := main(); {14872#true} is VALID [2018-11-23 12:26:41,764 INFO L273 TraceCheckUtils]: 5: Hoare triple {14872#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; {14872#true} is VALID [2018-11-23 12:26:41,764 INFO L273 TraceCheckUtils]: 6: Hoare triple {14872#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14872#true} is VALID [2018-11-23 12:26:41,764 INFO L273 TraceCheckUtils]: 7: Hoare triple {14872#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14872#true} is VALID [2018-11-23 12:26:41,764 INFO L273 TraceCheckUtils]: 8: Hoare triple {14872#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14872#true} is VALID [2018-11-23 12:26:41,764 INFO L273 TraceCheckUtils]: 9: Hoare triple {14872#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14872#true} is VALID [2018-11-23 12:26:41,764 INFO L273 TraceCheckUtils]: 10: Hoare triple {14872#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14872#true} is VALID [2018-11-23 12:26:41,764 INFO L273 TraceCheckUtils]: 11: Hoare triple {14872#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14872#true} is VALID [2018-11-23 12:26:41,764 INFO L273 TraceCheckUtils]: 12: Hoare triple {14872#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14872#true} is VALID [2018-11-23 12:26:41,765 INFO L273 TraceCheckUtils]: 13: Hoare triple {14872#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14872#true} is VALID [2018-11-23 12:26:41,765 INFO L273 TraceCheckUtils]: 14: Hoare triple {14872#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14872#true} is VALID [2018-11-23 12:26:41,765 INFO L273 TraceCheckUtils]: 15: Hoare triple {14872#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14872#true} is VALID [2018-11-23 12:26:41,765 INFO L273 TraceCheckUtils]: 16: Hoare triple {14872#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14872#true} is VALID [2018-11-23 12:26:41,765 INFO L273 TraceCheckUtils]: 17: Hoare triple {14872#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14872#true} is VALID [2018-11-23 12:26:41,765 INFO L273 TraceCheckUtils]: 18: Hoare triple {14872#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14872#true} is VALID [2018-11-23 12:26:41,765 INFO L273 TraceCheckUtils]: 19: Hoare triple {14872#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14872#true} is VALID [2018-11-23 12:26:41,765 INFO L273 TraceCheckUtils]: 20: Hoare triple {14872#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14872#true} is VALID [2018-11-23 12:26:41,765 INFO L273 TraceCheckUtils]: 21: Hoare triple {14872#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14872#true} is VALID [2018-11-23 12:26:41,766 INFO L273 TraceCheckUtils]: 22: Hoare triple {14872#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14872#true} is VALID [2018-11-23 12:26:41,766 INFO L273 TraceCheckUtils]: 23: Hoare triple {14872#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14872#true} is VALID [2018-11-23 12:26:41,766 INFO L273 TraceCheckUtils]: 24: Hoare triple {14872#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14872#true} is VALID [2018-11-23 12:26:41,766 INFO L273 TraceCheckUtils]: 25: Hoare triple {14872#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14872#true} is VALID [2018-11-23 12:26:41,766 INFO L273 TraceCheckUtils]: 26: Hoare triple {14872#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14872#true} is VALID [2018-11-23 12:26:41,766 INFO L273 TraceCheckUtils]: 27: Hoare triple {14872#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14872#true} is VALID [2018-11-23 12:26:41,766 INFO L273 TraceCheckUtils]: 28: Hoare triple {14872#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14872#true} is VALID [2018-11-23 12:26:41,766 INFO L273 TraceCheckUtils]: 29: Hoare triple {14872#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14872#true} is VALID [2018-11-23 12:26:41,766 INFO L273 TraceCheckUtils]: 30: Hoare triple {14872#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14872#true} is VALID [2018-11-23 12:26:41,767 INFO L273 TraceCheckUtils]: 31: Hoare triple {14872#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14872#true} is VALID [2018-11-23 12:26:41,767 INFO L273 TraceCheckUtils]: 32: Hoare triple {14872#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14872#true} is VALID [2018-11-23 12:26:41,767 INFO L273 TraceCheckUtils]: 33: Hoare triple {14872#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14872#true} is VALID [2018-11-23 12:26:41,767 INFO L273 TraceCheckUtils]: 34: Hoare triple {14872#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14872#true} is VALID [2018-11-23 12:26:41,767 INFO L273 TraceCheckUtils]: 35: Hoare triple {14872#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14872#true} is VALID [2018-11-23 12:26:41,767 INFO L273 TraceCheckUtils]: 36: Hoare triple {14872#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14872#true} is VALID [2018-11-23 12:26:41,767 INFO L273 TraceCheckUtils]: 37: Hoare triple {14872#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14872#true} is VALID [2018-11-23 12:26:41,767 INFO L273 TraceCheckUtils]: 38: Hoare triple {14872#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14872#true} is VALID [2018-11-23 12:26:41,767 INFO L273 TraceCheckUtils]: 39: Hoare triple {14872#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14872#true} is VALID [2018-11-23 12:26:41,767 INFO L273 TraceCheckUtils]: 40: Hoare triple {14872#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14872#true} is VALID [2018-11-23 12:26:41,768 INFO L273 TraceCheckUtils]: 41: Hoare triple {14872#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14872#true} is VALID [2018-11-23 12:26:41,768 INFO L273 TraceCheckUtils]: 42: Hoare triple {14872#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14872#true} is VALID [2018-11-23 12:26:41,768 INFO L273 TraceCheckUtils]: 43: Hoare triple {14872#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14872#true} is VALID [2018-11-23 12:26:41,768 INFO L273 TraceCheckUtils]: 44: Hoare triple {14872#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14872#true} is VALID [2018-11-23 12:26:41,768 INFO L273 TraceCheckUtils]: 45: Hoare triple {14872#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14872#true} is VALID [2018-11-23 12:26:41,768 INFO L273 TraceCheckUtils]: 46: Hoare triple {14872#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14872#true} is VALID [2018-11-23 12:26:41,768 INFO L273 TraceCheckUtils]: 47: Hoare triple {14872#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14872#true} is VALID [2018-11-23 12:26:41,768 INFO L273 TraceCheckUtils]: 48: Hoare triple {14872#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14872#true} is VALID [2018-11-23 12:26:41,768 INFO L273 TraceCheckUtils]: 49: Hoare triple {14872#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14872#true} is VALID [2018-11-23 12:26:41,769 INFO L273 TraceCheckUtils]: 50: Hoare triple {14872#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {14872#true} is VALID [2018-11-23 12:26:41,769 INFO L273 TraceCheckUtils]: 51: Hoare triple {14872#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {14872#true} is VALID [2018-11-23 12:26:41,769 INFO L273 TraceCheckUtils]: 52: Hoare triple {14872#true} assume !(~i~1 < 100000); {14872#true} is VALID [2018-11-23 12:26:41,769 INFO L256 TraceCheckUtils]: 53: Hoare triple {14872#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {14872#true} is VALID [2018-11-23 12:26:41,770 INFO L273 TraceCheckUtils]: 54: Hoare triple {14872#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {15063#(<= bor_~i~0 1)} is VALID [2018-11-23 12:26:41,772 INFO L273 TraceCheckUtils]: 55: Hoare triple {15063#(<= bor_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15063#(<= bor_~i~0 1)} is VALID [2018-11-23 12:26:41,772 INFO L273 TraceCheckUtils]: 56: Hoare triple {15063#(<= bor_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15070#(<= bor_~i~0 2)} is VALID [2018-11-23 12:26:41,774 INFO L273 TraceCheckUtils]: 57: Hoare triple {15070#(<= bor_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15070#(<= bor_~i~0 2)} is VALID [2018-11-23 12:26:41,774 INFO L273 TraceCheckUtils]: 58: Hoare triple {15070#(<= bor_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15077#(<= bor_~i~0 3)} is VALID [2018-11-23 12:26:41,776 INFO L273 TraceCheckUtils]: 59: Hoare triple {15077#(<= bor_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15077#(<= bor_~i~0 3)} is VALID [2018-11-23 12:26:41,776 INFO L273 TraceCheckUtils]: 60: Hoare triple {15077#(<= bor_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15084#(<= bor_~i~0 4)} is VALID [2018-11-23 12:26:41,779 INFO L273 TraceCheckUtils]: 61: Hoare triple {15084#(<= bor_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15084#(<= bor_~i~0 4)} is VALID [2018-11-23 12:26:41,779 INFO L273 TraceCheckUtils]: 62: Hoare triple {15084#(<= bor_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15091#(<= bor_~i~0 5)} is VALID [2018-11-23 12:26:41,781 INFO L273 TraceCheckUtils]: 63: Hoare triple {15091#(<= bor_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15091#(<= bor_~i~0 5)} is VALID [2018-11-23 12:26:41,781 INFO L273 TraceCheckUtils]: 64: Hoare triple {15091#(<= bor_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15098#(<= bor_~i~0 6)} is VALID [2018-11-23 12:26:41,783 INFO L273 TraceCheckUtils]: 65: Hoare triple {15098#(<= bor_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15098#(<= bor_~i~0 6)} is VALID [2018-11-23 12:26:41,783 INFO L273 TraceCheckUtils]: 66: Hoare triple {15098#(<= bor_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15105#(<= bor_~i~0 7)} is VALID [2018-11-23 12:26:41,785 INFO L273 TraceCheckUtils]: 67: Hoare triple {15105#(<= bor_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15105#(<= bor_~i~0 7)} is VALID [2018-11-23 12:26:41,785 INFO L273 TraceCheckUtils]: 68: Hoare triple {15105#(<= bor_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15112#(<= bor_~i~0 8)} is VALID [2018-11-23 12:26:41,787 INFO L273 TraceCheckUtils]: 69: Hoare triple {15112#(<= bor_~i~0 8)} assume !(~i~0 < 100000); {14873#false} is VALID [2018-11-23 12:26:41,787 INFO L273 TraceCheckUtils]: 70: Hoare triple {14873#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {14873#false} is VALID [2018-11-23 12:26:41,787 INFO L273 TraceCheckUtils]: 71: Hoare triple {14873#false} assume true; {14873#false} is VALID [2018-11-23 12:26:41,787 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {14873#false} {14872#true} #70#return; {14873#false} is VALID [2018-11-23 12:26:41,787 INFO L273 TraceCheckUtils]: 73: Hoare triple {14873#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {14873#false} is VALID [2018-11-23 12:26:41,787 INFO L256 TraceCheckUtils]: 74: Hoare triple {14873#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {14873#false} is VALID [2018-11-23 12:26:41,787 INFO L273 TraceCheckUtils]: 75: Hoare triple {14873#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {14873#false} is VALID [2018-11-23 12:26:41,787 INFO L273 TraceCheckUtils]: 76: Hoare triple {14873#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14873#false} is VALID [2018-11-23 12:26:41,788 INFO L273 TraceCheckUtils]: 77: Hoare triple {14873#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14873#false} is VALID [2018-11-23 12:26:41,788 INFO L273 TraceCheckUtils]: 78: Hoare triple {14873#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14873#false} is VALID [2018-11-23 12:26:41,788 INFO L273 TraceCheckUtils]: 79: Hoare triple {14873#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14873#false} is VALID [2018-11-23 12:26:41,788 INFO L273 TraceCheckUtils]: 80: Hoare triple {14873#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14873#false} is VALID [2018-11-23 12:26:41,788 INFO L273 TraceCheckUtils]: 81: Hoare triple {14873#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14873#false} is VALID [2018-11-23 12:26:41,788 INFO L273 TraceCheckUtils]: 82: Hoare triple {14873#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14873#false} is VALID [2018-11-23 12:26:41,788 INFO L273 TraceCheckUtils]: 83: Hoare triple {14873#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14873#false} is VALID [2018-11-23 12:26:41,788 INFO L273 TraceCheckUtils]: 84: Hoare triple {14873#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14873#false} is VALID [2018-11-23 12:26:41,788 INFO L273 TraceCheckUtils]: 85: Hoare triple {14873#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14873#false} is VALID [2018-11-23 12:26:41,789 INFO L273 TraceCheckUtils]: 86: Hoare triple {14873#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14873#false} is VALID [2018-11-23 12:26:41,789 INFO L273 TraceCheckUtils]: 87: Hoare triple {14873#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14873#false} is VALID [2018-11-23 12:26:41,789 INFO L273 TraceCheckUtils]: 88: Hoare triple {14873#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14873#false} is VALID [2018-11-23 12:26:41,789 INFO L273 TraceCheckUtils]: 89: Hoare triple {14873#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14873#false} is VALID [2018-11-23 12:26:41,789 INFO L273 TraceCheckUtils]: 90: Hoare triple {14873#false} assume !(~i~0 < 100000); {14873#false} is VALID [2018-11-23 12:26:41,789 INFO L273 TraceCheckUtils]: 91: Hoare triple {14873#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {14873#false} is VALID [2018-11-23 12:26:41,789 INFO L273 TraceCheckUtils]: 92: Hoare triple {14873#false} assume true; {14873#false} is VALID [2018-11-23 12:26:41,789 INFO L268 TraceCheckUtils]: 93: Hoare quadruple {14873#false} {14873#false} #72#return; {14873#false} is VALID [2018-11-23 12:26:41,789 INFO L273 TraceCheckUtils]: 94: Hoare triple {14873#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {14873#false} is VALID [2018-11-23 12:26:41,790 INFO L273 TraceCheckUtils]: 95: Hoare triple {14873#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {14873#false} is VALID [2018-11-23 12:26:41,790 INFO L273 TraceCheckUtils]: 96: Hoare triple {14873#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {14873#false} is VALID [2018-11-23 12:26:41,790 INFO L273 TraceCheckUtils]: 97: Hoare triple {14873#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {14873#false} is VALID [2018-11-23 12:26:41,790 INFO L273 TraceCheckUtils]: 98: Hoare triple {14873#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {14873#false} is VALID [2018-11-23 12:26:41,790 INFO L273 TraceCheckUtils]: 99: Hoare triple {14873#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {14873#false} is VALID [2018-11-23 12:26:41,790 INFO L273 TraceCheckUtils]: 100: Hoare triple {14873#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {14873#false} is VALID [2018-11-23 12:26:41,790 INFO L273 TraceCheckUtils]: 101: Hoare triple {14873#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {14873#false} is VALID [2018-11-23 12:26:41,790 INFO L273 TraceCheckUtils]: 102: Hoare triple {14873#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {14873#false} is VALID [2018-11-23 12:26:41,790 INFO L273 TraceCheckUtils]: 103: Hoare triple {14873#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {14873#false} is VALID [2018-11-23 12:26:41,790 INFO L273 TraceCheckUtils]: 104: Hoare triple {14873#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {14873#false} is VALID [2018-11-23 12:26:41,791 INFO L273 TraceCheckUtils]: 105: Hoare triple {14873#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {14873#false} is VALID [2018-11-23 12:26:41,791 INFO L273 TraceCheckUtils]: 106: Hoare triple {14873#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {14873#false} is VALID [2018-11-23 12:26:41,791 INFO L273 TraceCheckUtils]: 107: Hoare triple {14873#false} assume !(~i~2 < 99999); {14873#false} is VALID [2018-11-23 12:26:41,791 INFO L273 TraceCheckUtils]: 108: Hoare triple {14873#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {14873#false} is VALID [2018-11-23 12:26:41,791 INFO L256 TraceCheckUtils]: 109: Hoare triple {14873#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {14873#false} is VALID [2018-11-23 12:26:41,791 INFO L273 TraceCheckUtils]: 110: Hoare triple {14873#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {14873#false} is VALID [2018-11-23 12:26:41,791 INFO L273 TraceCheckUtils]: 111: Hoare triple {14873#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14873#false} is VALID [2018-11-23 12:26:41,791 INFO L273 TraceCheckUtils]: 112: Hoare triple {14873#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14873#false} is VALID [2018-11-23 12:26:41,791 INFO L273 TraceCheckUtils]: 113: Hoare triple {14873#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14873#false} is VALID [2018-11-23 12:26:41,792 INFO L273 TraceCheckUtils]: 114: Hoare triple {14873#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14873#false} is VALID [2018-11-23 12:26:41,792 INFO L273 TraceCheckUtils]: 115: Hoare triple {14873#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14873#false} is VALID [2018-11-23 12:26:41,792 INFO L273 TraceCheckUtils]: 116: Hoare triple {14873#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14873#false} is VALID [2018-11-23 12:26:41,792 INFO L273 TraceCheckUtils]: 117: Hoare triple {14873#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14873#false} is VALID [2018-11-23 12:26:41,792 INFO L273 TraceCheckUtils]: 118: Hoare triple {14873#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14873#false} is VALID [2018-11-23 12:26:41,792 INFO L273 TraceCheckUtils]: 119: Hoare triple {14873#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14873#false} is VALID [2018-11-23 12:26:41,792 INFO L273 TraceCheckUtils]: 120: Hoare triple {14873#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14873#false} is VALID [2018-11-23 12:26:41,792 INFO L273 TraceCheckUtils]: 121: Hoare triple {14873#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14873#false} is VALID [2018-11-23 12:26:41,792 INFO L273 TraceCheckUtils]: 122: Hoare triple {14873#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14873#false} is VALID [2018-11-23 12:26:41,793 INFO L273 TraceCheckUtils]: 123: Hoare triple {14873#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {14873#false} is VALID [2018-11-23 12:26:41,793 INFO L273 TraceCheckUtils]: 124: Hoare triple {14873#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14873#false} is VALID [2018-11-23 12:26:41,793 INFO L273 TraceCheckUtils]: 125: Hoare triple {14873#false} assume !(~i~0 < 100000); {14873#false} is VALID [2018-11-23 12:26:41,793 INFO L273 TraceCheckUtils]: 126: Hoare triple {14873#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {14873#false} is VALID [2018-11-23 12:26:41,793 INFO L273 TraceCheckUtils]: 127: Hoare triple {14873#false} assume true; {14873#false} is VALID [2018-11-23 12:26:41,793 INFO L268 TraceCheckUtils]: 128: Hoare quadruple {14873#false} {14873#false} #74#return; {14873#false} is VALID [2018-11-23 12:26:41,793 INFO L273 TraceCheckUtils]: 129: Hoare triple {14873#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {14873#false} is VALID [2018-11-23 12:26:41,793 INFO L273 TraceCheckUtils]: 130: Hoare triple {14873#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {14873#false} is VALID [2018-11-23 12:26:41,793 INFO L273 TraceCheckUtils]: 131: Hoare triple {14873#false} assume !false; {14873#false} is VALID [2018-11-23 12:26:41,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1063 backedges. 228 proven. 49 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2018-11-23 12:26:41,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:41,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 10] total 34 [2018-11-23 12:26:41,821 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 132 [2018-11-23 12:26:41,822 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:41,822 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-23 12:26:42,042 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:42,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 12:26:42,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 12:26:42,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=753, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:26:42,043 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 34 states. [2018-11-23 12:26:42,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:42,860 INFO L93 Difference]: Finished difference Result 143 states and 155 transitions. [2018-11-23 12:26:42,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 12:26:42,860 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 132 [2018-11-23 12:26:42,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:42,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:26:42,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 120 transitions. [2018-11-23 12:26:42,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:26:42,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 120 transitions. [2018-11-23 12:26:42,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 120 transitions. [2018-11-23 12:26:43,241 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:43,243 INFO L225 Difference]: With dead ends: 143 [2018-11-23 12:26:43,243 INFO L226 Difference]: Without dead ends: 101 [2018-11-23 12:26:43,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=369, Invalid=753, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:26:43,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-23 12:26:43,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2018-11-23 12:26:43,792 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:43,792 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 99 states. [2018-11-23 12:26:43,792 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 99 states. [2018-11-23 12:26:43,792 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 99 states. [2018-11-23 12:26:43,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:43,796 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-11-23 12:26:43,796 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-11-23 12:26:43,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:43,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:43,797 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 101 states. [2018-11-23 12:26:43,797 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 101 states. [2018-11-23 12:26:43,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:43,799 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-11-23 12:26:43,799 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-11-23 12:26:43,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:43,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:43,800 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:43,800 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:43,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-23 12:26:43,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2018-11-23 12:26:43,802 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 132 [2018-11-23 12:26:43,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:43,803 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2018-11-23 12:26:43,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-23 12:26:43,803 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2018-11-23 12:26:43,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-23 12:26:43,804 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:43,804 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:26:43,804 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:43,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:43,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1976094561, now seen corresponding path program 24 times [2018-11-23 12:26:43,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:43,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:43,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:43,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:43,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:43,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:44,520 INFO L256 TraceCheckUtils]: 0: Hoare triple {15862#true} call ULTIMATE.init(); {15862#true} is VALID [2018-11-23 12:26:44,520 INFO L273 TraceCheckUtils]: 1: Hoare triple {15862#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15862#true} is VALID [2018-11-23 12:26:44,520 INFO L273 TraceCheckUtils]: 2: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:26:44,521 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15862#true} {15862#true} #66#return; {15862#true} is VALID [2018-11-23 12:26:44,521 INFO L256 TraceCheckUtils]: 4: Hoare triple {15862#true} call #t~ret13 := main(); {15862#true} is VALID [2018-11-23 12:26:44,522 INFO L273 TraceCheckUtils]: 5: Hoare triple {15862#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; {15864#(= main_~i~1 0)} is VALID [2018-11-23 12:26:44,522 INFO L273 TraceCheckUtils]: 6: Hoare triple {15864#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15864#(= main_~i~1 0)} is VALID [2018-11-23 12:26:44,523 INFO L273 TraceCheckUtils]: 7: Hoare triple {15864#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15865#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:44,524 INFO L273 TraceCheckUtils]: 8: Hoare triple {15865#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15865#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:44,524 INFO L273 TraceCheckUtils]: 9: Hoare triple {15865#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15866#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:44,525 INFO L273 TraceCheckUtils]: 10: Hoare triple {15866#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15866#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:44,525 INFO L273 TraceCheckUtils]: 11: Hoare triple {15866#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15867#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:44,525 INFO L273 TraceCheckUtils]: 12: Hoare triple {15867#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15867#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:44,526 INFO L273 TraceCheckUtils]: 13: Hoare triple {15867#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15868#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:44,526 INFO L273 TraceCheckUtils]: 14: Hoare triple {15868#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15868#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:44,527 INFO L273 TraceCheckUtils]: 15: Hoare triple {15868#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15869#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:44,527 INFO L273 TraceCheckUtils]: 16: Hoare triple {15869#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15869#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:44,528 INFO L273 TraceCheckUtils]: 17: Hoare triple {15869#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15870#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:44,529 INFO L273 TraceCheckUtils]: 18: Hoare triple {15870#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15870#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:44,529 INFO L273 TraceCheckUtils]: 19: Hoare triple {15870#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15871#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:44,530 INFO L273 TraceCheckUtils]: 20: Hoare triple {15871#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15871#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:44,531 INFO L273 TraceCheckUtils]: 21: Hoare triple {15871#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15872#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:44,549 INFO L273 TraceCheckUtils]: 22: Hoare triple {15872#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15872#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:44,563 INFO L273 TraceCheckUtils]: 23: Hoare triple {15872#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15873#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:44,577 INFO L273 TraceCheckUtils]: 24: Hoare triple {15873#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15873#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:44,577 INFO L273 TraceCheckUtils]: 25: Hoare triple {15873#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15874#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:44,578 INFO L273 TraceCheckUtils]: 26: Hoare triple {15874#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15874#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:44,578 INFO L273 TraceCheckUtils]: 27: Hoare triple {15874#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15875#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:44,578 INFO L273 TraceCheckUtils]: 28: Hoare triple {15875#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15875#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:44,579 INFO L273 TraceCheckUtils]: 29: Hoare triple {15875#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15876#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:44,579 INFO L273 TraceCheckUtils]: 30: Hoare triple {15876#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15876#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:44,580 INFO L273 TraceCheckUtils]: 31: Hoare triple {15876#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15877#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:44,580 INFO L273 TraceCheckUtils]: 32: Hoare triple {15877#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15877#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:44,580 INFO L273 TraceCheckUtils]: 33: Hoare triple {15877#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15878#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:44,581 INFO L273 TraceCheckUtils]: 34: Hoare triple {15878#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15878#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:44,581 INFO L273 TraceCheckUtils]: 35: Hoare triple {15878#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15879#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:44,582 INFO L273 TraceCheckUtils]: 36: Hoare triple {15879#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15879#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:44,583 INFO L273 TraceCheckUtils]: 37: Hoare triple {15879#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15880#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:44,583 INFO L273 TraceCheckUtils]: 38: Hoare triple {15880#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15880#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:44,584 INFO L273 TraceCheckUtils]: 39: Hoare triple {15880#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15881#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:44,584 INFO L273 TraceCheckUtils]: 40: Hoare triple {15881#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15881#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:44,585 INFO L273 TraceCheckUtils]: 41: Hoare triple {15881#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15882#(<= main_~i~1 18)} is VALID [2018-11-23 12:26:44,586 INFO L273 TraceCheckUtils]: 42: Hoare triple {15882#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15882#(<= main_~i~1 18)} is VALID [2018-11-23 12:26:44,586 INFO L273 TraceCheckUtils]: 43: Hoare triple {15882#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15883#(<= main_~i~1 19)} is VALID [2018-11-23 12:26:44,587 INFO L273 TraceCheckUtils]: 44: Hoare triple {15883#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15883#(<= main_~i~1 19)} is VALID [2018-11-23 12:26:44,587 INFO L273 TraceCheckUtils]: 45: Hoare triple {15883#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15884#(<= main_~i~1 20)} is VALID [2018-11-23 12:26:44,588 INFO L273 TraceCheckUtils]: 46: Hoare triple {15884#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15884#(<= main_~i~1 20)} is VALID [2018-11-23 12:26:44,589 INFO L273 TraceCheckUtils]: 47: Hoare triple {15884#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15885#(<= main_~i~1 21)} is VALID [2018-11-23 12:26:44,589 INFO L273 TraceCheckUtils]: 48: Hoare triple {15885#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15885#(<= main_~i~1 21)} is VALID [2018-11-23 12:26:44,590 INFO L273 TraceCheckUtils]: 49: Hoare triple {15885#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15886#(<= main_~i~1 22)} is VALID [2018-11-23 12:26:44,591 INFO L273 TraceCheckUtils]: 50: Hoare triple {15886#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15886#(<= main_~i~1 22)} is VALID [2018-11-23 12:26:44,591 INFO L273 TraceCheckUtils]: 51: Hoare triple {15886#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15887#(<= main_~i~1 23)} is VALID [2018-11-23 12:26:44,592 INFO L273 TraceCheckUtils]: 52: Hoare triple {15887#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15887#(<= main_~i~1 23)} is VALID [2018-11-23 12:26:44,593 INFO L273 TraceCheckUtils]: 53: Hoare triple {15887#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15888#(<= main_~i~1 24)} is VALID [2018-11-23 12:26:44,593 INFO L273 TraceCheckUtils]: 54: Hoare triple {15888#(<= main_~i~1 24)} assume !(~i~1 < 100000); {15863#false} is VALID [2018-11-23 12:26:44,593 INFO L256 TraceCheckUtils]: 55: Hoare triple {15863#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {15862#true} is VALID [2018-11-23 12:26:44,594 INFO L273 TraceCheckUtils]: 56: Hoare triple {15862#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {15862#true} is VALID [2018-11-23 12:26:44,594 INFO L273 TraceCheckUtils]: 57: Hoare triple {15862#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:44,594 INFO L273 TraceCheckUtils]: 58: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:44,594 INFO L273 TraceCheckUtils]: 59: Hoare triple {15862#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:44,594 INFO L273 TraceCheckUtils]: 60: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:44,595 INFO L273 TraceCheckUtils]: 61: Hoare triple {15862#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:44,595 INFO L273 TraceCheckUtils]: 62: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:44,595 INFO L273 TraceCheckUtils]: 63: Hoare triple {15862#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:44,595 INFO L273 TraceCheckUtils]: 64: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:44,595 INFO L273 TraceCheckUtils]: 65: Hoare triple {15862#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:44,596 INFO L273 TraceCheckUtils]: 66: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:44,596 INFO L273 TraceCheckUtils]: 67: Hoare triple {15862#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:44,596 INFO L273 TraceCheckUtils]: 68: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:44,596 INFO L273 TraceCheckUtils]: 69: Hoare triple {15862#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:44,596 INFO L273 TraceCheckUtils]: 70: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:44,596 INFO L273 TraceCheckUtils]: 71: Hoare triple {15862#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:44,596 INFO L273 TraceCheckUtils]: 72: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:44,596 INFO L273 TraceCheckUtils]: 73: Hoare triple {15862#true} assume !(~i~0 < 100000); {15862#true} is VALID [2018-11-23 12:26:44,597 INFO L273 TraceCheckUtils]: 74: Hoare triple {15862#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15862#true} is VALID [2018-11-23 12:26:44,597 INFO L273 TraceCheckUtils]: 75: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:26:44,597 INFO L268 TraceCheckUtils]: 76: Hoare quadruple {15862#true} {15863#false} #70#return; {15863#false} is VALID [2018-11-23 12:26:44,597 INFO L273 TraceCheckUtils]: 77: Hoare triple {15863#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {15863#false} is VALID [2018-11-23 12:26:44,597 INFO L256 TraceCheckUtils]: 78: Hoare triple {15863#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {15862#true} is VALID [2018-11-23 12:26:44,597 INFO L273 TraceCheckUtils]: 79: Hoare triple {15862#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {15862#true} is VALID [2018-11-23 12:26:44,597 INFO L273 TraceCheckUtils]: 80: Hoare triple {15862#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:44,597 INFO L273 TraceCheckUtils]: 81: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:44,597 INFO L273 TraceCheckUtils]: 82: Hoare triple {15862#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:44,597 INFO L273 TraceCheckUtils]: 83: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:44,598 INFO L273 TraceCheckUtils]: 84: Hoare triple {15862#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:44,598 INFO L273 TraceCheckUtils]: 85: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:44,598 INFO L273 TraceCheckUtils]: 86: Hoare triple {15862#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:44,598 INFO L273 TraceCheckUtils]: 87: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:44,598 INFO L273 TraceCheckUtils]: 88: Hoare triple {15862#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:44,598 INFO L273 TraceCheckUtils]: 89: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:44,598 INFO L273 TraceCheckUtils]: 90: Hoare triple {15862#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:44,598 INFO L273 TraceCheckUtils]: 91: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:44,598 INFO L273 TraceCheckUtils]: 92: Hoare triple {15862#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:44,599 INFO L273 TraceCheckUtils]: 93: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:44,599 INFO L273 TraceCheckUtils]: 94: Hoare triple {15862#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:44,599 INFO L273 TraceCheckUtils]: 95: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:44,599 INFO L273 TraceCheckUtils]: 96: Hoare triple {15862#true} assume !(~i~0 < 100000); {15862#true} is VALID [2018-11-23 12:26:44,599 INFO L273 TraceCheckUtils]: 97: Hoare triple {15862#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15862#true} is VALID [2018-11-23 12:26:44,599 INFO L273 TraceCheckUtils]: 98: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:26:44,599 INFO L268 TraceCheckUtils]: 99: Hoare quadruple {15862#true} {15863#false} #72#return; {15863#false} is VALID [2018-11-23 12:26:44,599 INFO L273 TraceCheckUtils]: 100: Hoare triple {15863#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {15863#false} is VALID [2018-11-23 12:26:44,599 INFO L273 TraceCheckUtils]: 101: Hoare triple {15863#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {15863#false} is VALID [2018-11-23 12:26:44,599 INFO L273 TraceCheckUtils]: 102: Hoare triple {15863#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {15863#false} is VALID [2018-11-23 12:26:44,600 INFO L273 TraceCheckUtils]: 103: Hoare triple {15863#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {15863#false} is VALID [2018-11-23 12:26:44,600 INFO L273 TraceCheckUtils]: 104: Hoare triple {15863#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {15863#false} is VALID [2018-11-23 12:26:44,600 INFO L273 TraceCheckUtils]: 105: Hoare triple {15863#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {15863#false} is VALID [2018-11-23 12:26:44,600 INFO L273 TraceCheckUtils]: 106: Hoare triple {15863#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {15863#false} is VALID [2018-11-23 12:26:44,600 INFO L273 TraceCheckUtils]: 107: Hoare triple {15863#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {15863#false} is VALID [2018-11-23 12:26:44,600 INFO L273 TraceCheckUtils]: 108: Hoare triple {15863#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {15863#false} is VALID [2018-11-23 12:26:44,600 INFO L273 TraceCheckUtils]: 109: Hoare triple {15863#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {15863#false} is VALID [2018-11-23 12:26:44,600 INFO L273 TraceCheckUtils]: 110: Hoare triple {15863#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {15863#false} is VALID [2018-11-23 12:26:44,600 INFO L273 TraceCheckUtils]: 111: Hoare triple {15863#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {15863#false} is VALID [2018-11-23 12:26:44,601 INFO L273 TraceCheckUtils]: 112: Hoare triple {15863#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {15863#false} is VALID [2018-11-23 12:26:44,601 INFO L273 TraceCheckUtils]: 113: Hoare triple {15863#false} assume !(~i~2 < 99999); {15863#false} is VALID [2018-11-23 12:26:44,601 INFO L273 TraceCheckUtils]: 114: Hoare triple {15863#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {15863#false} is VALID [2018-11-23 12:26:44,601 INFO L256 TraceCheckUtils]: 115: Hoare triple {15863#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {15862#true} is VALID [2018-11-23 12:26:44,601 INFO L273 TraceCheckUtils]: 116: Hoare triple {15862#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {15862#true} is VALID [2018-11-23 12:26:44,601 INFO L273 TraceCheckUtils]: 117: Hoare triple {15862#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:44,601 INFO L273 TraceCheckUtils]: 118: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:44,601 INFO L273 TraceCheckUtils]: 119: Hoare triple {15862#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:44,601 INFO L273 TraceCheckUtils]: 120: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:44,601 INFO L273 TraceCheckUtils]: 121: Hoare triple {15862#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:44,602 INFO L273 TraceCheckUtils]: 122: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:44,602 INFO L273 TraceCheckUtils]: 123: Hoare triple {15862#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:44,602 INFO L273 TraceCheckUtils]: 124: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:44,602 INFO L273 TraceCheckUtils]: 125: Hoare triple {15862#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:44,602 INFO L273 TraceCheckUtils]: 126: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:44,602 INFO L273 TraceCheckUtils]: 127: Hoare triple {15862#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:44,602 INFO L273 TraceCheckUtils]: 128: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:44,602 INFO L273 TraceCheckUtils]: 129: Hoare triple {15862#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:44,602 INFO L273 TraceCheckUtils]: 130: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:44,603 INFO L273 TraceCheckUtils]: 131: Hoare triple {15862#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:44,603 INFO L273 TraceCheckUtils]: 132: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:44,603 INFO L273 TraceCheckUtils]: 133: Hoare triple {15862#true} assume !(~i~0 < 100000); {15862#true} is VALID [2018-11-23 12:26:44,603 INFO L273 TraceCheckUtils]: 134: Hoare triple {15862#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15862#true} is VALID [2018-11-23 12:26:44,603 INFO L273 TraceCheckUtils]: 135: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:26:44,603 INFO L268 TraceCheckUtils]: 136: Hoare quadruple {15862#true} {15863#false} #74#return; {15863#false} is VALID [2018-11-23 12:26:44,603 INFO L273 TraceCheckUtils]: 137: Hoare triple {15863#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {15863#false} is VALID [2018-11-23 12:26:44,603 INFO L273 TraceCheckUtils]: 138: Hoare triple {15863#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {15863#false} is VALID [2018-11-23 12:26:44,603 INFO L273 TraceCheckUtils]: 139: Hoare triple {15863#false} assume !false; {15863#false} is VALID [2018-11-23 12:26:44,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1251 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked. [2018-11-23 12:26:44,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:44,612 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:44,621 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:26:45,215 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2018-11-23 12:26:45,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:45,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:45,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:46,473 INFO L256 TraceCheckUtils]: 0: Hoare triple {15862#true} call ULTIMATE.init(); {15862#true} is VALID [2018-11-23 12:26:46,473 INFO L273 TraceCheckUtils]: 1: Hoare triple {15862#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15862#true} is VALID [2018-11-23 12:26:46,474 INFO L273 TraceCheckUtils]: 2: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:26:46,474 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15862#true} {15862#true} #66#return; {15862#true} is VALID [2018-11-23 12:26:46,474 INFO L256 TraceCheckUtils]: 4: Hoare triple {15862#true} call #t~ret13 := main(); {15862#true} is VALID [2018-11-23 12:26:46,474 INFO L273 TraceCheckUtils]: 5: Hoare triple {15862#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; {15862#true} is VALID [2018-11-23 12:26:46,474 INFO L273 TraceCheckUtils]: 6: Hoare triple {15862#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15862#true} is VALID [2018-11-23 12:26:46,475 INFO L273 TraceCheckUtils]: 7: Hoare triple {15862#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15862#true} is VALID [2018-11-23 12:26:46,475 INFO L273 TraceCheckUtils]: 8: Hoare triple {15862#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15862#true} is VALID [2018-11-23 12:26:46,475 INFO L273 TraceCheckUtils]: 9: Hoare triple {15862#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15862#true} is VALID [2018-11-23 12:26:46,475 INFO L273 TraceCheckUtils]: 10: Hoare triple {15862#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15862#true} is VALID [2018-11-23 12:26:46,475 INFO L273 TraceCheckUtils]: 11: Hoare triple {15862#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15862#true} is VALID [2018-11-23 12:26:46,475 INFO L273 TraceCheckUtils]: 12: Hoare triple {15862#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15862#true} is VALID [2018-11-23 12:26:46,476 INFO L273 TraceCheckUtils]: 13: Hoare triple {15862#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15862#true} is VALID [2018-11-23 12:26:46,476 INFO L273 TraceCheckUtils]: 14: Hoare triple {15862#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15862#true} is VALID [2018-11-23 12:26:46,476 INFO L273 TraceCheckUtils]: 15: Hoare triple {15862#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15862#true} is VALID [2018-11-23 12:26:46,476 INFO L273 TraceCheckUtils]: 16: Hoare triple {15862#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15862#true} is VALID [2018-11-23 12:26:46,476 INFO L273 TraceCheckUtils]: 17: Hoare triple {15862#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15862#true} is VALID [2018-11-23 12:26:46,476 INFO L273 TraceCheckUtils]: 18: Hoare triple {15862#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15862#true} is VALID [2018-11-23 12:26:46,476 INFO L273 TraceCheckUtils]: 19: Hoare triple {15862#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15862#true} is VALID [2018-11-23 12:26:46,476 INFO L273 TraceCheckUtils]: 20: Hoare triple {15862#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15862#true} is VALID [2018-11-23 12:26:46,476 INFO L273 TraceCheckUtils]: 21: Hoare triple {15862#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15862#true} is VALID [2018-11-23 12:26:46,477 INFO L273 TraceCheckUtils]: 22: Hoare triple {15862#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15862#true} is VALID [2018-11-23 12:26:46,477 INFO L273 TraceCheckUtils]: 23: Hoare triple {15862#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15862#true} is VALID [2018-11-23 12:26:46,477 INFO L273 TraceCheckUtils]: 24: Hoare triple {15862#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15862#true} is VALID [2018-11-23 12:26:46,477 INFO L273 TraceCheckUtils]: 25: Hoare triple {15862#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15862#true} is VALID [2018-11-23 12:26:46,477 INFO L273 TraceCheckUtils]: 26: Hoare triple {15862#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15862#true} is VALID [2018-11-23 12:26:46,477 INFO L273 TraceCheckUtils]: 27: Hoare triple {15862#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15862#true} is VALID [2018-11-23 12:26:46,477 INFO L273 TraceCheckUtils]: 28: Hoare triple {15862#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15862#true} is VALID [2018-11-23 12:26:46,477 INFO L273 TraceCheckUtils]: 29: Hoare triple {15862#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15862#true} is VALID [2018-11-23 12:26:46,477 INFO L273 TraceCheckUtils]: 30: Hoare triple {15862#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15862#true} is VALID [2018-11-23 12:26:46,477 INFO L273 TraceCheckUtils]: 31: Hoare triple {15862#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15862#true} is VALID [2018-11-23 12:26:46,478 INFO L273 TraceCheckUtils]: 32: Hoare triple {15862#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15862#true} is VALID [2018-11-23 12:26:46,478 INFO L273 TraceCheckUtils]: 33: Hoare triple {15862#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15862#true} is VALID [2018-11-23 12:26:46,478 INFO L273 TraceCheckUtils]: 34: Hoare triple {15862#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15862#true} is VALID [2018-11-23 12:26:46,478 INFO L273 TraceCheckUtils]: 35: Hoare triple {15862#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15862#true} is VALID [2018-11-23 12:26:46,478 INFO L273 TraceCheckUtils]: 36: Hoare triple {15862#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15862#true} is VALID [2018-11-23 12:26:46,478 INFO L273 TraceCheckUtils]: 37: Hoare triple {15862#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15862#true} is VALID [2018-11-23 12:26:46,478 INFO L273 TraceCheckUtils]: 38: Hoare triple {15862#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15862#true} is VALID [2018-11-23 12:26:46,478 INFO L273 TraceCheckUtils]: 39: Hoare triple {15862#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15862#true} is VALID [2018-11-23 12:26:46,478 INFO L273 TraceCheckUtils]: 40: Hoare triple {15862#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15862#true} is VALID [2018-11-23 12:26:46,479 INFO L273 TraceCheckUtils]: 41: Hoare triple {15862#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15862#true} is VALID [2018-11-23 12:26:46,479 INFO L273 TraceCheckUtils]: 42: Hoare triple {15862#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15862#true} is VALID [2018-11-23 12:26:46,479 INFO L273 TraceCheckUtils]: 43: Hoare triple {15862#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15862#true} is VALID [2018-11-23 12:26:46,479 INFO L273 TraceCheckUtils]: 44: Hoare triple {15862#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15862#true} is VALID [2018-11-23 12:26:46,479 INFO L273 TraceCheckUtils]: 45: Hoare triple {15862#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15862#true} is VALID [2018-11-23 12:26:46,479 INFO L273 TraceCheckUtils]: 46: Hoare triple {15862#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15862#true} is VALID [2018-11-23 12:26:46,479 INFO L273 TraceCheckUtils]: 47: Hoare triple {15862#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15862#true} is VALID [2018-11-23 12:26:46,479 INFO L273 TraceCheckUtils]: 48: Hoare triple {15862#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15862#true} is VALID [2018-11-23 12:26:46,479 INFO L273 TraceCheckUtils]: 49: Hoare triple {15862#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15862#true} is VALID [2018-11-23 12:26:46,479 INFO L273 TraceCheckUtils]: 50: Hoare triple {15862#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15862#true} is VALID [2018-11-23 12:26:46,480 INFO L273 TraceCheckUtils]: 51: Hoare triple {15862#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15862#true} is VALID [2018-11-23 12:26:46,480 INFO L273 TraceCheckUtils]: 52: Hoare triple {15862#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {15862#true} is VALID [2018-11-23 12:26:46,480 INFO L273 TraceCheckUtils]: 53: Hoare triple {15862#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {15862#true} is VALID [2018-11-23 12:26:46,480 INFO L273 TraceCheckUtils]: 54: Hoare triple {15862#true} assume !(~i~1 < 100000); {15862#true} is VALID [2018-11-23 12:26:46,480 INFO L256 TraceCheckUtils]: 55: Hoare triple {15862#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {15862#true} is VALID [2018-11-23 12:26:46,480 INFO L273 TraceCheckUtils]: 56: Hoare triple {15862#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {15862#true} is VALID [2018-11-23 12:26:46,480 INFO L273 TraceCheckUtils]: 57: Hoare triple {15862#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:46,480 INFO L273 TraceCheckUtils]: 58: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:46,480 INFO L273 TraceCheckUtils]: 59: Hoare triple {15862#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:46,481 INFO L273 TraceCheckUtils]: 60: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:46,481 INFO L273 TraceCheckUtils]: 61: Hoare triple {15862#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:46,481 INFO L273 TraceCheckUtils]: 62: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:46,481 INFO L273 TraceCheckUtils]: 63: Hoare triple {15862#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:46,481 INFO L273 TraceCheckUtils]: 64: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:46,481 INFO L273 TraceCheckUtils]: 65: Hoare triple {15862#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:46,481 INFO L273 TraceCheckUtils]: 66: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:46,481 INFO L273 TraceCheckUtils]: 67: Hoare triple {15862#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:46,481 INFO L273 TraceCheckUtils]: 68: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:46,481 INFO L273 TraceCheckUtils]: 69: Hoare triple {15862#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:46,482 INFO L273 TraceCheckUtils]: 70: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:46,482 INFO L273 TraceCheckUtils]: 71: Hoare triple {15862#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:46,482 INFO L273 TraceCheckUtils]: 72: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:46,482 INFO L273 TraceCheckUtils]: 73: Hoare triple {15862#true} assume !(~i~0 < 100000); {15862#true} is VALID [2018-11-23 12:26:46,482 INFO L273 TraceCheckUtils]: 74: Hoare triple {15862#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15862#true} is VALID [2018-11-23 12:26:46,482 INFO L273 TraceCheckUtils]: 75: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:26:46,482 INFO L268 TraceCheckUtils]: 76: Hoare quadruple {15862#true} {15862#true} #70#return; {15862#true} is VALID [2018-11-23 12:26:46,482 INFO L273 TraceCheckUtils]: 77: Hoare triple {15862#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {15862#true} is VALID [2018-11-23 12:26:46,482 INFO L256 TraceCheckUtils]: 78: Hoare triple {15862#true} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {15862#true} is VALID [2018-11-23 12:26:46,482 INFO L273 TraceCheckUtils]: 79: Hoare triple {15862#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {15862#true} is VALID [2018-11-23 12:26:46,483 INFO L273 TraceCheckUtils]: 80: Hoare triple {15862#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:46,483 INFO L273 TraceCheckUtils]: 81: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:46,483 INFO L273 TraceCheckUtils]: 82: Hoare triple {15862#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:46,483 INFO L273 TraceCheckUtils]: 83: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:46,483 INFO L273 TraceCheckUtils]: 84: Hoare triple {15862#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:46,483 INFO L273 TraceCheckUtils]: 85: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:46,483 INFO L273 TraceCheckUtils]: 86: Hoare triple {15862#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:46,483 INFO L273 TraceCheckUtils]: 87: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:46,483 INFO L273 TraceCheckUtils]: 88: Hoare triple {15862#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:46,484 INFO L273 TraceCheckUtils]: 89: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:46,484 INFO L273 TraceCheckUtils]: 90: Hoare triple {15862#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:46,484 INFO L273 TraceCheckUtils]: 91: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:46,484 INFO L273 TraceCheckUtils]: 92: Hoare triple {15862#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:46,484 INFO L273 TraceCheckUtils]: 93: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:46,484 INFO L273 TraceCheckUtils]: 94: Hoare triple {15862#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:26:46,484 INFO L273 TraceCheckUtils]: 95: Hoare triple {15862#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15862#true} is VALID [2018-11-23 12:26:46,484 INFO L273 TraceCheckUtils]: 96: Hoare triple {15862#true} assume !(~i~0 < 100000); {15862#true} is VALID [2018-11-23 12:26:46,484 INFO L273 TraceCheckUtils]: 97: Hoare triple {15862#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15862#true} is VALID [2018-11-23 12:26:46,484 INFO L273 TraceCheckUtils]: 98: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:26:46,485 INFO L268 TraceCheckUtils]: 99: Hoare quadruple {15862#true} {15862#true} #72#return; {15862#true} is VALID [2018-11-23 12:26:46,485 INFO L273 TraceCheckUtils]: 100: Hoare triple {15862#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {16192#(<= main_~i~2 0)} is VALID [2018-11-23 12:26:46,485 INFO L273 TraceCheckUtils]: 101: Hoare triple {16192#(<= main_~i~2 0)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16192#(<= main_~i~2 0)} is VALID [2018-11-23 12:26:46,486 INFO L273 TraceCheckUtils]: 102: Hoare triple {16192#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16199#(<= main_~i~2 1)} is VALID [2018-11-23 12:26:46,486 INFO L273 TraceCheckUtils]: 103: Hoare triple {16199#(<= main_~i~2 1)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16199#(<= main_~i~2 1)} is VALID [2018-11-23 12:26:46,487 INFO L273 TraceCheckUtils]: 104: Hoare triple {16199#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16206#(<= main_~i~2 2)} is VALID [2018-11-23 12:26:46,487 INFO L273 TraceCheckUtils]: 105: Hoare triple {16206#(<= main_~i~2 2)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16206#(<= main_~i~2 2)} is VALID [2018-11-23 12:26:46,487 INFO L273 TraceCheckUtils]: 106: Hoare triple {16206#(<= main_~i~2 2)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16213#(<= main_~i~2 3)} is VALID [2018-11-23 12:26:46,488 INFO L273 TraceCheckUtils]: 107: Hoare triple {16213#(<= main_~i~2 3)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16213#(<= main_~i~2 3)} is VALID [2018-11-23 12:26:46,488 INFO L273 TraceCheckUtils]: 108: Hoare triple {16213#(<= main_~i~2 3)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16220#(<= main_~i~2 4)} is VALID [2018-11-23 12:26:46,488 INFO L273 TraceCheckUtils]: 109: Hoare triple {16220#(<= main_~i~2 4)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16220#(<= main_~i~2 4)} is VALID [2018-11-23 12:26:46,489 INFO L273 TraceCheckUtils]: 110: Hoare triple {16220#(<= main_~i~2 4)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16227#(<= main_~i~2 5)} is VALID [2018-11-23 12:26:46,489 INFO L273 TraceCheckUtils]: 111: Hoare triple {16227#(<= main_~i~2 5)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16227#(<= main_~i~2 5)} is VALID [2018-11-23 12:26:46,489 INFO L273 TraceCheckUtils]: 112: Hoare triple {16227#(<= main_~i~2 5)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16234#(<= main_~i~2 6)} is VALID [2018-11-23 12:26:46,490 INFO L273 TraceCheckUtils]: 113: Hoare triple {16234#(<= main_~i~2 6)} assume !(~i~2 < 99999); {15863#false} is VALID [2018-11-23 12:26:46,490 INFO L273 TraceCheckUtils]: 114: Hoare triple {15863#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {15863#false} is VALID [2018-11-23 12:26:46,490 INFO L256 TraceCheckUtils]: 115: Hoare triple {15863#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {15863#false} is VALID [2018-11-23 12:26:46,490 INFO L273 TraceCheckUtils]: 116: Hoare triple {15863#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {15863#false} is VALID [2018-11-23 12:26:46,491 INFO L273 TraceCheckUtils]: 117: Hoare triple {15863#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15863#false} is VALID [2018-11-23 12:26:46,491 INFO L273 TraceCheckUtils]: 118: Hoare triple {15863#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15863#false} is VALID [2018-11-23 12:26:46,491 INFO L273 TraceCheckUtils]: 119: Hoare triple {15863#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15863#false} is VALID [2018-11-23 12:26:46,491 INFO L273 TraceCheckUtils]: 120: Hoare triple {15863#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15863#false} is VALID [2018-11-23 12:26:46,491 INFO L273 TraceCheckUtils]: 121: Hoare triple {15863#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15863#false} is VALID [2018-11-23 12:26:46,491 INFO L273 TraceCheckUtils]: 122: Hoare triple {15863#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15863#false} is VALID [2018-11-23 12:26:46,492 INFO L273 TraceCheckUtils]: 123: Hoare triple {15863#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15863#false} is VALID [2018-11-23 12:26:46,492 INFO L273 TraceCheckUtils]: 124: Hoare triple {15863#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15863#false} is VALID [2018-11-23 12:26:46,492 INFO L273 TraceCheckUtils]: 125: Hoare triple {15863#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15863#false} is VALID [2018-11-23 12:26:46,492 INFO L273 TraceCheckUtils]: 126: Hoare triple {15863#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15863#false} is VALID [2018-11-23 12:26:46,492 INFO L273 TraceCheckUtils]: 127: Hoare triple {15863#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15863#false} is VALID [2018-11-23 12:26:46,492 INFO L273 TraceCheckUtils]: 128: Hoare triple {15863#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15863#false} is VALID [2018-11-23 12:26:46,493 INFO L273 TraceCheckUtils]: 129: Hoare triple {15863#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15863#false} is VALID [2018-11-23 12:26:46,493 INFO L273 TraceCheckUtils]: 130: Hoare triple {15863#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15863#false} is VALID [2018-11-23 12:26:46,493 INFO L273 TraceCheckUtils]: 131: Hoare triple {15863#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {15863#false} is VALID [2018-11-23 12:26:46,493 INFO L273 TraceCheckUtils]: 132: Hoare triple {15863#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15863#false} is VALID [2018-11-23 12:26:46,493 INFO L273 TraceCheckUtils]: 133: Hoare triple {15863#false} assume !(~i~0 < 100000); {15863#false} is VALID [2018-11-23 12:26:46,493 INFO L273 TraceCheckUtils]: 134: Hoare triple {15863#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15863#false} is VALID [2018-11-23 12:26:46,493 INFO L273 TraceCheckUtils]: 135: Hoare triple {15863#false} assume true; {15863#false} is VALID [2018-11-23 12:26:46,493 INFO L268 TraceCheckUtils]: 136: Hoare quadruple {15863#false} {15863#false} #74#return; {15863#false} is VALID [2018-11-23 12:26:46,493 INFO L273 TraceCheckUtils]: 137: Hoare triple {15863#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {15863#false} is VALID [2018-11-23 12:26:46,494 INFO L273 TraceCheckUtils]: 138: Hoare triple {15863#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {15863#false} is VALID [2018-11-23 12:26:46,494 INFO L273 TraceCheckUtils]: 139: Hoare triple {15863#false} assume !false; {15863#false} is VALID [2018-11-23 12:26:46,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1251 backedges. 298 proven. 36 refuted. 0 times theorem prover too weak. 917 trivial. 0 not checked. [2018-11-23 12:26:46,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:46,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 9] total 34 [2018-11-23 12:26:46,522 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 140 [2018-11-23 12:26:46,522 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:46,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-23 12:26:47,120 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:47,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 12:26:47,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 12:26:47,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=736, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:26:47,121 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand 34 states. [2018-11-23 12:26:48,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:48,224 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2018-11-23 12:26:48,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 12:26:48,224 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 140 [2018-11-23 12:26:48,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:48,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:26:48,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 117 transitions. [2018-11-23 12:26:48,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:26:48,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 117 transitions. [2018-11-23 12:26:48,227 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 117 transitions. [2018-11-23 12:26:48,345 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:48,348 INFO L225 Difference]: With dead ends: 149 [2018-11-23 12:26:48,348 INFO L226 Difference]: Without dead ends: 105 [2018-11-23 12:26:48,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=386, Invalid=736, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:26:48,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-23 12:26:48,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-11-23 12:26:48,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:48,402 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand 103 states. [2018-11-23 12:26:48,402 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 103 states. [2018-11-23 12:26:48,402 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 103 states. [2018-11-23 12:26:48,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:48,405 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2018-11-23 12:26:48,405 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-11-23 12:26:48,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:48,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:48,405 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 105 states. [2018-11-23 12:26:48,406 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 105 states. [2018-11-23 12:26:48,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:48,408 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2018-11-23 12:26:48,408 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-11-23 12:26:48,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:48,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:48,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:48,409 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:48,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-23 12:26:48,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2018-11-23 12:26:48,410 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 140 [2018-11-23 12:26:48,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:48,411 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2018-11-23 12:26:48,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-23 12:26:48,411 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2018-11-23 12:26:48,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-23 12:26:48,412 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:48,412 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:26:48,412 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:48,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:48,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1521279999, now seen corresponding path program 25 times [2018-11-23 12:26:48,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:48,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:48,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:48,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:48,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:48,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:49,317 INFO L256 TraceCheckUtils]: 0: Hoare triple {16899#true} call ULTIMATE.init(); {16899#true} is VALID [2018-11-23 12:26:49,317 INFO L273 TraceCheckUtils]: 1: Hoare triple {16899#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16899#true} is VALID [2018-11-23 12:26:49,317 INFO L273 TraceCheckUtils]: 2: Hoare triple {16899#true} assume true; {16899#true} is VALID [2018-11-23 12:26:49,318 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16899#true} {16899#true} #66#return; {16899#true} is VALID [2018-11-23 12:26:49,318 INFO L256 TraceCheckUtils]: 4: Hoare triple {16899#true} call #t~ret13 := main(); {16899#true} is VALID [2018-11-23 12:26:49,321 INFO L273 TraceCheckUtils]: 5: Hoare triple {16899#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; {16901#(= main_~i~1 0)} is VALID [2018-11-23 12:26:49,322 INFO L273 TraceCheckUtils]: 6: Hoare triple {16901#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16901#(= main_~i~1 0)} is VALID [2018-11-23 12:26:49,322 INFO L273 TraceCheckUtils]: 7: Hoare triple {16901#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16902#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:49,323 INFO L273 TraceCheckUtils]: 8: Hoare triple {16902#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16902#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:49,323 INFO L273 TraceCheckUtils]: 9: Hoare triple {16902#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16903#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:49,323 INFO L273 TraceCheckUtils]: 10: Hoare triple {16903#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16903#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:49,324 INFO L273 TraceCheckUtils]: 11: Hoare triple {16903#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16904#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:49,324 INFO L273 TraceCheckUtils]: 12: Hoare triple {16904#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16904#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:49,325 INFO L273 TraceCheckUtils]: 13: Hoare triple {16904#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16905#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:49,325 INFO L273 TraceCheckUtils]: 14: Hoare triple {16905#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16905#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:49,326 INFO L273 TraceCheckUtils]: 15: Hoare triple {16905#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16906#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:49,326 INFO L273 TraceCheckUtils]: 16: Hoare triple {16906#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16906#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:49,327 INFO L273 TraceCheckUtils]: 17: Hoare triple {16906#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16907#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:49,327 INFO L273 TraceCheckUtils]: 18: Hoare triple {16907#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16907#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:49,328 INFO L273 TraceCheckUtils]: 19: Hoare triple {16907#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16908#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:49,329 INFO L273 TraceCheckUtils]: 20: Hoare triple {16908#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16908#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:49,329 INFO L273 TraceCheckUtils]: 21: Hoare triple {16908#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16909#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:49,330 INFO L273 TraceCheckUtils]: 22: Hoare triple {16909#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16909#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:49,331 INFO L273 TraceCheckUtils]: 23: Hoare triple {16909#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16910#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:49,331 INFO L273 TraceCheckUtils]: 24: Hoare triple {16910#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16910#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:49,332 INFO L273 TraceCheckUtils]: 25: Hoare triple {16910#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16911#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:49,332 INFO L273 TraceCheckUtils]: 26: Hoare triple {16911#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16911#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:49,333 INFO L273 TraceCheckUtils]: 27: Hoare triple {16911#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16912#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:49,334 INFO L273 TraceCheckUtils]: 28: Hoare triple {16912#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16912#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:49,334 INFO L273 TraceCheckUtils]: 29: Hoare triple {16912#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16913#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:49,335 INFO L273 TraceCheckUtils]: 30: Hoare triple {16913#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16913#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:49,335 INFO L273 TraceCheckUtils]: 31: Hoare triple {16913#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16914#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:49,336 INFO L273 TraceCheckUtils]: 32: Hoare triple {16914#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16914#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:49,337 INFO L273 TraceCheckUtils]: 33: Hoare triple {16914#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16915#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:49,337 INFO L273 TraceCheckUtils]: 34: Hoare triple {16915#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16915#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:49,338 INFO L273 TraceCheckUtils]: 35: Hoare triple {16915#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16916#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:49,338 INFO L273 TraceCheckUtils]: 36: Hoare triple {16916#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16916#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:49,339 INFO L273 TraceCheckUtils]: 37: Hoare triple {16916#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16917#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:49,340 INFO L273 TraceCheckUtils]: 38: Hoare triple {16917#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16917#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:49,340 INFO L273 TraceCheckUtils]: 39: Hoare triple {16917#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16918#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:49,341 INFO L273 TraceCheckUtils]: 40: Hoare triple {16918#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16918#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:49,342 INFO L273 TraceCheckUtils]: 41: Hoare triple {16918#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16919#(<= main_~i~1 18)} is VALID [2018-11-23 12:26:49,342 INFO L273 TraceCheckUtils]: 42: Hoare triple {16919#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16919#(<= main_~i~1 18)} is VALID [2018-11-23 12:26:49,343 INFO L273 TraceCheckUtils]: 43: Hoare triple {16919#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16920#(<= main_~i~1 19)} is VALID [2018-11-23 12:26:49,343 INFO L273 TraceCheckUtils]: 44: Hoare triple {16920#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16920#(<= main_~i~1 19)} is VALID [2018-11-23 12:26:49,344 INFO L273 TraceCheckUtils]: 45: Hoare triple {16920#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16921#(<= main_~i~1 20)} is VALID [2018-11-23 12:26:49,345 INFO L273 TraceCheckUtils]: 46: Hoare triple {16921#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16921#(<= main_~i~1 20)} is VALID [2018-11-23 12:26:49,345 INFO L273 TraceCheckUtils]: 47: Hoare triple {16921#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16922#(<= main_~i~1 21)} is VALID [2018-11-23 12:26:49,346 INFO L273 TraceCheckUtils]: 48: Hoare triple {16922#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16922#(<= main_~i~1 21)} is VALID [2018-11-23 12:26:49,347 INFO L273 TraceCheckUtils]: 49: Hoare triple {16922#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16923#(<= main_~i~1 22)} is VALID [2018-11-23 12:26:49,347 INFO L273 TraceCheckUtils]: 50: Hoare triple {16923#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16923#(<= main_~i~1 22)} is VALID [2018-11-23 12:26:49,348 INFO L273 TraceCheckUtils]: 51: Hoare triple {16923#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16924#(<= main_~i~1 23)} is VALID [2018-11-23 12:26:49,348 INFO L273 TraceCheckUtils]: 52: Hoare triple {16924#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16924#(<= main_~i~1 23)} is VALID [2018-11-23 12:26:49,349 INFO L273 TraceCheckUtils]: 53: Hoare triple {16924#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16925#(<= main_~i~1 24)} is VALID [2018-11-23 12:26:49,350 INFO L273 TraceCheckUtils]: 54: Hoare triple {16925#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16925#(<= main_~i~1 24)} is VALID [2018-11-23 12:26:49,350 INFO L273 TraceCheckUtils]: 55: Hoare triple {16925#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16926#(<= main_~i~1 25)} is VALID [2018-11-23 12:26:49,351 INFO L273 TraceCheckUtils]: 56: Hoare triple {16926#(<= main_~i~1 25)} assume !(~i~1 < 100000); {16900#false} is VALID [2018-11-23 12:26:49,351 INFO L256 TraceCheckUtils]: 57: Hoare triple {16900#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {16899#true} is VALID [2018-11-23 12:26:49,351 INFO L273 TraceCheckUtils]: 58: Hoare triple {16899#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {16899#true} is VALID [2018-11-23 12:26:49,352 INFO L273 TraceCheckUtils]: 59: Hoare triple {16899#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:26:49,352 INFO L273 TraceCheckUtils]: 60: Hoare triple {16899#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16899#true} is VALID [2018-11-23 12:26:49,352 INFO L273 TraceCheckUtils]: 61: Hoare triple {16899#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:26:49,352 INFO L273 TraceCheckUtils]: 62: Hoare triple {16899#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16899#true} is VALID [2018-11-23 12:26:49,352 INFO L273 TraceCheckUtils]: 63: Hoare triple {16899#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:26:49,353 INFO L273 TraceCheckUtils]: 64: Hoare triple {16899#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16899#true} is VALID [2018-11-23 12:26:49,353 INFO L273 TraceCheckUtils]: 65: Hoare triple {16899#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:26:49,353 INFO L273 TraceCheckUtils]: 66: Hoare triple {16899#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16899#true} is VALID [2018-11-23 12:26:49,353 INFO L273 TraceCheckUtils]: 67: Hoare triple {16899#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:26:49,353 INFO L273 TraceCheckUtils]: 68: Hoare triple {16899#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16899#true} is VALID [2018-11-23 12:26:49,353 INFO L273 TraceCheckUtils]: 69: Hoare triple {16899#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:26:49,354 INFO L273 TraceCheckUtils]: 70: Hoare triple {16899#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16899#true} is VALID [2018-11-23 12:26:49,354 INFO L273 TraceCheckUtils]: 71: Hoare triple {16899#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:26:49,354 INFO L273 TraceCheckUtils]: 72: Hoare triple {16899#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16899#true} is VALID [2018-11-23 12:26:49,354 INFO L273 TraceCheckUtils]: 73: Hoare triple {16899#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:26:49,354 INFO L273 TraceCheckUtils]: 74: Hoare triple {16899#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16899#true} is VALID [2018-11-23 12:26:49,354 INFO L273 TraceCheckUtils]: 75: Hoare triple {16899#true} assume !(~i~0 < 100000); {16899#true} is VALID [2018-11-23 12:26:49,354 INFO L273 TraceCheckUtils]: 76: Hoare triple {16899#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {16899#true} is VALID [2018-11-23 12:26:49,355 INFO L273 TraceCheckUtils]: 77: Hoare triple {16899#true} assume true; {16899#true} is VALID [2018-11-23 12:26:49,355 INFO L268 TraceCheckUtils]: 78: Hoare quadruple {16899#true} {16900#false} #70#return; {16900#false} is VALID [2018-11-23 12:26:49,355 INFO L273 TraceCheckUtils]: 79: Hoare triple {16900#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {16900#false} is VALID [2018-11-23 12:26:49,355 INFO L256 TraceCheckUtils]: 80: Hoare triple {16900#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {16899#true} is VALID [2018-11-23 12:26:49,355 INFO L273 TraceCheckUtils]: 81: Hoare triple {16899#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {16899#true} is VALID [2018-11-23 12:26:49,355 INFO L273 TraceCheckUtils]: 82: Hoare triple {16899#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:26:49,355 INFO L273 TraceCheckUtils]: 83: Hoare triple {16899#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16899#true} is VALID [2018-11-23 12:26:49,355 INFO L273 TraceCheckUtils]: 84: Hoare triple {16899#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:26:49,355 INFO L273 TraceCheckUtils]: 85: Hoare triple {16899#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16899#true} is VALID [2018-11-23 12:26:49,355 INFO L273 TraceCheckUtils]: 86: Hoare triple {16899#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:26:49,356 INFO L273 TraceCheckUtils]: 87: Hoare triple {16899#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16899#true} is VALID [2018-11-23 12:26:49,356 INFO L273 TraceCheckUtils]: 88: Hoare triple {16899#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:26:49,356 INFO L273 TraceCheckUtils]: 89: Hoare triple {16899#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16899#true} is VALID [2018-11-23 12:26:49,356 INFO L273 TraceCheckUtils]: 90: Hoare triple {16899#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:26:49,356 INFO L273 TraceCheckUtils]: 91: Hoare triple {16899#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16899#true} is VALID [2018-11-23 12:26:49,356 INFO L273 TraceCheckUtils]: 92: Hoare triple {16899#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:26:49,356 INFO L273 TraceCheckUtils]: 93: Hoare triple {16899#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16899#true} is VALID [2018-11-23 12:26:49,356 INFO L273 TraceCheckUtils]: 94: Hoare triple {16899#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:26:49,356 INFO L273 TraceCheckUtils]: 95: Hoare triple {16899#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16899#true} is VALID [2018-11-23 12:26:49,357 INFO L273 TraceCheckUtils]: 96: Hoare triple {16899#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:26:49,357 INFO L273 TraceCheckUtils]: 97: Hoare triple {16899#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16899#true} is VALID [2018-11-23 12:26:49,357 INFO L273 TraceCheckUtils]: 98: Hoare triple {16899#true} assume !(~i~0 < 100000); {16899#true} is VALID [2018-11-23 12:26:49,357 INFO L273 TraceCheckUtils]: 99: Hoare triple {16899#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {16899#true} is VALID [2018-11-23 12:26:49,357 INFO L273 TraceCheckUtils]: 100: Hoare triple {16899#true} assume true; {16899#true} is VALID [2018-11-23 12:26:49,357 INFO L268 TraceCheckUtils]: 101: Hoare quadruple {16899#true} {16900#false} #72#return; {16900#false} is VALID [2018-11-23 12:26:49,357 INFO L273 TraceCheckUtils]: 102: Hoare triple {16900#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {16900#false} is VALID [2018-11-23 12:26:49,357 INFO L273 TraceCheckUtils]: 103: Hoare triple {16900#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16900#false} is VALID [2018-11-23 12:26:49,357 INFO L273 TraceCheckUtils]: 104: Hoare triple {16900#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16900#false} is VALID [2018-11-23 12:26:49,357 INFO L273 TraceCheckUtils]: 105: Hoare triple {16900#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16900#false} is VALID [2018-11-23 12:26:49,358 INFO L273 TraceCheckUtils]: 106: Hoare triple {16900#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16900#false} is VALID [2018-11-23 12:26:49,358 INFO L273 TraceCheckUtils]: 107: Hoare triple {16900#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16900#false} is VALID [2018-11-23 12:26:49,358 INFO L273 TraceCheckUtils]: 108: Hoare triple {16900#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16900#false} is VALID [2018-11-23 12:26:49,358 INFO L273 TraceCheckUtils]: 109: Hoare triple {16900#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16900#false} is VALID [2018-11-23 12:26:49,358 INFO L273 TraceCheckUtils]: 110: Hoare triple {16900#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16900#false} is VALID [2018-11-23 12:26:49,358 INFO L273 TraceCheckUtils]: 111: Hoare triple {16900#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16900#false} is VALID [2018-11-23 12:26:49,358 INFO L273 TraceCheckUtils]: 112: Hoare triple {16900#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16900#false} is VALID [2018-11-23 12:26:49,358 INFO L273 TraceCheckUtils]: 113: Hoare triple {16900#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16900#false} is VALID [2018-11-23 12:26:49,358 INFO L273 TraceCheckUtils]: 114: Hoare triple {16900#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16900#false} is VALID [2018-11-23 12:26:49,359 INFO L273 TraceCheckUtils]: 115: Hoare triple {16900#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16900#false} is VALID [2018-11-23 12:26:49,359 INFO L273 TraceCheckUtils]: 116: Hoare triple {16900#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16900#false} is VALID [2018-11-23 12:26:49,359 INFO L273 TraceCheckUtils]: 117: Hoare triple {16900#false} assume !(~i~2 < 99999); {16900#false} is VALID [2018-11-23 12:26:49,359 INFO L273 TraceCheckUtils]: 118: Hoare triple {16900#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {16900#false} is VALID [2018-11-23 12:26:49,359 INFO L256 TraceCheckUtils]: 119: Hoare triple {16900#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {16899#true} is VALID [2018-11-23 12:26:49,359 INFO L273 TraceCheckUtils]: 120: Hoare triple {16899#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {16899#true} is VALID [2018-11-23 12:26:49,359 INFO L273 TraceCheckUtils]: 121: Hoare triple {16899#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:26:49,359 INFO L273 TraceCheckUtils]: 122: Hoare triple {16899#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16899#true} is VALID [2018-11-23 12:26:49,359 INFO L273 TraceCheckUtils]: 123: Hoare triple {16899#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:26:49,359 INFO L273 TraceCheckUtils]: 124: Hoare triple {16899#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16899#true} is VALID [2018-11-23 12:26:49,360 INFO L273 TraceCheckUtils]: 125: Hoare triple {16899#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:26:49,360 INFO L273 TraceCheckUtils]: 126: Hoare triple {16899#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16899#true} is VALID [2018-11-23 12:26:49,360 INFO L273 TraceCheckUtils]: 127: Hoare triple {16899#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:26:49,360 INFO L273 TraceCheckUtils]: 128: Hoare triple {16899#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16899#true} is VALID [2018-11-23 12:26:49,360 INFO L273 TraceCheckUtils]: 129: Hoare triple {16899#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:26:49,360 INFO L273 TraceCheckUtils]: 130: Hoare triple {16899#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16899#true} is VALID [2018-11-23 12:26:49,360 INFO L273 TraceCheckUtils]: 131: Hoare triple {16899#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:26:49,360 INFO L273 TraceCheckUtils]: 132: Hoare triple {16899#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16899#true} is VALID [2018-11-23 12:26:49,360 INFO L273 TraceCheckUtils]: 133: Hoare triple {16899#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:26:49,361 INFO L273 TraceCheckUtils]: 134: Hoare triple {16899#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16899#true} is VALID [2018-11-23 12:26:49,361 INFO L273 TraceCheckUtils]: 135: Hoare triple {16899#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:26:49,361 INFO L273 TraceCheckUtils]: 136: Hoare triple {16899#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16899#true} is VALID [2018-11-23 12:26:49,361 INFO L273 TraceCheckUtils]: 137: Hoare triple {16899#true} assume !(~i~0 < 100000); {16899#true} is VALID [2018-11-23 12:26:49,361 INFO L273 TraceCheckUtils]: 138: Hoare triple {16899#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {16899#true} is VALID [2018-11-23 12:26:49,361 INFO L273 TraceCheckUtils]: 139: Hoare triple {16899#true} assume true; {16899#true} is VALID [2018-11-23 12:26:49,361 INFO L268 TraceCheckUtils]: 140: Hoare quadruple {16899#true} {16900#false} #74#return; {16900#false} is VALID [2018-11-23 12:26:49,361 INFO L273 TraceCheckUtils]: 141: Hoare triple {16900#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {16900#false} is VALID [2018-11-23 12:26:49,361 INFO L273 TraceCheckUtils]: 142: Hoare triple {16900#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {16900#false} is VALID [2018-11-23 12:26:49,361 INFO L273 TraceCheckUtils]: 143: Hoare triple {16900#false} assume !false; {16900#false} is VALID [2018-11-23 12:26:49,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1313 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2018-11-23 12:26:49,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:49,371 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:49,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:26:49,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:49,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:49,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:49,708 INFO L256 TraceCheckUtils]: 0: Hoare triple {16899#true} call ULTIMATE.init(); {16899#true} is VALID [2018-11-23 12:26:49,708 INFO L273 TraceCheckUtils]: 1: Hoare triple {16899#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16899#true} is VALID [2018-11-23 12:26:49,708 INFO L273 TraceCheckUtils]: 2: Hoare triple {16899#true} assume true; {16899#true} is VALID [2018-11-23 12:26:49,709 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16899#true} {16899#true} #66#return; {16899#true} is VALID [2018-11-23 12:26:49,709 INFO L256 TraceCheckUtils]: 4: Hoare triple {16899#true} call #t~ret13 := main(); {16899#true} is VALID [2018-11-23 12:26:49,710 INFO L273 TraceCheckUtils]: 5: Hoare triple {16899#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; {16945#(<= main_~i~1 0)} is VALID [2018-11-23 12:26:49,710 INFO L273 TraceCheckUtils]: 6: Hoare triple {16945#(<= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16945#(<= main_~i~1 0)} is VALID [2018-11-23 12:26:49,711 INFO L273 TraceCheckUtils]: 7: Hoare triple {16945#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16902#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:49,711 INFO L273 TraceCheckUtils]: 8: Hoare triple {16902#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16902#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:49,712 INFO L273 TraceCheckUtils]: 9: Hoare triple {16902#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16903#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:49,712 INFO L273 TraceCheckUtils]: 10: Hoare triple {16903#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16903#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:49,712 INFO L273 TraceCheckUtils]: 11: Hoare triple {16903#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16904#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:49,713 INFO L273 TraceCheckUtils]: 12: Hoare triple {16904#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16904#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:49,714 INFO L273 TraceCheckUtils]: 13: Hoare triple {16904#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16905#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:49,714 INFO L273 TraceCheckUtils]: 14: Hoare triple {16905#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16905#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:49,715 INFO L273 TraceCheckUtils]: 15: Hoare triple {16905#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16906#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:49,715 INFO L273 TraceCheckUtils]: 16: Hoare triple {16906#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16906#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:49,716 INFO L273 TraceCheckUtils]: 17: Hoare triple {16906#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16907#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:49,717 INFO L273 TraceCheckUtils]: 18: Hoare triple {16907#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16907#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:49,717 INFO L273 TraceCheckUtils]: 19: Hoare triple {16907#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16908#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:49,718 INFO L273 TraceCheckUtils]: 20: Hoare triple {16908#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16908#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:49,718 INFO L273 TraceCheckUtils]: 21: Hoare triple {16908#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16909#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:49,719 INFO L273 TraceCheckUtils]: 22: Hoare triple {16909#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16909#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:49,720 INFO L273 TraceCheckUtils]: 23: Hoare triple {16909#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16910#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:49,720 INFO L273 TraceCheckUtils]: 24: Hoare triple {16910#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16910#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:49,721 INFO L273 TraceCheckUtils]: 25: Hoare triple {16910#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16911#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:49,721 INFO L273 TraceCheckUtils]: 26: Hoare triple {16911#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16911#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:49,722 INFO L273 TraceCheckUtils]: 27: Hoare triple {16911#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16912#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:49,723 INFO L273 TraceCheckUtils]: 28: Hoare triple {16912#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16912#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:49,723 INFO L273 TraceCheckUtils]: 29: Hoare triple {16912#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16913#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:49,724 INFO L273 TraceCheckUtils]: 30: Hoare triple {16913#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16913#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:49,725 INFO L273 TraceCheckUtils]: 31: Hoare triple {16913#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16914#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:49,725 INFO L273 TraceCheckUtils]: 32: Hoare triple {16914#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16914#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:49,726 INFO L273 TraceCheckUtils]: 33: Hoare triple {16914#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16915#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:49,727 INFO L273 TraceCheckUtils]: 34: Hoare triple {16915#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16915#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:49,727 INFO L273 TraceCheckUtils]: 35: Hoare triple {16915#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16916#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:49,728 INFO L273 TraceCheckUtils]: 36: Hoare triple {16916#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16916#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:49,729 INFO L273 TraceCheckUtils]: 37: Hoare triple {16916#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16917#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:49,729 INFO L273 TraceCheckUtils]: 38: Hoare triple {16917#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16917#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:49,730 INFO L273 TraceCheckUtils]: 39: Hoare triple {16917#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16918#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:49,730 INFO L273 TraceCheckUtils]: 40: Hoare triple {16918#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16918#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:49,731 INFO L273 TraceCheckUtils]: 41: Hoare triple {16918#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16919#(<= main_~i~1 18)} is VALID [2018-11-23 12:26:49,732 INFO L273 TraceCheckUtils]: 42: Hoare triple {16919#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16919#(<= main_~i~1 18)} is VALID [2018-11-23 12:26:49,732 INFO L273 TraceCheckUtils]: 43: Hoare triple {16919#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16920#(<= main_~i~1 19)} is VALID [2018-11-23 12:26:49,733 INFO L273 TraceCheckUtils]: 44: Hoare triple {16920#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16920#(<= main_~i~1 19)} is VALID [2018-11-23 12:26:49,734 INFO L273 TraceCheckUtils]: 45: Hoare triple {16920#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16921#(<= main_~i~1 20)} is VALID [2018-11-23 12:26:49,734 INFO L273 TraceCheckUtils]: 46: Hoare triple {16921#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16921#(<= main_~i~1 20)} is VALID [2018-11-23 12:26:49,735 INFO L273 TraceCheckUtils]: 47: Hoare triple {16921#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16922#(<= main_~i~1 21)} is VALID [2018-11-23 12:26:49,735 INFO L273 TraceCheckUtils]: 48: Hoare triple {16922#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16922#(<= main_~i~1 21)} is VALID [2018-11-23 12:26:49,736 INFO L273 TraceCheckUtils]: 49: Hoare triple {16922#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16923#(<= main_~i~1 22)} is VALID [2018-11-23 12:26:49,737 INFO L273 TraceCheckUtils]: 50: Hoare triple {16923#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16923#(<= main_~i~1 22)} is VALID [2018-11-23 12:26:49,737 INFO L273 TraceCheckUtils]: 51: Hoare triple {16923#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16924#(<= main_~i~1 23)} is VALID [2018-11-23 12:26:49,738 INFO L273 TraceCheckUtils]: 52: Hoare triple {16924#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16924#(<= main_~i~1 23)} is VALID [2018-11-23 12:26:49,739 INFO L273 TraceCheckUtils]: 53: Hoare triple {16924#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16925#(<= main_~i~1 24)} is VALID [2018-11-23 12:26:49,739 INFO L273 TraceCheckUtils]: 54: Hoare triple {16925#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {16925#(<= main_~i~1 24)} is VALID [2018-11-23 12:26:49,740 INFO L273 TraceCheckUtils]: 55: Hoare triple {16925#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {16926#(<= main_~i~1 25)} is VALID [2018-11-23 12:26:49,740 INFO L273 TraceCheckUtils]: 56: Hoare triple {16926#(<= main_~i~1 25)} assume !(~i~1 < 100000); {16900#false} is VALID [2018-11-23 12:26:49,741 INFO L256 TraceCheckUtils]: 57: Hoare triple {16900#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {16900#false} is VALID [2018-11-23 12:26:49,741 INFO L273 TraceCheckUtils]: 58: Hoare triple {16900#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {16900#false} is VALID [2018-11-23 12:26:49,741 INFO L273 TraceCheckUtils]: 59: Hoare triple {16900#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:26:49,741 INFO L273 TraceCheckUtils]: 60: Hoare triple {16900#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16900#false} is VALID [2018-11-23 12:26:49,741 INFO L273 TraceCheckUtils]: 61: Hoare triple {16900#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:26:49,742 INFO L273 TraceCheckUtils]: 62: Hoare triple {16900#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16900#false} is VALID [2018-11-23 12:26:49,742 INFO L273 TraceCheckUtils]: 63: Hoare triple {16900#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:26:49,742 INFO L273 TraceCheckUtils]: 64: Hoare triple {16900#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16900#false} is VALID [2018-11-23 12:26:49,742 INFO L273 TraceCheckUtils]: 65: Hoare triple {16900#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:26:49,742 INFO L273 TraceCheckUtils]: 66: Hoare triple {16900#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16900#false} is VALID [2018-11-23 12:26:49,742 INFO L273 TraceCheckUtils]: 67: Hoare triple {16900#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:26:49,743 INFO L273 TraceCheckUtils]: 68: Hoare triple {16900#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16900#false} is VALID [2018-11-23 12:26:49,743 INFO L273 TraceCheckUtils]: 69: Hoare triple {16900#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:26:49,743 INFO L273 TraceCheckUtils]: 70: Hoare triple {16900#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16900#false} is VALID [2018-11-23 12:26:49,743 INFO L273 TraceCheckUtils]: 71: Hoare triple {16900#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:26:49,743 INFO L273 TraceCheckUtils]: 72: Hoare triple {16900#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16900#false} is VALID [2018-11-23 12:26:49,744 INFO L273 TraceCheckUtils]: 73: Hoare triple {16900#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:26:49,744 INFO L273 TraceCheckUtils]: 74: Hoare triple {16900#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16900#false} is VALID [2018-11-23 12:26:49,744 INFO L273 TraceCheckUtils]: 75: Hoare triple {16900#false} assume !(~i~0 < 100000); {16900#false} is VALID [2018-11-23 12:26:49,744 INFO L273 TraceCheckUtils]: 76: Hoare triple {16900#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {16900#false} is VALID [2018-11-23 12:26:49,744 INFO L273 TraceCheckUtils]: 77: Hoare triple {16900#false} assume true; {16900#false} is VALID [2018-11-23 12:26:49,744 INFO L268 TraceCheckUtils]: 78: Hoare quadruple {16900#false} {16900#false} #70#return; {16900#false} is VALID [2018-11-23 12:26:49,745 INFO L273 TraceCheckUtils]: 79: Hoare triple {16900#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {16900#false} is VALID [2018-11-23 12:26:49,745 INFO L256 TraceCheckUtils]: 80: Hoare triple {16900#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {16900#false} is VALID [2018-11-23 12:26:49,745 INFO L273 TraceCheckUtils]: 81: Hoare triple {16900#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {16900#false} is VALID [2018-11-23 12:26:49,745 INFO L273 TraceCheckUtils]: 82: Hoare triple {16900#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:26:49,745 INFO L273 TraceCheckUtils]: 83: Hoare triple {16900#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16900#false} is VALID [2018-11-23 12:26:49,746 INFO L273 TraceCheckUtils]: 84: Hoare triple {16900#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:26:49,746 INFO L273 TraceCheckUtils]: 85: Hoare triple {16900#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16900#false} is VALID [2018-11-23 12:26:49,746 INFO L273 TraceCheckUtils]: 86: Hoare triple {16900#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:26:49,746 INFO L273 TraceCheckUtils]: 87: Hoare triple {16900#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16900#false} is VALID [2018-11-23 12:26:49,746 INFO L273 TraceCheckUtils]: 88: Hoare triple {16900#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:26:49,746 INFO L273 TraceCheckUtils]: 89: Hoare triple {16900#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16900#false} is VALID [2018-11-23 12:26:49,746 INFO L273 TraceCheckUtils]: 90: Hoare triple {16900#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:26:49,746 INFO L273 TraceCheckUtils]: 91: Hoare triple {16900#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16900#false} is VALID [2018-11-23 12:26:49,747 INFO L273 TraceCheckUtils]: 92: Hoare triple {16900#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:26:49,747 INFO L273 TraceCheckUtils]: 93: Hoare triple {16900#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16900#false} is VALID [2018-11-23 12:26:49,747 INFO L273 TraceCheckUtils]: 94: Hoare triple {16900#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:26:49,747 INFO L273 TraceCheckUtils]: 95: Hoare triple {16900#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16900#false} is VALID [2018-11-23 12:26:49,747 INFO L273 TraceCheckUtils]: 96: Hoare triple {16900#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:26:49,747 INFO L273 TraceCheckUtils]: 97: Hoare triple {16900#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16900#false} is VALID [2018-11-23 12:26:49,747 INFO L273 TraceCheckUtils]: 98: Hoare triple {16900#false} assume !(~i~0 < 100000); {16900#false} is VALID [2018-11-23 12:26:49,747 INFO L273 TraceCheckUtils]: 99: Hoare triple {16900#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {16900#false} is VALID [2018-11-23 12:26:49,747 INFO L273 TraceCheckUtils]: 100: Hoare triple {16900#false} assume true; {16900#false} is VALID [2018-11-23 12:26:49,747 INFO L268 TraceCheckUtils]: 101: Hoare quadruple {16900#false} {16900#false} #72#return; {16900#false} is VALID [2018-11-23 12:26:49,748 INFO L273 TraceCheckUtils]: 102: Hoare triple {16900#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {16900#false} is VALID [2018-11-23 12:26:49,748 INFO L273 TraceCheckUtils]: 103: Hoare triple {16900#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16900#false} is VALID [2018-11-23 12:26:49,748 INFO L273 TraceCheckUtils]: 104: Hoare triple {16900#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16900#false} is VALID [2018-11-23 12:26:49,748 INFO L273 TraceCheckUtils]: 105: Hoare triple {16900#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16900#false} is VALID [2018-11-23 12:26:49,748 INFO L273 TraceCheckUtils]: 106: Hoare triple {16900#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16900#false} is VALID [2018-11-23 12:26:49,748 INFO L273 TraceCheckUtils]: 107: Hoare triple {16900#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16900#false} is VALID [2018-11-23 12:26:49,748 INFO L273 TraceCheckUtils]: 108: Hoare triple {16900#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16900#false} is VALID [2018-11-23 12:26:49,748 INFO L273 TraceCheckUtils]: 109: Hoare triple {16900#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16900#false} is VALID [2018-11-23 12:26:49,748 INFO L273 TraceCheckUtils]: 110: Hoare triple {16900#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16900#false} is VALID [2018-11-23 12:26:49,749 INFO L273 TraceCheckUtils]: 111: Hoare triple {16900#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16900#false} is VALID [2018-11-23 12:26:49,749 INFO L273 TraceCheckUtils]: 112: Hoare triple {16900#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16900#false} is VALID [2018-11-23 12:26:49,749 INFO L273 TraceCheckUtils]: 113: Hoare triple {16900#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16900#false} is VALID [2018-11-23 12:26:49,749 INFO L273 TraceCheckUtils]: 114: Hoare triple {16900#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16900#false} is VALID [2018-11-23 12:26:49,749 INFO L273 TraceCheckUtils]: 115: Hoare triple {16900#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {16900#false} is VALID [2018-11-23 12:26:49,749 INFO L273 TraceCheckUtils]: 116: Hoare triple {16900#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {16900#false} is VALID [2018-11-23 12:26:49,749 INFO L273 TraceCheckUtils]: 117: Hoare triple {16900#false} assume !(~i~2 < 99999); {16900#false} is VALID [2018-11-23 12:26:49,749 INFO L273 TraceCheckUtils]: 118: Hoare triple {16900#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {16900#false} is VALID [2018-11-23 12:26:49,749 INFO L256 TraceCheckUtils]: 119: Hoare triple {16900#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {16900#false} is VALID [2018-11-23 12:26:49,749 INFO L273 TraceCheckUtils]: 120: Hoare triple {16900#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {16900#false} is VALID [2018-11-23 12:26:49,750 INFO L273 TraceCheckUtils]: 121: Hoare triple {16900#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:26:49,750 INFO L273 TraceCheckUtils]: 122: Hoare triple {16900#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16900#false} is VALID [2018-11-23 12:26:49,750 INFO L273 TraceCheckUtils]: 123: Hoare triple {16900#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:26:49,750 INFO L273 TraceCheckUtils]: 124: Hoare triple {16900#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16900#false} is VALID [2018-11-23 12:26:49,750 INFO L273 TraceCheckUtils]: 125: Hoare triple {16900#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:26:49,750 INFO L273 TraceCheckUtils]: 126: Hoare triple {16900#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16900#false} is VALID [2018-11-23 12:26:49,750 INFO L273 TraceCheckUtils]: 127: Hoare triple {16900#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:26:49,750 INFO L273 TraceCheckUtils]: 128: Hoare triple {16900#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16900#false} is VALID [2018-11-23 12:26:49,750 INFO L273 TraceCheckUtils]: 129: Hoare triple {16900#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:26:49,751 INFO L273 TraceCheckUtils]: 130: Hoare triple {16900#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16900#false} is VALID [2018-11-23 12:26:49,751 INFO L273 TraceCheckUtils]: 131: Hoare triple {16900#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:26:49,751 INFO L273 TraceCheckUtils]: 132: Hoare triple {16900#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16900#false} is VALID [2018-11-23 12:26:49,751 INFO L273 TraceCheckUtils]: 133: Hoare triple {16900#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:26:49,751 INFO L273 TraceCheckUtils]: 134: Hoare triple {16900#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16900#false} is VALID [2018-11-23 12:26:49,751 INFO L273 TraceCheckUtils]: 135: Hoare triple {16900#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:26:49,751 INFO L273 TraceCheckUtils]: 136: Hoare triple {16900#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16900#false} is VALID [2018-11-23 12:26:49,751 INFO L273 TraceCheckUtils]: 137: Hoare triple {16900#false} assume !(~i~0 < 100000); {16900#false} is VALID [2018-11-23 12:26:49,751 INFO L273 TraceCheckUtils]: 138: Hoare triple {16900#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {16900#false} is VALID [2018-11-23 12:26:49,751 INFO L273 TraceCheckUtils]: 139: Hoare triple {16900#false} assume true; {16900#false} is VALID [2018-11-23 12:26:49,752 INFO L268 TraceCheckUtils]: 140: Hoare quadruple {16900#false} {16900#false} #74#return; {16900#false} is VALID [2018-11-23 12:26:49,752 INFO L273 TraceCheckUtils]: 141: Hoare triple {16900#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {16900#false} is VALID [2018-11-23 12:26:49,752 INFO L273 TraceCheckUtils]: 142: Hoare triple {16900#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {16900#false} is VALID [2018-11-23 12:26:49,752 INFO L273 TraceCheckUtils]: 143: Hoare triple {16900#false} assume !false; {16900#false} is VALID [2018-11-23 12:26:49,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1313 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2018-11-23 12:26:49,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:49,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-11-23 12:26:49,781 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 144 [2018-11-23 12:26:49,782 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:49,782 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 12:26:49,870 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:49,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 12:26:49,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 12:26:49,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 12:26:49,872 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand 29 states. [2018-11-23 12:26:50,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:50,636 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2018-11-23 12:26:50,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 12:26:50,636 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 144 [2018-11-23 12:26:50,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:50,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:26:50,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 104 transitions. [2018-11-23 12:26:50,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:26:50,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 104 transitions. [2018-11-23 12:26:50,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 104 transitions. [2018-11-23 12:26:50,751 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:50,754 INFO L225 Difference]: With dead ends: 152 [2018-11-23 12:26:50,754 INFO L226 Difference]: Without dead ends: 106 [2018-11-23 12:26:50,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 12:26:50,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-23 12:26:50,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-11-23 12:26:50,801 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:50,801 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 105 states. [2018-11-23 12:26:50,801 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 105 states. [2018-11-23 12:26:50,802 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 105 states. [2018-11-23 12:26:50,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:50,804 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2018-11-23 12:26:50,804 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2018-11-23 12:26:50,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:50,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:50,805 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 106 states. [2018-11-23 12:26:50,805 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 106 states. [2018-11-23 12:26:50,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:50,807 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2018-11-23 12:26:50,807 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2018-11-23 12:26:50,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:50,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:50,808 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:50,808 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:50,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-23 12:26:50,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2018-11-23 12:26:50,810 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 144 [2018-11-23 12:26:50,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:50,811 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2018-11-23 12:26:50,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 12:26:50,811 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-11-23 12:26:50,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-23 12:26:50,812 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:50,813 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 24, 24, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:26:50,813 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:50,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:50,813 INFO L82 PathProgramCache]: Analyzing trace with hash -559946655, now seen corresponding path program 26 times [2018-11-23 12:26:50,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:50,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:50,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:50,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:26:50,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:50,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:51,464 INFO L256 TraceCheckUtils]: 0: Hoare triple {17953#true} call ULTIMATE.init(); {17953#true} is VALID [2018-11-23 12:26:51,464 INFO L273 TraceCheckUtils]: 1: Hoare triple {17953#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17953#true} is VALID [2018-11-23 12:26:51,465 INFO L273 TraceCheckUtils]: 2: Hoare triple {17953#true} assume true; {17953#true} is VALID [2018-11-23 12:26:51,465 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17953#true} {17953#true} #66#return; {17953#true} is VALID [2018-11-23 12:26:51,465 INFO L256 TraceCheckUtils]: 4: Hoare triple {17953#true} call #t~ret13 := main(); {17953#true} is VALID [2018-11-23 12:26:51,465 INFO L273 TraceCheckUtils]: 5: Hoare triple {17953#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; {17955#(= main_~i~1 0)} is VALID [2018-11-23 12:26:51,465 INFO L273 TraceCheckUtils]: 6: Hoare triple {17955#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17955#(= main_~i~1 0)} is VALID [2018-11-23 12:26:51,466 INFO L273 TraceCheckUtils]: 7: Hoare triple {17955#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17956#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:51,466 INFO L273 TraceCheckUtils]: 8: Hoare triple {17956#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17956#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:51,467 INFO L273 TraceCheckUtils]: 9: Hoare triple {17956#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17957#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:51,468 INFO L273 TraceCheckUtils]: 10: Hoare triple {17957#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17957#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:51,468 INFO L273 TraceCheckUtils]: 11: Hoare triple {17957#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17958#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:51,469 INFO L273 TraceCheckUtils]: 12: Hoare triple {17958#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17958#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:51,470 INFO L273 TraceCheckUtils]: 13: Hoare triple {17958#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17959#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:51,470 INFO L273 TraceCheckUtils]: 14: Hoare triple {17959#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17959#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:51,471 INFO L273 TraceCheckUtils]: 15: Hoare triple {17959#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17960#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:51,471 INFO L273 TraceCheckUtils]: 16: Hoare triple {17960#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17960#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:51,472 INFO L273 TraceCheckUtils]: 17: Hoare triple {17960#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17961#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:51,472 INFO L273 TraceCheckUtils]: 18: Hoare triple {17961#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17961#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:51,473 INFO L273 TraceCheckUtils]: 19: Hoare triple {17961#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17962#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:51,474 INFO L273 TraceCheckUtils]: 20: Hoare triple {17962#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17962#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:51,474 INFO L273 TraceCheckUtils]: 21: Hoare triple {17962#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17963#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:51,475 INFO L273 TraceCheckUtils]: 22: Hoare triple {17963#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17963#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:51,476 INFO L273 TraceCheckUtils]: 23: Hoare triple {17963#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17964#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:51,476 INFO L273 TraceCheckUtils]: 24: Hoare triple {17964#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17964#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:51,477 INFO L273 TraceCheckUtils]: 25: Hoare triple {17964#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17965#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:51,477 INFO L273 TraceCheckUtils]: 26: Hoare triple {17965#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17965#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:51,478 INFO L273 TraceCheckUtils]: 27: Hoare triple {17965#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17966#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:51,479 INFO L273 TraceCheckUtils]: 28: Hoare triple {17966#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17966#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:51,479 INFO L273 TraceCheckUtils]: 29: Hoare triple {17966#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17967#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:51,480 INFO L273 TraceCheckUtils]: 30: Hoare triple {17967#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17967#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:51,480 INFO L273 TraceCheckUtils]: 31: Hoare triple {17967#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17968#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:51,481 INFO L273 TraceCheckUtils]: 32: Hoare triple {17968#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17968#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:51,482 INFO L273 TraceCheckUtils]: 33: Hoare triple {17968#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17969#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:51,482 INFO L273 TraceCheckUtils]: 34: Hoare triple {17969#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17969#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:51,483 INFO L273 TraceCheckUtils]: 35: Hoare triple {17969#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17970#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:51,483 INFO L273 TraceCheckUtils]: 36: Hoare triple {17970#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17970#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:51,484 INFO L273 TraceCheckUtils]: 37: Hoare triple {17970#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17971#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:51,485 INFO L273 TraceCheckUtils]: 38: Hoare triple {17971#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17971#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:51,485 INFO L273 TraceCheckUtils]: 39: Hoare triple {17971#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17972#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:51,486 INFO L273 TraceCheckUtils]: 40: Hoare triple {17972#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17972#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:51,487 INFO L273 TraceCheckUtils]: 41: Hoare triple {17972#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17973#(<= main_~i~1 18)} is VALID [2018-11-23 12:26:51,487 INFO L273 TraceCheckUtils]: 42: Hoare triple {17973#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17973#(<= main_~i~1 18)} is VALID [2018-11-23 12:26:51,488 INFO L273 TraceCheckUtils]: 43: Hoare triple {17973#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17974#(<= main_~i~1 19)} is VALID [2018-11-23 12:26:51,488 INFO L273 TraceCheckUtils]: 44: Hoare triple {17974#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17974#(<= main_~i~1 19)} is VALID [2018-11-23 12:26:51,489 INFO L273 TraceCheckUtils]: 45: Hoare triple {17974#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17975#(<= main_~i~1 20)} is VALID [2018-11-23 12:26:51,490 INFO L273 TraceCheckUtils]: 46: Hoare triple {17975#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17975#(<= main_~i~1 20)} is VALID [2018-11-23 12:26:51,490 INFO L273 TraceCheckUtils]: 47: Hoare triple {17975#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17976#(<= main_~i~1 21)} is VALID [2018-11-23 12:26:51,491 INFO L273 TraceCheckUtils]: 48: Hoare triple {17976#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17976#(<= main_~i~1 21)} is VALID [2018-11-23 12:26:51,492 INFO L273 TraceCheckUtils]: 49: Hoare triple {17976#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17977#(<= main_~i~1 22)} is VALID [2018-11-23 12:26:51,492 INFO L273 TraceCheckUtils]: 50: Hoare triple {17977#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17977#(<= main_~i~1 22)} is VALID [2018-11-23 12:26:51,493 INFO L273 TraceCheckUtils]: 51: Hoare triple {17977#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17978#(<= main_~i~1 23)} is VALID [2018-11-23 12:26:51,493 INFO L273 TraceCheckUtils]: 52: Hoare triple {17978#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17978#(<= main_~i~1 23)} is VALID [2018-11-23 12:26:51,494 INFO L273 TraceCheckUtils]: 53: Hoare triple {17978#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17979#(<= main_~i~1 24)} is VALID [2018-11-23 12:26:51,494 INFO L273 TraceCheckUtils]: 54: Hoare triple {17979#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17979#(<= main_~i~1 24)} is VALID [2018-11-23 12:26:51,495 INFO L273 TraceCheckUtils]: 55: Hoare triple {17979#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17980#(<= main_~i~1 25)} is VALID [2018-11-23 12:26:51,496 INFO L273 TraceCheckUtils]: 56: Hoare triple {17980#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17980#(<= main_~i~1 25)} is VALID [2018-11-23 12:26:51,496 INFO L273 TraceCheckUtils]: 57: Hoare triple {17980#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17981#(<= main_~i~1 26)} is VALID [2018-11-23 12:26:51,497 INFO L273 TraceCheckUtils]: 58: Hoare triple {17981#(<= main_~i~1 26)} assume !(~i~1 < 100000); {17954#false} is VALID [2018-11-23 12:26:51,497 INFO L256 TraceCheckUtils]: 59: Hoare triple {17954#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {17953#true} is VALID [2018-11-23 12:26:51,497 INFO L273 TraceCheckUtils]: 60: Hoare triple {17953#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {17953#true} is VALID [2018-11-23 12:26:51,497 INFO L273 TraceCheckUtils]: 61: Hoare triple {17953#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:26:51,498 INFO L273 TraceCheckUtils]: 62: Hoare triple {17953#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17953#true} is VALID [2018-11-23 12:26:51,498 INFO L273 TraceCheckUtils]: 63: Hoare triple {17953#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:26:51,498 INFO L273 TraceCheckUtils]: 64: Hoare triple {17953#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17953#true} is VALID [2018-11-23 12:26:51,498 INFO L273 TraceCheckUtils]: 65: Hoare triple {17953#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:26:51,498 INFO L273 TraceCheckUtils]: 66: Hoare triple {17953#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17953#true} is VALID [2018-11-23 12:26:51,498 INFO L273 TraceCheckUtils]: 67: Hoare triple {17953#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:26:51,499 INFO L273 TraceCheckUtils]: 68: Hoare triple {17953#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17953#true} is VALID [2018-11-23 12:26:51,499 INFO L273 TraceCheckUtils]: 69: Hoare triple {17953#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:26:51,499 INFO L273 TraceCheckUtils]: 70: Hoare triple {17953#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17953#true} is VALID [2018-11-23 12:26:51,499 INFO L273 TraceCheckUtils]: 71: Hoare triple {17953#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:26:51,499 INFO L273 TraceCheckUtils]: 72: Hoare triple {17953#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17953#true} is VALID [2018-11-23 12:26:51,500 INFO L273 TraceCheckUtils]: 73: Hoare triple {17953#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:26:51,500 INFO L273 TraceCheckUtils]: 74: Hoare triple {17953#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17953#true} is VALID [2018-11-23 12:26:51,500 INFO L273 TraceCheckUtils]: 75: Hoare triple {17953#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:26:51,500 INFO L273 TraceCheckUtils]: 76: Hoare triple {17953#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17953#true} is VALID [2018-11-23 12:26:51,500 INFO L273 TraceCheckUtils]: 77: Hoare triple {17953#true} assume !(~i~0 < 100000); {17953#true} is VALID [2018-11-23 12:26:51,501 INFO L273 TraceCheckUtils]: 78: Hoare triple {17953#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {17953#true} is VALID [2018-11-23 12:26:51,501 INFO L273 TraceCheckUtils]: 79: Hoare triple {17953#true} assume true; {17953#true} is VALID [2018-11-23 12:26:51,501 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {17953#true} {17954#false} #70#return; {17954#false} is VALID [2018-11-23 12:26:51,501 INFO L273 TraceCheckUtils]: 81: Hoare triple {17954#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {17954#false} is VALID [2018-11-23 12:26:51,501 INFO L256 TraceCheckUtils]: 82: Hoare triple {17954#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {17953#true} is VALID [2018-11-23 12:26:51,501 INFO L273 TraceCheckUtils]: 83: Hoare triple {17953#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {17953#true} is VALID [2018-11-23 12:26:51,502 INFO L273 TraceCheckUtils]: 84: Hoare triple {17953#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:26:51,502 INFO L273 TraceCheckUtils]: 85: Hoare triple {17953#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17953#true} is VALID [2018-11-23 12:26:51,502 INFO L273 TraceCheckUtils]: 86: Hoare triple {17953#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:26:51,502 INFO L273 TraceCheckUtils]: 87: Hoare triple {17953#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17953#true} is VALID [2018-11-23 12:26:51,502 INFO L273 TraceCheckUtils]: 88: Hoare triple {17953#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:26:51,503 INFO L273 TraceCheckUtils]: 89: Hoare triple {17953#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17953#true} is VALID [2018-11-23 12:26:51,503 INFO L273 TraceCheckUtils]: 90: Hoare triple {17953#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:26:51,503 INFO L273 TraceCheckUtils]: 91: Hoare triple {17953#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17953#true} is VALID [2018-11-23 12:26:51,503 INFO L273 TraceCheckUtils]: 92: Hoare triple {17953#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:26:51,503 INFO L273 TraceCheckUtils]: 93: Hoare triple {17953#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17953#true} is VALID [2018-11-23 12:26:51,503 INFO L273 TraceCheckUtils]: 94: Hoare triple {17953#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:26:51,503 INFO L273 TraceCheckUtils]: 95: Hoare triple {17953#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17953#true} is VALID [2018-11-23 12:26:51,503 INFO L273 TraceCheckUtils]: 96: Hoare triple {17953#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:26:51,504 INFO L273 TraceCheckUtils]: 97: Hoare triple {17953#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17953#true} is VALID [2018-11-23 12:26:51,504 INFO L273 TraceCheckUtils]: 98: Hoare triple {17953#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:26:51,504 INFO L273 TraceCheckUtils]: 99: Hoare triple {17953#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17953#true} is VALID [2018-11-23 12:26:51,504 INFO L273 TraceCheckUtils]: 100: Hoare triple {17953#true} assume !(~i~0 < 100000); {17953#true} is VALID [2018-11-23 12:26:51,504 INFO L273 TraceCheckUtils]: 101: Hoare triple {17953#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {17953#true} is VALID [2018-11-23 12:26:51,504 INFO L273 TraceCheckUtils]: 102: Hoare triple {17953#true} assume true; {17953#true} is VALID [2018-11-23 12:26:51,504 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {17953#true} {17954#false} #72#return; {17954#false} is VALID [2018-11-23 12:26:51,504 INFO L273 TraceCheckUtils]: 104: Hoare triple {17954#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {17954#false} is VALID [2018-11-23 12:26:51,504 INFO L273 TraceCheckUtils]: 105: Hoare triple {17954#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17954#false} is VALID [2018-11-23 12:26:51,505 INFO L273 TraceCheckUtils]: 106: Hoare triple {17954#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17954#false} is VALID [2018-11-23 12:26:51,505 INFO L273 TraceCheckUtils]: 107: Hoare triple {17954#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17954#false} is VALID [2018-11-23 12:26:51,505 INFO L273 TraceCheckUtils]: 108: Hoare triple {17954#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17954#false} is VALID [2018-11-23 12:26:51,505 INFO L273 TraceCheckUtils]: 109: Hoare triple {17954#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17954#false} is VALID [2018-11-23 12:26:51,505 INFO L273 TraceCheckUtils]: 110: Hoare triple {17954#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17954#false} is VALID [2018-11-23 12:26:51,505 INFO L273 TraceCheckUtils]: 111: Hoare triple {17954#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17954#false} is VALID [2018-11-23 12:26:51,505 INFO L273 TraceCheckUtils]: 112: Hoare triple {17954#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17954#false} is VALID [2018-11-23 12:26:51,505 INFO L273 TraceCheckUtils]: 113: Hoare triple {17954#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17954#false} is VALID [2018-11-23 12:26:51,505 INFO L273 TraceCheckUtils]: 114: Hoare triple {17954#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17954#false} is VALID [2018-11-23 12:26:51,505 INFO L273 TraceCheckUtils]: 115: Hoare triple {17954#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17954#false} is VALID [2018-11-23 12:26:51,506 INFO L273 TraceCheckUtils]: 116: Hoare triple {17954#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17954#false} is VALID [2018-11-23 12:26:51,506 INFO L273 TraceCheckUtils]: 117: Hoare triple {17954#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17954#false} is VALID [2018-11-23 12:26:51,506 INFO L273 TraceCheckUtils]: 118: Hoare triple {17954#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17954#false} is VALID [2018-11-23 12:26:51,506 INFO L273 TraceCheckUtils]: 119: Hoare triple {17954#false} assume !(~i~2 < 99999); {17954#false} is VALID [2018-11-23 12:26:51,506 INFO L273 TraceCheckUtils]: 120: Hoare triple {17954#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {17954#false} is VALID [2018-11-23 12:26:51,506 INFO L256 TraceCheckUtils]: 121: Hoare triple {17954#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {17953#true} is VALID [2018-11-23 12:26:51,506 INFO L273 TraceCheckUtils]: 122: Hoare triple {17953#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {17953#true} is VALID [2018-11-23 12:26:51,506 INFO L273 TraceCheckUtils]: 123: Hoare triple {17953#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:26:51,506 INFO L273 TraceCheckUtils]: 124: Hoare triple {17953#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17953#true} is VALID [2018-11-23 12:26:51,507 INFO L273 TraceCheckUtils]: 125: Hoare triple {17953#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:26:51,507 INFO L273 TraceCheckUtils]: 126: Hoare triple {17953#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17953#true} is VALID [2018-11-23 12:26:51,507 INFO L273 TraceCheckUtils]: 127: Hoare triple {17953#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:26:51,507 INFO L273 TraceCheckUtils]: 128: Hoare triple {17953#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17953#true} is VALID [2018-11-23 12:26:51,507 INFO L273 TraceCheckUtils]: 129: Hoare triple {17953#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:26:51,507 INFO L273 TraceCheckUtils]: 130: Hoare triple {17953#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17953#true} is VALID [2018-11-23 12:26:51,507 INFO L273 TraceCheckUtils]: 131: Hoare triple {17953#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:26:51,507 INFO L273 TraceCheckUtils]: 132: Hoare triple {17953#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17953#true} is VALID [2018-11-23 12:26:51,507 INFO L273 TraceCheckUtils]: 133: Hoare triple {17953#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:26:51,507 INFO L273 TraceCheckUtils]: 134: Hoare triple {17953#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17953#true} is VALID [2018-11-23 12:26:51,508 INFO L273 TraceCheckUtils]: 135: Hoare triple {17953#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:26:51,508 INFO L273 TraceCheckUtils]: 136: Hoare triple {17953#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17953#true} is VALID [2018-11-23 12:26:51,508 INFO L273 TraceCheckUtils]: 137: Hoare triple {17953#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:26:51,508 INFO L273 TraceCheckUtils]: 138: Hoare triple {17953#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17953#true} is VALID [2018-11-23 12:26:51,508 INFO L273 TraceCheckUtils]: 139: Hoare triple {17953#true} assume !(~i~0 < 100000); {17953#true} is VALID [2018-11-23 12:26:51,508 INFO L273 TraceCheckUtils]: 140: Hoare triple {17953#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {17953#true} is VALID [2018-11-23 12:26:51,508 INFO L273 TraceCheckUtils]: 141: Hoare triple {17953#true} assume true; {17953#true} is VALID [2018-11-23 12:26:51,508 INFO L268 TraceCheckUtils]: 142: Hoare quadruple {17953#true} {17954#false} #74#return; {17954#false} is VALID [2018-11-23 12:26:51,508 INFO L273 TraceCheckUtils]: 143: Hoare triple {17954#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {17954#false} is VALID [2018-11-23 12:26:51,509 INFO L273 TraceCheckUtils]: 144: Hoare triple {17954#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {17954#false} is VALID [2018-11-23 12:26:51,509 INFO L273 TraceCheckUtils]: 145: Hoare triple {17954#false} assume !false; {17954#false} is VALID [2018-11-23 12:26:51,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1364 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2018-11-23 12:26:51,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:51,519 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:51,528 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:26:51,592 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:26:51,592 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:51,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:51,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:51,871 INFO L256 TraceCheckUtils]: 0: Hoare triple {17953#true} call ULTIMATE.init(); {17953#true} is VALID [2018-11-23 12:26:51,871 INFO L273 TraceCheckUtils]: 1: Hoare triple {17953#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17953#true} is VALID [2018-11-23 12:26:51,871 INFO L273 TraceCheckUtils]: 2: Hoare triple {17953#true} assume true; {17953#true} is VALID [2018-11-23 12:26:51,872 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17953#true} {17953#true} #66#return; {17953#true} is VALID [2018-11-23 12:26:51,872 INFO L256 TraceCheckUtils]: 4: Hoare triple {17953#true} call #t~ret13 := main(); {17953#true} is VALID [2018-11-23 12:26:51,873 INFO L273 TraceCheckUtils]: 5: Hoare triple {17953#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; {18000#(<= main_~i~1 0)} is VALID [2018-11-23 12:26:51,873 INFO L273 TraceCheckUtils]: 6: Hoare triple {18000#(<= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {18000#(<= main_~i~1 0)} is VALID [2018-11-23 12:26:51,874 INFO L273 TraceCheckUtils]: 7: Hoare triple {18000#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17956#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:51,874 INFO L273 TraceCheckUtils]: 8: Hoare triple {17956#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17956#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:51,877 INFO L273 TraceCheckUtils]: 9: Hoare triple {17956#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17957#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:51,877 INFO L273 TraceCheckUtils]: 10: Hoare triple {17957#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17957#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:51,879 INFO L273 TraceCheckUtils]: 11: Hoare triple {17957#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17958#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:51,883 INFO L273 TraceCheckUtils]: 12: Hoare triple {17958#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17958#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:51,884 INFO L273 TraceCheckUtils]: 13: Hoare triple {17958#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17959#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:51,886 INFO L273 TraceCheckUtils]: 14: Hoare triple {17959#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17959#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:51,886 INFO L273 TraceCheckUtils]: 15: Hoare triple {17959#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17960#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:51,888 INFO L273 TraceCheckUtils]: 16: Hoare triple {17960#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17960#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:51,888 INFO L273 TraceCheckUtils]: 17: Hoare triple {17960#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17961#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:51,889 INFO L273 TraceCheckUtils]: 18: Hoare triple {17961#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17961#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:51,894 INFO L273 TraceCheckUtils]: 19: Hoare triple {17961#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17962#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:51,897 INFO L273 TraceCheckUtils]: 20: Hoare triple {17962#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17962#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:51,897 INFO L273 TraceCheckUtils]: 21: Hoare triple {17962#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17963#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:51,899 INFO L273 TraceCheckUtils]: 22: Hoare triple {17963#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17963#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:51,899 INFO L273 TraceCheckUtils]: 23: Hoare triple {17963#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17964#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:51,901 INFO L273 TraceCheckUtils]: 24: Hoare triple {17964#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17964#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:51,901 INFO L273 TraceCheckUtils]: 25: Hoare triple {17964#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17965#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:51,903 INFO L273 TraceCheckUtils]: 26: Hoare triple {17965#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17965#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:51,906 INFO L273 TraceCheckUtils]: 27: Hoare triple {17965#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17966#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:51,908 INFO L273 TraceCheckUtils]: 28: Hoare triple {17966#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17966#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:51,908 INFO L273 TraceCheckUtils]: 29: Hoare triple {17966#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17967#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:51,910 INFO L273 TraceCheckUtils]: 30: Hoare triple {17967#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17967#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:51,910 INFO L273 TraceCheckUtils]: 31: Hoare triple {17967#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17968#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:51,917 INFO L273 TraceCheckUtils]: 32: Hoare triple {17968#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17968#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:51,919 INFO L273 TraceCheckUtils]: 33: Hoare triple {17968#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17969#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:51,919 INFO L273 TraceCheckUtils]: 34: Hoare triple {17969#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17969#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:51,922 INFO L273 TraceCheckUtils]: 35: Hoare triple {17969#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17970#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:51,922 INFO L273 TraceCheckUtils]: 36: Hoare triple {17970#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17970#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:51,925 INFO L273 TraceCheckUtils]: 37: Hoare triple {17970#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17971#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:51,925 INFO L273 TraceCheckUtils]: 38: Hoare triple {17971#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17971#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:51,928 INFO L273 TraceCheckUtils]: 39: Hoare triple {17971#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17972#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:51,928 INFO L273 TraceCheckUtils]: 40: Hoare triple {17972#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17972#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:51,931 INFO L273 TraceCheckUtils]: 41: Hoare triple {17972#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17973#(<= main_~i~1 18)} is VALID [2018-11-23 12:26:51,931 INFO L273 TraceCheckUtils]: 42: Hoare triple {17973#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17973#(<= main_~i~1 18)} is VALID [2018-11-23 12:26:51,934 INFO L273 TraceCheckUtils]: 43: Hoare triple {17973#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17974#(<= main_~i~1 19)} is VALID [2018-11-23 12:26:51,934 INFO L273 TraceCheckUtils]: 44: Hoare triple {17974#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17974#(<= main_~i~1 19)} is VALID [2018-11-23 12:26:51,936 INFO L273 TraceCheckUtils]: 45: Hoare triple {17974#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17975#(<= main_~i~1 20)} is VALID [2018-11-23 12:26:51,936 INFO L273 TraceCheckUtils]: 46: Hoare triple {17975#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17975#(<= main_~i~1 20)} is VALID [2018-11-23 12:26:51,939 INFO L273 TraceCheckUtils]: 47: Hoare triple {17975#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17976#(<= main_~i~1 21)} is VALID [2018-11-23 12:26:51,939 INFO L273 TraceCheckUtils]: 48: Hoare triple {17976#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17976#(<= main_~i~1 21)} is VALID [2018-11-23 12:26:51,942 INFO L273 TraceCheckUtils]: 49: Hoare triple {17976#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17977#(<= main_~i~1 22)} is VALID [2018-11-23 12:26:51,942 INFO L273 TraceCheckUtils]: 50: Hoare triple {17977#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17977#(<= main_~i~1 22)} is VALID [2018-11-23 12:26:51,944 INFO L273 TraceCheckUtils]: 51: Hoare triple {17977#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17978#(<= main_~i~1 23)} is VALID [2018-11-23 12:26:51,944 INFO L273 TraceCheckUtils]: 52: Hoare triple {17978#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17978#(<= main_~i~1 23)} is VALID [2018-11-23 12:26:51,947 INFO L273 TraceCheckUtils]: 53: Hoare triple {17978#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17979#(<= main_~i~1 24)} is VALID [2018-11-23 12:26:51,947 INFO L273 TraceCheckUtils]: 54: Hoare triple {17979#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17979#(<= main_~i~1 24)} is VALID [2018-11-23 12:26:51,949 INFO L273 TraceCheckUtils]: 55: Hoare triple {17979#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17980#(<= main_~i~1 25)} is VALID [2018-11-23 12:26:51,949 INFO L273 TraceCheckUtils]: 56: Hoare triple {17980#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {17980#(<= main_~i~1 25)} is VALID [2018-11-23 12:26:51,951 INFO L273 TraceCheckUtils]: 57: Hoare triple {17980#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {17981#(<= main_~i~1 26)} is VALID [2018-11-23 12:26:51,951 INFO L273 TraceCheckUtils]: 58: Hoare triple {17981#(<= main_~i~1 26)} assume !(~i~1 < 100000); {17954#false} is VALID [2018-11-23 12:26:51,951 INFO L256 TraceCheckUtils]: 59: Hoare triple {17954#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {17954#false} is VALID [2018-11-23 12:26:51,951 INFO L273 TraceCheckUtils]: 60: Hoare triple {17954#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {17954#false} is VALID [2018-11-23 12:26:51,951 INFO L273 TraceCheckUtils]: 61: Hoare triple {17954#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:26:51,952 INFO L273 TraceCheckUtils]: 62: Hoare triple {17954#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17954#false} is VALID [2018-11-23 12:26:51,952 INFO L273 TraceCheckUtils]: 63: Hoare triple {17954#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:26:51,952 INFO L273 TraceCheckUtils]: 64: Hoare triple {17954#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17954#false} is VALID [2018-11-23 12:26:51,952 INFO L273 TraceCheckUtils]: 65: Hoare triple {17954#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:26:51,952 INFO L273 TraceCheckUtils]: 66: Hoare triple {17954#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17954#false} is VALID [2018-11-23 12:26:51,952 INFO L273 TraceCheckUtils]: 67: Hoare triple {17954#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:26:51,952 INFO L273 TraceCheckUtils]: 68: Hoare triple {17954#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17954#false} is VALID [2018-11-23 12:26:51,952 INFO L273 TraceCheckUtils]: 69: Hoare triple {17954#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:26:51,952 INFO L273 TraceCheckUtils]: 70: Hoare triple {17954#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17954#false} is VALID [2018-11-23 12:26:51,952 INFO L273 TraceCheckUtils]: 71: Hoare triple {17954#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:26:51,953 INFO L273 TraceCheckUtils]: 72: Hoare triple {17954#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17954#false} is VALID [2018-11-23 12:26:51,953 INFO L273 TraceCheckUtils]: 73: Hoare triple {17954#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:26:51,953 INFO L273 TraceCheckUtils]: 74: Hoare triple {17954#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17954#false} is VALID [2018-11-23 12:26:51,953 INFO L273 TraceCheckUtils]: 75: Hoare triple {17954#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:26:51,953 INFO L273 TraceCheckUtils]: 76: Hoare triple {17954#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17954#false} is VALID [2018-11-23 12:26:51,953 INFO L273 TraceCheckUtils]: 77: Hoare triple {17954#false} assume !(~i~0 < 100000); {17954#false} is VALID [2018-11-23 12:26:51,953 INFO L273 TraceCheckUtils]: 78: Hoare triple {17954#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {17954#false} is VALID [2018-11-23 12:26:51,953 INFO L273 TraceCheckUtils]: 79: Hoare triple {17954#false} assume true; {17954#false} is VALID [2018-11-23 12:26:51,953 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {17954#false} {17954#false} #70#return; {17954#false} is VALID [2018-11-23 12:26:51,954 INFO L273 TraceCheckUtils]: 81: Hoare triple {17954#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {17954#false} is VALID [2018-11-23 12:26:51,954 INFO L256 TraceCheckUtils]: 82: Hoare triple {17954#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {17954#false} is VALID [2018-11-23 12:26:51,954 INFO L273 TraceCheckUtils]: 83: Hoare triple {17954#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {17954#false} is VALID [2018-11-23 12:26:51,954 INFO L273 TraceCheckUtils]: 84: Hoare triple {17954#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:26:51,954 INFO L273 TraceCheckUtils]: 85: Hoare triple {17954#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17954#false} is VALID [2018-11-23 12:26:51,954 INFO L273 TraceCheckUtils]: 86: Hoare triple {17954#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:26:51,954 INFO L273 TraceCheckUtils]: 87: Hoare triple {17954#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17954#false} is VALID [2018-11-23 12:26:51,954 INFO L273 TraceCheckUtils]: 88: Hoare triple {17954#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:26:51,954 INFO L273 TraceCheckUtils]: 89: Hoare triple {17954#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17954#false} is VALID [2018-11-23 12:26:51,954 INFO L273 TraceCheckUtils]: 90: Hoare triple {17954#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:26:51,955 INFO L273 TraceCheckUtils]: 91: Hoare triple {17954#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17954#false} is VALID [2018-11-23 12:26:51,955 INFO L273 TraceCheckUtils]: 92: Hoare triple {17954#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:26:51,955 INFO L273 TraceCheckUtils]: 93: Hoare triple {17954#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17954#false} is VALID [2018-11-23 12:26:51,955 INFO L273 TraceCheckUtils]: 94: Hoare triple {17954#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:26:51,955 INFO L273 TraceCheckUtils]: 95: Hoare triple {17954#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17954#false} is VALID [2018-11-23 12:26:51,955 INFO L273 TraceCheckUtils]: 96: Hoare triple {17954#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:26:51,955 INFO L273 TraceCheckUtils]: 97: Hoare triple {17954#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17954#false} is VALID [2018-11-23 12:26:51,955 INFO L273 TraceCheckUtils]: 98: Hoare triple {17954#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:26:51,955 INFO L273 TraceCheckUtils]: 99: Hoare triple {17954#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17954#false} is VALID [2018-11-23 12:26:51,955 INFO L273 TraceCheckUtils]: 100: Hoare triple {17954#false} assume !(~i~0 < 100000); {17954#false} is VALID [2018-11-23 12:26:51,956 INFO L273 TraceCheckUtils]: 101: Hoare triple {17954#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {17954#false} is VALID [2018-11-23 12:26:51,956 INFO L273 TraceCheckUtils]: 102: Hoare triple {17954#false} assume true; {17954#false} is VALID [2018-11-23 12:26:51,956 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {17954#false} {17954#false} #72#return; {17954#false} is VALID [2018-11-23 12:26:51,956 INFO L273 TraceCheckUtils]: 104: Hoare triple {17954#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {17954#false} is VALID [2018-11-23 12:26:51,956 INFO L273 TraceCheckUtils]: 105: Hoare triple {17954#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17954#false} is VALID [2018-11-23 12:26:51,956 INFO L273 TraceCheckUtils]: 106: Hoare triple {17954#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17954#false} is VALID [2018-11-23 12:26:51,956 INFO L273 TraceCheckUtils]: 107: Hoare triple {17954#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17954#false} is VALID [2018-11-23 12:26:51,956 INFO L273 TraceCheckUtils]: 108: Hoare triple {17954#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17954#false} is VALID [2018-11-23 12:26:51,956 INFO L273 TraceCheckUtils]: 109: Hoare triple {17954#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17954#false} is VALID [2018-11-23 12:26:51,957 INFO L273 TraceCheckUtils]: 110: Hoare triple {17954#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17954#false} is VALID [2018-11-23 12:26:51,957 INFO L273 TraceCheckUtils]: 111: Hoare triple {17954#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17954#false} is VALID [2018-11-23 12:26:51,957 INFO L273 TraceCheckUtils]: 112: Hoare triple {17954#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17954#false} is VALID [2018-11-23 12:26:51,957 INFO L273 TraceCheckUtils]: 113: Hoare triple {17954#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17954#false} is VALID [2018-11-23 12:26:51,957 INFO L273 TraceCheckUtils]: 114: Hoare triple {17954#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17954#false} is VALID [2018-11-23 12:26:51,957 INFO L273 TraceCheckUtils]: 115: Hoare triple {17954#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17954#false} is VALID [2018-11-23 12:26:51,957 INFO L273 TraceCheckUtils]: 116: Hoare triple {17954#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17954#false} is VALID [2018-11-23 12:26:51,957 INFO L273 TraceCheckUtils]: 117: Hoare triple {17954#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {17954#false} is VALID [2018-11-23 12:26:51,957 INFO L273 TraceCheckUtils]: 118: Hoare triple {17954#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {17954#false} is VALID [2018-11-23 12:26:51,957 INFO L273 TraceCheckUtils]: 119: Hoare triple {17954#false} assume !(~i~2 < 99999); {17954#false} is VALID [2018-11-23 12:26:51,958 INFO L273 TraceCheckUtils]: 120: Hoare triple {17954#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {17954#false} is VALID [2018-11-23 12:26:51,958 INFO L256 TraceCheckUtils]: 121: Hoare triple {17954#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {17954#false} is VALID [2018-11-23 12:26:51,958 INFO L273 TraceCheckUtils]: 122: Hoare triple {17954#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {17954#false} is VALID [2018-11-23 12:26:51,958 INFO L273 TraceCheckUtils]: 123: Hoare triple {17954#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:26:51,958 INFO L273 TraceCheckUtils]: 124: Hoare triple {17954#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17954#false} is VALID [2018-11-23 12:26:51,958 INFO L273 TraceCheckUtils]: 125: Hoare triple {17954#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:26:51,958 INFO L273 TraceCheckUtils]: 126: Hoare triple {17954#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17954#false} is VALID [2018-11-23 12:26:51,958 INFO L273 TraceCheckUtils]: 127: Hoare triple {17954#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:26:51,958 INFO L273 TraceCheckUtils]: 128: Hoare triple {17954#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17954#false} is VALID [2018-11-23 12:26:51,958 INFO L273 TraceCheckUtils]: 129: Hoare triple {17954#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:26:51,959 INFO L273 TraceCheckUtils]: 130: Hoare triple {17954#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17954#false} is VALID [2018-11-23 12:26:51,959 INFO L273 TraceCheckUtils]: 131: Hoare triple {17954#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:26:51,959 INFO L273 TraceCheckUtils]: 132: Hoare triple {17954#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17954#false} is VALID [2018-11-23 12:26:51,959 INFO L273 TraceCheckUtils]: 133: Hoare triple {17954#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:26:51,959 INFO L273 TraceCheckUtils]: 134: Hoare triple {17954#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17954#false} is VALID [2018-11-23 12:26:51,959 INFO L273 TraceCheckUtils]: 135: Hoare triple {17954#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:26:51,959 INFO L273 TraceCheckUtils]: 136: Hoare triple {17954#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17954#false} is VALID [2018-11-23 12:26:51,959 INFO L273 TraceCheckUtils]: 137: Hoare triple {17954#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:26:51,959 INFO L273 TraceCheckUtils]: 138: Hoare triple {17954#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17954#false} is VALID [2018-11-23 12:26:51,960 INFO L273 TraceCheckUtils]: 139: Hoare triple {17954#false} assume !(~i~0 < 100000); {17954#false} is VALID [2018-11-23 12:26:51,960 INFO L273 TraceCheckUtils]: 140: Hoare triple {17954#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {17954#false} is VALID [2018-11-23 12:26:51,960 INFO L273 TraceCheckUtils]: 141: Hoare triple {17954#false} assume true; {17954#false} is VALID [2018-11-23 12:26:51,960 INFO L268 TraceCheckUtils]: 142: Hoare quadruple {17954#false} {17954#false} #74#return; {17954#false} is VALID [2018-11-23 12:26:51,960 INFO L273 TraceCheckUtils]: 143: Hoare triple {17954#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {17954#false} is VALID [2018-11-23 12:26:51,960 INFO L273 TraceCheckUtils]: 144: Hoare triple {17954#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {17954#false} is VALID [2018-11-23 12:26:51,960 INFO L273 TraceCheckUtils]: 145: Hoare triple {17954#false} assume !false; {17954#false} is VALID [2018-11-23 12:26:51,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1364 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2018-11-23 12:26:51,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:51,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-11-23 12:26:51,990 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 146 [2018-11-23 12:26:51,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:51,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 12:26:52,137 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:52,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 12:26:52,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 12:26:52,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:26:52,138 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand 30 states. [2018-11-23 12:26:52,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:52,932 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2018-11-23 12:26:52,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 12:26:52,932 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 146 [2018-11-23 12:26:52,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:52,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:26:52,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 106 transitions. [2018-11-23 12:26:52,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:26:52,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 106 transitions. [2018-11-23 12:26:52,935 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 106 transitions. [2018-11-23 12:26:53,100 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:53,102 INFO L225 Difference]: With dead ends: 154 [2018-11-23 12:26:53,102 INFO L226 Difference]: Without dead ends: 108 [2018-11-23 12:26:53,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:26:53,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-23 12:26:53,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2018-11-23 12:26:53,154 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:53,154 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand 107 states. [2018-11-23 12:26:53,154 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 107 states. [2018-11-23 12:26:53,154 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 107 states. [2018-11-23 12:26:53,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:53,156 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2018-11-23 12:26:53,157 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2018-11-23 12:26:53,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:53,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:53,157 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 108 states. [2018-11-23 12:26:53,157 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 108 states. [2018-11-23 12:26:53,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:53,159 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2018-11-23 12:26:53,159 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2018-11-23 12:26:53,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:53,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:53,159 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:53,159 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:53,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-23 12:26:53,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2018-11-23 12:26:53,161 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 146 [2018-11-23 12:26:53,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:53,162 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2018-11-23 12:26:53,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 12:26:53,162 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2018-11-23 12:26:53,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-23 12:26:53,163 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:53,163 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 24, 24, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:26:53,163 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:53,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:53,164 INFO L82 PathProgramCache]: Analyzing trace with hash 835998787, now seen corresponding path program 27 times [2018-11-23 12:26:53,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:53,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:53,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:53,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:53,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:53,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:53,749 INFO L256 TraceCheckUtils]: 0: Hoare triple {19024#true} call ULTIMATE.init(); {19024#true} is VALID [2018-11-23 12:26:53,750 INFO L273 TraceCheckUtils]: 1: Hoare triple {19024#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19024#true} is VALID [2018-11-23 12:26:53,750 INFO L273 TraceCheckUtils]: 2: Hoare triple {19024#true} assume true; {19024#true} is VALID [2018-11-23 12:26:53,750 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19024#true} {19024#true} #66#return; {19024#true} is VALID [2018-11-23 12:26:53,750 INFO L256 TraceCheckUtils]: 4: Hoare triple {19024#true} call #t~ret13 := main(); {19024#true} is VALID [2018-11-23 12:26:53,751 INFO L273 TraceCheckUtils]: 5: Hoare triple {19024#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; {19026#(= main_~i~1 0)} is VALID [2018-11-23 12:26:53,751 INFO L273 TraceCheckUtils]: 6: Hoare triple {19026#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19026#(= main_~i~1 0)} is VALID [2018-11-23 12:26:53,752 INFO L273 TraceCheckUtils]: 7: Hoare triple {19026#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19027#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:53,752 INFO L273 TraceCheckUtils]: 8: Hoare triple {19027#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19027#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:53,753 INFO L273 TraceCheckUtils]: 9: Hoare triple {19027#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19028#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:53,753 INFO L273 TraceCheckUtils]: 10: Hoare triple {19028#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19028#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:53,753 INFO L273 TraceCheckUtils]: 11: Hoare triple {19028#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19029#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:53,754 INFO L273 TraceCheckUtils]: 12: Hoare triple {19029#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19029#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:53,754 INFO L273 TraceCheckUtils]: 13: Hoare triple {19029#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19030#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:53,754 INFO L273 TraceCheckUtils]: 14: Hoare triple {19030#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19030#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:53,755 INFO L273 TraceCheckUtils]: 15: Hoare triple {19030#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19031#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:53,756 INFO L273 TraceCheckUtils]: 16: Hoare triple {19031#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19031#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:53,756 INFO L273 TraceCheckUtils]: 17: Hoare triple {19031#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19032#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:53,757 INFO L273 TraceCheckUtils]: 18: Hoare triple {19032#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19032#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:53,758 INFO L273 TraceCheckUtils]: 19: Hoare triple {19032#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19033#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:53,758 INFO L273 TraceCheckUtils]: 20: Hoare triple {19033#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19033#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:53,759 INFO L273 TraceCheckUtils]: 21: Hoare triple {19033#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19034#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:53,759 INFO L273 TraceCheckUtils]: 22: Hoare triple {19034#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19034#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:53,760 INFO L273 TraceCheckUtils]: 23: Hoare triple {19034#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19035#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:53,761 INFO L273 TraceCheckUtils]: 24: Hoare triple {19035#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19035#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:53,762 INFO L273 TraceCheckUtils]: 25: Hoare triple {19035#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19036#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:53,762 INFO L273 TraceCheckUtils]: 26: Hoare triple {19036#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19036#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:53,763 INFO L273 TraceCheckUtils]: 27: Hoare triple {19036#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19037#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:53,763 INFO L273 TraceCheckUtils]: 28: Hoare triple {19037#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19037#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:53,764 INFO L273 TraceCheckUtils]: 29: Hoare triple {19037#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19038#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:53,765 INFO L273 TraceCheckUtils]: 30: Hoare triple {19038#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19038#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:53,765 INFO L273 TraceCheckUtils]: 31: Hoare triple {19038#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19039#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:53,766 INFO L273 TraceCheckUtils]: 32: Hoare triple {19039#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19039#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:53,767 INFO L273 TraceCheckUtils]: 33: Hoare triple {19039#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19040#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:53,767 INFO L273 TraceCheckUtils]: 34: Hoare triple {19040#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19040#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:53,768 INFO L273 TraceCheckUtils]: 35: Hoare triple {19040#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19041#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:53,768 INFO L273 TraceCheckUtils]: 36: Hoare triple {19041#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19041#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:53,769 INFO L273 TraceCheckUtils]: 37: Hoare triple {19041#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19042#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:53,770 INFO L273 TraceCheckUtils]: 38: Hoare triple {19042#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19042#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:53,770 INFO L273 TraceCheckUtils]: 39: Hoare triple {19042#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19043#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:53,771 INFO L273 TraceCheckUtils]: 40: Hoare triple {19043#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19043#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:53,772 INFO L273 TraceCheckUtils]: 41: Hoare triple {19043#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19044#(<= main_~i~1 18)} is VALID [2018-11-23 12:26:53,772 INFO L273 TraceCheckUtils]: 42: Hoare triple {19044#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19044#(<= main_~i~1 18)} is VALID [2018-11-23 12:26:53,773 INFO L273 TraceCheckUtils]: 43: Hoare triple {19044#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19045#(<= main_~i~1 19)} is VALID [2018-11-23 12:26:53,774 INFO L273 TraceCheckUtils]: 44: Hoare triple {19045#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19045#(<= main_~i~1 19)} is VALID [2018-11-23 12:26:53,774 INFO L273 TraceCheckUtils]: 45: Hoare triple {19045#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19046#(<= main_~i~1 20)} is VALID [2018-11-23 12:26:53,775 INFO L273 TraceCheckUtils]: 46: Hoare triple {19046#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19046#(<= main_~i~1 20)} is VALID [2018-11-23 12:26:53,776 INFO L273 TraceCheckUtils]: 47: Hoare triple {19046#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19047#(<= main_~i~1 21)} is VALID [2018-11-23 12:26:53,776 INFO L273 TraceCheckUtils]: 48: Hoare triple {19047#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19047#(<= main_~i~1 21)} is VALID [2018-11-23 12:26:53,777 INFO L273 TraceCheckUtils]: 49: Hoare triple {19047#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19048#(<= main_~i~1 22)} is VALID [2018-11-23 12:26:53,777 INFO L273 TraceCheckUtils]: 50: Hoare triple {19048#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19048#(<= main_~i~1 22)} is VALID [2018-11-23 12:26:53,778 INFO L273 TraceCheckUtils]: 51: Hoare triple {19048#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19049#(<= main_~i~1 23)} is VALID [2018-11-23 12:26:53,779 INFO L273 TraceCheckUtils]: 52: Hoare triple {19049#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19049#(<= main_~i~1 23)} is VALID [2018-11-23 12:26:53,779 INFO L273 TraceCheckUtils]: 53: Hoare triple {19049#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19050#(<= main_~i~1 24)} is VALID [2018-11-23 12:26:53,780 INFO L273 TraceCheckUtils]: 54: Hoare triple {19050#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19050#(<= main_~i~1 24)} is VALID [2018-11-23 12:26:53,781 INFO L273 TraceCheckUtils]: 55: Hoare triple {19050#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19051#(<= main_~i~1 25)} is VALID [2018-11-23 12:26:53,781 INFO L273 TraceCheckUtils]: 56: Hoare triple {19051#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19051#(<= main_~i~1 25)} is VALID [2018-11-23 12:26:53,782 INFO L273 TraceCheckUtils]: 57: Hoare triple {19051#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19052#(<= main_~i~1 26)} is VALID [2018-11-23 12:26:53,782 INFO L273 TraceCheckUtils]: 58: Hoare triple {19052#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19052#(<= main_~i~1 26)} is VALID [2018-11-23 12:26:53,783 INFO L273 TraceCheckUtils]: 59: Hoare triple {19052#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19053#(<= main_~i~1 27)} is VALID [2018-11-23 12:26:53,784 INFO L273 TraceCheckUtils]: 60: Hoare triple {19053#(<= main_~i~1 27)} assume !(~i~1 < 100000); {19025#false} is VALID [2018-11-23 12:26:53,784 INFO L256 TraceCheckUtils]: 61: Hoare triple {19025#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {19024#true} is VALID [2018-11-23 12:26:53,784 INFO L273 TraceCheckUtils]: 62: Hoare triple {19024#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {19024#true} is VALID [2018-11-23 12:26:53,784 INFO L273 TraceCheckUtils]: 63: Hoare triple {19024#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:26:53,785 INFO L273 TraceCheckUtils]: 64: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:26:53,785 INFO L273 TraceCheckUtils]: 65: Hoare triple {19024#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:26:53,785 INFO L273 TraceCheckUtils]: 66: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:26:53,785 INFO L273 TraceCheckUtils]: 67: Hoare triple {19024#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:26:53,785 INFO L273 TraceCheckUtils]: 68: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:26:53,785 INFO L273 TraceCheckUtils]: 69: Hoare triple {19024#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:26:53,786 INFO L273 TraceCheckUtils]: 70: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:26:53,786 INFO L273 TraceCheckUtils]: 71: Hoare triple {19024#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:26:53,786 INFO L273 TraceCheckUtils]: 72: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:26:53,786 INFO L273 TraceCheckUtils]: 73: Hoare triple {19024#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:26:53,786 INFO L273 TraceCheckUtils]: 74: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:26:53,786 INFO L273 TraceCheckUtils]: 75: Hoare triple {19024#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:26:53,787 INFO L273 TraceCheckUtils]: 76: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:26:53,787 INFO L273 TraceCheckUtils]: 77: Hoare triple {19024#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:26:53,787 INFO L273 TraceCheckUtils]: 78: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:26:53,787 INFO L273 TraceCheckUtils]: 79: Hoare triple {19024#true} assume !(~i~0 < 100000); {19024#true} is VALID [2018-11-23 12:26:53,787 INFO L273 TraceCheckUtils]: 80: Hoare triple {19024#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {19024#true} is VALID [2018-11-23 12:26:53,787 INFO L273 TraceCheckUtils]: 81: Hoare triple {19024#true} assume true; {19024#true} is VALID [2018-11-23 12:26:53,787 INFO L268 TraceCheckUtils]: 82: Hoare quadruple {19024#true} {19025#false} #70#return; {19025#false} is VALID [2018-11-23 12:26:53,787 INFO L273 TraceCheckUtils]: 83: Hoare triple {19025#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {19025#false} is VALID [2018-11-23 12:26:53,787 INFO L256 TraceCheckUtils]: 84: Hoare triple {19025#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {19024#true} is VALID [2018-11-23 12:26:53,788 INFO L273 TraceCheckUtils]: 85: Hoare triple {19024#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {19024#true} is VALID [2018-11-23 12:26:53,788 INFO L273 TraceCheckUtils]: 86: Hoare triple {19024#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:26:53,788 INFO L273 TraceCheckUtils]: 87: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:26:53,788 INFO L273 TraceCheckUtils]: 88: Hoare triple {19024#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:26:53,788 INFO L273 TraceCheckUtils]: 89: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:26:53,788 INFO L273 TraceCheckUtils]: 90: Hoare triple {19024#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:26:53,788 INFO L273 TraceCheckUtils]: 91: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:26:53,788 INFO L273 TraceCheckUtils]: 92: Hoare triple {19024#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:26:53,788 INFO L273 TraceCheckUtils]: 93: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:26:53,788 INFO L273 TraceCheckUtils]: 94: Hoare triple {19024#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:26:53,789 INFO L273 TraceCheckUtils]: 95: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:26:53,789 INFO L273 TraceCheckUtils]: 96: Hoare triple {19024#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:26:53,789 INFO L273 TraceCheckUtils]: 97: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:26:53,789 INFO L273 TraceCheckUtils]: 98: Hoare triple {19024#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:26:53,789 INFO L273 TraceCheckUtils]: 99: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:26:53,789 INFO L273 TraceCheckUtils]: 100: Hoare triple {19024#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:26:53,789 INFO L273 TraceCheckUtils]: 101: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:26:53,789 INFO L273 TraceCheckUtils]: 102: Hoare triple {19024#true} assume !(~i~0 < 100000); {19024#true} is VALID [2018-11-23 12:26:53,789 INFO L273 TraceCheckUtils]: 103: Hoare triple {19024#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {19024#true} is VALID [2018-11-23 12:26:53,790 INFO L273 TraceCheckUtils]: 104: Hoare triple {19024#true} assume true; {19024#true} is VALID [2018-11-23 12:26:53,790 INFO L268 TraceCheckUtils]: 105: Hoare quadruple {19024#true} {19025#false} #72#return; {19025#false} is VALID [2018-11-23 12:26:53,790 INFO L273 TraceCheckUtils]: 106: Hoare triple {19025#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {19025#false} is VALID [2018-11-23 12:26:53,790 INFO L273 TraceCheckUtils]: 107: Hoare triple {19025#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19025#false} is VALID [2018-11-23 12:26:53,790 INFO L273 TraceCheckUtils]: 108: Hoare triple {19025#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19025#false} is VALID [2018-11-23 12:26:53,790 INFO L273 TraceCheckUtils]: 109: Hoare triple {19025#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19025#false} is VALID [2018-11-23 12:26:53,790 INFO L273 TraceCheckUtils]: 110: Hoare triple {19025#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19025#false} is VALID [2018-11-23 12:26:53,790 INFO L273 TraceCheckUtils]: 111: Hoare triple {19025#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19025#false} is VALID [2018-11-23 12:26:53,790 INFO L273 TraceCheckUtils]: 112: Hoare triple {19025#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19025#false} is VALID [2018-11-23 12:26:53,791 INFO L273 TraceCheckUtils]: 113: Hoare triple {19025#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19025#false} is VALID [2018-11-23 12:26:53,791 INFO L273 TraceCheckUtils]: 114: Hoare triple {19025#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19025#false} is VALID [2018-11-23 12:26:53,791 INFO L273 TraceCheckUtils]: 115: Hoare triple {19025#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19025#false} is VALID [2018-11-23 12:26:53,791 INFO L273 TraceCheckUtils]: 116: Hoare triple {19025#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19025#false} is VALID [2018-11-23 12:26:53,791 INFO L273 TraceCheckUtils]: 117: Hoare triple {19025#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19025#false} is VALID [2018-11-23 12:26:53,791 INFO L273 TraceCheckUtils]: 118: Hoare triple {19025#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19025#false} is VALID [2018-11-23 12:26:53,791 INFO L273 TraceCheckUtils]: 119: Hoare triple {19025#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19025#false} is VALID [2018-11-23 12:26:53,791 INFO L273 TraceCheckUtils]: 120: Hoare triple {19025#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19025#false} is VALID [2018-11-23 12:26:53,791 INFO L273 TraceCheckUtils]: 121: Hoare triple {19025#false} assume !(~i~2 < 99999); {19025#false} is VALID [2018-11-23 12:26:53,791 INFO L273 TraceCheckUtils]: 122: Hoare triple {19025#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {19025#false} is VALID [2018-11-23 12:26:53,792 INFO L256 TraceCheckUtils]: 123: Hoare triple {19025#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {19024#true} is VALID [2018-11-23 12:26:53,792 INFO L273 TraceCheckUtils]: 124: Hoare triple {19024#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {19024#true} is VALID [2018-11-23 12:26:53,792 INFO L273 TraceCheckUtils]: 125: Hoare triple {19024#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:26:53,792 INFO L273 TraceCheckUtils]: 126: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:26:53,792 INFO L273 TraceCheckUtils]: 127: Hoare triple {19024#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:26:53,792 INFO L273 TraceCheckUtils]: 128: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:26:53,792 INFO L273 TraceCheckUtils]: 129: Hoare triple {19024#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:26:53,792 INFO L273 TraceCheckUtils]: 130: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:26:53,792 INFO L273 TraceCheckUtils]: 131: Hoare triple {19024#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:26:53,792 INFO L273 TraceCheckUtils]: 132: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:26:53,793 INFO L273 TraceCheckUtils]: 133: Hoare triple {19024#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:26:53,793 INFO L273 TraceCheckUtils]: 134: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:26:53,793 INFO L273 TraceCheckUtils]: 135: Hoare triple {19024#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:26:53,793 INFO L273 TraceCheckUtils]: 136: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:26:53,793 INFO L273 TraceCheckUtils]: 137: Hoare triple {19024#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:26:53,793 INFO L273 TraceCheckUtils]: 138: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:26:53,793 INFO L273 TraceCheckUtils]: 139: Hoare triple {19024#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:26:53,793 INFO L273 TraceCheckUtils]: 140: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:26:53,793 INFO L273 TraceCheckUtils]: 141: Hoare triple {19024#true} assume !(~i~0 < 100000); {19024#true} is VALID [2018-11-23 12:26:53,794 INFO L273 TraceCheckUtils]: 142: Hoare triple {19024#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {19024#true} is VALID [2018-11-23 12:26:53,794 INFO L273 TraceCheckUtils]: 143: Hoare triple {19024#true} assume true; {19024#true} is VALID [2018-11-23 12:26:53,794 INFO L268 TraceCheckUtils]: 144: Hoare quadruple {19024#true} {19025#false} #74#return; {19025#false} is VALID [2018-11-23 12:26:53,794 INFO L273 TraceCheckUtils]: 145: Hoare triple {19025#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {19025#false} is VALID [2018-11-23 12:26:53,794 INFO L273 TraceCheckUtils]: 146: Hoare triple {19025#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {19025#false} is VALID [2018-11-23 12:26:53,794 INFO L273 TraceCheckUtils]: 147: Hoare triple {19025#false} assume !false; {19025#false} is VALID [2018-11-23 12:26:53,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2018-11-23 12:26:53,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:53,804 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:53,814 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:26:53,997 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 12:26:53,997 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:54,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:54,344 INFO L256 TraceCheckUtils]: 0: Hoare triple {19024#true} call ULTIMATE.init(); {19024#true} is VALID [2018-11-23 12:26:54,344 INFO L273 TraceCheckUtils]: 1: Hoare triple {19024#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19024#true} is VALID [2018-11-23 12:26:54,344 INFO L273 TraceCheckUtils]: 2: Hoare triple {19024#true} assume true; {19024#true} is VALID [2018-11-23 12:26:54,344 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19024#true} {19024#true} #66#return; {19024#true} is VALID [2018-11-23 12:26:54,345 INFO L256 TraceCheckUtils]: 4: Hoare triple {19024#true} call #t~ret13 := main(); {19024#true} is VALID [2018-11-23 12:26:54,345 INFO L273 TraceCheckUtils]: 5: Hoare triple {19024#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; {19024#true} is VALID [2018-11-23 12:26:54,345 INFO L273 TraceCheckUtils]: 6: Hoare triple {19024#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#true} is VALID [2018-11-23 12:26:54,345 INFO L273 TraceCheckUtils]: 7: Hoare triple {19024#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#true} is VALID [2018-11-23 12:26:54,345 INFO L273 TraceCheckUtils]: 8: Hoare triple {19024#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#true} is VALID [2018-11-23 12:26:54,346 INFO L273 TraceCheckUtils]: 9: Hoare triple {19024#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#true} is VALID [2018-11-23 12:26:54,346 INFO L273 TraceCheckUtils]: 10: Hoare triple {19024#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#true} is VALID [2018-11-23 12:26:54,346 INFO L273 TraceCheckUtils]: 11: Hoare triple {19024#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#true} is VALID [2018-11-23 12:26:54,346 INFO L273 TraceCheckUtils]: 12: Hoare triple {19024#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#true} is VALID [2018-11-23 12:26:54,346 INFO L273 TraceCheckUtils]: 13: Hoare triple {19024#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#true} is VALID [2018-11-23 12:26:54,346 INFO L273 TraceCheckUtils]: 14: Hoare triple {19024#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#true} is VALID [2018-11-23 12:26:54,347 INFO L273 TraceCheckUtils]: 15: Hoare triple {19024#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#true} is VALID [2018-11-23 12:26:54,347 INFO L273 TraceCheckUtils]: 16: Hoare triple {19024#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#true} is VALID [2018-11-23 12:26:54,347 INFO L273 TraceCheckUtils]: 17: Hoare triple {19024#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#true} is VALID [2018-11-23 12:26:54,347 INFO L273 TraceCheckUtils]: 18: Hoare triple {19024#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#true} is VALID [2018-11-23 12:26:54,347 INFO L273 TraceCheckUtils]: 19: Hoare triple {19024#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#true} is VALID [2018-11-23 12:26:54,348 INFO L273 TraceCheckUtils]: 20: Hoare triple {19024#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#true} is VALID [2018-11-23 12:26:54,348 INFO L273 TraceCheckUtils]: 21: Hoare triple {19024#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#true} is VALID [2018-11-23 12:26:54,348 INFO L273 TraceCheckUtils]: 22: Hoare triple {19024#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#true} is VALID [2018-11-23 12:26:54,348 INFO L273 TraceCheckUtils]: 23: Hoare triple {19024#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#true} is VALID [2018-11-23 12:26:54,348 INFO L273 TraceCheckUtils]: 24: Hoare triple {19024#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#true} is VALID [2018-11-23 12:26:54,348 INFO L273 TraceCheckUtils]: 25: Hoare triple {19024#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#true} is VALID [2018-11-23 12:26:54,348 INFO L273 TraceCheckUtils]: 26: Hoare triple {19024#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#true} is VALID [2018-11-23 12:26:54,348 INFO L273 TraceCheckUtils]: 27: Hoare triple {19024#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#true} is VALID [2018-11-23 12:26:54,348 INFO L273 TraceCheckUtils]: 28: Hoare triple {19024#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#true} is VALID [2018-11-23 12:26:54,348 INFO L273 TraceCheckUtils]: 29: Hoare triple {19024#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#true} is VALID [2018-11-23 12:26:54,349 INFO L273 TraceCheckUtils]: 30: Hoare triple {19024#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#true} is VALID [2018-11-23 12:26:54,349 INFO L273 TraceCheckUtils]: 31: Hoare triple {19024#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#true} is VALID [2018-11-23 12:26:54,349 INFO L273 TraceCheckUtils]: 32: Hoare triple {19024#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#true} is VALID [2018-11-23 12:26:54,349 INFO L273 TraceCheckUtils]: 33: Hoare triple {19024#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#true} is VALID [2018-11-23 12:26:54,349 INFO L273 TraceCheckUtils]: 34: Hoare triple {19024#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#true} is VALID [2018-11-23 12:26:54,349 INFO L273 TraceCheckUtils]: 35: Hoare triple {19024#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#true} is VALID [2018-11-23 12:26:54,349 INFO L273 TraceCheckUtils]: 36: Hoare triple {19024#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#true} is VALID [2018-11-23 12:26:54,349 INFO L273 TraceCheckUtils]: 37: Hoare triple {19024#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#true} is VALID [2018-11-23 12:26:54,349 INFO L273 TraceCheckUtils]: 38: Hoare triple {19024#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#true} is VALID [2018-11-23 12:26:54,349 INFO L273 TraceCheckUtils]: 39: Hoare triple {19024#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#true} is VALID [2018-11-23 12:26:54,350 INFO L273 TraceCheckUtils]: 40: Hoare triple {19024#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#true} is VALID [2018-11-23 12:26:54,350 INFO L273 TraceCheckUtils]: 41: Hoare triple {19024#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#true} is VALID [2018-11-23 12:26:54,350 INFO L273 TraceCheckUtils]: 42: Hoare triple {19024#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#true} is VALID [2018-11-23 12:26:54,350 INFO L273 TraceCheckUtils]: 43: Hoare triple {19024#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#true} is VALID [2018-11-23 12:26:54,350 INFO L273 TraceCheckUtils]: 44: Hoare triple {19024#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#true} is VALID [2018-11-23 12:26:54,350 INFO L273 TraceCheckUtils]: 45: Hoare triple {19024#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#true} is VALID [2018-11-23 12:26:54,350 INFO L273 TraceCheckUtils]: 46: Hoare triple {19024#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#true} is VALID [2018-11-23 12:26:54,350 INFO L273 TraceCheckUtils]: 47: Hoare triple {19024#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#true} is VALID [2018-11-23 12:26:54,350 INFO L273 TraceCheckUtils]: 48: Hoare triple {19024#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#true} is VALID [2018-11-23 12:26:54,351 INFO L273 TraceCheckUtils]: 49: Hoare triple {19024#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#true} is VALID [2018-11-23 12:26:54,351 INFO L273 TraceCheckUtils]: 50: Hoare triple {19024#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#true} is VALID [2018-11-23 12:26:54,351 INFO L273 TraceCheckUtils]: 51: Hoare triple {19024#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#true} is VALID [2018-11-23 12:26:54,351 INFO L273 TraceCheckUtils]: 52: Hoare triple {19024#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#true} is VALID [2018-11-23 12:26:54,351 INFO L273 TraceCheckUtils]: 53: Hoare triple {19024#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#true} is VALID [2018-11-23 12:26:54,351 INFO L273 TraceCheckUtils]: 54: Hoare triple {19024#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#true} is VALID [2018-11-23 12:26:54,351 INFO L273 TraceCheckUtils]: 55: Hoare triple {19024#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#true} is VALID [2018-11-23 12:26:54,351 INFO L273 TraceCheckUtils]: 56: Hoare triple {19024#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#true} is VALID [2018-11-23 12:26:54,351 INFO L273 TraceCheckUtils]: 57: Hoare triple {19024#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#true} is VALID [2018-11-23 12:26:54,351 INFO L273 TraceCheckUtils]: 58: Hoare triple {19024#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {19024#true} is VALID [2018-11-23 12:26:54,352 INFO L273 TraceCheckUtils]: 59: Hoare triple {19024#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {19024#true} is VALID [2018-11-23 12:26:54,352 INFO L273 TraceCheckUtils]: 60: Hoare triple {19024#true} assume !(~i~1 < 100000); {19024#true} is VALID [2018-11-23 12:26:54,352 INFO L256 TraceCheckUtils]: 61: Hoare triple {19024#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {19024#true} is VALID [2018-11-23 12:26:54,352 INFO L273 TraceCheckUtils]: 62: Hoare triple {19024#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {19024#true} is VALID [2018-11-23 12:26:54,352 INFO L273 TraceCheckUtils]: 63: Hoare triple {19024#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:26:54,352 INFO L273 TraceCheckUtils]: 64: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:26:54,352 INFO L273 TraceCheckUtils]: 65: Hoare triple {19024#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:26:54,352 INFO L273 TraceCheckUtils]: 66: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:26:54,352 INFO L273 TraceCheckUtils]: 67: Hoare triple {19024#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:26:54,352 INFO L273 TraceCheckUtils]: 68: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:26:54,353 INFO L273 TraceCheckUtils]: 69: Hoare triple {19024#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:26:54,353 INFO L273 TraceCheckUtils]: 70: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:26:54,353 INFO L273 TraceCheckUtils]: 71: Hoare triple {19024#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:26:54,353 INFO L273 TraceCheckUtils]: 72: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:26:54,353 INFO L273 TraceCheckUtils]: 73: Hoare triple {19024#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:26:54,353 INFO L273 TraceCheckUtils]: 74: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:26:54,353 INFO L273 TraceCheckUtils]: 75: Hoare triple {19024#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:26:54,353 INFO L273 TraceCheckUtils]: 76: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:26:54,353 INFO L273 TraceCheckUtils]: 77: Hoare triple {19024#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:26:54,354 INFO L273 TraceCheckUtils]: 78: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:26:54,354 INFO L273 TraceCheckUtils]: 79: Hoare triple {19024#true} assume !(~i~0 < 100000); {19024#true} is VALID [2018-11-23 12:26:54,354 INFO L273 TraceCheckUtils]: 80: Hoare triple {19024#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {19024#true} is VALID [2018-11-23 12:26:54,354 INFO L273 TraceCheckUtils]: 81: Hoare triple {19024#true} assume true; {19024#true} is VALID [2018-11-23 12:26:54,354 INFO L268 TraceCheckUtils]: 82: Hoare quadruple {19024#true} {19024#true} #70#return; {19024#true} is VALID [2018-11-23 12:26:54,354 INFO L273 TraceCheckUtils]: 83: Hoare triple {19024#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {19024#true} is VALID [2018-11-23 12:26:54,354 INFO L256 TraceCheckUtils]: 84: Hoare triple {19024#true} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {19024#true} is VALID [2018-11-23 12:26:54,354 INFO L273 TraceCheckUtils]: 85: Hoare triple {19024#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {19024#true} is VALID [2018-11-23 12:26:54,354 INFO L273 TraceCheckUtils]: 86: Hoare triple {19024#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:26:54,354 INFO L273 TraceCheckUtils]: 87: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:26:54,355 INFO L273 TraceCheckUtils]: 88: Hoare triple {19024#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:26:54,355 INFO L273 TraceCheckUtils]: 89: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:26:54,355 INFO L273 TraceCheckUtils]: 90: Hoare triple {19024#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:26:54,355 INFO L273 TraceCheckUtils]: 91: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:26:54,355 INFO L273 TraceCheckUtils]: 92: Hoare triple {19024#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:26:54,355 INFO L273 TraceCheckUtils]: 93: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:26:54,355 INFO L273 TraceCheckUtils]: 94: Hoare triple {19024#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:26:54,355 INFO L273 TraceCheckUtils]: 95: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:26:54,355 INFO L273 TraceCheckUtils]: 96: Hoare triple {19024#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:26:54,355 INFO L273 TraceCheckUtils]: 97: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:26:54,356 INFO L273 TraceCheckUtils]: 98: Hoare triple {19024#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:26:54,356 INFO L273 TraceCheckUtils]: 99: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:26:54,356 INFO L273 TraceCheckUtils]: 100: Hoare triple {19024#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:26:54,356 INFO L273 TraceCheckUtils]: 101: Hoare triple {19024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19024#true} is VALID [2018-11-23 12:26:54,356 INFO L273 TraceCheckUtils]: 102: Hoare triple {19024#true} assume !(~i~0 < 100000); {19024#true} is VALID [2018-11-23 12:26:54,356 INFO L273 TraceCheckUtils]: 103: Hoare triple {19024#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {19024#true} is VALID [2018-11-23 12:26:54,356 INFO L273 TraceCheckUtils]: 104: Hoare triple {19024#true} assume true; {19024#true} is VALID [2018-11-23 12:26:54,356 INFO L268 TraceCheckUtils]: 105: Hoare quadruple {19024#true} {19024#true} #72#return; {19024#true} is VALID [2018-11-23 12:26:54,357 INFO L273 TraceCheckUtils]: 106: Hoare triple {19024#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {19375#(<= main_~i~2 0)} is VALID [2018-11-23 12:26:54,357 INFO L273 TraceCheckUtils]: 107: Hoare triple {19375#(<= main_~i~2 0)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19375#(<= main_~i~2 0)} is VALID [2018-11-23 12:26:54,358 INFO L273 TraceCheckUtils]: 108: Hoare triple {19375#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19382#(<= main_~i~2 1)} is VALID [2018-11-23 12:26:54,358 INFO L273 TraceCheckUtils]: 109: Hoare triple {19382#(<= main_~i~2 1)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19382#(<= main_~i~2 1)} is VALID [2018-11-23 12:26:54,358 INFO L273 TraceCheckUtils]: 110: Hoare triple {19382#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19389#(<= main_~i~2 2)} is VALID [2018-11-23 12:26:54,359 INFO L273 TraceCheckUtils]: 111: Hoare triple {19389#(<= main_~i~2 2)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19389#(<= main_~i~2 2)} is VALID [2018-11-23 12:26:54,359 INFO L273 TraceCheckUtils]: 112: Hoare triple {19389#(<= main_~i~2 2)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19396#(<= main_~i~2 3)} is VALID [2018-11-23 12:26:54,359 INFO L273 TraceCheckUtils]: 113: Hoare triple {19396#(<= main_~i~2 3)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19396#(<= main_~i~2 3)} is VALID [2018-11-23 12:26:54,360 INFO L273 TraceCheckUtils]: 114: Hoare triple {19396#(<= main_~i~2 3)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19403#(<= main_~i~2 4)} is VALID [2018-11-23 12:26:54,360 INFO L273 TraceCheckUtils]: 115: Hoare triple {19403#(<= main_~i~2 4)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19403#(<= main_~i~2 4)} is VALID [2018-11-23 12:26:54,361 INFO L273 TraceCheckUtils]: 116: Hoare triple {19403#(<= main_~i~2 4)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19410#(<= main_~i~2 5)} is VALID [2018-11-23 12:26:54,361 INFO L273 TraceCheckUtils]: 117: Hoare triple {19410#(<= main_~i~2 5)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19410#(<= main_~i~2 5)} is VALID [2018-11-23 12:26:54,362 INFO L273 TraceCheckUtils]: 118: Hoare triple {19410#(<= main_~i~2 5)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19417#(<= main_~i~2 6)} is VALID [2018-11-23 12:26:54,362 INFO L273 TraceCheckUtils]: 119: Hoare triple {19417#(<= main_~i~2 6)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {19417#(<= main_~i~2 6)} is VALID [2018-11-23 12:26:54,363 INFO L273 TraceCheckUtils]: 120: Hoare triple {19417#(<= main_~i~2 6)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {19424#(<= main_~i~2 7)} is VALID [2018-11-23 12:26:54,364 INFO L273 TraceCheckUtils]: 121: Hoare triple {19424#(<= main_~i~2 7)} assume !(~i~2 < 99999); {19025#false} is VALID [2018-11-23 12:26:54,364 INFO L273 TraceCheckUtils]: 122: Hoare triple {19025#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {19025#false} is VALID [2018-11-23 12:26:54,364 INFO L256 TraceCheckUtils]: 123: Hoare triple {19025#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {19025#false} is VALID [2018-11-23 12:26:54,364 INFO L273 TraceCheckUtils]: 124: Hoare triple {19025#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {19025#false} is VALID [2018-11-23 12:26:54,365 INFO L273 TraceCheckUtils]: 125: Hoare triple {19025#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19025#false} is VALID [2018-11-23 12:26:54,365 INFO L273 TraceCheckUtils]: 126: Hoare triple {19025#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19025#false} is VALID [2018-11-23 12:26:54,365 INFO L273 TraceCheckUtils]: 127: Hoare triple {19025#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19025#false} is VALID [2018-11-23 12:26:54,365 INFO L273 TraceCheckUtils]: 128: Hoare triple {19025#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19025#false} is VALID [2018-11-23 12:26:54,365 INFO L273 TraceCheckUtils]: 129: Hoare triple {19025#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19025#false} is VALID [2018-11-23 12:26:54,365 INFO L273 TraceCheckUtils]: 130: Hoare triple {19025#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19025#false} is VALID [2018-11-23 12:26:54,366 INFO L273 TraceCheckUtils]: 131: Hoare triple {19025#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19025#false} is VALID [2018-11-23 12:26:54,366 INFO L273 TraceCheckUtils]: 132: Hoare triple {19025#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19025#false} is VALID [2018-11-23 12:26:54,366 INFO L273 TraceCheckUtils]: 133: Hoare triple {19025#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19025#false} is VALID [2018-11-23 12:26:54,367 INFO L273 TraceCheckUtils]: 134: Hoare triple {19025#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19025#false} is VALID [2018-11-23 12:26:54,367 INFO L273 TraceCheckUtils]: 135: Hoare triple {19025#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19025#false} is VALID [2018-11-23 12:26:54,367 INFO L273 TraceCheckUtils]: 136: Hoare triple {19025#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19025#false} is VALID [2018-11-23 12:26:54,367 INFO L273 TraceCheckUtils]: 137: Hoare triple {19025#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19025#false} is VALID [2018-11-23 12:26:54,367 INFO L273 TraceCheckUtils]: 138: Hoare triple {19025#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19025#false} is VALID [2018-11-23 12:26:54,367 INFO L273 TraceCheckUtils]: 139: Hoare triple {19025#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {19025#false} is VALID [2018-11-23 12:26:54,367 INFO L273 TraceCheckUtils]: 140: Hoare triple {19025#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19025#false} is VALID [2018-11-23 12:26:54,368 INFO L273 TraceCheckUtils]: 141: Hoare triple {19025#false} assume !(~i~0 < 100000); {19025#false} is VALID [2018-11-23 12:26:54,368 INFO L273 TraceCheckUtils]: 142: Hoare triple {19025#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {19025#false} is VALID [2018-11-23 12:26:54,368 INFO L273 TraceCheckUtils]: 143: Hoare triple {19025#false} assume true; {19025#false} is VALID [2018-11-23 12:26:54,368 INFO L268 TraceCheckUtils]: 144: Hoare quadruple {19025#false} {19025#false} #74#return; {19025#false} is VALID [2018-11-23 12:26:54,368 INFO L273 TraceCheckUtils]: 145: Hoare triple {19025#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {19025#false} is VALID [2018-11-23 12:26:54,368 INFO L273 TraceCheckUtils]: 146: Hoare triple {19025#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {19025#false} is VALID [2018-11-23 12:26:54,369 INFO L273 TraceCheckUtils]: 147: Hoare triple {19025#false} assume !false; {19025#false} is VALID [2018-11-23 12:26:54,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 298 proven. 49 refuted. 0 times theorem prover too weak. 1070 trivial. 0 not checked. [2018-11-23 12:26:54,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:54,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 10] total 38 [2018-11-23 12:26:54,410 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 148 [2018-11-23 12:26:54,410 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:54,410 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-23 12:26:54,606 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:54,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-23 12:26:54,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-23 12:26:54,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=479, Invalid=927, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 12:26:54,608 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 38 states. [2018-11-23 12:26:55,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:55,615 INFO L93 Difference]: Finished difference Result 159 states and 168 transitions. [2018-11-23 12:26:55,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-23 12:26:55,615 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 148 [2018-11-23 12:26:55,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:55,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:26:55,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 125 transitions. [2018-11-23 12:26:55,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:26:55,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 125 transitions. [2018-11-23 12:26:55,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 125 transitions. [2018-11-23 12:26:55,784 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:55,787 INFO L225 Difference]: With dead ends: 159 [2018-11-23 12:26:55,787 INFO L226 Difference]: Without dead ends: 113 [2018-11-23 12:26:55,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 141 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-23 12:26:55,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-23 12:26:55,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2018-11-23 12:26:55,979 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:55,979 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand 111 states. [2018-11-23 12:26:55,979 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 111 states. [2018-11-23 12:26:55,979 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 111 states. [2018-11-23 12:26:55,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:55,982 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-11-23 12:26:55,982 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2018-11-23 12:26:55,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:55,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:55,982 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 113 states. [2018-11-23 12:26:55,982 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 113 states. [2018-11-23 12:26:55,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:55,984 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-11-23 12:26:55,984 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2018-11-23 12:26:55,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:55,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:55,985 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:55,985 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:55,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-23 12:26:55,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2018-11-23 12:26:55,987 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 148 [2018-11-23 12:26:55,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:55,987 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2018-11-23 12:26:55,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-23 12:26:55,988 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2018-11-23 12:26:55,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-23 12:26:55,989 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:55,989 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 24, 24, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:26:55,989 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:55,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:55,989 INFO L82 PathProgramCache]: Analyzing trace with hash 894020771, now seen corresponding path program 28 times [2018-11-23 12:26:55,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:55,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:55,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:55,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:55,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:56,927 INFO L256 TraceCheckUtils]: 0: Hoare triple {20132#true} call ULTIMATE.init(); {20132#true} is VALID [2018-11-23 12:26:56,927 INFO L273 TraceCheckUtils]: 1: Hoare triple {20132#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20132#true} is VALID [2018-11-23 12:26:56,927 INFO L273 TraceCheckUtils]: 2: Hoare triple {20132#true} assume true; {20132#true} is VALID [2018-11-23 12:26:56,927 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20132#true} {20132#true} #66#return; {20132#true} is VALID [2018-11-23 12:26:56,928 INFO L256 TraceCheckUtils]: 4: Hoare triple {20132#true} call #t~ret13 := main(); {20132#true} is VALID [2018-11-23 12:26:56,928 INFO L273 TraceCheckUtils]: 5: Hoare triple {20132#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; {20134#(= main_~i~1 0)} is VALID [2018-11-23 12:26:56,929 INFO L273 TraceCheckUtils]: 6: Hoare triple {20134#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20134#(= main_~i~1 0)} is VALID [2018-11-23 12:26:56,929 INFO L273 TraceCheckUtils]: 7: Hoare triple {20134#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20135#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:56,930 INFO L273 TraceCheckUtils]: 8: Hoare triple {20135#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20135#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:56,930 INFO L273 TraceCheckUtils]: 9: Hoare triple {20135#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20136#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:56,930 INFO L273 TraceCheckUtils]: 10: Hoare triple {20136#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20136#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:56,931 INFO L273 TraceCheckUtils]: 11: Hoare triple {20136#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20137#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:56,931 INFO L273 TraceCheckUtils]: 12: Hoare triple {20137#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20137#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:56,932 INFO L273 TraceCheckUtils]: 13: Hoare triple {20137#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20138#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:56,932 INFO L273 TraceCheckUtils]: 14: Hoare triple {20138#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20138#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:56,933 INFO L273 TraceCheckUtils]: 15: Hoare triple {20138#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20139#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:56,933 INFO L273 TraceCheckUtils]: 16: Hoare triple {20139#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20139#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:56,934 INFO L273 TraceCheckUtils]: 17: Hoare triple {20139#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20140#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:56,935 INFO L273 TraceCheckUtils]: 18: Hoare triple {20140#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20140#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:56,935 INFO L273 TraceCheckUtils]: 19: Hoare triple {20140#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20141#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:56,936 INFO L273 TraceCheckUtils]: 20: Hoare triple {20141#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20141#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:56,937 INFO L273 TraceCheckUtils]: 21: Hoare triple {20141#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20142#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:56,937 INFO L273 TraceCheckUtils]: 22: Hoare triple {20142#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20142#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:56,938 INFO L273 TraceCheckUtils]: 23: Hoare triple {20142#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20143#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:56,938 INFO L273 TraceCheckUtils]: 24: Hoare triple {20143#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20143#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:56,939 INFO L273 TraceCheckUtils]: 25: Hoare triple {20143#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20144#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:56,940 INFO L273 TraceCheckUtils]: 26: Hoare triple {20144#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20144#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:56,940 INFO L273 TraceCheckUtils]: 27: Hoare triple {20144#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20145#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:56,941 INFO L273 TraceCheckUtils]: 28: Hoare triple {20145#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20145#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:56,942 INFO L273 TraceCheckUtils]: 29: Hoare triple {20145#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20146#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:56,942 INFO L273 TraceCheckUtils]: 30: Hoare triple {20146#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20146#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:56,943 INFO L273 TraceCheckUtils]: 31: Hoare triple {20146#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20147#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:56,943 INFO L273 TraceCheckUtils]: 32: Hoare triple {20147#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20147#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:56,944 INFO L273 TraceCheckUtils]: 33: Hoare triple {20147#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20148#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:56,945 INFO L273 TraceCheckUtils]: 34: Hoare triple {20148#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20148#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:56,945 INFO L273 TraceCheckUtils]: 35: Hoare triple {20148#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20149#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:56,946 INFO L273 TraceCheckUtils]: 36: Hoare triple {20149#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20149#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:56,947 INFO L273 TraceCheckUtils]: 37: Hoare triple {20149#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20150#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:56,947 INFO L273 TraceCheckUtils]: 38: Hoare triple {20150#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20150#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:56,948 INFO L273 TraceCheckUtils]: 39: Hoare triple {20150#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20151#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:56,948 INFO L273 TraceCheckUtils]: 40: Hoare triple {20151#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20151#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:56,949 INFO L273 TraceCheckUtils]: 41: Hoare triple {20151#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20152#(<= main_~i~1 18)} is VALID [2018-11-23 12:26:56,950 INFO L273 TraceCheckUtils]: 42: Hoare triple {20152#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20152#(<= main_~i~1 18)} is VALID [2018-11-23 12:26:56,950 INFO L273 TraceCheckUtils]: 43: Hoare triple {20152#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20153#(<= main_~i~1 19)} is VALID [2018-11-23 12:26:56,951 INFO L273 TraceCheckUtils]: 44: Hoare triple {20153#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20153#(<= main_~i~1 19)} is VALID [2018-11-23 12:26:56,951 INFO L273 TraceCheckUtils]: 45: Hoare triple {20153#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20154#(<= main_~i~1 20)} is VALID [2018-11-23 12:26:56,952 INFO L273 TraceCheckUtils]: 46: Hoare triple {20154#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20154#(<= main_~i~1 20)} is VALID [2018-11-23 12:26:56,953 INFO L273 TraceCheckUtils]: 47: Hoare triple {20154#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20155#(<= main_~i~1 21)} is VALID [2018-11-23 12:26:56,953 INFO L273 TraceCheckUtils]: 48: Hoare triple {20155#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20155#(<= main_~i~1 21)} is VALID [2018-11-23 12:26:56,954 INFO L273 TraceCheckUtils]: 49: Hoare triple {20155#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20156#(<= main_~i~1 22)} is VALID [2018-11-23 12:26:56,954 INFO L273 TraceCheckUtils]: 50: Hoare triple {20156#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20156#(<= main_~i~1 22)} is VALID [2018-11-23 12:26:56,955 INFO L273 TraceCheckUtils]: 51: Hoare triple {20156#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20157#(<= main_~i~1 23)} is VALID [2018-11-23 12:26:56,956 INFO L273 TraceCheckUtils]: 52: Hoare triple {20157#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20157#(<= main_~i~1 23)} is VALID [2018-11-23 12:26:56,956 INFO L273 TraceCheckUtils]: 53: Hoare triple {20157#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20158#(<= main_~i~1 24)} is VALID [2018-11-23 12:26:56,957 INFO L273 TraceCheckUtils]: 54: Hoare triple {20158#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20158#(<= main_~i~1 24)} is VALID [2018-11-23 12:26:56,958 INFO L273 TraceCheckUtils]: 55: Hoare triple {20158#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20159#(<= main_~i~1 25)} is VALID [2018-11-23 12:26:56,958 INFO L273 TraceCheckUtils]: 56: Hoare triple {20159#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20159#(<= main_~i~1 25)} is VALID [2018-11-23 12:26:56,959 INFO L273 TraceCheckUtils]: 57: Hoare triple {20159#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20160#(<= main_~i~1 26)} is VALID [2018-11-23 12:26:56,959 INFO L273 TraceCheckUtils]: 58: Hoare triple {20160#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20160#(<= main_~i~1 26)} is VALID [2018-11-23 12:26:56,960 INFO L273 TraceCheckUtils]: 59: Hoare triple {20160#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20161#(<= main_~i~1 27)} is VALID [2018-11-23 12:26:56,961 INFO L273 TraceCheckUtils]: 60: Hoare triple {20161#(<= main_~i~1 27)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20161#(<= main_~i~1 27)} is VALID [2018-11-23 12:26:56,961 INFO L273 TraceCheckUtils]: 61: Hoare triple {20161#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20162#(<= main_~i~1 28)} is VALID [2018-11-23 12:26:56,962 INFO L273 TraceCheckUtils]: 62: Hoare triple {20162#(<= main_~i~1 28)} assume !(~i~1 < 100000); {20133#false} is VALID [2018-11-23 12:26:56,962 INFO L256 TraceCheckUtils]: 63: Hoare triple {20133#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {20132#true} is VALID [2018-11-23 12:26:56,962 INFO L273 TraceCheckUtils]: 64: Hoare triple {20132#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {20132#true} is VALID [2018-11-23 12:26:56,963 INFO L273 TraceCheckUtils]: 65: Hoare triple {20132#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:26:56,963 INFO L273 TraceCheckUtils]: 66: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:26:56,963 INFO L273 TraceCheckUtils]: 67: Hoare triple {20132#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:26:56,963 INFO L273 TraceCheckUtils]: 68: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:26:56,963 INFO L273 TraceCheckUtils]: 69: Hoare triple {20132#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:26:56,963 INFO L273 TraceCheckUtils]: 70: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:26:56,964 INFO L273 TraceCheckUtils]: 71: Hoare triple {20132#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:26:56,964 INFO L273 TraceCheckUtils]: 72: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:26:56,964 INFO L273 TraceCheckUtils]: 73: Hoare triple {20132#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:26:56,964 INFO L273 TraceCheckUtils]: 74: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:26:56,964 INFO L273 TraceCheckUtils]: 75: Hoare triple {20132#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:26:56,964 INFO L273 TraceCheckUtils]: 76: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:26:56,965 INFO L273 TraceCheckUtils]: 77: Hoare triple {20132#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:26:56,965 INFO L273 TraceCheckUtils]: 78: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:26:56,965 INFO L273 TraceCheckUtils]: 79: Hoare triple {20132#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:26:56,965 INFO L273 TraceCheckUtils]: 80: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:26:56,965 INFO L273 TraceCheckUtils]: 81: Hoare triple {20132#true} assume !(~i~0 < 100000); {20132#true} is VALID [2018-11-23 12:26:56,965 INFO L273 TraceCheckUtils]: 82: Hoare triple {20132#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {20132#true} is VALID [2018-11-23 12:26:56,965 INFO L273 TraceCheckUtils]: 83: Hoare triple {20132#true} assume true; {20132#true} is VALID [2018-11-23 12:26:56,965 INFO L268 TraceCheckUtils]: 84: Hoare quadruple {20132#true} {20133#false} #70#return; {20133#false} is VALID [2018-11-23 12:26:56,965 INFO L273 TraceCheckUtils]: 85: Hoare triple {20133#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {20133#false} is VALID [2018-11-23 12:26:56,966 INFO L256 TraceCheckUtils]: 86: Hoare triple {20133#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {20132#true} is VALID [2018-11-23 12:26:56,966 INFO L273 TraceCheckUtils]: 87: Hoare triple {20132#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {20132#true} is VALID [2018-11-23 12:26:56,966 INFO L273 TraceCheckUtils]: 88: Hoare triple {20132#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:26:56,966 INFO L273 TraceCheckUtils]: 89: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:26:56,966 INFO L273 TraceCheckUtils]: 90: Hoare triple {20132#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:26:56,966 INFO L273 TraceCheckUtils]: 91: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:26:56,966 INFO L273 TraceCheckUtils]: 92: Hoare triple {20132#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:26:56,966 INFO L273 TraceCheckUtils]: 93: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:26:56,966 INFO L273 TraceCheckUtils]: 94: Hoare triple {20132#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:26:56,966 INFO L273 TraceCheckUtils]: 95: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:26:56,967 INFO L273 TraceCheckUtils]: 96: Hoare triple {20132#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:26:56,967 INFO L273 TraceCheckUtils]: 97: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:26:56,967 INFO L273 TraceCheckUtils]: 98: Hoare triple {20132#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:26:56,967 INFO L273 TraceCheckUtils]: 99: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:26:56,967 INFO L273 TraceCheckUtils]: 100: Hoare triple {20132#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:26:56,967 INFO L273 TraceCheckUtils]: 101: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:26:56,967 INFO L273 TraceCheckUtils]: 102: Hoare triple {20132#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:26:56,967 INFO L273 TraceCheckUtils]: 103: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:26:56,967 INFO L273 TraceCheckUtils]: 104: Hoare triple {20132#true} assume !(~i~0 < 100000); {20132#true} is VALID [2018-11-23 12:26:56,968 INFO L273 TraceCheckUtils]: 105: Hoare triple {20132#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {20132#true} is VALID [2018-11-23 12:26:56,968 INFO L273 TraceCheckUtils]: 106: Hoare triple {20132#true} assume true; {20132#true} is VALID [2018-11-23 12:26:56,968 INFO L268 TraceCheckUtils]: 107: Hoare quadruple {20132#true} {20133#false} #72#return; {20133#false} is VALID [2018-11-23 12:26:56,968 INFO L273 TraceCheckUtils]: 108: Hoare triple {20133#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {20133#false} is VALID [2018-11-23 12:26:56,968 INFO L273 TraceCheckUtils]: 109: Hoare triple {20133#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20133#false} is VALID [2018-11-23 12:26:56,968 INFO L273 TraceCheckUtils]: 110: Hoare triple {20133#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20133#false} is VALID [2018-11-23 12:26:56,968 INFO L273 TraceCheckUtils]: 111: Hoare triple {20133#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20133#false} is VALID [2018-11-23 12:26:56,968 INFO L273 TraceCheckUtils]: 112: Hoare triple {20133#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20133#false} is VALID [2018-11-23 12:26:56,968 INFO L273 TraceCheckUtils]: 113: Hoare triple {20133#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20133#false} is VALID [2018-11-23 12:26:56,968 INFO L273 TraceCheckUtils]: 114: Hoare triple {20133#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20133#false} is VALID [2018-11-23 12:26:56,969 INFO L273 TraceCheckUtils]: 115: Hoare triple {20133#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20133#false} is VALID [2018-11-23 12:26:56,969 INFO L273 TraceCheckUtils]: 116: Hoare triple {20133#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20133#false} is VALID [2018-11-23 12:26:56,969 INFO L273 TraceCheckUtils]: 117: Hoare triple {20133#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20133#false} is VALID [2018-11-23 12:26:56,969 INFO L273 TraceCheckUtils]: 118: Hoare triple {20133#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20133#false} is VALID [2018-11-23 12:26:56,969 INFO L273 TraceCheckUtils]: 119: Hoare triple {20133#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20133#false} is VALID [2018-11-23 12:26:56,969 INFO L273 TraceCheckUtils]: 120: Hoare triple {20133#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20133#false} is VALID [2018-11-23 12:26:56,969 INFO L273 TraceCheckUtils]: 121: Hoare triple {20133#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20133#false} is VALID [2018-11-23 12:26:56,969 INFO L273 TraceCheckUtils]: 122: Hoare triple {20133#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20133#false} is VALID [2018-11-23 12:26:56,969 INFO L273 TraceCheckUtils]: 123: Hoare triple {20133#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20133#false} is VALID [2018-11-23 12:26:56,970 INFO L273 TraceCheckUtils]: 124: Hoare triple {20133#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20133#false} is VALID [2018-11-23 12:26:56,970 INFO L273 TraceCheckUtils]: 125: Hoare triple {20133#false} assume !(~i~2 < 99999); {20133#false} is VALID [2018-11-23 12:26:56,970 INFO L273 TraceCheckUtils]: 126: Hoare triple {20133#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {20133#false} is VALID [2018-11-23 12:26:56,970 INFO L256 TraceCheckUtils]: 127: Hoare triple {20133#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {20132#true} is VALID [2018-11-23 12:26:56,970 INFO L273 TraceCheckUtils]: 128: Hoare triple {20132#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {20132#true} is VALID [2018-11-23 12:26:56,970 INFO L273 TraceCheckUtils]: 129: Hoare triple {20132#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:26:56,970 INFO L273 TraceCheckUtils]: 130: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:26:56,970 INFO L273 TraceCheckUtils]: 131: Hoare triple {20132#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:26:56,970 INFO L273 TraceCheckUtils]: 132: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:26:56,970 INFO L273 TraceCheckUtils]: 133: Hoare triple {20132#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:26:56,971 INFO L273 TraceCheckUtils]: 134: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:26:56,971 INFO L273 TraceCheckUtils]: 135: Hoare triple {20132#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:26:56,971 INFO L273 TraceCheckUtils]: 136: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:26:56,971 INFO L273 TraceCheckUtils]: 137: Hoare triple {20132#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:26:56,971 INFO L273 TraceCheckUtils]: 138: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:26:56,971 INFO L273 TraceCheckUtils]: 139: Hoare triple {20132#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:26:56,971 INFO L273 TraceCheckUtils]: 140: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:26:56,971 INFO L273 TraceCheckUtils]: 141: Hoare triple {20132#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:26:56,971 INFO L273 TraceCheckUtils]: 142: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:26:56,971 INFO L273 TraceCheckUtils]: 143: Hoare triple {20132#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:26:56,972 INFO L273 TraceCheckUtils]: 144: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:26:56,972 INFO L273 TraceCheckUtils]: 145: Hoare triple {20132#true} assume !(~i~0 < 100000); {20132#true} is VALID [2018-11-23 12:26:56,972 INFO L273 TraceCheckUtils]: 146: Hoare triple {20132#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {20132#true} is VALID [2018-11-23 12:26:56,972 INFO L273 TraceCheckUtils]: 147: Hoare triple {20132#true} assume true; {20132#true} is VALID [2018-11-23 12:26:56,972 INFO L268 TraceCheckUtils]: 148: Hoare quadruple {20132#true} {20133#false} #74#return; {20133#false} is VALID [2018-11-23 12:26:56,972 INFO L273 TraceCheckUtils]: 149: Hoare triple {20133#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {20133#false} is VALID [2018-11-23 12:26:56,972 INFO L273 TraceCheckUtils]: 150: Hoare triple {20133#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {20133#false} is VALID [2018-11-23 12:26:56,972 INFO L273 TraceCheckUtils]: 151: Hoare triple {20133#false} assume !false; {20133#false} is VALID [2018-11-23 12:26:56,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1487 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2018-11-23 12:26:56,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:56,983 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:56,992 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:26:57,056 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:26:57,056 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:57,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:57,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:57,616 INFO L256 TraceCheckUtils]: 0: Hoare triple {20132#true} call ULTIMATE.init(); {20132#true} is VALID [2018-11-23 12:26:57,616 INFO L273 TraceCheckUtils]: 1: Hoare triple {20132#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20132#true} is VALID [2018-11-23 12:26:57,617 INFO L273 TraceCheckUtils]: 2: Hoare triple {20132#true} assume true; {20132#true} is VALID [2018-11-23 12:26:57,617 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20132#true} {20132#true} #66#return; {20132#true} is VALID [2018-11-23 12:26:57,617 INFO L256 TraceCheckUtils]: 4: Hoare triple {20132#true} call #t~ret13 := main(); {20132#true} is VALID [2018-11-23 12:26:57,617 INFO L273 TraceCheckUtils]: 5: Hoare triple {20132#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; {20132#true} is VALID [2018-11-23 12:26:57,617 INFO L273 TraceCheckUtils]: 6: Hoare triple {20132#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:26:57,618 INFO L273 TraceCheckUtils]: 7: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:26:57,618 INFO L273 TraceCheckUtils]: 8: Hoare triple {20132#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:26:57,618 INFO L273 TraceCheckUtils]: 9: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:26:57,618 INFO L273 TraceCheckUtils]: 10: Hoare triple {20132#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:26:57,618 INFO L273 TraceCheckUtils]: 11: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:26:57,618 INFO L273 TraceCheckUtils]: 12: Hoare triple {20132#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:26:57,619 INFO L273 TraceCheckUtils]: 13: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:26:57,619 INFO L273 TraceCheckUtils]: 14: Hoare triple {20132#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:26:57,619 INFO L273 TraceCheckUtils]: 15: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:26:57,619 INFO L273 TraceCheckUtils]: 16: Hoare triple {20132#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:26:57,619 INFO L273 TraceCheckUtils]: 17: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:26:57,619 INFO L273 TraceCheckUtils]: 18: Hoare triple {20132#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:26:57,619 INFO L273 TraceCheckUtils]: 19: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:26:57,619 INFO L273 TraceCheckUtils]: 20: Hoare triple {20132#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:26:57,619 INFO L273 TraceCheckUtils]: 21: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:26:57,620 INFO L273 TraceCheckUtils]: 22: Hoare triple {20132#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:26:57,620 INFO L273 TraceCheckUtils]: 23: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:26:57,620 INFO L273 TraceCheckUtils]: 24: Hoare triple {20132#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:26:57,620 INFO L273 TraceCheckUtils]: 25: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:26:57,620 INFO L273 TraceCheckUtils]: 26: Hoare triple {20132#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:26:57,620 INFO L273 TraceCheckUtils]: 27: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:26:57,620 INFO L273 TraceCheckUtils]: 28: Hoare triple {20132#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:26:57,620 INFO L273 TraceCheckUtils]: 29: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:26:57,620 INFO L273 TraceCheckUtils]: 30: Hoare triple {20132#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:26:57,620 INFO L273 TraceCheckUtils]: 31: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:26:57,621 INFO L273 TraceCheckUtils]: 32: Hoare triple {20132#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:26:57,621 INFO L273 TraceCheckUtils]: 33: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:26:57,621 INFO L273 TraceCheckUtils]: 34: Hoare triple {20132#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:26:57,621 INFO L273 TraceCheckUtils]: 35: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:26:57,621 INFO L273 TraceCheckUtils]: 36: Hoare triple {20132#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:26:57,621 INFO L273 TraceCheckUtils]: 37: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:26:57,621 INFO L273 TraceCheckUtils]: 38: Hoare triple {20132#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:26:57,621 INFO L273 TraceCheckUtils]: 39: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:26:57,621 INFO L273 TraceCheckUtils]: 40: Hoare triple {20132#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:26:57,622 INFO L273 TraceCheckUtils]: 41: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:26:57,622 INFO L273 TraceCheckUtils]: 42: Hoare triple {20132#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:26:57,622 INFO L273 TraceCheckUtils]: 43: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:26:57,622 INFO L273 TraceCheckUtils]: 44: Hoare triple {20132#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:26:57,622 INFO L273 TraceCheckUtils]: 45: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:26:57,622 INFO L273 TraceCheckUtils]: 46: Hoare triple {20132#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:26:57,622 INFO L273 TraceCheckUtils]: 47: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:26:57,622 INFO L273 TraceCheckUtils]: 48: Hoare triple {20132#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:26:57,622 INFO L273 TraceCheckUtils]: 49: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:26:57,622 INFO L273 TraceCheckUtils]: 50: Hoare triple {20132#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:26:57,623 INFO L273 TraceCheckUtils]: 51: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:26:57,623 INFO L273 TraceCheckUtils]: 52: Hoare triple {20132#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:26:57,623 INFO L273 TraceCheckUtils]: 53: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:26:57,623 INFO L273 TraceCheckUtils]: 54: Hoare triple {20132#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:26:57,623 INFO L273 TraceCheckUtils]: 55: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:26:57,623 INFO L273 TraceCheckUtils]: 56: Hoare triple {20132#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:26:57,623 INFO L273 TraceCheckUtils]: 57: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:26:57,623 INFO L273 TraceCheckUtils]: 58: Hoare triple {20132#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:26:57,623 INFO L273 TraceCheckUtils]: 59: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:26:57,623 INFO L273 TraceCheckUtils]: 60: Hoare triple {20132#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {20132#true} is VALID [2018-11-23 12:26:57,624 INFO L273 TraceCheckUtils]: 61: Hoare triple {20132#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {20132#true} is VALID [2018-11-23 12:26:57,624 INFO L273 TraceCheckUtils]: 62: Hoare triple {20132#true} assume !(~i~1 < 100000); {20132#true} is VALID [2018-11-23 12:26:57,624 INFO L256 TraceCheckUtils]: 63: Hoare triple {20132#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {20132#true} is VALID [2018-11-23 12:26:57,624 INFO L273 TraceCheckUtils]: 64: Hoare triple {20132#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {20132#true} is VALID [2018-11-23 12:26:57,624 INFO L273 TraceCheckUtils]: 65: Hoare triple {20132#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:26:57,624 INFO L273 TraceCheckUtils]: 66: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:26:57,624 INFO L273 TraceCheckUtils]: 67: Hoare triple {20132#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:26:57,624 INFO L273 TraceCheckUtils]: 68: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:26:57,624 INFO L273 TraceCheckUtils]: 69: Hoare triple {20132#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:26:57,625 INFO L273 TraceCheckUtils]: 70: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:26:57,625 INFO L273 TraceCheckUtils]: 71: Hoare triple {20132#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:26:57,625 INFO L273 TraceCheckUtils]: 72: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:26:57,625 INFO L273 TraceCheckUtils]: 73: Hoare triple {20132#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:26:57,625 INFO L273 TraceCheckUtils]: 74: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:26:57,625 INFO L273 TraceCheckUtils]: 75: Hoare triple {20132#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:26:57,625 INFO L273 TraceCheckUtils]: 76: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:26:57,625 INFO L273 TraceCheckUtils]: 77: Hoare triple {20132#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:26:57,625 INFO L273 TraceCheckUtils]: 78: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:26:57,625 INFO L273 TraceCheckUtils]: 79: Hoare triple {20132#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:26:57,626 INFO L273 TraceCheckUtils]: 80: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:26:57,626 INFO L273 TraceCheckUtils]: 81: Hoare triple {20132#true} assume !(~i~0 < 100000); {20132#true} is VALID [2018-11-23 12:26:57,626 INFO L273 TraceCheckUtils]: 82: Hoare triple {20132#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {20132#true} is VALID [2018-11-23 12:26:57,626 INFO L273 TraceCheckUtils]: 83: Hoare triple {20132#true} assume true; {20132#true} is VALID [2018-11-23 12:26:57,626 INFO L268 TraceCheckUtils]: 84: Hoare quadruple {20132#true} {20132#true} #70#return; {20132#true} is VALID [2018-11-23 12:26:57,626 INFO L273 TraceCheckUtils]: 85: Hoare triple {20132#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {20132#true} is VALID [2018-11-23 12:26:57,626 INFO L256 TraceCheckUtils]: 86: Hoare triple {20132#true} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {20132#true} is VALID [2018-11-23 12:26:57,626 INFO L273 TraceCheckUtils]: 87: Hoare triple {20132#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {20132#true} is VALID [2018-11-23 12:26:57,627 INFO L273 TraceCheckUtils]: 88: Hoare triple {20132#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:26:57,627 INFO L273 TraceCheckUtils]: 89: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:26:57,627 INFO L273 TraceCheckUtils]: 90: Hoare triple {20132#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:26:57,627 INFO L273 TraceCheckUtils]: 91: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:26:57,627 INFO L273 TraceCheckUtils]: 92: Hoare triple {20132#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:26:57,627 INFO L273 TraceCheckUtils]: 93: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:26:57,627 INFO L273 TraceCheckUtils]: 94: Hoare triple {20132#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:26:57,628 INFO L273 TraceCheckUtils]: 95: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:26:57,628 INFO L273 TraceCheckUtils]: 96: Hoare triple {20132#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:26:57,628 INFO L273 TraceCheckUtils]: 97: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:26:57,628 INFO L273 TraceCheckUtils]: 98: Hoare triple {20132#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:26:57,628 INFO L273 TraceCheckUtils]: 99: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:26:57,628 INFO L273 TraceCheckUtils]: 100: Hoare triple {20132#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:26:57,628 INFO L273 TraceCheckUtils]: 101: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:26:57,628 INFO L273 TraceCheckUtils]: 102: Hoare triple {20132#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:26:57,628 INFO L273 TraceCheckUtils]: 103: Hoare triple {20132#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20132#true} is VALID [2018-11-23 12:26:57,628 INFO L273 TraceCheckUtils]: 104: Hoare triple {20132#true} assume !(~i~0 < 100000); {20132#true} is VALID [2018-11-23 12:26:57,629 INFO L273 TraceCheckUtils]: 105: Hoare triple {20132#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {20132#true} is VALID [2018-11-23 12:26:57,629 INFO L273 TraceCheckUtils]: 106: Hoare triple {20132#true} assume true; {20132#true} is VALID [2018-11-23 12:26:57,629 INFO L268 TraceCheckUtils]: 107: Hoare quadruple {20132#true} {20132#true} #72#return; {20132#true} is VALID [2018-11-23 12:26:57,629 INFO L273 TraceCheckUtils]: 108: Hoare triple {20132#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {20132#true} is VALID [2018-11-23 12:26:57,629 INFO L273 TraceCheckUtils]: 109: Hoare triple {20132#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20132#true} is VALID [2018-11-23 12:26:57,629 INFO L273 TraceCheckUtils]: 110: Hoare triple {20132#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20132#true} is VALID [2018-11-23 12:26:57,629 INFO L273 TraceCheckUtils]: 111: Hoare triple {20132#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20132#true} is VALID [2018-11-23 12:26:57,629 INFO L273 TraceCheckUtils]: 112: Hoare triple {20132#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20132#true} is VALID [2018-11-23 12:26:57,629 INFO L273 TraceCheckUtils]: 113: Hoare triple {20132#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20132#true} is VALID [2018-11-23 12:26:57,630 INFO L273 TraceCheckUtils]: 114: Hoare triple {20132#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20132#true} is VALID [2018-11-23 12:26:57,630 INFO L273 TraceCheckUtils]: 115: Hoare triple {20132#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20132#true} is VALID [2018-11-23 12:26:57,630 INFO L273 TraceCheckUtils]: 116: Hoare triple {20132#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20132#true} is VALID [2018-11-23 12:26:57,630 INFO L273 TraceCheckUtils]: 117: Hoare triple {20132#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20132#true} is VALID [2018-11-23 12:26:57,630 INFO L273 TraceCheckUtils]: 118: Hoare triple {20132#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20132#true} is VALID [2018-11-23 12:26:57,630 INFO L273 TraceCheckUtils]: 119: Hoare triple {20132#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20132#true} is VALID [2018-11-23 12:26:57,630 INFO L273 TraceCheckUtils]: 120: Hoare triple {20132#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20132#true} is VALID [2018-11-23 12:26:57,630 INFO L273 TraceCheckUtils]: 121: Hoare triple {20132#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20132#true} is VALID [2018-11-23 12:26:57,630 INFO L273 TraceCheckUtils]: 122: Hoare triple {20132#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20132#true} is VALID [2018-11-23 12:26:57,630 INFO L273 TraceCheckUtils]: 123: Hoare triple {20132#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {20132#true} is VALID [2018-11-23 12:26:57,631 INFO L273 TraceCheckUtils]: 124: Hoare triple {20132#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {20132#true} is VALID [2018-11-23 12:26:57,631 INFO L273 TraceCheckUtils]: 125: Hoare triple {20132#true} assume !(~i~2 < 99999); {20132#true} is VALID [2018-11-23 12:26:57,631 INFO L273 TraceCheckUtils]: 126: Hoare triple {20132#true} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {20132#true} is VALID [2018-11-23 12:26:57,631 INFO L256 TraceCheckUtils]: 127: Hoare triple {20132#true} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {20132#true} is VALID [2018-11-23 12:26:57,631 INFO L273 TraceCheckUtils]: 128: Hoare triple {20132#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {20550#(<= bor_~i~0 1)} is VALID [2018-11-23 12:26:57,632 INFO L273 TraceCheckUtils]: 129: Hoare triple {20550#(<= bor_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20550#(<= bor_~i~0 1)} is VALID [2018-11-23 12:26:57,632 INFO L273 TraceCheckUtils]: 130: Hoare triple {20550#(<= bor_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20557#(<= bor_~i~0 2)} is VALID [2018-11-23 12:26:57,632 INFO L273 TraceCheckUtils]: 131: Hoare triple {20557#(<= bor_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20557#(<= bor_~i~0 2)} is VALID [2018-11-23 12:26:57,633 INFO L273 TraceCheckUtils]: 132: Hoare triple {20557#(<= bor_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20564#(<= bor_~i~0 3)} is VALID [2018-11-23 12:26:57,633 INFO L273 TraceCheckUtils]: 133: Hoare triple {20564#(<= bor_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20564#(<= bor_~i~0 3)} is VALID [2018-11-23 12:26:57,634 INFO L273 TraceCheckUtils]: 134: Hoare triple {20564#(<= bor_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20571#(<= bor_~i~0 4)} is VALID [2018-11-23 12:26:57,634 INFO L273 TraceCheckUtils]: 135: Hoare triple {20571#(<= bor_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20571#(<= bor_~i~0 4)} is VALID [2018-11-23 12:26:57,634 INFO L273 TraceCheckUtils]: 136: Hoare triple {20571#(<= bor_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20578#(<= bor_~i~0 5)} is VALID [2018-11-23 12:26:57,635 INFO L273 TraceCheckUtils]: 137: Hoare triple {20578#(<= bor_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20578#(<= bor_~i~0 5)} is VALID [2018-11-23 12:26:57,635 INFO L273 TraceCheckUtils]: 138: Hoare triple {20578#(<= bor_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20585#(<= bor_~i~0 6)} is VALID [2018-11-23 12:26:57,636 INFO L273 TraceCheckUtils]: 139: Hoare triple {20585#(<= bor_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20585#(<= bor_~i~0 6)} is VALID [2018-11-23 12:26:57,636 INFO L273 TraceCheckUtils]: 140: Hoare triple {20585#(<= bor_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20592#(<= bor_~i~0 7)} is VALID [2018-11-23 12:26:57,637 INFO L273 TraceCheckUtils]: 141: Hoare triple {20592#(<= bor_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20592#(<= bor_~i~0 7)} is VALID [2018-11-23 12:26:57,638 INFO L273 TraceCheckUtils]: 142: Hoare triple {20592#(<= bor_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20599#(<= bor_~i~0 8)} is VALID [2018-11-23 12:26:57,638 INFO L273 TraceCheckUtils]: 143: Hoare triple {20599#(<= bor_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {20599#(<= bor_~i~0 8)} is VALID [2018-11-23 12:26:57,639 INFO L273 TraceCheckUtils]: 144: Hoare triple {20599#(<= bor_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20606#(<= bor_~i~0 9)} is VALID [2018-11-23 12:26:57,640 INFO L273 TraceCheckUtils]: 145: Hoare triple {20606#(<= bor_~i~0 9)} assume !(~i~0 < 100000); {20133#false} is VALID [2018-11-23 12:26:57,640 INFO L273 TraceCheckUtils]: 146: Hoare triple {20133#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {20133#false} is VALID [2018-11-23 12:26:57,640 INFO L273 TraceCheckUtils]: 147: Hoare triple {20133#false} assume true; {20133#false} is VALID [2018-11-23 12:26:57,640 INFO L268 TraceCheckUtils]: 148: Hoare quadruple {20133#false} {20132#true} #74#return; {20133#false} is VALID [2018-11-23 12:26:57,640 INFO L273 TraceCheckUtils]: 149: Hoare triple {20133#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {20133#false} is VALID [2018-11-23 12:26:57,640 INFO L273 TraceCheckUtils]: 150: Hoare triple {20133#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {20133#false} is VALID [2018-11-23 12:26:57,641 INFO L273 TraceCheckUtils]: 151: Hoare triple {20133#false} assume !false; {20133#false} is VALID [2018-11-23 12:26:57,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1487 backedges. 296 proven. 64 refuted. 0 times theorem prover too weak. 1127 trivial. 0 not checked. [2018-11-23 12:26:57,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:57,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 11] total 40 [2018-11-23 12:26:57,672 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 152 [2018-11-23 12:26:57,672 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:57,672 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states. [2018-11-23 12:26:57,787 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:57,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-23 12:26:57,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-23 12:26:57,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=519, Invalid=1041, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 12:26:57,788 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand 40 states. [2018-11-23 12:26:58,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:58,349 INFO L93 Difference]: Finished difference Result 165 states and 177 transitions. [2018-11-23 12:26:58,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-23 12:26:58,350 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 152 [2018-11-23 12:26:58,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:58,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:26:58,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 132 transitions. [2018-11-23 12:26:58,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:26:58,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 132 transitions. [2018-11-23 12:26:58,352 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 132 transitions. [2018-11-23 12:26:58,477 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:26:58,480 INFO L225 Difference]: With dead ends: 165 [2018-11-23 12:26:58,480 INFO L226 Difference]: Without dead ends: 117 [2018-11-23 12:26:58,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=519, Invalid=1041, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 12:26:58,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-23 12:26:58,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-11-23 12:26:58,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:58,530 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand 115 states. [2018-11-23 12:26:58,531 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 115 states. [2018-11-23 12:26:58,531 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 115 states. [2018-11-23 12:26:58,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:58,533 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2018-11-23 12:26:58,533 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2018-11-23 12:26:58,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:58,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:58,533 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 117 states. [2018-11-23 12:26:58,533 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 117 states. [2018-11-23 12:26:58,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:58,535 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2018-11-23 12:26:58,535 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2018-11-23 12:26:58,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:58,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:58,536 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:58,536 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:58,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-23 12:26:58,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 119 transitions. [2018-11-23 12:26:58,537 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 119 transitions. Word has length 152 [2018-11-23 12:26:58,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:58,537 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 119 transitions. [2018-11-23 12:26:58,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-23 12:26:58,538 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2018-11-23 12:26:58,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-23 12:26:58,538 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:58,538 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 27, 27, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:26:58,539 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:58,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:58,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1573539069, now seen corresponding path program 29 times [2018-11-23 12:26:58,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:58,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:58,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:58,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:58,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:58,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:59,098 INFO L256 TraceCheckUtils]: 0: Hoare triple {21277#true} call ULTIMATE.init(); {21277#true} is VALID [2018-11-23 12:26:59,098 INFO L273 TraceCheckUtils]: 1: Hoare triple {21277#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21277#true} is VALID [2018-11-23 12:26:59,098 INFO L273 TraceCheckUtils]: 2: Hoare triple {21277#true} assume true; {21277#true} is VALID [2018-11-23 12:26:59,098 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21277#true} {21277#true} #66#return; {21277#true} is VALID [2018-11-23 12:26:59,099 INFO L256 TraceCheckUtils]: 4: Hoare triple {21277#true} call #t~ret13 := main(); {21277#true} is VALID [2018-11-23 12:26:59,099 INFO L273 TraceCheckUtils]: 5: Hoare triple {21277#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; {21279#(= main_~i~1 0)} is VALID [2018-11-23 12:26:59,100 INFO L273 TraceCheckUtils]: 6: Hoare triple {21279#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21279#(= main_~i~1 0)} is VALID [2018-11-23 12:26:59,100 INFO L273 TraceCheckUtils]: 7: Hoare triple {21279#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21280#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:59,101 INFO L273 TraceCheckUtils]: 8: Hoare triple {21280#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21280#(<= main_~i~1 1)} is VALID [2018-11-23 12:26:59,102 INFO L273 TraceCheckUtils]: 9: Hoare triple {21280#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21281#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:59,102 INFO L273 TraceCheckUtils]: 10: Hoare triple {21281#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21281#(<= main_~i~1 2)} is VALID [2018-11-23 12:26:59,102 INFO L273 TraceCheckUtils]: 11: Hoare triple {21281#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21282#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:59,103 INFO L273 TraceCheckUtils]: 12: Hoare triple {21282#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21282#(<= main_~i~1 3)} is VALID [2018-11-23 12:26:59,103 INFO L273 TraceCheckUtils]: 13: Hoare triple {21282#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21283#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:59,103 INFO L273 TraceCheckUtils]: 14: Hoare triple {21283#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21283#(<= main_~i~1 4)} is VALID [2018-11-23 12:26:59,104 INFO L273 TraceCheckUtils]: 15: Hoare triple {21283#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21284#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:59,104 INFO L273 TraceCheckUtils]: 16: Hoare triple {21284#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21284#(<= main_~i~1 5)} is VALID [2018-11-23 12:26:59,105 INFO L273 TraceCheckUtils]: 17: Hoare triple {21284#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21285#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:59,106 INFO L273 TraceCheckUtils]: 18: Hoare triple {21285#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21285#(<= main_~i~1 6)} is VALID [2018-11-23 12:26:59,106 INFO L273 TraceCheckUtils]: 19: Hoare triple {21285#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21286#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:59,107 INFO L273 TraceCheckUtils]: 20: Hoare triple {21286#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21286#(<= main_~i~1 7)} is VALID [2018-11-23 12:26:59,108 INFO L273 TraceCheckUtils]: 21: Hoare triple {21286#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21287#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:59,108 INFO L273 TraceCheckUtils]: 22: Hoare triple {21287#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21287#(<= main_~i~1 8)} is VALID [2018-11-23 12:26:59,109 INFO L273 TraceCheckUtils]: 23: Hoare triple {21287#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21288#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:59,109 INFO L273 TraceCheckUtils]: 24: Hoare triple {21288#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21288#(<= main_~i~1 9)} is VALID [2018-11-23 12:26:59,110 INFO L273 TraceCheckUtils]: 25: Hoare triple {21288#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21289#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:59,111 INFO L273 TraceCheckUtils]: 26: Hoare triple {21289#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21289#(<= main_~i~1 10)} is VALID [2018-11-23 12:26:59,111 INFO L273 TraceCheckUtils]: 27: Hoare triple {21289#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21290#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:59,112 INFO L273 TraceCheckUtils]: 28: Hoare triple {21290#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21290#(<= main_~i~1 11)} is VALID [2018-11-23 12:26:59,113 INFO L273 TraceCheckUtils]: 29: Hoare triple {21290#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21291#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:59,113 INFO L273 TraceCheckUtils]: 30: Hoare triple {21291#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21291#(<= main_~i~1 12)} is VALID [2018-11-23 12:26:59,114 INFO L273 TraceCheckUtils]: 31: Hoare triple {21291#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21292#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:59,114 INFO L273 TraceCheckUtils]: 32: Hoare triple {21292#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21292#(<= main_~i~1 13)} is VALID [2018-11-23 12:26:59,115 INFO L273 TraceCheckUtils]: 33: Hoare triple {21292#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21293#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:59,116 INFO L273 TraceCheckUtils]: 34: Hoare triple {21293#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21293#(<= main_~i~1 14)} is VALID [2018-11-23 12:26:59,116 INFO L273 TraceCheckUtils]: 35: Hoare triple {21293#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21294#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:59,117 INFO L273 TraceCheckUtils]: 36: Hoare triple {21294#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21294#(<= main_~i~1 15)} is VALID [2018-11-23 12:26:59,118 INFO L273 TraceCheckUtils]: 37: Hoare triple {21294#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21295#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:59,118 INFO L273 TraceCheckUtils]: 38: Hoare triple {21295#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21295#(<= main_~i~1 16)} is VALID [2018-11-23 12:26:59,119 INFO L273 TraceCheckUtils]: 39: Hoare triple {21295#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21296#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:59,119 INFO L273 TraceCheckUtils]: 40: Hoare triple {21296#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21296#(<= main_~i~1 17)} is VALID [2018-11-23 12:26:59,120 INFO L273 TraceCheckUtils]: 41: Hoare triple {21296#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21297#(<= main_~i~1 18)} is VALID [2018-11-23 12:26:59,121 INFO L273 TraceCheckUtils]: 42: Hoare triple {21297#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21297#(<= main_~i~1 18)} is VALID [2018-11-23 12:26:59,121 INFO L273 TraceCheckUtils]: 43: Hoare triple {21297#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21298#(<= main_~i~1 19)} is VALID [2018-11-23 12:26:59,122 INFO L273 TraceCheckUtils]: 44: Hoare triple {21298#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21298#(<= main_~i~1 19)} is VALID [2018-11-23 12:26:59,123 INFO L273 TraceCheckUtils]: 45: Hoare triple {21298#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21299#(<= main_~i~1 20)} is VALID [2018-11-23 12:26:59,123 INFO L273 TraceCheckUtils]: 46: Hoare triple {21299#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21299#(<= main_~i~1 20)} is VALID [2018-11-23 12:26:59,124 INFO L273 TraceCheckUtils]: 47: Hoare triple {21299#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21300#(<= main_~i~1 21)} is VALID [2018-11-23 12:26:59,124 INFO L273 TraceCheckUtils]: 48: Hoare triple {21300#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21300#(<= main_~i~1 21)} is VALID [2018-11-23 12:26:59,125 INFO L273 TraceCheckUtils]: 49: Hoare triple {21300#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21301#(<= main_~i~1 22)} is VALID [2018-11-23 12:26:59,126 INFO L273 TraceCheckUtils]: 50: Hoare triple {21301#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21301#(<= main_~i~1 22)} is VALID [2018-11-23 12:26:59,126 INFO L273 TraceCheckUtils]: 51: Hoare triple {21301#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21302#(<= main_~i~1 23)} is VALID [2018-11-23 12:26:59,127 INFO L273 TraceCheckUtils]: 52: Hoare triple {21302#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21302#(<= main_~i~1 23)} is VALID [2018-11-23 12:26:59,128 INFO L273 TraceCheckUtils]: 53: Hoare triple {21302#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21303#(<= main_~i~1 24)} is VALID [2018-11-23 12:26:59,128 INFO L273 TraceCheckUtils]: 54: Hoare triple {21303#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21303#(<= main_~i~1 24)} is VALID [2018-11-23 12:26:59,129 INFO L273 TraceCheckUtils]: 55: Hoare triple {21303#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21304#(<= main_~i~1 25)} is VALID [2018-11-23 12:26:59,129 INFO L273 TraceCheckUtils]: 56: Hoare triple {21304#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21304#(<= main_~i~1 25)} is VALID [2018-11-23 12:26:59,130 INFO L273 TraceCheckUtils]: 57: Hoare triple {21304#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21305#(<= main_~i~1 26)} is VALID [2018-11-23 12:26:59,131 INFO L273 TraceCheckUtils]: 58: Hoare triple {21305#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21305#(<= main_~i~1 26)} is VALID [2018-11-23 12:26:59,131 INFO L273 TraceCheckUtils]: 59: Hoare triple {21305#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21306#(<= main_~i~1 27)} is VALID [2018-11-23 12:26:59,132 INFO L273 TraceCheckUtils]: 60: Hoare triple {21306#(<= main_~i~1 27)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21306#(<= main_~i~1 27)} is VALID [2018-11-23 12:26:59,133 INFO L273 TraceCheckUtils]: 61: Hoare triple {21306#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21307#(<= main_~i~1 28)} is VALID [2018-11-23 12:26:59,133 INFO L273 TraceCheckUtils]: 62: Hoare triple {21307#(<= main_~i~1 28)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21307#(<= main_~i~1 28)} is VALID [2018-11-23 12:26:59,134 INFO L273 TraceCheckUtils]: 63: Hoare triple {21307#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21308#(<= main_~i~1 29)} is VALID [2018-11-23 12:26:59,134 INFO L273 TraceCheckUtils]: 64: Hoare triple {21308#(<= main_~i~1 29)} assume !(~i~1 < 100000); {21278#false} is VALID [2018-11-23 12:26:59,135 INFO L256 TraceCheckUtils]: 65: Hoare triple {21278#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {21277#true} is VALID [2018-11-23 12:26:59,135 INFO L273 TraceCheckUtils]: 66: Hoare triple {21277#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {21277#true} is VALID [2018-11-23 12:26:59,135 INFO L273 TraceCheckUtils]: 67: Hoare triple {21277#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:26:59,135 INFO L273 TraceCheckUtils]: 68: Hoare triple {21277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21277#true} is VALID [2018-11-23 12:26:59,135 INFO L273 TraceCheckUtils]: 69: Hoare triple {21277#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:26:59,136 INFO L273 TraceCheckUtils]: 70: Hoare triple {21277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21277#true} is VALID [2018-11-23 12:26:59,136 INFO L273 TraceCheckUtils]: 71: Hoare triple {21277#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:26:59,136 INFO L273 TraceCheckUtils]: 72: Hoare triple {21277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21277#true} is VALID [2018-11-23 12:26:59,136 INFO L273 TraceCheckUtils]: 73: Hoare triple {21277#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:26:59,136 INFO L273 TraceCheckUtils]: 74: Hoare triple {21277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21277#true} is VALID [2018-11-23 12:26:59,136 INFO L273 TraceCheckUtils]: 75: Hoare triple {21277#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:26:59,137 INFO L273 TraceCheckUtils]: 76: Hoare triple {21277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21277#true} is VALID [2018-11-23 12:26:59,137 INFO L273 TraceCheckUtils]: 77: Hoare triple {21277#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:26:59,137 INFO L273 TraceCheckUtils]: 78: Hoare triple {21277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21277#true} is VALID [2018-11-23 12:26:59,137 INFO L273 TraceCheckUtils]: 79: Hoare triple {21277#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:26:59,137 INFO L273 TraceCheckUtils]: 80: Hoare triple {21277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21277#true} is VALID [2018-11-23 12:26:59,137 INFO L273 TraceCheckUtils]: 81: Hoare triple {21277#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:26:59,138 INFO L273 TraceCheckUtils]: 82: Hoare triple {21277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21277#true} is VALID [2018-11-23 12:26:59,138 INFO L273 TraceCheckUtils]: 83: Hoare triple {21277#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:26:59,138 INFO L273 TraceCheckUtils]: 84: Hoare triple {21277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21277#true} is VALID [2018-11-23 12:26:59,138 INFO L273 TraceCheckUtils]: 85: Hoare triple {21277#true} assume !(~i~0 < 100000); {21277#true} is VALID [2018-11-23 12:26:59,138 INFO L273 TraceCheckUtils]: 86: Hoare triple {21277#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {21277#true} is VALID [2018-11-23 12:26:59,139 INFO L273 TraceCheckUtils]: 87: Hoare triple {21277#true} assume true; {21277#true} is VALID [2018-11-23 12:26:59,139 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {21277#true} {21278#false} #70#return; {21278#false} is VALID [2018-11-23 12:26:59,139 INFO L273 TraceCheckUtils]: 89: Hoare triple {21278#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {21278#false} is VALID [2018-11-23 12:26:59,139 INFO L256 TraceCheckUtils]: 90: Hoare triple {21278#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {21277#true} is VALID [2018-11-23 12:26:59,139 INFO L273 TraceCheckUtils]: 91: Hoare triple {21277#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {21277#true} is VALID [2018-11-23 12:26:59,139 INFO L273 TraceCheckUtils]: 92: Hoare triple {21277#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:26:59,140 INFO L273 TraceCheckUtils]: 93: Hoare triple {21277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21277#true} is VALID [2018-11-23 12:26:59,140 INFO L273 TraceCheckUtils]: 94: Hoare triple {21277#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:26:59,140 INFO L273 TraceCheckUtils]: 95: Hoare triple {21277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21277#true} is VALID [2018-11-23 12:26:59,140 INFO L273 TraceCheckUtils]: 96: Hoare triple {21277#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:26:59,140 INFO L273 TraceCheckUtils]: 97: Hoare triple {21277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21277#true} is VALID [2018-11-23 12:26:59,140 INFO L273 TraceCheckUtils]: 98: Hoare triple {21277#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:26:59,140 INFO L273 TraceCheckUtils]: 99: Hoare triple {21277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21277#true} is VALID [2018-11-23 12:26:59,140 INFO L273 TraceCheckUtils]: 100: Hoare triple {21277#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:26:59,140 INFO L273 TraceCheckUtils]: 101: Hoare triple {21277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21277#true} is VALID [2018-11-23 12:26:59,141 INFO L273 TraceCheckUtils]: 102: Hoare triple {21277#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:26:59,141 INFO L273 TraceCheckUtils]: 103: Hoare triple {21277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21277#true} is VALID [2018-11-23 12:26:59,141 INFO L273 TraceCheckUtils]: 104: Hoare triple {21277#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:26:59,141 INFO L273 TraceCheckUtils]: 105: Hoare triple {21277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21277#true} is VALID [2018-11-23 12:26:59,141 INFO L273 TraceCheckUtils]: 106: Hoare triple {21277#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:26:59,141 INFO L273 TraceCheckUtils]: 107: Hoare triple {21277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21277#true} is VALID [2018-11-23 12:26:59,141 INFO L273 TraceCheckUtils]: 108: Hoare triple {21277#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:26:59,141 INFO L273 TraceCheckUtils]: 109: Hoare triple {21277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21277#true} is VALID [2018-11-23 12:26:59,141 INFO L273 TraceCheckUtils]: 110: Hoare triple {21277#true} assume !(~i~0 < 100000); {21277#true} is VALID [2018-11-23 12:26:59,141 INFO L273 TraceCheckUtils]: 111: Hoare triple {21277#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {21277#true} is VALID [2018-11-23 12:26:59,142 INFO L273 TraceCheckUtils]: 112: Hoare triple {21277#true} assume true; {21277#true} is VALID [2018-11-23 12:26:59,142 INFO L268 TraceCheckUtils]: 113: Hoare quadruple {21277#true} {21278#false} #72#return; {21278#false} is VALID [2018-11-23 12:26:59,142 INFO L273 TraceCheckUtils]: 114: Hoare triple {21278#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {21278#false} is VALID [2018-11-23 12:26:59,142 INFO L273 TraceCheckUtils]: 115: Hoare triple {21278#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21278#false} is VALID [2018-11-23 12:26:59,142 INFO L273 TraceCheckUtils]: 116: Hoare triple {21278#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21278#false} is VALID [2018-11-23 12:26:59,142 INFO L273 TraceCheckUtils]: 117: Hoare triple {21278#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21278#false} is VALID [2018-11-23 12:26:59,142 INFO L273 TraceCheckUtils]: 118: Hoare triple {21278#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21278#false} is VALID [2018-11-23 12:26:59,142 INFO L273 TraceCheckUtils]: 119: Hoare triple {21278#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21278#false} is VALID [2018-11-23 12:26:59,142 INFO L273 TraceCheckUtils]: 120: Hoare triple {21278#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21278#false} is VALID [2018-11-23 12:26:59,143 INFO L273 TraceCheckUtils]: 121: Hoare triple {21278#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21278#false} is VALID [2018-11-23 12:26:59,143 INFO L273 TraceCheckUtils]: 122: Hoare triple {21278#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21278#false} is VALID [2018-11-23 12:26:59,143 INFO L273 TraceCheckUtils]: 123: Hoare triple {21278#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21278#false} is VALID [2018-11-23 12:26:59,143 INFO L273 TraceCheckUtils]: 124: Hoare triple {21278#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21278#false} is VALID [2018-11-23 12:26:59,143 INFO L273 TraceCheckUtils]: 125: Hoare triple {21278#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21278#false} is VALID [2018-11-23 12:26:59,143 INFO L273 TraceCheckUtils]: 126: Hoare triple {21278#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21278#false} is VALID [2018-11-23 12:26:59,143 INFO L273 TraceCheckUtils]: 127: Hoare triple {21278#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21278#false} is VALID [2018-11-23 12:26:59,143 INFO L273 TraceCheckUtils]: 128: Hoare triple {21278#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21278#false} is VALID [2018-11-23 12:26:59,143 INFO L273 TraceCheckUtils]: 129: Hoare triple {21278#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21278#false} is VALID [2018-11-23 12:26:59,143 INFO L273 TraceCheckUtils]: 130: Hoare triple {21278#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21278#false} is VALID [2018-11-23 12:26:59,144 INFO L273 TraceCheckUtils]: 131: Hoare triple {21278#false} assume !(~i~2 < 99999); {21278#false} is VALID [2018-11-23 12:26:59,144 INFO L273 TraceCheckUtils]: 132: Hoare triple {21278#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {21278#false} is VALID [2018-11-23 12:26:59,144 INFO L256 TraceCheckUtils]: 133: Hoare triple {21278#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {21277#true} is VALID [2018-11-23 12:26:59,144 INFO L273 TraceCheckUtils]: 134: Hoare triple {21277#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {21277#true} is VALID [2018-11-23 12:26:59,144 INFO L273 TraceCheckUtils]: 135: Hoare triple {21277#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:26:59,144 INFO L273 TraceCheckUtils]: 136: Hoare triple {21277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21277#true} is VALID [2018-11-23 12:26:59,144 INFO L273 TraceCheckUtils]: 137: Hoare triple {21277#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:26:59,144 INFO L273 TraceCheckUtils]: 138: Hoare triple {21277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21277#true} is VALID [2018-11-23 12:26:59,144 INFO L273 TraceCheckUtils]: 139: Hoare triple {21277#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:26:59,145 INFO L273 TraceCheckUtils]: 140: Hoare triple {21277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21277#true} is VALID [2018-11-23 12:26:59,145 INFO L273 TraceCheckUtils]: 141: Hoare triple {21277#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:26:59,145 INFO L273 TraceCheckUtils]: 142: Hoare triple {21277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21277#true} is VALID [2018-11-23 12:26:59,145 INFO L273 TraceCheckUtils]: 143: Hoare triple {21277#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:26:59,145 INFO L273 TraceCheckUtils]: 144: Hoare triple {21277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21277#true} is VALID [2018-11-23 12:26:59,145 INFO L273 TraceCheckUtils]: 145: Hoare triple {21277#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:26:59,145 INFO L273 TraceCheckUtils]: 146: Hoare triple {21277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21277#true} is VALID [2018-11-23 12:26:59,145 INFO L273 TraceCheckUtils]: 147: Hoare triple {21277#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:26:59,145 INFO L273 TraceCheckUtils]: 148: Hoare triple {21277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21277#true} is VALID [2018-11-23 12:26:59,145 INFO L273 TraceCheckUtils]: 149: Hoare triple {21277#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:26:59,146 INFO L273 TraceCheckUtils]: 150: Hoare triple {21277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21277#true} is VALID [2018-11-23 12:26:59,146 INFO L273 TraceCheckUtils]: 151: Hoare triple {21277#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:26:59,146 INFO L273 TraceCheckUtils]: 152: Hoare triple {21277#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21277#true} is VALID [2018-11-23 12:26:59,146 INFO L273 TraceCheckUtils]: 153: Hoare triple {21277#true} assume !(~i~0 < 100000); {21277#true} is VALID [2018-11-23 12:26:59,146 INFO L273 TraceCheckUtils]: 154: Hoare triple {21277#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {21277#true} is VALID [2018-11-23 12:26:59,146 INFO L273 TraceCheckUtils]: 155: Hoare triple {21277#true} assume true; {21277#true} is VALID [2018-11-23 12:26:59,146 INFO L268 TraceCheckUtils]: 156: Hoare quadruple {21277#true} {21278#false} #74#return; {21278#false} is VALID [2018-11-23 12:26:59,146 INFO L273 TraceCheckUtils]: 157: Hoare triple {21278#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {21278#false} is VALID [2018-11-23 12:26:59,146 INFO L273 TraceCheckUtils]: 158: Hoare triple {21278#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {21278#false} is VALID [2018-11-23 12:26:59,147 INFO L273 TraceCheckUtils]: 159: Hoare triple {21278#false} assume !false; {21278#false} is VALID [2018-11-23 12:26:59,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2018-11-23 12:26:59,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:59,158 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:26:59,170 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:27:20,829 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2018-11-23 12:27:20,829 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:20,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:20,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:21,192 INFO L256 TraceCheckUtils]: 0: Hoare triple {21277#true} call ULTIMATE.init(); {21277#true} is VALID [2018-11-23 12:27:21,192 INFO L273 TraceCheckUtils]: 1: Hoare triple {21277#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21277#true} is VALID [2018-11-23 12:27:21,193 INFO L273 TraceCheckUtils]: 2: Hoare triple {21277#true} assume true; {21277#true} is VALID [2018-11-23 12:27:21,193 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21277#true} {21277#true} #66#return; {21277#true} is VALID [2018-11-23 12:27:21,193 INFO L256 TraceCheckUtils]: 4: Hoare triple {21277#true} call #t~ret13 := main(); {21277#true} is VALID [2018-11-23 12:27:21,193 INFO L273 TraceCheckUtils]: 5: Hoare triple {21277#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; {21277#true} is VALID [2018-11-23 12:27:21,193 INFO L273 TraceCheckUtils]: 6: Hoare triple {21277#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:21,193 INFO L273 TraceCheckUtils]: 7: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:21,194 INFO L273 TraceCheckUtils]: 8: Hoare triple {21277#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:21,194 INFO L273 TraceCheckUtils]: 9: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:21,194 INFO L273 TraceCheckUtils]: 10: Hoare triple {21277#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:21,194 INFO L273 TraceCheckUtils]: 11: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:21,194 INFO L273 TraceCheckUtils]: 12: Hoare triple {21277#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:21,195 INFO L273 TraceCheckUtils]: 13: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:21,195 INFO L273 TraceCheckUtils]: 14: Hoare triple {21277#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:21,195 INFO L273 TraceCheckUtils]: 15: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:21,195 INFO L273 TraceCheckUtils]: 16: Hoare triple {21277#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:21,195 INFO L273 TraceCheckUtils]: 17: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:21,195 INFO L273 TraceCheckUtils]: 18: Hoare triple {21277#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:21,195 INFO L273 TraceCheckUtils]: 19: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:21,196 INFO L273 TraceCheckUtils]: 20: Hoare triple {21277#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:21,196 INFO L273 TraceCheckUtils]: 21: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:21,196 INFO L273 TraceCheckUtils]: 22: Hoare triple {21277#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:21,196 INFO L273 TraceCheckUtils]: 23: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:21,196 INFO L273 TraceCheckUtils]: 24: Hoare triple {21277#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:21,196 INFO L273 TraceCheckUtils]: 25: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:21,196 INFO L273 TraceCheckUtils]: 26: Hoare triple {21277#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:21,196 INFO L273 TraceCheckUtils]: 27: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:21,196 INFO L273 TraceCheckUtils]: 28: Hoare triple {21277#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:21,197 INFO L273 TraceCheckUtils]: 29: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:21,197 INFO L273 TraceCheckUtils]: 30: Hoare triple {21277#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:21,197 INFO L273 TraceCheckUtils]: 31: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:21,197 INFO L273 TraceCheckUtils]: 32: Hoare triple {21277#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:21,197 INFO L273 TraceCheckUtils]: 33: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:21,197 INFO L273 TraceCheckUtils]: 34: Hoare triple {21277#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:21,197 INFO L273 TraceCheckUtils]: 35: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:21,197 INFO L273 TraceCheckUtils]: 36: Hoare triple {21277#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:21,197 INFO L273 TraceCheckUtils]: 37: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:21,197 INFO L273 TraceCheckUtils]: 38: Hoare triple {21277#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:21,198 INFO L273 TraceCheckUtils]: 39: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:21,198 INFO L273 TraceCheckUtils]: 40: Hoare triple {21277#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:21,198 INFO L273 TraceCheckUtils]: 41: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:21,198 INFO L273 TraceCheckUtils]: 42: Hoare triple {21277#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:21,198 INFO L273 TraceCheckUtils]: 43: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:21,198 INFO L273 TraceCheckUtils]: 44: Hoare triple {21277#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:21,198 INFO L273 TraceCheckUtils]: 45: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:21,198 INFO L273 TraceCheckUtils]: 46: Hoare triple {21277#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:21,198 INFO L273 TraceCheckUtils]: 47: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:21,198 INFO L273 TraceCheckUtils]: 48: Hoare triple {21277#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:21,199 INFO L273 TraceCheckUtils]: 49: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:21,199 INFO L273 TraceCheckUtils]: 50: Hoare triple {21277#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:21,199 INFO L273 TraceCheckUtils]: 51: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:21,199 INFO L273 TraceCheckUtils]: 52: Hoare triple {21277#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:21,199 INFO L273 TraceCheckUtils]: 53: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:21,199 INFO L273 TraceCheckUtils]: 54: Hoare triple {21277#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:21,199 INFO L273 TraceCheckUtils]: 55: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:21,199 INFO L273 TraceCheckUtils]: 56: Hoare triple {21277#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:21,199 INFO L273 TraceCheckUtils]: 57: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:21,200 INFO L273 TraceCheckUtils]: 58: Hoare triple {21277#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:21,200 INFO L273 TraceCheckUtils]: 59: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:21,200 INFO L273 TraceCheckUtils]: 60: Hoare triple {21277#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:21,200 INFO L273 TraceCheckUtils]: 61: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:21,200 INFO L273 TraceCheckUtils]: 62: Hoare triple {21277#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {21277#true} is VALID [2018-11-23 12:27:21,200 INFO L273 TraceCheckUtils]: 63: Hoare triple {21277#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {21277#true} is VALID [2018-11-23 12:27:21,200 INFO L273 TraceCheckUtils]: 64: Hoare triple {21277#true} assume !(~i~1 < 100000); {21277#true} is VALID [2018-11-23 12:27:21,200 INFO L256 TraceCheckUtils]: 65: Hoare triple {21277#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {21277#true} is VALID [2018-11-23 12:27:21,201 INFO L273 TraceCheckUtils]: 66: Hoare triple {21277#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {21510#(<= bor_~i~0 1)} is VALID [2018-11-23 12:27:21,201 INFO L273 TraceCheckUtils]: 67: Hoare triple {21510#(<= bor_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21510#(<= bor_~i~0 1)} is VALID [2018-11-23 12:27:21,202 INFO L273 TraceCheckUtils]: 68: Hoare triple {21510#(<= bor_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21517#(<= bor_~i~0 2)} is VALID [2018-11-23 12:27:21,202 INFO L273 TraceCheckUtils]: 69: Hoare triple {21517#(<= bor_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21517#(<= bor_~i~0 2)} is VALID [2018-11-23 12:27:21,202 INFO L273 TraceCheckUtils]: 70: Hoare triple {21517#(<= bor_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21524#(<= bor_~i~0 3)} is VALID [2018-11-23 12:27:21,203 INFO L273 TraceCheckUtils]: 71: Hoare triple {21524#(<= bor_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21524#(<= bor_~i~0 3)} is VALID [2018-11-23 12:27:21,203 INFO L273 TraceCheckUtils]: 72: Hoare triple {21524#(<= bor_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21531#(<= bor_~i~0 4)} is VALID [2018-11-23 12:27:21,203 INFO L273 TraceCheckUtils]: 73: Hoare triple {21531#(<= bor_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21531#(<= bor_~i~0 4)} is VALID [2018-11-23 12:27:21,204 INFO L273 TraceCheckUtils]: 74: Hoare triple {21531#(<= bor_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21538#(<= bor_~i~0 5)} is VALID [2018-11-23 12:27:21,204 INFO L273 TraceCheckUtils]: 75: Hoare triple {21538#(<= bor_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21538#(<= bor_~i~0 5)} is VALID [2018-11-23 12:27:21,205 INFO L273 TraceCheckUtils]: 76: Hoare triple {21538#(<= bor_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21545#(<= bor_~i~0 6)} is VALID [2018-11-23 12:27:21,205 INFO L273 TraceCheckUtils]: 77: Hoare triple {21545#(<= bor_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21545#(<= bor_~i~0 6)} is VALID [2018-11-23 12:27:21,206 INFO L273 TraceCheckUtils]: 78: Hoare triple {21545#(<= bor_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21552#(<= bor_~i~0 7)} is VALID [2018-11-23 12:27:21,206 INFO L273 TraceCheckUtils]: 79: Hoare triple {21552#(<= bor_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21552#(<= bor_~i~0 7)} is VALID [2018-11-23 12:27:21,207 INFO L273 TraceCheckUtils]: 80: Hoare triple {21552#(<= bor_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21559#(<= bor_~i~0 8)} is VALID [2018-11-23 12:27:21,208 INFO L273 TraceCheckUtils]: 81: Hoare triple {21559#(<= bor_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21559#(<= bor_~i~0 8)} is VALID [2018-11-23 12:27:21,209 INFO L273 TraceCheckUtils]: 82: Hoare triple {21559#(<= bor_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21566#(<= bor_~i~0 9)} is VALID [2018-11-23 12:27:21,210 INFO L273 TraceCheckUtils]: 83: Hoare triple {21566#(<= bor_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21566#(<= bor_~i~0 9)} is VALID [2018-11-23 12:27:21,211 INFO L273 TraceCheckUtils]: 84: Hoare triple {21566#(<= bor_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21573#(<= bor_~i~0 10)} is VALID [2018-11-23 12:27:21,211 INFO L273 TraceCheckUtils]: 85: Hoare triple {21573#(<= bor_~i~0 10)} assume !(~i~0 < 100000); {21278#false} is VALID [2018-11-23 12:27:21,212 INFO L273 TraceCheckUtils]: 86: Hoare triple {21278#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {21278#false} is VALID [2018-11-23 12:27:21,212 INFO L273 TraceCheckUtils]: 87: Hoare triple {21278#false} assume true; {21278#false} is VALID [2018-11-23 12:27:21,212 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {21278#false} {21277#true} #70#return; {21278#false} is VALID [2018-11-23 12:27:21,213 INFO L273 TraceCheckUtils]: 89: Hoare triple {21278#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {21278#false} is VALID [2018-11-23 12:27:21,213 INFO L256 TraceCheckUtils]: 90: Hoare triple {21278#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {21278#false} is VALID [2018-11-23 12:27:21,213 INFO L273 TraceCheckUtils]: 91: Hoare triple {21278#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {21278#false} is VALID [2018-11-23 12:27:21,213 INFO L273 TraceCheckUtils]: 92: Hoare triple {21278#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21278#false} is VALID [2018-11-23 12:27:21,213 INFO L273 TraceCheckUtils]: 93: Hoare triple {21278#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21278#false} is VALID [2018-11-23 12:27:21,214 INFO L273 TraceCheckUtils]: 94: Hoare triple {21278#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21278#false} is VALID [2018-11-23 12:27:21,214 INFO L273 TraceCheckUtils]: 95: Hoare triple {21278#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21278#false} is VALID [2018-11-23 12:27:21,214 INFO L273 TraceCheckUtils]: 96: Hoare triple {21278#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21278#false} is VALID [2018-11-23 12:27:21,214 INFO L273 TraceCheckUtils]: 97: Hoare triple {21278#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21278#false} is VALID [2018-11-23 12:27:21,214 INFO L273 TraceCheckUtils]: 98: Hoare triple {21278#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21278#false} is VALID [2018-11-23 12:27:21,214 INFO L273 TraceCheckUtils]: 99: Hoare triple {21278#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21278#false} is VALID [2018-11-23 12:27:21,215 INFO L273 TraceCheckUtils]: 100: Hoare triple {21278#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21278#false} is VALID [2018-11-23 12:27:21,215 INFO L273 TraceCheckUtils]: 101: Hoare triple {21278#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21278#false} is VALID [2018-11-23 12:27:21,215 INFO L273 TraceCheckUtils]: 102: Hoare triple {21278#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21278#false} is VALID [2018-11-23 12:27:21,215 INFO L273 TraceCheckUtils]: 103: Hoare triple {21278#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21278#false} is VALID [2018-11-23 12:27:21,215 INFO L273 TraceCheckUtils]: 104: Hoare triple {21278#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21278#false} is VALID [2018-11-23 12:27:21,215 INFO L273 TraceCheckUtils]: 105: Hoare triple {21278#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21278#false} is VALID [2018-11-23 12:27:21,216 INFO L273 TraceCheckUtils]: 106: Hoare triple {21278#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21278#false} is VALID [2018-11-23 12:27:21,216 INFO L273 TraceCheckUtils]: 107: Hoare triple {21278#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21278#false} is VALID [2018-11-23 12:27:21,216 INFO L273 TraceCheckUtils]: 108: Hoare triple {21278#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21278#false} is VALID [2018-11-23 12:27:21,216 INFO L273 TraceCheckUtils]: 109: Hoare triple {21278#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21278#false} is VALID [2018-11-23 12:27:21,216 INFO L273 TraceCheckUtils]: 110: Hoare triple {21278#false} assume !(~i~0 < 100000); {21278#false} is VALID [2018-11-23 12:27:21,216 INFO L273 TraceCheckUtils]: 111: Hoare triple {21278#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {21278#false} is VALID [2018-11-23 12:27:21,216 INFO L273 TraceCheckUtils]: 112: Hoare triple {21278#false} assume true; {21278#false} is VALID [2018-11-23 12:27:21,216 INFO L268 TraceCheckUtils]: 113: Hoare quadruple {21278#false} {21278#false} #72#return; {21278#false} is VALID [2018-11-23 12:27:21,216 INFO L273 TraceCheckUtils]: 114: Hoare triple {21278#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {21278#false} is VALID [2018-11-23 12:27:21,216 INFO L273 TraceCheckUtils]: 115: Hoare triple {21278#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21278#false} is VALID [2018-11-23 12:27:21,217 INFO L273 TraceCheckUtils]: 116: Hoare triple {21278#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21278#false} is VALID [2018-11-23 12:27:21,217 INFO L273 TraceCheckUtils]: 117: Hoare triple {21278#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21278#false} is VALID [2018-11-23 12:27:21,217 INFO L273 TraceCheckUtils]: 118: Hoare triple {21278#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21278#false} is VALID [2018-11-23 12:27:21,217 INFO L273 TraceCheckUtils]: 119: Hoare triple {21278#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21278#false} is VALID [2018-11-23 12:27:21,217 INFO L273 TraceCheckUtils]: 120: Hoare triple {21278#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21278#false} is VALID [2018-11-23 12:27:21,217 INFO L273 TraceCheckUtils]: 121: Hoare triple {21278#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21278#false} is VALID [2018-11-23 12:27:21,217 INFO L273 TraceCheckUtils]: 122: Hoare triple {21278#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21278#false} is VALID [2018-11-23 12:27:21,217 INFO L273 TraceCheckUtils]: 123: Hoare triple {21278#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21278#false} is VALID [2018-11-23 12:27:21,217 INFO L273 TraceCheckUtils]: 124: Hoare triple {21278#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21278#false} is VALID [2018-11-23 12:27:21,218 INFO L273 TraceCheckUtils]: 125: Hoare triple {21278#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21278#false} is VALID [2018-11-23 12:27:21,218 INFO L273 TraceCheckUtils]: 126: Hoare triple {21278#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21278#false} is VALID [2018-11-23 12:27:21,218 INFO L273 TraceCheckUtils]: 127: Hoare triple {21278#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21278#false} is VALID [2018-11-23 12:27:21,218 INFO L273 TraceCheckUtils]: 128: Hoare triple {21278#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21278#false} is VALID [2018-11-23 12:27:21,218 INFO L273 TraceCheckUtils]: 129: Hoare triple {21278#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {21278#false} is VALID [2018-11-23 12:27:21,218 INFO L273 TraceCheckUtils]: 130: Hoare triple {21278#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {21278#false} is VALID [2018-11-23 12:27:21,218 INFO L273 TraceCheckUtils]: 131: Hoare triple {21278#false} assume !(~i~2 < 99999); {21278#false} is VALID [2018-11-23 12:27:21,218 INFO L273 TraceCheckUtils]: 132: Hoare triple {21278#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {21278#false} is VALID [2018-11-23 12:27:21,218 INFO L256 TraceCheckUtils]: 133: Hoare triple {21278#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {21278#false} is VALID [2018-11-23 12:27:21,218 INFO L273 TraceCheckUtils]: 134: Hoare triple {21278#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {21278#false} is VALID [2018-11-23 12:27:21,219 INFO L273 TraceCheckUtils]: 135: Hoare triple {21278#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21278#false} is VALID [2018-11-23 12:27:21,219 INFO L273 TraceCheckUtils]: 136: Hoare triple {21278#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21278#false} is VALID [2018-11-23 12:27:21,219 INFO L273 TraceCheckUtils]: 137: Hoare triple {21278#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21278#false} is VALID [2018-11-23 12:27:21,219 INFO L273 TraceCheckUtils]: 138: Hoare triple {21278#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21278#false} is VALID [2018-11-23 12:27:21,219 INFO L273 TraceCheckUtils]: 139: Hoare triple {21278#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21278#false} is VALID [2018-11-23 12:27:21,219 INFO L273 TraceCheckUtils]: 140: Hoare triple {21278#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21278#false} is VALID [2018-11-23 12:27:21,219 INFO L273 TraceCheckUtils]: 141: Hoare triple {21278#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21278#false} is VALID [2018-11-23 12:27:21,219 INFO L273 TraceCheckUtils]: 142: Hoare triple {21278#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21278#false} is VALID [2018-11-23 12:27:21,219 INFO L273 TraceCheckUtils]: 143: Hoare triple {21278#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21278#false} is VALID [2018-11-23 12:27:21,219 INFO L273 TraceCheckUtils]: 144: Hoare triple {21278#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21278#false} is VALID [2018-11-23 12:27:21,220 INFO L273 TraceCheckUtils]: 145: Hoare triple {21278#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21278#false} is VALID [2018-11-23 12:27:21,220 INFO L273 TraceCheckUtils]: 146: Hoare triple {21278#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21278#false} is VALID [2018-11-23 12:27:21,220 INFO L273 TraceCheckUtils]: 147: Hoare triple {21278#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21278#false} is VALID [2018-11-23 12:27:21,220 INFO L273 TraceCheckUtils]: 148: Hoare triple {21278#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21278#false} is VALID [2018-11-23 12:27:21,220 INFO L273 TraceCheckUtils]: 149: Hoare triple {21278#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21278#false} is VALID [2018-11-23 12:27:21,220 INFO L273 TraceCheckUtils]: 150: Hoare triple {21278#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21278#false} is VALID [2018-11-23 12:27:21,220 INFO L273 TraceCheckUtils]: 151: Hoare triple {21278#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {21278#false} is VALID [2018-11-23 12:27:21,220 INFO L273 TraceCheckUtils]: 152: Hoare triple {21278#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21278#false} is VALID [2018-11-23 12:27:21,220 INFO L273 TraceCheckUtils]: 153: Hoare triple {21278#false} assume !(~i~0 < 100000); {21278#false} is VALID [2018-11-23 12:27:21,220 INFO L273 TraceCheckUtils]: 154: Hoare triple {21278#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {21278#false} is VALID [2018-11-23 12:27:21,221 INFO L273 TraceCheckUtils]: 155: Hoare triple {21278#false} assume true; {21278#false} is VALID [2018-11-23 12:27:21,221 INFO L268 TraceCheckUtils]: 156: Hoare quadruple {21278#false} {21278#false} #74#return; {21278#false} is VALID [2018-11-23 12:27:21,221 INFO L273 TraceCheckUtils]: 157: Hoare triple {21278#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {21278#false} is VALID [2018-11-23 12:27:21,221 INFO L273 TraceCheckUtils]: 158: Hoare triple {21278#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {21278#false} is VALID [2018-11-23 12:27:21,221 INFO L273 TraceCheckUtils]: 159: Hoare triple {21278#false} assume !false; {21278#false} is VALID [2018-11-23 12:27:21,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 364 proven. 81 refuted. 0 times theorem prover too weak. 1258 trivial. 0 not checked. [2018-11-23 12:27:21,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:21,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 12] total 42 [2018-11-23 12:27:21,256 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 160 [2018-11-23 12:27:21,257 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:21,257 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 12:27:21,384 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:21,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 12:27:21,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 12:27:21,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=1161, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:27:21,386 INFO L87 Difference]: Start difference. First operand 115 states and 119 transitions. Second operand 42 states. [2018-11-23 12:27:22,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:22,340 INFO L93 Difference]: Finished difference Result 171 states and 183 transitions. [2018-11-23 12:27:22,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-23 12:27:22,340 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 160 [2018-11-23 12:27:22,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:22,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:27:22,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 136 transitions. [2018-11-23 12:27:22,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:27:22,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 136 transitions. [2018-11-23 12:27:22,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 136 transitions. [2018-11-23 12:27:22,471 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:22,474 INFO L225 Difference]: With dead ends: 171 [2018-11-23 12:27:22,474 INFO L226 Difference]: Without dead ends: 121 [2018-11-23 12:27:22,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=1161, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:27:22,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-23 12:27:22,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-11-23 12:27:22,523 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:22,523 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand 119 states. [2018-11-23 12:27:22,523 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 119 states. [2018-11-23 12:27:22,524 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 119 states. [2018-11-23 12:27:22,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:22,527 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2018-11-23 12:27:22,527 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2018-11-23 12:27:22,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:22,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:22,527 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 121 states. [2018-11-23 12:27:22,528 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 121 states. [2018-11-23 12:27:22,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:22,530 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2018-11-23 12:27:22,530 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2018-11-23 12:27:22,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:22,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:22,530 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:22,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:22,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-23 12:27:22,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2018-11-23 12:27:22,532 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 160 [2018-11-23 12:27:22,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:22,533 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2018-11-23 12:27:22,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 12:27:22,533 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2018-11-23 12:27:22,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-23 12:27:22,534 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:22,534 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:27:22,534 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:22,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:22,535 INFO L82 PathProgramCache]: Analyzing trace with hash -451694749, now seen corresponding path program 30 times [2018-11-23 12:27:22,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:22,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:22,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:22,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:22,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:22,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:23,279 INFO L256 TraceCheckUtils]: 0: Hoare triple {22471#true} call ULTIMATE.init(); {22471#true} is VALID [2018-11-23 12:27:23,279 INFO L273 TraceCheckUtils]: 1: Hoare triple {22471#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22471#true} is VALID [2018-11-23 12:27:23,280 INFO L273 TraceCheckUtils]: 2: Hoare triple {22471#true} assume true; {22471#true} is VALID [2018-11-23 12:27:23,280 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22471#true} {22471#true} #66#return; {22471#true} is VALID [2018-11-23 12:27:23,280 INFO L256 TraceCheckUtils]: 4: Hoare triple {22471#true} call #t~ret13 := main(); {22471#true} is VALID [2018-11-23 12:27:23,280 INFO L273 TraceCheckUtils]: 5: Hoare triple {22471#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; {22473#(= main_~i~1 0)} is VALID [2018-11-23 12:27:23,280 INFO L273 TraceCheckUtils]: 6: Hoare triple {22473#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22473#(= main_~i~1 0)} is VALID [2018-11-23 12:27:23,281 INFO L273 TraceCheckUtils]: 7: Hoare triple {22473#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22474#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:23,282 INFO L273 TraceCheckUtils]: 8: Hoare triple {22474#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22474#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:23,282 INFO L273 TraceCheckUtils]: 9: Hoare triple {22474#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22475#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:23,283 INFO L273 TraceCheckUtils]: 10: Hoare triple {22475#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22475#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:23,283 INFO L273 TraceCheckUtils]: 11: Hoare triple {22475#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22476#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:23,284 INFO L273 TraceCheckUtils]: 12: Hoare triple {22476#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22476#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:23,285 INFO L273 TraceCheckUtils]: 13: Hoare triple {22476#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22477#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:23,285 INFO L273 TraceCheckUtils]: 14: Hoare triple {22477#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22477#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:23,286 INFO L273 TraceCheckUtils]: 15: Hoare triple {22477#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22478#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:23,286 INFO L273 TraceCheckUtils]: 16: Hoare triple {22478#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22478#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:23,287 INFO L273 TraceCheckUtils]: 17: Hoare triple {22478#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22479#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:23,287 INFO L273 TraceCheckUtils]: 18: Hoare triple {22479#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22479#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:23,288 INFO L273 TraceCheckUtils]: 19: Hoare triple {22479#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22480#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:23,289 INFO L273 TraceCheckUtils]: 20: Hoare triple {22480#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22480#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:23,289 INFO L273 TraceCheckUtils]: 21: Hoare triple {22480#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22481#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:23,290 INFO L273 TraceCheckUtils]: 22: Hoare triple {22481#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22481#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:23,290 INFO L273 TraceCheckUtils]: 23: Hoare triple {22481#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22482#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:23,291 INFO L273 TraceCheckUtils]: 24: Hoare triple {22482#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22482#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:23,292 INFO L273 TraceCheckUtils]: 25: Hoare triple {22482#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22483#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:23,292 INFO L273 TraceCheckUtils]: 26: Hoare triple {22483#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22483#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:23,293 INFO L273 TraceCheckUtils]: 27: Hoare triple {22483#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22484#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:23,293 INFO L273 TraceCheckUtils]: 28: Hoare triple {22484#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22484#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:23,294 INFO L273 TraceCheckUtils]: 29: Hoare triple {22484#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22485#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:23,294 INFO L273 TraceCheckUtils]: 30: Hoare triple {22485#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22485#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:23,295 INFO L273 TraceCheckUtils]: 31: Hoare triple {22485#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22486#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:23,295 INFO L273 TraceCheckUtils]: 32: Hoare triple {22486#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22486#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:23,296 INFO L273 TraceCheckUtils]: 33: Hoare triple {22486#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22487#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:23,297 INFO L273 TraceCheckUtils]: 34: Hoare triple {22487#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22487#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:23,297 INFO L273 TraceCheckUtils]: 35: Hoare triple {22487#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22488#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:23,298 INFO L273 TraceCheckUtils]: 36: Hoare triple {22488#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22488#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:23,299 INFO L273 TraceCheckUtils]: 37: Hoare triple {22488#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22489#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:23,299 INFO L273 TraceCheckUtils]: 38: Hoare triple {22489#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22489#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:23,300 INFO L273 TraceCheckUtils]: 39: Hoare triple {22489#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22490#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:23,300 INFO L273 TraceCheckUtils]: 40: Hoare triple {22490#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22490#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:23,301 INFO L273 TraceCheckUtils]: 41: Hoare triple {22490#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22491#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:23,301 INFO L273 TraceCheckUtils]: 42: Hoare triple {22491#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22491#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:23,302 INFO L273 TraceCheckUtils]: 43: Hoare triple {22491#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22492#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:23,302 INFO L273 TraceCheckUtils]: 44: Hoare triple {22492#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22492#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:23,303 INFO L273 TraceCheckUtils]: 45: Hoare triple {22492#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22493#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:23,304 INFO L273 TraceCheckUtils]: 46: Hoare triple {22493#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22493#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:23,304 INFO L273 TraceCheckUtils]: 47: Hoare triple {22493#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22494#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:23,305 INFO L273 TraceCheckUtils]: 48: Hoare triple {22494#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22494#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:23,306 INFO L273 TraceCheckUtils]: 49: Hoare triple {22494#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22495#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:23,306 INFO L273 TraceCheckUtils]: 50: Hoare triple {22495#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22495#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:23,307 INFO L273 TraceCheckUtils]: 51: Hoare triple {22495#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22496#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:23,307 INFO L273 TraceCheckUtils]: 52: Hoare triple {22496#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22496#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:23,308 INFO L273 TraceCheckUtils]: 53: Hoare triple {22496#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22497#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:23,308 INFO L273 TraceCheckUtils]: 54: Hoare triple {22497#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22497#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:23,309 INFO L273 TraceCheckUtils]: 55: Hoare triple {22497#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22498#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:23,310 INFO L273 TraceCheckUtils]: 56: Hoare triple {22498#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22498#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:23,310 INFO L273 TraceCheckUtils]: 57: Hoare triple {22498#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22499#(<= main_~i~1 26)} is VALID [2018-11-23 12:27:23,311 INFO L273 TraceCheckUtils]: 58: Hoare triple {22499#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22499#(<= main_~i~1 26)} is VALID [2018-11-23 12:27:23,311 INFO L273 TraceCheckUtils]: 59: Hoare triple {22499#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22500#(<= main_~i~1 27)} is VALID [2018-11-23 12:27:23,312 INFO L273 TraceCheckUtils]: 60: Hoare triple {22500#(<= main_~i~1 27)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22500#(<= main_~i~1 27)} is VALID [2018-11-23 12:27:23,312 INFO L273 TraceCheckUtils]: 61: Hoare triple {22500#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22501#(<= main_~i~1 28)} is VALID [2018-11-23 12:27:23,313 INFO L273 TraceCheckUtils]: 62: Hoare triple {22501#(<= main_~i~1 28)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22501#(<= main_~i~1 28)} is VALID [2018-11-23 12:27:23,314 INFO L273 TraceCheckUtils]: 63: Hoare triple {22501#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22502#(<= main_~i~1 29)} is VALID [2018-11-23 12:27:23,314 INFO L273 TraceCheckUtils]: 64: Hoare triple {22502#(<= main_~i~1 29)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22502#(<= main_~i~1 29)} is VALID [2018-11-23 12:27:23,315 INFO L273 TraceCheckUtils]: 65: Hoare triple {22502#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22503#(<= main_~i~1 30)} is VALID [2018-11-23 12:27:23,315 INFO L273 TraceCheckUtils]: 66: Hoare triple {22503#(<= main_~i~1 30)} assume !(~i~1 < 100000); {22472#false} is VALID [2018-11-23 12:27:23,316 INFO L256 TraceCheckUtils]: 67: Hoare triple {22472#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {22471#true} is VALID [2018-11-23 12:27:23,316 INFO L273 TraceCheckUtils]: 68: Hoare triple {22471#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {22471#true} is VALID [2018-11-23 12:27:23,316 INFO L273 TraceCheckUtils]: 69: Hoare triple {22471#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:23,316 INFO L273 TraceCheckUtils]: 70: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:23,316 INFO L273 TraceCheckUtils]: 71: Hoare triple {22471#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:23,316 INFO L273 TraceCheckUtils]: 72: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:23,317 INFO L273 TraceCheckUtils]: 73: Hoare triple {22471#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:23,317 INFO L273 TraceCheckUtils]: 74: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:23,317 INFO L273 TraceCheckUtils]: 75: Hoare triple {22471#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:23,317 INFO L273 TraceCheckUtils]: 76: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:23,317 INFO L273 TraceCheckUtils]: 77: Hoare triple {22471#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:23,317 INFO L273 TraceCheckUtils]: 78: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:23,318 INFO L273 TraceCheckUtils]: 79: Hoare triple {22471#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:23,318 INFO L273 TraceCheckUtils]: 80: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:23,318 INFO L273 TraceCheckUtils]: 81: Hoare triple {22471#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:23,318 INFO L273 TraceCheckUtils]: 82: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:23,318 INFO L273 TraceCheckUtils]: 83: Hoare triple {22471#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:23,318 INFO L273 TraceCheckUtils]: 84: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:23,319 INFO L273 TraceCheckUtils]: 85: Hoare triple {22471#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:23,319 INFO L273 TraceCheckUtils]: 86: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:23,319 INFO L273 TraceCheckUtils]: 87: Hoare triple {22471#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:23,319 INFO L273 TraceCheckUtils]: 88: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:23,319 INFO L273 TraceCheckUtils]: 89: Hoare triple {22471#true} assume !(~i~0 < 100000); {22471#true} is VALID [2018-11-23 12:27:23,319 INFO L273 TraceCheckUtils]: 90: Hoare triple {22471#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {22471#true} is VALID [2018-11-23 12:27:23,320 INFO L273 TraceCheckUtils]: 91: Hoare triple {22471#true} assume true; {22471#true} is VALID [2018-11-23 12:27:23,320 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {22471#true} {22472#false} #70#return; {22472#false} is VALID [2018-11-23 12:27:23,320 INFO L273 TraceCheckUtils]: 93: Hoare triple {22472#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {22472#false} is VALID [2018-11-23 12:27:23,320 INFO L256 TraceCheckUtils]: 94: Hoare triple {22472#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {22471#true} is VALID [2018-11-23 12:27:23,320 INFO L273 TraceCheckUtils]: 95: Hoare triple {22471#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {22471#true} is VALID [2018-11-23 12:27:23,320 INFO L273 TraceCheckUtils]: 96: Hoare triple {22471#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:23,320 INFO L273 TraceCheckUtils]: 97: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:23,320 INFO L273 TraceCheckUtils]: 98: Hoare triple {22471#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:23,320 INFO L273 TraceCheckUtils]: 99: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:23,320 INFO L273 TraceCheckUtils]: 100: Hoare triple {22471#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:23,321 INFO L273 TraceCheckUtils]: 101: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:23,321 INFO L273 TraceCheckUtils]: 102: Hoare triple {22471#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:23,321 INFO L273 TraceCheckUtils]: 103: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:23,321 INFO L273 TraceCheckUtils]: 104: Hoare triple {22471#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:23,321 INFO L273 TraceCheckUtils]: 105: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:23,321 INFO L273 TraceCheckUtils]: 106: Hoare triple {22471#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:23,321 INFO L273 TraceCheckUtils]: 107: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:23,321 INFO L273 TraceCheckUtils]: 108: Hoare triple {22471#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:23,321 INFO L273 TraceCheckUtils]: 109: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:23,321 INFO L273 TraceCheckUtils]: 110: Hoare triple {22471#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:23,322 INFO L273 TraceCheckUtils]: 111: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:23,322 INFO L273 TraceCheckUtils]: 112: Hoare triple {22471#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:23,322 INFO L273 TraceCheckUtils]: 113: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:23,322 INFO L273 TraceCheckUtils]: 114: Hoare triple {22471#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:23,322 INFO L273 TraceCheckUtils]: 115: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:23,322 INFO L273 TraceCheckUtils]: 116: Hoare triple {22471#true} assume !(~i~0 < 100000); {22471#true} is VALID [2018-11-23 12:27:23,322 INFO L273 TraceCheckUtils]: 117: Hoare triple {22471#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {22471#true} is VALID [2018-11-23 12:27:23,322 INFO L273 TraceCheckUtils]: 118: Hoare triple {22471#true} assume true; {22471#true} is VALID [2018-11-23 12:27:23,322 INFO L268 TraceCheckUtils]: 119: Hoare quadruple {22471#true} {22472#false} #72#return; {22472#false} is VALID [2018-11-23 12:27:23,322 INFO L273 TraceCheckUtils]: 120: Hoare triple {22472#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {22472#false} is VALID [2018-11-23 12:27:23,323 INFO L273 TraceCheckUtils]: 121: Hoare triple {22472#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22472#false} is VALID [2018-11-23 12:27:23,323 INFO L273 TraceCheckUtils]: 122: Hoare triple {22472#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22472#false} is VALID [2018-11-23 12:27:23,323 INFO L273 TraceCheckUtils]: 123: Hoare triple {22472#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22472#false} is VALID [2018-11-23 12:27:23,323 INFO L273 TraceCheckUtils]: 124: Hoare triple {22472#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22472#false} is VALID [2018-11-23 12:27:23,323 INFO L273 TraceCheckUtils]: 125: Hoare triple {22472#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22472#false} is VALID [2018-11-23 12:27:23,323 INFO L273 TraceCheckUtils]: 126: Hoare triple {22472#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22472#false} is VALID [2018-11-23 12:27:23,323 INFO L273 TraceCheckUtils]: 127: Hoare triple {22472#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22472#false} is VALID [2018-11-23 12:27:23,323 INFO L273 TraceCheckUtils]: 128: Hoare triple {22472#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22472#false} is VALID [2018-11-23 12:27:23,323 INFO L273 TraceCheckUtils]: 129: Hoare triple {22472#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22472#false} is VALID [2018-11-23 12:27:23,324 INFO L273 TraceCheckUtils]: 130: Hoare triple {22472#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22472#false} is VALID [2018-11-23 12:27:23,324 INFO L273 TraceCheckUtils]: 131: Hoare triple {22472#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22472#false} is VALID [2018-11-23 12:27:23,324 INFO L273 TraceCheckUtils]: 132: Hoare triple {22472#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22472#false} is VALID [2018-11-23 12:27:23,324 INFO L273 TraceCheckUtils]: 133: Hoare triple {22472#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22472#false} is VALID [2018-11-23 12:27:23,324 INFO L273 TraceCheckUtils]: 134: Hoare triple {22472#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22472#false} is VALID [2018-11-23 12:27:23,324 INFO L273 TraceCheckUtils]: 135: Hoare triple {22472#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22472#false} is VALID [2018-11-23 12:27:23,324 INFO L273 TraceCheckUtils]: 136: Hoare triple {22472#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22472#false} is VALID [2018-11-23 12:27:23,324 INFO L273 TraceCheckUtils]: 137: Hoare triple {22472#false} assume !(~i~2 < 99999); {22472#false} is VALID [2018-11-23 12:27:23,324 INFO L273 TraceCheckUtils]: 138: Hoare triple {22472#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {22472#false} is VALID [2018-11-23 12:27:23,324 INFO L256 TraceCheckUtils]: 139: Hoare triple {22472#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {22471#true} is VALID [2018-11-23 12:27:23,325 INFO L273 TraceCheckUtils]: 140: Hoare triple {22471#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {22471#true} is VALID [2018-11-23 12:27:23,325 INFO L273 TraceCheckUtils]: 141: Hoare triple {22471#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:23,325 INFO L273 TraceCheckUtils]: 142: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:23,325 INFO L273 TraceCheckUtils]: 143: Hoare triple {22471#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:23,325 INFO L273 TraceCheckUtils]: 144: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:23,325 INFO L273 TraceCheckUtils]: 145: Hoare triple {22471#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:23,325 INFO L273 TraceCheckUtils]: 146: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:23,325 INFO L273 TraceCheckUtils]: 147: Hoare triple {22471#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:23,325 INFO L273 TraceCheckUtils]: 148: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:23,325 INFO L273 TraceCheckUtils]: 149: Hoare triple {22471#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:23,326 INFO L273 TraceCheckUtils]: 150: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:23,326 INFO L273 TraceCheckUtils]: 151: Hoare triple {22471#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:23,326 INFO L273 TraceCheckUtils]: 152: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:23,326 INFO L273 TraceCheckUtils]: 153: Hoare triple {22471#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:23,326 INFO L273 TraceCheckUtils]: 154: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:23,326 INFO L273 TraceCheckUtils]: 155: Hoare triple {22471#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:23,326 INFO L273 TraceCheckUtils]: 156: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:23,326 INFO L273 TraceCheckUtils]: 157: Hoare triple {22471#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:23,326 INFO L273 TraceCheckUtils]: 158: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:23,326 INFO L273 TraceCheckUtils]: 159: Hoare triple {22471#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:23,327 INFO L273 TraceCheckUtils]: 160: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:23,327 INFO L273 TraceCheckUtils]: 161: Hoare triple {22471#true} assume !(~i~0 < 100000); {22471#true} is VALID [2018-11-23 12:27:23,327 INFO L273 TraceCheckUtils]: 162: Hoare triple {22471#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {22471#true} is VALID [2018-11-23 12:27:23,327 INFO L273 TraceCheckUtils]: 163: Hoare triple {22471#true} assume true; {22471#true} is VALID [2018-11-23 12:27:23,327 INFO L268 TraceCheckUtils]: 164: Hoare quadruple {22471#true} {22472#false} #74#return; {22472#false} is VALID [2018-11-23 12:27:23,327 INFO L273 TraceCheckUtils]: 165: Hoare triple {22472#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {22472#false} is VALID [2018-11-23 12:27:23,327 INFO L273 TraceCheckUtils]: 166: Hoare triple {22472#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {22472#false} is VALID [2018-11-23 12:27:23,327 INFO L273 TraceCheckUtils]: 167: Hoare triple {22472#false} assume !false; {22472#false} is VALID [2018-11-23 12:27:23,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1939 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 1039 trivial. 0 not checked. [2018-11-23 12:27:23,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:23,340 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:27:23,351 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:27:25,214 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-23 12:27:25,214 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:25,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:25,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:25,767 INFO L256 TraceCheckUtils]: 0: Hoare triple {22471#true} call ULTIMATE.init(); {22471#true} is VALID [2018-11-23 12:27:25,767 INFO L273 TraceCheckUtils]: 1: Hoare triple {22471#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22471#true} is VALID [2018-11-23 12:27:25,768 INFO L273 TraceCheckUtils]: 2: Hoare triple {22471#true} assume true; {22471#true} is VALID [2018-11-23 12:27:25,768 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22471#true} {22471#true} #66#return; {22471#true} is VALID [2018-11-23 12:27:25,768 INFO L256 TraceCheckUtils]: 4: Hoare triple {22471#true} call #t~ret13 := main(); {22471#true} is VALID [2018-11-23 12:27:25,769 INFO L273 TraceCheckUtils]: 5: Hoare triple {22471#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; {22471#true} is VALID [2018-11-23 12:27:25,769 INFO L273 TraceCheckUtils]: 6: Hoare triple {22471#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:25,769 INFO L273 TraceCheckUtils]: 7: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:25,769 INFO L273 TraceCheckUtils]: 8: Hoare triple {22471#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:25,770 INFO L273 TraceCheckUtils]: 9: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:25,770 INFO L273 TraceCheckUtils]: 10: Hoare triple {22471#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:25,770 INFO L273 TraceCheckUtils]: 11: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:25,770 INFO L273 TraceCheckUtils]: 12: Hoare triple {22471#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:25,771 INFO L273 TraceCheckUtils]: 13: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:25,771 INFO L273 TraceCheckUtils]: 14: Hoare triple {22471#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:25,771 INFO L273 TraceCheckUtils]: 15: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:25,771 INFO L273 TraceCheckUtils]: 16: Hoare triple {22471#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:25,771 INFO L273 TraceCheckUtils]: 17: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:25,771 INFO L273 TraceCheckUtils]: 18: Hoare triple {22471#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:25,771 INFO L273 TraceCheckUtils]: 19: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:25,771 INFO L273 TraceCheckUtils]: 20: Hoare triple {22471#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:25,772 INFO L273 TraceCheckUtils]: 21: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:25,772 INFO L273 TraceCheckUtils]: 22: Hoare triple {22471#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:25,772 INFO L273 TraceCheckUtils]: 23: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:25,772 INFO L273 TraceCheckUtils]: 24: Hoare triple {22471#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:25,772 INFO L273 TraceCheckUtils]: 25: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:25,772 INFO L273 TraceCheckUtils]: 26: Hoare triple {22471#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:25,772 INFO L273 TraceCheckUtils]: 27: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:25,772 INFO L273 TraceCheckUtils]: 28: Hoare triple {22471#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:25,772 INFO L273 TraceCheckUtils]: 29: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:25,773 INFO L273 TraceCheckUtils]: 30: Hoare triple {22471#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:25,773 INFO L273 TraceCheckUtils]: 31: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:25,773 INFO L273 TraceCheckUtils]: 32: Hoare triple {22471#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:25,773 INFO L273 TraceCheckUtils]: 33: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:25,773 INFO L273 TraceCheckUtils]: 34: Hoare triple {22471#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:25,773 INFO L273 TraceCheckUtils]: 35: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:25,773 INFO L273 TraceCheckUtils]: 36: Hoare triple {22471#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:25,773 INFO L273 TraceCheckUtils]: 37: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:25,773 INFO L273 TraceCheckUtils]: 38: Hoare triple {22471#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:25,773 INFO L273 TraceCheckUtils]: 39: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:25,774 INFO L273 TraceCheckUtils]: 40: Hoare triple {22471#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:25,774 INFO L273 TraceCheckUtils]: 41: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:25,774 INFO L273 TraceCheckUtils]: 42: Hoare triple {22471#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:25,774 INFO L273 TraceCheckUtils]: 43: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:25,774 INFO L273 TraceCheckUtils]: 44: Hoare triple {22471#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:25,774 INFO L273 TraceCheckUtils]: 45: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:25,774 INFO L273 TraceCheckUtils]: 46: Hoare triple {22471#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:25,774 INFO L273 TraceCheckUtils]: 47: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:25,774 INFO L273 TraceCheckUtils]: 48: Hoare triple {22471#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:25,774 INFO L273 TraceCheckUtils]: 49: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:25,775 INFO L273 TraceCheckUtils]: 50: Hoare triple {22471#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:25,775 INFO L273 TraceCheckUtils]: 51: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:25,775 INFO L273 TraceCheckUtils]: 52: Hoare triple {22471#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:25,775 INFO L273 TraceCheckUtils]: 53: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:25,775 INFO L273 TraceCheckUtils]: 54: Hoare triple {22471#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:25,775 INFO L273 TraceCheckUtils]: 55: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:25,775 INFO L273 TraceCheckUtils]: 56: Hoare triple {22471#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:25,775 INFO L273 TraceCheckUtils]: 57: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:25,775 INFO L273 TraceCheckUtils]: 58: Hoare triple {22471#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:25,776 INFO L273 TraceCheckUtils]: 59: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:25,776 INFO L273 TraceCheckUtils]: 60: Hoare triple {22471#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:25,776 INFO L273 TraceCheckUtils]: 61: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:25,776 INFO L273 TraceCheckUtils]: 62: Hoare triple {22471#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:25,776 INFO L273 TraceCheckUtils]: 63: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:25,776 INFO L273 TraceCheckUtils]: 64: Hoare triple {22471#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {22471#true} is VALID [2018-11-23 12:27:25,776 INFO L273 TraceCheckUtils]: 65: Hoare triple {22471#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {22471#true} is VALID [2018-11-23 12:27:25,776 INFO L273 TraceCheckUtils]: 66: Hoare triple {22471#true} assume !(~i~1 < 100000); {22471#true} is VALID [2018-11-23 12:27:25,776 INFO L256 TraceCheckUtils]: 67: Hoare triple {22471#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {22471#true} is VALID [2018-11-23 12:27:25,776 INFO L273 TraceCheckUtils]: 68: Hoare triple {22471#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {22471#true} is VALID [2018-11-23 12:27:25,777 INFO L273 TraceCheckUtils]: 69: Hoare triple {22471#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:25,777 INFO L273 TraceCheckUtils]: 70: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:25,777 INFO L273 TraceCheckUtils]: 71: Hoare triple {22471#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:25,777 INFO L273 TraceCheckUtils]: 72: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:25,777 INFO L273 TraceCheckUtils]: 73: Hoare triple {22471#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:25,777 INFO L273 TraceCheckUtils]: 74: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:25,777 INFO L273 TraceCheckUtils]: 75: Hoare triple {22471#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:25,777 INFO L273 TraceCheckUtils]: 76: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:25,777 INFO L273 TraceCheckUtils]: 77: Hoare triple {22471#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:25,777 INFO L273 TraceCheckUtils]: 78: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:25,778 INFO L273 TraceCheckUtils]: 79: Hoare triple {22471#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:25,778 INFO L273 TraceCheckUtils]: 80: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:25,778 INFO L273 TraceCheckUtils]: 81: Hoare triple {22471#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:25,778 INFO L273 TraceCheckUtils]: 82: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:25,778 INFO L273 TraceCheckUtils]: 83: Hoare triple {22471#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:25,778 INFO L273 TraceCheckUtils]: 84: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:25,778 INFO L273 TraceCheckUtils]: 85: Hoare triple {22471#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:25,778 INFO L273 TraceCheckUtils]: 86: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:25,778 INFO L273 TraceCheckUtils]: 87: Hoare triple {22471#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:25,779 INFO L273 TraceCheckUtils]: 88: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:25,779 INFO L273 TraceCheckUtils]: 89: Hoare triple {22471#true} assume !(~i~0 < 100000); {22471#true} is VALID [2018-11-23 12:27:25,779 INFO L273 TraceCheckUtils]: 90: Hoare triple {22471#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {22471#true} is VALID [2018-11-23 12:27:25,779 INFO L273 TraceCheckUtils]: 91: Hoare triple {22471#true} assume true; {22471#true} is VALID [2018-11-23 12:27:25,779 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {22471#true} {22471#true} #70#return; {22471#true} is VALID [2018-11-23 12:27:25,779 INFO L273 TraceCheckUtils]: 93: Hoare triple {22471#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {22471#true} is VALID [2018-11-23 12:27:25,779 INFO L256 TraceCheckUtils]: 94: Hoare triple {22471#true} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {22471#true} is VALID [2018-11-23 12:27:25,779 INFO L273 TraceCheckUtils]: 95: Hoare triple {22471#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {22471#true} is VALID [2018-11-23 12:27:25,779 INFO L273 TraceCheckUtils]: 96: Hoare triple {22471#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:25,779 INFO L273 TraceCheckUtils]: 97: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:25,780 INFO L273 TraceCheckUtils]: 98: Hoare triple {22471#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:25,780 INFO L273 TraceCheckUtils]: 99: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:25,780 INFO L273 TraceCheckUtils]: 100: Hoare triple {22471#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:25,780 INFO L273 TraceCheckUtils]: 101: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:25,780 INFO L273 TraceCheckUtils]: 102: Hoare triple {22471#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:25,780 INFO L273 TraceCheckUtils]: 103: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:25,780 INFO L273 TraceCheckUtils]: 104: Hoare triple {22471#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:25,780 INFO L273 TraceCheckUtils]: 105: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:25,780 INFO L273 TraceCheckUtils]: 106: Hoare triple {22471#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:25,780 INFO L273 TraceCheckUtils]: 107: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:25,781 INFO L273 TraceCheckUtils]: 108: Hoare triple {22471#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:25,781 INFO L273 TraceCheckUtils]: 109: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:25,781 INFO L273 TraceCheckUtils]: 110: Hoare triple {22471#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:25,781 INFO L273 TraceCheckUtils]: 111: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:25,781 INFO L273 TraceCheckUtils]: 112: Hoare triple {22471#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:25,781 INFO L273 TraceCheckUtils]: 113: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:25,781 INFO L273 TraceCheckUtils]: 114: Hoare triple {22471#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:27:25,781 INFO L273 TraceCheckUtils]: 115: Hoare triple {22471#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22471#true} is VALID [2018-11-23 12:27:25,781 INFO L273 TraceCheckUtils]: 116: Hoare triple {22471#true} assume !(~i~0 < 100000); {22471#true} is VALID [2018-11-23 12:27:25,781 INFO L273 TraceCheckUtils]: 117: Hoare triple {22471#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {22471#true} is VALID [2018-11-23 12:27:25,782 INFO L273 TraceCheckUtils]: 118: Hoare triple {22471#true} assume true; {22471#true} is VALID [2018-11-23 12:27:25,782 INFO L268 TraceCheckUtils]: 119: Hoare quadruple {22471#true} {22471#true} #72#return; {22471#true} is VALID [2018-11-23 12:27:25,782 INFO L273 TraceCheckUtils]: 120: Hoare triple {22471#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {22867#(<= main_~i~2 0)} is VALID [2018-11-23 12:27:25,783 INFO L273 TraceCheckUtils]: 121: Hoare triple {22867#(<= main_~i~2 0)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22867#(<= main_~i~2 0)} is VALID [2018-11-23 12:27:25,783 INFO L273 TraceCheckUtils]: 122: Hoare triple {22867#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22874#(<= main_~i~2 1)} is VALID [2018-11-23 12:27:25,783 INFO L273 TraceCheckUtils]: 123: Hoare triple {22874#(<= main_~i~2 1)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22874#(<= main_~i~2 1)} is VALID [2018-11-23 12:27:25,784 INFO L273 TraceCheckUtils]: 124: Hoare triple {22874#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22881#(<= main_~i~2 2)} is VALID [2018-11-23 12:27:25,784 INFO L273 TraceCheckUtils]: 125: Hoare triple {22881#(<= main_~i~2 2)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22881#(<= main_~i~2 2)} is VALID [2018-11-23 12:27:25,784 INFO L273 TraceCheckUtils]: 126: Hoare triple {22881#(<= main_~i~2 2)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22888#(<= main_~i~2 3)} is VALID [2018-11-23 12:27:25,785 INFO L273 TraceCheckUtils]: 127: Hoare triple {22888#(<= main_~i~2 3)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22888#(<= main_~i~2 3)} is VALID [2018-11-23 12:27:25,785 INFO L273 TraceCheckUtils]: 128: Hoare triple {22888#(<= main_~i~2 3)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22895#(<= main_~i~2 4)} is VALID [2018-11-23 12:27:25,786 INFO L273 TraceCheckUtils]: 129: Hoare triple {22895#(<= main_~i~2 4)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22895#(<= main_~i~2 4)} is VALID [2018-11-23 12:27:25,787 INFO L273 TraceCheckUtils]: 130: Hoare triple {22895#(<= main_~i~2 4)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22902#(<= main_~i~2 5)} is VALID [2018-11-23 12:27:25,787 INFO L273 TraceCheckUtils]: 131: Hoare triple {22902#(<= main_~i~2 5)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22902#(<= main_~i~2 5)} is VALID [2018-11-23 12:27:25,788 INFO L273 TraceCheckUtils]: 132: Hoare triple {22902#(<= main_~i~2 5)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22909#(<= main_~i~2 6)} is VALID [2018-11-23 12:27:25,788 INFO L273 TraceCheckUtils]: 133: Hoare triple {22909#(<= main_~i~2 6)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22909#(<= main_~i~2 6)} is VALID [2018-11-23 12:27:25,789 INFO L273 TraceCheckUtils]: 134: Hoare triple {22909#(<= main_~i~2 6)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22916#(<= main_~i~2 7)} is VALID [2018-11-23 12:27:25,789 INFO L273 TraceCheckUtils]: 135: Hoare triple {22916#(<= main_~i~2 7)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {22916#(<= main_~i~2 7)} is VALID [2018-11-23 12:27:25,790 INFO L273 TraceCheckUtils]: 136: Hoare triple {22916#(<= main_~i~2 7)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {22923#(<= main_~i~2 8)} is VALID [2018-11-23 12:27:25,791 INFO L273 TraceCheckUtils]: 137: Hoare triple {22923#(<= main_~i~2 8)} assume !(~i~2 < 99999); {22472#false} is VALID [2018-11-23 12:27:25,791 INFO L273 TraceCheckUtils]: 138: Hoare triple {22472#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {22472#false} is VALID [2018-11-23 12:27:25,791 INFO L256 TraceCheckUtils]: 139: Hoare triple {22472#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {22472#false} is VALID [2018-11-23 12:27:25,791 INFO L273 TraceCheckUtils]: 140: Hoare triple {22472#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {22472#false} is VALID [2018-11-23 12:27:25,791 INFO L273 TraceCheckUtils]: 141: Hoare triple {22472#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22472#false} is VALID [2018-11-23 12:27:25,792 INFO L273 TraceCheckUtils]: 142: Hoare triple {22472#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22472#false} is VALID [2018-11-23 12:27:25,792 INFO L273 TraceCheckUtils]: 143: Hoare triple {22472#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22472#false} is VALID [2018-11-23 12:27:25,792 INFO L273 TraceCheckUtils]: 144: Hoare triple {22472#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22472#false} is VALID [2018-11-23 12:27:25,792 INFO L273 TraceCheckUtils]: 145: Hoare triple {22472#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22472#false} is VALID [2018-11-23 12:27:25,792 INFO L273 TraceCheckUtils]: 146: Hoare triple {22472#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22472#false} is VALID [2018-11-23 12:27:25,792 INFO L273 TraceCheckUtils]: 147: Hoare triple {22472#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22472#false} is VALID [2018-11-23 12:27:25,793 INFO L273 TraceCheckUtils]: 148: Hoare triple {22472#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22472#false} is VALID [2018-11-23 12:27:25,793 INFO L273 TraceCheckUtils]: 149: Hoare triple {22472#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22472#false} is VALID [2018-11-23 12:27:25,793 INFO L273 TraceCheckUtils]: 150: Hoare triple {22472#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22472#false} is VALID [2018-11-23 12:27:25,793 INFO L273 TraceCheckUtils]: 151: Hoare triple {22472#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22472#false} is VALID [2018-11-23 12:27:25,793 INFO L273 TraceCheckUtils]: 152: Hoare triple {22472#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22472#false} is VALID [2018-11-23 12:27:25,793 INFO L273 TraceCheckUtils]: 153: Hoare triple {22472#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22472#false} is VALID [2018-11-23 12:27:25,794 INFO L273 TraceCheckUtils]: 154: Hoare triple {22472#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22472#false} is VALID [2018-11-23 12:27:25,794 INFO L273 TraceCheckUtils]: 155: Hoare triple {22472#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22472#false} is VALID [2018-11-23 12:27:25,794 INFO L273 TraceCheckUtils]: 156: Hoare triple {22472#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22472#false} is VALID [2018-11-23 12:27:25,794 INFO L273 TraceCheckUtils]: 157: Hoare triple {22472#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22472#false} is VALID [2018-11-23 12:27:25,794 INFO L273 TraceCheckUtils]: 158: Hoare triple {22472#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22472#false} is VALID [2018-11-23 12:27:25,794 INFO L273 TraceCheckUtils]: 159: Hoare triple {22472#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {22472#false} is VALID [2018-11-23 12:27:25,795 INFO L273 TraceCheckUtils]: 160: Hoare triple {22472#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22472#false} is VALID [2018-11-23 12:27:25,795 INFO L273 TraceCheckUtils]: 161: Hoare triple {22472#false} assume !(~i~0 < 100000); {22472#false} is VALID [2018-11-23 12:27:25,795 INFO L273 TraceCheckUtils]: 162: Hoare triple {22472#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {22472#false} is VALID [2018-11-23 12:27:25,795 INFO L273 TraceCheckUtils]: 163: Hoare triple {22472#false} assume true; {22472#false} is VALID [2018-11-23 12:27:25,795 INFO L268 TraceCheckUtils]: 164: Hoare quadruple {22472#false} {22472#false} #74#return; {22472#false} is VALID [2018-11-23 12:27:25,795 INFO L273 TraceCheckUtils]: 165: Hoare triple {22472#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {22472#false} is VALID [2018-11-23 12:27:25,796 INFO L273 TraceCheckUtils]: 166: Hoare triple {22472#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {22472#false} is VALID [2018-11-23 12:27:25,796 INFO L273 TraceCheckUtils]: 167: Hoare triple {22472#false} assume !false; {22472#false} is VALID [2018-11-23 12:27:25,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1939 backedges. 450 proven. 64 refuted. 0 times theorem prover too weak. 1425 trivial. 0 not checked. [2018-11-23 12:27:25,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:25,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 11] total 42 [2018-11-23 12:27:25,828 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 168 [2018-11-23 12:27:25,828 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:25,828 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 12:27:25,945 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:25,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 12:27:25,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 12:27:25,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=582, Invalid=1140, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:27:25,947 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand 42 states. [2018-11-23 12:27:27,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:27,019 INFO L93 Difference]: Finished difference Result 177 states and 186 transitions. [2018-11-23 12:27:27,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-23 12:27:27,019 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 168 [2018-11-23 12:27:27,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:27,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:27:27,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 133 transitions. [2018-11-23 12:27:27,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:27:27,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 133 transitions. [2018-11-23 12:27:27,021 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 133 transitions. [2018-11-23 12:27:27,199 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:27,201 INFO L225 Difference]: With dead ends: 177 [2018-11-23 12:27:27,201 INFO L226 Difference]: Without dead ends: 125 [2018-11-23 12:27:27,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=582, Invalid=1140, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:27:27,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-23 12:27:27,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-11-23 12:27:27,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:27,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand 123 states. [2018-11-23 12:27:27,249 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 123 states. [2018-11-23 12:27:27,249 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 123 states. [2018-11-23 12:27:27,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:27,252 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2018-11-23 12:27:27,252 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-11-23 12:27:27,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:27,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:27,253 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 125 states. [2018-11-23 12:27:27,253 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 125 states. [2018-11-23 12:27:27,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:27,255 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2018-11-23 12:27:27,255 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-11-23 12:27:27,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:27,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:27,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:27,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:27,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-23 12:27:27,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 127 transitions. [2018-11-23 12:27:27,258 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 127 transitions. Word has length 168 [2018-11-23 12:27:27,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:27,258 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 127 transitions. [2018-11-23 12:27:27,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 12:27:27,259 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2018-11-23 12:27:27,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-23 12:27:27,260 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:27,260 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:27:27,260 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:27,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:27,260 INFO L82 PathProgramCache]: Analyzing trace with hash 853170883, now seen corresponding path program 31 times [2018-11-23 12:27:27,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:27,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:27,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:27,261 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:27,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:27,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:28,218 INFO L256 TraceCheckUtils]: 0: Hoare triple {23712#true} call ULTIMATE.init(); {23712#true} is VALID [2018-11-23 12:27:28,218 INFO L273 TraceCheckUtils]: 1: Hoare triple {23712#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23712#true} is VALID [2018-11-23 12:27:28,218 INFO L273 TraceCheckUtils]: 2: Hoare triple {23712#true} assume true; {23712#true} is VALID [2018-11-23 12:27:28,218 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23712#true} {23712#true} #66#return; {23712#true} is VALID [2018-11-23 12:27:28,219 INFO L256 TraceCheckUtils]: 4: Hoare triple {23712#true} call #t~ret13 := main(); {23712#true} is VALID [2018-11-23 12:27:28,219 INFO L273 TraceCheckUtils]: 5: Hoare triple {23712#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; {23714#(= main_~i~1 0)} is VALID [2018-11-23 12:27:28,220 INFO L273 TraceCheckUtils]: 6: Hoare triple {23714#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23714#(= main_~i~1 0)} is VALID [2018-11-23 12:27:28,220 INFO L273 TraceCheckUtils]: 7: Hoare triple {23714#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23715#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:28,221 INFO L273 TraceCheckUtils]: 8: Hoare triple {23715#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23715#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:28,221 INFO L273 TraceCheckUtils]: 9: Hoare triple {23715#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23716#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:28,222 INFO L273 TraceCheckUtils]: 10: Hoare triple {23716#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23716#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:28,223 INFO L273 TraceCheckUtils]: 11: Hoare triple {23716#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23717#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:28,223 INFO L273 TraceCheckUtils]: 12: Hoare triple {23717#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23717#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:28,224 INFO L273 TraceCheckUtils]: 13: Hoare triple {23717#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23718#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:28,224 INFO L273 TraceCheckUtils]: 14: Hoare triple {23718#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23718#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:28,225 INFO L273 TraceCheckUtils]: 15: Hoare triple {23718#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23719#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:28,225 INFO L273 TraceCheckUtils]: 16: Hoare triple {23719#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23719#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:28,226 INFO L273 TraceCheckUtils]: 17: Hoare triple {23719#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23720#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:28,227 INFO L273 TraceCheckUtils]: 18: Hoare triple {23720#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23720#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:28,227 INFO L273 TraceCheckUtils]: 19: Hoare triple {23720#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23721#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:28,228 INFO L273 TraceCheckUtils]: 20: Hoare triple {23721#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23721#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:28,228 INFO L273 TraceCheckUtils]: 21: Hoare triple {23721#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23722#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:28,229 INFO L273 TraceCheckUtils]: 22: Hoare triple {23722#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23722#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:28,230 INFO L273 TraceCheckUtils]: 23: Hoare triple {23722#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23723#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:28,230 INFO L273 TraceCheckUtils]: 24: Hoare triple {23723#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23723#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:28,231 INFO L273 TraceCheckUtils]: 25: Hoare triple {23723#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23724#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:28,231 INFO L273 TraceCheckUtils]: 26: Hoare triple {23724#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23724#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:28,232 INFO L273 TraceCheckUtils]: 27: Hoare triple {23724#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23725#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:28,232 INFO L273 TraceCheckUtils]: 28: Hoare triple {23725#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23725#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:28,233 INFO L273 TraceCheckUtils]: 29: Hoare triple {23725#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23726#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:28,233 INFO L273 TraceCheckUtils]: 30: Hoare triple {23726#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23726#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:28,234 INFO L273 TraceCheckUtils]: 31: Hoare triple {23726#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23727#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:28,235 INFO L273 TraceCheckUtils]: 32: Hoare triple {23727#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23727#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:28,235 INFO L273 TraceCheckUtils]: 33: Hoare triple {23727#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23728#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:28,236 INFO L273 TraceCheckUtils]: 34: Hoare triple {23728#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23728#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:28,236 INFO L273 TraceCheckUtils]: 35: Hoare triple {23728#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23729#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:28,237 INFO L273 TraceCheckUtils]: 36: Hoare triple {23729#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23729#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:28,238 INFO L273 TraceCheckUtils]: 37: Hoare triple {23729#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23730#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:28,238 INFO L273 TraceCheckUtils]: 38: Hoare triple {23730#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23730#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:28,239 INFO L273 TraceCheckUtils]: 39: Hoare triple {23730#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23731#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:28,239 INFO L273 TraceCheckUtils]: 40: Hoare triple {23731#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23731#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:28,240 INFO L273 TraceCheckUtils]: 41: Hoare triple {23731#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23732#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:28,240 INFO L273 TraceCheckUtils]: 42: Hoare triple {23732#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23732#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:28,241 INFO L273 TraceCheckUtils]: 43: Hoare triple {23732#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23733#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:28,242 INFO L273 TraceCheckUtils]: 44: Hoare triple {23733#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23733#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:28,242 INFO L273 TraceCheckUtils]: 45: Hoare triple {23733#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23734#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:28,243 INFO L273 TraceCheckUtils]: 46: Hoare triple {23734#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23734#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:28,243 INFO L273 TraceCheckUtils]: 47: Hoare triple {23734#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23735#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:28,244 INFO L273 TraceCheckUtils]: 48: Hoare triple {23735#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23735#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:28,246 INFO L273 TraceCheckUtils]: 49: Hoare triple {23735#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23736#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:28,253 INFO L273 TraceCheckUtils]: 50: Hoare triple {23736#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23736#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:28,254 INFO L273 TraceCheckUtils]: 51: Hoare triple {23736#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23737#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:28,254 INFO L273 TraceCheckUtils]: 52: Hoare triple {23737#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23737#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:28,254 INFO L273 TraceCheckUtils]: 53: Hoare triple {23737#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23738#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:28,255 INFO L273 TraceCheckUtils]: 54: Hoare triple {23738#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23738#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:28,255 INFO L273 TraceCheckUtils]: 55: Hoare triple {23738#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23739#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:28,255 INFO L273 TraceCheckUtils]: 56: Hoare triple {23739#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23739#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:28,256 INFO L273 TraceCheckUtils]: 57: Hoare triple {23739#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23740#(<= main_~i~1 26)} is VALID [2018-11-23 12:27:28,256 INFO L273 TraceCheckUtils]: 58: Hoare triple {23740#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23740#(<= main_~i~1 26)} is VALID [2018-11-23 12:27:28,256 INFO L273 TraceCheckUtils]: 59: Hoare triple {23740#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23741#(<= main_~i~1 27)} is VALID [2018-11-23 12:27:28,257 INFO L273 TraceCheckUtils]: 60: Hoare triple {23741#(<= main_~i~1 27)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23741#(<= main_~i~1 27)} is VALID [2018-11-23 12:27:28,257 INFO L273 TraceCheckUtils]: 61: Hoare triple {23741#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23742#(<= main_~i~1 28)} is VALID [2018-11-23 12:27:28,258 INFO L273 TraceCheckUtils]: 62: Hoare triple {23742#(<= main_~i~1 28)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23742#(<= main_~i~1 28)} is VALID [2018-11-23 12:27:28,258 INFO L273 TraceCheckUtils]: 63: Hoare triple {23742#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23743#(<= main_~i~1 29)} is VALID [2018-11-23 12:27:28,259 INFO L273 TraceCheckUtils]: 64: Hoare triple {23743#(<= main_~i~1 29)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23743#(<= main_~i~1 29)} is VALID [2018-11-23 12:27:28,259 INFO L273 TraceCheckUtils]: 65: Hoare triple {23743#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23744#(<= main_~i~1 30)} is VALID [2018-11-23 12:27:28,260 INFO L273 TraceCheckUtils]: 66: Hoare triple {23744#(<= main_~i~1 30)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23744#(<= main_~i~1 30)} is VALID [2018-11-23 12:27:28,260 INFO L273 TraceCheckUtils]: 67: Hoare triple {23744#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23745#(<= main_~i~1 31)} is VALID [2018-11-23 12:27:28,261 INFO L273 TraceCheckUtils]: 68: Hoare triple {23745#(<= main_~i~1 31)} assume !(~i~1 < 100000); {23713#false} is VALID [2018-11-23 12:27:28,261 INFO L256 TraceCheckUtils]: 69: Hoare triple {23713#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {23712#true} is VALID [2018-11-23 12:27:28,261 INFO L273 TraceCheckUtils]: 70: Hoare triple {23712#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {23712#true} is VALID [2018-11-23 12:27:28,262 INFO L273 TraceCheckUtils]: 71: Hoare triple {23712#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:28,262 INFO L273 TraceCheckUtils]: 72: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:28,262 INFO L273 TraceCheckUtils]: 73: Hoare triple {23712#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:28,262 INFO L273 TraceCheckUtils]: 74: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:28,262 INFO L273 TraceCheckUtils]: 75: Hoare triple {23712#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:28,262 INFO L273 TraceCheckUtils]: 76: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:28,263 INFO L273 TraceCheckUtils]: 77: Hoare triple {23712#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:28,263 INFO L273 TraceCheckUtils]: 78: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:28,263 INFO L273 TraceCheckUtils]: 79: Hoare triple {23712#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:28,263 INFO L273 TraceCheckUtils]: 80: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:28,263 INFO L273 TraceCheckUtils]: 81: Hoare triple {23712#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:28,263 INFO L273 TraceCheckUtils]: 82: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:28,264 INFO L273 TraceCheckUtils]: 83: Hoare triple {23712#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:28,264 INFO L273 TraceCheckUtils]: 84: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:28,264 INFO L273 TraceCheckUtils]: 85: Hoare triple {23712#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:28,264 INFO L273 TraceCheckUtils]: 86: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:28,264 INFO L273 TraceCheckUtils]: 87: Hoare triple {23712#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:28,264 INFO L273 TraceCheckUtils]: 88: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:28,264 INFO L273 TraceCheckUtils]: 89: Hoare triple {23712#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:28,264 INFO L273 TraceCheckUtils]: 90: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:28,264 INFO L273 TraceCheckUtils]: 91: Hoare triple {23712#true} assume !(~i~0 < 100000); {23712#true} is VALID [2018-11-23 12:27:28,265 INFO L273 TraceCheckUtils]: 92: Hoare triple {23712#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {23712#true} is VALID [2018-11-23 12:27:28,265 INFO L273 TraceCheckUtils]: 93: Hoare triple {23712#true} assume true; {23712#true} is VALID [2018-11-23 12:27:28,265 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {23712#true} {23713#false} #70#return; {23713#false} is VALID [2018-11-23 12:27:28,265 INFO L273 TraceCheckUtils]: 95: Hoare triple {23713#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {23713#false} is VALID [2018-11-23 12:27:28,265 INFO L256 TraceCheckUtils]: 96: Hoare triple {23713#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {23712#true} is VALID [2018-11-23 12:27:28,265 INFO L273 TraceCheckUtils]: 97: Hoare triple {23712#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {23712#true} is VALID [2018-11-23 12:27:28,265 INFO L273 TraceCheckUtils]: 98: Hoare triple {23712#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:28,265 INFO L273 TraceCheckUtils]: 99: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:28,265 INFO L273 TraceCheckUtils]: 100: Hoare triple {23712#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:28,265 INFO L273 TraceCheckUtils]: 101: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:28,266 INFO L273 TraceCheckUtils]: 102: Hoare triple {23712#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:28,266 INFO L273 TraceCheckUtils]: 103: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:28,266 INFO L273 TraceCheckUtils]: 104: Hoare triple {23712#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:28,266 INFO L273 TraceCheckUtils]: 105: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:28,266 INFO L273 TraceCheckUtils]: 106: Hoare triple {23712#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:28,266 INFO L273 TraceCheckUtils]: 107: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:28,266 INFO L273 TraceCheckUtils]: 108: Hoare triple {23712#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:28,266 INFO L273 TraceCheckUtils]: 109: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:28,266 INFO L273 TraceCheckUtils]: 110: Hoare triple {23712#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:28,267 INFO L273 TraceCheckUtils]: 111: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:28,267 INFO L273 TraceCheckUtils]: 112: Hoare triple {23712#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:28,267 INFO L273 TraceCheckUtils]: 113: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:28,267 INFO L273 TraceCheckUtils]: 114: Hoare triple {23712#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:28,267 INFO L273 TraceCheckUtils]: 115: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:28,267 INFO L273 TraceCheckUtils]: 116: Hoare triple {23712#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:28,267 INFO L273 TraceCheckUtils]: 117: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:28,267 INFO L273 TraceCheckUtils]: 118: Hoare triple {23712#true} assume !(~i~0 < 100000); {23712#true} is VALID [2018-11-23 12:27:28,267 INFO L273 TraceCheckUtils]: 119: Hoare triple {23712#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {23712#true} is VALID [2018-11-23 12:27:28,267 INFO L273 TraceCheckUtils]: 120: Hoare triple {23712#true} assume true; {23712#true} is VALID [2018-11-23 12:27:28,268 INFO L268 TraceCheckUtils]: 121: Hoare quadruple {23712#true} {23713#false} #72#return; {23713#false} is VALID [2018-11-23 12:27:28,268 INFO L273 TraceCheckUtils]: 122: Hoare triple {23713#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {23713#false} is VALID [2018-11-23 12:27:28,268 INFO L273 TraceCheckUtils]: 123: Hoare triple {23713#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23713#false} is VALID [2018-11-23 12:27:28,268 INFO L273 TraceCheckUtils]: 124: Hoare triple {23713#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23713#false} is VALID [2018-11-23 12:27:28,268 INFO L273 TraceCheckUtils]: 125: Hoare triple {23713#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23713#false} is VALID [2018-11-23 12:27:28,268 INFO L273 TraceCheckUtils]: 126: Hoare triple {23713#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23713#false} is VALID [2018-11-23 12:27:28,268 INFO L273 TraceCheckUtils]: 127: Hoare triple {23713#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23713#false} is VALID [2018-11-23 12:27:28,268 INFO L273 TraceCheckUtils]: 128: Hoare triple {23713#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23713#false} is VALID [2018-11-23 12:27:28,268 INFO L273 TraceCheckUtils]: 129: Hoare triple {23713#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23713#false} is VALID [2018-11-23 12:27:28,269 INFO L273 TraceCheckUtils]: 130: Hoare triple {23713#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23713#false} is VALID [2018-11-23 12:27:28,269 INFO L273 TraceCheckUtils]: 131: Hoare triple {23713#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23713#false} is VALID [2018-11-23 12:27:28,269 INFO L273 TraceCheckUtils]: 132: Hoare triple {23713#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23713#false} is VALID [2018-11-23 12:27:28,269 INFO L273 TraceCheckUtils]: 133: Hoare triple {23713#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23713#false} is VALID [2018-11-23 12:27:28,269 INFO L273 TraceCheckUtils]: 134: Hoare triple {23713#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23713#false} is VALID [2018-11-23 12:27:28,269 INFO L273 TraceCheckUtils]: 135: Hoare triple {23713#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23713#false} is VALID [2018-11-23 12:27:28,269 INFO L273 TraceCheckUtils]: 136: Hoare triple {23713#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23713#false} is VALID [2018-11-23 12:27:28,269 INFO L273 TraceCheckUtils]: 137: Hoare triple {23713#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23713#false} is VALID [2018-11-23 12:27:28,269 INFO L273 TraceCheckUtils]: 138: Hoare triple {23713#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23713#false} is VALID [2018-11-23 12:27:28,269 INFO L273 TraceCheckUtils]: 139: Hoare triple {23713#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23713#false} is VALID [2018-11-23 12:27:28,270 INFO L273 TraceCheckUtils]: 140: Hoare triple {23713#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23713#false} is VALID [2018-11-23 12:27:28,270 INFO L273 TraceCheckUtils]: 141: Hoare triple {23713#false} assume !(~i~2 < 99999); {23713#false} is VALID [2018-11-23 12:27:28,270 INFO L273 TraceCheckUtils]: 142: Hoare triple {23713#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {23713#false} is VALID [2018-11-23 12:27:28,270 INFO L256 TraceCheckUtils]: 143: Hoare triple {23713#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {23712#true} is VALID [2018-11-23 12:27:28,270 INFO L273 TraceCheckUtils]: 144: Hoare triple {23712#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {23712#true} is VALID [2018-11-23 12:27:28,270 INFO L273 TraceCheckUtils]: 145: Hoare triple {23712#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:28,270 INFO L273 TraceCheckUtils]: 146: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:28,270 INFO L273 TraceCheckUtils]: 147: Hoare triple {23712#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:28,270 INFO L273 TraceCheckUtils]: 148: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:28,270 INFO L273 TraceCheckUtils]: 149: Hoare triple {23712#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:28,271 INFO L273 TraceCheckUtils]: 150: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:28,271 INFO L273 TraceCheckUtils]: 151: Hoare triple {23712#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:28,271 INFO L273 TraceCheckUtils]: 152: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:28,271 INFO L273 TraceCheckUtils]: 153: Hoare triple {23712#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:28,271 INFO L273 TraceCheckUtils]: 154: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:28,271 INFO L273 TraceCheckUtils]: 155: Hoare triple {23712#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:28,271 INFO L273 TraceCheckUtils]: 156: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:28,271 INFO L273 TraceCheckUtils]: 157: Hoare triple {23712#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:28,271 INFO L273 TraceCheckUtils]: 158: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:28,271 INFO L273 TraceCheckUtils]: 159: Hoare triple {23712#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:28,272 INFO L273 TraceCheckUtils]: 160: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:28,272 INFO L273 TraceCheckUtils]: 161: Hoare triple {23712#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:28,272 INFO L273 TraceCheckUtils]: 162: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:28,272 INFO L273 TraceCheckUtils]: 163: Hoare triple {23712#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:27:28,272 INFO L273 TraceCheckUtils]: 164: Hoare triple {23712#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23712#true} is VALID [2018-11-23 12:27:28,272 INFO L273 TraceCheckUtils]: 165: Hoare triple {23712#true} assume !(~i~0 < 100000); {23712#true} is VALID [2018-11-23 12:27:28,272 INFO L273 TraceCheckUtils]: 166: Hoare triple {23712#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {23712#true} is VALID [2018-11-23 12:27:28,272 INFO L273 TraceCheckUtils]: 167: Hoare triple {23712#true} assume true; {23712#true} is VALID [2018-11-23 12:27:28,272 INFO L268 TraceCheckUtils]: 168: Hoare quadruple {23712#true} {23713#false} #74#return; {23713#false} is VALID [2018-11-23 12:27:28,273 INFO L273 TraceCheckUtils]: 169: Hoare triple {23713#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {23713#false} is VALID [2018-11-23 12:27:28,273 INFO L273 TraceCheckUtils]: 170: Hoare triple {23713#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {23713#false} is VALID [2018-11-23 12:27:28,273 INFO L273 TraceCheckUtils]: 171: Hoare triple {23713#false} assume !false; {23713#false} is VALID [2018-11-23 12:27:28,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2017 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2018-11-23 12:27:28,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:28,286 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:27:28,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:28,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:28,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:28,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:28,719 INFO L256 TraceCheckUtils]: 0: Hoare triple {23712#true} call ULTIMATE.init(); {23712#true} is VALID [2018-11-23 12:27:28,719 INFO L273 TraceCheckUtils]: 1: Hoare triple {23712#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23712#true} is VALID [2018-11-23 12:27:28,719 INFO L273 TraceCheckUtils]: 2: Hoare triple {23712#true} assume true; {23712#true} is VALID [2018-11-23 12:27:28,720 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23712#true} {23712#true} #66#return; {23712#true} is VALID [2018-11-23 12:27:28,720 INFO L256 TraceCheckUtils]: 4: Hoare triple {23712#true} call #t~ret13 := main(); {23712#true} is VALID [2018-11-23 12:27:28,721 INFO L273 TraceCheckUtils]: 5: Hoare triple {23712#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; {23764#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:28,721 INFO L273 TraceCheckUtils]: 6: Hoare triple {23764#(<= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23764#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:28,721 INFO L273 TraceCheckUtils]: 7: Hoare triple {23764#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23715#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:28,722 INFO L273 TraceCheckUtils]: 8: Hoare triple {23715#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23715#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:28,722 INFO L273 TraceCheckUtils]: 9: Hoare triple {23715#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23716#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:28,722 INFO L273 TraceCheckUtils]: 10: Hoare triple {23716#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23716#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:28,723 INFO L273 TraceCheckUtils]: 11: Hoare triple {23716#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23717#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:28,723 INFO L273 TraceCheckUtils]: 12: Hoare triple {23717#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23717#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:28,724 INFO L273 TraceCheckUtils]: 13: Hoare triple {23717#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23718#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:28,724 INFO L273 TraceCheckUtils]: 14: Hoare triple {23718#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23718#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:28,725 INFO L273 TraceCheckUtils]: 15: Hoare triple {23718#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23719#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:28,725 INFO L273 TraceCheckUtils]: 16: Hoare triple {23719#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23719#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:28,726 INFO L273 TraceCheckUtils]: 17: Hoare triple {23719#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23720#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:28,726 INFO L273 TraceCheckUtils]: 18: Hoare triple {23720#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23720#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:28,727 INFO L273 TraceCheckUtils]: 19: Hoare triple {23720#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23721#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:28,728 INFO L273 TraceCheckUtils]: 20: Hoare triple {23721#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23721#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:28,728 INFO L273 TraceCheckUtils]: 21: Hoare triple {23721#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23722#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:28,729 INFO L273 TraceCheckUtils]: 22: Hoare triple {23722#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23722#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:28,730 INFO L273 TraceCheckUtils]: 23: Hoare triple {23722#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23723#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:28,730 INFO L273 TraceCheckUtils]: 24: Hoare triple {23723#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23723#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:28,731 INFO L273 TraceCheckUtils]: 25: Hoare triple {23723#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23724#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:28,731 INFO L273 TraceCheckUtils]: 26: Hoare triple {23724#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23724#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:28,732 INFO L273 TraceCheckUtils]: 27: Hoare triple {23724#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23725#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:28,733 INFO L273 TraceCheckUtils]: 28: Hoare triple {23725#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23725#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:28,733 INFO L273 TraceCheckUtils]: 29: Hoare triple {23725#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23726#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:28,734 INFO L273 TraceCheckUtils]: 30: Hoare triple {23726#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23726#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:28,734 INFO L273 TraceCheckUtils]: 31: Hoare triple {23726#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23727#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:28,735 INFO L273 TraceCheckUtils]: 32: Hoare triple {23727#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23727#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:28,736 INFO L273 TraceCheckUtils]: 33: Hoare triple {23727#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23728#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:28,736 INFO L273 TraceCheckUtils]: 34: Hoare triple {23728#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23728#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:28,737 INFO L273 TraceCheckUtils]: 35: Hoare triple {23728#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23729#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:28,737 INFO L273 TraceCheckUtils]: 36: Hoare triple {23729#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23729#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:28,738 INFO L273 TraceCheckUtils]: 37: Hoare triple {23729#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23730#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:28,738 INFO L273 TraceCheckUtils]: 38: Hoare triple {23730#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23730#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:28,739 INFO L273 TraceCheckUtils]: 39: Hoare triple {23730#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23731#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:28,740 INFO L273 TraceCheckUtils]: 40: Hoare triple {23731#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23731#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:28,740 INFO L273 TraceCheckUtils]: 41: Hoare triple {23731#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23732#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:28,741 INFO L273 TraceCheckUtils]: 42: Hoare triple {23732#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23732#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:28,742 INFO L273 TraceCheckUtils]: 43: Hoare triple {23732#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23733#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:28,742 INFO L273 TraceCheckUtils]: 44: Hoare triple {23733#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23733#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:28,743 INFO L273 TraceCheckUtils]: 45: Hoare triple {23733#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23734#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:28,743 INFO L273 TraceCheckUtils]: 46: Hoare triple {23734#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23734#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:28,744 INFO L273 TraceCheckUtils]: 47: Hoare triple {23734#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23735#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:28,745 INFO L273 TraceCheckUtils]: 48: Hoare triple {23735#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23735#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:28,745 INFO L273 TraceCheckUtils]: 49: Hoare triple {23735#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23736#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:28,746 INFO L273 TraceCheckUtils]: 50: Hoare triple {23736#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23736#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:28,747 INFO L273 TraceCheckUtils]: 51: Hoare triple {23736#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23737#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:28,747 INFO L273 TraceCheckUtils]: 52: Hoare triple {23737#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23737#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:28,748 INFO L273 TraceCheckUtils]: 53: Hoare triple {23737#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23738#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:28,748 INFO L273 TraceCheckUtils]: 54: Hoare triple {23738#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23738#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:28,749 INFO L273 TraceCheckUtils]: 55: Hoare triple {23738#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23739#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:28,749 INFO L273 TraceCheckUtils]: 56: Hoare triple {23739#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23739#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:28,750 INFO L273 TraceCheckUtils]: 57: Hoare triple {23739#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23740#(<= main_~i~1 26)} is VALID [2018-11-23 12:27:28,750 INFO L273 TraceCheckUtils]: 58: Hoare triple {23740#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23740#(<= main_~i~1 26)} is VALID [2018-11-23 12:27:28,751 INFO L273 TraceCheckUtils]: 59: Hoare triple {23740#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23741#(<= main_~i~1 27)} is VALID [2018-11-23 12:27:28,752 INFO L273 TraceCheckUtils]: 60: Hoare triple {23741#(<= main_~i~1 27)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23741#(<= main_~i~1 27)} is VALID [2018-11-23 12:27:28,752 INFO L273 TraceCheckUtils]: 61: Hoare triple {23741#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23742#(<= main_~i~1 28)} is VALID [2018-11-23 12:27:28,753 INFO L273 TraceCheckUtils]: 62: Hoare triple {23742#(<= main_~i~1 28)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23742#(<= main_~i~1 28)} is VALID [2018-11-23 12:27:28,753 INFO L273 TraceCheckUtils]: 63: Hoare triple {23742#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23743#(<= main_~i~1 29)} is VALID [2018-11-23 12:27:28,754 INFO L273 TraceCheckUtils]: 64: Hoare triple {23743#(<= main_~i~1 29)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23743#(<= main_~i~1 29)} is VALID [2018-11-23 12:27:28,755 INFO L273 TraceCheckUtils]: 65: Hoare triple {23743#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23744#(<= main_~i~1 30)} is VALID [2018-11-23 12:27:28,755 INFO L273 TraceCheckUtils]: 66: Hoare triple {23744#(<= main_~i~1 30)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {23744#(<= main_~i~1 30)} is VALID [2018-11-23 12:27:28,756 INFO L273 TraceCheckUtils]: 67: Hoare triple {23744#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {23745#(<= main_~i~1 31)} is VALID [2018-11-23 12:27:28,756 INFO L273 TraceCheckUtils]: 68: Hoare triple {23745#(<= main_~i~1 31)} assume !(~i~1 < 100000); {23713#false} is VALID [2018-11-23 12:27:28,757 INFO L256 TraceCheckUtils]: 69: Hoare triple {23713#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {23713#false} is VALID [2018-11-23 12:27:28,757 INFO L273 TraceCheckUtils]: 70: Hoare triple {23713#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {23713#false} is VALID [2018-11-23 12:27:28,757 INFO L273 TraceCheckUtils]: 71: Hoare triple {23713#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:28,757 INFO L273 TraceCheckUtils]: 72: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:28,757 INFO L273 TraceCheckUtils]: 73: Hoare triple {23713#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:28,758 INFO L273 TraceCheckUtils]: 74: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:28,758 INFO L273 TraceCheckUtils]: 75: Hoare triple {23713#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:28,758 INFO L273 TraceCheckUtils]: 76: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:28,758 INFO L273 TraceCheckUtils]: 77: Hoare triple {23713#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:28,758 INFO L273 TraceCheckUtils]: 78: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:28,758 INFO L273 TraceCheckUtils]: 79: Hoare triple {23713#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:28,759 INFO L273 TraceCheckUtils]: 80: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:28,759 INFO L273 TraceCheckUtils]: 81: Hoare triple {23713#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:28,759 INFO L273 TraceCheckUtils]: 82: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:28,759 INFO L273 TraceCheckUtils]: 83: Hoare triple {23713#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:28,759 INFO L273 TraceCheckUtils]: 84: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:28,759 INFO L273 TraceCheckUtils]: 85: Hoare triple {23713#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:28,760 INFO L273 TraceCheckUtils]: 86: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:28,760 INFO L273 TraceCheckUtils]: 87: Hoare triple {23713#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:28,760 INFO L273 TraceCheckUtils]: 88: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:28,760 INFO L273 TraceCheckUtils]: 89: Hoare triple {23713#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:28,760 INFO L273 TraceCheckUtils]: 90: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:28,761 INFO L273 TraceCheckUtils]: 91: Hoare triple {23713#false} assume !(~i~0 < 100000); {23713#false} is VALID [2018-11-23 12:27:28,761 INFO L273 TraceCheckUtils]: 92: Hoare triple {23713#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {23713#false} is VALID [2018-11-23 12:27:28,761 INFO L273 TraceCheckUtils]: 93: Hoare triple {23713#false} assume true; {23713#false} is VALID [2018-11-23 12:27:28,761 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {23713#false} {23713#false} #70#return; {23713#false} is VALID [2018-11-23 12:27:28,761 INFO L273 TraceCheckUtils]: 95: Hoare triple {23713#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {23713#false} is VALID [2018-11-23 12:27:28,761 INFO L256 TraceCheckUtils]: 96: Hoare triple {23713#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {23713#false} is VALID [2018-11-23 12:27:28,762 INFO L273 TraceCheckUtils]: 97: Hoare triple {23713#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {23713#false} is VALID [2018-11-23 12:27:28,762 INFO L273 TraceCheckUtils]: 98: Hoare triple {23713#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:28,762 INFO L273 TraceCheckUtils]: 99: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:28,762 INFO L273 TraceCheckUtils]: 100: Hoare triple {23713#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:28,762 INFO L273 TraceCheckUtils]: 101: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:28,762 INFO L273 TraceCheckUtils]: 102: Hoare triple {23713#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:28,762 INFO L273 TraceCheckUtils]: 103: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:28,762 INFO L273 TraceCheckUtils]: 104: Hoare triple {23713#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:28,762 INFO L273 TraceCheckUtils]: 105: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:28,762 INFO L273 TraceCheckUtils]: 106: Hoare triple {23713#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:28,763 INFO L273 TraceCheckUtils]: 107: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:28,763 INFO L273 TraceCheckUtils]: 108: Hoare triple {23713#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:28,763 INFO L273 TraceCheckUtils]: 109: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:28,763 INFO L273 TraceCheckUtils]: 110: Hoare triple {23713#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:28,763 INFO L273 TraceCheckUtils]: 111: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:28,763 INFO L273 TraceCheckUtils]: 112: Hoare triple {23713#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:28,763 INFO L273 TraceCheckUtils]: 113: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:28,763 INFO L273 TraceCheckUtils]: 114: Hoare triple {23713#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:28,763 INFO L273 TraceCheckUtils]: 115: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:28,764 INFO L273 TraceCheckUtils]: 116: Hoare triple {23713#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:28,764 INFO L273 TraceCheckUtils]: 117: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:28,764 INFO L273 TraceCheckUtils]: 118: Hoare triple {23713#false} assume !(~i~0 < 100000); {23713#false} is VALID [2018-11-23 12:27:28,764 INFO L273 TraceCheckUtils]: 119: Hoare triple {23713#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {23713#false} is VALID [2018-11-23 12:27:28,764 INFO L273 TraceCheckUtils]: 120: Hoare triple {23713#false} assume true; {23713#false} is VALID [2018-11-23 12:27:28,764 INFO L268 TraceCheckUtils]: 121: Hoare quadruple {23713#false} {23713#false} #72#return; {23713#false} is VALID [2018-11-23 12:27:28,764 INFO L273 TraceCheckUtils]: 122: Hoare triple {23713#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {23713#false} is VALID [2018-11-23 12:27:28,764 INFO L273 TraceCheckUtils]: 123: Hoare triple {23713#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23713#false} is VALID [2018-11-23 12:27:28,764 INFO L273 TraceCheckUtils]: 124: Hoare triple {23713#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23713#false} is VALID [2018-11-23 12:27:28,764 INFO L273 TraceCheckUtils]: 125: Hoare triple {23713#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23713#false} is VALID [2018-11-23 12:27:28,765 INFO L273 TraceCheckUtils]: 126: Hoare triple {23713#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23713#false} is VALID [2018-11-23 12:27:28,765 INFO L273 TraceCheckUtils]: 127: Hoare triple {23713#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23713#false} is VALID [2018-11-23 12:27:28,765 INFO L273 TraceCheckUtils]: 128: Hoare triple {23713#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23713#false} is VALID [2018-11-23 12:27:28,765 INFO L273 TraceCheckUtils]: 129: Hoare triple {23713#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23713#false} is VALID [2018-11-23 12:27:28,765 INFO L273 TraceCheckUtils]: 130: Hoare triple {23713#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23713#false} is VALID [2018-11-23 12:27:28,765 INFO L273 TraceCheckUtils]: 131: Hoare triple {23713#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23713#false} is VALID [2018-11-23 12:27:28,765 INFO L273 TraceCheckUtils]: 132: Hoare triple {23713#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23713#false} is VALID [2018-11-23 12:27:28,765 INFO L273 TraceCheckUtils]: 133: Hoare triple {23713#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23713#false} is VALID [2018-11-23 12:27:28,766 INFO L273 TraceCheckUtils]: 134: Hoare triple {23713#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23713#false} is VALID [2018-11-23 12:27:28,766 INFO L273 TraceCheckUtils]: 135: Hoare triple {23713#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23713#false} is VALID [2018-11-23 12:27:28,766 INFO L273 TraceCheckUtils]: 136: Hoare triple {23713#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23713#false} is VALID [2018-11-23 12:27:28,766 INFO L273 TraceCheckUtils]: 137: Hoare triple {23713#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23713#false} is VALID [2018-11-23 12:27:28,766 INFO L273 TraceCheckUtils]: 138: Hoare triple {23713#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23713#false} is VALID [2018-11-23 12:27:28,766 INFO L273 TraceCheckUtils]: 139: Hoare triple {23713#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {23713#false} is VALID [2018-11-23 12:27:28,766 INFO L273 TraceCheckUtils]: 140: Hoare triple {23713#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {23713#false} is VALID [2018-11-23 12:27:28,767 INFO L273 TraceCheckUtils]: 141: Hoare triple {23713#false} assume !(~i~2 < 99999); {23713#false} is VALID [2018-11-23 12:27:28,767 INFO L273 TraceCheckUtils]: 142: Hoare triple {23713#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {23713#false} is VALID [2018-11-23 12:27:28,767 INFO L256 TraceCheckUtils]: 143: Hoare triple {23713#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {23713#false} is VALID [2018-11-23 12:27:28,767 INFO L273 TraceCheckUtils]: 144: Hoare triple {23713#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {23713#false} is VALID [2018-11-23 12:27:28,767 INFO L273 TraceCheckUtils]: 145: Hoare triple {23713#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:28,767 INFO L273 TraceCheckUtils]: 146: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:28,768 INFO L273 TraceCheckUtils]: 147: Hoare triple {23713#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:28,768 INFO L273 TraceCheckUtils]: 148: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:28,768 INFO L273 TraceCheckUtils]: 149: Hoare triple {23713#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:28,768 INFO L273 TraceCheckUtils]: 150: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:28,768 INFO L273 TraceCheckUtils]: 151: Hoare triple {23713#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:28,768 INFO L273 TraceCheckUtils]: 152: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:28,769 INFO L273 TraceCheckUtils]: 153: Hoare triple {23713#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:28,769 INFO L273 TraceCheckUtils]: 154: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:28,769 INFO L273 TraceCheckUtils]: 155: Hoare triple {23713#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:28,769 INFO L273 TraceCheckUtils]: 156: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:28,769 INFO L273 TraceCheckUtils]: 157: Hoare triple {23713#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:28,769 INFO L273 TraceCheckUtils]: 158: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:28,769 INFO L273 TraceCheckUtils]: 159: Hoare triple {23713#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:28,770 INFO L273 TraceCheckUtils]: 160: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:28,770 INFO L273 TraceCheckUtils]: 161: Hoare triple {23713#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:28,770 INFO L273 TraceCheckUtils]: 162: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:28,770 INFO L273 TraceCheckUtils]: 163: Hoare triple {23713#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:27:28,770 INFO L273 TraceCheckUtils]: 164: Hoare triple {23713#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23713#false} is VALID [2018-11-23 12:27:28,770 INFO L273 TraceCheckUtils]: 165: Hoare triple {23713#false} assume !(~i~0 < 100000); {23713#false} is VALID [2018-11-23 12:27:28,771 INFO L273 TraceCheckUtils]: 166: Hoare triple {23713#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {23713#false} is VALID [2018-11-23 12:27:28,771 INFO L273 TraceCheckUtils]: 167: Hoare triple {23713#false} assume true; {23713#false} is VALID [2018-11-23 12:27:28,771 INFO L268 TraceCheckUtils]: 168: Hoare quadruple {23713#false} {23713#false} #74#return; {23713#false} is VALID [2018-11-23 12:27:28,771 INFO L273 TraceCheckUtils]: 169: Hoare triple {23713#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {23713#false} is VALID [2018-11-23 12:27:28,771 INFO L273 TraceCheckUtils]: 170: Hoare triple {23713#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {23713#false} is VALID [2018-11-23 12:27:28,771 INFO L273 TraceCheckUtils]: 171: Hoare triple {23713#false} assume !false; {23713#false} is VALID [2018-11-23 12:27:28,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2017 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2018-11-23 12:27:28,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:28,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2018-11-23 12:27:28,820 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 172 [2018-11-23 12:27:28,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:28,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-23 12:27:29,196 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:29,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-23 12:27:29,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-23 12:27:29,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:27:29,197 INFO L87 Difference]: Start difference. First operand 123 states and 127 transitions. Second operand 35 states. [2018-11-23 12:27:29,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:29,561 INFO L93 Difference]: Finished difference Result 180 states and 188 transitions. [2018-11-23 12:27:29,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 12:27:29,561 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 172 [2018-11-23 12:27:29,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:29,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:27:29,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 116 transitions. [2018-11-23 12:27:29,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:27:29,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 116 transitions. [2018-11-23 12:27:29,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 116 transitions. [2018-11-23 12:27:29,707 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:29,709 INFO L225 Difference]: With dead ends: 180 [2018-11-23 12:27:29,710 INFO L226 Difference]: Without dead ends: 126 [2018-11-23 12:27:29,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:27:29,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-23 12:27:29,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2018-11-23 12:27:29,755 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:29,755 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand 125 states. [2018-11-23 12:27:29,756 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 125 states. [2018-11-23 12:27:29,756 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 125 states. [2018-11-23 12:27:29,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:29,758 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2018-11-23 12:27:29,758 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2018-11-23 12:27:29,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:29,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:29,758 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 126 states. [2018-11-23 12:27:29,758 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 126 states. [2018-11-23 12:27:29,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:29,760 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2018-11-23 12:27:29,760 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2018-11-23 12:27:29,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:29,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:29,760 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:29,760 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:29,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-23 12:27:29,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2018-11-23 12:27:29,762 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 172 [2018-11-23 12:27:29,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:29,762 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2018-11-23 12:27:29,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-23 12:27:29,763 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-11-23 12:27:29,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-23 12:27:29,764 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:29,764 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 30, 30, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:27:29,764 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:29,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:29,764 INFO L82 PathProgramCache]: Analyzing trace with hash -320678875, now seen corresponding path program 32 times [2018-11-23 12:27:29,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:29,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:29,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:29,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:27:29,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:29,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:30,457 INFO L256 TraceCheckUtils]: 0: Hoare triple {24968#true} call ULTIMATE.init(); {24968#true} is VALID [2018-11-23 12:27:30,458 INFO L273 TraceCheckUtils]: 1: Hoare triple {24968#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24968#true} is VALID [2018-11-23 12:27:30,458 INFO L273 TraceCheckUtils]: 2: Hoare triple {24968#true} assume true; {24968#true} is VALID [2018-11-23 12:27:30,458 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24968#true} {24968#true} #66#return; {24968#true} is VALID [2018-11-23 12:27:30,458 INFO L256 TraceCheckUtils]: 4: Hoare triple {24968#true} call #t~ret13 := main(); {24968#true} is VALID [2018-11-23 12:27:30,459 INFO L273 TraceCheckUtils]: 5: Hoare triple {24968#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; {24970#(= main_~i~1 0)} is VALID [2018-11-23 12:27:30,459 INFO L273 TraceCheckUtils]: 6: Hoare triple {24970#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24970#(= main_~i~1 0)} is VALID [2018-11-23 12:27:30,460 INFO L273 TraceCheckUtils]: 7: Hoare triple {24970#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24971#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:30,460 INFO L273 TraceCheckUtils]: 8: Hoare triple {24971#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24971#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:30,461 INFO L273 TraceCheckUtils]: 9: Hoare triple {24971#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24972#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:30,462 INFO L273 TraceCheckUtils]: 10: Hoare triple {24972#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24972#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:30,462 INFO L273 TraceCheckUtils]: 11: Hoare triple {24972#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24973#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:30,463 INFO L273 TraceCheckUtils]: 12: Hoare triple {24973#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24973#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:30,464 INFO L273 TraceCheckUtils]: 13: Hoare triple {24973#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24974#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:30,464 INFO L273 TraceCheckUtils]: 14: Hoare triple {24974#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24974#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:30,465 INFO L273 TraceCheckUtils]: 15: Hoare triple {24974#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24975#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:30,465 INFO L273 TraceCheckUtils]: 16: Hoare triple {24975#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24975#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:30,466 INFO L273 TraceCheckUtils]: 17: Hoare triple {24975#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24976#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:30,467 INFO L273 TraceCheckUtils]: 18: Hoare triple {24976#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24976#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:30,467 INFO L273 TraceCheckUtils]: 19: Hoare triple {24976#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24977#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:30,468 INFO L273 TraceCheckUtils]: 20: Hoare triple {24977#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24977#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:30,469 INFO L273 TraceCheckUtils]: 21: Hoare triple {24977#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24978#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:30,469 INFO L273 TraceCheckUtils]: 22: Hoare triple {24978#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24978#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:30,470 INFO L273 TraceCheckUtils]: 23: Hoare triple {24978#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24979#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:30,470 INFO L273 TraceCheckUtils]: 24: Hoare triple {24979#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24979#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:30,471 INFO L273 TraceCheckUtils]: 25: Hoare triple {24979#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24980#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:30,471 INFO L273 TraceCheckUtils]: 26: Hoare triple {24980#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24980#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:30,472 INFO L273 TraceCheckUtils]: 27: Hoare triple {24980#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24981#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:30,473 INFO L273 TraceCheckUtils]: 28: Hoare triple {24981#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24981#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:30,473 INFO L273 TraceCheckUtils]: 29: Hoare triple {24981#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24982#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:30,474 INFO L273 TraceCheckUtils]: 30: Hoare triple {24982#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24982#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:30,475 INFO L273 TraceCheckUtils]: 31: Hoare triple {24982#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24983#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:30,475 INFO L273 TraceCheckUtils]: 32: Hoare triple {24983#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24983#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:30,476 INFO L273 TraceCheckUtils]: 33: Hoare triple {24983#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24984#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:30,476 INFO L273 TraceCheckUtils]: 34: Hoare triple {24984#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24984#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:30,477 INFO L273 TraceCheckUtils]: 35: Hoare triple {24984#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24985#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:30,477 INFO L273 TraceCheckUtils]: 36: Hoare triple {24985#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24985#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:30,478 INFO L273 TraceCheckUtils]: 37: Hoare triple {24985#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24986#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:30,479 INFO L273 TraceCheckUtils]: 38: Hoare triple {24986#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24986#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:30,479 INFO L273 TraceCheckUtils]: 39: Hoare triple {24986#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24987#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:30,480 INFO L273 TraceCheckUtils]: 40: Hoare triple {24987#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24987#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:30,480 INFO L273 TraceCheckUtils]: 41: Hoare triple {24987#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24988#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:30,481 INFO L273 TraceCheckUtils]: 42: Hoare triple {24988#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24988#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:30,482 INFO L273 TraceCheckUtils]: 43: Hoare triple {24988#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24989#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:30,482 INFO L273 TraceCheckUtils]: 44: Hoare triple {24989#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24989#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:30,483 INFO L273 TraceCheckUtils]: 45: Hoare triple {24989#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24990#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:30,483 INFO L273 TraceCheckUtils]: 46: Hoare triple {24990#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24990#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:30,484 INFO L273 TraceCheckUtils]: 47: Hoare triple {24990#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24991#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:30,485 INFO L273 TraceCheckUtils]: 48: Hoare triple {24991#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24991#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:30,485 INFO L273 TraceCheckUtils]: 49: Hoare triple {24991#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24992#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:30,486 INFO L273 TraceCheckUtils]: 50: Hoare triple {24992#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24992#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:30,487 INFO L273 TraceCheckUtils]: 51: Hoare triple {24992#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24993#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:30,487 INFO L273 TraceCheckUtils]: 52: Hoare triple {24993#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24993#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:30,488 INFO L273 TraceCheckUtils]: 53: Hoare triple {24993#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24994#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:30,488 INFO L273 TraceCheckUtils]: 54: Hoare triple {24994#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24994#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:30,489 INFO L273 TraceCheckUtils]: 55: Hoare triple {24994#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24995#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:30,489 INFO L273 TraceCheckUtils]: 56: Hoare triple {24995#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24995#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:30,490 INFO L273 TraceCheckUtils]: 57: Hoare triple {24995#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24996#(<= main_~i~1 26)} is VALID [2018-11-23 12:27:30,490 INFO L273 TraceCheckUtils]: 58: Hoare triple {24996#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24996#(<= main_~i~1 26)} is VALID [2018-11-23 12:27:30,491 INFO L273 TraceCheckUtils]: 59: Hoare triple {24996#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24997#(<= main_~i~1 27)} is VALID [2018-11-23 12:27:30,492 INFO L273 TraceCheckUtils]: 60: Hoare triple {24997#(<= main_~i~1 27)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24997#(<= main_~i~1 27)} is VALID [2018-11-23 12:27:30,492 INFO L273 TraceCheckUtils]: 61: Hoare triple {24997#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24998#(<= main_~i~1 28)} is VALID [2018-11-23 12:27:30,493 INFO L273 TraceCheckUtils]: 62: Hoare triple {24998#(<= main_~i~1 28)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24998#(<= main_~i~1 28)} is VALID [2018-11-23 12:27:30,494 INFO L273 TraceCheckUtils]: 63: Hoare triple {24998#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24999#(<= main_~i~1 29)} is VALID [2018-11-23 12:27:30,494 INFO L273 TraceCheckUtils]: 64: Hoare triple {24999#(<= main_~i~1 29)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24999#(<= main_~i~1 29)} is VALID [2018-11-23 12:27:30,495 INFO L273 TraceCheckUtils]: 65: Hoare triple {24999#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25000#(<= main_~i~1 30)} is VALID [2018-11-23 12:27:30,495 INFO L273 TraceCheckUtils]: 66: Hoare triple {25000#(<= main_~i~1 30)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25000#(<= main_~i~1 30)} is VALID [2018-11-23 12:27:30,496 INFO L273 TraceCheckUtils]: 67: Hoare triple {25000#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25001#(<= main_~i~1 31)} is VALID [2018-11-23 12:27:30,497 INFO L273 TraceCheckUtils]: 68: Hoare triple {25001#(<= main_~i~1 31)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25001#(<= main_~i~1 31)} is VALID [2018-11-23 12:27:30,497 INFO L273 TraceCheckUtils]: 69: Hoare triple {25001#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25002#(<= main_~i~1 32)} is VALID [2018-11-23 12:27:30,498 INFO L273 TraceCheckUtils]: 70: Hoare triple {25002#(<= main_~i~1 32)} assume !(~i~1 < 100000); {24969#false} is VALID [2018-11-23 12:27:30,498 INFO L256 TraceCheckUtils]: 71: Hoare triple {24969#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {24968#true} is VALID [2018-11-23 12:27:30,498 INFO L273 TraceCheckUtils]: 72: Hoare triple {24968#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {24968#true} is VALID [2018-11-23 12:27:30,499 INFO L273 TraceCheckUtils]: 73: Hoare triple {24968#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:30,499 INFO L273 TraceCheckUtils]: 74: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:30,499 INFO L273 TraceCheckUtils]: 75: Hoare triple {24968#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:30,499 INFO L273 TraceCheckUtils]: 76: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:30,499 INFO L273 TraceCheckUtils]: 77: Hoare triple {24968#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:30,499 INFO L273 TraceCheckUtils]: 78: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:30,500 INFO L273 TraceCheckUtils]: 79: Hoare triple {24968#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:30,500 INFO L273 TraceCheckUtils]: 80: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:30,500 INFO L273 TraceCheckUtils]: 81: Hoare triple {24968#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:30,500 INFO L273 TraceCheckUtils]: 82: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:30,500 INFO L273 TraceCheckUtils]: 83: Hoare triple {24968#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:30,500 INFO L273 TraceCheckUtils]: 84: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:30,501 INFO L273 TraceCheckUtils]: 85: Hoare triple {24968#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:30,501 INFO L273 TraceCheckUtils]: 86: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:30,501 INFO L273 TraceCheckUtils]: 87: Hoare triple {24968#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:30,501 INFO L273 TraceCheckUtils]: 88: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:30,501 INFO L273 TraceCheckUtils]: 89: Hoare triple {24968#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:30,501 INFO L273 TraceCheckUtils]: 90: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:30,501 INFO L273 TraceCheckUtils]: 91: Hoare triple {24968#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:30,501 INFO L273 TraceCheckUtils]: 92: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:30,502 INFO L273 TraceCheckUtils]: 93: Hoare triple {24968#true} assume !(~i~0 < 100000); {24968#true} is VALID [2018-11-23 12:27:30,502 INFO L273 TraceCheckUtils]: 94: Hoare triple {24968#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {24968#true} is VALID [2018-11-23 12:27:30,502 INFO L273 TraceCheckUtils]: 95: Hoare triple {24968#true} assume true; {24968#true} is VALID [2018-11-23 12:27:30,502 INFO L268 TraceCheckUtils]: 96: Hoare quadruple {24968#true} {24969#false} #70#return; {24969#false} is VALID [2018-11-23 12:27:30,502 INFO L273 TraceCheckUtils]: 97: Hoare triple {24969#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {24969#false} is VALID [2018-11-23 12:27:30,502 INFO L256 TraceCheckUtils]: 98: Hoare triple {24969#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {24968#true} is VALID [2018-11-23 12:27:30,502 INFO L273 TraceCheckUtils]: 99: Hoare triple {24968#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {24968#true} is VALID [2018-11-23 12:27:30,502 INFO L273 TraceCheckUtils]: 100: Hoare triple {24968#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:30,502 INFO L273 TraceCheckUtils]: 101: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:30,502 INFO L273 TraceCheckUtils]: 102: Hoare triple {24968#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:30,503 INFO L273 TraceCheckUtils]: 103: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:30,503 INFO L273 TraceCheckUtils]: 104: Hoare triple {24968#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:30,503 INFO L273 TraceCheckUtils]: 105: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:30,503 INFO L273 TraceCheckUtils]: 106: Hoare triple {24968#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:30,503 INFO L273 TraceCheckUtils]: 107: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:30,503 INFO L273 TraceCheckUtils]: 108: Hoare triple {24968#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:30,503 INFO L273 TraceCheckUtils]: 109: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:30,503 INFO L273 TraceCheckUtils]: 110: Hoare triple {24968#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:30,503 INFO L273 TraceCheckUtils]: 111: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:30,503 INFO L273 TraceCheckUtils]: 112: Hoare triple {24968#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:30,504 INFO L273 TraceCheckUtils]: 113: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:30,504 INFO L273 TraceCheckUtils]: 114: Hoare triple {24968#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:30,504 INFO L273 TraceCheckUtils]: 115: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:30,504 INFO L273 TraceCheckUtils]: 116: Hoare triple {24968#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:30,504 INFO L273 TraceCheckUtils]: 117: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:30,504 INFO L273 TraceCheckUtils]: 118: Hoare triple {24968#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:30,504 INFO L273 TraceCheckUtils]: 119: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:30,504 INFO L273 TraceCheckUtils]: 120: Hoare triple {24968#true} assume !(~i~0 < 100000); {24968#true} is VALID [2018-11-23 12:27:30,504 INFO L273 TraceCheckUtils]: 121: Hoare triple {24968#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {24968#true} is VALID [2018-11-23 12:27:30,505 INFO L273 TraceCheckUtils]: 122: Hoare triple {24968#true} assume true; {24968#true} is VALID [2018-11-23 12:27:30,505 INFO L268 TraceCheckUtils]: 123: Hoare quadruple {24968#true} {24969#false} #72#return; {24969#false} is VALID [2018-11-23 12:27:30,505 INFO L273 TraceCheckUtils]: 124: Hoare triple {24969#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {24969#false} is VALID [2018-11-23 12:27:30,505 INFO L273 TraceCheckUtils]: 125: Hoare triple {24969#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {24969#false} is VALID [2018-11-23 12:27:30,505 INFO L273 TraceCheckUtils]: 126: Hoare triple {24969#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {24969#false} is VALID [2018-11-23 12:27:30,505 INFO L273 TraceCheckUtils]: 127: Hoare triple {24969#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {24969#false} is VALID [2018-11-23 12:27:30,505 INFO L273 TraceCheckUtils]: 128: Hoare triple {24969#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {24969#false} is VALID [2018-11-23 12:27:30,505 INFO L273 TraceCheckUtils]: 129: Hoare triple {24969#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {24969#false} is VALID [2018-11-23 12:27:30,505 INFO L273 TraceCheckUtils]: 130: Hoare triple {24969#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {24969#false} is VALID [2018-11-23 12:27:30,505 INFO L273 TraceCheckUtils]: 131: Hoare triple {24969#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {24969#false} is VALID [2018-11-23 12:27:30,506 INFO L273 TraceCheckUtils]: 132: Hoare triple {24969#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {24969#false} is VALID [2018-11-23 12:27:30,506 INFO L273 TraceCheckUtils]: 133: Hoare triple {24969#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {24969#false} is VALID [2018-11-23 12:27:30,506 INFO L273 TraceCheckUtils]: 134: Hoare triple {24969#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {24969#false} is VALID [2018-11-23 12:27:30,506 INFO L273 TraceCheckUtils]: 135: Hoare triple {24969#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {24969#false} is VALID [2018-11-23 12:27:30,506 INFO L273 TraceCheckUtils]: 136: Hoare triple {24969#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {24969#false} is VALID [2018-11-23 12:27:30,506 INFO L273 TraceCheckUtils]: 137: Hoare triple {24969#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {24969#false} is VALID [2018-11-23 12:27:30,506 INFO L273 TraceCheckUtils]: 138: Hoare triple {24969#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {24969#false} is VALID [2018-11-23 12:27:30,506 INFO L273 TraceCheckUtils]: 139: Hoare triple {24969#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {24969#false} is VALID [2018-11-23 12:27:30,506 INFO L273 TraceCheckUtils]: 140: Hoare triple {24969#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {24969#false} is VALID [2018-11-23 12:27:30,506 INFO L273 TraceCheckUtils]: 141: Hoare triple {24969#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {24969#false} is VALID [2018-11-23 12:27:30,507 INFO L273 TraceCheckUtils]: 142: Hoare triple {24969#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {24969#false} is VALID [2018-11-23 12:27:30,507 INFO L273 TraceCheckUtils]: 143: Hoare triple {24969#false} assume !(~i~2 < 99999); {24969#false} is VALID [2018-11-23 12:27:30,507 INFO L273 TraceCheckUtils]: 144: Hoare triple {24969#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {24969#false} is VALID [2018-11-23 12:27:30,507 INFO L256 TraceCheckUtils]: 145: Hoare triple {24969#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {24968#true} is VALID [2018-11-23 12:27:30,507 INFO L273 TraceCheckUtils]: 146: Hoare triple {24968#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {24968#true} is VALID [2018-11-23 12:27:30,507 INFO L273 TraceCheckUtils]: 147: Hoare triple {24968#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:30,507 INFO L273 TraceCheckUtils]: 148: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:30,507 INFO L273 TraceCheckUtils]: 149: Hoare triple {24968#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:30,507 INFO L273 TraceCheckUtils]: 150: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:30,507 INFO L273 TraceCheckUtils]: 151: Hoare triple {24968#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:30,508 INFO L273 TraceCheckUtils]: 152: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:30,508 INFO L273 TraceCheckUtils]: 153: Hoare triple {24968#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:30,508 INFO L273 TraceCheckUtils]: 154: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:30,508 INFO L273 TraceCheckUtils]: 155: Hoare triple {24968#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:30,508 INFO L273 TraceCheckUtils]: 156: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:30,508 INFO L273 TraceCheckUtils]: 157: Hoare triple {24968#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:30,508 INFO L273 TraceCheckUtils]: 158: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:30,508 INFO L273 TraceCheckUtils]: 159: Hoare triple {24968#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:30,508 INFO L273 TraceCheckUtils]: 160: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:30,509 INFO L273 TraceCheckUtils]: 161: Hoare triple {24968#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:30,509 INFO L273 TraceCheckUtils]: 162: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:30,509 INFO L273 TraceCheckUtils]: 163: Hoare triple {24968#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:30,509 INFO L273 TraceCheckUtils]: 164: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:30,509 INFO L273 TraceCheckUtils]: 165: Hoare triple {24968#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:27:30,509 INFO L273 TraceCheckUtils]: 166: Hoare triple {24968#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24968#true} is VALID [2018-11-23 12:27:30,509 INFO L273 TraceCheckUtils]: 167: Hoare triple {24968#true} assume !(~i~0 < 100000); {24968#true} is VALID [2018-11-23 12:27:30,509 INFO L273 TraceCheckUtils]: 168: Hoare triple {24968#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {24968#true} is VALID [2018-11-23 12:27:30,509 INFO L273 TraceCheckUtils]: 169: Hoare triple {24968#true} assume true; {24968#true} is VALID [2018-11-23 12:27:30,509 INFO L268 TraceCheckUtils]: 170: Hoare quadruple {24968#true} {24969#false} #74#return; {24969#false} is VALID [2018-11-23 12:27:30,510 INFO L273 TraceCheckUtils]: 171: Hoare triple {24969#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {24969#false} is VALID [2018-11-23 12:27:30,510 INFO L273 TraceCheckUtils]: 172: Hoare triple {24969#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {24969#false} is VALID [2018-11-23 12:27:30,510 INFO L273 TraceCheckUtils]: 173: Hoare triple {24969#false} assume !false; {24969#false} is VALID [2018-11-23 12:27:30,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2018-11-23 12:27:30,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:30,524 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:27:30,531 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:27:30,602 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:27:30,602 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:30,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:30,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:30,965 INFO L256 TraceCheckUtils]: 0: Hoare triple {24968#true} call ULTIMATE.init(); {24968#true} is VALID [2018-11-23 12:27:30,966 INFO L273 TraceCheckUtils]: 1: Hoare triple {24968#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24968#true} is VALID [2018-11-23 12:27:30,966 INFO L273 TraceCheckUtils]: 2: Hoare triple {24968#true} assume true; {24968#true} is VALID [2018-11-23 12:27:30,966 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24968#true} {24968#true} #66#return; {24968#true} is VALID [2018-11-23 12:27:30,966 INFO L256 TraceCheckUtils]: 4: Hoare triple {24968#true} call #t~ret13 := main(); {24968#true} is VALID [2018-11-23 12:27:30,967 INFO L273 TraceCheckUtils]: 5: Hoare triple {24968#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; {25021#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:30,968 INFO L273 TraceCheckUtils]: 6: Hoare triple {25021#(<= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25021#(<= main_~i~1 0)} is VALID [2018-11-23 12:27:30,968 INFO L273 TraceCheckUtils]: 7: Hoare triple {25021#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24971#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:30,968 INFO L273 TraceCheckUtils]: 8: Hoare triple {24971#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24971#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:30,969 INFO L273 TraceCheckUtils]: 9: Hoare triple {24971#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24972#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:30,969 INFO L273 TraceCheckUtils]: 10: Hoare triple {24972#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24972#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:30,970 INFO L273 TraceCheckUtils]: 11: Hoare triple {24972#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24973#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:30,970 INFO L273 TraceCheckUtils]: 12: Hoare triple {24973#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24973#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:30,971 INFO L273 TraceCheckUtils]: 13: Hoare triple {24973#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24974#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:30,971 INFO L273 TraceCheckUtils]: 14: Hoare triple {24974#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24974#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:30,972 INFO L273 TraceCheckUtils]: 15: Hoare triple {24974#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24975#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:30,972 INFO L273 TraceCheckUtils]: 16: Hoare triple {24975#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24975#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:30,973 INFO L273 TraceCheckUtils]: 17: Hoare triple {24975#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24976#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:30,974 INFO L273 TraceCheckUtils]: 18: Hoare triple {24976#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24976#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:30,974 INFO L273 TraceCheckUtils]: 19: Hoare triple {24976#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24977#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:30,975 INFO L273 TraceCheckUtils]: 20: Hoare triple {24977#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24977#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:30,975 INFO L273 TraceCheckUtils]: 21: Hoare triple {24977#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24978#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:30,976 INFO L273 TraceCheckUtils]: 22: Hoare triple {24978#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24978#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:30,977 INFO L273 TraceCheckUtils]: 23: Hoare triple {24978#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24979#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:30,977 INFO L273 TraceCheckUtils]: 24: Hoare triple {24979#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24979#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:30,978 INFO L273 TraceCheckUtils]: 25: Hoare triple {24979#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24980#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:30,978 INFO L273 TraceCheckUtils]: 26: Hoare triple {24980#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24980#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:30,979 INFO L273 TraceCheckUtils]: 27: Hoare triple {24980#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24981#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:30,979 INFO L273 TraceCheckUtils]: 28: Hoare triple {24981#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24981#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:30,980 INFO L273 TraceCheckUtils]: 29: Hoare triple {24981#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24982#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:30,981 INFO L273 TraceCheckUtils]: 30: Hoare triple {24982#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24982#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:30,981 INFO L273 TraceCheckUtils]: 31: Hoare triple {24982#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24983#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:30,982 INFO L273 TraceCheckUtils]: 32: Hoare triple {24983#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24983#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:30,982 INFO L273 TraceCheckUtils]: 33: Hoare triple {24983#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24984#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:30,983 INFO L273 TraceCheckUtils]: 34: Hoare triple {24984#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24984#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:30,984 INFO L273 TraceCheckUtils]: 35: Hoare triple {24984#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24985#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:30,984 INFO L273 TraceCheckUtils]: 36: Hoare triple {24985#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24985#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:30,985 INFO L273 TraceCheckUtils]: 37: Hoare triple {24985#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24986#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:30,985 INFO L273 TraceCheckUtils]: 38: Hoare triple {24986#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24986#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:30,986 INFO L273 TraceCheckUtils]: 39: Hoare triple {24986#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24987#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:30,986 INFO L273 TraceCheckUtils]: 40: Hoare triple {24987#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24987#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:30,987 INFO L273 TraceCheckUtils]: 41: Hoare triple {24987#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24988#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:30,987 INFO L273 TraceCheckUtils]: 42: Hoare triple {24988#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24988#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:30,988 INFO L273 TraceCheckUtils]: 43: Hoare triple {24988#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24989#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:30,989 INFO L273 TraceCheckUtils]: 44: Hoare triple {24989#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24989#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:30,989 INFO L273 TraceCheckUtils]: 45: Hoare triple {24989#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24990#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:30,990 INFO L273 TraceCheckUtils]: 46: Hoare triple {24990#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24990#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:30,990 INFO L273 TraceCheckUtils]: 47: Hoare triple {24990#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24991#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:30,991 INFO L273 TraceCheckUtils]: 48: Hoare triple {24991#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24991#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:30,992 INFO L273 TraceCheckUtils]: 49: Hoare triple {24991#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24992#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:30,992 INFO L273 TraceCheckUtils]: 50: Hoare triple {24992#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24992#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:30,993 INFO L273 TraceCheckUtils]: 51: Hoare triple {24992#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24993#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:30,993 INFO L273 TraceCheckUtils]: 52: Hoare triple {24993#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24993#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:30,994 INFO L273 TraceCheckUtils]: 53: Hoare triple {24993#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24994#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:30,994 INFO L273 TraceCheckUtils]: 54: Hoare triple {24994#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24994#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:30,995 INFO L273 TraceCheckUtils]: 55: Hoare triple {24994#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24995#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:30,996 INFO L273 TraceCheckUtils]: 56: Hoare triple {24995#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24995#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:30,996 INFO L273 TraceCheckUtils]: 57: Hoare triple {24995#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24996#(<= main_~i~1 26)} is VALID [2018-11-23 12:27:30,997 INFO L273 TraceCheckUtils]: 58: Hoare triple {24996#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24996#(<= main_~i~1 26)} is VALID [2018-11-23 12:27:30,997 INFO L273 TraceCheckUtils]: 59: Hoare triple {24996#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24997#(<= main_~i~1 27)} is VALID [2018-11-23 12:27:30,998 INFO L273 TraceCheckUtils]: 60: Hoare triple {24997#(<= main_~i~1 27)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24997#(<= main_~i~1 27)} is VALID [2018-11-23 12:27:30,999 INFO L273 TraceCheckUtils]: 61: Hoare triple {24997#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24998#(<= main_~i~1 28)} is VALID [2018-11-23 12:27:30,999 INFO L273 TraceCheckUtils]: 62: Hoare triple {24998#(<= main_~i~1 28)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24998#(<= main_~i~1 28)} is VALID [2018-11-23 12:27:31,000 INFO L273 TraceCheckUtils]: 63: Hoare triple {24998#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {24999#(<= main_~i~1 29)} is VALID [2018-11-23 12:27:31,000 INFO L273 TraceCheckUtils]: 64: Hoare triple {24999#(<= main_~i~1 29)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {24999#(<= main_~i~1 29)} is VALID [2018-11-23 12:27:31,001 INFO L273 TraceCheckUtils]: 65: Hoare triple {24999#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25000#(<= main_~i~1 30)} is VALID [2018-11-23 12:27:31,002 INFO L273 TraceCheckUtils]: 66: Hoare triple {25000#(<= main_~i~1 30)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25000#(<= main_~i~1 30)} is VALID [2018-11-23 12:27:31,002 INFO L273 TraceCheckUtils]: 67: Hoare triple {25000#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25001#(<= main_~i~1 31)} is VALID [2018-11-23 12:27:31,003 INFO L273 TraceCheckUtils]: 68: Hoare triple {25001#(<= main_~i~1 31)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {25001#(<= main_~i~1 31)} is VALID [2018-11-23 12:27:31,004 INFO L273 TraceCheckUtils]: 69: Hoare triple {25001#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {25002#(<= main_~i~1 32)} is VALID [2018-11-23 12:27:31,004 INFO L273 TraceCheckUtils]: 70: Hoare triple {25002#(<= main_~i~1 32)} assume !(~i~1 < 100000); {24969#false} is VALID [2018-11-23 12:27:31,004 INFO L256 TraceCheckUtils]: 71: Hoare triple {24969#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {24969#false} is VALID [2018-11-23 12:27:31,005 INFO L273 TraceCheckUtils]: 72: Hoare triple {24969#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {24969#false} is VALID [2018-11-23 12:27:31,005 INFO L273 TraceCheckUtils]: 73: Hoare triple {24969#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:31,005 INFO L273 TraceCheckUtils]: 74: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:31,005 INFO L273 TraceCheckUtils]: 75: Hoare triple {24969#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:31,005 INFO L273 TraceCheckUtils]: 76: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:31,006 INFO L273 TraceCheckUtils]: 77: Hoare triple {24969#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:31,006 INFO L273 TraceCheckUtils]: 78: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:31,006 INFO L273 TraceCheckUtils]: 79: Hoare triple {24969#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:31,006 INFO L273 TraceCheckUtils]: 80: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:31,006 INFO L273 TraceCheckUtils]: 81: Hoare triple {24969#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:31,006 INFO L273 TraceCheckUtils]: 82: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:31,007 INFO L273 TraceCheckUtils]: 83: Hoare triple {24969#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:31,007 INFO L273 TraceCheckUtils]: 84: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:31,007 INFO L273 TraceCheckUtils]: 85: Hoare triple {24969#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:31,007 INFO L273 TraceCheckUtils]: 86: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:31,007 INFO L273 TraceCheckUtils]: 87: Hoare triple {24969#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:31,007 INFO L273 TraceCheckUtils]: 88: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:31,007 INFO L273 TraceCheckUtils]: 89: Hoare triple {24969#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:31,007 INFO L273 TraceCheckUtils]: 90: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:31,007 INFO L273 TraceCheckUtils]: 91: Hoare triple {24969#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:31,008 INFO L273 TraceCheckUtils]: 92: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:31,008 INFO L273 TraceCheckUtils]: 93: Hoare triple {24969#false} assume !(~i~0 < 100000); {24969#false} is VALID [2018-11-23 12:27:31,008 INFO L273 TraceCheckUtils]: 94: Hoare triple {24969#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {24969#false} is VALID [2018-11-23 12:27:31,008 INFO L273 TraceCheckUtils]: 95: Hoare triple {24969#false} assume true; {24969#false} is VALID [2018-11-23 12:27:31,008 INFO L268 TraceCheckUtils]: 96: Hoare quadruple {24969#false} {24969#false} #70#return; {24969#false} is VALID [2018-11-23 12:27:31,008 INFO L273 TraceCheckUtils]: 97: Hoare triple {24969#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {24969#false} is VALID [2018-11-23 12:27:31,008 INFO L256 TraceCheckUtils]: 98: Hoare triple {24969#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {24969#false} is VALID [2018-11-23 12:27:31,008 INFO L273 TraceCheckUtils]: 99: Hoare triple {24969#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {24969#false} is VALID [2018-11-23 12:27:31,008 INFO L273 TraceCheckUtils]: 100: Hoare triple {24969#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:31,009 INFO L273 TraceCheckUtils]: 101: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:31,009 INFO L273 TraceCheckUtils]: 102: Hoare triple {24969#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:31,009 INFO L273 TraceCheckUtils]: 103: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:31,009 INFO L273 TraceCheckUtils]: 104: Hoare triple {24969#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:31,009 INFO L273 TraceCheckUtils]: 105: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:31,009 INFO L273 TraceCheckUtils]: 106: Hoare triple {24969#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:31,009 INFO L273 TraceCheckUtils]: 107: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:31,009 INFO L273 TraceCheckUtils]: 108: Hoare triple {24969#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:31,009 INFO L273 TraceCheckUtils]: 109: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:31,009 INFO L273 TraceCheckUtils]: 110: Hoare triple {24969#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:31,010 INFO L273 TraceCheckUtils]: 111: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:31,010 INFO L273 TraceCheckUtils]: 112: Hoare triple {24969#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:31,010 INFO L273 TraceCheckUtils]: 113: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:31,010 INFO L273 TraceCheckUtils]: 114: Hoare triple {24969#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:31,010 INFO L273 TraceCheckUtils]: 115: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:31,010 INFO L273 TraceCheckUtils]: 116: Hoare triple {24969#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:31,010 INFO L273 TraceCheckUtils]: 117: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:31,010 INFO L273 TraceCheckUtils]: 118: Hoare triple {24969#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:31,010 INFO L273 TraceCheckUtils]: 119: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:31,010 INFO L273 TraceCheckUtils]: 120: Hoare triple {24969#false} assume !(~i~0 < 100000); {24969#false} is VALID [2018-11-23 12:27:31,011 INFO L273 TraceCheckUtils]: 121: Hoare triple {24969#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {24969#false} is VALID [2018-11-23 12:27:31,011 INFO L273 TraceCheckUtils]: 122: Hoare triple {24969#false} assume true; {24969#false} is VALID [2018-11-23 12:27:31,011 INFO L268 TraceCheckUtils]: 123: Hoare quadruple {24969#false} {24969#false} #72#return; {24969#false} is VALID [2018-11-23 12:27:31,011 INFO L273 TraceCheckUtils]: 124: Hoare triple {24969#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {24969#false} is VALID [2018-11-23 12:27:31,011 INFO L273 TraceCheckUtils]: 125: Hoare triple {24969#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {24969#false} is VALID [2018-11-23 12:27:31,011 INFO L273 TraceCheckUtils]: 126: Hoare triple {24969#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {24969#false} is VALID [2018-11-23 12:27:31,011 INFO L273 TraceCheckUtils]: 127: Hoare triple {24969#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {24969#false} is VALID [2018-11-23 12:27:31,011 INFO L273 TraceCheckUtils]: 128: Hoare triple {24969#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {24969#false} is VALID [2018-11-23 12:27:31,011 INFO L273 TraceCheckUtils]: 129: Hoare triple {24969#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {24969#false} is VALID [2018-11-23 12:27:31,011 INFO L273 TraceCheckUtils]: 130: Hoare triple {24969#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {24969#false} is VALID [2018-11-23 12:27:31,012 INFO L273 TraceCheckUtils]: 131: Hoare triple {24969#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {24969#false} is VALID [2018-11-23 12:27:31,012 INFO L273 TraceCheckUtils]: 132: Hoare triple {24969#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {24969#false} is VALID [2018-11-23 12:27:31,012 INFO L273 TraceCheckUtils]: 133: Hoare triple {24969#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {24969#false} is VALID [2018-11-23 12:27:31,012 INFO L273 TraceCheckUtils]: 134: Hoare triple {24969#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {24969#false} is VALID [2018-11-23 12:27:31,012 INFO L273 TraceCheckUtils]: 135: Hoare triple {24969#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {24969#false} is VALID [2018-11-23 12:27:31,012 INFO L273 TraceCheckUtils]: 136: Hoare triple {24969#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {24969#false} is VALID [2018-11-23 12:27:31,012 INFO L273 TraceCheckUtils]: 137: Hoare triple {24969#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {24969#false} is VALID [2018-11-23 12:27:31,012 INFO L273 TraceCheckUtils]: 138: Hoare triple {24969#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {24969#false} is VALID [2018-11-23 12:27:31,012 INFO L273 TraceCheckUtils]: 139: Hoare triple {24969#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {24969#false} is VALID [2018-11-23 12:27:31,013 INFO L273 TraceCheckUtils]: 140: Hoare triple {24969#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {24969#false} is VALID [2018-11-23 12:27:31,013 INFO L273 TraceCheckUtils]: 141: Hoare triple {24969#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {24969#false} is VALID [2018-11-23 12:27:31,013 INFO L273 TraceCheckUtils]: 142: Hoare triple {24969#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {24969#false} is VALID [2018-11-23 12:27:31,013 INFO L273 TraceCheckUtils]: 143: Hoare triple {24969#false} assume !(~i~2 < 99999); {24969#false} is VALID [2018-11-23 12:27:31,013 INFO L273 TraceCheckUtils]: 144: Hoare triple {24969#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {24969#false} is VALID [2018-11-23 12:27:31,013 INFO L256 TraceCheckUtils]: 145: Hoare triple {24969#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {24969#false} is VALID [2018-11-23 12:27:31,013 INFO L273 TraceCheckUtils]: 146: Hoare triple {24969#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {24969#false} is VALID [2018-11-23 12:27:31,013 INFO L273 TraceCheckUtils]: 147: Hoare triple {24969#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:31,013 INFO L273 TraceCheckUtils]: 148: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:31,013 INFO L273 TraceCheckUtils]: 149: Hoare triple {24969#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:31,014 INFO L273 TraceCheckUtils]: 150: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:31,014 INFO L273 TraceCheckUtils]: 151: Hoare triple {24969#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:31,014 INFO L273 TraceCheckUtils]: 152: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:31,014 INFO L273 TraceCheckUtils]: 153: Hoare triple {24969#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:31,014 INFO L273 TraceCheckUtils]: 154: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:31,014 INFO L273 TraceCheckUtils]: 155: Hoare triple {24969#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:31,014 INFO L273 TraceCheckUtils]: 156: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:31,014 INFO L273 TraceCheckUtils]: 157: Hoare triple {24969#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:31,014 INFO L273 TraceCheckUtils]: 158: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:31,014 INFO L273 TraceCheckUtils]: 159: Hoare triple {24969#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:31,015 INFO L273 TraceCheckUtils]: 160: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:31,015 INFO L273 TraceCheckUtils]: 161: Hoare triple {24969#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:31,015 INFO L273 TraceCheckUtils]: 162: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:31,015 INFO L273 TraceCheckUtils]: 163: Hoare triple {24969#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:31,015 INFO L273 TraceCheckUtils]: 164: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:31,015 INFO L273 TraceCheckUtils]: 165: Hoare triple {24969#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:27:31,015 INFO L273 TraceCheckUtils]: 166: Hoare triple {24969#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24969#false} is VALID [2018-11-23 12:27:31,015 INFO L273 TraceCheckUtils]: 167: Hoare triple {24969#false} assume !(~i~0 < 100000); {24969#false} is VALID [2018-11-23 12:27:31,015 INFO L273 TraceCheckUtils]: 168: Hoare triple {24969#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {24969#false} is VALID [2018-11-23 12:27:31,015 INFO L273 TraceCheckUtils]: 169: Hoare triple {24969#false} assume true; {24969#false} is VALID [2018-11-23 12:27:31,016 INFO L268 TraceCheckUtils]: 170: Hoare quadruple {24969#false} {24969#false} #74#return; {24969#false} is VALID [2018-11-23 12:27:31,016 INFO L273 TraceCheckUtils]: 171: Hoare triple {24969#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {24969#false} is VALID [2018-11-23 12:27:31,016 INFO L273 TraceCheckUtils]: 172: Hoare triple {24969#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {24969#false} is VALID [2018-11-23 12:27:31,016 INFO L273 TraceCheckUtils]: 173: Hoare triple {24969#false} assume !false; {24969#false} is VALID [2018-11-23 12:27:31,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2018-11-23 12:27:31,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:31,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2018-11-23 12:27:31,049 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 174 [2018-11-23 12:27:31,050 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:31,050 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-23 12:27:31,149 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:31,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-23 12:27:31,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-23 12:27:31,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 12:27:31,151 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand 36 states. [2018-11-23 12:27:32,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:32,071 INFO L93 Difference]: Finished difference Result 182 states and 190 transitions. [2018-11-23 12:27:32,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 12:27:32,071 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 174 [2018-11-23 12:27:32,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:32,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:27:32,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 118 transitions. [2018-11-23 12:27:32,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:27:32,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 118 transitions. [2018-11-23 12:27:32,074 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 118 transitions. [2018-11-23 12:27:32,180 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:32,183 INFO L225 Difference]: With dead ends: 182 [2018-11-23 12:27:32,183 INFO L226 Difference]: Without dead ends: 128 [2018-11-23 12:27:32,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 12:27:32,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-23 12:27:32,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2018-11-23 12:27:32,326 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:32,326 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand 127 states. [2018-11-23 12:27:32,327 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 127 states. [2018-11-23 12:27:32,327 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 127 states. [2018-11-23 12:27:32,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:32,328 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2018-11-23 12:27:32,329 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 132 transitions. [2018-11-23 12:27:32,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:32,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:32,329 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 128 states. [2018-11-23 12:27:32,329 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 128 states. [2018-11-23 12:27:32,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:32,331 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2018-11-23 12:27:32,331 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 132 transitions. [2018-11-23 12:27:32,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:32,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:32,331 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:32,331 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:32,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-23 12:27:32,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 131 transitions. [2018-11-23 12:27:32,333 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 131 transitions. Word has length 174 [2018-11-23 12:27:32,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:32,333 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 131 transitions. [2018-11-23 12:27:32,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-23 12:27:32,333 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2018-11-23 12:27:32,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-23 12:27:32,334 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:32,334 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 30, 30, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:27:32,334 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:32,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:32,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1186102535, now seen corresponding path program 33 times [2018-11-23 12:27:32,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:32,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:32,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:32,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:32,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:32,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:34,156 INFO L256 TraceCheckUtils]: 0: Hoare triple {26241#true} call ULTIMATE.init(); {26241#true} is VALID [2018-11-23 12:27:34,157 INFO L273 TraceCheckUtils]: 1: Hoare triple {26241#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26241#true} is VALID [2018-11-23 12:27:34,157 INFO L273 TraceCheckUtils]: 2: Hoare triple {26241#true} assume true; {26241#true} is VALID [2018-11-23 12:27:34,157 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26241#true} {26241#true} #66#return; {26241#true} is VALID [2018-11-23 12:27:34,157 INFO L256 TraceCheckUtils]: 4: Hoare triple {26241#true} call #t~ret13 := main(); {26241#true} is VALID [2018-11-23 12:27:34,158 INFO L273 TraceCheckUtils]: 5: Hoare triple {26241#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; {26243#(= main_~i~1 0)} is VALID [2018-11-23 12:27:34,158 INFO L273 TraceCheckUtils]: 6: Hoare triple {26243#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26243#(= main_~i~1 0)} is VALID [2018-11-23 12:27:34,159 INFO L273 TraceCheckUtils]: 7: Hoare triple {26243#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26244#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:34,160 INFO L273 TraceCheckUtils]: 8: Hoare triple {26244#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26244#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:34,160 INFO L273 TraceCheckUtils]: 9: Hoare triple {26244#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26245#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:34,161 INFO L273 TraceCheckUtils]: 10: Hoare triple {26245#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26245#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:34,162 INFO L273 TraceCheckUtils]: 11: Hoare triple {26245#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26246#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:34,162 INFO L273 TraceCheckUtils]: 12: Hoare triple {26246#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26246#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:34,163 INFO L273 TraceCheckUtils]: 13: Hoare triple {26246#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26247#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:34,163 INFO L273 TraceCheckUtils]: 14: Hoare triple {26247#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26247#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:34,164 INFO L273 TraceCheckUtils]: 15: Hoare triple {26247#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26248#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:34,165 INFO L273 TraceCheckUtils]: 16: Hoare triple {26248#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26248#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:34,165 INFO L273 TraceCheckUtils]: 17: Hoare triple {26248#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26249#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:34,166 INFO L273 TraceCheckUtils]: 18: Hoare triple {26249#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26249#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:34,167 INFO L273 TraceCheckUtils]: 19: Hoare triple {26249#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26250#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:34,167 INFO L273 TraceCheckUtils]: 20: Hoare triple {26250#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26250#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:34,168 INFO L273 TraceCheckUtils]: 21: Hoare triple {26250#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26251#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:34,168 INFO L273 TraceCheckUtils]: 22: Hoare triple {26251#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26251#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:34,169 INFO L273 TraceCheckUtils]: 23: Hoare triple {26251#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26252#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:34,170 INFO L273 TraceCheckUtils]: 24: Hoare triple {26252#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26252#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:34,170 INFO L273 TraceCheckUtils]: 25: Hoare triple {26252#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26253#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:34,171 INFO L273 TraceCheckUtils]: 26: Hoare triple {26253#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26253#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:34,172 INFO L273 TraceCheckUtils]: 27: Hoare triple {26253#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26254#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:34,172 INFO L273 TraceCheckUtils]: 28: Hoare triple {26254#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26254#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:34,173 INFO L273 TraceCheckUtils]: 29: Hoare triple {26254#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26255#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:34,173 INFO L273 TraceCheckUtils]: 30: Hoare triple {26255#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26255#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:34,174 INFO L273 TraceCheckUtils]: 31: Hoare triple {26255#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26256#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:34,174 INFO L273 TraceCheckUtils]: 32: Hoare triple {26256#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26256#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:34,175 INFO L273 TraceCheckUtils]: 33: Hoare triple {26256#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26257#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:34,176 INFO L273 TraceCheckUtils]: 34: Hoare triple {26257#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26257#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:34,176 INFO L273 TraceCheckUtils]: 35: Hoare triple {26257#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26258#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:34,177 INFO L273 TraceCheckUtils]: 36: Hoare triple {26258#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26258#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:34,178 INFO L273 TraceCheckUtils]: 37: Hoare triple {26258#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26259#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:34,178 INFO L273 TraceCheckUtils]: 38: Hoare triple {26259#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26259#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:34,179 INFO L273 TraceCheckUtils]: 39: Hoare triple {26259#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26260#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:34,179 INFO L273 TraceCheckUtils]: 40: Hoare triple {26260#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26260#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:34,180 INFO L273 TraceCheckUtils]: 41: Hoare triple {26260#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26261#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:34,181 INFO L273 TraceCheckUtils]: 42: Hoare triple {26261#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26261#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:34,181 INFO L273 TraceCheckUtils]: 43: Hoare triple {26261#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26262#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:34,182 INFO L273 TraceCheckUtils]: 44: Hoare triple {26262#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26262#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:34,183 INFO L273 TraceCheckUtils]: 45: Hoare triple {26262#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26263#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:34,183 INFO L273 TraceCheckUtils]: 46: Hoare triple {26263#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26263#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:34,184 INFO L273 TraceCheckUtils]: 47: Hoare triple {26263#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26264#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:34,184 INFO L273 TraceCheckUtils]: 48: Hoare triple {26264#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26264#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:34,185 INFO L273 TraceCheckUtils]: 49: Hoare triple {26264#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26265#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:34,185 INFO L273 TraceCheckUtils]: 50: Hoare triple {26265#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26265#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:34,186 INFO L273 TraceCheckUtils]: 51: Hoare triple {26265#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26266#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:34,187 INFO L273 TraceCheckUtils]: 52: Hoare triple {26266#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26266#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:34,187 INFO L273 TraceCheckUtils]: 53: Hoare triple {26266#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26267#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:34,188 INFO L273 TraceCheckUtils]: 54: Hoare triple {26267#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26267#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:34,189 INFO L273 TraceCheckUtils]: 55: Hoare triple {26267#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26268#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:34,189 INFO L273 TraceCheckUtils]: 56: Hoare triple {26268#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26268#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:34,190 INFO L273 TraceCheckUtils]: 57: Hoare triple {26268#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26269#(<= main_~i~1 26)} is VALID [2018-11-23 12:27:34,190 INFO L273 TraceCheckUtils]: 58: Hoare triple {26269#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26269#(<= main_~i~1 26)} is VALID [2018-11-23 12:27:34,191 INFO L273 TraceCheckUtils]: 59: Hoare triple {26269#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26270#(<= main_~i~1 27)} is VALID [2018-11-23 12:27:34,192 INFO L273 TraceCheckUtils]: 60: Hoare triple {26270#(<= main_~i~1 27)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26270#(<= main_~i~1 27)} is VALID [2018-11-23 12:27:34,192 INFO L273 TraceCheckUtils]: 61: Hoare triple {26270#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26271#(<= main_~i~1 28)} is VALID [2018-11-23 12:27:34,193 INFO L273 TraceCheckUtils]: 62: Hoare triple {26271#(<= main_~i~1 28)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26271#(<= main_~i~1 28)} is VALID [2018-11-23 12:27:34,194 INFO L273 TraceCheckUtils]: 63: Hoare triple {26271#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26272#(<= main_~i~1 29)} is VALID [2018-11-23 12:27:34,194 INFO L273 TraceCheckUtils]: 64: Hoare triple {26272#(<= main_~i~1 29)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26272#(<= main_~i~1 29)} is VALID [2018-11-23 12:27:34,195 INFO L273 TraceCheckUtils]: 65: Hoare triple {26272#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26273#(<= main_~i~1 30)} is VALID [2018-11-23 12:27:34,195 INFO L273 TraceCheckUtils]: 66: Hoare triple {26273#(<= main_~i~1 30)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26273#(<= main_~i~1 30)} is VALID [2018-11-23 12:27:34,196 INFO L273 TraceCheckUtils]: 67: Hoare triple {26273#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26274#(<= main_~i~1 31)} is VALID [2018-11-23 12:27:34,197 INFO L273 TraceCheckUtils]: 68: Hoare triple {26274#(<= main_~i~1 31)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26274#(<= main_~i~1 31)} is VALID [2018-11-23 12:27:34,197 INFO L273 TraceCheckUtils]: 69: Hoare triple {26274#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26275#(<= main_~i~1 32)} is VALID [2018-11-23 12:27:34,198 INFO L273 TraceCheckUtils]: 70: Hoare triple {26275#(<= main_~i~1 32)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26275#(<= main_~i~1 32)} is VALID [2018-11-23 12:27:34,199 INFO L273 TraceCheckUtils]: 71: Hoare triple {26275#(<= main_~i~1 32)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26276#(<= main_~i~1 33)} is VALID [2018-11-23 12:27:34,199 INFO L273 TraceCheckUtils]: 72: Hoare triple {26276#(<= main_~i~1 33)} assume !(~i~1 < 100000); {26242#false} is VALID [2018-11-23 12:27:34,199 INFO L256 TraceCheckUtils]: 73: Hoare triple {26242#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {26241#true} is VALID [2018-11-23 12:27:34,200 INFO L273 TraceCheckUtils]: 74: Hoare triple {26241#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {26241#true} is VALID [2018-11-23 12:27:34,200 INFO L273 TraceCheckUtils]: 75: Hoare triple {26241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:34,200 INFO L273 TraceCheckUtils]: 76: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:34,200 INFO L273 TraceCheckUtils]: 77: Hoare triple {26241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:34,200 INFO L273 TraceCheckUtils]: 78: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:34,200 INFO L273 TraceCheckUtils]: 79: Hoare triple {26241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:34,201 INFO L273 TraceCheckUtils]: 80: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:34,201 INFO L273 TraceCheckUtils]: 81: Hoare triple {26241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:34,201 INFO L273 TraceCheckUtils]: 82: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:34,201 INFO L273 TraceCheckUtils]: 83: Hoare triple {26241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:34,201 INFO L273 TraceCheckUtils]: 84: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:34,201 INFO L273 TraceCheckUtils]: 85: Hoare triple {26241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:34,202 INFO L273 TraceCheckUtils]: 86: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:34,202 INFO L273 TraceCheckUtils]: 87: Hoare triple {26241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:34,202 INFO L273 TraceCheckUtils]: 88: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:34,202 INFO L273 TraceCheckUtils]: 89: Hoare triple {26241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:34,202 INFO L273 TraceCheckUtils]: 90: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:34,203 INFO L273 TraceCheckUtils]: 91: Hoare triple {26241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:34,203 INFO L273 TraceCheckUtils]: 92: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:34,203 INFO L273 TraceCheckUtils]: 93: Hoare triple {26241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:34,203 INFO L273 TraceCheckUtils]: 94: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:34,203 INFO L273 TraceCheckUtils]: 95: Hoare triple {26241#true} assume !(~i~0 < 100000); {26241#true} is VALID [2018-11-23 12:27:34,203 INFO L273 TraceCheckUtils]: 96: Hoare triple {26241#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {26241#true} is VALID [2018-11-23 12:27:34,203 INFO L273 TraceCheckUtils]: 97: Hoare triple {26241#true} assume true; {26241#true} is VALID [2018-11-23 12:27:34,203 INFO L268 TraceCheckUtils]: 98: Hoare quadruple {26241#true} {26242#false} #70#return; {26242#false} is VALID [2018-11-23 12:27:34,203 INFO L273 TraceCheckUtils]: 99: Hoare triple {26242#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {26242#false} is VALID [2018-11-23 12:27:34,204 INFO L256 TraceCheckUtils]: 100: Hoare triple {26242#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {26241#true} is VALID [2018-11-23 12:27:34,204 INFO L273 TraceCheckUtils]: 101: Hoare triple {26241#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {26241#true} is VALID [2018-11-23 12:27:34,204 INFO L273 TraceCheckUtils]: 102: Hoare triple {26241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:34,204 INFO L273 TraceCheckUtils]: 103: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:34,204 INFO L273 TraceCheckUtils]: 104: Hoare triple {26241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:34,204 INFO L273 TraceCheckUtils]: 105: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:34,204 INFO L273 TraceCheckUtils]: 106: Hoare triple {26241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:34,204 INFO L273 TraceCheckUtils]: 107: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:34,204 INFO L273 TraceCheckUtils]: 108: Hoare triple {26241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:34,204 INFO L273 TraceCheckUtils]: 109: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:34,205 INFO L273 TraceCheckUtils]: 110: Hoare triple {26241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:34,205 INFO L273 TraceCheckUtils]: 111: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:34,205 INFO L273 TraceCheckUtils]: 112: Hoare triple {26241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:34,205 INFO L273 TraceCheckUtils]: 113: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:34,205 INFO L273 TraceCheckUtils]: 114: Hoare triple {26241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:34,205 INFO L273 TraceCheckUtils]: 115: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:34,205 INFO L273 TraceCheckUtils]: 116: Hoare triple {26241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:34,205 INFO L273 TraceCheckUtils]: 117: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:34,205 INFO L273 TraceCheckUtils]: 118: Hoare triple {26241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:34,206 INFO L273 TraceCheckUtils]: 119: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:34,206 INFO L273 TraceCheckUtils]: 120: Hoare triple {26241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:34,206 INFO L273 TraceCheckUtils]: 121: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:34,206 INFO L273 TraceCheckUtils]: 122: Hoare triple {26241#true} assume !(~i~0 < 100000); {26241#true} is VALID [2018-11-23 12:27:34,206 INFO L273 TraceCheckUtils]: 123: Hoare triple {26241#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {26241#true} is VALID [2018-11-23 12:27:34,206 INFO L273 TraceCheckUtils]: 124: Hoare triple {26241#true} assume true; {26241#true} is VALID [2018-11-23 12:27:34,206 INFO L268 TraceCheckUtils]: 125: Hoare quadruple {26241#true} {26242#false} #72#return; {26242#false} is VALID [2018-11-23 12:27:34,206 INFO L273 TraceCheckUtils]: 126: Hoare triple {26242#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {26242#false} is VALID [2018-11-23 12:27:34,206 INFO L273 TraceCheckUtils]: 127: Hoare triple {26242#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26242#false} is VALID [2018-11-23 12:27:34,206 INFO L273 TraceCheckUtils]: 128: Hoare triple {26242#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26242#false} is VALID [2018-11-23 12:27:34,207 INFO L273 TraceCheckUtils]: 129: Hoare triple {26242#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26242#false} is VALID [2018-11-23 12:27:34,207 INFO L273 TraceCheckUtils]: 130: Hoare triple {26242#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26242#false} is VALID [2018-11-23 12:27:34,207 INFO L273 TraceCheckUtils]: 131: Hoare triple {26242#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26242#false} is VALID [2018-11-23 12:27:34,207 INFO L273 TraceCheckUtils]: 132: Hoare triple {26242#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26242#false} is VALID [2018-11-23 12:27:34,207 INFO L273 TraceCheckUtils]: 133: Hoare triple {26242#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26242#false} is VALID [2018-11-23 12:27:34,207 INFO L273 TraceCheckUtils]: 134: Hoare triple {26242#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26242#false} is VALID [2018-11-23 12:27:34,207 INFO L273 TraceCheckUtils]: 135: Hoare triple {26242#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26242#false} is VALID [2018-11-23 12:27:34,207 INFO L273 TraceCheckUtils]: 136: Hoare triple {26242#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26242#false} is VALID [2018-11-23 12:27:34,207 INFO L273 TraceCheckUtils]: 137: Hoare triple {26242#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26242#false} is VALID [2018-11-23 12:27:34,207 INFO L273 TraceCheckUtils]: 138: Hoare triple {26242#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26242#false} is VALID [2018-11-23 12:27:34,208 INFO L273 TraceCheckUtils]: 139: Hoare triple {26242#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26242#false} is VALID [2018-11-23 12:27:34,208 INFO L273 TraceCheckUtils]: 140: Hoare triple {26242#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26242#false} is VALID [2018-11-23 12:27:34,208 INFO L273 TraceCheckUtils]: 141: Hoare triple {26242#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26242#false} is VALID [2018-11-23 12:27:34,208 INFO L273 TraceCheckUtils]: 142: Hoare triple {26242#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26242#false} is VALID [2018-11-23 12:27:34,208 INFO L273 TraceCheckUtils]: 143: Hoare triple {26242#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26242#false} is VALID [2018-11-23 12:27:34,208 INFO L273 TraceCheckUtils]: 144: Hoare triple {26242#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26242#false} is VALID [2018-11-23 12:27:34,208 INFO L273 TraceCheckUtils]: 145: Hoare triple {26242#false} assume !(~i~2 < 99999); {26242#false} is VALID [2018-11-23 12:27:34,208 INFO L273 TraceCheckUtils]: 146: Hoare triple {26242#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {26242#false} is VALID [2018-11-23 12:27:34,208 INFO L256 TraceCheckUtils]: 147: Hoare triple {26242#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {26241#true} is VALID [2018-11-23 12:27:34,208 INFO L273 TraceCheckUtils]: 148: Hoare triple {26241#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {26241#true} is VALID [2018-11-23 12:27:34,209 INFO L273 TraceCheckUtils]: 149: Hoare triple {26241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:34,209 INFO L273 TraceCheckUtils]: 150: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:34,209 INFO L273 TraceCheckUtils]: 151: Hoare triple {26241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:34,209 INFO L273 TraceCheckUtils]: 152: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:34,209 INFO L273 TraceCheckUtils]: 153: Hoare triple {26241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:34,209 INFO L273 TraceCheckUtils]: 154: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:34,209 INFO L273 TraceCheckUtils]: 155: Hoare triple {26241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:34,209 INFO L273 TraceCheckUtils]: 156: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:34,209 INFO L273 TraceCheckUtils]: 157: Hoare triple {26241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:34,209 INFO L273 TraceCheckUtils]: 158: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:34,210 INFO L273 TraceCheckUtils]: 159: Hoare triple {26241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:34,210 INFO L273 TraceCheckUtils]: 160: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:34,210 INFO L273 TraceCheckUtils]: 161: Hoare triple {26241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:34,210 INFO L273 TraceCheckUtils]: 162: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:34,210 INFO L273 TraceCheckUtils]: 163: Hoare triple {26241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:34,210 INFO L273 TraceCheckUtils]: 164: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:34,210 INFO L273 TraceCheckUtils]: 165: Hoare triple {26241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:34,210 INFO L273 TraceCheckUtils]: 166: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:34,210 INFO L273 TraceCheckUtils]: 167: Hoare triple {26241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:34,210 INFO L273 TraceCheckUtils]: 168: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:34,211 INFO L273 TraceCheckUtils]: 169: Hoare triple {26241#true} assume !(~i~0 < 100000); {26241#true} is VALID [2018-11-23 12:27:34,211 INFO L273 TraceCheckUtils]: 170: Hoare triple {26241#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {26241#true} is VALID [2018-11-23 12:27:34,211 INFO L273 TraceCheckUtils]: 171: Hoare triple {26241#true} assume true; {26241#true} is VALID [2018-11-23 12:27:34,211 INFO L268 TraceCheckUtils]: 172: Hoare quadruple {26241#true} {26242#false} #74#return; {26242#false} is VALID [2018-11-23 12:27:34,211 INFO L273 TraceCheckUtils]: 173: Hoare triple {26242#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {26242#false} is VALID [2018-11-23 12:27:34,211 INFO L273 TraceCheckUtils]: 174: Hoare triple {26242#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {26242#false} is VALID [2018-11-23 12:27:34,211 INFO L273 TraceCheckUtils]: 175: Hoare triple {26242#false} assume !false; {26242#false} is VALID [2018-11-23 12:27:34,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2018-11-23 12:27:34,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:34,225 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:27:34,234 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:27:34,520 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-23 12:27:34,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:34,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:34,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:35,062 INFO L256 TraceCheckUtils]: 0: Hoare triple {26241#true} call ULTIMATE.init(); {26241#true} is VALID [2018-11-23 12:27:35,063 INFO L273 TraceCheckUtils]: 1: Hoare triple {26241#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26241#true} is VALID [2018-11-23 12:27:35,063 INFO L273 TraceCheckUtils]: 2: Hoare triple {26241#true} assume true; {26241#true} is VALID [2018-11-23 12:27:35,063 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26241#true} {26241#true} #66#return; {26241#true} is VALID [2018-11-23 12:27:35,063 INFO L256 TraceCheckUtils]: 4: Hoare triple {26241#true} call #t~ret13 := main(); {26241#true} is VALID [2018-11-23 12:27:35,063 INFO L273 TraceCheckUtils]: 5: Hoare triple {26241#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; {26241#true} is VALID [2018-11-23 12:27:35,063 INFO L273 TraceCheckUtils]: 6: Hoare triple {26241#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:35,064 INFO L273 TraceCheckUtils]: 7: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:35,064 INFO L273 TraceCheckUtils]: 8: Hoare triple {26241#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:35,064 INFO L273 TraceCheckUtils]: 9: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:35,064 INFO L273 TraceCheckUtils]: 10: Hoare triple {26241#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:35,064 INFO L273 TraceCheckUtils]: 11: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:35,065 INFO L273 TraceCheckUtils]: 12: Hoare triple {26241#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:35,065 INFO L273 TraceCheckUtils]: 13: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:35,065 INFO L273 TraceCheckUtils]: 14: Hoare triple {26241#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:35,065 INFO L273 TraceCheckUtils]: 15: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:35,065 INFO L273 TraceCheckUtils]: 16: Hoare triple {26241#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:35,065 INFO L273 TraceCheckUtils]: 17: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:35,066 INFO L273 TraceCheckUtils]: 18: Hoare triple {26241#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:35,066 INFO L273 TraceCheckUtils]: 19: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:35,066 INFO L273 TraceCheckUtils]: 20: Hoare triple {26241#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:35,066 INFO L273 TraceCheckUtils]: 21: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:35,066 INFO L273 TraceCheckUtils]: 22: Hoare triple {26241#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:35,066 INFO L273 TraceCheckUtils]: 23: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:35,066 INFO L273 TraceCheckUtils]: 24: Hoare triple {26241#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:35,066 INFO L273 TraceCheckUtils]: 25: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:35,066 INFO L273 TraceCheckUtils]: 26: Hoare triple {26241#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:35,066 INFO L273 TraceCheckUtils]: 27: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:35,067 INFO L273 TraceCheckUtils]: 28: Hoare triple {26241#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:35,067 INFO L273 TraceCheckUtils]: 29: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:35,067 INFO L273 TraceCheckUtils]: 30: Hoare triple {26241#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:35,067 INFO L273 TraceCheckUtils]: 31: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:35,067 INFO L273 TraceCheckUtils]: 32: Hoare triple {26241#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:35,067 INFO L273 TraceCheckUtils]: 33: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:35,067 INFO L273 TraceCheckUtils]: 34: Hoare triple {26241#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:35,067 INFO L273 TraceCheckUtils]: 35: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:35,067 INFO L273 TraceCheckUtils]: 36: Hoare triple {26241#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:35,067 INFO L273 TraceCheckUtils]: 37: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:35,068 INFO L273 TraceCheckUtils]: 38: Hoare triple {26241#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:35,068 INFO L273 TraceCheckUtils]: 39: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:35,068 INFO L273 TraceCheckUtils]: 40: Hoare triple {26241#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:35,068 INFO L273 TraceCheckUtils]: 41: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:35,068 INFO L273 TraceCheckUtils]: 42: Hoare triple {26241#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:35,068 INFO L273 TraceCheckUtils]: 43: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:35,068 INFO L273 TraceCheckUtils]: 44: Hoare triple {26241#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:35,068 INFO L273 TraceCheckUtils]: 45: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:35,068 INFO L273 TraceCheckUtils]: 46: Hoare triple {26241#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:35,068 INFO L273 TraceCheckUtils]: 47: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:35,069 INFO L273 TraceCheckUtils]: 48: Hoare triple {26241#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:35,069 INFO L273 TraceCheckUtils]: 49: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:35,069 INFO L273 TraceCheckUtils]: 50: Hoare triple {26241#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:35,069 INFO L273 TraceCheckUtils]: 51: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:35,069 INFO L273 TraceCheckUtils]: 52: Hoare triple {26241#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:35,069 INFO L273 TraceCheckUtils]: 53: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:35,069 INFO L273 TraceCheckUtils]: 54: Hoare triple {26241#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:35,069 INFO L273 TraceCheckUtils]: 55: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:35,069 INFO L273 TraceCheckUtils]: 56: Hoare triple {26241#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:35,070 INFO L273 TraceCheckUtils]: 57: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:35,070 INFO L273 TraceCheckUtils]: 58: Hoare triple {26241#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:35,070 INFO L273 TraceCheckUtils]: 59: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:35,070 INFO L273 TraceCheckUtils]: 60: Hoare triple {26241#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:35,070 INFO L273 TraceCheckUtils]: 61: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:35,070 INFO L273 TraceCheckUtils]: 62: Hoare triple {26241#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:35,070 INFO L273 TraceCheckUtils]: 63: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:35,070 INFO L273 TraceCheckUtils]: 64: Hoare triple {26241#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:35,070 INFO L273 TraceCheckUtils]: 65: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:35,070 INFO L273 TraceCheckUtils]: 66: Hoare triple {26241#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:35,071 INFO L273 TraceCheckUtils]: 67: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:35,071 INFO L273 TraceCheckUtils]: 68: Hoare triple {26241#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:35,071 INFO L273 TraceCheckUtils]: 69: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:35,071 INFO L273 TraceCheckUtils]: 70: Hoare triple {26241#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {26241#true} is VALID [2018-11-23 12:27:35,071 INFO L273 TraceCheckUtils]: 71: Hoare triple {26241#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {26241#true} is VALID [2018-11-23 12:27:35,071 INFO L273 TraceCheckUtils]: 72: Hoare triple {26241#true} assume !(~i~1 < 100000); {26241#true} is VALID [2018-11-23 12:27:35,071 INFO L256 TraceCheckUtils]: 73: Hoare triple {26241#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {26241#true} is VALID [2018-11-23 12:27:35,071 INFO L273 TraceCheckUtils]: 74: Hoare triple {26241#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {26241#true} is VALID [2018-11-23 12:27:35,071 INFO L273 TraceCheckUtils]: 75: Hoare triple {26241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:35,071 INFO L273 TraceCheckUtils]: 76: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:35,072 INFO L273 TraceCheckUtils]: 77: Hoare triple {26241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:35,072 INFO L273 TraceCheckUtils]: 78: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:35,072 INFO L273 TraceCheckUtils]: 79: Hoare triple {26241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:35,072 INFO L273 TraceCheckUtils]: 80: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:35,072 INFO L273 TraceCheckUtils]: 81: Hoare triple {26241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:35,072 INFO L273 TraceCheckUtils]: 82: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:35,072 INFO L273 TraceCheckUtils]: 83: Hoare triple {26241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:35,072 INFO L273 TraceCheckUtils]: 84: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:35,072 INFO L273 TraceCheckUtils]: 85: Hoare triple {26241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:35,072 INFO L273 TraceCheckUtils]: 86: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:35,073 INFO L273 TraceCheckUtils]: 87: Hoare triple {26241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:35,073 INFO L273 TraceCheckUtils]: 88: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:35,073 INFO L273 TraceCheckUtils]: 89: Hoare triple {26241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:35,073 INFO L273 TraceCheckUtils]: 90: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:35,073 INFO L273 TraceCheckUtils]: 91: Hoare triple {26241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:35,073 INFO L273 TraceCheckUtils]: 92: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:35,073 INFO L273 TraceCheckUtils]: 93: Hoare triple {26241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:35,073 INFO L273 TraceCheckUtils]: 94: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:35,073 INFO L273 TraceCheckUtils]: 95: Hoare triple {26241#true} assume !(~i~0 < 100000); {26241#true} is VALID [2018-11-23 12:27:35,073 INFO L273 TraceCheckUtils]: 96: Hoare triple {26241#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {26241#true} is VALID [2018-11-23 12:27:35,074 INFO L273 TraceCheckUtils]: 97: Hoare triple {26241#true} assume true; {26241#true} is VALID [2018-11-23 12:27:35,074 INFO L268 TraceCheckUtils]: 98: Hoare quadruple {26241#true} {26241#true} #70#return; {26241#true} is VALID [2018-11-23 12:27:35,074 INFO L273 TraceCheckUtils]: 99: Hoare triple {26241#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {26241#true} is VALID [2018-11-23 12:27:35,074 INFO L256 TraceCheckUtils]: 100: Hoare triple {26241#true} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {26241#true} is VALID [2018-11-23 12:27:35,074 INFO L273 TraceCheckUtils]: 101: Hoare triple {26241#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {26241#true} is VALID [2018-11-23 12:27:35,074 INFO L273 TraceCheckUtils]: 102: Hoare triple {26241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:35,074 INFO L273 TraceCheckUtils]: 103: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:35,074 INFO L273 TraceCheckUtils]: 104: Hoare triple {26241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:35,074 INFO L273 TraceCheckUtils]: 105: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:35,074 INFO L273 TraceCheckUtils]: 106: Hoare triple {26241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:35,075 INFO L273 TraceCheckUtils]: 107: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:35,075 INFO L273 TraceCheckUtils]: 108: Hoare triple {26241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:35,075 INFO L273 TraceCheckUtils]: 109: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:35,075 INFO L273 TraceCheckUtils]: 110: Hoare triple {26241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:35,075 INFO L273 TraceCheckUtils]: 111: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:35,075 INFO L273 TraceCheckUtils]: 112: Hoare triple {26241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:35,075 INFO L273 TraceCheckUtils]: 113: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:35,075 INFO L273 TraceCheckUtils]: 114: Hoare triple {26241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:35,075 INFO L273 TraceCheckUtils]: 115: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:35,075 INFO L273 TraceCheckUtils]: 116: Hoare triple {26241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:35,076 INFO L273 TraceCheckUtils]: 117: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:35,076 INFO L273 TraceCheckUtils]: 118: Hoare triple {26241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:35,076 INFO L273 TraceCheckUtils]: 119: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:35,076 INFO L273 TraceCheckUtils]: 120: Hoare triple {26241#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:27:35,076 INFO L273 TraceCheckUtils]: 121: Hoare triple {26241#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26241#true} is VALID [2018-11-23 12:27:35,076 INFO L273 TraceCheckUtils]: 122: Hoare triple {26241#true} assume !(~i~0 < 100000); {26241#true} is VALID [2018-11-23 12:27:35,076 INFO L273 TraceCheckUtils]: 123: Hoare triple {26241#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {26241#true} is VALID [2018-11-23 12:27:35,076 INFO L273 TraceCheckUtils]: 124: Hoare triple {26241#true} assume true; {26241#true} is VALID [2018-11-23 12:27:35,076 INFO L268 TraceCheckUtils]: 125: Hoare quadruple {26241#true} {26241#true} #72#return; {26241#true} is VALID [2018-11-23 12:27:35,077 INFO L273 TraceCheckUtils]: 126: Hoare triple {26241#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {26658#(<= main_~i~2 0)} is VALID [2018-11-23 12:27:35,077 INFO L273 TraceCheckUtils]: 127: Hoare triple {26658#(<= main_~i~2 0)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26658#(<= main_~i~2 0)} is VALID [2018-11-23 12:27:35,078 INFO L273 TraceCheckUtils]: 128: Hoare triple {26658#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26665#(<= main_~i~2 1)} is VALID [2018-11-23 12:27:35,078 INFO L273 TraceCheckUtils]: 129: Hoare triple {26665#(<= main_~i~2 1)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26665#(<= main_~i~2 1)} is VALID [2018-11-23 12:27:35,080 INFO L273 TraceCheckUtils]: 130: Hoare triple {26665#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26672#(<= main_~i~2 2)} is VALID [2018-11-23 12:27:35,080 INFO L273 TraceCheckUtils]: 131: Hoare triple {26672#(<= main_~i~2 2)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26672#(<= main_~i~2 2)} is VALID [2018-11-23 12:27:35,080 INFO L273 TraceCheckUtils]: 132: Hoare triple {26672#(<= main_~i~2 2)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26679#(<= main_~i~2 3)} is VALID [2018-11-23 12:27:35,081 INFO L273 TraceCheckUtils]: 133: Hoare triple {26679#(<= main_~i~2 3)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26679#(<= main_~i~2 3)} is VALID [2018-11-23 12:27:35,081 INFO L273 TraceCheckUtils]: 134: Hoare triple {26679#(<= main_~i~2 3)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26686#(<= main_~i~2 4)} is VALID [2018-11-23 12:27:35,081 INFO L273 TraceCheckUtils]: 135: Hoare triple {26686#(<= main_~i~2 4)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26686#(<= main_~i~2 4)} is VALID [2018-11-23 12:27:35,082 INFO L273 TraceCheckUtils]: 136: Hoare triple {26686#(<= main_~i~2 4)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26693#(<= main_~i~2 5)} is VALID [2018-11-23 12:27:35,083 INFO L273 TraceCheckUtils]: 137: Hoare triple {26693#(<= main_~i~2 5)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26693#(<= main_~i~2 5)} is VALID [2018-11-23 12:27:35,083 INFO L273 TraceCheckUtils]: 138: Hoare triple {26693#(<= main_~i~2 5)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26700#(<= main_~i~2 6)} is VALID [2018-11-23 12:27:35,084 INFO L273 TraceCheckUtils]: 139: Hoare triple {26700#(<= main_~i~2 6)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26700#(<= main_~i~2 6)} is VALID [2018-11-23 12:27:35,085 INFO L273 TraceCheckUtils]: 140: Hoare triple {26700#(<= main_~i~2 6)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26707#(<= main_~i~2 7)} is VALID [2018-11-23 12:27:35,085 INFO L273 TraceCheckUtils]: 141: Hoare triple {26707#(<= main_~i~2 7)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26707#(<= main_~i~2 7)} is VALID [2018-11-23 12:27:35,086 INFO L273 TraceCheckUtils]: 142: Hoare triple {26707#(<= main_~i~2 7)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26714#(<= main_~i~2 8)} is VALID [2018-11-23 12:27:35,086 INFO L273 TraceCheckUtils]: 143: Hoare triple {26714#(<= main_~i~2 8)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {26714#(<= main_~i~2 8)} is VALID [2018-11-23 12:27:35,087 INFO L273 TraceCheckUtils]: 144: Hoare triple {26714#(<= main_~i~2 8)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {26721#(<= main_~i~2 9)} is VALID [2018-11-23 12:27:35,088 INFO L273 TraceCheckUtils]: 145: Hoare triple {26721#(<= main_~i~2 9)} assume !(~i~2 < 99999); {26242#false} is VALID [2018-11-23 12:27:35,088 INFO L273 TraceCheckUtils]: 146: Hoare triple {26242#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {26242#false} is VALID [2018-11-23 12:27:35,088 INFO L256 TraceCheckUtils]: 147: Hoare triple {26242#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {26242#false} is VALID [2018-11-23 12:27:35,088 INFO L273 TraceCheckUtils]: 148: Hoare triple {26242#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {26242#false} is VALID [2018-11-23 12:27:35,088 INFO L273 TraceCheckUtils]: 149: Hoare triple {26242#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26242#false} is VALID [2018-11-23 12:27:35,089 INFO L273 TraceCheckUtils]: 150: Hoare triple {26242#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26242#false} is VALID [2018-11-23 12:27:35,089 INFO L273 TraceCheckUtils]: 151: Hoare triple {26242#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26242#false} is VALID [2018-11-23 12:27:35,089 INFO L273 TraceCheckUtils]: 152: Hoare triple {26242#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26242#false} is VALID [2018-11-23 12:27:35,089 INFO L273 TraceCheckUtils]: 153: Hoare triple {26242#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26242#false} is VALID [2018-11-23 12:27:35,089 INFO L273 TraceCheckUtils]: 154: Hoare triple {26242#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26242#false} is VALID [2018-11-23 12:27:35,090 INFO L273 TraceCheckUtils]: 155: Hoare triple {26242#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26242#false} is VALID [2018-11-23 12:27:35,090 INFO L273 TraceCheckUtils]: 156: Hoare triple {26242#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26242#false} is VALID [2018-11-23 12:27:35,090 INFO L273 TraceCheckUtils]: 157: Hoare triple {26242#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26242#false} is VALID [2018-11-23 12:27:35,090 INFO L273 TraceCheckUtils]: 158: Hoare triple {26242#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26242#false} is VALID [2018-11-23 12:27:35,090 INFO L273 TraceCheckUtils]: 159: Hoare triple {26242#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26242#false} is VALID [2018-11-23 12:27:35,090 INFO L273 TraceCheckUtils]: 160: Hoare triple {26242#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26242#false} is VALID [2018-11-23 12:27:35,091 INFO L273 TraceCheckUtils]: 161: Hoare triple {26242#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26242#false} is VALID [2018-11-23 12:27:35,091 INFO L273 TraceCheckUtils]: 162: Hoare triple {26242#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26242#false} is VALID [2018-11-23 12:27:35,091 INFO L273 TraceCheckUtils]: 163: Hoare triple {26242#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26242#false} is VALID [2018-11-23 12:27:35,091 INFO L273 TraceCheckUtils]: 164: Hoare triple {26242#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26242#false} is VALID [2018-11-23 12:27:35,091 INFO L273 TraceCheckUtils]: 165: Hoare triple {26242#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26242#false} is VALID [2018-11-23 12:27:35,091 INFO L273 TraceCheckUtils]: 166: Hoare triple {26242#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26242#false} is VALID [2018-11-23 12:27:35,092 INFO L273 TraceCheckUtils]: 167: Hoare triple {26242#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {26242#false} is VALID [2018-11-23 12:27:35,092 INFO L273 TraceCheckUtils]: 168: Hoare triple {26242#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26242#false} is VALID [2018-11-23 12:27:35,092 INFO L273 TraceCheckUtils]: 169: Hoare triple {26242#false} assume !(~i~0 < 100000); {26242#false} is VALID [2018-11-23 12:27:35,092 INFO L273 TraceCheckUtils]: 170: Hoare triple {26242#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {26242#false} is VALID [2018-11-23 12:27:35,092 INFO L273 TraceCheckUtils]: 171: Hoare triple {26242#false} assume true; {26242#false} is VALID [2018-11-23 12:27:35,092 INFO L268 TraceCheckUtils]: 172: Hoare quadruple {26242#false} {26242#false} #74#return; {26242#false} is VALID [2018-11-23 12:27:35,093 INFO L273 TraceCheckUtils]: 173: Hoare triple {26242#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {26242#false} is VALID [2018-11-23 12:27:35,093 INFO L273 TraceCheckUtils]: 174: Hoare triple {26242#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {26242#false} is VALID [2018-11-23 12:27:35,093 INFO L273 TraceCheckUtils]: 175: Hoare triple {26242#false} assume !false; {26242#false} is VALID [2018-11-23 12:27:35,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 450 proven. 81 refuted. 0 times theorem prover too weak. 1614 trivial. 0 not checked. [2018-11-23 12:27:35,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:35,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 12] total 46 [2018-11-23 12:27:35,128 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 176 [2018-11-23 12:27:35,128 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:35,128 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states. [2018-11-23 12:27:35,256 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:35,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-23 12:27:35,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-23 12:27:35,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=695, Invalid=1375, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 12:27:35,258 INFO L87 Difference]: Start difference. First operand 127 states and 131 transitions. Second operand 46 states. [2018-11-23 12:27:36,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:36,439 INFO L93 Difference]: Finished difference Result 187 states and 196 transitions. [2018-11-23 12:27:36,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-23 12:27:36,440 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 176 [2018-11-23 12:27:36,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:36,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:27:36,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 141 transitions. [2018-11-23 12:27:36,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:27:36,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 141 transitions. [2018-11-23 12:27:36,442 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states and 141 transitions. [2018-11-23 12:27:36,579 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:36,582 INFO L225 Difference]: With dead ends: 187 [2018-11-23 12:27:36,582 INFO L226 Difference]: Without dead ends: 133 [2018-11-23 12:27:36,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=695, Invalid=1375, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 12:27:36,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-23 12:27:36,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-11-23 12:27:36,931 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:36,931 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand 131 states. [2018-11-23 12:27:36,931 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 131 states. [2018-11-23 12:27:36,931 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 131 states. [2018-11-23 12:27:36,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:36,934 INFO L93 Difference]: Finished difference Result 133 states and 137 transitions. [2018-11-23 12:27:36,934 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2018-11-23 12:27:36,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:36,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:36,934 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand 133 states. [2018-11-23 12:27:36,935 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 133 states. [2018-11-23 12:27:36,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:36,937 INFO L93 Difference]: Finished difference Result 133 states and 137 transitions. [2018-11-23 12:27:36,937 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2018-11-23 12:27:36,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:36,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:36,937 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:36,937 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:36,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-23 12:27:36,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 135 transitions. [2018-11-23 12:27:36,939 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 135 transitions. Word has length 176 [2018-11-23 12:27:36,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:36,939 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 135 transitions. [2018-11-23 12:27:36,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-23 12:27:36,939 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2018-11-23 12:27:36,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-23 12:27:36,940 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:36,940 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 30, 30, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:27:36,940 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:36,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:36,941 INFO L82 PathProgramCache]: Analyzing trace with hash 854412647, now seen corresponding path program 34 times [2018-11-23 12:27:36,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:36,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:36,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:36,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:36,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:37,826 INFO L256 TraceCheckUtils]: 0: Hoare triple {27553#true} call ULTIMATE.init(); {27553#true} is VALID [2018-11-23 12:27:37,826 INFO L273 TraceCheckUtils]: 1: Hoare triple {27553#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27553#true} is VALID [2018-11-23 12:27:37,827 INFO L273 TraceCheckUtils]: 2: Hoare triple {27553#true} assume true; {27553#true} is VALID [2018-11-23 12:27:37,827 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27553#true} {27553#true} #66#return; {27553#true} is VALID [2018-11-23 12:27:37,827 INFO L256 TraceCheckUtils]: 4: Hoare triple {27553#true} call #t~ret13 := main(); {27553#true} is VALID [2018-11-23 12:27:37,827 INFO L273 TraceCheckUtils]: 5: Hoare triple {27553#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; {27555#(= main_~i~1 0)} is VALID [2018-11-23 12:27:37,828 INFO L273 TraceCheckUtils]: 6: Hoare triple {27555#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27555#(= main_~i~1 0)} is VALID [2018-11-23 12:27:37,829 INFO L273 TraceCheckUtils]: 7: Hoare triple {27555#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27556#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:37,829 INFO L273 TraceCheckUtils]: 8: Hoare triple {27556#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27556#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:37,829 INFO L273 TraceCheckUtils]: 9: Hoare triple {27556#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27557#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:37,830 INFO L273 TraceCheckUtils]: 10: Hoare triple {27557#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27557#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:37,830 INFO L273 TraceCheckUtils]: 11: Hoare triple {27557#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27558#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:37,830 INFO L273 TraceCheckUtils]: 12: Hoare triple {27558#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27558#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:37,831 INFO L273 TraceCheckUtils]: 13: Hoare triple {27558#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27559#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:37,832 INFO L273 TraceCheckUtils]: 14: Hoare triple {27559#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27559#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:37,832 INFO L273 TraceCheckUtils]: 15: Hoare triple {27559#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27560#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:37,833 INFO L273 TraceCheckUtils]: 16: Hoare triple {27560#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27560#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:37,834 INFO L273 TraceCheckUtils]: 17: Hoare triple {27560#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27561#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:37,834 INFO L273 TraceCheckUtils]: 18: Hoare triple {27561#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27561#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:37,835 INFO L273 TraceCheckUtils]: 19: Hoare triple {27561#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27562#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:37,835 INFO L273 TraceCheckUtils]: 20: Hoare triple {27562#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27562#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:37,836 INFO L273 TraceCheckUtils]: 21: Hoare triple {27562#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27563#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:37,836 INFO L273 TraceCheckUtils]: 22: Hoare triple {27563#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27563#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:37,837 INFO L273 TraceCheckUtils]: 23: Hoare triple {27563#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27564#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:37,838 INFO L273 TraceCheckUtils]: 24: Hoare triple {27564#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27564#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:37,838 INFO L273 TraceCheckUtils]: 25: Hoare triple {27564#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27565#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:37,839 INFO L273 TraceCheckUtils]: 26: Hoare triple {27565#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27565#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:37,840 INFO L273 TraceCheckUtils]: 27: Hoare triple {27565#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27566#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:37,840 INFO L273 TraceCheckUtils]: 28: Hoare triple {27566#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27566#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:37,841 INFO L273 TraceCheckUtils]: 29: Hoare triple {27566#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27567#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:37,841 INFO L273 TraceCheckUtils]: 30: Hoare triple {27567#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27567#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:37,842 INFO L273 TraceCheckUtils]: 31: Hoare triple {27567#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27568#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:37,842 INFO L273 TraceCheckUtils]: 32: Hoare triple {27568#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27568#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:37,843 INFO L273 TraceCheckUtils]: 33: Hoare triple {27568#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27569#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:37,843 INFO L273 TraceCheckUtils]: 34: Hoare triple {27569#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27569#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:37,844 INFO L273 TraceCheckUtils]: 35: Hoare triple {27569#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27570#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:37,845 INFO L273 TraceCheckUtils]: 36: Hoare triple {27570#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27570#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:37,845 INFO L273 TraceCheckUtils]: 37: Hoare triple {27570#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27571#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:37,846 INFO L273 TraceCheckUtils]: 38: Hoare triple {27571#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27571#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:37,846 INFO L273 TraceCheckUtils]: 39: Hoare triple {27571#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27572#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:37,847 INFO L273 TraceCheckUtils]: 40: Hoare triple {27572#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27572#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:37,848 INFO L273 TraceCheckUtils]: 41: Hoare triple {27572#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27573#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:37,848 INFO L273 TraceCheckUtils]: 42: Hoare triple {27573#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27573#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:37,849 INFO L273 TraceCheckUtils]: 43: Hoare triple {27573#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27574#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:37,849 INFO L273 TraceCheckUtils]: 44: Hoare triple {27574#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27574#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:37,850 INFO L273 TraceCheckUtils]: 45: Hoare triple {27574#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27575#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:37,850 INFO L273 TraceCheckUtils]: 46: Hoare triple {27575#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27575#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:37,851 INFO L273 TraceCheckUtils]: 47: Hoare triple {27575#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27576#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:37,852 INFO L273 TraceCheckUtils]: 48: Hoare triple {27576#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27576#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:37,852 INFO L273 TraceCheckUtils]: 49: Hoare triple {27576#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27577#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:37,853 INFO L273 TraceCheckUtils]: 50: Hoare triple {27577#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27577#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:37,853 INFO L273 TraceCheckUtils]: 51: Hoare triple {27577#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27578#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:37,854 INFO L273 TraceCheckUtils]: 52: Hoare triple {27578#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27578#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:37,855 INFO L273 TraceCheckUtils]: 53: Hoare triple {27578#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27579#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:37,855 INFO L273 TraceCheckUtils]: 54: Hoare triple {27579#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27579#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:37,856 INFO L273 TraceCheckUtils]: 55: Hoare triple {27579#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27580#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:37,856 INFO L273 TraceCheckUtils]: 56: Hoare triple {27580#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27580#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:37,857 INFO L273 TraceCheckUtils]: 57: Hoare triple {27580#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27581#(<= main_~i~1 26)} is VALID [2018-11-23 12:27:37,857 INFO L273 TraceCheckUtils]: 58: Hoare triple {27581#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27581#(<= main_~i~1 26)} is VALID [2018-11-23 12:27:37,858 INFO L273 TraceCheckUtils]: 59: Hoare triple {27581#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27582#(<= main_~i~1 27)} is VALID [2018-11-23 12:27:37,858 INFO L273 TraceCheckUtils]: 60: Hoare triple {27582#(<= main_~i~1 27)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27582#(<= main_~i~1 27)} is VALID [2018-11-23 12:27:37,859 INFO L273 TraceCheckUtils]: 61: Hoare triple {27582#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27583#(<= main_~i~1 28)} is VALID [2018-11-23 12:27:37,860 INFO L273 TraceCheckUtils]: 62: Hoare triple {27583#(<= main_~i~1 28)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27583#(<= main_~i~1 28)} is VALID [2018-11-23 12:27:37,860 INFO L273 TraceCheckUtils]: 63: Hoare triple {27583#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27584#(<= main_~i~1 29)} is VALID [2018-11-23 12:27:37,861 INFO L273 TraceCheckUtils]: 64: Hoare triple {27584#(<= main_~i~1 29)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27584#(<= main_~i~1 29)} is VALID [2018-11-23 12:27:37,862 INFO L273 TraceCheckUtils]: 65: Hoare triple {27584#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27585#(<= main_~i~1 30)} is VALID [2018-11-23 12:27:37,862 INFO L273 TraceCheckUtils]: 66: Hoare triple {27585#(<= main_~i~1 30)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27585#(<= main_~i~1 30)} is VALID [2018-11-23 12:27:37,863 INFO L273 TraceCheckUtils]: 67: Hoare triple {27585#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27586#(<= main_~i~1 31)} is VALID [2018-11-23 12:27:37,863 INFO L273 TraceCheckUtils]: 68: Hoare triple {27586#(<= main_~i~1 31)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27586#(<= main_~i~1 31)} is VALID [2018-11-23 12:27:37,864 INFO L273 TraceCheckUtils]: 69: Hoare triple {27586#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27587#(<= main_~i~1 32)} is VALID [2018-11-23 12:27:37,865 INFO L273 TraceCheckUtils]: 70: Hoare triple {27587#(<= main_~i~1 32)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27587#(<= main_~i~1 32)} is VALID [2018-11-23 12:27:37,865 INFO L273 TraceCheckUtils]: 71: Hoare triple {27587#(<= main_~i~1 32)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27588#(<= main_~i~1 33)} is VALID [2018-11-23 12:27:37,866 INFO L273 TraceCheckUtils]: 72: Hoare triple {27588#(<= main_~i~1 33)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27588#(<= main_~i~1 33)} is VALID [2018-11-23 12:27:37,866 INFO L273 TraceCheckUtils]: 73: Hoare triple {27588#(<= main_~i~1 33)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27589#(<= main_~i~1 34)} is VALID [2018-11-23 12:27:37,867 INFO L273 TraceCheckUtils]: 74: Hoare triple {27589#(<= main_~i~1 34)} assume !(~i~1 < 100000); {27554#false} is VALID [2018-11-23 12:27:37,867 INFO L256 TraceCheckUtils]: 75: Hoare triple {27554#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {27553#true} is VALID [2018-11-23 12:27:37,868 INFO L273 TraceCheckUtils]: 76: Hoare triple {27553#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {27553#true} is VALID [2018-11-23 12:27:37,868 INFO L273 TraceCheckUtils]: 77: Hoare triple {27553#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:37,868 INFO L273 TraceCheckUtils]: 78: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:37,868 INFO L273 TraceCheckUtils]: 79: Hoare triple {27553#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:37,868 INFO L273 TraceCheckUtils]: 80: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:37,868 INFO L273 TraceCheckUtils]: 81: Hoare triple {27553#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:37,869 INFO L273 TraceCheckUtils]: 82: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:37,869 INFO L273 TraceCheckUtils]: 83: Hoare triple {27553#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:37,869 INFO L273 TraceCheckUtils]: 84: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:37,869 INFO L273 TraceCheckUtils]: 85: Hoare triple {27553#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:37,869 INFO L273 TraceCheckUtils]: 86: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:37,870 INFO L273 TraceCheckUtils]: 87: Hoare triple {27553#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:37,870 INFO L273 TraceCheckUtils]: 88: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:37,870 INFO L273 TraceCheckUtils]: 89: Hoare triple {27553#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:37,870 INFO L273 TraceCheckUtils]: 90: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:37,870 INFO L273 TraceCheckUtils]: 91: Hoare triple {27553#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:37,870 INFO L273 TraceCheckUtils]: 92: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:37,871 INFO L273 TraceCheckUtils]: 93: Hoare triple {27553#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:37,871 INFO L273 TraceCheckUtils]: 94: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:37,871 INFO L273 TraceCheckUtils]: 95: Hoare triple {27553#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:37,871 INFO L273 TraceCheckUtils]: 96: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:37,871 INFO L273 TraceCheckUtils]: 97: Hoare triple {27553#true} assume !(~i~0 < 100000); {27553#true} is VALID [2018-11-23 12:27:37,871 INFO L273 TraceCheckUtils]: 98: Hoare triple {27553#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {27553#true} is VALID [2018-11-23 12:27:37,872 INFO L273 TraceCheckUtils]: 99: Hoare triple {27553#true} assume true; {27553#true} is VALID [2018-11-23 12:27:37,872 INFO L268 TraceCheckUtils]: 100: Hoare quadruple {27553#true} {27554#false} #70#return; {27554#false} is VALID [2018-11-23 12:27:37,872 INFO L273 TraceCheckUtils]: 101: Hoare triple {27554#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {27554#false} is VALID [2018-11-23 12:27:37,872 INFO L256 TraceCheckUtils]: 102: Hoare triple {27554#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {27553#true} is VALID [2018-11-23 12:27:37,872 INFO L273 TraceCheckUtils]: 103: Hoare triple {27553#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {27553#true} is VALID [2018-11-23 12:27:37,872 INFO L273 TraceCheckUtils]: 104: Hoare triple {27553#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:37,873 INFO L273 TraceCheckUtils]: 105: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:37,873 INFO L273 TraceCheckUtils]: 106: Hoare triple {27553#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:37,873 INFO L273 TraceCheckUtils]: 107: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:37,873 INFO L273 TraceCheckUtils]: 108: Hoare triple {27553#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:37,873 INFO L273 TraceCheckUtils]: 109: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:37,873 INFO L273 TraceCheckUtils]: 110: Hoare triple {27553#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:37,873 INFO L273 TraceCheckUtils]: 111: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:37,873 INFO L273 TraceCheckUtils]: 112: Hoare triple {27553#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:37,873 INFO L273 TraceCheckUtils]: 113: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:37,874 INFO L273 TraceCheckUtils]: 114: Hoare triple {27553#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:37,874 INFO L273 TraceCheckUtils]: 115: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:37,874 INFO L273 TraceCheckUtils]: 116: Hoare triple {27553#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:37,874 INFO L273 TraceCheckUtils]: 117: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:37,874 INFO L273 TraceCheckUtils]: 118: Hoare triple {27553#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:37,874 INFO L273 TraceCheckUtils]: 119: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:37,874 INFO L273 TraceCheckUtils]: 120: Hoare triple {27553#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:37,874 INFO L273 TraceCheckUtils]: 121: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:37,874 INFO L273 TraceCheckUtils]: 122: Hoare triple {27553#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:37,875 INFO L273 TraceCheckUtils]: 123: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:37,875 INFO L273 TraceCheckUtils]: 124: Hoare triple {27553#true} assume !(~i~0 < 100000); {27553#true} is VALID [2018-11-23 12:27:37,875 INFO L273 TraceCheckUtils]: 125: Hoare triple {27553#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {27553#true} is VALID [2018-11-23 12:27:37,875 INFO L273 TraceCheckUtils]: 126: Hoare triple {27553#true} assume true; {27553#true} is VALID [2018-11-23 12:27:37,875 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {27553#true} {27554#false} #72#return; {27554#false} is VALID [2018-11-23 12:27:37,875 INFO L273 TraceCheckUtils]: 128: Hoare triple {27554#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {27554#false} is VALID [2018-11-23 12:27:37,875 INFO L273 TraceCheckUtils]: 129: Hoare triple {27554#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27554#false} is VALID [2018-11-23 12:27:37,875 INFO L273 TraceCheckUtils]: 130: Hoare triple {27554#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27554#false} is VALID [2018-11-23 12:27:37,875 INFO L273 TraceCheckUtils]: 131: Hoare triple {27554#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27554#false} is VALID [2018-11-23 12:27:37,875 INFO L273 TraceCheckUtils]: 132: Hoare triple {27554#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27554#false} is VALID [2018-11-23 12:27:37,876 INFO L273 TraceCheckUtils]: 133: Hoare triple {27554#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27554#false} is VALID [2018-11-23 12:27:37,876 INFO L273 TraceCheckUtils]: 134: Hoare triple {27554#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27554#false} is VALID [2018-11-23 12:27:37,876 INFO L273 TraceCheckUtils]: 135: Hoare triple {27554#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27554#false} is VALID [2018-11-23 12:27:37,876 INFO L273 TraceCheckUtils]: 136: Hoare triple {27554#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27554#false} is VALID [2018-11-23 12:27:37,876 INFO L273 TraceCheckUtils]: 137: Hoare triple {27554#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27554#false} is VALID [2018-11-23 12:27:37,876 INFO L273 TraceCheckUtils]: 138: Hoare triple {27554#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27554#false} is VALID [2018-11-23 12:27:37,876 INFO L273 TraceCheckUtils]: 139: Hoare triple {27554#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27554#false} is VALID [2018-11-23 12:27:37,876 INFO L273 TraceCheckUtils]: 140: Hoare triple {27554#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27554#false} is VALID [2018-11-23 12:27:37,876 INFO L273 TraceCheckUtils]: 141: Hoare triple {27554#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27554#false} is VALID [2018-11-23 12:27:37,876 INFO L273 TraceCheckUtils]: 142: Hoare triple {27554#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27554#false} is VALID [2018-11-23 12:27:37,877 INFO L273 TraceCheckUtils]: 143: Hoare triple {27554#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27554#false} is VALID [2018-11-23 12:27:37,877 INFO L273 TraceCheckUtils]: 144: Hoare triple {27554#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27554#false} is VALID [2018-11-23 12:27:37,877 INFO L273 TraceCheckUtils]: 145: Hoare triple {27554#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27554#false} is VALID [2018-11-23 12:27:37,877 INFO L273 TraceCheckUtils]: 146: Hoare triple {27554#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27554#false} is VALID [2018-11-23 12:27:37,877 INFO L273 TraceCheckUtils]: 147: Hoare triple {27554#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27554#false} is VALID [2018-11-23 12:27:37,877 INFO L273 TraceCheckUtils]: 148: Hoare triple {27554#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27554#false} is VALID [2018-11-23 12:27:37,877 INFO L273 TraceCheckUtils]: 149: Hoare triple {27554#false} assume !(~i~2 < 99999); {27554#false} is VALID [2018-11-23 12:27:37,877 INFO L273 TraceCheckUtils]: 150: Hoare triple {27554#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {27554#false} is VALID [2018-11-23 12:27:37,877 INFO L256 TraceCheckUtils]: 151: Hoare triple {27554#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {27553#true} is VALID [2018-11-23 12:27:37,877 INFO L273 TraceCheckUtils]: 152: Hoare triple {27553#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {27553#true} is VALID [2018-11-23 12:27:37,878 INFO L273 TraceCheckUtils]: 153: Hoare triple {27553#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:37,878 INFO L273 TraceCheckUtils]: 154: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:37,878 INFO L273 TraceCheckUtils]: 155: Hoare triple {27553#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:37,878 INFO L273 TraceCheckUtils]: 156: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:37,878 INFO L273 TraceCheckUtils]: 157: Hoare triple {27553#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:37,878 INFO L273 TraceCheckUtils]: 158: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:37,878 INFO L273 TraceCheckUtils]: 159: Hoare triple {27553#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:37,878 INFO L273 TraceCheckUtils]: 160: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:37,878 INFO L273 TraceCheckUtils]: 161: Hoare triple {27553#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:37,878 INFO L273 TraceCheckUtils]: 162: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:37,879 INFO L273 TraceCheckUtils]: 163: Hoare triple {27553#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:37,879 INFO L273 TraceCheckUtils]: 164: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:37,879 INFO L273 TraceCheckUtils]: 165: Hoare triple {27553#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:37,879 INFO L273 TraceCheckUtils]: 166: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:37,879 INFO L273 TraceCheckUtils]: 167: Hoare triple {27553#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:37,879 INFO L273 TraceCheckUtils]: 168: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:37,879 INFO L273 TraceCheckUtils]: 169: Hoare triple {27553#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:37,879 INFO L273 TraceCheckUtils]: 170: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:37,879 INFO L273 TraceCheckUtils]: 171: Hoare triple {27553#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:37,879 INFO L273 TraceCheckUtils]: 172: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:37,880 INFO L273 TraceCheckUtils]: 173: Hoare triple {27553#true} assume !(~i~0 < 100000); {27553#true} is VALID [2018-11-23 12:27:37,880 INFO L273 TraceCheckUtils]: 174: Hoare triple {27553#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {27553#true} is VALID [2018-11-23 12:27:37,880 INFO L273 TraceCheckUtils]: 175: Hoare triple {27553#true} assume true; {27553#true} is VALID [2018-11-23 12:27:37,880 INFO L268 TraceCheckUtils]: 176: Hoare quadruple {27553#true} {27554#false} #74#return; {27554#false} is VALID [2018-11-23 12:27:37,880 INFO L273 TraceCheckUtils]: 177: Hoare triple {27554#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {27554#false} is VALID [2018-11-23 12:27:37,880 INFO L273 TraceCheckUtils]: 178: Hoare triple {27554#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {27554#false} is VALID [2018-11-23 12:27:37,880 INFO L273 TraceCheckUtils]: 179: Hoare triple {27554#false} assume !false; {27554#false} is VALID [2018-11-23 12:27:37,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2231 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 1075 trivial. 0 not checked. [2018-11-23 12:27:37,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:37,895 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:27:37,905 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:27:37,982 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:27:37,982 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:38,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:38,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:38,645 INFO L256 TraceCheckUtils]: 0: Hoare triple {27553#true} call ULTIMATE.init(); {27553#true} is VALID [2018-11-23 12:27:38,645 INFO L273 TraceCheckUtils]: 1: Hoare triple {27553#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27553#true} is VALID [2018-11-23 12:27:38,645 INFO L273 TraceCheckUtils]: 2: Hoare triple {27553#true} assume true; {27553#true} is VALID [2018-11-23 12:27:38,645 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27553#true} {27553#true} #66#return; {27553#true} is VALID [2018-11-23 12:27:38,646 INFO L256 TraceCheckUtils]: 4: Hoare triple {27553#true} call #t~ret13 := main(); {27553#true} is VALID [2018-11-23 12:27:38,646 INFO L273 TraceCheckUtils]: 5: Hoare triple {27553#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; {27553#true} is VALID [2018-11-23 12:27:38,646 INFO L273 TraceCheckUtils]: 6: Hoare triple {27553#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:38,646 INFO L273 TraceCheckUtils]: 7: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:38,646 INFO L273 TraceCheckUtils]: 8: Hoare triple {27553#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:38,646 INFO L273 TraceCheckUtils]: 9: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:38,647 INFO L273 TraceCheckUtils]: 10: Hoare triple {27553#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:38,647 INFO L273 TraceCheckUtils]: 11: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:38,647 INFO L273 TraceCheckUtils]: 12: Hoare triple {27553#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:38,647 INFO L273 TraceCheckUtils]: 13: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:38,647 INFO L273 TraceCheckUtils]: 14: Hoare triple {27553#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:38,647 INFO L273 TraceCheckUtils]: 15: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:38,648 INFO L273 TraceCheckUtils]: 16: Hoare triple {27553#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:38,648 INFO L273 TraceCheckUtils]: 17: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:38,648 INFO L273 TraceCheckUtils]: 18: Hoare triple {27553#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:38,648 INFO L273 TraceCheckUtils]: 19: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:38,648 INFO L273 TraceCheckUtils]: 20: Hoare triple {27553#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:38,648 INFO L273 TraceCheckUtils]: 21: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:38,648 INFO L273 TraceCheckUtils]: 22: Hoare triple {27553#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:38,649 INFO L273 TraceCheckUtils]: 23: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:38,649 INFO L273 TraceCheckUtils]: 24: Hoare triple {27553#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:38,649 INFO L273 TraceCheckUtils]: 25: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:38,649 INFO L273 TraceCheckUtils]: 26: Hoare triple {27553#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:38,649 INFO L273 TraceCheckUtils]: 27: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:38,649 INFO L273 TraceCheckUtils]: 28: Hoare triple {27553#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:38,649 INFO L273 TraceCheckUtils]: 29: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:38,649 INFO L273 TraceCheckUtils]: 30: Hoare triple {27553#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:38,649 INFO L273 TraceCheckUtils]: 31: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:38,650 INFO L273 TraceCheckUtils]: 32: Hoare triple {27553#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:38,650 INFO L273 TraceCheckUtils]: 33: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:38,650 INFO L273 TraceCheckUtils]: 34: Hoare triple {27553#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:38,650 INFO L273 TraceCheckUtils]: 35: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:38,650 INFO L273 TraceCheckUtils]: 36: Hoare triple {27553#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:38,650 INFO L273 TraceCheckUtils]: 37: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:38,650 INFO L273 TraceCheckUtils]: 38: Hoare triple {27553#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:38,650 INFO L273 TraceCheckUtils]: 39: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:38,650 INFO L273 TraceCheckUtils]: 40: Hoare triple {27553#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:38,650 INFO L273 TraceCheckUtils]: 41: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:38,651 INFO L273 TraceCheckUtils]: 42: Hoare triple {27553#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:38,651 INFO L273 TraceCheckUtils]: 43: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:38,651 INFO L273 TraceCheckUtils]: 44: Hoare triple {27553#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:38,651 INFO L273 TraceCheckUtils]: 45: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:38,651 INFO L273 TraceCheckUtils]: 46: Hoare triple {27553#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:38,651 INFO L273 TraceCheckUtils]: 47: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:38,651 INFO L273 TraceCheckUtils]: 48: Hoare triple {27553#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:38,651 INFO L273 TraceCheckUtils]: 49: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:38,651 INFO L273 TraceCheckUtils]: 50: Hoare triple {27553#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:38,651 INFO L273 TraceCheckUtils]: 51: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:38,652 INFO L273 TraceCheckUtils]: 52: Hoare triple {27553#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:38,652 INFO L273 TraceCheckUtils]: 53: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:38,652 INFO L273 TraceCheckUtils]: 54: Hoare triple {27553#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:38,652 INFO L273 TraceCheckUtils]: 55: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:38,652 INFO L273 TraceCheckUtils]: 56: Hoare triple {27553#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:38,652 INFO L273 TraceCheckUtils]: 57: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:38,652 INFO L273 TraceCheckUtils]: 58: Hoare triple {27553#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:38,652 INFO L273 TraceCheckUtils]: 59: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:38,652 INFO L273 TraceCheckUtils]: 60: Hoare triple {27553#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:38,652 INFO L273 TraceCheckUtils]: 61: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:38,653 INFO L273 TraceCheckUtils]: 62: Hoare triple {27553#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:38,653 INFO L273 TraceCheckUtils]: 63: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:38,653 INFO L273 TraceCheckUtils]: 64: Hoare triple {27553#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:38,653 INFO L273 TraceCheckUtils]: 65: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:38,653 INFO L273 TraceCheckUtils]: 66: Hoare triple {27553#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:38,653 INFO L273 TraceCheckUtils]: 67: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:38,653 INFO L273 TraceCheckUtils]: 68: Hoare triple {27553#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:38,653 INFO L273 TraceCheckUtils]: 69: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:38,653 INFO L273 TraceCheckUtils]: 70: Hoare triple {27553#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:38,654 INFO L273 TraceCheckUtils]: 71: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:38,654 INFO L273 TraceCheckUtils]: 72: Hoare triple {27553#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {27553#true} is VALID [2018-11-23 12:27:38,654 INFO L273 TraceCheckUtils]: 73: Hoare triple {27553#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {27553#true} is VALID [2018-11-23 12:27:38,654 INFO L273 TraceCheckUtils]: 74: Hoare triple {27553#true} assume !(~i~1 < 100000); {27553#true} is VALID [2018-11-23 12:27:38,654 INFO L256 TraceCheckUtils]: 75: Hoare triple {27553#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {27553#true} is VALID [2018-11-23 12:27:38,654 INFO L273 TraceCheckUtils]: 76: Hoare triple {27553#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {27553#true} is VALID [2018-11-23 12:27:38,654 INFO L273 TraceCheckUtils]: 77: Hoare triple {27553#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:38,654 INFO L273 TraceCheckUtils]: 78: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:38,654 INFO L273 TraceCheckUtils]: 79: Hoare triple {27553#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:38,654 INFO L273 TraceCheckUtils]: 80: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:38,655 INFO L273 TraceCheckUtils]: 81: Hoare triple {27553#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:38,655 INFO L273 TraceCheckUtils]: 82: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:38,655 INFO L273 TraceCheckUtils]: 83: Hoare triple {27553#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:38,655 INFO L273 TraceCheckUtils]: 84: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:38,655 INFO L273 TraceCheckUtils]: 85: Hoare triple {27553#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:38,655 INFO L273 TraceCheckUtils]: 86: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:38,655 INFO L273 TraceCheckUtils]: 87: Hoare triple {27553#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:38,655 INFO L273 TraceCheckUtils]: 88: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:38,655 INFO L273 TraceCheckUtils]: 89: Hoare triple {27553#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:38,655 INFO L273 TraceCheckUtils]: 90: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:38,656 INFO L273 TraceCheckUtils]: 91: Hoare triple {27553#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:38,656 INFO L273 TraceCheckUtils]: 92: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:38,656 INFO L273 TraceCheckUtils]: 93: Hoare triple {27553#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:38,656 INFO L273 TraceCheckUtils]: 94: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:38,656 INFO L273 TraceCheckUtils]: 95: Hoare triple {27553#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:38,656 INFO L273 TraceCheckUtils]: 96: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:38,656 INFO L273 TraceCheckUtils]: 97: Hoare triple {27553#true} assume !(~i~0 < 100000); {27553#true} is VALID [2018-11-23 12:27:38,656 INFO L273 TraceCheckUtils]: 98: Hoare triple {27553#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {27553#true} is VALID [2018-11-23 12:27:38,656 INFO L273 TraceCheckUtils]: 99: Hoare triple {27553#true} assume true; {27553#true} is VALID [2018-11-23 12:27:38,657 INFO L268 TraceCheckUtils]: 100: Hoare quadruple {27553#true} {27553#true} #70#return; {27553#true} is VALID [2018-11-23 12:27:38,657 INFO L273 TraceCheckUtils]: 101: Hoare triple {27553#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {27553#true} is VALID [2018-11-23 12:27:38,657 INFO L256 TraceCheckUtils]: 102: Hoare triple {27553#true} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {27553#true} is VALID [2018-11-23 12:27:38,657 INFO L273 TraceCheckUtils]: 103: Hoare triple {27553#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {27553#true} is VALID [2018-11-23 12:27:38,657 INFO L273 TraceCheckUtils]: 104: Hoare triple {27553#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:38,657 INFO L273 TraceCheckUtils]: 105: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:38,657 INFO L273 TraceCheckUtils]: 106: Hoare triple {27553#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:38,657 INFO L273 TraceCheckUtils]: 107: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:38,657 INFO L273 TraceCheckUtils]: 108: Hoare triple {27553#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:38,657 INFO L273 TraceCheckUtils]: 109: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:38,658 INFO L273 TraceCheckUtils]: 110: Hoare triple {27553#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:38,658 INFO L273 TraceCheckUtils]: 111: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:38,658 INFO L273 TraceCheckUtils]: 112: Hoare triple {27553#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:38,658 INFO L273 TraceCheckUtils]: 113: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:38,658 INFO L273 TraceCheckUtils]: 114: Hoare triple {27553#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:38,658 INFO L273 TraceCheckUtils]: 115: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:38,658 INFO L273 TraceCheckUtils]: 116: Hoare triple {27553#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:38,658 INFO L273 TraceCheckUtils]: 117: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:38,658 INFO L273 TraceCheckUtils]: 118: Hoare triple {27553#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:38,659 INFO L273 TraceCheckUtils]: 119: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:38,659 INFO L273 TraceCheckUtils]: 120: Hoare triple {27553#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:38,659 INFO L273 TraceCheckUtils]: 121: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:38,659 INFO L273 TraceCheckUtils]: 122: Hoare triple {27553#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:27:38,659 INFO L273 TraceCheckUtils]: 123: Hoare triple {27553#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27553#true} is VALID [2018-11-23 12:27:38,659 INFO L273 TraceCheckUtils]: 124: Hoare triple {27553#true} assume !(~i~0 < 100000); {27553#true} is VALID [2018-11-23 12:27:38,659 INFO L273 TraceCheckUtils]: 125: Hoare triple {27553#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {27553#true} is VALID [2018-11-23 12:27:38,659 INFO L273 TraceCheckUtils]: 126: Hoare triple {27553#true} assume true; {27553#true} is VALID [2018-11-23 12:27:38,659 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {27553#true} {27553#true} #72#return; {27553#true} is VALID [2018-11-23 12:27:38,660 INFO L273 TraceCheckUtils]: 128: Hoare triple {27553#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {27977#(<= main_~i~2 0)} is VALID [2018-11-23 12:27:38,660 INFO L273 TraceCheckUtils]: 129: Hoare triple {27977#(<= main_~i~2 0)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27977#(<= main_~i~2 0)} is VALID [2018-11-23 12:27:38,661 INFO L273 TraceCheckUtils]: 130: Hoare triple {27977#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27984#(<= main_~i~2 1)} is VALID [2018-11-23 12:27:38,661 INFO L273 TraceCheckUtils]: 131: Hoare triple {27984#(<= main_~i~2 1)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27984#(<= main_~i~2 1)} is VALID [2018-11-23 12:27:38,661 INFO L273 TraceCheckUtils]: 132: Hoare triple {27984#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27991#(<= main_~i~2 2)} is VALID [2018-11-23 12:27:38,662 INFO L273 TraceCheckUtils]: 133: Hoare triple {27991#(<= main_~i~2 2)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27991#(<= main_~i~2 2)} is VALID [2018-11-23 12:27:38,662 INFO L273 TraceCheckUtils]: 134: Hoare triple {27991#(<= main_~i~2 2)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {27998#(<= main_~i~2 3)} is VALID [2018-11-23 12:27:38,662 INFO L273 TraceCheckUtils]: 135: Hoare triple {27998#(<= main_~i~2 3)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {27998#(<= main_~i~2 3)} is VALID [2018-11-23 12:27:38,663 INFO L273 TraceCheckUtils]: 136: Hoare triple {27998#(<= main_~i~2 3)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28005#(<= main_~i~2 4)} is VALID [2018-11-23 12:27:38,663 INFO L273 TraceCheckUtils]: 137: Hoare triple {28005#(<= main_~i~2 4)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28005#(<= main_~i~2 4)} is VALID [2018-11-23 12:27:38,664 INFO L273 TraceCheckUtils]: 138: Hoare triple {28005#(<= main_~i~2 4)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28012#(<= main_~i~2 5)} is VALID [2018-11-23 12:27:38,664 INFO L273 TraceCheckUtils]: 139: Hoare triple {28012#(<= main_~i~2 5)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28012#(<= main_~i~2 5)} is VALID [2018-11-23 12:27:38,665 INFO L273 TraceCheckUtils]: 140: Hoare triple {28012#(<= main_~i~2 5)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28019#(<= main_~i~2 6)} is VALID [2018-11-23 12:27:38,665 INFO L273 TraceCheckUtils]: 141: Hoare triple {28019#(<= main_~i~2 6)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28019#(<= main_~i~2 6)} is VALID [2018-11-23 12:27:38,666 INFO L273 TraceCheckUtils]: 142: Hoare triple {28019#(<= main_~i~2 6)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28026#(<= main_~i~2 7)} is VALID [2018-11-23 12:27:38,667 INFO L273 TraceCheckUtils]: 143: Hoare triple {28026#(<= main_~i~2 7)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28026#(<= main_~i~2 7)} is VALID [2018-11-23 12:27:38,667 INFO L273 TraceCheckUtils]: 144: Hoare triple {28026#(<= main_~i~2 7)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28033#(<= main_~i~2 8)} is VALID [2018-11-23 12:27:38,668 INFO L273 TraceCheckUtils]: 145: Hoare triple {28033#(<= main_~i~2 8)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28033#(<= main_~i~2 8)} is VALID [2018-11-23 12:27:38,669 INFO L273 TraceCheckUtils]: 146: Hoare triple {28033#(<= main_~i~2 8)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28040#(<= main_~i~2 9)} is VALID [2018-11-23 12:27:38,669 INFO L273 TraceCheckUtils]: 147: Hoare triple {28040#(<= main_~i~2 9)} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28040#(<= main_~i~2 9)} is VALID [2018-11-23 12:27:38,670 INFO L273 TraceCheckUtils]: 148: Hoare triple {28040#(<= main_~i~2 9)} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28047#(<= main_~i~2 10)} is VALID [2018-11-23 12:27:38,670 INFO L273 TraceCheckUtils]: 149: Hoare triple {28047#(<= main_~i~2 10)} assume !(~i~2 < 99999); {27554#false} is VALID [2018-11-23 12:27:38,671 INFO L273 TraceCheckUtils]: 150: Hoare triple {27554#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {27554#false} is VALID [2018-11-23 12:27:38,671 INFO L256 TraceCheckUtils]: 151: Hoare triple {27554#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {27554#false} is VALID [2018-11-23 12:27:38,671 INFO L273 TraceCheckUtils]: 152: Hoare triple {27554#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {27554#false} is VALID [2018-11-23 12:27:38,671 INFO L273 TraceCheckUtils]: 153: Hoare triple {27554#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27554#false} is VALID [2018-11-23 12:27:38,671 INFO L273 TraceCheckUtils]: 154: Hoare triple {27554#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27554#false} is VALID [2018-11-23 12:27:38,672 INFO L273 TraceCheckUtils]: 155: Hoare triple {27554#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27554#false} is VALID [2018-11-23 12:27:38,672 INFO L273 TraceCheckUtils]: 156: Hoare triple {27554#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27554#false} is VALID [2018-11-23 12:27:38,672 INFO L273 TraceCheckUtils]: 157: Hoare triple {27554#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27554#false} is VALID [2018-11-23 12:27:38,672 INFO L273 TraceCheckUtils]: 158: Hoare triple {27554#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27554#false} is VALID [2018-11-23 12:27:38,672 INFO L273 TraceCheckUtils]: 159: Hoare triple {27554#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27554#false} is VALID [2018-11-23 12:27:38,672 INFO L273 TraceCheckUtils]: 160: Hoare triple {27554#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27554#false} is VALID [2018-11-23 12:27:38,673 INFO L273 TraceCheckUtils]: 161: Hoare triple {27554#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27554#false} is VALID [2018-11-23 12:27:38,673 INFO L273 TraceCheckUtils]: 162: Hoare triple {27554#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27554#false} is VALID [2018-11-23 12:27:38,673 INFO L273 TraceCheckUtils]: 163: Hoare triple {27554#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27554#false} is VALID [2018-11-23 12:27:38,673 INFO L273 TraceCheckUtils]: 164: Hoare triple {27554#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27554#false} is VALID [2018-11-23 12:27:38,673 INFO L273 TraceCheckUtils]: 165: Hoare triple {27554#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27554#false} is VALID [2018-11-23 12:27:38,674 INFO L273 TraceCheckUtils]: 166: Hoare triple {27554#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27554#false} is VALID [2018-11-23 12:27:38,674 INFO L273 TraceCheckUtils]: 167: Hoare triple {27554#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27554#false} is VALID [2018-11-23 12:27:38,674 INFO L273 TraceCheckUtils]: 168: Hoare triple {27554#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27554#false} is VALID [2018-11-23 12:27:38,674 INFO L273 TraceCheckUtils]: 169: Hoare triple {27554#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27554#false} is VALID [2018-11-23 12:27:38,674 INFO L273 TraceCheckUtils]: 170: Hoare triple {27554#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27554#false} is VALID [2018-11-23 12:27:38,674 INFO L273 TraceCheckUtils]: 171: Hoare triple {27554#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {27554#false} is VALID [2018-11-23 12:27:38,675 INFO L273 TraceCheckUtils]: 172: Hoare triple {27554#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27554#false} is VALID [2018-11-23 12:27:38,675 INFO L273 TraceCheckUtils]: 173: Hoare triple {27554#false} assume !(~i~0 < 100000); {27554#false} is VALID [2018-11-23 12:27:38,675 INFO L273 TraceCheckUtils]: 174: Hoare triple {27554#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {27554#false} is VALID [2018-11-23 12:27:38,675 INFO L273 TraceCheckUtils]: 175: Hoare triple {27554#false} assume true; {27554#false} is VALID [2018-11-23 12:27:38,675 INFO L268 TraceCheckUtils]: 176: Hoare quadruple {27554#false} {27554#false} #74#return; {27554#false} is VALID [2018-11-23 12:27:38,675 INFO L273 TraceCheckUtils]: 177: Hoare triple {27554#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {27554#false} is VALID [2018-11-23 12:27:38,675 INFO L273 TraceCheckUtils]: 178: Hoare triple {27554#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {27554#false} is VALID [2018-11-23 12:27:38,676 INFO L273 TraceCheckUtils]: 179: Hoare triple {27554#false} assume !false; {27554#false} is VALID [2018-11-23 12:27:38,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2231 backedges. 450 proven. 100 refuted. 0 times theorem prover too weak. 1681 trivial. 0 not checked. [2018-11-23 12:27:38,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:38,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 13] total 48 [2018-11-23 12:27:38,707 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 180 [2018-11-23 12:27:38,707 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:38,707 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 12:27:38,834 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:38,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 12:27:38,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 12:27:38,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=743, Invalid=1513, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 12:27:38,836 INFO L87 Difference]: Start difference. First operand 131 states and 135 transitions. Second operand 48 states. [2018-11-23 12:27:39,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:39,345 INFO L93 Difference]: Finished difference Result 193 states and 202 transitions. [2018-11-23 12:27:39,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 12:27:39,345 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 180 [2018-11-23 12:27:39,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:39,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:27:39,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 145 transitions. [2018-11-23 12:27:39,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:27:39,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 145 transitions. [2018-11-23 12:27:39,348 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 145 transitions. [2018-11-23 12:27:39,834 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:39,836 INFO L225 Difference]: With dead ends: 193 [2018-11-23 12:27:39,836 INFO L226 Difference]: Without dead ends: 137 [2018-11-23 12:27:39,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=743, Invalid=1513, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 12:27:39,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-11-23 12:27:39,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2018-11-23 12:27:39,885 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:39,886 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand 135 states. [2018-11-23 12:27:39,886 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 135 states. [2018-11-23 12:27:39,886 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 135 states. [2018-11-23 12:27:39,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:39,888 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2018-11-23 12:27:39,888 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 141 transitions. [2018-11-23 12:27:39,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:39,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:39,889 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand 137 states. [2018-11-23 12:27:39,889 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 137 states. [2018-11-23 12:27:39,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:39,895 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2018-11-23 12:27:39,895 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 141 transitions. [2018-11-23 12:27:39,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:39,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:39,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:39,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:39,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-23 12:27:39,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 139 transitions. [2018-11-23 12:27:39,898 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 139 transitions. Word has length 180 [2018-11-23 12:27:39,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:39,899 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 139 transitions. [2018-11-23 12:27:39,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 12:27:39,899 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2018-11-23 12:27:39,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-23 12:27:39,900 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:39,900 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 30, 30, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:27:39,900 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:39,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:39,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1113930553, now seen corresponding path program 35 times [2018-11-23 12:27:39,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:39,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:39,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:39,901 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:39,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:39,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:40,996 INFO L256 TraceCheckUtils]: 0: Hoare triple {28902#true} call ULTIMATE.init(); {28902#true} is VALID [2018-11-23 12:27:40,996 INFO L273 TraceCheckUtils]: 1: Hoare triple {28902#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28902#true} is VALID [2018-11-23 12:27:40,997 INFO L273 TraceCheckUtils]: 2: Hoare triple {28902#true} assume true; {28902#true} is VALID [2018-11-23 12:27:40,997 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28902#true} {28902#true} #66#return; {28902#true} is VALID [2018-11-23 12:27:40,997 INFO L256 TraceCheckUtils]: 4: Hoare triple {28902#true} call #t~ret13 := main(); {28902#true} is VALID [2018-11-23 12:27:40,997 INFO L273 TraceCheckUtils]: 5: Hoare triple {28902#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; {28904#(= main_~i~1 0)} is VALID [2018-11-23 12:27:40,998 INFO L273 TraceCheckUtils]: 6: Hoare triple {28904#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28904#(= main_~i~1 0)} is VALID [2018-11-23 12:27:40,999 INFO L273 TraceCheckUtils]: 7: Hoare triple {28904#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28905#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:40,999 INFO L273 TraceCheckUtils]: 8: Hoare triple {28905#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28905#(<= main_~i~1 1)} is VALID [2018-11-23 12:27:40,999 INFO L273 TraceCheckUtils]: 9: Hoare triple {28905#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28906#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:41,000 INFO L273 TraceCheckUtils]: 10: Hoare triple {28906#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28906#(<= main_~i~1 2)} is VALID [2018-11-23 12:27:41,000 INFO L273 TraceCheckUtils]: 11: Hoare triple {28906#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28907#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:41,000 INFO L273 TraceCheckUtils]: 12: Hoare triple {28907#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28907#(<= main_~i~1 3)} is VALID [2018-11-23 12:27:41,001 INFO L273 TraceCheckUtils]: 13: Hoare triple {28907#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28908#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:41,002 INFO L273 TraceCheckUtils]: 14: Hoare triple {28908#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28908#(<= main_~i~1 4)} is VALID [2018-11-23 12:27:41,002 INFO L273 TraceCheckUtils]: 15: Hoare triple {28908#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28909#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:41,003 INFO L273 TraceCheckUtils]: 16: Hoare triple {28909#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28909#(<= main_~i~1 5)} is VALID [2018-11-23 12:27:41,003 INFO L273 TraceCheckUtils]: 17: Hoare triple {28909#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28910#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:41,004 INFO L273 TraceCheckUtils]: 18: Hoare triple {28910#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28910#(<= main_~i~1 6)} is VALID [2018-11-23 12:27:41,005 INFO L273 TraceCheckUtils]: 19: Hoare triple {28910#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28911#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:41,005 INFO L273 TraceCheckUtils]: 20: Hoare triple {28911#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28911#(<= main_~i~1 7)} is VALID [2018-11-23 12:27:41,006 INFO L273 TraceCheckUtils]: 21: Hoare triple {28911#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28912#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:41,006 INFO L273 TraceCheckUtils]: 22: Hoare triple {28912#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28912#(<= main_~i~1 8)} is VALID [2018-11-23 12:27:41,007 INFO L273 TraceCheckUtils]: 23: Hoare triple {28912#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28913#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:41,008 INFO L273 TraceCheckUtils]: 24: Hoare triple {28913#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28913#(<= main_~i~1 9)} is VALID [2018-11-23 12:27:41,008 INFO L273 TraceCheckUtils]: 25: Hoare triple {28913#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28914#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:41,009 INFO L273 TraceCheckUtils]: 26: Hoare triple {28914#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28914#(<= main_~i~1 10)} is VALID [2018-11-23 12:27:41,010 INFO L273 TraceCheckUtils]: 27: Hoare triple {28914#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28915#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:41,010 INFO L273 TraceCheckUtils]: 28: Hoare triple {28915#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28915#(<= main_~i~1 11)} is VALID [2018-11-23 12:27:41,011 INFO L273 TraceCheckUtils]: 29: Hoare triple {28915#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28916#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:41,011 INFO L273 TraceCheckUtils]: 30: Hoare triple {28916#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28916#(<= main_~i~1 12)} is VALID [2018-11-23 12:27:41,012 INFO L273 TraceCheckUtils]: 31: Hoare triple {28916#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28917#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:41,013 INFO L273 TraceCheckUtils]: 32: Hoare triple {28917#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28917#(<= main_~i~1 13)} is VALID [2018-11-23 12:27:41,013 INFO L273 TraceCheckUtils]: 33: Hoare triple {28917#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28918#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:41,014 INFO L273 TraceCheckUtils]: 34: Hoare triple {28918#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28918#(<= main_~i~1 14)} is VALID [2018-11-23 12:27:41,014 INFO L273 TraceCheckUtils]: 35: Hoare triple {28918#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28919#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:41,015 INFO L273 TraceCheckUtils]: 36: Hoare triple {28919#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28919#(<= main_~i~1 15)} is VALID [2018-11-23 12:27:41,016 INFO L273 TraceCheckUtils]: 37: Hoare triple {28919#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28920#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:41,016 INFO L273 TraceCheckUtils]: 38: Hoare triple {28920#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28920#(<= main_~i~1 16)} is VALID [2018-11-23 12:27:41,017 INFO L273 TraceCheckUtils]: 39: Hoare triple {28920#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28921#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:41,017 INFO L273 TraceCheckUtils]: 40: Hoare triple {28921#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28921#(<= main_~i~1 17)} is VALID [2018-11-23 12:27:41,018 INFO L273 TraceCheckUtils]: 41: Hoare triple {28921#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28922#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:41,019 INFO L273 TraceCheckUtils]: 42: Hoare triple {28922#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28922#(<= main_~i~1 18)} is VALID [2018-11-23 12:27:41,019 INFO L273 TraceCheckUtils]: 43: Hoare triple {28922#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28923#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:41,020 INFO L273 TraceCheckUtils]: 44: Hoare triple {28923#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28923#(<= main_~i~1 19)} is VALID [2018-11-23 12:27:41,021 INFO L273 TraceCheckUtils]: 45: Hoare triple {28923#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28924#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:41,021 INFO L273 TraceCheckUtils]: 46: Hoare triple {28924#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28924#(<= main_~i~1 20)} is VALID [2018-11-23 12:27:41,022 INFO L273 TraceCheckUtils]: 47: Hoare triple {28924#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28925#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:41,022 INFO L273 TraceCheckUtils]: 48: Hoare triple {28925#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28925#(<= main_~i~1 21)} is VALID [2018-11-23 12:27:41,023 INFO L273 TraceCheckUtils]: 49: Hoare triple {28925#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28926#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:41,024 INFO L273 TraceCheckUtils]: 50: Hoare triple {28926#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28926#(<= main_~i~1 22)} is VALID [2018-11-23 12:27:41,024 INFO L273 TraceCheckUtils]: 51: Hoare triple {28926#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28927#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:41,025 INFO L273 TraceCheckUtils]: 52: Hoare triple {28927#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28927#(<= main_~i~1 23)} is VALID [2018-11-23 12:27:41,026 INFO L273 TraceCheckUtils]: 53: Hoare triple {28927#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28928#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:41,026 INFO L273 TraceCheckUtils]: 54: Hoare triple {28928#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28928#(<= main_~i~1 24)} is VALID [2018-11-23 12:27:41,027 INFO L273 TraceCheckUtils]: 55: Hoare triple {28928#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28929#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:41,027 INFO L273 TraceCheckUtils]: 56: Hoare triple {28929#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28929#(<= main_~i~1 25)} is VALID [2018-11-23 12:27:41,028 INFO L273 TraceCheckUtils]: 57: Hoare triple {28929#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28930#(<= main_~i~1 26)} is VALID [2018-11-23 12:27:41,028 INFO L273 TraceCheckUtils]: 58: Hoare triple {28930#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28930#(<= main_~i~1 26)} is VALID [2018-11-23 12:27:41,029 INFO L273 TraceCheckUtils]: 59: Hoare triple {28930#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28931#(<= main_~i~1 27)} is VALID [2018-11-23 12:27:41,030 INFO L273 TraceCheckUtils]: 60: Hoare triple {28931#(<= main_~i~1 27)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28931#(<= main_~i~1 27)} is VALID [2018-11-23 12:27:41,030 INFO L273 TraceCheckUtils]: 61: Hoare triple {28931#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28932#(<= main_~i~1 28)} is VALID [2018-11-23 12:27:41,031 INFO L273 TraceCheckUtils]: 62: Hoare triple {28932#(<= main_~i~1 28)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28932#(<= main_~i~1 28)} is VALID [2018-11-23 12:27:41,032 INFO L273 TraceCheckUtils]: 63: Hoare triple {28932#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28933#(<= main_~i~1 29)} is VALID [2018-11-23 12:27:41,032 INFO L273 TraceCheckUtils]: 64: Hoare triple {28933#(<= main_~i~1 29)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28933#(<= main_~i~1 29)} is VALID [2018-11-23 12:27:41,033 INFO L273 TraceCheckUtils]: 65: Hoare triple {28933#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28934#(<= main_~i~1 30)} is VALID [2018-11-23 12:27:41,033 INFO L273 TraceCheckUtils]: 66: Hoare triple {28934#(<= main_~i~1 30)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28934#(<= main_~i~1 30)} is VALID [2018-11-23 12:27:41,034 INFO L273 TraceCheckUtils]: 67: Hoare triple {28934#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28935#(<= main_~i~1 31)} is VALID [2018-11-23 12:27:41,035 INFO L273 TraceCheckUtils]: 68: Hoare triple {28935#(<= main_~i~1 31)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28935#(<= main_~i~1 31)} is VALID [2018-11-23 12:27:41,035 INFO L273 TraceCheckUtils]: 69: Hoare triple {28935#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28936#(<= main_~i~1 32)} is VALID [2018-11-23 12:27:41,036 INFO L273 TraceCheckUtils]: 70: Hoare triple {28936#(<= main_~i~1 32)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28936#(<= main_~i~1 32)} is VALID [2018-11-23 12:27:41,037 INFO L273 TraceCheckUtils]: 71: Hoare triple {28936#(<= main_~i~1 32)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28937#(<= main_~i~1 33)} is VALID [2018-11-23 12:27:41,037 INFO L273 TraceCheckUtils]: 72: Hoare triple {28937#(<= main_~i~1 33)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28937#(<= main_~i~1 33)} is VALID [2018-11-23 12:27:41,038 INFO L273 TraceCheckUtils]: 73: Hoare triple {28937#(<= main_~i~1 33)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28938#(<= main_~i~1 34)} is VALID [2018-11-23 12:27:41,038 INFO L273 TraceCheckUtils]: 74: Hoare triple {28938#(<= main_~i~1 34)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28938#(<= main_~i~1 34)} is VALID [2018-11-23 12:27:41,039 INFO L273 TraceCheckUtils]: 75: Hoare triple {28938#(<= main_~i~1 34)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28939#(<= main_~i~1 35)} is VALID [2018-11-23 12:27:41,040 INFO L273 TraceCheckUtils]: 76: Hoare triple {28939#(<= main_~i~1 35)} assume !(~i~1 < 100000); {28903#false} is VALID [2018-11-23 12:27:41,040 INFO L256 TraceCheckUtils]: 77: Hoare triple {28903#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {28902#true} is VALID [2018-11-23 12:27:41,040 INFO L273 TraceCheckUtils]: 78: Hoare triple {28902#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {28902#true} is VALID [2018-11-23 12:27:41,040 INFO L273 TraceCheckUtils]: 79: Hoare triple {28902#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:41,040 INFO L273 TraceCheckUtils]: 80: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:41,041 INFO L273 TraceCheckUtils]: 81: Hoare triple {28902#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:41,041 INFO L273 TraceCheckUtils]: 82: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:41,041 INFO L273 TraceCheckUtils]: 83: Hoare triple {28902#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:41,041 INFO L273 TraceCheckUtils]: 84: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:41,041 INFO L273 TraceCheckUtils]: 85: Hoare triple {28902#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:41,042 INFO L273 TraceCheckUtils]: 86: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:41,042 INFO L273 TraceCheckUtils]: 87: Hoare triple {28902#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:41,042 INFO L273 TraceCheckUtils]: 88: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:41,042 INFO L273 TraceCheckUtils]: 89: Hoare triple {28902#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:41,042 INFO L273 TraceCheckUtils]: 90: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:41,042 INFO L273 TraceCheckUtils]: 91: Hoare triple {28902#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:41,043 INFO L273 TraceCheckUtils]: 92: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:41,043 INFO L273 TraceCheckUtils]: 93: Hoare triple {28902#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:41,043 INFO L273 TraceCheckUtils]: 94: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:41,043 INFO L273 TraceCheckUtils]: 95: Hoare triple {28902#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:41,043 INFO L273 TraceCheckUtils]: 96: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:41,043 INFO L273 TraceCheckUtils]: 97: Hoare triple {28902#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:41,043 INFO L273 TraceCheckUtils]: 98: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:41,043 INFO L273 TraceCheckUtils]: 99: Hoare triple {28902#true} assume !(~i~0 < 100000); {28902#true} is VALID [2018-11-23 12:27:41,043 INFO L273 TraceCheckUtils]: 100: Hoare triple {28902#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {28902#true} is VALID [2018-11-23 12:27:41,044 INFO L273 TraceCheckUtils]: 101: Hoare triple {28902#true} assume true; {28902#true} is VALID [2018-11-23 12:27:41,044 INFO L268 TraceCheckUtils]: 102: Hoare quadruple {28902#true} {28903#false} #70#return; {28903#false} is VALID [2018-11-23 12:27:41,044 INFO L273 TraceCheckUtils]: 103: Hoare triple {28903#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {28903#false} is VALID [2018-11-23 12:27:41,044 INFO L256 TraceCheckUtils]: 104: Hoare triple {28903#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {28902#true} is VALID [2018-11-23 12:27:41,044 INFO L273 TraceCheckUtils]: 105: Hoare triple {28902#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {28902#true} is VALID [2018-11-23 12:27:41,044 INFO L273 TraceCheckUtils]: 106: Hoare triple {28902#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:41,044 INFO L273 TraceCheckUtils]: 107: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:41,044 INFO L273 TraceCheckUtils]: 108: Hoare triple {28902#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:41,044 INFO L273 TraceCheckUtils]: 109: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:41,045 INFO L273 TraceCheckUtils]: 110: Hoare triple {28902#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:41,045 INFO L273 TraceCheckUtils]: 111: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:41,045 INFO L273 TraceCheckUtils]: 112: Hoare triple {28902#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:41,045 INFO L273 TraceCheckUtils]: 113: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:41,045 INFO L273 TraceCheckUtils]: 114: Hoare triple {28902#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:41,045 INFO L273 TraceCheckUtils]: 115: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:41,045 INFO L273 TraceCheckUtils]: 116: Hoare triple {28902#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:41,045 INFO L273 TraceCheckUtils]: 117: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:41,045 INFO L273 TraceCheckUtils]: 118: Hoare triple {28902#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:41,045 INFO L273 TraceCheckUtils]: 119: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:41,046 INFO L273 TraceCheckUtils]: 120: Hoare triple {28902#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:41,046 INFO L273 TraceCheckUtils]: 121: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:41,046 INFO L273 TraceCheckUtils]: 122: Hoare triple {28902#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:41,046 INFO L273 TraceCheckUtils]: 123: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:41,046 INFO L273 TraceCheckUtils]: 124: Hoare triple {28902#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:41,046 INFO L273 TraceCheckUtils]: 125: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:41,046 INFO L273 TraceCheckUtils]: 126: Hoare triple {28902#true} assume !(~i~0 < 100000); {28902#true} is VALID [2018-11-23 12:27:41,046 INFO L273 TraceCheckUtils]: 127: Hoare triple {28902#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {28902#true} is VALID [2018-11-23 12:27:41,046 INFO L273 TraceCheckUtils]: 128: Hoare triple {28902#true} assume true; {28902#true} is VALID [2018-11-23 12:27:41,046 INFO L268 TraceCheckUtils]: 129: Hoare quadruple {28902#true} {28903#false} #72#return; {28903#false} is VALID [2018-11-23 12:27:41,047 INFO L273 TraceCheckUtils]: 130: Hoare triple {28903#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {28903#false} is VALID [2018-11-23 12:27:41,047 INFO L273 TraceCheckUtils]: 131: Hoare triple {28903#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28903#false} is VALID [2018-11-23 12:27:41,047 INFO L273 TraceCheckUtils]: 132: Hoare triple {28903#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28903#false} is VALID [2018-11-23 12:27:41,047 INFO L273 TraceCheckUtils]: 133: Hoare triple {28903#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28903#false} is VALID [2018-11-23 12:27:41,047 INFO L273 TraceCheckUtils]: 134: Hoare triple {28903#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28903#false} is VALID [2018-11-23 12:27:41,047 INFO L273 TraceCheckUtils]: 135: Hoare triple {28903#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28903#false} is VALID [2018-11-23 12:27:41,047 INFO L273 TraceCheckUtils]: 136: Hoare triple {28903#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28903#false} is VALID [2018-11-23 12:27:41,047 INFO L273 TraceCheckUtils]: 137: Hoare triple {28903#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28903#false} is VALID [2018-11-23 12:27:41,047 INFO L273 TraceCheckUtils]: 138: Hoare triple {28903#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28903#false} is VALID [2018-11-23 12:27:41,048 INFO L273 TraceCheckUtils]: 139: Hoare triple {28903#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28903#false} is VALID [2018-11-23 12:27:41,048 INFO L273 TraceCheckUtils]: 140: Hoare triple {28903#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28903#false} is VALID [2018-11-23 12:27:41,048 INFO L273 TraceCheckUtils]: 141: Hoare triple {28903#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28903#false} is VALID [2018-11-23 12:27:41,048 INFO L273 TraceCheckUtils]: 142: Hoare triple {28903#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28903#false} is VALID [2018-11-23 12:27:41,048 INFO L273 TraceCheckUtils]: 143: Hoare triple {28903#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28903#false} is VALID [2018-11-23 12:27:41,048 INFO L273 TraceCheckUtils]: 144: Hoare triple {28903#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28903#false} is VALID [2018-11-23 12:27:41,048 INFO L273 TraceCheckUtils]: 145: Hoare triple {28903#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28903#false} is VALID [2018-11-23 12:27:41,048 INFO L273 TraceCheckUtils]: 146: Hoare triple {28903#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28903#false} is VALID [2018-11-23 12:27:41,048 INFO L273 TraceCheckUtils]: 147: Hoare triple {28903#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28903#false} is VALID [2018-11-23 12:27:41,048 INFO L273 TraceCheckUtils]: 148: Hoare triple {28903#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28903#false} is VALID [2018-11-23 12:27:41,049 INFO L273 TraceCheckUtils]: 149: Hoare triple {28903#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28903#false} is VALID [2018-11-23 12:27:41,049 INFO L273 TraceCheckUtils]: 150: Hoare triple {28903#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28903#false} is VALID [2018-11-23 12:27:41,049 INFO L273 TraceCheckUtils]: 151: Hoare triple {28903#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28903#false} is VALID [2018-11-23 12:27:41,049 INFO L273 TraceCheckUtils]: 152: Hoare triple {28903#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28903#false} is VALID [2018-11-23 12:27:41,049 INFO L273 TraceCheckUtils]: 153: Hoare triple {28903#false} assume !(~i~2 < 99999); {28903#false} is VALID [2018-11-23 12:27:41,049 INFO L273 TraceCheckUtils]: 154: Hoare triple {28903#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {28903#false} is VALID [2018-11-23 12:27:41,049 INFO L256 TraceCheckUtils]: 155: Hoare triple {28903#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {28902#true} is VALID [2018-11-23 12:27:41,049 INFO L273 TraceCheckUtils]: 156: Hoare triple {28902#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {28902#true} is VALID [2018-11-23 12:27:41,049 INFO L273 TraceCheckUtils]: 157: Hoare triple {28902#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:41,049 INFO L273 TraceCheckUtils]: 158: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:41,050 INFO L273 TraceCheckUtils]: 159: Hoare triple {28902#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:41,050 INFO L273 TraceCheckUtils]: 160: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:41,050 INFO L273 TraceCheckUtils]: 161: Hoare triple {28902#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:41,050 INFO L273 TraceCheckUtils]: 162: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:41,050 INFO L273 TraceCheckUtils]: 163: Hoare triple {28902#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:41,050 INFO L273 TraceCheckUtils]: 164: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:41,050 INFO L273 TraceCheckUtils]: 165: Hoare triple {28902#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:41,050 INFO L273 TraceCheckUtils]: 166: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:41,050 INFO L273 TraceCheckUtils]: 167: Hoare triple {28902#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:41,050 INFO L273 TraceCheckUtils]: 168: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:41,051 INFO L273 TraceCheckUtils]: 169: Hoare triple {28902#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:41,051 INFO L273 TraceCheckUtils]: 170: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:41,051 INFO L273 TraceCheckUtils]: 171: Hoare triple {28902#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:41,051 INFO L273 TraceCheckUtils]: 172: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:41,051 INFO L273 TraceCheckUtils]: 173: Hoare triple {28902#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:41,051 INFO L273 TraceCheckUtils]: 174: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:41,051 INFO L273 TraceCheckUtils]: 175: Hoare triple {28902#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:27:41,051 INFO L273 TraceCheckUtils]: 176: Hoare triple {28902#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28902#true} is VALID [2018-11-23 12:27:41,051 INFO L273 TraceCheckUtils]: 177: Hoare triple {28902#true} assume !(~i~0 < 100000); {28902#true} is VALID [2018-11-23 12:27:41,051 INFO L273 TraceCheckUtils]: 178: Hoare triple {28902#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {28902#true} is VALID [2018-11-23 12:27:41,052 INFO L273 TraceCheckUtils]: 179: Hoare triple {28902#true} assume true; {28902#true} is VALID [2018-11-23 12:27:41,052 INFO L268 TraceCheckUtils]: 180: Hoare quadruple {28902#true} {28903#false} #74#return; {28903#false} is VALID [2018-11-23 12:27:41,052 INFO L273 TraceCheckUtils]: 181: Hoare triple {28903#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {28903#false} is VALID [2018-11-23 12:27:41,052 INFO L273 TraceCheckUtils]: 182: Hoare triple {28903#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {28903#false} is VALID [2018-11-23 12:27:41,052 INFO L273 TraceCheckUtils]: 183: Hoare triple {28903#false} assume !false; {28903#false} is VALID [2018-11-23 12:27:41,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2321 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1096 trivial. 0 not checked. [2018-11-23 12:27:41,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:27:41,067 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:27:41,080 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:28:24,008 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 35 check-sat command(s) [2018-11-23 12:28:24,008 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:24,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:24,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:24,689 INFO L256 TraceCheckUtils]: 0: Hoare triple {28902#true} call ULTIMATE.init(); {28902#true} is VALID [2018-11-23 12:28:24,689 INFO L273 TraceCheckUtils]: 1: Hoare triple {28902#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28902#true} is VALID [2018-11-23 12:28:24,690 INFO L273 TraceCheckUtils]: 2: Hoare triple {28902#true} assume true; {28902#true} is VALID [2018-11-23 12:28:24,690 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28902#true} {28902#true} #66#return; {28902#true} is VALID [2018-11-23 12:28:24,690 INFO L256 TraceCheckUtils]: 4: Hoare triple {28902#true} call #t~ret13 := main(); {28902#true} is VALID [2018-11-23 12:28:24,690 INFO L273 TraceCheckUtils]: 5: Hoare triple {28902#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; {28902#true} is VALID [2018-11-23 12:28:24,690 INFO L273 TraceCheckUtils]: 6: Hoare triple {28902#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:24,690 INFO L273 TraceCheckUtils]: 7: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:24,691 INFO L273 TraceCheckUtils]: 8: Hoare triple {28902#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:24,691 INFO L273 TraceCheckUtils]: 9: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:24,691 INFO L273 TraceCheckUtils]: 10: Hoare triple {28902#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:24,691 INFO L273 TraceCheckUtils]: 11: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:24,691 INFO L273 TraceCheckUtils]: 12: Hoare triple {28902#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:24,691 INFO L273 TraceCheckUtils]: 13: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:24,692 INFO L273 TraceCheckUtils]: 14: Hoare triple {28902#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:24,692 INFO L273 TraceCheckUtils]: 15: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:24,692 INFO L273 TraceCheckUtils]: 16: Hoare triple {28902#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:24,692 INFO L273 TraceCheckUtils]: 17: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:24,692 INFO L273 TraceCheckUtils]: 18: Hoare triple {28902#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:24,692 INFO L273 TraceCheckUtils]: 19: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:24,692 INFO L273 TraceCheckUtils]: 20: Hoare triple {28902#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:24,692 INFO L273 TraceCheckUtils]: 21: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:24,692 INFO L273 TraceCheckUtils]: 22: Hoare triple {28902#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:24,692 INFO L273 TraceCheckUtils]: 23: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:24,693 INFO L273 TraceCheckUtils]: 24: Hoare triple {28902#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:24,693 INFO L273 TraceCheckUtils]: 25: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:24,693 INFO L273 TraceCheckUtils]: 26: Hoare triple {28902#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:24,693 INFO L273 TraceCheckUtils]: 27: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:24,693 INFO L273 TraceCheckUtils]: 28: Hoare triple {28902#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:24,693 INFO L273 TraceCheckUtils]: 29: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:24,693 INFO L273 TraceCheckUtils]: 30: Hoare triple {28902#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:24,693 INFO L273 TraceCheckUtils]: 31: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:24,693 INFO L273 TraceCheckUtils]: 32: Hoare triple {28902#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:24,693 INFO L273 TraceCheckUtils]: 33: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:24,694 INFO L273 TraceCheckUtils]: 34: Hoare triple {28902#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:24,694 INFO L273 TraceCheckUtils]: 35: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:24,694 INFO L273 TraceCheckUtils]: 36: Hoare triple {28902#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:24,694 INFO L273 TraceCheckUtils]: 37: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:24,694 INFO L273 TraceCheckUtils]: 38: Hoare triple {28902#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:24,694 INFO L273 TraceCheckUtils]: 39: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:24,694 INFO L273 TraceCheckUtils]: 40: Hoare triple {28902#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:24,694 INFO L273 TraceCheckUtils]: 41: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:24,694 INFO L273 TraceCheckUtils]: 42: Hoare triple {28902#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:24,694 INFO L273 TraceCheckUtils]: 43: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:24,695 INFO L273 TraceCheckUtils]: 44: Hoare triple {28902#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:24,695 INFO L273 TraceCheckUtils]: 45: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:24,695 INFO L273 TraceCheckUtils]: 46: Hoare triple {28902#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:24,695 INFO L273 TraceCheckUtils]: 47: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:24,695 INFO L273 TraceCheckUtils]: 48: Hoare triple {28902#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:24,695 INFO L273 TraceCheckUtils]: 49: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:24,695 INFO L273 TraceCheckUtils]: 50: Hoare triple {28902#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:24,695 INFO L273 TraceCheckUtils]: 51: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:24,695 INFO L273 TraceCheckUtils]: 52: Hoare triple {28902#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:24,695 INFO L273 TraceCheckUtils]: 53: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:24,696 INFO L273 TraceCheckUtils]: 54: Hoare triple {28902#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:24,696 INFO L273 TraceCheckUtils]: 55: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:24,696 INFO L273 TraceCheckUtils]: 56: Hoare triple {28902#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:24,696 INFO L273 TraceCheckUtils]: 57: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:24,696 INFO L273 TraceCheckUtils]: 58: Hoare triple {28902#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:24,696 INFO L273 TraceCheckUtils]: 59: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:24,696 INFO L273 TraceCheckUtils]: 60: Hoare triple {28902#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:24,696 INFO L273 TraceCheckUtils]: 61: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:24,696 INFO L273 TraceCheckUtils]: 62: Hoare triple {28902#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:24,696 INFO L273 TraceCheckUtils]: 63: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:24,696 INFO L273 TraceCheckUtils]: 64: Hoare triple {28902#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:24,697 INFO L273 TraceCheckUtils]: 65: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:24,697 INFO L273 TraceCheckUtils]: 66: Hoare triple {28902#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:24,697 INFO L273 TraceCheckUtils]: 67: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:24,697 INFO L273 TraceCheckUtils]: 68: Hoare triple {28902#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:24,697 INFO L273 TraceCheckUtils]: 69: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:24,697 INFO L273 TraceCheckUtils]: 70: Hoare triple {28902#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:24,697 INFO L273 TraceCheckUtils]: 71: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:24,697 INFO L273 TraceCheckUtils]: 72: Hoare triple {28902#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:24,697 INFO L273 TraceCheckUtils]: 73: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:24,698 INFO L273 TraceCheckUtils]: 74: Hoare triple {28902#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {28902#true} is VALID [2018-11-23 12:28:24,698 INFO L273 TraceCheckUtils]: 75: Hoare triple {28902#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {28902#true} is VALID [2018-11-23 12:28:24,698 INFO L273 TraceCheckUtils]: 76: Hoare triple {28902#true} assume !(~i~1 < 100000); {28902#true} is VALID [2018-11-23 12:28:24,698 INFO L256 TraceCheckUtils]: 77: Hoare triple {28902#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {28902#true} is VALID [2018-11-23 12:28:24,698 INFO L273 TraceCheckUtils]: 78: Hoare triple {28902#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {29177#(<= bor_~i~0 1)} is VALID [2018-11-23 12:28:24,699 INFO L273 TraceCheckUtils]: 79: Hoare triple {29177#(<= bor_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {29177#(<= bor_~i~0 1)} is VALID [2018-11-23 12:28:24,699 INFO L273 TraceCheckUtils]: 80: Hoare triple {29177#(<= bor_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29184#(<= bor_~i~0 2)} is VALID [2018-11-23 12:28:24,699 INFO L273 TraceCheckUtils]: 81: Hoare triple {29184#(<= bor_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {29184#(<= bor_~i~0 2)} is VALID [2018-11-23 12:28:24,700 INFO L273 TraceCheckUtils]: 82: Hoare triple {29184#(<= bor_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29191#(<= bor_~i~0 3)} is VALID [2018-11-23 12:28:24,700 INFO L273 TraceCheckUtils]: 83: Hoare triple {29191#(<= bor_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {29191#(<= bor_~i~0 3)} is VALID [2018-11-23 12:28:24,700 INFO L273 TraceCheckUtils]: 84: Hoare triple {29191#(<= bor_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29198#(<= bor_~i~0 4)} is VALID [2018-11-23 12:28:24,701 INFO L273 TraceCheckUtils]: 85: Hoare triple {29198#(<= bor_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {29198#(<= bor_~i~0 4)} is VALID [2018-11-23 12:28:24,701 INFO L273 TraceCheckUtils]: 86: Hoare triple {29198#(<= bor_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29205#(<= bor_~i~0 5)} is VALID [2018-11-23 12:28:24,701 INFO L273 TraceCheckUtils]: 87: Hoare triple {29205#(<= bor_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {29205#(<= bor_~i~0 5)} is VALID [2018-11-23 12:28:24,702 INFO L273 TraceCheckUtils]: 88: Hoare triple {29205#(<= bor_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29212#(<= bor_~i~0 6)} is VALID [2018-11-23 12:28:24,702 INFO L273 TraceCheckUtils]: 89: Hoare triple {29212#(<= bor_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {29212#(<= bor_~i~0 6)} is VALID [2018-11-23 12:28:24,703 INFO L273 TraceCheckUtils]: 90: Hoare triple {29212#(<= bor_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29219#(<= bor_~i~0 7)} is VALID [2018-11-23 12:28:24,703 INFO L273 TraceCheckUtils]: 91: Hoare triple {29219#(<= bor_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {29219#(<= bor_~i~0 7)} is VALID [2018-11-23 12:28:24,704 INFO L273 TraceCheckUtils]: 92: Hoare triple {29219#(<= bor_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29226#(<= bor_~i~0 8)} is VALID [2018-11-23 12:28:24,704 INFO L273 TraceCheckUtils]: 93: Hoare triple {29226#(<= bor_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {29226#(<= bor_~i~0 8)} is VALID [2018-11-23 12:28:24,705 INFO L273 TraceCheckUtils]: 94: Hoare triple {29226#(<= bor_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29233#(<= bor_~i~0 9)} is VALID [2018-11-23 12:28:24,706 INFO L273 TraceCheckUtils]: 95: Hoare triple {29233#(<= bor_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {29233#(<= bor_~i~0 9)} is VALID [2018-11-23 12:28:24,706 INFO L273 TraceCheckUtils]: 96: Hoare triple {29233#(<= bor_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29240#(<= bor_~i~0 10)} is VALID [2018-11-23 12:28:24,707 INFO L273 TraceCheckUtils]: 97: Hoare triple {29240#(<= bor_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {29240#(<= bor_~i~0 10)} is VALID [2018-11-23 12:28:24,707 INFO L273 TraceCheckUtils]: 98: Hoare triple {29240#(<= bor_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29247#(<= bor_~i~0 11)} is VALID [2018-11-23 12:28:24,708 INFO L273 TraceCheckUtils]: 99: Hoare triple {29247#(<= bor_~i~0 11)} assume !(~i~0 < 100000); {28903#false} is VALID [2018-11-23 12:28:24,708 INFO L273 TraceCheckUtils]: 100: Hoare triple {28903#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {28903#false} is VALID [2018-11-23 12:28:24,708 INFO L273 TraceCheckUtils]: 101: Hoare triple {28903#false} assume true; {28903#false} is VALID [2018-11-23 12:28:24,708 INFO L268 TraceCheckUtils]: 102: Hoare quadruple {28903#false} {28902#true} #70#return; {28903#false} is VALID [2018-11-23 12:28:24,709 INFO L273 TraceCheckUtils]: 103: Hoare triple {28903#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {28903#false} is VALID [2018-11-23 12:28:24,709 INFO L256 TraceCheckUtils]: 104: Hoare triple {28903#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {28903#false} is VALID [2018-11-23 12:28:24,709 INFO L273 TraceCheckUtils]: 105: Hoare triple {28903#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {28903#false} is VALID [2018-11-23 12:28:24,709 INFO L273 TraceCheckUtils]: 106: Hoare triple {28903#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:28:24,709 INFO L273 TraceCheckUtils]: 107: Hoare triple {28903#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28903#false} is VALID [2018-11-23 12:28:24,709 INFO L273 TraceCheckUtils]: 108: Hoare triple {28903#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:28:24,710 INFO L273 TraceCheckUtils]: 109: Hoare triple {28903#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28903#false} is VALID [2018-11-23 12:28:24,710 INFO L273 TraceCheckUtils]: 110: Hoare triple {28903#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:28:24,710 INFO L273 TraceCheckUtils]: 111: Hoare triple {28903#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28903#false} is VALID [2018-11-23 12:28:24,710 INFO L273 TraceCheckUtils]: 112: Hoare triple {28903#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:28:24,710 INFO L273 TraceCheckUtils]: 113: Hoare triple {28903#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28903#false} is VALID [2018-11-23 12:28:24,710 INFO L273 TraceCheckUtils]: 114: Hoare triple {28903#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:28:24,711 INFO L273 TraceCheckUtils]: 115: Hoare triple {28903#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28903#false} is VALID [2018-11-23 12:28:24,711 INFO L273 TraceCheckUtils]: 116: Hoare triple {28903#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:28:24,711 INFO L273 TraceCheckUtils]: 117: Hoare triple {28903#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28903#false} is VALID [2018-11-23 12:28:24,711 INFO L273 TraceCheckUtils]: 118: Hoare triple {28903#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:28:24,711 INFO L273 TraceCheckUtils]: 119: Hoare triple {28903#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28903#false} is VALID [2018-11-23 12:28:24,711 INFO L273 TraceCheckUtils]: 120: Hoare triple {28903#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:28:24,711 INFO L273 TraceCheckUtils]: 121: Hoare triple {28903#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28903#false} is VALID [2018-11-23 12:28:24,712 INFO L273 TraceCheckUtils]: 122: Hoare triple {28903#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:28:24,712 INFO L273 TraceCheckUtils]: 123: Hoare triple {28903#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28903#false} is VALID [2018-11-23 12:28:24,712 INFO L273 TraceCheckUtils]: 124: Hoare triple {28903#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:28:24,712 INFO L273 TraceCheckUtils]: 125: Hoare triple {28903#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28903#false} is VALID [2018-11-23 12:28:24,712 INFO L273 TraceCheckUtils]: 126: Hoare triple {28903#false} assume !(~i~0 < 100000); {28903#false} is VALID [2018-11-23 12:28:24,712 INFO L273 TraceCheckUtils]: 127: Hoare triple {28903#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {28903#false} is VALID [2018-11-23 12:28:24,712 INFO L273 TraceCheckUtils]: 128: Hoare triple {28903#false} assume true; {28903#false} is VALID [2018-11-23 12:28:24,712 INFO L268 TraceCheckUtils]: 129: Hoare quadruple {28903#false} {28903#false} #72#return; {28903#false} is VALID [2018-11-23 12:28:24,712 INFO L273 TraceCheckUtils]: 130: Hoare triple {28903#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {28903#false} is VALID [2018-11-23 12:28:24,713 INFO L273 TraceCheckUtils]: 131: Hoare triple {28903#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28903#false} is VALID [2018-11-23 12:28:24,713 INFO L273 TraceCheckUtils]: 132: Hoare triple {28903#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28903#false} is VALID [2018-11-23 12:28:24,713 INFO L273 TraceCheckUtils]: 133: Hoare triple {28903#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28903#false} is VALID [2018-11-23 12:28:24,713 INFO L273 TraceCheckUtils]: 134: Hoare triple {28903#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28903#false} is VALID [2018-11-23 12:28:24,713 INFO L273 TraceCheckUtils]: 135: Hoare triple {28903#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28903#false} is VALID [2018-11-23 12:28:24,713 INFO L273 TraceCheckUtils]: 136: Hoare triple {28903#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28903#false} is VALID [2018-11-23 12:28:24,713 INFO L273 TraceCheckUtils]: 137: Hoare triple {28903#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28903#false} is VALID [2018-11-23 12:28:24,713 INFO L273 TraceCheckUtils]: 138: Hoare triple {28903#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28903#false} is VALID [2018-11-23 12:28:24,713 INFO L273 TraceCheckUtils]: 139: Hoare triple {28903#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28903#false} is VALID [2018-11-23 12:28:24,713 INFO L273 TraceCheckUtils]: 140: Hoare triple {28903#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28903#false} is VALID [2018-11-23 12:28:24,714 INFO L273 TraceCheckUtils]: 141: Hoare triple {28903#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28903#false} is VALID [2018-11-23 12:28:24,714 INFO L273 TraceCheckUtils]: 142: Hoare triple {28903#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28903#false} is VALID [2018-11-23 12:28:24,714 INFO L273 TraceCheckUtils]: 143: Hoare triple {28903#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28903#false} is VALID [2018-11-23 12:28:24,714 INFO L273 TraceCheckUtils]: 144: Hoare triple {28903#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28903#false} is VALID [2018-11-23 12:28:24,714 INFO L273 TraceCheckUtils]: 145: Hoare triple {28903#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28903#false} is VALID [2018-11-23 12:28:24,714 INFO L273 TraceCheckUtils]: 146: Hoare triple {28903#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28903#false} is VALID [2018-11-23 12:28:24,714 INFO L273 TraceCheckUtils]: 147: Hoare triple {28903#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28903#false} is VALID [2018-11-23 12:28:24,714 INFO L273 TraceCheckUtils]: 148: Hoare triple {28903#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28903#false} is VALID [2018-11-23 12:28:24,714 INFO L273 TraceCheckUtils]: 149: Hoare triple {28903#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28903#false} is VALID [2018-11-23 12:28:24,714 INFO L273 TraceCheckUtils]: 150: Hoare triple {28903#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28903#false} is VALID [2018-11-23 12:28:24,715 INFO L273 TraceCheckUtils]: 151: Hoare triple {28903#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {28903#false} is VALID [2018-11-23 12:28:24,715 INFO L273 TraceCheckUtils]: 152: Hoare triple {28903#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {28903#false} is VALID [2018-11-23 12:28:24,715 INFO L273 TraceCheckUtils]: 153: Hoare triple {28903#false} assume !(~i~2 < 99999); {28903#false} is VALID [2018-11-23 12:28:24,715 INFO L273 TraceCheckUtils]: 154: Hoare triple {28903#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {28903#false} is VALID [2018-11-23 12:28:24,715 INFO L256 TraceCheckUtils]: 155: Hoare triple {28903#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {28903#false} is VALID [2018-11-23 12:28:24,715 INFO L273 TraceCheckUtils]: 156: Hoare triple {28903#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {28903#false} is VALID [2018-11-23 12:28:24,715 INFO L273 TraceCheckUtils]: 157: Hoare triple {28903#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:28:24,715 INFO L273 TraceCheckUtils]: 158: Hoare triple {28903#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28903#false} is VALID [2018-11-23 12:28:24,715 INFO L273 TraceCheckUtils]: 159: Hoare triple {28903#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:28:24,715 INFO L273 TraceCheckUtils]: 160: Hoare triple {28903#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28903#false} is VALID [2018-11-23 12:28:24,716 INFO L273 TraceCheckUtils]: 161: Hoare triple {28903#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:28:24,716 INFO L273 TraceCheckUtils]: 162: Hoare triple {28903#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28903#false} is VALID [2018-11-23 12:28:24,716 INFO L273 TraceCheckUtils]: 163: Hoare triple {28903#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:28:24,716 INFO L273 TraceCheckUtils]: 164: Hoare triple {28903#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28903#false} is VALID [2018-11-23 12:28:24,716 INFO L273 TraceCheckUtils]: 165: Hoare triple {28903#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:28:24,716 INFO L273 TraceCheckUtils]: 166: Hoare triple {28903#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28903#false} is VALID [2018-11-23 12:28:24,716 INFO L273 TraceCheckUtils]: 167: Hoare triple {28903#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:28:24,716 INFO L273 TraceCheckUtils]: 168: Hoare triple {28903#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28903#false} is VALID [2018-11-23 12:28:24,716 INFO L273 TraceCheckUtils]: 169: Hoare triple {28903#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:28:24,717 INFO L273 TraceCheckUtils]: 170: Hoare triple {28903#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28903#false} is VALID [2018-11-23 12:28:24,717 INFO L273 TraceCheckUtils]: 171: Hoare triple {28903#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:28:24,717 INFO L273 TraceCheckUtils]: 172: Hoare triple {28903#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28903#false} is VALID [2018-11-23 12:28:24,717 INFO L273 TraceCheckUtils]: 173: Hoare triple {28903#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:28:24,717 INFO L273 TraceCheckUtils]: 174: Hoare triple {28903#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28903#false} is VALID [2018-11-23 12:28:24,717 INFO L273 TraceCheckUtils]: 175: Hoare triple {28903#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:28:24,717 INFO L273 TraceCheckUtils]: 176: Hoare triple {28903#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28903#false} is VALID [2018-11-23 12:28:24,717 INFO L273 TraceCheckUtils]: 177: Hoare triple {28903#false} assume !(~i~0 < 100000); {28903#false} is VALID [2018-11-23 12:28:24,717 INFO L273 TraceCheckUtils]: 178: Hoare triple {28903#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {28903#false} is VALID [2018-11-23 12:28:24,717 INFO L273 TraceCheckUtils]: 179: Hoare triple {28903#false} assume true; {28903#false} is VALID [2018-11-23 12:28:24,718 INFO L268 TraceCheckUtils]: 180: Hoare quadruple {28903#false} {28903#false} #74#return; {28903#false} is VALID [2018-11-23 12:28:24,718 INFO L273 TraceCheckUtils]: 181: Hoare triple {28903#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {28903#false} is VALID [2018-11-23 12:28:24,718 INFO L273 TraceCheckUtils]: 182: Hoare triple {28903#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {28903#false} is VALID [2018-11-23 12:28:24,718 INFO L273 TraceCheckUtils]: 183: Hoare triple {28903#false} assume !false; {28903#false} is VALID [2018-11-23 12:28:24,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2321 backedges. 444 proven. 100 refuted. 0 times theorem prover too weak. 1777 trivial. 0 not checked. [2018-11-23 12:28:24,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:24,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 13] total 49 [2018-11-23 12:28:24,759 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 184 [2018-11-23 12:28:24,759 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:24,759 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states. [2018-11-23 12:28:24,884 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:24,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-23 12:28:24,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-23 12:28:24,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=1572, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 12:28:24,886 INFO L87 Difference]: Start difference. First operand 135 states and 139 transitions. Second operand 49 states. [2018-11-23 12:28:25,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:25,654 INFO L93 Difference]: Finished difference Result 199 states and 211 transitions. [2018-11-23 12:28:25,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-23 12:28:25,655 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 184 [2018-11-23 12:28:25,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:25,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:28:25,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 150 transitions. [2018-11-23 12:28:25,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:28:25,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 150 transitions. [2018-11-23 12:28:25,657 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states and 150 transitions. [2018-11-23 12:28:25,800 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:25,803 INFO L225 Difference]: With dead ends: 199 [2018-11-23 12:28:25,803 INFO L226 Difference]: Without dead ends: 141 [2018-11-23 12:28:25,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=780, Invalid=1572, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 12:28:25,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-23 12:28:25,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2018-11-23 12:28:25,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:25,882 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand 139 states. [2018-11-23 12:28:25,882 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand 139 states. [2018-11-23 12:28:25,883 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 139 states. [2018-11-23 12:28:25,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:25,885 INFO L93 Difference]: Finished difference Result 141 states and 145 transitions. [2018-11-23 12:28:25,885 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 145 transitions. [2018-11-23 12:28:25,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:25,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:25,886 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand 141 states. [2018-11-23 12:28:25,886 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 141 states. [2018-11-23 12:28:25,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:25,889 INFO L93 Difference]: Finished difference Result 141 states and 145 transitions. [2018-11-23 12:28:25,889 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 145 transitions. [2018-11-23 12:28:25,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:25,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:25,889 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:25,890 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:25,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-23 12:28:25,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 143 transitions. [2018-11-23 12:28:25,892 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 143 transitions. Word has length 184 [2018-11-23 12:28:25,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:25,892 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 143 transitions. [2018-11-23 12:28:25,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-23 12:28:25,893 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 143 transitions. [2018-11-23 12:28:25,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-11-23 12:28:25,894 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:25,894 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 33, 33, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:28:25,894 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:25,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:25,894 INFO L82 PathProgramCache]: Analyzing trace with hash 2006594855, now seen corresponding path program 36 times [2018-11-23 12:28:25,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:25,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:25,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:25,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:25,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:25,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:27,459 INFO L256 TraceCheckUtils]: 0: Hoare triple {30287#true} call ULTIMATE.init(); {30287#true} is VALID [2018-11-23 12:28:27,460 INFO L273 TraceCheckUtils]: 1: Hoare triple {30287#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {30287#true} is VALID [2018-11-23 12:28:27,460 INFO L273 TraceCheckUtils]: 2: Hoare triple {30287#true} assume true; {30287#true} is VALID [2018-11-23 12:28:27,460 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30287#true} {30287#true} #66#return; {30287#true} is VALID [2018-11-23 12:28:27,460 INFO L256 TraceCheckUtils]: 4: Hoare triple {30287#true} call #t~ret13 := main(); {30287#true} is VALID [2018-11-23 12:28:27,461 INFO L273 TraceCheckUtils]: 5: Hoare triple {30287#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; {30289#(= main_~i~1 0)} is VALID [2018-11-23 12:28:27,461 INFO L273 TraceCheckUtils]: 6: Hoare triple {30289#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30289#(= main_~i~1 0)} is VALID [2018-11-23 12:28:27,462 INFO L273 TraceCheckUtils]: 7: Hoare triple {30289#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30290#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:27,462 INFO L273 TraceCheckUtils]: 8: Hoare triple {30290#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30290#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:27,463 INFO L273 TraceCheckUtils]: 9: Hoare triple {30290#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30291#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:27,463 INFO L273 TraceCheckUtils]: 10: Hoare triple {30291#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30291#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:27,463 INFO L273 TraceCheckUtils]: 11: Hoare triple {30291#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30292#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:27,464 INFO L273 TraceCheckUtils]: 12: Hoare triple {30292#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30292#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:27,464 INFO L273 TraceCheckUtils]: 13: Hoare triple {30292#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30293#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:27,464 INFO L273 TraceCheckUtils]: 14: Hoare triple {30293#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30293#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:27,465 INFO L273 TraceCheckUtils]: 15: Hoare triple {30293#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30294#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:27,465 INFO L273 TraceCheckUtils]: 16: Hoare triple {30294#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30294#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:27,466 INFO L273 TraceCheckUtils]: 17: Hoare triple {30294#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30295#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:27,467 INFO L273 TraceCheckUtils]: 18: Hoare triple {30295#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30295#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:27,467 INFO L273 TraceCheckUtils]: 19: Hoare triple {30295#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30296#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:27,468 INFO L273 TraceCheckUtils]: 20: Hoare triple {30296#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30296#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:27,468 INFO L273 TraceCheckUtils]: 21: Hoare triple {30296#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30297#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:27,469 INFO L273 TraceCheckUtils]: 22: Hoare triple {30297#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30297#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:27,470 INFO L273 TraceCheckUtils]: 23: Hoare triple {30297#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30298#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:27,470 INFO L273 TraceCheckUtils]: 24: Hoare triple {30298#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30298#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:27,471 INFO L273 TraceCheckUtils]: 25: Hoare triple {30298#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30299#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:27,471 INFO L273 TraceCheckUtils]: 26: Hoare triple {30299#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30299#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:27,472 INFO L273 TraceCheckUtils]: 27: Hoare triple {30299#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30300#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:27,473 INFO L273 TraceCheckUtils]: 28: Hoare triple {30300#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30300#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:27,473 INFO L273 TraceCheckUtils]: 29: Hoare triple {30300#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30301#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:27,474 INFO L273 TraceCheckUtils]: 30: Hoare triple {30301#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30301#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:27,474 INFO L273 TraceCheckUtils]: 31: Hoare triple {30301#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30302#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:27,475 INFO L273 TraceCheckUtils]: 32: Hoare triple {30302#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30302#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:27,476 INFO L273 TraceCheckUtils]: 33: Hoare triple {30302#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30303#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:27,476 INFO L273 TraceCheckUtils]: 34: Hoare triple {30303#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30303#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:27,477 INFO L273 TraceCheckUtils]: 35: Hoare triple {30303#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30304#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:27,477 INFO L273 TraceCheckUtils]: 36: Hoare triple {30304#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30304#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:27,478 INFO L273 TraceCheckUtils]: 37: Hoare triple {30304#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30305#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:27,478 INFO L273 TraceCheckUtils]: 38: Hoare triple {30305#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30305#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:27,479 INFO L273 TraceCheckUtils]: 39: Hoare triple {30305#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30306#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:27,479 INFO L273 TraceCheckUtils]: 40: Hoare triple {30306#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30306#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:27,480 INFO L273 TraceCheckUtils]: 41: Hoare triple {30306#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30307#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:27,481 INFO L273 TraceCheckUtils]: 42: Hoare triple {30307#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30307#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:27,481 INFO L273 TraceCheckUtils]: 43: Hoare triple {30307#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30308#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:27,482 INFO L273 TraceCheckUtils]: 44: Hoare triple {30308#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30308#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:27,483 INFO L273 TraceCheckUtils]: 45: Hoare triple {30308#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30309#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:27,483 INFO L273 TraceCheckUtils]: 46: Hoare triple {30309#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30309#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:27,484 INFO L273 TraceCheckUtils]: 47: Hoare triple {30309#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30310#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:27,484 INFO L273 TraceCheckUtils]: 48: Hoare triple {30310#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30310#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:27,485 INFO L273 TraceCheckUtils]: 49: Hoare triple {30310#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30311#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:27,486 INFO L273 TraceCheckUtils]: 50: Hoare triple {30311#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30311#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:27,486 INFO L273 TraceCheckUtils]: 51: Hoare triple {30311#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30312#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:27,487 INFO L273 TraceCheckUtils]: 52: Hoare triple {30312#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30312#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:27,487 INFO L273 TraceCheckUtils]: 53: Hoare triple {30312#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30313#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:27,488 INFO L273 TraceCheckUtils]: 54: Hoare triple {30313#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30313#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:27,489 INFO L273 TraceCheckUtils]: 55: Hoare triple {30313#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30314#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:27,489 INFO L273 TraceCheckUtils]: 56: Hoare triple {30314#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30314#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:27,490 INFO L273 TraceCheckUtils]: 57: Hoare triple {30314#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30315#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:27,490 INFO L273 TraceCheckUtils]: 58: Hoare triple {30315#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30315#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:27,491 INFO L273 TraceCheckUtils]: 59: Hoare triple {30315#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30316#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:27,492 INFO L273 TraceCheckUtils]: 60: Hoare triple {30316#(<= main_~i~1 27)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30316#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:27,492 INFO L273 TraceCheckUtils]: 61: Hoare triple {30316#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30317#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:27,493 INFO L273 TraceCheckUtils]: 62: Hoare triple {30317#(<= main_~i~1 28)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30317#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:27,494 INFO L273 TraceCheckUtils]: 63: Hoare triple {30317#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30318#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:27,494 INFO L273 TraceCheckUtils]: 64: Hoare triple {30318#(<= main_~i~1 29)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30318#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:27,495 INFO L273 TraceCheckUtils]: 65: Hoare triple {30318#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30319#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:27,495 INFO L273 TraceCheckUtils]: 66: Hoare triple {30319#(<= main_~i~1 30)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30319#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:27,496 INFO L273 TraceCheckUtils]: 67: Hoare triple {30319#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30320#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:27,497 INFO L273 TraceCheckUtils]: 68: Hoare triple {30320#(<= main_~i~1 31)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30320#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:27,497 INFO L273 TraceCheckUtils]: 69: Hoare triple {30320#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30321#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:27,498 INFO L273 TraceCheckUtils]: 70: Hoare triple {30321#(<= main_~i~1 32)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30321#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:27,499 INFO L273 TraceCheckUtils]: 71: Hoare triple {30321#(<= main_~i~1 32)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30322#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:27,499 INFO L273 TraceCheckUtils]: 72: Hoare triple {30322#(<= main_~i~1 33)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30322#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:27,500 INFO L273 TraceCheckUtils]: 73: Hoare triple {30322#(<= main_~i~1 33)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30323#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:27,500 INFO L273 TraceCheckUtils]: 74: Hoare triple {30323#(<= main_~i~1 34)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30323#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:27,501 INFO L273 TraceCheckUtils]: 75: Hoare triple {30323#(<= main_~i~1 34)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30324#(<= main_~i~1 35)} is VALID [2018-11-23 12:28:27,502 INFO L273 TraceCheckUtils]: 76: Hoare triple {30324#(<= main_~i~1 35)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30324#(<= main_~i~1 35)} is VALID [2018-11-23 12:28:27,502 INFO L273 TraceCheckUtils]: 77: Hoare triple {30324#(<= main_~i~1 35)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30325#(<= main_~i~1 36)} is VALID [2018-11-23 12:28:27,503 INFO L273 TraceCheckUtils]: 78: Hoare triple {30325#(<= main_~i~1 36)} assume !(~i~1 < 100000); {30288#false} is VALID [2018-11-23 12:28:27,503 INFO L256 TraceCheckUtils]: 79: Hoare triple {30288#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {30287#true} is VALID [2018-11-23 12:28:27,503 INFO L273 TraceCheckUtils]: 80: Hoare triple {30287#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {30287#true} is VALID [2018-11-23 12:28:27,504 INFO L273 TraceCheckUtils]: 81: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:27,504 INFO L273 TraceCheckUtils]: 82: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:27,504 INFO L273 TraceCheckUtils]: 83: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:27,504 INFO L273 TraceCheckUtils]: 84: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:27,504 INFO L273 TraceCheckUtils]: 85: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:27,504 INFO L273 TraceCheckUtils]: 86: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:27,505 INFO L273 TraceCheckUtils]: 87: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:27,505 INFO L273 TraceCheckUtils]: 88: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:27,505 INFO L273 TraceCheckUtils]: 89: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:27,505 INFO L273 TraceCheckUtils]: 90: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:27,505 INFO L273 TraceCheckUtils]: 91: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:27,505 INFO L273 TraceCheckUtils]: 92: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:27,506 INFO L273 TraceCheckUtils]: 93: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:27,506 INFO L273 TraceCheckUtils]: 94: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:27,506 INFO L273 TraceCheckUtils]: 95: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:27,506 INFO L273 TraceCheckUtils]: 96: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:27,506 INFO L273 TraceCheckUtils]: 97: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:27,506 INFO L273 TraceCheckUtils]: 98: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:27,506 INFO L273 TraceCheckUtils]: 99: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:27,506 INFO L273 TraceCheckUtils]: 100: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:27,506 INFO L273 TraceCheckUtils]: 101: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:27,507 INFO L273 TraceCheckUtils]: 102: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:27,507 INFO L273 TraceCheckUtils]: 103: Hoare triple {30287#true} assume !(~i~0 < 100000); {30287#true} is VALID [2018-11-23 12:28:27,507 INFO L273 TraceCheckUtils]: 104: Hoare triple {30287#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {30287#true} is VALID [2018-11-23 12:28:27,507 INFO L273 TraceCheckUtils]: 105: Hoare triple {30287#true} assume true; {30287#true} is VALID [2018-11-23 12:28:27,507 INFO L268 TraceCheckUtils]: 106: Hoare quadruple {30287#true} {30288#false} #70#return; {30288#false} is VALID [2018-11-23 12:28:27,507 INFO L273 TraceCheckUtils]: 107: Hoare triple {30288#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {30288#false} is VALID [2018-11-23 12:28:27,507 INFO L256 TraceCheckUtils]: 108: Hoare triple {30288#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {30287#true} is VALID [2018-11-23 12:28:27,507 INFO L273 TraceCheckUtils]: 109: Hoare triple {30287#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {30287#true} is VALID [2018-11-23 12:28:27,507 INFO L273 TraceCheckUtils]: 110: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:27,507 INFO L273 TraceCheckUtils]: 111: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:27,508 INFO L273 TraceCheckUtils]: 112: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:27,508 INFO L273 TraceCheckUtils]: 113: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:27,508 INFO L273 TraceCheckUtils]: 114: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:27,508 INFO L273 TraceCheckUtils]: 115: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:27,508 INFO L273 TraceCheckUtils]: 116: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:27,508 INFO L273 TraceCheckUtils]: 117: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:27,508 INFO L273 TraceCheckUtils]: 118: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:27,508 INFO L273 TraceCheckUtils]: 119: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:27,508 INFO L273 TraceCheckUtils]: 120: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:27,508 INFO L273 TraceCheckUtils]: 121: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:27,509 INFO L273 TraceCheckUtils]: 122: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:27,509 INFO L273 TraceCheckUtils]: 123: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:27,509 INFO L273 TraceCheckUtils]: 124: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:27,509 INFO L273 TraceCheckUtils]: 125: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:27,509 INFO L273 TraceCheckUtils]: 126: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:27,509 INFO L273 TraceCheckUtils]: 127: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:27,509 INFO L273 TraceCheckUtils]: 128: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:27,509 INFO L273 TraceCheckUtils]: 129: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:27,509 INFO L273 TraceCheckUtils]: 130: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:27,509 INFO L273 TraceCheckUtils]: 131: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:27,510 INFO L273 TraceCheckUtils]: 132: Hoare triple {30287#true} assume !(~i~0 < 100000); {30287#true} is VALID [2018-11-23 12:28:27,510 INFO L273 TraceCheckUtils]: 133: Hoare triple {30287#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {30287#true} is VALID [2018-11-23 12:28:27,510 INFO L273 TraceCheckUtils]: 134: Hoare triple {30287#true} assume true; {30287#true} is VALID [2018-11-23 12:28:27,510 INFO L268 TraceCheckUtils]: 135: Hoare quadruple {30287#true} {30288#false} #72#return; {30288#false} is VALID [2018-11-23 12:28:27,510 INFO L273 TraceCheckUtils]: 136: Hoare triple {30288#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {30288#false} is VALID [2018-11-23 12:28:27,510 INFO L273 TraceCheckUtils]: 137: Hoare triple {30288#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30288#false} is VALID [2018-11-23 12:28:27,510 INFO L273 TraceCheckUtils]: 138: Hoare triple {30288#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30288#false} is VALID [2018-11-23 12:28:27,510 INFO L273 TraceCheckUtils]: 139: Hoare triple {30288#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30288#false} is VALID [2018-11-23 12:28:27,510 INFO L273 TraceCheckUtils]: 140: Hoare triple {30288#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30288#false} is VALID [2018-11-23 12:28:27,510 INFO L273 TraceCheckUtils]: 141: Hoare triple {30288#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30288#false} is VALID [2018-11-23 12:28:27,511 INFO L273 TraceCheckUtils]: 142: Hoare triple {30288#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30288#false} is VALID [2018-11-23 12:28:27,511 INFO L273 TraceCheckUtils]: 143: Hoare triple {30288#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30288#false} is VALID [2018-11-23 12:28:27,511 INFO L273 TraceCheckUtils]: 144: Hoare triple {30288#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30288#false} is VALID [2018-11-23 12:28:27,511 INFO L273 TraceCheckUtils]: 145: Hoare triple {30288#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30288#false} is VALID [2018-11-23 12:28:27,511 INFO L273 TraceCheckUtils]: 146: Hoare triple {30288#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30288#false} is VALID [2018-11-23 12:28:27,511 INFO L273 TraceCheckUtils]: 147: Hoare triple {30288#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30288#false} is VALID [2018-11-23 12:28:27,511 INFO L273 TraceCheckUtils]: 148: Hoare triple {30288#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30288#false} is VALID [2018-11-23 12:28:27,511 INFO L273 TraceCheckUtils]: 149: Hoare triple {30288#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30288#false} is VALID [2018-11-23 12:28:27,511 INFO L273 TraceCheckUtils]: 150: Hoare triple {30288#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30288#false} is VALID [2018-11-23 12:28:27,511 INFO L273 TraceCheckUtils]: 151: Hoare triple {30288#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30288#false} is VALID [2018-11-23 12:28:27,512 INFO L273 TraceCheckUtils]: 152: Hoare triple {30288#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30288#false} is VALID [2018-11-23 12:28:27,512 INFO L273 TraceCheckUtils]: 153: Hoare triple {30288#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30288#false} is VALID [2018-11-23 12:28:27,512 INFO L273 TraceCheckUtils]: 154: Hoare triple {30288#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30288#false} is VALID [2018-11-23 12:28:27,512 INFO L273 TraceCheckUtils]: 155: Hoare triple {30288#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30288#false} is VALID [2018-11-23 12:28:27,512 INFO L273 TraceCheckUtils]: 156: Hoare triple {30288#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30288#false} is VALID [2018-11-23 12:28:27,512 INFO L273 TraceCheckUtils]: 157: Hoare triple {30288#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30288#false} is VALID [2018-11-23 12:28:27,512 INFO L273 TraceCheckUtils]: 158: Hoare triple {30288#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30288#false} is VALID [2018-11-23 12:28:27,512 INFO L273 TraceCheckUtils]: 159: Hoare triple {30288#false} assume !(~i~2 < 99999); {30288#false} is VALID [2018-11-23 12:28:27,512 INFO L273 TraceCheckUtils]: 160: Hoare triple {30288#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {30288#false} is VALID [2018-11-23 12:28:27,512 INFO L256 TraceCheckUtils]: 161: Hoare triple {30288#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {30287#true} is VALID [2018-11-23 12:28:27,513 INFO L273 TraceCheckUtils]: 162: Hoare triple {30287#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {30287#true} is VALID [2018-11-23 12:28:27,513 INFO L273 TraceCheckUtils]: 163: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:27,513 INFO L273 TraceCheckUtils]: 164: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:27,513 INFO L273 TraceCheckUtils]: 165: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:27,513 INFO L273 TraceCheckUtils]: 166: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:27,513 INFO L273 TraceCheckUtils]: 167: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:27,513 INFO L273 TraceCheckUtils]: 168: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:27,513 INFO L273 TraceCheckUtils]: 169: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:27,513 INFO L273 TraceCheckUtils]: 170: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:27,513 INFO L273 TraceCheckUtils]: 171: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:27,514 INFO L273 TraceCheckUtils]: 172: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:27,514 INFO L273 TraceCheckUtils]: 173: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:27,514 INFO L273 TraceCheckUtils]: 174: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:27,514 INFO L273 TraceCheckUtils]: 175: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:27,514 INFO L273 TraceCheckUtils]: 176: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:27,514 INFO L273 TraceCheckUtils]: 177: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:27,514 INFO L273 TraceCheckUtils]: 178: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:27,514 INFO L273 TraceCheckUtils]: 179: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:27,514 INFO L273 TraceCheckUtils]: 180: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:27,515 INFO L273 TraceCheckUtils]: 181: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:27,515 INFO L273 TraceCheckUtils]: 182: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:27,515 INFO L273 TraceCheckUtils]: 183: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:27,515 INFO L273 TraceCheckUtils]: 184: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:27,515 INFO L273 TraceCheckUtils]: 185: Hoare triple {30287#true} assume !(~i~0 < 100000); {30287#true} is VALID [2018-11-23 12:28:27,515 INFO L273 TraceCheckUtils]: 186: Hoare triple {30287#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {30287#true} is VALID [2018-11-23 12:28:27,515 INFO L273 TraceCheckUtils]: 187: Hoare triple {30287#true} assume true; {30287#true} is VALID [2018-11-23 12:28:27,515 INFO L268 TraceCheckUtils]: 188: Hoare quadruple {30287#true} {30288#false} #74#return; {30288#false} is VALID [2018-11-23 12:28:27,515 INFO L273 TraceCheckUtils]: 189: Hoare triple {30288#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {30288#false} is VALID [2018-11-23 12:28:27,515 INFO L273 TraceCheckUtils]: 190: Hoare triple {30288#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {30288#false} is VALID [2018-11-23 12:28:27,516 INFO L273 TraceCheckUtils]: 191: Hoare triple {30288#false} assume !false; {30288#false} is VALID [2018-11-23 12:28:27,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2587 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 1291 trivial. 0 not checked. [2018-11-23 12:28:27,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:27,532 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:28:27,542 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:28:30,806 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2018-11-23 12:28:30,807 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:30,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:30,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:31,241 INFO L256 TraceCheckUtils]: 0: Hoare triple {30287#true} call ULTIMATE.init(); {30287#true} is VALID [2018-11-23 12:28:31,241 INFO L273 TraceCheckUtils]: 1: Hoare triple {30287#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {30287#true} is VALID [2018-11-23 12:28:31,241 INFO L273 TraceCheckUtils]: 2: Hoare triple {30287#true} assume true; {30287#true} is VALID [2018-11-23 12:28:31,241 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30287#true} {30287#true} #66#return; {30287#true} is VALID [2018-11-23 12:28:31,241 INFO L256 TraceCheckUtils]: 4: Hoare triple {30287#true} call #t~ret13 := main(); {30287#true} is VALID [2018-11-23 12:28:31,242 INFO L273 TraceCheckUtils]: 5: Hoare triple {30287#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; {30287#true} is VALID [2018-11-23 12:28:31,242 INFO L273 TraceCheckUtils]: 6: Hoare triple {30287#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:31,242 INFO L273 TraceCheckUtils]: 7: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:31,242 INFO L273 TraceCheckUtils]: 8: Hoare triple {30287#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:31,242 INFO L273 TraceCheckUtils]: 9: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:31,242 INFO L273 TraceCheckUtils]: 10: Hoare triple {30287#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:31,243 INFO L273 TraceCheckUtils]: 11: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:31,243 INFO L273 TraceCheckUtils]: 12: Hoare triple {30287#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:31,243 INFO L273 TraceCheckUtils]: 13: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:31,243 INFO L273 TraceCheckUtils]: 14: Hoare triple {30287#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:31,243 INFO L273 TraceCheckUtils]: 15: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:31,243 INFO L273 TraceCheckUtils]: 16: Hoare triple {30287#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:31,243 INFO L273 TraceCheckUtils]: 17: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:31,243 INFO L273 TraceCheckUtils]: 18: Hoare triple {30287#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:31,243 INFO L273 TraceCheckUtils]: 19: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:31,244 INFO L273 TraceCheckUtils]: 20: Hoare triple {30287#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:31,244 INFO L273 TraceCheckUtils]: 21: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:31,244 INFO L273 TraceCheckUtils]: 22: Hoare triple {30287#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:31,244 INFO L273 TraceCheckUtils]: 23: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:31,244 INFO L273 TraceCheckUtils]: 24: Hoare triple {30287#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:31,244 INFO L273 TraceCheckUtils]: 25: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:31,244 INFO L273 TraceCheckUtils]: 26: Hoare triple {30287#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:31,244 INFO L273 TraceCheckUtils]: 27: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:31,244 INFO L273 TraceCheckUtils]: 28: Hoare triple {30287#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:31,244 INFO L273 TraceCheckUtils]: 29: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:31,245 INFO L273 TraceCheckUtils]: 30: Hoare triple {30287#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:31,245 INFO L273 TraceCheckUtils]: 31: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:31,245 INFO L273 TraceCheckUtils]: 32: Hoare triple {30287#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:31,245 INFO L273 TraceCheckUtils]: 33: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:31,245 INFO L273 TraceCheckUtils]: 34: Hoare triple {30287#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:31,245 INFO L273 TraceCheckUtils]: 35: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:31,245 INFO L273 TraceCheckUtils]: 36: Hoare triple {30287#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:31,245 INFO L273 TraceCheckUtils]: 37: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:31,245 INFO L273 TraceCheckUtils]: 38: Hoare triple {30287#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:31,245 INFO L273 TraceCheckUtils]: 39: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:31,246 INFO L273 TraceCheckUtils]: 40: Hoare triple {30287#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:31,246 INFO L273 TraceCheckUtils]: 41: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:31,246 INFO L273 TraceCheckUtils]: 42: Hoare triple {30287#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:31,246 INFO L273 TraceCheckUtils]: 43: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:31,246 INFO L273 TraceCheckUtils]: 44: Hoare triple {30287#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:31,246 INFO L273 TraceCheckUtils]: 45: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:31,246 INFO L273 TraceCheckUtils]: 46: Hoare triple {30287#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:31,246 INFO L273 TraceCheckUtils]: 47: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:31,246 INFO L273 TraceCheckUtils]: 48: Hoare triple {30287#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:31,246 INFO L273 TraceCheckUtils]: 49: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:31,247 INFO L273 TraceCheckUtils]: 50: Hoare triple {30287#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:31,247 INFO L273 TraceCheckUtils]: 51: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:31,247 INFO L273 TraceCheckUtils]: 52: Hoare triple {30287#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:31,247 INFO L273 TraceCheckUtils]: 53: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:31,247 INFO L273 TraceCheckUtils]: 54: Hoare triple {30287#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:31,247 INFO L273 TraceCheckUtils]: 55: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:31,247 INFO L273 TraceCheckUtils]: 56: Hoare triple {30287#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:31,247 INFO L273 TraceCheckUtils]: 57: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:31,247 INFO L273 TraceCheckUtils]: 58: Hoare triple {30287#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:31,247 INFO L273 TraceCheckUtils]: 59: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:31,248 INFO L273 TraceCheckUtils]: 60: Hoare triple {30287#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:31,248 INFO L273 TraceCheckUtils]: 61: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:31,248 INFO L273 TraceCheckUtils]: 62: Hoare triple {30287#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:31,248 INFO L273 TraceCheckUtils]: 63: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:31,248 INFO L273 TraceCheckUtils]: 64: Hoare triple {30287#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:31,248 INFO L273 TraceCheckUtils]: 65: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:31,248 INFO L273 TraceCheckUtils]: 66: Hoare triple {30287#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:31,248 INFO L273 TraceCheckUtils]: 67: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:31,248 INFO L273 TraceCheckUtils]: 68: Hoare triple {30287#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:31,249 INFO L273 TraceCheckUtils]: 69: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:31,249 INFO L273 TraceCheckUtils]: 70: Hoare triple {30287#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:31,249 INFO L273 TraceCheckUtils]: 71: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:31,249 INFO L273 TraceCheckUtils]: 72: Hoare triple {30287#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:31,249 INFO L273 TraceCheckUtils]: 73: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:31,249 INFO L273 TraceCheckUtils]: 74: Hoare triple {30287#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:31,249 INFO L273 TraceCheckUtils]: 75: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:31,249 INFO L273 TraceCheckUtils]: 76: Hoare triple {30287#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {30287#true} is VALID [2018-11-23 12:28:31,249 INFO L273 TraceCheckUtils]: 77: Hoare triple {30287#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {30287#true} is VALID [2018-11-23 12:28:31,249 INFO L273 TraceCheckUtils]: 78: Hoare triple {30287#true} assume !(~i~1 < 100000); {30287#true} is VALID [2018-11-23 12:28:31,250 INFO L256 TraceCheckUtils]: 79: Hoare triple {30287#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {30287#true} is VALID [2018-11-23 12:28:31,250 INFO L273 TraceCheckUtils]: 80: Hoare triple {30287#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {30287#true} is VALID [2018-11-23 12:28:31,250 INFO L273 TraceCheckUtils]: 81: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:31,250 INFO L273 TraceCheckUtils]: 82: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:31,250 INFO L273 TraceCheckUtils]: 83: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:31,250 INFO L273 TraceCheckUtils]: 84: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:31,250 INFO L273 TraceCheckUtils]: 85: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:31,250 INFO L273 TraceCheckUtils]: 86: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:31,250 INFO L273 TraceCheckUtils]: 87: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:31,250 INFO L273 TraceCheckUtils]: 88: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:31,250 INFO L273 TraceCheckUtils]: 89: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:31,251 INFO L273 TraceCheckUtils]: 90: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:31,251 INFO L273 TraceCheckUtils]: 91: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:31,251 INFO L273 TraceCheckUtils]: 92: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:31,251 INFO L273 TraceCheckUtils]: 93: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:31,251 INFO L273 TraceCheckUtils]: 94: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:31,251 INFO L273 TraceCheckUtils]: 95: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:31,251 INFO L273 TraceCheckUtils]: 96: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:31,251 INFO L273 TraceCheckUtils]: 97: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:31,251 INFO L273 TraceCheckUtils]: 98: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:31,251 INFO L273 TraceCheckUtils]: 99: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:31,252 INFO L273 TraceCheckUtils]: 100: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:31,252 INFO L273 TraceCheckUtils]: 101: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:31,252 INFO L273 TraceCheckUtils]: 102: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:31,252 INFO L273 TraceCheckUtils]: 103: Hoare triple {30287#true} assume !(~i~0 < 100000); {30287#true} is VALID [2018-11-23 12:28:31,252 INFO L273 TraceCheckUtils]: 104: Hoare triple {30287#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {30287#true} is VALID [2018-11-23 12:28:31,252 INFO L273 TraceCheckUtils]: 105: Hoare triple {30287#true} assume true; {30287#true} is VALID [2018-11-23 12:28:31,252 INFO L268 TraceCheckUtils]: 106: Hoare quadruple {30287#true} {30287#true} #70#return; {30287#true} is VALID [2018-11-23 12:28:31,252 INFO L273 TraceCheckUtils]: 107: Hoare triple {30287#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {30287#true} is VALID [2018-11-23 12:28:31,252 INFO L256 TraceCheckUtils]: 108: Hoare triple {30287#true} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {30287#true} is VALID [2018-11-23 12:28:31,252 INFO L273 TraceCheckUtils]: 109: Hoare triple {30287#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {30287#true} is VALID [2018-11-23 12:28:31,253 INFO L273 TraceCheckUtils]: 110: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:31,253 INFO L273 TraceCheckUtils]: 111: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:31,253 INFO L273 TraceCheckUtils]: 112: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:31,253 INFO L273 TraceCheckUtils]: 113: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:31,253 INFO L273 TraceCheckUtils]: 114: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:31,253 INFO L273 TraceCheckUtils]: 115: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:31,253 INFO L273 TraceCheckUtils]: 116: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:31,253 INFO L273 TraceCheckUtils]: 117: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:31,253 INFO L273 TraceCheckUtils]: 118: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:31,253 INFO L273 TraceCheckUtils]: 119: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:31,254 INFO L273 TraceCheckUtils]: 120: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:31,254 INFO L273 TraceCheckUtils]: 121: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:31,254 INFO L273 TraceCheckUtils]: 122: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:31,254 INFO L273 TraceCheckUtils]: 123: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:31,254 INFO L273 TraceCheckUtils]: 124: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:31,254 INFO L273 TraceCheckUtils]: 125: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:31,254 INFO L273 TraceCheckUtils]: 126: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:31,254 INFO L273 TraceCheckUtils]: 127: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:31,254 INFO L273 TraceCheckUtils]: 128: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:31,254 INFO L273 TraceCheckUtils]: 129: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:31,255 INFO L273 TraceCheckUtils]: 130: Hoare triple {30287#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:28:31,255 INFO L273 TraceCheckUtils]: 131: Hoare triple {30287#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30287#true} is VALID [2018-11-23 12:28:31,255 INFO L273 TraceCheckUtils]: 132: Hoare triple {30287#true} assume !(~i~0 < 100000); {30287#true} is VALID [2018-11-23 12:28:31,255 INFO L273 TraceCheckUtils]: 133: Hoare triple {30287#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {30287#true} is VALID [2018-11-23 12:28:31,255 INFO L273 TraceCheckUtils]: 134: Hoare triple {30287#true} assume true; {30287#true} is VALID [2018-11-23 12:28:31,255 INFO L268 TraceCheckUtils]: 135: Hoare quadruple {30287#true} {30287#true} #72#return; {30287#true} is VALID [2018-11-23 12:28:31,255 INFO L273 TraceCheckUtils]: 136: Hoare triple {30287#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {30287#true} is VALID [2018-11-23 12:28:31,255 INFO L273 TraceCheckUtils]: 137: Hoare triple {30287#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30287#true} is VALID [2018-11-23 12:28:31,255 INFO L273 TraceCheckUtils]: 138: Hoare triple {30287#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30287#true} is VALID [2018-11-23 12:28:31,255 INFO L273 TraceCheckUtils]: 139: Hoare triple {30287#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30287#true} is VALID [2018-11-23 12:28:31,256 INFO L273 TraceCheckUtils]: 140: Hoare triple {30287#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30287#true} is VALID [2018-11-23 12:28:31,256 INFO L273 TraceCheckUtils]: 141: Hoare triple {30287#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30287#true} is VALID [2018-11-23 12:28:31,256 INFO L273 TraceCheckUtils]: 142: Hoare triple {30287#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30287#true} is VALID [2018-11-23 12:28:31,256 INFO L273 TraceCheckUtils]: 143: Hoare triple {30287#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30287#true} is VALID [2018-11-23 12:28:31,256 INFO L273 TraceCheckUtils]: 144: Hoare triple {30287#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30287#true} is VALID [2018-11-23 12:28:31,256 INFO L273 TraceCheckUtils]: 145: Hoare triple {30287#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30287#true} is VALID [2018-11-23 12:28:31,256 INFO L273 TraceCheckUtils]: 146: Hoare triple {30287#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30287#true} is VALID [2018-11-23 12:28:31,256 INFO L273 TraceCheckUtils]: 147: Hoare triple {30287#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30287#true} is VALID [2018-11-23 12:28:31,256 INFO L273 TraceCheckUtils]: 148: Hoare triple {30287#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30287#true} is VALID [2018-11-23 12:28:31,256 INFO L273 TraceCheckUtils]: 149: Hoare triple {30287#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30287#true} is VALID [2018-11-23 12:28:31,257 INFO L273 TraceCheckUtils]: 150: Hoare triple {30287#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30287#true} is VALID [2018-11-23 12:28:31,257 INFO L273 TraceCheckUtils]: 151: Hoare triple {30287#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30287#true} is VALID [2018-11-23 12:28:31,257 INFO L273 TraceCheckUtils]: 152: Hoare triple {30287#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30287#true} is VALID [2018-11-23 12:28:31,257 INFO L273 TraceCheckUtils]: 153: Hoare triple {30287#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30287#true} is VALID [2018-11-23 12:28:31,257 INFO L273 TraceCheckUtils]: 154: Hoare triple {30287#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30287#true} is VALID [2018-11-23 12:28:31,257 INFO L273 TraceCheckUtils]: 155: Hoare triple {30287#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30287#true} is VALID [2018-11-23 12:28:31,257 INFO L273 TraceCheckUtils]: 156: Hoare triple {30287#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30287#true} is VALID [2018-11-23 12:28:31,257 INFO L273 TraceCheckUtils]: 157: Hoare triple {30287#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {30287#true} is VALID [2018-11-23 12:28:31,257 INFO L273 TraceCheckUtils]: 158: Hoare triple {30287#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {30287#true} is VALID [2018-11-23 12:28:31,257 INFO L273 TraceCheckUtils]: 159: Hoare triple {30287#true} assume !(~i~2 < 99999); {30287#true} is VALID [2018-11-23 12:28:31,258 INFO L273 TraceCheckUtils]: 160: Hoare triple {30287#true} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {30287#true} is VALID [2018-11-23 12:28:31,258 INFO L256 TraceCheckUtils]: 161: Hoare triple {30287#true} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {30287#true} is VALID [2018-11-23 12:28:31,259 INFO L273 TraceCheckUtils]: 162: Hoare triple {30287#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {30815#(<= bor_~i~0 1)} is VALID [2018-11-23 12:28:31,259 INFO L273 TraceCheckUtils]: 163: Hoare triple {30815#(<= bor_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30815#(<= bor_~i~0 1)} is VALID [2018-11-23 12:28:31,259 INFO L273 TraceCheckUtils]: 164: Hoare triple {30815#(<= bor_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30822#(<= bor_~i~0 2)} is VALID [2018-11-23 12:28:31,260 INFO L273 TraceCheckUtils]: 165: Hoare triple {30822#(<= bor_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30822#(<= bor_~i~0 2)} is VALID [2018-11-23 12:28:31,261 INFO L273 TraceCheckUtils]: 166: Hoare triple {30822#(<= bor_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30829#(<= bor_~i~0 3)} is VALID [2018-11-23 12:28:31,261 INFO L273 TraceCheckUtils]: 167: Hoare triple {30829#(<= bor_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30829#(<= bor_~i~0 3)} is VALID [2018-11-23 12:28:31,261 INFO L273 TraceCheckUtils]: 168: Hoare triple {30829#(<= bor_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30836#(<= bor_~i~0 4)} is VALID [2018-11-23 12:28:31,262 INFO L273 TraceCheckUtils]: 169: Hoare triple {30836#(<= bor_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30836#(<= bor_~i~0 4)} is VALID [2018-11-23 12:28:31,262 INFO L273 TraceCheckUtils]: 170: Hoare triple {30836#(<= bor_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30843#(<= bor_~i~0 5)} is VALID [2018-11-23 12:28:31,263 INFO L273 TraceCheckUtils]: 171: Hoare triple {30843#(<= bor_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30843#(<= bor_~i~0 5)} is VALID [2018-11-23 12:28:31,264 INFO L273 TraceCheckUtils]: 172: Hoare triple {30843#(<= bor_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30850#(<= bor_~i~0 6)} is VALID [2018-11-23 12:28:31,264 INFO L273 TraceCheckUtils]: 173: Hoare triple {30850#(<= bor_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30850#(<= bor_~i~0 6)} is VALID [2018-11-23 12:28:31,265 INFO L273 TraceCheckUtils]: 174: Hoare triple {30850#(<= bor_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30857#(<= bor_~i~0 7)} is VALID [2018-11-23 12:28:31,265 INFO L273 TraceCheckUtils]: 175: Hoare triple {30857#(<= bor_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30857#(<= bor_~i~0 7)} is VALID [2018-11-23 12:28:31,266 INFO L273 TraceCheckUtils]: 176: Hoare triple {30857#(<= bor_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30864#(<= bor_~i~0 8)} is VALID [2018-11-23 12:28:31,266 INFO L273 TraceCheckUtils]: 177: Hoare triple {30864#(<= bor_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30864#(<= bor_~i~0 8)} is VALID [2018-11-23 12:28:31,267 INFO L273 TraceCheckUtils]: 178: Hoare triple {30864#(<= bor_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30871#(<= bor_~i~0 9)} is VALID [2018-11-23 12:28:31,267 INFO L273 TraceCheckUtils]: 179: Hoare triple {30871#(<= bor_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30871#(<= bor_~i~0 9)} is VALID [2018-11-23 12:28:31,268 INFO L273 TraceCheckUtils]: 180: Hoare triple {30871#(<= bor_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30878#(<= bor_~i~0 10)} is VALID [2018-11-23 12:28:31,269 INFO L273 TraceCheckUtils]: 181: Hoare triple {30878#(<= bor_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30878#(<= bor_~i~0 10)} is VALID [2018-11-23 12:28:31,269 INFO L273 TraceCheckUtils]: 182: Hoare triple {30878#(<= bor_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30885#(<= bor_~i~0 11)} is VALID [2018-11-23 12:28:31,270 INFO L273 TraceCheckUtils]: 183: Hoare triple {30885#(<= bor_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {30885#(<= bor_~i~0 11)} is VALID [2018-11-23 12:28:31,270 INFO L273 TraceCheckUtils]: 184: Hoare triple {30885#(<= bor_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30892#(<= bor_~i~0 12)} is VALID [2018-11-23 12:28:31,271 INFO L273 TraceCheckUtils]: 185: Hoare triple {30892#(<= bor_~i~0 12)} assume !(~i~0 < 100000); {30288#false} is VALID [2018-11-23 12:28:31,271 INFO L273 TraceCheckUtils]: 186: Hoare triple {30288#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {30288#false} is VALID [2018-11-23 12:28:31,271 INFO L273 TraceCheckUtils]: 187: Hoare triple {30288#false} assume true; {30288#false} is VALID [2018-11-23 12:28:31,272 INFO L268 TraceCheckUtils]: 188: Hoare quadruple {30288#false} {30287#true} #74#return; {30288#false} is VALID [2018-11-23 12:28:31,272 INFO L273 TraceCheckUtils]: 189: Hoare triple {30288#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {30288#false} is VALID [2018-11-23 12:28:31,272 INFO L273 TraceCheckUtils]: 190: Hoare triple {30288#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {30288#false} is VALID [2018-11-23 12:28:31,272 INFO L273 TraceCheckUtils]: 191: Hoare triple {30288#false} assume !false; {30288#false} is VALID [2018-11-23 12:28:31,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2587 backedges. 536 proven. 121 refuted. 0 times theorem prover too weak. 1930 trivial. 0 not checked. [2018-11-23 12:28:31,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:31,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 14] total 51 [2018-11-23 12:28:31,307 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 192 [2018-11-23 12:28:31,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:31,308 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states. [2018-11-23 12:28:31,437 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:31,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-23 12:28:31,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-23 12:28:31,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=831, Invalid=1719, Unknown=0, NotChecked=0, Total=2550 [2018-11-23 12:28:31,440 INFO L87 Difference]: Start difference. First operand 139 states and 143 transitions. Second operand 51 states. [2018-11-23 12:28:32,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:32,878 INFO L93 Difference]: Finished difference Result 205 states and 217 transitions. [2018-11-23 12:28:32,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-23 12:28:32,879 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 192 [2018-11-23 12:28:32,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:32,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:28:32,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 154 transitions. [2018-11-23 12:28:32,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:28:32,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 154 transitions. [2018-11-23 12:28:32,882 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states and 154 transitions. [2018-11-23 12:28:33,038 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:33,041 INFO L225 Difference]: With dead ends: 205 [2018-11-23 12:28:33,041 INFO L226 Difference]: Without dead ends: 145 [2018-11-23 12:28:33,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=831, Invalid=1719, Unknown=0, NotChecked=0, Total=2550 [2018-11-23 12:28:33,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-11-23 12:28:33,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2018-11-23 12:28:33,127 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:33,127 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand 143 states. [2018-11-23 12:28:33,127 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand 143 states. [2018-11-23 12:28:33,127 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 143 states. [2018-11-23 12:28:33,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:33,130 INFO L93 Difference]: Finished difference Result 145 states and 149 transitions. [2018-11-23 12:28:33,131 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2018-11-23 12:28:33,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:33,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:33,131 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand 145 states. [2018-11-23 12:28:33,131 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 145 states. [2018-11-23 12:28:33,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:33,133 INFO L93 Difference]: Finished difference Result 145 states and 149 transitions. [2018-11-23 12:28:33,133 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2018-11-23 12:28:33,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:33,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:33,133 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:33,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:33,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-23 12:28:33,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 147 transitions. [2018-11-23 12:28:33,135 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 147 transitions. Word has length 192 [2018-11-23 12:28:33,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:33,136 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 147 transitions. [2018-11-23 12:28:33,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-23 12:28:33,136 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 147 transitions. [2018-11-23 12:28:33,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-11-23 12:28:33,136 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:33,137 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:28:33,137 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:33,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:33,137 INFO L82 PathProgramCache]: Analyzing trace with hash 2105744263, now seen corresponding path program 37 times [2018-11-23 12:28:33,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:33,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:33,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:33,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:33,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:33,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:34,029 INFO L256 TraceCheckUtils]: 0: Hoare triple {31721#true} call ULTIMATE.init(); {31721#true} is VALID [2018-11-23 12:28:34,030 INFO L273 TraceCheckUtils]: 1: Hoare triple {31721#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {31721#true} is VALID [2018-11-23 12:28:34,030 INFO L273 TraceCheckUtils]: 2: Hoare triple {31721#true} assume true; {31721#true} is VALID [2018-11-23 12:28:34,030 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31721#true} {31721#true} #66#return; {31721#true} is VALID [2018-11-23 12:28:34,031 INFO L256 TraceCheckUtils]: 4: Hoare triple {31721#true} call #t~ret13 := main(); {31721#true} is VALID [2018-11-23 12:28:34,033 INFO L273 TraceCheckUtils]: 5: Hoare triple {31721#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; {31723#(= main_~i~1 0)} is VALID [2018-11-23 12:28:34,034 INFO L273 TraceCheckUtils]: 6: Hoare triple {31723#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31723#(= main_~i~1 0)} is VALID [2018-11-23 12:28:34,034 INFO L273 TraceCheckUtils]: 7: Hoare triple {31723#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31724#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:34,035 INFO L273 TraceCheckUtils]: 8: Hoare triple {31724#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31724#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:34,035 INFO L273 TraceCheckUtils]: 9: Hoare triple {31724#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31725#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:34,035 INFO L273 TraceCheckUtils]: 10: Hoare triple {31725#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31725#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:34,036 INFO L273 TraceCheckUtils]: 11: Hoare triple {31725#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31726#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:34,036 INFO L273 TraceCheckUtils]: 12: Hoare triple {31726#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31726#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:34,036 INFO L273 TraceCheckUtils]: 13: Hoare triple {31726#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31727#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:34,037 INFO L273 TraceCheckUtils]: 14: Hoare triple {31727#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31727#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:34,037 INFO L273 TraceCheckUtils]: 15: Hoare triple {31727#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31728#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:34,038 INFO L273 TraceCheckUtils]: 16: Hoare triple {31728#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31728#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:34,039 INFO L273 TraceCheckUtils]: 17: Hoare triple {31728#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31729#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:34,039 INFO L273 TraceCheckUtils]: 18: Hoare triple {31729#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31729#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:34,040 INFO L273 TraceCheckUtils]: 19: Hoare triple {31729#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31730#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:34,040 INFO L273 TraceCheckUtils]: 20: Hoare triple {31730#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31730#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:34,041 INFO L273 TraceCheckUtils]: 21: Hoare triple {31730#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31731#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:34,042 INFO L273 TraceCheckUtils]: 22: Hoare triple {31731#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31731#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:34,042 INFO L273 TraceCheckUtils]: 23: Hoare triple {31731#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31732#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:34,043 INFO L273 TraceCheckUtils]: 24: Hoare triple {31732#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31732#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:34,044 INFO L273 TraceCheckUtils]: 25: Hoare triple {31732#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31733#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:34,044 INFO L273 TraceCheckUtils]: 26: Hoare triple {31733#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31733#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:34,045 INFO L273 TraceCheckUtils]: 27: Hoare triple {31733#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31734#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:34,045 INFO L273 TraceCheckUtils]: 28: Hoare triple {31734#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31734#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:34,046 INFO L273 TraceCheckUtils]: 29: Hoare triple {31734#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31735#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:34,047 INFO L273 TraceCheckUtils]: 30: Hoare triple {31735#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31735#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:34,047 INFO L273 TraceCheckUtils]: 31: Hoare triple {31735#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31736#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:34,048 INFO L273 TraceCheckUtils]: 32: Hoare triple {31736#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31736#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:34,048 INFO L273 TraceCheckUtils]: 33: Hoare triple {31736#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31737#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:34,049 INFO L273 TraceCheckUtils]: 34: Hoare triple {31737#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31737#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:34,050 INFO L273 TraceCheckUtils]: 35: Hoare triple {31737#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31738#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:34,050 INFO L273 TraceCheckUtils]: 36: Hoare triple {31738#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31738#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:34,051 INFO L273 TraceCheckUtils]: 37: Hoare triple {31738#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31739#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:34,051 INFO L273 TraceCheckUtils]: 38: Hoare triple {31739#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31739#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:34,052 INFO L273 TraceCheckUtils]: 39: Hoare triple {31739#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31740#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:34,053 INFO L273 TraceCheckUtils]: 40: Hoare triple {31740#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31740#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:34,053 INFO L273 TraceCheckUtils]: 41: Hoare triple {31740#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31741#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:34,054 INFO L273 TraceCheckUtils]: 42: Hoare triple {31741#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31741#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:34,055 INFO L273 TraceCheckUtils]: 43: Hoare triple {31741#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31742#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:34,055 INFO L273 TraceCheckUtils]: 44: Hoare triple {31742#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31742#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:34,056 INFO L273 TraceCheckUtils]: 45: Hoare triple {31742#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31743#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:34,056 INFO L273 TraceCheckUtils]: 46: Hoare triple {31743#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31743#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:34,057 INFO L273 TraceCheckUtils]: 47: Hoare triple {31743#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31744#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:34,058 INFO L273 TraceCheckUtils]: 48: Hoare triple {31744#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31744#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:34,058 INFO L273 TraceCheckUtils]: 49: Hoare triple {31744#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31745#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:34,059 INFO L273 TraceCheckUtils]: 50: Hoare triple {31745#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31745#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:34,060 INFO L273 TraceCheckUtils]: 51: Hoare triple {31745#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31746#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:34,060 INFO L273 TraceCheckUtils]: 52: Hoare triple {31746#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31746#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:34,061 INFO L273 TraceCheckUtils]: 53: Hoare triple {31746#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31747#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:34,061 INFO L273 TraceCheckUtils]: 54: Hoare triple {31747#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31747#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:34,062 INFO L273 TraceCheckUtils]: 55: Hoare triple {31747#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31748#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:34,063 INFO L273 TraceCheckUtils]: 56: Hoare triple {31748#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31748#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:34,063 INFO L273 TraceCheckUtils]: 57: Hoare triple {31748#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31749#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:34,064 INFO L273 TraceCheckUtils]: 58: Hoare triple {31749#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31749#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:34,065 INFO L273 TraceCheckUtils]: 59: Hoare triple {31749#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31750#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:34,065 INFO L273 TraceCheckUtils]: 60: Hoare triple {31750#(<= main_~i~1 27)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31750#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:34,066 INFO L273 TraceCheckUtils]: 61: Hoare triple {31750#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31751#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:34,066 INFO L273 TraceCheckUtils]: 62: Hoare triple {31751#(<= main_~i~1 28)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31751#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:34,067 INFO L273 TraceCheckUtils]: 63: Hoare triple {31751#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31752#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:34,067 INFO L273 TraceCheckUtils]: 64: Hoare triple {31752#(<= main_~i~1 29)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31752#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:34,068 INFO L273 TraceCheckUtils]: 65: Hoare triple {31752#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31753#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:34,069 INFO L273 TraceCheckUtils]: 66: Hoare triple {31753#(<= main_~i~1 30)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31753#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:34,069 INFO L273 TraceCheckUtils]: 67: Hoare triple {31753#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31754#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:34,070 INFO L273 TraceCheckUtils]: 68: Hoare triple {31754#(<= main_~i~1 31)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31754#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:34,071 INFO L273 TraceCheckUtils]: 69: Hoare triple {31754#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31755#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:34,071 INFO L273 TraceCheckUtils]: 70: Hoare triple {31755#(<= main_~i~1 32)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31755#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:34,072 INFO L273 TraceCheckUtils]: 71: Hoare triple {31755#(<= main_~i~1 32)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31756#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:34,072 INFO L273 TraceCheckUtils]: 72: Hoare triple {31756#(<= main_~i~1 33)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31756#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:34,073 INFO L273 TraceCheckUtils]: 73: Hoare triple {31756#(<= main_~i~1 33)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31757#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:34,074 INFO L273 TraceCheckUtils]: 74: Hoare triple {31757#(<= main_~i~1 34)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31757#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:34,074 INFO L273 TraceCheckUtils]: 75: Hoare triple {31757#(<= main_~i~1 34)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31758#(<= main_~i~1 35)} is VALID [2018-11-23 12:28:34,075 INFO L273 TraceCheckUtils]: 76: Hoare triple {31758#(<= main_~i~1 35)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31758#(<= main_~i~1 35)} is VALID [2018-11-23 12:28:34,076 INFO L273 TraceCheckUtils]: 77: Hoare triple {31758#(<= main_~i~1 35)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31759#(<= main_~i~1 36)} is VALID [2018-11-23 12:28:34,076 INFO L273 TraceCheckUtils]: 78: Hoare triple {31759#(<= main_~i~1 36)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31759#(<= main_~i~1 36)} is VALID [2018-11-23 12:28:34,077 INFO L273 TraceCheckUtils]: 79: Hoare triple {31759#(<= main_~i~1 36)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31760#(<= main_~i~1 37)} is VALID [2018-11-23 12:28:34,078 INFO L273 TraceCheckUtils]: 80: Hoare triple {31760#(<= main_~i~1 37)} assume !(~i~1 < 100000); {31722#false} is VALID [2018-11-23 12:28:34,078 INFO L256 TraceCheckUtils]: 81: Hoare triple {31722#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {31721#true} is VALID [2018-11-23 12:28:34,078 INFO L273 TraceCheckUtils]: 82: Hoare triple {31721#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {31721#true} is VALID [2018-11-23 12:28:34,078 INFO L273 TraceCheckUtils]: 83: Hoare triple {31721#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:34,078 INFO L273 TraceCheckUtils]: 84: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:34,079 INFO L273 TraceCheckUtils]: 85: Hoare triple {31721#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:34,079 INFO L273 TraceCheckUtils]: 86: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:34,079 INFO L273 TraceCheckUtils]: 87: Hoare triple {31721#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:34,079 INFO L273 TraceCheckUtils]: 88: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:34,079 INFO L273 TraceCheckUtils]: 89: Hoare triple {31721#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:34,079 INFO L273 TraceCheckUtils]: 90: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:34,080 INFO L273 TraceCheckUtils]: 91: Hoare triple {31721#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:34,080 INFO L273 TraceCheckUtils]: 92: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:34,080 INFO L273 TraceCheckUtils]: 93: Hoare triple {31721#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:34,080 INFO L273 TraceCheckUtils]: 94: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:34,080 INFO L273 TraceCheckUtils]: 95: Hoare triple {31721#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:34,080 INFO L273 TraceCheckUtils]: 96: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:34,081 INFO L273 TraceCheckUtils]: 97: Hoare triple {31721#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:34,081 INFO L273 TraceCheckUtils]: 98: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:34,081 INFO L273 TraceCheckUtils]: 99: Hoare triple {31721#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:34,081 INFO L273 TraceCheckUtils]: 100: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:34,081 INFO L273 TraceCheckUtils]: 101: Hoare triple {31721#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:34,081 INFO L273 TraceCheckUtils]: 102: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:34,081 INFO L273 TraceCheckUtils]: 103: Hoare triple {31721#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:34,082 INFO L273 TraceCheckUtils]: 104: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:34,082 INFO L273 TraceCheckUtils]: 105: Hoare triple {31721#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:34,082 INFO L273 TraceCheckUtils]: 106: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:34,082 INFO L273 TraceCheckUtils]: 107: Hoare triple {31721#true} assume !(~i~0 < 100000); {31721#true} is VALID [2018-11-23 12:28:34,082 INFO L273 TraceCheckUtils]: 108: Hoare triple {31721#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {31721#true} is VALID [2018-11-23 12:28:34,082 INFO L273 TraceCheckUtils]: 109: Hoare triple {31721#true} assume true; {31721#true} is VALID [2018-11-23 12:28:34,082 INFO L268 TraceCheckUtils]: 110: Hoare quadruple {31721#true} {31722#false} #70#return; {31722#false} is VALID [2018-11-23 12:28:34,082 INFO L273 TraceCheckUtils]: 111: Hoare triple {31722#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {31722#false} is VALID [2018-11-23 12:28:34,082 INFO L256 TraceCheckUtils]: 112: Hoare triple {31722#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {31721#true} is VALID [2018-11-23 12:28:34,082 INFO L273 TraceCheckUtils]: 113: Hoare triple {31721#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {31721#true} is VALID [2018-11-23 12:28:34,083 INFO L273 TraceCheckUtils]: 114: Hoare triple {31721#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:34,083 INFO L273 TraceCheckUtils]: 115: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:34,083 INFO L273 TraceCheckUtils]: 116: Hoare triple {31721#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:34,083 INFO L273 TraceCheckUtils]: 117: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:34,083 INFO L273 TraceCheckUtils]: 118: Hoare triple {31721#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:34,083 INFO L273 TraceCheckUtils]: 119: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:34,083 INFO L273 TraceCheckUtils]: 120: Hoare triple {31721#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:34,083 INFO L273 TraceCheckUtils]: 121: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:34,083 INFO L273 TraceCheckUtils]: 122: Hoare triple {31721#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:34,083 INFO L273 TraceCheckUtils]: 123: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:34,084 INFO L273 TraceCheckUtils]: 124: Hoare triple {31721#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:34,084 INFO L273 TraceCheckUtils]: 125: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:34,084 INFO L273 TraceCheckUtils]: 126: Hoare triple {31721#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:34,084 INFO L273 TraceCheckUtils]: 127: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:34,084 INFO L273 TraceCheckUtils]: 128: Hoare triple {31721#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:34,084 INFO L273 TraceCheckUtils]: 129: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:34,084 INFO L273 TraceCheckUtils]: 130: Hoare triple {31721#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:34,084 INFO L273 TraceCheckUtils]: 131: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:34,084 INFO L273 TraceCheckUtils]: 132: Hoare triple {31721#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:34,085 INFO L273 TraceCheckUtils]: 133: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:34,085 INFO L273 TraceCheckUtils]: 134: Hoare triple {31721#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:34,085 INFO L273 TraceCheckUtils]: 135: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:34,085 INFO L273 TraceCheckUtils]: 136: Hoare triple {31721#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:34,085 INFO L273 TraceCheckUtils]: 137: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:34,085 INFO L273 TraceCheckUtils]: 138: Hoare triple {31721#true} assume !(~i~0 < 100000); {31721#true} is VALID [2018-11-23 12:28:34,085 INFO L273 TraceCheckUtils]: 139: Hoare triple {31721#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {31721#true} is VALID [2018-11-23 12:28:34,085 INFO L273 TraceCheckUtils]: 140: Hoare triple {31721#true} assume true; {31721#true} is VALID [2018-11-23 12:28:34,085 INFO L268 TraceCheckUtils]: 141: Hoare quadruple {31721#true} {31722#false} #72#return; {31722#false} is VALID [2018-11-23 12:28:34,085 INFO L273 TraceCheckUtils]: 142: Hoare triple {31722#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {31722#false} is VALID [2018-11-23 12:28:34,086 INFO L273 TraceCheckUtils]: 143: Hoare triple {31722#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31722#false} is VALID [2018-11-23 12:28:34,086 INFO L273 TraceCheckUtils]: 144: Hoare triple {31722#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31722#false} is VALID [2018-11-23 12:28:34,086 INFO L273 TraceCheckUtils]: 145: Hoare triple {31722#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31722#false} is VALID [2018-11-23 12:28:34,086 INFO L273 TraceCheckUtils]: 146: Hoare triple {31722#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31722#false} is VALID [2018-11-23 12:28:34,086 INFO L273 TraceCheckUtils]: 147: Hoare triple {31722#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31722#false} is VALID [2018-11-23 12:28:34,086 INFO L273 TraceCheckUtils]: 148: Hoare triple {31722#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31722#false} is VALID [2018-11-23 12:28:34,086 INFO L273 TraceCheckUtils]: 149: Hoare triple {31722#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31722#false} is VALID [2018-11-23 12:28:34,086 INFO L273 TraceCheckUtils]: 150: Hoare triple {31722#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31722#false} is VALID [2018-11-23 12:28:34,086 INFO L273 TraceCheckUtils]: 151: Hoare triple {31722#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31722#false} is VALID [2018-11-23 12:28:34,086 INFO L273 TraceCheckUtils]: 152: Hoare triple {31722#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31722#false} is VALID [2018-11-23 12:28:34,087 INFO L273 TraceCheckUtils]: 153: Hoare triple {31722#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31722#false} is VALID [2018-11-23 12:28:34,087 INFO L273 TraceCheckUtils]: 154: Hoare triple {31722#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31722#false} is VALID [2018-11-23 12:28:34,087 INFO L273 TraceCheckUtils]: 155: Hoare triple {31722#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31722#false} is VALID [2018-11-23 12:28:34,087 INFO L273 TraceCheckUtils]: 156: Hoare triple {31722#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31722#false} is VALID [2018-11-23 12:28:34,087 INFO L273 TraceCheckUtils]: 157: Hoare triple {31722#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31722#false} is VALID [2018-11-23 12:28:34,087 INFO L273 TraceCheckUtils]: 158: Hoare triple {31722#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31722#false} is VALID [2018-11-23 12:28:34,087 INFO L273 TraceCheckUtils]: 159: Hoare triple {31722#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31722#false} is VALID [2018-11-23 12:28:34,087 INFO L273 TraceCheckUtils]: 160: Hoare triple {31722#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31722#false} is VALID [2018-11-23 12:28:34,087 INFO L273 TraceCheckUtils]: 161: Hoare triple {31722#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31722#false} is VALID [2018-11-23 12:28:34,087 INFO L273 TraceCheckUtils]: 162: Hoare triple {31722#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31722#false} is VALID [2018-11-23 12:28:34,088 INFO L273 TraceCheckUtils]: 163: Hoare triple {31722#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31722#false} is VALID [2018-11-23 12:28:34,088 INFO L273 TraceCheckUtils]: 164: Hoare triple {31722#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31722#false} is VALID [2018-11-23 12:28:34,088 INFO L273 TraceCheckUtils]: 165: Hoare triple {31722#false} assume !(~i~2 < 99999); {31722#false} is VALID [2018-11-23 12:28:34,088 INFO L273 TraceCheckUtils]: 166: Hoare triple {31722#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {31722#false} is VALID [2018-11-23 12:28:34,088 INFO L256 TraceCheckUtils]: 167: Hoare triple {31722#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {31721#true} is VALID [2018-11-23 12:28:34,088 INFO L273 TraceCheckUtils]: 168: Hoare triple {31721#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {31721#true} is VALID [2018-11-23 12:28:34,088 INFO L273 TraceCheckUtils]: 169: Hoare triple {31721#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:34,088 INFO L273 TraceCheckUtils]: 170: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:34,088 INFO L273 TraceCheckUtils]: 171: Hoare triple {31721#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:34,088 INFO L273 TraceCheckUtils]: 172: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:34,089 INFO L273 TraceCheckUtils]: 173: Hoare triple {31721#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:34,089 INFO L273 TraceCheckUtils]: 174: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:34,089 INFO L273 TraceCheckUtils]: 175: Hoare triple {31721#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:34,089 INFO L273 TraceCheckUtils]: 176: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:34,089 INFO L273 TraceCheckUtils]: 177: Hoare triple {31721#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:34,089 INFO L273 TraceCheckUtils]: 178: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:34,089 INFO L273 TraceCheckUtils]: 179: Hoare triple {31721#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:34,089 INFO L273 TraceCheckUtils]: 180: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:34,089 INFO L273 TraceCheckUtils]: 181: Hoare triple {31721#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:34,090 INFO L273 TraceCheckUtils]: 182: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:34,090 INFO L273 TraceCheckUtils]: 183: Hoare triple {31721#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:34,090 INFO L273 TraceCheckUtils]: 184: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:34,090 INFO L273 TraceCheckUtils]: 185: Hoare triple {31721#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:34,090 INFO L273 TraceCheckUtils]: 186: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:34,090 INFO L273 TraceCheckUtils]: 187: Hoare triple {31721#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:34,090 INFO L273 TraceCheckUtils]: 188: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:34,090 INFO L273 TraceCheckUtils]: 189: Hoare triple {31721#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:34,090 INFO L273 TraceCheckUtils]: 190: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:34,090 INFO L273 TraceCheckUtils]: 191: Hoare triple {31721#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:28:34,091 INFO L273 TraceCheckUtils]: 192: Hoare triple {31721#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31721#true} is VALID [2018-11-23 12:28:34,091 INFO L273 TraceCheckUtils]: 193: Hoare triple {31721#true} assume !(~i~0 < 100000); {31721#true} is VALID [2018-11-23 12:28:34,091 INFO L273 TraceCheckUtils]: 194: Hoare triple {31721#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {31721#true} is VALID [2018-11-23 12:28:34,091 INFO L273 TraceCheckUtils]: 195: Hoare triple {31721#true} assume true; {31721#true} is VALID [2018-11-23 12:28:34,091 INFO L268 TraceCheckUtils]: 196: Hoare quadruple {31721#true} {31722#false} #74#return; {31722#false} is VALID [2018-11-23 12:28:34,091 INFO L273 TraceCheckUtils]: 197: Hoare triple {31722#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {31722#false} is VALID [2018-11-23 12:28:34,091 INFO L273 TraceCheckUtils]: 198: Hoare triple {31722#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {31722#false} is VALID [2018-11-23 12:28:34,091 INFO L273 TraceCheckUtils]: 199: Hoare triple {31722#false} assume !false; {31722#false} is VALID [2018-11-23 12:28:34,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2018-11-23 12:28:34,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:34,109 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:28:34,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:28:34,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:34,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:34,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:34,828 INFO L256 TraceCheckUtils]: 0: Hoare triple {31721#true} call ULTIMATE.init(); {31721#true} is VALID [2018-11-23 12:28:34,828 INFO L273 TraceCheckUtils]: 1: Hoare triple {31721#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {31721#true} is VALID [2018-11-23 12:28:34,828 INFO L273 TraceCheckUtils]: 2: Hoare triple {31721#true} assume true; {31721#true} is VALID [2018-11-23 12:28:34,828 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31721#true} {31721#true} #66#return; {31721#true} is VALID [2018-11-23 12:28:34,829 INFO L256 TraceCheckUtils]: 4: Hoare triple {31721#true} call #t~ret13 := main(); {31721#true} is VALID [2018-11-23 12:28:34,829 INFO L273 TraceCheckUtils]: 5: Hoare triple {31721#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; {31779#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:34,830 INFO L273 TraceCheckUtils]: 6: Hoare triple {31779#(<= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31779#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:34,831 INFO L273 TraceCheckUtils]: 7: Hoare triple {31779#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31724#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:34,831 INFO L273 TraceCheckUtils]: 8: Hoare triple {31724#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31724#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:34,832 INFO L273 TraceCheckUtils]: 9: Hoare triple {31724#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31725#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:34,832 INFO L273 TraceCheckUtils]: 10: Hoare triple {31725#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31725#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:34,833 INFO L273 TraceCheckUtils]: 11: Hoare triple {31725#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31726#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:34,834 INFO L273 TraceCheckUtils]: 12: Hoare triple {31726#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31726#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:34,834 INFO L273 TraceCheckUtils]: 13: Hoare triple {31726#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31727#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:34,835 INFO L273 TraceCheckUtils]: 14: Hoare triple {31727#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31727#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:34,836 INFO L273 TraceCheckUtils]: 15: Hoare triple {31727#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31728#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:34,836 INFO L273 TraceCheckUtils]: 16: Hoare triple {31728#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31728#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:34,837 INFO L273 TraceCheckUtils]: 17: Hoare triple {31728#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31729#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:34,837 INFO L273 TraceCheckUtils]: 18: Hoare triple {31729#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31729#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:34,838 INFO L273 TraceCheckUtils]: 19: Hoare triple {31729#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31730#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:34,839 INFO L273 TraceCheckUtils]: 20: Hoare triple {31730#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31730#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:34,839 INFO L273 TraceCheckUtils]: 21: Hoare triple {31730#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31731#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:34,840 INFO L273 TraceCheckUtils]: 22: Hoare triple {31731#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31731#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:34,841 INFO L273 TraceCheckUtils]: 23: Hoare triple {31731#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31732#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:34,841 INFO L273 TraceCheckUtils]: 24: Hoare triple {31732#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31732#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:34,842 INFO L273 TraceCheckUtils]: 25: Hoare triple {31732#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31733#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:34,842 INFO L273 TraceCheckUtils]: 26: Hoare triple {31733#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31733#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:34,843 INFO L273 TraceCheckUtils]: 27: Hoare triple {31733#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31734#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:34,844 INFO L273 TraceCheckUtils]: 28: Hoare triple {31734#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31734#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:34,844 INFO L273 TraceCheckUtils]: 29: Hoare triple {31734#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31735#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:34,845 INFO L273 TraceCheckUtils]: 30: Hoare triple {31735#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31735#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:34,846 INFO L273 TraceCheckUtils]: 31: Hoare triple {31735#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31736#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:34,846 INFO L273 TraceCheckUtils]: 32: Hoare triple {31736#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31736#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:34,847 INFO L273 TraceCheckUtils]: 33: Hoare triple {31736#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31737#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:34,847 INFO L273 TraceCheckUtils]: 34: Hoare triple {31737#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31737#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:34,848 INFO L273 TraceCheckUtils]: 35: Hoare triple {31737#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31738#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:34,849 INFO L273 TraceCheckUtils]: 36: Hoare triple {31738#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31738#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:34,849 INFO L273 TraceCheckUtils]: 37: Hoare triple {31738#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31739#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:34,850 INFO L273 TraceCheckUtils]: 38: Hoare triple {31739#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31739#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:34,850 INFO L273 TraceCheckUtils]: 39: Hoare triple {31739#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31740#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:34,851 INFO L273 TraceCheckUtils]: 40: Hoare triple {31740#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31740#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:34,852 INFO L273 TraceCheckUtils]: 41: Hoare triple {31740#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31741#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:34,852 INFO L273 TraceCheckUtils]: 42: Hoare triple {31741#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31741#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:34,853 INFO L273 TraceCheckUtils]: 43: Hoare triple {31741#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31742#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:34,853 INFO L273 TraceCheckUtils]: 44: Hoare triple {31742#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31742#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:34,854 INFO L273 TraceCheckUtils]: 45: Hoare triple {31742#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31743#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:34,855 INFO L273 TraceCheckUtils]: 46: Hoare triple {31743#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31743#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:34,855 INFO L273 TraceCheckUtils]: 47: Hoare triple {31743#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31744#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:34,856 INFO L273 TraceCheckUtils]: 48: Hoare triple {31744#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31744#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:34,857 INFO L273 TraceCheckUtils]: 49: Hoare triple {31744#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31745#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:34,857 INFO L273 TraceCheckUtils]: 50: Hoare triple {31745#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31745#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:34,858 INFO L273 TraceCheckUtils]: 51: Hoare triple {31745#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31746#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:34,858 INFO L273 TraceCheckUtils]: 52: Hoare triple {31746#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31746#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:34,859 INFO L273 TraceCheckUtils]: 53: Hoare triple {31746#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31747#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:34,860 INFO L273 TraceCheckUtils]: 54: Hoare triple {31747#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31747#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:34,860 INFO L273 TraceCheckUtils]: 55: Hoare triple {31747#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31748#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:34,861 INFO L273 TraceCheckUtils]: 56: Hoare triple {31748#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31748#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:34,862 INFO L273 TraceCheckUtils]: 57: Hoare triple {31748#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31749#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:34,862 INFO L273 TraceCheckUtils]: 58: Hoare triple {31749#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31749#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:34,863 INFO L273 TraceCheckUtils]: 59: Hoare triple {31749#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31750#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:34,863 INFO L273 TraceCheckUtils]: 60: Hoare triple {31750#(<= main_~i~1 27)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31750#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:34,864 INFO L273 TraceCheckUtils]: 61: Hoare triple {31750#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31751#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:34,865 INFO L273 TraceCheckUtils]: 62: Hoare triple {31751#(<= main_~i~1 28)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31751#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:34,865 INFO L273 TraceCheckUtils]: 63: Hoare triple {31751#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31752#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:34,866 INFO L273 TraceCheckUtils]: 64: Hoare triple {31752#(<= main_~i~1 29)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31752#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:34,867 INFO L273 TraceCheckUtils]: 65: Hoare triple {31752#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31753#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:34,867 INFO L273 TraceCheckUtils]: 66: Hoare triple {31753#(<= main_~i~1 30)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31753#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:34,868 INFO L273 TraceCheckUtils]: 67: Hoare triple {31753#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31754#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:34,868 INFO L273 TraceCheckUtils]: 68: Hoare triple {31754#(<= main_~i~1 31)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31754#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:34,869 INFO L273 TraceCheckUtils]: 69: Hoare triple {31754#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31755#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:34,870 INFO L273 TraceCheckUtils]: 70: Hoare triple {31755#(<= main_~i~1 32)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31755#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:34,870 INFO L273 TraceCheckUtils]: 71: Hoare triple {31755#(<= main_~i~1 32)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31756#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:34,871 INFO L273 TraceCheckUtils]: 72: Hoare triple {31756#(<= main_~i~1 33)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31756#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:34,872 INFO L273 TraceCheckUtils]: 73: Hoare triple {31756#(<= main_~i~1 33)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31757#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:34,872 INFO L273 TraceCheckUtils]: 74: Hoare triple {31757#(<= main_~i~1 34)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31757#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:34,873 INFO L273 TraceCheckUtils]: 75: Hoare triple {31757#(<= main_~i~1 34)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31758#(<= main_~i~1 35)} is VALID [2018-11-23 12:28:34,873 INFO L273 TraceCheckUtils]: 76: Hoare triple {31758#(<= main_~i~1 35)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31758#(<= main_~i~1 35)} is VALID [2018-11-23 12:28:34,874 INFO L273 TraceCheckUtils]: 77: Hoare triple {31758#(<= main_~i~1 35)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31759#(<= main_~i~1 36)} is VALID [2018-11-23 12:28:34,875 INFO L273 TraceCheckUtils]: 78: Hoare triple {31759#(<= main_~i~1 36)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {31759#(<= main_~i~1 36)} is VALID [2018-11-23 12:28:34,875 INFO L273 TraceCheckUtils]: 79: Hoare triple {31759#(<= main_~i~1 36)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {31760#(<= main_~i~1 37)} is VALID [2018-11-23 12:28:34,876 INFO L273 TraceCheckUtils]: 80: Hoare triple {31760#(<= main_~i~1 37)} assume !(~i~1 < 100000); {31722#false} is VALID [2018-11-23 12:28:34,876 INFO L256 TraceCheckUtils]: 81: Hoare triple {31722#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {31722#false} is VALID [2018-11-23 12:28:34,876 INFO L273 TraceCheckUtils]: 82: Hoare triple {31722#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {31722#false} is VALID [2018-11-23 12:28:34,877 INFO L273 TraceCheckUtils]: 83: Hoare triple {31722#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:34,877 INFO L273 TraceCheckUtils]: 84: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:34,877 INFO L273 TraceCheckUtils]: 85: Hoare triple {31722#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:34,877 INFO L273 TraceCheckUtils]: 86: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:34,877 INFO L273 TraceCheckUtils]: 87: Hoare triple {31722#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:34,878 INFO L273 TraceCheckUtils]: 88: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:34,878 INFO L273 TraceCheckUtils]: 89: Hoare triple {31722#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:34,878 INFO L273 TraceCheckUtils]: 90: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:34,878 INFO L273 TraceCheckUtils]: 91: Hoare triple {31722#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:34,878 INFO L273 TraceCheckUtils]: 92: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:34,878 INFO L273 TraceCheckUtils]: 93: Hoare triple {31722#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:34,879 INFO L273 TraceCheckUtils]: 94: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:34,879 INFO L273 TraceCheckUtils]: 95: Hoare triple {31722#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:34,879 INFO L273 TraceCheckUtils]: 96: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:34,879 INFO L273 TraceCheckUtils]: 97: Hoare triple {31722#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:34,879 INFO L273 TraceCheckUtils]: 98: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:34,879 INFO L273 TraceCheckUtils]: 99: Hoare triple {31722#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:34,879 INFO L273 TraceCheckUtils]: 100: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:34,879 INFO L273 TraceCheckUtils]: 101: Hoare triple {31722#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:34,879 INFO L273 TraceCheckUtils]: 102: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:34,880 INFO L273 TraceCheckUtils]: 103: Hoare triple {31722#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:34,880 INFO L273 TraceCheckUtils]: 104: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:34,880 INFO L273 TraceCheckUtils]: 105: Hoare triple {31722#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:34,880 INFO L273 TraceCheckUtils]: 106: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:34,880 INFO L273 TraceCheckUtils]: 107: Hoare triple {31722#false} assume !(~i~0 < 100000); {31722#false} is VALID [2018-11-23 12:28:34,880 INFO L273 TraceCheckUtils]: 108: Hoare triple {31722#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {31722#false} is VALID [2018-11-23 12:28:34,880 INFO L273 TraceCheckUtils]: 109: Hoare triple {31722#false} assume true; {31722#false} is VALID [2018-11-23 12:28:34,880 INFO L268 TraceCheckUtils]: 110: Hoare quadruple {31722#false} {31722#false} #70#return; {31722#false} is VALID [2018-11-23 12:28:34,880 INFO L273 TraceCheckUtils]: 111: Hoare triple {31722#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {31722#false} is VALID [2018-11-23 12:28:34,880 INFO L256 TraceCheckUtils]: 112: Hoare triple {31722#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {31722#false} is VALID [2018-11-23 12:28:34,881 INFO L273 TraceCheckUtils]: 113: Hoare triple {31722#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {31722#false} is VALID [2018-11-23 12:28:34,881 INFO L273 TraceCheckUtils]: 114: Hoare triple {31722#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:34,881 INFO L273 TraceCheckUtils]: 115: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:34,881 INFO L273 TraceCheckUtils]: 116: Hoare triple {31722#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:34,881 INFO L273 TraceCheckUtils]: 117: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:34,881 INFO L273 TraceCheckUtils]: 118: Hoare triple {31722#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:34,881 INFO L273 TraceCheckUtils]: 119: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:34,881 INFO L273 TraceCheckUtils]: 120: Hoare triple {31722#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:34,881 INFO L273 TraceCheckUtils]: 121: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:34,882 INFO L273 TraceCheckUtils]: 122: Hoare triple {31722#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:34,882 INFO L273 TraceCheckUtils]: 123: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:34,882 INFO L273 TraceCheckUtils]: 124: Hoare triple {31722#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:34,882 INFO L273 TraceCheckUtils]: 125: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:34,882 INFO L273 TraceCheckUtils]: 126: Hoare triple {31722#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:34,882 INFO L273 TraceCheckUtils]: 127: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:34,882 INFO L273 TraceCheckUtils]: 128: Hoare triple {31722#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:34,882 INFO L273 TraceCheckUtils]: 129: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:34,882 INFO L273 TraceCheckUtils]: 130: Hoare triple {31722#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:34,882 INFO L273 TraceCheckUtils]: 131: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:34,883 INFO L273 TraceCheckUtils]: 132: Hoare triple {31722#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:34,883 INFO L273 TraceCheckUtils]: 133: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:34,883 INFO L273 TraceCheckUtils]: 134: Hoare triple {31722#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:34,883 INFO L273 TraceCheckUtils]: 135: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:34,883 INFO L273 TraceCheckUtils]: 136: Hoare triple {31722#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:34,883 INFO L273 TraceCheckUtils]: 137: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:34,883 INFO L273 TraceCheckUtils]: 138: Hoare triple {31722#false} assume !(~i~0 < 100000); {31722#false} is VALID [2018-11-23 12:28:34,883 INFO L273 TraceCheckUtils]: 139: Hoare triple {31722#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {31722#false} is VALID [2018-11-23 12:28:34,883 INFO L273 TraceCheckUtils]: 140: Hoare triple {31722#false} assume true; {31722#false} is VALID [2018-11-23 12:28:34,883 INFO L268 TraceCheckUtils]: 141: Hoare quadruple {31722#false} {31722#false} #72#return; {31722#false} is VALID [2018-11-23 12:28:34,884 INFO L273 TraceCheckUtils]: 142: Hoare triple {31722#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {31722#false} is VALID [2018-11-23 12:28:34,884 INFO L273 TraceCheckUtils]: 143: Hoare triple {31722#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31722#false} is VALID [2018-11-23 12:28:34,884 INFO L273 TraceCheckUtils]: 144: Hoare triple {31722#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31722#false} is VALID [2018-11-23 12:28:34,884 INFO L273 TraceCheckUtils]: 145: Hoare triple {31722#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31722#false} is VALID [2018-11-23 12:28:34,884 INFO L273 TraceCheckUtils]: 146: Hoare triple {31722#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31722#false} is VALID [2018-11-23 12:28:34,884 INFO L273 TraceCheckUtils]: 147: Hoare triple {31722#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31722#false} is VALID [2018-11-23 12:28:34,884 INFO L273 TraceCheckUtils]: 148: Hoare triple {31722#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31722#false} is VALID [2018-11-23 12:28:34,884 INFO L273 TraceCheckUtils]: 149: Hoare triple {31722#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31722#false} is VALID [2018-11-23 12:28:34,884 INFO L273 TraceCheckUtils]: 150: Hoare triple {31722#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31722#false} is VALID [2018-11-23 12:28:34,884 INFO L273 TraceCheckUtils]: 151: Hoare triple {31722#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31722#false} is VALID [2018-11-23 12:28:34,885 INFO L273 TraceCheckUtils]: 152: Hoare triple {31722#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31722#false} is VALID [2018-11-23 12:28:34,885 INFO L273 TraceCheckUtils]: 153: Hoare triple {31722#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31722#false} is VALID [2018-11-23 12:28:34,885 INFO L273 TraceCheckUtils]: 154: Hoare triple {31722#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31722#false} is VALID [2018-11-23 12:28:34,885 INFO L273 TraceCheckUtils]: 155: Hoare triple {31722#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31722#false} is VALID [2018-11-23 12:28:34,885 INFO L273 TraceCheckUtils]: 156: Hoare triple {31722#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31722#false} is VALID [2018-11-23 12:28:34,885 INFO L273 TraceCheckUtils]: 157: Hoare triple {31722#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31722#false} is VALID [2018-11-23 12:28:34,885 INFO L273 TraceCheckUtils]: 158: Hoare triple {31722#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31722#false} is VALID [2018-11-23 12:28:34,885 INFO L273 TraceCheckUtils]: 159: Hoare triple {31722#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31722#false} is VALID [2018-11-23 12:28:34,885 INFO L273 TraceCheckUtils]: 160: Hoare triple {31722#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31722#false} is VALID [2018-11-23 12:28:34,885 INFO L273 TraceCheckUtils]: 161: Hoare triple {31722#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31722#false} is VALID [2018-11-23 12:28:34,886 INFO L273 TraceCheckUtils]: 162: Hoare triple {31722#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31722#false} is VALID [2018-11-23 12:28:34,886 INFO L273 TraceCheckUtils]: 163: Hoare triple {31722#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {31722#false} is VALID [2018-11-23 12:28:34,886 INFO L273 TraceCheckUtils]: 164: Hoare triple {31722#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {31722#false} is VALID [2018-11-23 12:28:34,886 INFO L273 TraceCheckUtils]: 165: Hoare triple {31722#false} assume !(~i~2 < 99999); {31722#false} is VALID [2018-11-23 12:28:34,886 INFO L273 TraceCheckUtils]: 166: Hoare triple {31722#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {31722#false} is VALID [2018-11-23 12:28:34,886 INFO L256 TraceCheckUtils]: 167: Hoare triple {31722#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {31722#false} is VALID [2018-11-23 12:28:34,886 INFO L273 TraceCheckUtils]: 168: Hoare triple {31722#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {31722#false} is VALID [2018-11-23 12:28:34,886 INFO L273 TraceCheckUtils]: 169: Hoare triple {31722#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:34,886 INFO L273 TraceCheckUtils]: 170: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:34,886 INFO L273 TraceCheckUtils]: 171: Hoare triple {31722#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:34,887 INFO L273 TraceCheckUtils]: 172: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:34,887 INFO L273 TraceCheckUtils]: 173: Hoare triple {31722#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:34,887 INFO L273 TraceCheckUtils]: 174: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:34,887 INFO L273 TraceCheckUtils]: 175: Hoare triple {31722#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:34,887 INFO L273 TraceCheckUtils]: 176: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:34,887 INFO L273 TraceCheckUtils]: 177: Hoare triple {31722#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:34,887 INFO L273 TraceCheckUtils]: 178: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:34,887 INFO L273 TraceCheckUtils]: 179: Hoare triple {31722#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:34,887 INFO L273 TraceCheckUtils]: 180: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:34,887 INFO L273 TraceCheckUtils]: 181: Hoare triple {31722#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:34,888 INFO L273 TraceCheckUtils]: 182: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:34,888 INFO L273 TraceCheckUtils]: 183: Hoare triple {31722#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:34,888 INFO L273 TraceCheckUtils]: 184: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:34,888 INFO L273 TraceCheckUtils]: 185: Hoare triple {31722#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:34,888 INFO L273 TraceCheckUtils]: 186: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:34,888 INFO L273 TraceCheckUtils]: 187: Hoare triple {31722#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:34,888 INFO L273 TraceCheckUtils]: 188: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:34,888 INFO L273 TraceCheckUtils]: 189: Hoare triple {31722#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:34,888 INFO L273 TraceCheckUtils]: 190: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:34,888 INFO L273 TraceCheckUtils]: 191: Hoare triple {31722#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:28:34,889 INFO L273 TraceCheckUtils]: 192: Hoare triple {31722#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31722#false} is VALID [2018-11-23 12:28:34,889 INFO L273 TraceCheckUtils]: 193: Hoare triple {31722#false} assume !(~i~0 < 100000); {31722#false} is VALID [2018-11-23 12:28:34,889 INFO L273 TraceCheckUtils]: 194: Hoare triple {31722#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {31722#false} is VALID [2018-11-23 12:28:34,889 INFO L273 TraceCheckUtils]: 195: Hoare triple {31722#false} assume true; {31722#false} is VALID [2018-11-23 12:28:34,889 INFO L268 TraceCheckUtils]: 196: Hoare quadruple {31722#false} {31722#false} #74#return; {31722#false} is VALID [2018-11-23 12:28:34,889 INFO L273 TraceCheckUtils]: 197: Hoare triple {31722#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {31722#false} is VALID [2018-11-23 12:28:34,889 INFO L273 TraceCheckUtils]: 198: Hoare triple {31722#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {31722#false} is VALID [2018-11-23 12:28:34,889 INFO L273 TraceCheckUtils]: 199: Hoare triple {31722#false} assume !false; {31722#false} is VALID [2018-11-23 12:28:34,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2018-11-23 12:28:34,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:34,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2018-11-23 12:28:34,926 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 200 [2018-11-23 12:28:34,927 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:34,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states. [2018-11-23 12:28:35,042 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:35,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-23 12:28:35,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-23 12:28:35,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 12:28:35,044 INFO L87 Difference]: Start difference. First operand 143 states and 147 transitions. Second operand 41 states. [2018-11-23 12:28:35,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:35,693 INFO L93 Difference]: Finished difference Result 208 states and 216 transitions. [2018-11-23 12:28:35,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-23 12:28:35,693 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 200 [2018-11-23 12:28:35,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:35,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:28:35,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 128 transitions. [2018-11-23 12:28:35,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:28:35,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 128 transitions. [2018-11-23 12:28:35,695 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 128 transitions. [2018-11-23 12:28:35,831 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:35,834 INFO L225 Difference]: With dead ends: 208 [2018-11-23 12:28:35,834 INFO L226 Difference]: Without dead ends: 146 [2018-11-23 12:28:35,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 12:28:35,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-23 12:28:35,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2018-11-23 12:28:35,924 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:35,925 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand 145 states. [2018-11-23 12:28:35,925 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 145 states. [2018-11-23 12:28:35,925 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 145 states. [2018-11-23 12:28:35,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:35,927 INFO L93 Difference]: Finished difference Result 146 states and 150 transitions. [2018-11-23 12:28:35,927 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 150 transitions. [2018-11-23 12:28:35,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:35,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:35,927 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand 146 states. [2018-11-23 12:28:35,927 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 146 states. [2018-11-23 12:28:35,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:35,929 INFO L93 Difference]: Finished difference Result 146 states and 150 transitions. [2018-11-23 12:28:35,929 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 150 transitions. [2018-11-23 12:28:35,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:35,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:35,930 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:35,930 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:35,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-23 12:28:35,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 149 transitions. [2018-11-23 12:28:35,932 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 149 transitions. Word has length 200 [2018-11-23 12:28:35,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:35,932 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 149 transitions. [2018-11-23 12:28:35,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-23 12:28:35,932 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2018-11-23 12:28:35,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-23 12:28:35,933 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:35,933 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 36, 36, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:28:35,933 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:35,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:35,934 INFO L82 PathProgramCache]: Analyzing trace with hash -283013655, now seen corresponding path program 38 times [2018-11-23 12:28:35,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:35,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:35,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:35,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:28:35,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:35,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:36,809 INFO L256 TraceCheckUtils]: 0: Hoare triple {33179#true} call ULTIMATE.init(); {33179#true} is VALID [2018-11-23 12:28:36,809 INFO L273 TraceCheckUtils]: 1: Hoare triple {33179#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {33179#true} is VALID [2018-11-23 12:28:36,810 INFO L273 TraceCheckUtils]: 2: Hoare triple {33179#true} assume true; {33179#true} is VALID [2018-11-23 12:28:36,810 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33179#true} {33179#true} #66#return; {33179#true} is VALID [2018-11-23 12:28:36,810 INFO L256 TraceCheckUtils]: 4: Hoare triple {33179#true} call #t~ret13 := main(); {33179#true} is VALID [2018-11-23 12:28:36,810 INFO L273 TraceCheckUtils]: 5: Hoare triple {33179#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; {33181#(= main_~i~1 0)} is VALID [2018-11-23 12:28:36,811 INFO L273 TraceCheckUtils]: 6: Hoare triple {33181#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33181#(= main_~i~1 0)} is VALID [2018-11-23 12:28:36,812 INFO L273 TraceCheckUtils]: 7: Hoare triple {33181#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33182#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:36,812 INFO L273 TraceCheckUtils]: 8: Hoare triple {33182#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33182#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:36,813 INFO L273 TraceCheckUtils]: 9: Hoare triple {33182#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33183#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:36,813 INFO L273 TraceCheckUtils]: 10: Hoare triple {33183#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33183#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:36,813 INFO L273 TraceCheckUtils]: 11: Hoare triple {33183#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33184#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:36,814 INFO L273 TraceCheckUtils]: 12: Hoare triple {33184#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33184#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:36,814 INFO L273 TraceCheckUtils]: 13: Hoare triple {33184#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33185#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:36,814 INFO L273 TraceCheckUtils]: 14: Hoare triple {33185#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33185#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:36,815 INFO L273 TraceCheckUtils]: 15: Hoare triple {33185#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33186#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:36,815 INFO L273 TraceCheckUtils]: 16: Hoare triple {33186#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33186#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:36,816 INFO L273 TraceCheckUtils]: 17: Hoare triple {33186#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33187#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:36,816 INFO L273 TraceCheckUtils]: 18: Hoare triple {33187#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33187#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:36,817 INFO L273 TraceCheckUtils]: 19: Hoare triple {33187#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33188#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:36,818 INFO L273 TraceCheckUtils]: 20: Hoare triple {33188#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33188#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:36,818 INFO L273 TraceCheckUtils]: 21: Hoare triple {33188#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33189#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:36,819 INFO L273 TraceCheckUtils]: 22: Hoare triple {33189#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33189#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:36,820 INFO L273 TraceCheckUtils]: 23: Hoare triple {33189#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33190#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:36,820 INFO L273 TraceCheckUtils]: 24: Hoare triple {33190#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33190#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:36,821 INFO L273 TraceCheckUtils]: 25: Hoare triple {33190#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33191#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:36,821 INFO L273 TraceCheckUtils]: 26: Hoare triple {33191#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33191#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:36,822 INFO L273 TraceCheckUtils]: 27: Hoare triple {33191#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33192#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:36,823 INFO L273 TraceCheckUtils]: 28: Hoare triple {33192#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33192#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:36,823 INFO L273 TraceCheckUtils]: 29: Hoare triple {33192#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33193#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:36,824 INFO L273 TraceCheckUtils]: 30: Hoare triple {33193#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33193#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:36,825 INFO L273 TraceCheckUtils]: 31: Hoare triple {33193#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33194#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:36,825 INFO L273 TraceCheckUtils]: 32: Hoare triple {33194#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33194#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:36,826 INFO L273 TraceCheckUtils]: 33: Hoare triple {33194#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33195#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:36,826 INFO L273 TraceCheckUtils]: 34: Hoare triple {33195#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33195#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:36,827 INFO L273 TraceCheckUtils]: 35: Hoare triple {33195#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33196#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:36,828 INFO L273 TraceCheckUtils]: 36: Hoare triple {33196#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33196#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:36,828 INFO L273 TraceCheckUtils]: 37: Hoare triple {33196#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33197#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:36,829 INFO L273 TraceCheckUtils]: 38: Hoare triple {33197#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33197#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:36,829 INFO L273 TraceCheckUtils]: 39: Hoare triple {33197#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33198#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:36,830 INFO L273 TraceCheckUtils]: 40: Hoare triple {33198#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33198#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:36,831 INFO L273 TraceCheckUtils]: 41: Hoare triple {33198#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33199#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:36,831 INFO L273 TraceCheckUtils]: 42: Hoare triple {33199#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33199#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:36,832 INFO L273 TraceCheckUtils]: 43: Hoare triple {33199#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33200#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:36,832 INFO L273 TraceCheckUtils]: 44: Hoare triple {33200#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33200#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:36,833 INFO L273 TraceCheckUtils]: 45: Hoare triple {33200#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33201#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:36,834 INFO L273 TraceCheckUtils]: 46: Hoare triple {33201#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33201#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:36,834 INFO L273 TraceCheckUtils]: 47: Hoare triple {33201#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33202#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:36,835 INFO L273 TraceCheckUtils]: 48: Hoare triple {33202#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33202#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:36,836 INFO L273 TraceCheckUtils]: 49: Hoare triple {33202#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33203#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:36,836 INFO L273 TraceCheckUtils]: 50: Hoare triple {33203#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33203#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:36,837 INFO L273 TraceCheckUtils]: 51: Hoare triple {33203#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33204#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:36,837 INFO L273 TraceCheckUtils]: 52: Hoare triple {33204#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33204#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:36,838 INFO L273 TraceCheckUtils]: 53: Hoare triple {33204#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33205#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:36,839 INFO L273 TraceCheckUtils]: 54: Hoare triple {33205#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33205#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:36,839 INFO L273 TraceCheckUtils]: 55: Hoare triple {33205#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33206#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:36,840 INFO L273 TraceCheckUtils]: 56: Hoare triple {33206#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33206#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:36,841 INFO L273 TraceCheckUtils]: 57: Hoare triple {33206#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33207#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:36,841 INFO L273 TraceCheckUtils]: 58: Hoare triple {33207#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33207#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:36,842 INFO L273 TraceCheckUtils]: 59: Hoare triple {33207#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33208#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:36,842 INFO L273 TraceCheckUtils]: 60: Hoare triple {33208#(<= main_~i~1 27)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33208#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:36,843 INFO L273 TraceCheckUtils]: 61: Hoare triple {33208#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33209#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:36,844 INFO L273 TraceCheckUtils]: 62: Hoare triple {33209#(<= main_~i~1 28)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33209#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:36,844 INFO L273 TraceCheckUtils]: 63: Hoare triple {33209#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33210#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:36,845 INFO L273 TraceCheckUtils]: 64: Hoare triple {33210#(<= main_~i~1 29)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33210#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:36,846 INFO L273 TraceCheckUtils]: 65: Hoare triple {33210#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33211#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:36,846 INFO L273 TraceCheckUtils]: 66: Hoare triple {33211#(<= main_~i~1 30)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33211#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:36,847 INFO L273 TraceCheckUtils]: 67: Hoare triple {33211#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33212#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:36,847 INFO L273 TraceCheckUtils]: 68: Hoare triple {33212#(<= main_~i~1 31)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33212#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:36,848 INFO L273 TraceCheckUtils]: 69: Hoare triple {33212#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33213#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:36,848 INFO L273 TraceCheckUtils]: 70: Hoare triple {33213#(<= main_~i~1 32)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33213#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:36,849 INFO L273 TraceCheckUtils]: 71: Hoare triple {33213#(<= main_~i~1 32)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33214#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:36,850 INFO L273 TraceCheckUtils]: 72: Hoare triple {33214#(<= main_~i~1 33)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33214#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:36,850 INFO L273 TraceCheckUtils]: 73: Hoare triple {33214#(<= main_~i~1 33)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33215#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:36,851 INFO L273 TraceCheckUtils]: 74: Hoare triple {33215#(<= main_~i~1 34)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33215#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:36,852 INFO L273 TraceCheckUtils]: 75: Hoare triple {33215#(<= main_~i~1 34)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33216#(<= main_~i~1 35)} is VALID [2018-11-23 12:28:36,852 INFO L273 TraceCheckUtils]: 76: Hoare triple {33216#(<= main_~i~1 35)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33216#(<= main_~i~1 35)} is VALID [2018-11-23 12:28:36,853 INFO L273 TraceCheckUtils]: 77: Hoare triple {33216#(<= main_~i~1 35)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33217#(<= main_~i~1 36)} is VALID [2018-11-23 12:28:36,853 INFO L273 TraceCheckUtils]: 78: Hoare triple {33217#(<= main_~i~1 36)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33217#(<= main_~i~1 36)} is VALID [2018-11-23 12:28:36,854 INFO L273 TraceCheckUtils]: 79: Hoare triple {33217#(<= main_~i~1 36)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33218#(<= main_~i~1 37)} is VALID [2018-11-23 12:28:36,855 INFO L273 TraceCheckUtils]: 80: Hoare triple {33218#(<= main_~i~1 37)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33218#(<= main_~i~1 37)} is VALID [2018-11-23 12:28:36,855 INFO L273 TraceCheckUtils]: 81: Hoare triple {33218#(<= main_~i~1 37)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33219#(<= main_~i~1 38)} is VALID [2018-11-23 12:28:36,856 INFO L273 TraceCheckUtils]: 82: Hoare triple {33219#(<= main_~i~1 38)} assume !(~i~1 < 100000); {33180#false} is VALID [2018-11-23 12:28:36,856 INFO L256 TraceCheckUtils]: 83: Hoare triple {33180#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {33179#true} is VALID [2018-11-23 12:28:36,856 INFO L273 TraceCheckUtils]: 84: Hoare triple {33179#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {33179#true} is VALID [2018-11-23 12:28:36,857 INFO L273 TraceCheckUtils]: 85: Hoare triple {33179#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:36,857 INFO L273 TraceCheckUtils]: 86: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:36,857 INFO L273 TraceCheckUtils]: 87: Hoare triple {33179#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:36,857 INFO L273 TraceCheckUtils]: 88: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:36,857 INFO L273 TraceCheckUtils]: 89: Hoare triple {33179#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:36,857 INFO L273 TraceCheckUtils]: 90: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:36,858 INFO L273 TraceCheckUtils]: 91: Hoare triple {33179#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:36,858 INFO L273 TraceCheckUtils]: 92: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:36,858 INFO L273 TraceCheckUtils]: 93: Hoare triple {33179#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:36,858 INFO L273 TraceCheckUtils]: 94: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:36,858 INFO L273 TraceCheckUtils]: 95: Hoare triple {33179#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:36,859 INFO L273 TraceCheckUtils]: 96: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:36,859 INFO L273 TraceCheckUtils]: 97: Hoare triple {33179#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:36,859 INFO L273 TraceCheckUtils]: 98: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:36,859 INFO L273 TraceCheckUtils]: 99: Hoare triple {33179#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:36,859 INFO L273 TraceCheckUtils]: 100: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:36,859 INFO L273 TraceCheckUtils]: 101: Hoare triple {33179#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:36,859 INFO L273 TraceCheckUtils]: 102: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:36,860 INFO L273 TraceCheckUtils]: 103: Hoare triple {33179#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:36,860 INFO L273 TraceCheckUtils]: 104: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:36,860 INFO L273 TraceCheckUtils]: 105: Hoare triple {33179#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:36,860 INFO L273 TraceCheckUtils]: 106: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:36,860 INFO L273 TraceCheckUtils]: 107: Hoare triple {33179#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:36,860 INFO L273 TraceCheckUtils]: 108: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:36,860 INFO L273 TraceCheckUtils]: 109: Hoare triple {33179#true} assume !(~i~0 < 100000); {33179#true} is VALID [2018-11-23 12:28:36,860 INFO L273 TraceCheckUtils]: 110: Hoare triple {33179#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {33179#true} is VALID [2018-11-23 12:28:36,860 INFO L273 TraceCheckUtils]: 111: Hoare triple {33179#true} assume true; {33179#true} is VALID [2018-11-23 12:28:36,860 INFO L268 TraceCheckUtils]: 112: Hoare quadruple {33179#true} {33180#false} #70#return; {33180#false} is VALID [2018-11-23 12:28:36,861 INFO L273 TraceCheckUtils]: 113: Hoare triple {33180#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {33180#false} is VALID [2018-11-23 12:28:36,861 INFO L256 TraceCheckUtils]: 114: Hoare triple {33180#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {33179#true} is VALID [2018-11-23 12:28:36,861 INFO L273 TraceCheckUtils]: 115: Hoare triple {33179#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {33179#true} is VALID [2018-11-23 12:28:36,861 INFO L273 TraceCheckUtils]: 116: Hoare triple {33179#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:36,861 INFO L273 TraceCheckUtils]: 117: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:36,861 INFO L273 TraceCheckUtils]: 118: Hoare triple {33179#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:36,861 INFO L273 TraceCheckUtils]: 119: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:36,861 INFO L273 TraceCheckUtils]: 120: Hoare triple {33179#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:36,861 INFO L273 TraceCheckUtils]: 121: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:36,861 INFO L273 TraceCheckUtils]: 122: Hoare triple {33179#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:36,862 INFO L273 TraceCheckUtils]: 123: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:36,862 INFO L273 TraceCheckUtils]: 124: Hoare triple {33179#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:36,862 INFO L273 TraceCheckUtils]: 125: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:36,862 INFO L273 TraceCheckUtils]: 126: Hoare triple {33179#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:36,862 INFO L273 TraceCheckUtils]: 127: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:36,862 INFO L273 TraceCheckUtils]: 128: Hoare triple {33179#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:36,862 INFO L273 TraceCheckUtils]: 129: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:36,862 INFO L273 TraceCheckUtils]: 130: Hoare triple {33179#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:36,862 INFO L273 TraceCheckUtils]: 131: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:36,862 INFO L273 TraceCheckUtils]: 132: Hoare triple {33179#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:36,863 INFO L273 TraceCheckUtils]: 133: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:36,863 INFO L273 TraceCheckUtils]: 134: Hoare triple {33179#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:36,863 INFO L273 TraceCheckUtils]: 135: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:36,863 INFO L273 TraceCheckUtils]: 136: Hoare triple {33179#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:36,863 INFO L273 TraceCheckUtils]: 137: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:36,863 INFO L273 TraceCheckUtils]: 138: Hoare triple {33179#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:36,863 INFO L273 TraceCheckUtils]: 139: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:36,863 INFO L273 TraceCheckUtils]: 140: Hoare triple {33179#true} assume !(~i~0 < 100000); {33179#true} is VALID [2018-11-23 12:28:36,863 INFO L273 TraceCheckUtils]: 141: Hoare triple {33179#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {33179#true} is VALID [2018-11-23 12:28:36,863 INFO L273 TraceCheckUtils]: 142: Hoare triple {33179#true} assume true; {33179#true} is VALID [2018-11-23 12:28:36,864 INFO L268 TraceCheckUtils]: 143: Hoare quadruple {33179#true} {33180#false} #72#return; {33180#false} is VALID [2018-11-23 12:28:36,864 INFO L273 TraceCheckUtils]: 144: Hoare triple {33180#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {33180#false} is VALID [2018-11-23 12:28:36,864 INFO L273 TraceCheckUtils]: 145: Hoare triple {33180#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33180#false} is VALID [2018-11-23 12:28:36,864 INFO L273 TraceCheckUtils]: 146: Hoare triple {33180#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33180#false} is VALID [2018-11-23 12:28:36,864 INFO L273 TraceCheckUtils]: 147: Hoare triple {33180#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33180#false} is VALID [2018-11-23 12:28:36,864 INFO L273 TraceCheckUtils]: 148: Hoare triple {33180#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33180#false} is VALID [2018-11-23 12:28:36,864 INFO L273 TraceCheckUtils]: 149: Hoare triple {33180#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33180#false} is VALID [2018-11-23 12:28:36,864 INFO L273 TraceCheckUtils]: 150: Hoare triple {33180#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33180#false} is VALID [2018-11-23 12:28:36,864 INFO L273 TraceCheckUtils]: 151: Hoare triple {33180#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33180#false} is VALID [2018-11-23 12:28:36,865 INFO L273 TraceCheckUtils]: 152: Hoare triple {33180#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33180#false} is VALID [2018-11-23 12:28:36,865 INFO L273 TraceCheckUtils]: 153: Hoare triple {33180#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33180#false} is VALID [2018-11-23 12:28:36,865 INFO L273 TraceCheckUtils]: 154: Hoare triple {33180#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33180#false} is VALID [2018-11-23 12:28:36,865 INFO L273 TraceCheckUtils]: 155: Hoare triple {33180#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33180#false} is VALID [2018-11-23 12:28:36,865 INFO L273 TraceCheckUtils]: 156: Hoare triple {33180#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33180#false} is VALID [2018-11-23 12:28:36,865 INFO L273 TraceCheckUtils]: 157: Hoare triple {33180#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33180#false} is VALID [2018-11-23 12:28:36,865 INFO L273 TraceCheckUtils]: 158: Hoare triple {33180#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33180#false} is VALID [2018-11-23 12:28:36,865 INFO L273 TraceCheckUtils]: 159: Hoare triple {33180#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33180#false} is VALID [2018-11-23 12:28:36,865 INFO L273 TraceCheckUtils]: 160: Hoare triple {33180#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33180#false} is VALID [2018-11-23 12:28:36,865 INFO L273 TraceCheckUtils]: 161: Hoare triple {33180#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33180#false} is VALID [2018-11-23 12:28:36,866 INFO L273 TraceCheckUtils]: 162: Hoare triple {33180#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33180#false} is VALID [2018-11-23 12:28:36,866 INFO L273 TraceCheckUtils]: 163: Hoare triple {33180#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33180#false} is VALID [2018-11-23 12:28:36,866 INFO L273 TraceCheckUtils]: 164: Hoare triple {33180#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33180#false} is VALID [2018-11-23 12:28:36,866 INFO L273 TraceCheckUtils]: 165: Hoare triple {33180#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33180#false} is VALID [2018-11-23 12:28:36,866 INFO L273 TraceCheckUtils]: 166: Hoare triple {33180#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33180#false} is VALID [2018-11-23 12:28:36,866 INFO L273 TraceCheckUtils]: 167: Hoare triple {33180#false} assume !(~i~2 < 99999); {33180#false} is VALID [2018-11-23 12:28:36,866 INFO L273 TraceCheckUtils]: 168: Hoare triple {33180#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {33180#false} is VALID [2018-11-23 12:28:36,866 INFO L256 TraceCheckUtils]: 169: Hoare triple {33180#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {33179#true} is VALID [2018-11-23 12:28:36,866 INFO L273 TraceCheckUtils]: 170: Hoare triple {33179#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {33179#true} is VALID [2018-11-23 12:28:36,866 INFO L273 TraceCheckUtils]: 171: Hoare triple {33179#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:36,867 INFO L273 TraceCheckUtils]: 172: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:36,867 INFO L273 TraceCheckUtils]: 173: Hoare triple {33179#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:36,867 INFO L273 TraceCheckUtils]: 174: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:36,867 INFO L273 TraceCheckUtils]: 175: Hoare triple {33179#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:36,867 INFO L273 TraceCheckUtils]: 176: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:36,867 INFO L273 TraceCheckUtils]: 177: Hoare triple {33179#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:36,867 INFO L273 TraceCheckUtils]: 178: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:36,867 INFO L273 TraceCheckUtils]: 179: Hoare triple {33179#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:36,867 INFO L273 TraceCheckUtils]: 180: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:36,867 INFO L273 TraceCheckUtils]: 181: Hoare triple {33179#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:36,868 INFO L273 TraceCheckUtils]: 182: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:36,868 INFO L273 TraceCheckUtils]: 183: Hoare triple {33179#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:36,868 INFO L273 TraceCheckUtils]: 184: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:36,868 INFO L273 TraceCheckUtils]: 185: Hoare triple {33179#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:36,868 INFO L273 TraceCheckUtils]: 186: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:36,868 INFO L273 TraceCheckUtils]: 187: Hoare triple {33179#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:36,868 INFO L273 TraceCheckUtils]: 188: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:36,868 INFO L273 TraceCheckUtils]: 189: Hoare triple {33179#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:36,868 INFO L273 TraceCheckUtils]: 190: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:36,868 INFO L273 TraceCheckUtils]: 191: Hoare triple {33179#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:36,869 INFO L273 TraceCheckUtils]: 192: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:36,869 INFO L273 TraceCheckUtils]: 193: Hoare triple {33179#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:28:36,869 INFO L273 TraceCheckUtils]: 194: Hoare triple {33179#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33179#true} is VALID [2018-11-23 12:28:36,869 INFO L273 TraceCheckUtils]: 195: Hoare triple {33179#true} assume !(~i~0 < 100000); {33179#true} is VALID [2018-11-23 12:28:36,869 INFO L273 TraceCheckUtils]: 196: Hoare triple {33179#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {33179#true} is VALID [2018-11-23 12:28:36,869 INFO L273 TraceCheckUtils]: 197: Hoare triple {33179#true} assume true; {33179#true} is VALID [2018-11-23 12:28:36,869 INFO L268 TraceCheckUtils]: 198: Hoare quadruple {33179#true} {33180#false} #74#return; {33180#false} is VALID [2018-11-23 12:28:36,869 INFO L273 TraceCheckUtils]: 199: Hoare triple {33180#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {33180#false} is VALID [2018-11-23 12:28:36,869 INFO L273 TraceCheckUtils]: 200: Hoare triple {33180#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {33180#false} is VALID [2018-11-23 12:28:36,869 INFO L273 TraceCheckUtils]: 201: Hoare triple {33180#false} assume !false; {33180#false} is VALID [2018-11-23 12:28:36,887 INFO L134 CoverageAnalysis]: Checked inductivity of 2948 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2018-11-23 12:28:36,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:36,887 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:28:36,897 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:28:37,033 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:28:37,033 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:37,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:37,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:38,286 INFO L256 TraceCheckUtils]: 0: Hoare triple {33179#true} call ULTIMATE.init(); {33179#true} is VALID [2018-11-23 12:28:38,286 INFO L273 TraceCheckUtils]: 1: Hoare triple {33179#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {33179#true} is VALID [2018-11-23 12:28:38,286 INFO L273 TraceCheckUtils]: 2: Hoare triple {33179#true} assume true; {33179#true} is VALID [2018-11-23 12:28:38,286 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33179#true} {33179#true} #66#return; {33179#true} is VALID [2018-11-23 12:28:38,287 INFO L256 TraceCheckUtils]: 4: Hoare triple {33179#true} call #t~ret13 := main(); {33179#true} is VALID [2018-11-23 12:28:38,287 INFO L273 TraceCheckUtils]: 5: Hoare triple {33179#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; {33238#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:38,288 INFO L273 TraceCheckUtils]: 6: Hoare triple {33238#(<= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33238#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:38,288 INFO L273 TraceCheckUtils]: 7: Hoare triple {33238#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33182#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:38,289 INFO L273 TraceCheckUtils]: 8: Hoare triple {33182#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33182#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:38,289 INFO L273 TraceCheckUtils]: 9: Hoare triple {33182#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33183#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:38,289 INFO L273 TraceCheckUtils]: 10: Hoare triple {33183#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33183#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:38,290 INFO L273 TraceCheckUtils]: 11: Hoare triple {33183#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33184#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:38,290 INFO L273 TraceCheckUtils]: 12: Hoare triple {33184#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33184#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:38,291 INFO L273 TraceCheckUtils]: 13: Hoare triple {33184#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33185#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:38,292 INFO L273 TraceCheckUtils]: 14: Hoare triple {33185#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33185#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:38,292 INFO L273 TraceCheckUtils]: 15: Hoare triple {33185#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33186#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:38,293 INFO L273 TraceCheckUtils]: 16: Hoare triple {33186#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33186#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:38,294 INFO L273 TraceCheckUtils]: 17: Hoare triple {33186#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33187#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:38,294 INFO L273 TraceCheckUtils]: 18: Hoare triple {33187#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33187#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:38,295 INFO L273 TraceCheckUtils]: 19: Hoare triple {33187#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33188#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:38,295 INFO L273 TraceCheckUtils]: 20: Hoare triple {33188#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33188#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:38,296 INFO L273 TraceCheckUtils]: 21: Hoare triple {33188#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33189#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:38,297 INFO L273 TraceCheckUtils]: 22: Hoare triple {33189#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33189#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:38,297 INFO L273 TraceCheckUtils]: 23: Hoare triple {33189#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33190#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:38,298 INFO L273 TraceCheckUtils]: 24: Hoare triple {33190#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33190#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:38,299 INFO L273 TraceCheckUtils]: 25: Hoare triple {33190#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33191#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:38,299 INFO L273 TraceCheckUtils]: 26: Hoare triple {33191#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33191#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:38,300 INFO L273 TraceCheckUtils]: 27: Hoare triple {33191#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33192#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:38,300 INFO L273 TraceCheckUtils]: 28: Hoare triple {33192#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33192#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:38,301 INFO L273 TraceCheckUtils]: 29: Hoare triple {33192#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33193#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:38,302 INFO L273 TraceCheckUtils]: 30: Hoare triple {33193#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33193#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:38,302 INFO L273 TraceCheckUtils]: 31: Hoare triple {33193#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33194#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:38,303 INFO L273 TraceCheckUtils]: 32: Hoare triple {33194#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33194#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:38,303 INFO L273 TraceCheckUtils]: 33: Hoare triple {33194#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33195#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:38,304 INFO L273 TraceCheckUtils]: 34: Hoare triple {33195#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33195#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:38,305 INFO L273 TraceCheckUtils]: 35: Hoare triple {33195#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33196#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:38,305 INFO L273 TraceCheckUtils]: 36: Hoare triple {33196#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33196#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:38,306 INFO L273 TraceCheckUtils]: 37: Hoare triple {33196#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33197#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:38,306 INFO L273 TraceCheckUtils]: 38: Hoare triple {33197#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33197#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:38,307 INFO L273 TraceCheckUtils]: 39: Hoare triple {33197#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33198#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:38,308 INFO L273 TraceCheckUtils]: 40: Hoare triple {33198#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33198#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:38,308 INFO L273 TraceCheckUtils]: 41: Hoare triple {33198#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33199#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:38,309 INFO L273 TraceCheckUtils]: 42: Hoare triple {33199#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33199#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:38,310 INFO L273 TraceCheckUtils]: 43: Hoare triple {33199#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33200#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:38,310 INFO L273 TraceCheckUtils]: 44: Hoare triple {33200#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33200#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:38,311 INFO L273 TraceCheckUtils]: 45: Hoare triple {33200#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33201#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:38,311 INFO L273 TraceCheckUtils]: 46: Hoare triple {33201#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33201#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:38,312 INFO L273 TraceCheckUtils]: 47: Hoare triple {33201#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33202#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:38,313 INFO L273 TraceCheckUtils]: 48: Hoare triple {33202#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33202#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:38,313 INFO L273 TraceCheckUtils]: 49: Hoare triple {33202#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33203#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:38,314 INFO L273 TraceCheckUtils]: 50: Hoare triple {33203#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33203#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:38,315 INFO L273 TraceCheckUtils]: 51: Hoare triple {33203#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33204#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:38,315 INFO L273 TraceCheckUtils]: 52: Hoare triple {33204#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33204#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:38,316 INFO L273 TraceCheckUtils]: 53: Hoare triple {33204#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33205#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:38,316 INFO L273 TraceCheckUtils]: 54: Hoare triple {33205#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33205#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:38,317 INFO L273 TraceCheckUtils]: 55: Hoare triple {33205#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33206#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:38,318 INFO L273 TraceCheckUtils]: 56: Hoare triple {33206#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33206#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:38,318 INFO L273 TraceCheckUtils]: 57: Hoare triple {33206#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33207#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:38,319 INFO L273 TraceCheckUtils]: 58: Hoare triple {33207#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33207#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:38,319 INFO L273 TraceCheckUtils]: 59: Hoare triple {33207#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33208#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:38,320 INFO L273 TraceCheckUtils]: 60: Hoare triple {33208#(<= main_~i~1 27)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33208#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:38,321 INFO L273 TraceCheckUtils]: 61: Hoare triple {33208#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33209#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:38,321 INFO L273 TraceCheckUtils]: 62: Hoare triple {33209#(<= main_~i~1 28)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33209#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:38,322 INFO L273 TraceCheckUtils]: 63: Hoare triple {33209#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33210#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:38,322 INFO L273 TraceCheckUtils]: 64: Hoare triple {33210#(<= main_~i~1 29)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33210#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:38,323 INFO L273 TraceCheckUtils]: 65: Hoare triple {33210#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33211#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:38,324 INFO L273 TraceCheckUtils]: 66: Hoare triple {33211#(<= main_~i~1 30)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33211#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:38,324 INFO L273 TraceCheckUtils]: 67: Hoare triple {33211#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33212#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:38,325 INFO L273 TraceCheckUtils]: 68: Hoare triple {33212#(<= main_~i~1 31)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33212#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:38,326 INFO L273 TraceCheckUtils]: 69: Hoare triple {33212#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33213#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:38,326 INFO L273 TraceCheckUtils]: 70: Hoare triple {33213#(<= main_~i~1 32)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33213#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:38,327 INFO L273 TraceCheckUtils]: 71: Hoare triple {33213#(<= main_~i~1 32)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33214#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:38,327 INFO L273 TraceCheckUtils]: 72: Hoare triple {33214#(<= main_~i~1 33)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33214#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:38,328 INFO L273 TraceCheckUtils]: 73: Hoare triple {33214#(<= main_~i~1 33)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33215#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:38,329 INFO L273 TraceCheckUtils]: 74: Hoare triple {33215#(<= main_~i~1 34)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33215#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:38,329 INFO L273 TraceCheckUtils]: 75: Hoare triple {33215#(<= main_~i~1 34)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33216#(<= main_~i~1 35)} is VALID [2018-11-23 12:28:38,330 INFO L273 TraceCheckUtils]: 76: Hoare triple {33216#(<= main_~i~1 35)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33216#(<= main_~i~1 35)} is VALID [2018-11-23 12:28:38,331 INFO L273 TraceCheckUtils]: 77: Hoare triple {33216#(<= main_~i~1 35)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33217#(<= main_~i~1 36)} is VALID [2018-11-23 12:28:38,331 INFO L273 TraceCheckUtils]: 78: Hoare triple {33217#(<= main_~i~1 36)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33217#(<= main_~i~1 36)} is VALID [2018-11-23 12:28:38,332 INFO L273 TraceCheckUtils]: 79: Hoare triple {33217#(<= main_~i~1 36)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33218#(<= main_~i~1 37)} is VALID [2018-11-23 12:28:38,332 INFO L273 TraceCheckUtils]: 80: Hoare triple {33218#(<= main_~i~1 37)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {33218#(<= main_~i~1 37)} is VALID [2018-11-23 12:28:38,333 INFO L273 TraceCheckUtils]: 81: Hoare triple {33218#(<= main_~i~1 37)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {33219#(<= main_~i~1 38)} is VALID [2018-11-23 12:28:38,334 INFO L273 TraceCheckUtils]: 82: Hoare triple {33219#(<= main_~i~1 38)} assume !(~i~1 < 100000); {33180#false} is VALID [2018-11-23 12:28:38,334 INFO L256 TraceCheckUtils]: 83: Hoare triple {33180#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {33180#false} is VALID [2018-11-23 12:28:38,334 INFO L273 TraceCheckUtils]: 84: Hoare triple {33180#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {33180#false} is VALID [2018-11-23 12:28:38,334 INFO L273 TraceCheckUtils]: 85: Hoare triple {33180#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:38,334 INFO L273 TraceCheckUtils]: 86: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:38,335 INFO L273 TraceCheckUtils]: 87: Hoare triple {33180#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:38,335 INFO L273 TraceCheckUtils]: 88: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:38,335 INFO L273 TraceCheckUtils]: 89: Hoare triple {33180#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:38,335 INFO L273 TraceCheckUtils]: 90: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:38,335 INFO L273 TraceCheckUtils]: 91: Hoare triple {33180#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:38,335 INFO L273 TraceCheckUtils]: 92: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:38,336 INFO L273 TraceCheckUtils]: 93: Hoare triple {33180#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:38,336 INFO L273 TraceCheckUtils]: 94: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:38,336 INFO L273 TraceCheckUtils]: 95: Hoare triple {33180#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:38,336 INFO L273 TraceCheckUtils]: 96: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:38,336 INFO L273 TraceCheckUtils]: 97: Hoare triple {33180#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:38,337 INFO L273 TraceCheckUtils]: 98: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:38,337 INFO L273 TraceCheckUtils]: 99: Hoare triple {33180#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:38,337 INFO L273 TraceCheckUtils]: 100: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:38,337 INFO L273 TraceCheckUtils]: 101: Hoare triple {33180#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:38,337 INFO L273 TraceCheckUtils]: 102: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:38,337 INFO L273 TraceCheckUtils]: 103: Hoare triple {33180#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:38,338 INFO L273 TraceCheckUtils]: 104: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:38,338 INFO L273 TraceCheckUtils]: 105: Hoare triple {33180#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:38,338 INFO L273 TraceCheckUtils]: 106: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:38,338 INFO L273 TraceCheckUtils]: 107: Hoare triple {33180#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:38,338 INFO L273 TraceCheckUtils]: 108: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:38,338 INFO L273 TraceCheckUtils]: 109: Hoare triple {33180#false} assume !(~i~0 < 100000); {33180#false} is VALID [2018-11-23 12:28:38,338 INFO L273 TraceCheckUtils]: 110: Hoare triple {33180#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {33180#false} is VALID [2018-11-23 12:28:38,339 INFO L273 TraceCheckUtils]: 111: Hoare triple {33180#false} assume true; {33180#false} is VALID [2018-11-23 12:28:38,339 INFO L268 TraceCheckUtils]: 112: Hoare quadruple {33180#false} {33180#false} #70#return; {33180#false} is VALID [2018-11-23 12:28:38,339 INFO L273 TraceCheckUtils]: 113: Hoare triple {33180#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {33180#false} is VALID [2018-11-23 12:28:38,339 INFO L256 TraceCheckUtils]: 114: Hoare triple {33180#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {33180#false} is VALID [2018-11-23 12:28:38,339 INFO L273 TraceCheckUtils]: 115: Hoare triple {33180#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {33180#false} is VALID [2018-11-23 12:28:38,339 INFO L273 TraceCheckUtils]: 116: Hoare triple {33180#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:38,339 INFO L273 TraceCheckUtils]: 117: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:38,339 INFO L273 TraceCheckUtils]: 118: Hoare triple {33180#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:38,339 INFO L273 TraceCheckUtils]: 119: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:38,339 INFO L273 TraceCheckUtils]: 120: Hoare triple {33180#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:38,340 INFO L273 TraceCheckUtils]: 121: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:38,340 INFO L273 TraceCheckUtils]: 122: Hoare triple {33180#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:38,340 INFO L273 TraceCheckUtils]: 123: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:38,340 INFO L273 TraceCheckUtils]: 124: Hoare triple {33180#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:38,340 INFO L273 TraceCheckUtils]: 125: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:38,340 INFO L273 TraceCheckUtils]: 126: Hoare triple {33180#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:38,340 INFO L273 TraceCheckUtils]: 127: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:38,340 INFO L273 TraceCheckUtils]: 128: Hoare triple {33180#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:38,340 INFO L273 TraceCheckUtils]: 129: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:38,340 INFO L273 TraceCheckUtils]: 130: Hoare triple {33180#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:38,341 INFO L273 TraceCheckUtils]: 131: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:38,341 INFO L273 TraceCheckUtils]: 132: Hoare triple {33180#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:38,341 INFO L273 TraceCheckUtils]: 133: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:38,341 INFO L273 TraceCheckUtils]: 134: Hoare triple {33180#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:38,341 INFO L273 TraceCheckUtils]: 135: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:38,341 INFO L273 TraceCheckUtils]: 136: Hoare triple {33180#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:38,341 INFO L273 TraceCheckUtils]: 137: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:38,341 INFO L273 TraceCheckUtils]: 138: Hoare triple {33180#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:38,341 INFO L273 TraceCheckUtils]: 139: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:38,341 INFO L273 TraceCheckUtils]: 140: Hoare triple {33180#false} assume !(~i~0 < 100000); {33180#false} is VALID [2018-11-23 12:28:38,342 INFO L273 TraceCheckUtils]: 141: Hoare triple {33180#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {33180#false} is VALID [2018-11-23 12:28:38,342 INFO L273 TraceCheckUtils]: 142: Hoare triple {33180#false} assume true; {33180#false} is VALID [2018-11-23 12:28:38,342 INFO L268 TraceCheckUtils]: 143: Hoare quadruple {33180#false} {33180#false} #72#return; {33180#false} is VALID [2018-11-23 12:28:38,342 INFO L273 TraceCheckUtils]: 144: Hoare triple {33180#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {33180#false} is VALID [2018-11-23 12:28:38,342 INFO L273 TraceCheckUtils]: 145: Hoare triple {33180#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33180#false} is VALID [2018-11-23 12:28:38,342 INFO L273 TraceCheckUtils]: 146: Hoare triple {33180#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33180#false} is VALID [2018-11-23 12:28:38,342 INFO L273 TraceCheckUtils]: 147: Hoare triple {33180#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33180#false} is VALID [2018-11-23 12:28:38,342 INFO L273 TraceCheckUtils]: 148: Hoare triple {33180#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33180#false} is VALID [2018-11-23 12:28:38,342 INFO L273 TraceCheckUtils]: 149: Hoare triple {33180#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33180#false} is VALID [2018-11-23 12:28:38,342 INFO L273 TraceCheckUtils]: 150: Hoare triple {33180#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33180#false} is VALID [2018-11-23 12:28:38,343 INFO L273 TraceCheckUtils]: 151: Hoare triple {33180#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33180#false} is VALID [2018-11-23 12:28:38,343 INFO L273 TraceCheckUtils]: 152: Hoare triple {33180#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33180#false} is VALID [2018-11-23 12:28:38,343 INFO L273 TraceCheckUtils]: 153: Hoare triple {33180#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33180#false} is VALID [2018-11-23 12:28:38,343 INFO L273 TraceCheckUtils]: 154: Hoare triple {33180#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33180#false} is VALID [2018-11-23 12:28:38,343 INFO L273 TraceCheckUtils]: 155: Hoare triple {33180#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33180#false} is VALID [2018-11-23 12:28:38,343 INFO L273 TraceCheckUtils]: 156: Hoare triple {33180#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33180#false} is VALID [2018-11-23 12:28:38,343 INFO L273 TraceCheckUtils]: 157: Hoare triple {33180#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33180#false} is VALID [2018-11-23 12:28:38,343 INFO L273 TraceCheckUtils]: 158: Hoare triple {33180#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33180#false} is VALID [2018-11-23 12:28:38,343 INFO L273 TraceCheckUtils]: 159: Hoare triple {33180#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33180#false} is VALID [2018-11-23 12:28:38,343 INFO L273 TraceCheckUtils]: 160: Hoare triple {33180#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33180#false} is VALID [2018-11-23 12:28:38,344 INFO L273 TraceCheckUtils]: 161: Hoare triple {33180#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33180#false} is VALID [2018-11-23 12:28:38,344 INFO L273 TraceCheckUtils]: 162: Hoare triple {33180#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33180#false} is VALID [2018-11-23 12:28:38,344 INFO L273 TraceCheckUtils]: 163: Hoare triple {33180#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33180#false} is VALID [2018-11-23 12:28:38,344 INFO L273 TraceCheckUtils]: 164: Hoare triple {33180#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33180#false} is VALID [2018-11-23 12:28:38,344 INFO L273 TraceCheckUtils]: 165: Hoare triple {33180#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {33180#false} is VALID [2018-11-23 12:28:38,344 INFO L273 TraceCheckUtils]: 166: Hoare triple {33180#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {33180#false} is VALID [2018-11-23 12:28:38,344 INFO L273 TraceCheckUtils]: 167: Hoare triple {33180#false} assume !(~i~2 < 99999); {33180#false} is VALID [2018-11-23 12:28:38,344 INFO L273 TraceCheckUtils]: 168: Hoare triple {33180#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {33180#false} is VALID [2018-11-23 12:28:38,344 INFO L256 TraceCheckUtils]: 169: Hoare triple {33180#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {33180#false} is VALID [2018-11-23 12:28:38,344 INFO L273 TraceCheckUtils]: 170: Hoare triple {33180#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {33180#false} is VALID [2018-11-23 12:28:38,345 INFO L273 TraceCheckUtils]: 171: Hoare triple {33180#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:38,345 INFO L273 TraceCheckUtils]: 172: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:38,345 INFO L273 TraceCheckUtils]: 173: Hoare triple {33180#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:38,345 INFO L273 TraceCheckUtils]: 174: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:38,345 INFO L273 TraceCheckUtils]: 175: Hoare triple {33180#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:38,345 INFO L273 TraceCheckUtils]: 176: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:38,345 INFO L273 TraceCheckUtils]: 177: Hoare triple {33180#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:38,345 INFO L273 TraceCheckUtils]: 178: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:38,345 INFO L273 TraceCheckUtils]: 179: Hoare triple {33180#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:38,345 INFO L273 TraceCheckUtils]: 180: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:38,346 INFO L273 TraceCheckUtils]: 181: Hoare triple {33180#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:38,346 INFO L273 TraceCheckUtils]: 182: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:38,346 INFO L273 TraceCheckUtils]: 183: Hoare triple {33180#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:38,346 INFO L273 TraceCheckUtils]: 184: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:38,346 INFO L273 TraceCheckUtils]: 185: Hoare triple {33180#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:38,346 INFO L273 TraceCheckUtils]: 186: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:38,346 INFO L273 TraceCheckUtils]: 187: Hoare triple {33180#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:38,346 INFO L273 TraceCheckUtils]: 188: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:38,346 INFO L273 TraceCheckUtils]: 189: Hoare triple {33180#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:38,346 INFO L273 TraceCheckUtils]: 190: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:38,347 INFO L273 TraceCheckUtils]: 191: Hoare triple {33180#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:38,347 INFO L273 TraceCheckUtils]: 192: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:38,347 INFO L273 TraceCheckUtils]: 193: Hoare triple {33180#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:28:38,347 INFO L273 TraceCheckUtils]: 194: Hoare triple {33180#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33180#false} is VALID [2018-11-23 12:28:38,347 INFO L273 TraceCheckUtils]: 195: Hoare triple {33180#false} assume !(~i~0 < 100000); {33180#false} is VALID [2018-11-23 12:28:38,347 INFO L273 TraceCheckUtils]: 196: Hoare triple {33180#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {33180#false} is VALID [2018-11-23 12:28:38,347 INFO L273 TraceCheckUtils]: 197: Hoare triple {33180#false} assume true; {33180#false} is VALID [2018-11-23 12:28:38,347 INFO L268 TraceCheckUtils]: 198: Hoare quadruple {33180#false} {33180#false} #74#return; {33180#false} is VALID [2018-11-23 12:28:38,347 INFO L273 TraceCheckUtils]: 199: Hoare triple {33180#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {33180#false} is VALID [2018-11-23 12:28:38,347 INFO L273 TraceCheckUtils]: 200: Hoare triple {33180#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {33180#false} is VALID [2018-11-23 12:28:38,348 INFO L273 TraceCheckUtils]: 201: Hoare triple {33180#false} assume !false; {33180#false} is VALID [2018-11-23 12:28:38,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2948 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2018-11-23 12:28:38,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:38,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2018-11-23 12:28:38,386 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 202 [2018-11-23 12:28:38,387 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:38,387 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 12:28:38,503 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:38,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 12:28:38,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 12:28:38,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:28:38,505 INFO L87 Difference]: Start difference. First operand 145 states and 149 transitions. Second operand 42 states. [2018-11-23 12:28:38,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:38,879 INFO L93 Difference]: Finished difference Result 210 states and 218 transitions. [2018-11-23 12:28:38,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-23 12:28:38,879 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 202 [2018-11-23 12:28:38,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:38,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:28:38,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 130 transitions. [2018-11-23 12:28:38,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:28:38,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 130 transitions. [2018-11-23 12:28:38,881 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 130 transitions. [2018-11-23 12:28:39,008 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:39,011 INFO L225 Difference]: With dead ends: 210 [2018-11-23 12:28:39,011 INFO L226 Difference]: Without dead ends: 148 [2018-11-23 12:28:39,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:28:39,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-23 12:28:39,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2018-11-23 12:28:39,128 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:39,128 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand 147 states. [2018-11-23 12:28:39,128 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand 147 states. [2018-11-23 12:28:39,128 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 147 states. [2018-11-23 12:28:39,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:39,131 INFO L93 Difference]: Finished difference Result 148 states and 152 transitions. [2018-11-23 12:28:39,131 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 152 transitions. [2018-11-23 12:28:39,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:39,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:39,132 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand 148 states. [2018-11-23 12:28:39,132 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 148 states. [2018-11-23 12:28:39,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:39,135 INFO L93 Difference]: Finished difference Result 148 states and 152 transitions. [2018-11-23 12:28:39,135 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 152 transitions. [2018-11-23 12:28:39,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:39,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:39,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:39,136 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:39,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-23 12:28:39,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 151 transitions. [2018-11-23 12:28:39,138 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 151 transitions. Word has length 202 [2018-11-23 12:28:39,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:39,139 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 151 transitions. [2018-11-23 12:28:39,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 12:28:39,139 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 151 transitions. [2018-11-23 12:28:39,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-23 12:28:39,140 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:39,140 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 36, 36, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:28:39,141 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:39,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:39,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1928130507, now seen corresponding path program 39 times [2018-11-23 12:28:39,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:39,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:39,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:39,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:39,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:39,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:40,450 INFO L256 TraceCheckUtils]: 0: Hoare triple {34654#true} call ULTIMATE.init(); {34654#true} is VALID [2018-11-23 12:28:40,451 INFO L273 TraceCheckUtils]: 1: Hoare triple {34654#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {34654#true} is VALID [2018-11-23 12:28:40,451 INFO L273 TraceCheckUtils]: 2: Hoare triple {34654#true} assume true; {34654#true} is VALID [2018-11-23 12:28:40,451 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34654#true} {34654#true} #66#return; {34654#true} is VALID [2018-11-23 12:28:40,451 INFO L256 TraceCheckUtils]: 4: Hoare triple {34654#true} call #t~ret13 := main(); {34654#true} is VALID [2018-11-23 12:28:40,452 INFO L273 TraceCheckUtils]: 5: Hoare triple {34654#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; {34656#(= main_~i~1 0)} is VALID [2018-11-23 12:28:40,452 INFO L273 TraceCheckUtils]: 6: Hoare triple {34656#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34656#(= main_~i~1 0)} is VALID [2018-11-23 12:28:40,453 INFO L273 TraceCheckUtils]: 7: Hoare triple {34656#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34657#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:40,454 INFO L273 TraceCheckUtils]: 8: Hoare triple {34657#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34657#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:40,455 INFO L273 TraceCheckUtils]: 9: Hoare triple {34657#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34658#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:40,455 INFO L273 TraceCheckUtils]: 10: Hoare triple {34658#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34658#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:40,456 INFO L273 TraceCheckUtils]: 11: Hoare triple {34658#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34659#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:40,456 INFO L273 TraceCheckUtils]: 12: Hoare triple {34659#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34659#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:40,457 INFO L273 TraceCheckUtils]: 13: Hoare triple {34659#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34660#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:40,458 INFO L273 TraceCheckUtils]: 14: Hoare triple {34660#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34660#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:40,458 INFO L273 TraceCheckUtils]: 15: Hoare triple {34660#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34661#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:40,459 INFO L273 TraceCheckUtils]: 16: Hoare triple {34661#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34661#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:40,460 INFO L273 TraceCheckUtils]: 17: Hoare triple {34661#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34662#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:40,460 INFO L273 TraceCheckUtils]: 18: Hoare triple {34662#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34662#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:40,461 INFO L273 TraceCheckUtils]: 19: Hoare triple {34662#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34663#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:40,461 INFO L273 TraceCheckUtils]: 20: Hoare triple {34663#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34663#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:40,462 INFO L273 TraceCheckUtils]: 21: Hoare triple {34663#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34664#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:40,462 INFO L273 TraceCheckUtils]: 22: Hoare triple {34664#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34664#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:40,463 INFO L273 TraceCheckUtils]: 23: Hoare triple {34664#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34665#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:40,464 INFO L273 TraceCheckUtils]: 24: Hoare triple {34665#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34665#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:40,464 INFO L273 TraceCheckUtils]: 25: Hoare triple {34665#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34666#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:40,465 INFO L273 TraceCheckUtils]: 26: Hoare triple {34666#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34666#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:40,466 INFO L273 TraceCheckUtils]: 27: Hoare triple {34666#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34667#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:40,466 INFO L273 TraceCheckUtils]: 28: Hoare triple {34667#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34667#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:40,467 INFO L273 TraceCheckUtils]: 29: Hoare triple {34667#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34668#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:40,467 INFO L273 TraceCheckUtils]: 30: Hoare triple {34668#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34668#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:40,468 INFO L273 TraceCheckUtils]: 31: Hoare triple {34668#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34669#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:40,469 INFO L273 TraceCheckUtils]: 32: Hoare triple {34669#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34669#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:40,469 INFO L273 TraceCheckUtils]: 33: Hoare triple {34669#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34670#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:40,470 INFO L273 TraceCheckUtils]: 34: Hoare triple {34670#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34670#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:40,471 INFO L273 TraceCheckUtils]: 35: Hoare triple {34670#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34671#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:40,471 INFO L273 TraceCheckUtils]: 36: Hoare triple {34671#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34671#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:40,472 INFO L273 TraceCheckUtils]: 37: Hoare triple {34671#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34672#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:40,472 INFO L273 TraceCheckUtils]: 38: Hoare triple {34672#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34672#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:40,473 INFO L273 TraceCheckUtils]: 39: Hoare triple {34672#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34673#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:40,474 INFO L273 TraceCheckUtils]: 40: Hoare triple {34673#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34673#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:40,474 INFO L273 TraceCheckUtils]: 41: Hoare triple {34673#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34674#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:40,475 INFO L273 TraceCheckUtils]: 42: Hoare triple {34674#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34674#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:40,476 INFO L273 TraceCheckUtils]: 43: Hoare triple {34674#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34675#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:40,476 INFO L273 TraceCheckUtils]: 44: Hoare triple {34675#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34675#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:40,477 INFO L273 TraceCheckUtils]: 45: Hoare triple {34675#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34676#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:40,477 INFO L273 TraceCheckUtils]: 46: Hoare triple {34676#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34676#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:40,478 INFO L273 TraceCheckUtils]: 47: Hoare triple {34676#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34677#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:40,479 INFO L273 TraceCheckUtils]: 48: Hoare triple {34677#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34677#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:40,479 INFO L273 TraceCheckUtils]: 49: Hoare triple {34677#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34678#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:40,480 INFO L273 TraceCheckUtils]: 50: Hoare triple {34678#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34678#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:40,481 INFO L273 TraceCheckUtils]: 51: Hoare triple {34678#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34679#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:40,481 INFO L273 TraceCheckUtils]: 52: Hoare triple {34679#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34679#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:40,482 INFO L273 TraceCheckUtils]: 53: Hoare triple {34679#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34680#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:40,482 INFO L273 TraceCheckUtils]: 54: Hoare triple {34680#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34680#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:40,483 INFO L273 TraceCheckUtils]: 55: Hoare triple {34680#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34681#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:40,484 INFO L273 TraceCheckUtils]: 56: Hoare triple {34681#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34681#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:40,484 INFO L273 TraceCheckUtils]: 57: Hoare triple {34681#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34682#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:40,485 INFO L273 TraceCheckUtils]: 58: Hoare triple {34682#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34682#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:40,486 INFO L273 TraceCheckUtils]: 59: Hoare triple {34682#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34683#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:40,486 INFO L273 TraceCheckUtils]: 60: Hoare triple {34683#(<= main_~i~1 27)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34683#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:40,487 INFO L273 TraceCheckUtils]: 61: Hoare triple {34683#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34684#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:40,487 INFO L273 TraceCheckUtils]: 62: Hoare triple {34684#(<= main_~i~1 28)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34684#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:40,488 INFO L273 TraceCheckUtils]: 63: Hoare triple {34684#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34685#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:40,489 INFO L273 TraceCheckUtils]: 64: Hoare triple {34685#(<= main_~i~1 29)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34685#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:40,489 INFO L273 TraceCheckUtils]: 65: Hoare triple {34685#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34686#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:40,490 INFO L273 TraceCheckUtils]: 66: Hoare triple {34686#(<= main_~i~1 30)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34686#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:40,490 INFO L273 TraceCheckUtils]: 67: Hoare triple {34686#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34687#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:40,491 INFO L273 TraceCheckUtils]: 68: Hoare triple {34687#(<= main_~i~1 31)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34687#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:40,492 INFO L273 TraceCheckUtils]: 69: Hoare triple {34687#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34688#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:40,492 INFO L273 TraceCheckUtils]: 70: Hoare triple {34688#(<= main_~i~1 32)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34688#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:40,493 INFO L273 TraceCheckUtils]: 71: Hoare triple {34688#(<= main_~i~1 32)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34689#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:40,493 INFO L273 TraceCheckUtils]: 72: Hoare triple {34689#(<= main_~i~1 33)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34689#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:40,494 INFO L273 TraceCheckUtils]: 73: Hoare triple {34689#(<= main_~i~1 33)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34690#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:40,495 INFO L273 TraceCheckUtils]: 74: Hoare triple {34690#(<= main_~i~1 34)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34690#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:40,495 INFO L273 TraceCheckUtils]: 75: Hoare triple {34690#(<= main_~i~1 34)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34691#(<= main_~i~1 35)} is VALID [2018-11-23 12:28:40,496 INFO L273 TraceCheckUtils]: 76: Hoare triple {34691#(<= main_~i~1 35)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34691#(<= main_~i~1 35)} is VALID [2018-11-23 12:28:40,497 INFO L273 TraceCheckUtils]: 77: Hoare triple {34691#(<= main_~i~1 35)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34692#(<= main_~i~1 36)} is VALID [2018-11-23 12:28:40,497 INFO L273 TraceCheckUtils]: 78: Hoare triple {34692#(<= main_~i~1 36)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34692#(<= main_~i~1 36)} is VALID [2018-11-23 12:28:40,498 INFO L273 TraceCheckUtils]: 79: Hoare triple {34692#(<= main_~i~1 36)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34693#(<= main_~i~1 37)} is VALID [2018-11-23 12:28:40,498 INFO L273 TraceCheckUtils]: 80: Hoare triple {34693#(<= main_~i~1 37)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34693#(<= main_~i~1 37)} is VALID [2018-11-23 12:28:40,499 INFO L273 TraceCheckUtils]: 81: Hoare triple {34693#(<= main_~i~1 37)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34694#(<= main_~i~1 38)} is VALID [2018-11-23 12:28:40,500 INFO L273 TraceCheckUtils]: 82: Hoare triple {34694#(<= main_~i~1 38)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34694#(<= main_~i~1 38)} is VALID [2018-11-23 12:28:40,500 INFO L273 TraceCheckUtils]: 83: Hoare triple {34694#(<= main_~i~1 38)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34695#(<= main_~i~1 39)} is VALID [2018-11-23 12:28:40,501 INFO L273 TraceCheckUtils]: 84: Hoare triple {34695#(<= main_~i~1 39)} assume !(~i~1 < 100000); {34655#false} is VALID [2018-11-23 12:28:40,501 INFO L256 TraceCheckUtils]: 85: Hoare triple {34655#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {34654#true} is VALID [2018-11-23 12:28:40,501 INFO L273 TraceCheckUtils]: 86: Hoare triple {34654#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {34654#true} is VALID [2018-11-23 12:28:40,502 INFO L273 TraceCheckUtils]: 87: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:40,502 INFO L273 TraceCheckUtils]: 88: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:40,502 INFO L273 TraceCheckUtils]: 89: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:40,502 INFO L273 TraceCheckUtils]: 90: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:40,502 INFO L273 TraceCheckUtils]: 91: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:40,502 INFO L273 TraceCheckUtils]: 92: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:40,503 INFO L273 TraceCheckUtils]: 93: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:40,503 INFO L273 TraceCheckUtils]: 94: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:40,503 INFO L273 TraceCheckUtils]: 95: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:40,503 INFO L273 TraceCheckUtils]: 96: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:40,503 INFO L273 TraceCheckUtils]: 97: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:40,504 INFO L273 TraceCheckUtils]: 98: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:40,504 INFO L273 TraceCheckUtils]: 99: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:40,504 INFO L273 TraceCheckUtils]: 100: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:40,504 INFO L273 TraceCheckUtils]: 101: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:40,504 INFO L273 TraceCheckUtils]: 102: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:40,504 INFO L273 TraceCheckUtils]: 103: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:40,504 INFO L273 TraceCheckUtils]: 104: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:40,505 INFO L273 TraceCheckUtils]: 105: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:40,505 INFO L273 TraceCheckUtils]: 106: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:40,505 INFO L273 TraceCheckUtils]: 107: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:40,505 INFO L273 TraceCheckUtils]: 108: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:40,505 INFO L273 TraceCheckUtils]: 109: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:40,505 INFO L273 TraceCheckUtils]: 110: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:40,505 INFO L273 TraceCheckUtils]: 111: Hoare triple {34654#true} assume !(~i~0 < 100000); {34654#true} is VALID [2018-11-23 12:28:40,505 INFO L273 TraceCheckUtils]: 112: Hoare triple {34654#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {34654#true} is VALID [2018-11-23 12:28:40,505 INFO L273 TraceCheckUtils]: 113: Hoare triple {34654#true} assume true; {34654#true} is VALID [2018-11-23 12:28:40,505 INFO L268 TraceCheckUtils]: 114: Hoare quadruple {34654#true} {34655#false} #70#return; {34655#false} is VALID [2018-11-23 12:28:40,506 INFO L273 TraceCheckUtils]: 115: Hoare triple {34655#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {34655#false} is VALID [2018-11-23 12:28:40,506 INFO L256 TraceCheckUtils]: 116: Hoare triple {34655#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {34654#true} is VALID [2018-11-23 12:28:40,506 INFO L273 TraceCheckUtils]: 117: Hoare triple {34654#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {34654#true} is VALID [2018-11-23 12:28:40,506 INFO L273 TraceCheckUtils]: 118: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:40,506 INFO L273 TraceCheckUtils]: 119: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:40,506 INFO L273 TraceCheckUtils]: 120: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:40,506 INFO L273 TraceCheckUtils]: 121: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:40,506 INFO L273 TraceCheckUtils]: 122: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:40,506 INFO L273 TraceCheckUtils]: 123: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:40,506 INFO L273 TraceCheckUtils]: 124: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:40,507 INFO L273 TraceCheckUtils]: 125: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:40,507 INFO L273 TraceCheckUtils]: 126: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:40,507 INFO L273 TraceCheckUtils]: 127: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:40,507 INFO L273 TraceCheckUtils]: 128: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:40,507 INFO L273 TraceCheckUtils]: 129: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:40,507 INFO L273 TraceCheckUtils]: 130: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:40,507 INFO L273 TraceCheckUtils]: 131: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:40,507 INFO L273 TraceCheckUtils]: 132: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:40,507 INFO L273 TraceCheckUtils]: 133: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:40,507 INFO L273 TraceCheckUtils]: 134: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:40,508 INFO L273 TraceCheckUtils]: 135: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:40,508 INFO L273 TraceCheckUtils]: 136: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:40,508 INFO L273 TraceCheckUtils]: 137: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:40,508 INFO L273 TraceCheckUtils]: 138: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:40,508 INFO L273 TraceCheckUtils]: 139: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:40,508 INFO L273 TraceCheckUtils]: 140: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:40,508 INFO L273 TraceCheckUtils]: 141: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:40,508 INFO L273 TraceCheckUtils]: 142: Hoare triple {34654#true} assume !(~i~0 < 100000); {34654#true} is VALID [2018-11-23 12:28:40,508 INFO L273 TraceCheckUtils]: 143: Hoare triple {34654#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {34654#true} is VALID [2018-11-23 12:28:40,508 INFO L273 TraceCheckUtils]: 144: Hoare triple {34654#true} assume true; {34654#true} is VALID [2018-11-23 12:28:40,509 INFO L268 TraceCheckUtils]: 145: Hoare quadruple {34654#true} {34655#false} #72#return; {34655#false} is VALID [2018-11-23 12:28:40,509 INFO L273 TraceCheckUtils]: 146: Hoare triple {34655#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {34655#false} is VALID [2018-11-23 12:28:40,509 INFO L273 TraceCheckUtils]: 147: Hoare triple {34655#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34655#false} is VALID [2018-11-23 12:28:40,509 INFO L273 TraceCheckUtils]: 148: Hoare triple {34655#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34655#false} is VALID [2018-11-23 12:28:40,509 INFO L273 TraceCheckUtils]: 149: Hoare triple {34655#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34655#false} is VALID [2018-11-23 12:28:40,509 INFO L273 TraceCheckUtils]: 150: Hoare triple {34655#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34655#false} is VALID [2018-11-23 12:28:40,509 INFO L273 TraceCheckUtils]: 151: Hoare triple {34655#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34655#false} is VALID [2018-11-23 12:28:40,509 INFO L273 TraceCheckUtils]: 152: Hoare triple {34655#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34655#false} is VALID [2018-11-23 12:28:40,509 INFO L273 TraceCheckUtils]: 153: Hoare triple {34655#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34655#false} is VALID [2018-11-23 12:28:40,509 INFO L273 TraceCheckUtils]: 154: Hoare triple {34655#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34655#false} is VALID [2018-11-23 12:28:40,510 INFO L273 TraceCheckUtils]: 155: Hoare triple {34655#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34655#false} is VALID [2018-11-23 12:28:40,510 INFO L273 TraceCheckUtils]: 156: Hoare triple {34655#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34655#false} is VALID [2018-11-23 12:28:40,510 INFO L273 TraceCheckUtils]: 157: Hoare triple {34655#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34655#false} is VALID [2018-11-23 12:28:40,510 INFO L273 TraceCheckUtils]: 158: Hoare triple {34655#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34655#false} is VALID [2018-11-23 12:28:40,510 INFO L273 TraceCheckUtils]: 159: Hoare triple {34655#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34655#false} is VALID [2018-11-23 12:28:40,510 INFO L273 TraceCheckUtils]: 160: Hoare triple {34655#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34655#false} is VALID [2018-11-23 12:28:40,510 INFO L273 TraceCheckUtils]: 161: Hoare triple {34655#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34655#false} is VALID [2018-11-23 12:28:40,510 INFO L273 TraceCheckUtils]: 162: Hoare triple {34655#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34655#false} is VALID [2018-11-23 12:28:40,510 INFO L273 TraceCheckUtils]: 163: Hoare triple {34655#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34655#false} is VALID [2018-11-23 12:28:40,510 INFO L273 TraceCheckUtils]: 164: Hoare triple {34655#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34655#false} is VALID [2018-11-23 12:28:40,511 INFO L273 TraceCheckUtils]: 165: Hoare triple {34655#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34655#false} is VALID [2018-11-23 12:28:40,511 INFO L273 TraceCheckUtils]: 166: Hoare triple {34655#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34655#false} is VALID [2018-11-23 12:28:40,511 INFO L273 TraceCheckUtils]: 167: Hoare triple {34655#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34655#false} is VALID [2018-11-23 12:28:40,511 INFO L273 TraceCheckUtils]: 168: Hoare triple {34655#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34655#false} is VALID [2018-11-23 12:28:40,511 INFO L273 TraceCheckUtils]: 169: Hoare triple {34655#false} assume !(~i~2 < 99999); {34655#false} is VALID [2018-11-23 12:28:40,511 INFO L273 TraceCheckUtils]: 170: Hoare triple {34655#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {34655#false} is VALID [2018-11-23 12:28:40,511 INFO L256 TraceCheckUtils]: 171: Hoare triple {34655#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {34654#true} is VALID [2018-11-23 12:28:40,511 INFO L273 TraceCheckUtils]: 172: Hoare triple {34654#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {34654#true} is VALID [2018-11-23 12:28:40,511 INFO L273 TraceCheckUtils]: 173: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:40,512 INFO L273 TraceCheckUtils]: 174: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:40,512 INFO L273 TraceCheckUtils]: 175: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:40,512 INFO L273 TraceCheckUtils]: 176: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:40,512 INFO L273 TraceCheckUtils]: 177: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:40,512 INFO L273 TraceCheckUtils]: 178: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:40,512 INFO L273 TraceCheckUtils]: 179: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:40,512 INFO L273 TraceCheckUtils]: 180: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:40,512 INFO L273 TraceCheckUtils]: 181: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:40,512 INFO L273 TraceCheckUtils]: 182: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:40,512 INFO L273 TraceCheckUtils]: 183: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:40,513 INFO L273 TraceCheckUtils]: 184: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:40,513 INFO L273 TraceCheckUtils]: 185: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:40,513 INFO L273 TraceCheckUtils]: 186: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:40,513 INFO L273 TraceCheckUtils]: 187: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:40,513 INFO L273 TraceCheckUtils]: 188: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:40,513 INFO L273 TraceCheckUtils]: 189: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:40,513 INFO L273 TraceCheckUtils]: 190: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:40,513 INFO L273 TraceCheckUtils]: 191: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:40,513 INFO L273 TraceCheckUtils]: 192: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:40,513 INFO L273 TraceCheckUtils]: 193: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:40,514 INFO L273 TraceCheckUtils]: 194: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:40,514 INFO L273 TraceCheckUtils]: 195: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:40,514 INFO L273 TraceCheckUtils]: 196: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:40,514 INFO L273 TraceCheckUtils]: 197: Hoare triple {34654#true} assume !(~i~0 < 100000); {34654#true} is VALID [2018-11-23 12:28:40,514 INFO L273 TraceCheckUtils]: 198: Hoare triple {34654#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {34654#true} is VALID [2018-11-23 12:28:40,514 INFO L273 TraceCheckUtils]: 199: Hoare triple {34654#true} assume true; {34654#true} is VALID [2018-11-23 12:28:40,514 INFO L268 TraceCheckUtils]: 200: Hoare quadruple {34654#true} {34655#false} #74#return; {34655#false} is VALID [2018-11-23 12:28:40,514 INFO L273 TraceCheckUtils]: 201: Hoare triple {34655#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {34655#false} is VALID [2018-11-23 12:28:40,514 INFO L273 TraceCheckUtils]: 202: Hoare triple {34655#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {34655#false} is VALID [2018-11-23 12:28:40,514 INFO L273 TraceCheckUtils]: 203: Hoare triple {34655#false} assume !false; {34655#false} is VALID [2018-11-23 12:28:40,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2018-11-23 12:28:40,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:40,533 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:28:40,541 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:28:41,151 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-11-23 12:28:41,151 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:41,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:41,696 INFO L256 TraceCheckUtils]: 0: Hoare triple {34654#true} call ULTIMATE.init(); {34654#true} is VALID [2018-11-23 12:28:41,696 INFO L273 TraceCheckUtils]: 1: Hoare triple {34654#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {34654#true} is VALID [2018-11-23 12:28:41,697 INFO L273 TraceCheckUtils]: 2: Hoare triple {34654#true} assume true; {34654#true} is VALID [2018-11-23 12:28:41,697 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34654#true} {34654#true} #66#return; {34654#true} is VALID [2018-11-23 12:28:41,697 INFO L256 TraceCheckUtils]: 4: Hoare triple {34654#true} call #t~ret13 := main(); {34654#true} is VALID [2018-11-23 12:28:41,697 INFO L273 TraceCheckUtils]: 5: Hoare triple {34654#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; {34654#true} is VALID [2018-11-23 12:28:41,697 INFO L273 TraceCheckUtils]: 6: Hoare triple {34654#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:41,698 INFO L273 TraceCheckUtils]: 7: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:41,698 INFO L273 TraceCheckUtils]: 8: Hoare triple {34654#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:41,698 INFO L273 TraceCheckUtils]: 9: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:41,698 INFO L273 TraceCheckUtils]: 10: Hoare triple {34654#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:41,698 INFO L273 TraceCheckUtils]: 11: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:41,698 INFO L273 TraceCheckUtils]: 12: Hoare triple {34654#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:41,699 INFO L273 TraceCheckUtils]: 13: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:41,699 INFO L273 TraceCheckUtils]: 14: Hoare triple {34654#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:41,699 INFO L273 TraceCheckUtils]: 15: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:41,699 INFO L273 TraceCheckUtils]: 16: Hoare triple {34654#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:41,699 INFO L273 TraceCheckUtils]: 17: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:41,699 INFO L273 TraceCheckUtils]: 18: Hoare triple {34654#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:41,700 INFO L273 TraceCheckUtils]: 19: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:41,700 INFO L273 TraceCheckUtils]: 20: Hoare triple {34654#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:41,700 INFO L273 TraceCheckUtils]: 21: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:41,700 INFO L273 TraceCheckUtils]: 22: Hoare triple {34654#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:41,700 INFO L273 TraceCheckUtils]: 23: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:41,700 INFO L273 TraceCheckUtils]: 24: Hoare triple {34654#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:41,700 INFO L273 TraceCheckUtils]: 25: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:41,700 INFO L273 TraceCheckUtils]: 26: Hoare triple {34654#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:41,700 INFO L273 TraceCheckUtils]: 27: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:41,700 INFO L273 TraceCheckUtils]: 28: Hoare triple {34654#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:41,701 INFO L273 TraceCheckUtils]: 29: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:41,701 INFO L273 TraceCheckUtils]: 30: Hoare triple {34654#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:41,701 INFO L273 TraceCheckUtils]: 31: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:41,701 INFO L273 TraceCheckUtils]: 32: Hoare triple {34654#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:41,701 INFO L273 TraceCheckUtils]: 33: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:41,701 INFO L273 TraceCheckUtils]: 34: Hoare triple {34654#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:41,701 INFO L273 TraceCheckUtils]: 35: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:41,701 INFO L273 TraceCheckUtils]: 36: Hoare triple {34654#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:41,701 INFO L273 TraceCheckUtils]: 37: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:41,702 INFO L273 TraceCheckUtils]: 38: Hoare triple {34654#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:41,702 INFO L273 TraceCheckUtils]: 39: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:41,702 INFO L273 TraceCheckUtils]: 40: Hoare triple {34654#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:41,702 INFO L273 TraceCheckUtils]: 41: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:41,702 INFO L273 TraceCheckUtils]: 42: Hoare triple {34654#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:41,702 INFO L273 TraceCheckUtils]: 43: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:41,702 INFO L273 TraceCheckUtils]: 44: Hoare triple {34654#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:41,702 INFO L273 TraceCheckUtils]: 45: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:41,702 INFO L273 TraceCheckUtils]: 46: Hoare triple {34654#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:41,702 INFO L273 TraceCheckUtils]: 47: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:41,703 INFO L273 TraceCheckUtils]: 48: Hoare triple {34654#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:41,703 INFO L273 TraceCheckUtils]: 49: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:41,703 INFO L273 TraceCheckUtils]: 50: Hoare triple {34654#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:41,703 INFO L273 TraceCheckUtils]: 51: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:41,703 INFO L273 TraceCheckUtils]: 52: Hoare triple {34654#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:41,703 INFO L273 TraceCheckUtils]: 53: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:41,703 INFO L273 TraceCheckUtils]: 54: Hoare triple {34654#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:41,703 INFO L273 TraceCheckUtils]: 55: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:41,703 INFO L273 TraceCheckUtils]: 56: Hoare triple {34654#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:41,704 INFO L273 TraceCheckUtils]: 57: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:41,704 INFO L273 TraceCheckUtils]: 58: Hoare triple {34654#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:41,704 INFO L273 TraceCheckUtils]: 59: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:41,704 INFO L273 TraceCheckUtils]: 60: Hoare triple {34654#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:41,704 INFO L273 TraceCheckUtils]: 61: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:41,704 INFO L273 TraceCheckUtils]: 62: Hoare triple {34654#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:41,704 INFO L273 TraceCheckUtils]: 63: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:41,704 INFO L273 TraceCheckUtils]: 64: Hoare triple {34654#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:41,704 INFO L273 TraceCheckUtils]: 65: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:41,704 INFO L273 TraceCheckUtils]: 66: Hoare triple {34654#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:41,705 INFO L273 TraceCheckUtils]: 67: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:41,705 INFO L273 TraceCheckUtils]: 68: Hoare triple {34654#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:41,705 INFO L273 TraceCheckUtils]: 69: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:41,705 INFO L273 TraceCheckUtils]: 70: Hoare triple {34654#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:41,705 INFO L273 TraceCheckUtils]: 71: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:41,705 INFO L273 TraceCheckUtils]: 72: Hoare triple {34654#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:41,705 INFO L273 TraceCheckUtils]: 73: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:41,705 INFO L273 TraceCheckUtils]: 74: Hoare triple {34654#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:41,705 INFO L273 TraceCheckUtils]: 75: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:41,705 INFO L273 TraceCheckUtils]: 76: Hoare triple {34654#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:41,706 INFO L273 TraceCheckUtils]: 77: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:41,706 INFO L273 TraceCheckUtils]: 78: Hoare triple {34654#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:41,706 INFO L273 TraceCheckUtils]: 79: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:41,706 INFO L273 TraceCheckUtils]: 80: Hoare triple {34654#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:41,706 INFO L273 TraceCheckUtils]: 81: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:41,706 INFO L273 TraceCheckUtils]: 82: Hoare triple {34654#true} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {34654#true} is VALID [2018-11-23 12:28:41,706 INFO L273 TraceCheckUtils]: 83: Hoare triple {34654#true} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {34654#true} is VALID [2018-11-23 12:28:41,706 INFO L273 TraceCheckUtils]: 84: Hoare triple {34654#true} assume !(~i~1 < 100000); {34654#true} is VALID [2018-11-23 12:28:41,706 INFO L256 TraceCheckUtils]: 85: Hoare triple {34654#true} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {34654#true} is VALID [2018-11-23 12:28:41,706 INFO L273 TraceCheckUtils]: 86: Hoare triple {34654#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {34654#true} is VALID [2018-11-23 12:28:41,707 INFO L273 TraceCheckUtils]: 87: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:41,707 INFO L273 TraceCheckUtils]: 88: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:41,707 INFO L273 TraceCheckUtils]: 89: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:41,707 INFO L273 TraceCheckUtils]: 90: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:41,707 INFO L273 TraceCheckUtils]: 91: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:41,707 INFO L273 TraceCheckUtils]: 92: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:41,707 INFO L273 TraceCheckUtils]: 93: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:41,707 INFO L273 TraceCheckUtils]: 94: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:41,707 INFO L273 TraceCheckUtils]: 95: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:41,708 INFO L273 TraceCheckUtils]: 96: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:41,708 INFO L273 TraceCheckUtils]: 97: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:41,708 INFO L273 TraceCheckUtils]: 98: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:41,708 INFO L273 TraceCheckUtils]: 99: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:41,708 INFO L273 TraceCheckUtils]: 100: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:41,708 INFO L273 TraceCheckUtils]: 101: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:41,708 INFO L273 TraceCheckUtils]: 102: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:41,708 INFO L273 TraceCheckUtils]: 103: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:41,708 INFO L273 TraceCheckUtils]: 104: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:41,708 INFO L273 TraceCheckUtils]: 105: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:41,709 INFO L273 TraceCheckUtils]: 106: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:41,709 INFO L273 TraceCheckUtils]: 107: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:41,709 INFO L273 TraceCheckUtils]: 108: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:41,709 INFO L273 TraceCheckUtils]: 109: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:41,709 INFO L273 TraceCheckUtils]: 110: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:41,709 INFO L273 TraceCheckUtils]: 111: Hoare triple {34654#true} assume !(~i~0 < 100000); {34654#true} is VALID [2018-11-23 12:28:41,709 INFO L273 TraceCheckUtils]: 112: Hoare triple {34654#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {34654#true} is VALID [2018-11-23 12:28:41,709 INFO L273 TraceCheckUtils]: 113: Hoare triple {34654#true} assume true; {34654#true} is VALID [2018-11-23 12:28:41,709 INFO L268 TraceCheckUtils]: 114: Hoare quadruple {34654#true} {34654#true} #70#return; {34654#true} is VALID [2018-11-23 12:28:41,709 INFO L273 TraceCheckUtils]: 115: Hoare triple {34654#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {34654#true} is VALID [2018-11-23 12:28:41,710 INFO L256 TraceCheckUtils]: 116: Hoare triple {34654#true} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {34654#true} is VALID [2018-11-23 12:28:41,710 INFO L273 TraceCheckUtils]: 117: Hoare triple {34654#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {34654#true} is VALID [2018-11-23 12:28:41,710 INFO L273 TraceCheckUtils]: 118: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:41,710 INFO L273 TraceCheckUtils]: 119: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:41,710 INFO L273 TraceCheckUtils]: 120: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:41,710 INFO L273 TraceCheckUtils]: 121: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:41,710 INFO L273 TraceCheckUtils]: 122: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:41,710 INFO L273 TraceCheckUtils]: 123: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:41,710 INFO L273 TraceCheckUtils]: 124: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:41,710 INFO L273 TraceCheckUtils]: 125: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:41,711 INFO L273 TraceCheckUtils]: 126: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:41,711 INFO L273 TraceCheckUtils]: 127: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:41,711 INFO L273 TraceCheckUtils]: 128: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:41,711 INFO L273 TraceCheckUtils]: 129: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:41,711 INFO L273 TraceCheckUtils]: 130: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:41,711 INFO L273 TraceCheckUtils]: 131: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:41,711 INFO L273 TraceCheckUtils]: 132: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:41,711 INFO L273 TraceCheckUtils]: 133: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:41,711 INFO L273 TraceCheckUtils]: 134: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:41,712 INFO L273 TraceCheckUtils]: 135: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:41,712 INFO L273 TraceCheckUtils]: 136: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:41,712 INFO L273 TraceCheckUtils]: 137: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:41,712 INFO L273 TraceCheckUtils]: 138: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:41,712 INFO L273 TraceCheckUtils]: 139: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:41,712 INFO L273 TraceCheckUtils]: 140: Hoare triple {34654#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:28:41,712 INFO L273 TraceCheckUtils]: 141: Hoare triple {34654#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34654#true} is VALID [2018-11-23 12:28:41,712 INFO L273 TraceCheckUtils]: 142: Hoare triple {34654#true} assume !(~i~0 < 100000); {34654#true} is VALID [2018-11-23 12:28:41,712 INFO L273 TraceCheckUtils]: 143: Hoare triple {34654#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {34654#true} is VALID [2018-11-23 12:28:41,712 INFO L273 TraceCheckUtils]: 144: Hoare triple {34654#true} assume true; {34654#true} is VALID [2018-11-23 12:28:41,713 INFO L268 TraceCheckUtils]: 145: Hoare quadruple {34654#true} {34654#true} #72#return; {34654#true} is VALID [2018-11-23 12:28:41,713 INFO L273 TraceCheckUtils]: 146: Hoare triple {34654#true} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {34654#true} is VALID [2018-11-23 12:28:41,713 INFO L273 TraceCheckUtils]: 147: Hoare triple {34654#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34654#true} is VALID [2018-11-23 12:28:41,713 INFO L273 TraceCheckUtils]: 148: Hoare triple {34654#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34654#true} is VALID [2018-11-23 12:28:41,713 INFO L273 TraceCheckUtils]: 149: Hoare triple {34654#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34654#true} is VALID [2018-11-23 12:28:41,713 INFO L273 TraceCheckUtils]: 150: Hoare triple {34654#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34654#true} is VALID [2018-11-23 12:28:41,713 INFO L273 TraceCheckUtils]: 151: Hoare triple {34654#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34654#true} is VALID [2018-11-23 12:28:41,713 INFO L273 TraceCheckUtils]: 152: Hoare triple {34654#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34654#true} is VALID [2018-11-23 12:28:41,713 INFO L273 TraceCheckUtils]: 153: Hoare triple {34654#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34654#true} is VALID [2018-11-23 12:28:41,713 INFO L273 TraceCheckUtils]: 154: Hoare triple {34654#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34654#true} is VALID [2018-11-23 12:28:41,714 INFO L273 TraceCheckUtils]: 155: Hoare triple {34654#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34654#true} is VALID [2018-11-23 12:28:41,714 INFO L273 TraceCheckUtils]: 156: Hoare triple {34654#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34654#true} is VALID [2018-11-23 12:28:41,714 INFO L273 TraceCheckUtils]: 157: Hoare triple {34654#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34654#true} is VALID [2018-11-23 12:28:41,714 INFO L273 TraceCheckUtils]: 158: Hoare triple {34654#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34654#true} is VALID [2018-11-23 12:28:41,714 INFO L273 TraceCheckUtils]: 159: Hoare triple {34654#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34654#true} is VALID [2018-11-23 12:28:41,714 INFO L273 TraceCheckUtils]: 160: Hoare triple {34654#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34654#true} is VALID [2018-11-23 12:28:41,714 INFO L273 TraceCheckUtils]: 161: Hoare triple {34654#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34654#true} is VALID [2018-11-23 12:28:41,714 INFO L273 TraceCheckUtils]: 162: Hoare triple {34654#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34654#true} is VALID [2018-11-23 12:28:41,714 INFO L273 TraceCheckUtils]: 163: Hoare triple {34654#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34654#true} is VALID [2018-11-23 12:28:41,715 INFO L273 TraceCheckUtils]: 164: Hoare triple {34654#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34654#true} is VALID [2018-11-23 12:28:41,715 INFO L273 TraceCheckUtils]: 165: Hoare triple {34654#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34654#true} is VALID [2018-11-23 12:28:41,715 INFO L273 TraceCheckUtils]: 166: Hoare triple {34654#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34654#true} is VALID [2018-11-23 12:28:41,715 INFO L273 TraceCheckUtils]: 167: Hoare triple {34654#true} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {34654#true} is VALID [2018-11-23 12:28:41,715 INFO L273 TraceCheckUtils]: 168: Hoare triple {34654#true} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {34654#true} is VALID [2018-11-23 12:28:41,715 INFO L273 TraceCheckUtils]: 169: Hoare triple {34654#true} assume !(~i~2 < 99999); {34654#true} is VALID [2018-11-23 12:28:41,715 INFO L273 TraceCheckUtils]: 170: Hoare triple {34654#true} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {34654#true} is VALID [2018-11-23 12:28:41,715 INFO L256 TraceCheckUtils]: 171: Hoare triple {34654#true} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {34654#true} is VALID [2018-11-23 12:28:41,716 INFO L273 TraceCheckUtils]: 172: Hoare triple {34654#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {35215#(<= bor_~i~0 1)} is VALID [2018-11-23 12:28:41,716 INFO L273 TraceCheckUtils]: 173: Hoare triple {35215#(<= bor_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {35215#(<= bor_~i~0 1)} is VALID [2018-11-23 12:28:41,717 INFO L273 TraceCheckUtils]: 174: Hoare triple {35215#(<= bor_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35222#(<= bor_~i~0 2)} is VALID [2018-11-23 12:28:41,717 INFO L273 TraceCheckUtils]: 175: Hoare triple {35222#(<= bor_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {35222#(<= bor_~i~0 2)} is VALID [2018-11-23 12:28:41,717 INFO L273 TraceCheckUtils]: 176: Hoare triple {35222#(<= bor_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35229#(<= bor_~i~0 3)} is VALID [2018-11-23 12:28:41,718 INFO L273 TraceCheckUtils]: 177: Hoare triple {35229#(<= bor_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {35229#(<= bor_~i~0 3)} is VALID [2018-11-23 12:28:41,718 INFO L273 TraceCheckUtils]: 178: Hoare triple {35229#(<= bor_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35236#(<= bor_~i~0 4)} is VALID [2018-11-23 12:28:41,718 INFO L273 TraceCheckUtils]: 179: Hoare triple {35236#(<= bor_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {35236#(<= bor_~i~0 4)} is VALID [2018-11-23 12:28:41,719 INFO L273 TraceCheckUtils]: 180: Hoare triple {35236#(<= bor_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35243#(<= bor_~i~0 5)} is VALID [2018-11-23 12:28:41,719 INFO L273 TraceCheckUtils]: 181: Hoare triple {35243#(<= bor_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {35243#(<= bor_~i~0 5)} is VALID [2018-11-23 12:28:41,720 INFO L273 TraceCheckUtils]: 182: Hoare triple {35243#(<= bor_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35250#(<= bor_~i~0 6)} is VALID [2018-11-23 12:28:41,720 INFO L273 TraceCheckUtils]: 183: Hoare triple {35250#(<= bor_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {35250#(<= bor_~i~0 6)} is VALID [2018-11-23 12:28:41,720 INFO L273 TraceCheckUtils]: 184: Hoare triple {35250#(<= bor_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35257#(<= bor_~i~0 7)} is VALID [2018-11-23 12:28:41,721 INFO L273 TraceCheckUtils]: 185: Hoare triple {35257#(<= bor_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {35257#(<= bor_~i~0 7)} is VALID [2018-11-23 12:28:41,721 INFO L273 TraceCheckUtils]: 186: Hoare triple {35257#(<= bor_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35264#(<= bor_~i~0 8)} is VALID [2018-11-23 12:28:41,722 INFO L273 TraceCheckUtils]: 187: Hoare triple {35264#(<= bor_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {35264#(<= bor_~i~0 8)} is VALID [2018-11-23 12:28:41,723 INFO L273 TraceCheckUtils]: 188: Hoare triple {35264#(<= bor_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35271#(<= bor_~i~0 9)} is VALID [2018-11-23 12:28:41,723 INFO L273 TraceCheckUtils]: 189: Hoare triple {35271#(<= bor_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {35271#(<= bor_~i~0 9)} is VALID [2018-11-23 12:28:41,724 INFO L273 TraceCheckUtils]: 190: Hoare triple {35271#(<= bor_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35278#(<= bor_~i~0 10)} is VALID [2018-11-23 12:28:41,724 INFO L273 TraceCheckUtils]: 191: Hoare triple {35278#(<= bor_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {35278#(<= bor_~i~0 10)} is VALID [2018-11-23 12:28:41,725 INFO L273 TraceCheckUtils]: 192: Hoare triple {35278#(<= bor_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35285#(<= bor_~i~0 11)} is VALID [2018-11-23 12:28:41,726 INFO L273 TraceCheckUtils]: 193: Hoare triple {35285#(<= bor_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {35285#(<= bor_~i~0 11)} is VALID [2018-11-23 12:28:41,726 INFO L273 TraceCheckUtils]: 194: Hoare triple {35285#(<= bor_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35292#(<= bor_~i~0 12)} is VALID [2018-11-23 12:28:41,727 INFO L273 TraceCheckUtils]: 195: Hoare triple {35292#(<= bor_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {35292#(<= bor_~i~0 12)} is VALID [2018-11-23 12:28:41,728 INFO L273 TraceCheckUtils]: 196: Hoare triple {35292#(<= bor_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35299#(<= bor_~i~0 13)} is VALID [2018-11-23 12:28:41,728 INFO L273 TraceCheckUtils]: 197: Hoare triple {35299#(<= bor_~i~0 13)} assume !(~i~0 < 100000); {34655#false} is VALID [2018-11-23 12:28:41,728 INFO L273 TraceCheckUtils]: 198: Hoare triple {34655#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {34655#false} is VALID [2018-11-23 12:28:41,729 INFO L273 TraceCheckUtils]: 199: Hoare triple {34655#false} assume true; {34655#false} is VALID [2018-11-23 12:28:41,729 INFO L268 TraceCheckUtils]: 200: Hoare quadruple {34655#false} {34654#true} #74#return; {34655#false} is VALID [2018-11-23 12:28:41,729 INFO L273 TraceCheckUtils]: 201: Hoare triple {34655#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {34655#false} is VALID [2018-11-23 12:28:41,729 INFO L273 TraceCheckUtils]: 202: Hoare triple {34655#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {34655#false} is VALID [2018-11-23 12:28:41,729 INFO L273 TraceCheckUtils]: 203: Hoare triple {34655#false} assume !false; {34655#false} is VALID [2018-11-23 12:28:41,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 632 proven. 144 refuted. 0 times theorem prover too weak. 2249 trivial. 0 not checked. [2018-11-23 12:28:41,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:41,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 15] total 55 [2018-11-23 12:28:41,767 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 204 [2018-11-23 12:28:41,767 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:41,768 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states. [2018-11-23 12:28:41,937 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:41,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-11-23 12:28:41,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-11-23 12:28:41,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=965, Invalid=2005, Unknown=0, NotChecked=0, Total=2970 [2018-11-23 12:28:41,939 INFO L87 Difference]: Start difference. First operand 147 states and 151 transitions. Second operand 55 states. [2018-11-23 12:28:42,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:42,773 INFO L93 Difference]: Finished difference Result 215 states and 227 transitions. [2018-11-23 12:28:42,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-23 12:28:42,773 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 204 [2018-11-23 12:28:42,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:42,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 12:28:42,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 162 transitions. [2018-11-23 12:28:42,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 12:28:42,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 162 transitions. [2018-11-23 12:28:42,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states and 162 transitions. [2018-11-23 12:28:42,934 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:42,937 INFO L225 Difference]: With dead ends: 215 [2018-11-23 12:28:42,937 INFO L226 Difference]: Without dead ends: 153 [2018-11-23 12:28:42,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=965, Invalid=2005, Unknown=0, NotChecked=0, Total=2970 [2018-11-23 12:28:42,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-11-23 12:28:42,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2018-11-23 12:28:42,990 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:42,990 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand 151 states. [2018-11-23 12:28:42,990 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 151 states. [2018-11-23 12:28:42,990 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 151 states. [2018-11-23 12:28:42,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:42,994 INFO L93 Difference]: Finished difference Result 153 states and 157 transitions. [2018-11-23 12:28:42,994 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2018-11-23 12:28:42,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:42,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:42,995 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand 153 states. [2018-11-23 12:28:42,995 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 153 states. [2018-11-23 12:28:42,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:42,997 INFO L93 Difference]: Finished difference Result 153 states and 157 transitions. [2018-11-23 12:28:42,997 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2018-11-23 12:28:42,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:42,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:42,997 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:42,998 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:42,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-11-23 12:28:42,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 155 transitions. [2018-11-23 12:28:43,000 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 155 transitions. Word has length 204 [2018-11-23 12:28:43,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:43,000 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 155 transitions. [2018-11-23 12:28:43,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-11-23 12:28:43,000 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 155 transitions. [2018-11-23 12:28:43,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-11-23 12:28:43,001 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:43,001 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:28:43,001 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:43,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:43,002 INFO L82 PathProgramCache]: Analyzing trace with hash -15611861, now seen corresponding path program 40 times [2018-11-23 12:28:43,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:43,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:43,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:43,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:43,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:43,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:44,069 INFO L256 TraceCheckUtils]: 0: Hoare triple {36171#true} call ULTIMATE.init(); {36171#true} is VALID [2018-11-23 12:28:44,070 INFO L273 TraceCheckUtils]: 1: Hoare triple {36171#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {36171#true} is VALID [2018-11-23 12:28:44,070 INFO L273 TraceCheckUtils]: 2: Hoare triple {36171#true} assume true; {36171#true} is VALID [2018-11-23 12:28:44,070 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36171#true} {36171#true} #66#return; {36171#true} is VALID [2018-11-23 12:28:44,070 INFO L256 TraceCheckUtils]: 4: Hoare triple {36171#true} call #t~ret13 := main(); {36171#true} is VALID [2018-11-23 12:28:44,071 INFO L273 TraceCheckUtils]: 5: Hoare triple {36171#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; {36173#(= main_~i~1 0)} is VALID [2018-11-23 12:28:44,071 INFO L273 TraceCheckUtils]: 6: Hoare triple {36173#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36173#(= main_~i~1 0)} is VALID [2018-11-23 12:28:44,072 INFO L273 TraceCheckUtils]: 7: Hoare triple {36173#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36174#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:44,072 INFO L273 TraceCheckUtils]: 8: Hoare triple {36174#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36174#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:44,073 INFO L273 TraceCheckUtils]: 9: Hoare triple {36174#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36175#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:44,073 INFO L273 TraceCheckUtils]: 10: Hoare triple {36175#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36175#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:44,074 INFO L273 TraceCheckUtils]: 11: Hoare triple {36175#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36176#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:44,074 INFO L273 TraceCheckUtils]: 12: Hoare triple {36176#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36176#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:44,074 INFO L273 TraceCheckUtils]: 13: Hoare triple {36176#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36177#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:44,075 INFO L273 TraceCheckUtils]: 14: Hoare triple {36177#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36177#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:44,076 INFO L273 TraceCheckUtils]: 15: Hoare triple {36177#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36178#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:44,076 INFO L273 TraceCheckUtils]: 16: Hoare triple {36178#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36178#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:44,077 INFO L273 TraceCheckUtils]: 17: Hoare triple {36178#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36179#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:44,077 INFO L273 TraceCheckUtils]: 18: Hoare triple {36179#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36179#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:44,078 INFO L273 TraceCheckUtils]: 19: Hoare triple {36179#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36180#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:44,078 INFO L273 TraceCheckUtils]: 20: Hoare triple {36180#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36180#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:44,079 INFO L273 TraceCheckUtils]: 21: Hoare triple {36180#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36181#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:44,080 INFO L273 TraceCheckUtils]: 22: Hoare triple {36181#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36181#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:44,080 INFO L273 TraceCheckUtils]: 23: Hoare triple {36181#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36182#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:44,081 INFO L273 TraceCheckUtils]: 24: Hoare triple {36182#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36182#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:44,081 INFO L273 TraceCheckUtils]: 25: Hoare triple {36182#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36183#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:44,082 INFO L273 TraceCheckUtils]: 26: Hoare triple {36183#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36183#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:44,083 INFO L273 TraceCheckUtils]: 27: Hoare triple {36183#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36184#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:44,083 INFO L273 TraceCheckUtils]: 28: Hoare triple {36184#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36184#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:44,084 INFO L273 TraceCheckUtils]: 29: Hoare triple {36184#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36185#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:44,084 INFO L273 TraceCheckUtils]: 30: Hoare triple {36185#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36185#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:44,085 INFO L273 TraceCheckUtils]: 31: Hoare triple {36185#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36186#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:44,085 INFO L273 TraceCheckUtils]: 32: Hoare triple {36186#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36186#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:44,086 INFO L273 TraceCheckUtils]: 33: Hoare triple {36186#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36187#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:44,086 INFO L273 TraceCheckUtils]: 34: Hoare triple {36187#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36187#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:44,087 INFO L273 TraceCheckUtils]: 35: Hoare triple {36187#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36188#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:44,088 INFO L273 TraceCheckUtils]: 36: Hoare triple {36188#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36188#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:44,088 INFO L273 TraceCheckUtils]: 37: Hoare triple {36188#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36189#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:44,089 INFO L273 TraceCheckUtils]: 38: Hoare triple {36189#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36189#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:44,089 INFO L273 TraceCheckUtils]: 39: Hoare triple {36189#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36190#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:44,090 INFO L273 TraceCheckUtils]: 40: Hoare triple {36190#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36190#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:44,091 INFO L273 TraceCheckUtils]: 41: Hoare triple {36190#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36191#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:44,091 INFO L273 TraceCheckUtils]: 42: Hoare triple {36191#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36191#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:44,092 INFO L273 TraceCheckUtils]: 43: Hoare triple {36191#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36192#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:44,092 INFO L273 TraceCheckUtils]: 44: Hoare triple {36192#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36192#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:44,093 INFO L273 TraceCheckUtils]: 45: Hoare triple {36192#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36193#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:44,093 INFO L273 TraceCheckUtils]: 46: Hoare triple {36193#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36193#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:44,094 INFO L273 TraceCheckUtils]: 47: Hoare triple {36193#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36194#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:44,095 INFO L273 TraceCheckUtils]: 48: Hoare triple {36194#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36194#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:44,095 INFO L273 TraceCheckUtils]: 49: Hoare triple {36194#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36195#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:44,096 INFO L273 TraceCheckUtils]: 50: Hoare triple {36195#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36195#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:44,096 INFO L273 TraceCheckUtils]: 51: Hoare triple {36195#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36196#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:44,097 INFO L273 TraceCheckUtils]: 52: Hoare triple {36196#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36196#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:44,098 INFO L273 TraceCheckUtils]: 53: Hoare triple {36196#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36197#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:44,098 INFO L273 TraceCheckUtils]: 54: Hoare triple {36197#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36197#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:44,099 INFO L273 TraceCheckUtils]: 55: Hoare triple {36197#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36198#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:44,099 INFO L273 TraceCheckUtils]: 56: Hoare triple {36198#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36198#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:44,100 INFO L273 TraceCheckUtils]: 57: Hoare triple {36198#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36199#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:44,100 INFO L273 TraceCheckUtils]: 58: Hoare triple {36199#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36199#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:44,101 INFO L273 TraceCheckUtils]: 59: Hoare triple {36199#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36200#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:44,102 INFO L273 TraceCheckUtils]: 60: Hoare triple {36200#(<= main_~i~1 27)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36200#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:44,102 INFO L273 TraceCheckUtils]: 61: Hoare triple {36200#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36201#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:44,103 INFO L273 TraceCheckUtils]: 62: Hoare triple {36201#(<= main_~i~1 28)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36201#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:44,103 INFO L273 TraceCheckUtils]: 63: Hoare triple {36201#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36202#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:44,104 INFO L273 TraceCheckUtils]: 64: Hoare triple {36202#(<= main_~i~1 29)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36202#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:44,104 INFO L273 TraceCheckUtils]: 65: Hoare triple {36202#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36203#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:44,105 INFO L273 TraceCheckUtils]: 66: Hoare triple {36203#(<= main_~i~1 30)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36203#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:44,106 INFO L273 TraceCheckUtils]: 67: Hoare triple {36203#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36204#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:44,106 INFO L273 TraceCheckUtils]: 68: Hoare triple {36204#(<= main_~i~1 31)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36204#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:44,107 INFO L273 TraceCheckUtils]: 69: Hoare triple {36204#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36205#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:44,107 INFO L273 TraceCheckUtils]: 70: Hoare triple {36205#(<= main_~i~1 32)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36205#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:44,108 INFO L273 TraceCheckUtils]: 71: Hoare triple {36205#(<= main_~i~1 32)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36206#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:44,108 INFO L273 TraceCheckUtils]: 72: Hoare triple {36206#(<= main_~i~1 33)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36206#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:44,109 INFO L273 TraceCheckUtils]: 73: Hoare triple {36206#(<= main_~i~1 33)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36207#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:44,110 INFO L273 TraceCheckUtils]: 74: Hoare triple {36207#(<= main_~i~1 34)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36207#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:44,110 INFO L273 TraceCheckUtils]: 75: Hoare triple {36207#(<= main_~i~1 34)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36208#(<= main_~i~1 35)} is VALID [2018-11-23 12:28:44,111 INFO L273 TraceCheckUtils]: 76: Hoare triple {36208#(<= main_~i~1 35)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36208#(<= main_~i~1 35)} is VALID [2018-11-23 12:28:44,111 INFO L273 TraceCheckUtils]: 77: Hoare triple {36208#(<= main_~i~1 35)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36209#(<= main_~i~1 36)} is VALID [2018-11-23 12:28:44,112 INFO L273 TraceCheckUtils]: 78: Hoare triple {36209#(<= main_~i~1 36)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36209#(<= main_~i~1 36)} is VALID [2018-11-23 12:28:44,113 INFO L273 TraceCheckUtils]: 79: Hoare triple {36209#(<= main_~i~1 36)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36210#(<= main_~i~1 37)} is VALID [2018-11-23 12:28:44,113 INFO L273 TraceCheckUtils]: 80: Hoare triple {36210#(<= main_~i~1 37)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36210#(<= main_~i~1 37)} is VALID [2018-11-23 12:28:44,114 INFO L273 TraceCheckUtils]: 81: Hoare triple {36210#(<= main_~i~1 37)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36211#(<= main_~i~1 38)} is VALID [2018-11-23 12:28:44,114 INFO L273 TraceCheckUtils]: 82: Hoare triple {36211#(<= main_~i~1 38)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36211#(<= main_~i~1 38)} is VALID [2018-11-23 12:28:44,115 INFO L273 TraceCheckUtils]: 83: Hoare triple {36211#(<= main_~i~1 38)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36212#(<= main_~i~1 39)} is VALID [2018-11-23 12:28:44,115 INFO L273 TraceCheckUtils]: 84: Hoare triple {36212#(<= main_~i~1 39)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36212#(<= main_~i~1 39)} is VALID [2018-11-23 12:28:44,116 INFO L273 TraceCheckUtils]: 85: Hoare triple {36212#(<= main_~i~1 39)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36213#(<= main_~i~1 40)} is VALID [2018-11-23 12:28:44,117 INFO L273 TraceCheckUtils]: 86: Hoare triple {36213#(<= main_~i~1 40)} assume !(~i~1 < 100000); {36172#false} is VALID [2018-11-23 12:28:44,117 INFO L256 TraceCheckUtils]: 87: Hoare triple {36172#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {36171#true} is VALID [2018-11-23 12:28:44,117 INFO L273 TraceCheckUtils]: 88: Hoare triple {36171#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {36171#true} is VALID [2018-11-23 12:28:44,117 INFO L273 TraceCheckUtils]: 89: Hoare triple {36171#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:44,117 INFO L273 TraceCheckUtils]: 90: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:44,117 INFO L273 TraceCheckUtils]: 91: Hoare triple {36171#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:44,118 INFO L273 TraceCheckUtils]: 92: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:44,118 INFO L273 TraceCheckUtils]: 93: Hoare triple {36171#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:44,118 INFO L273 TraceCheckUtils]: 94: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:44,118 INFO L273 TraceCheckUtils]: 95: Hoare triple {36171#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:44,118 INFO L273 TraceCheckUtils]: 96: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:44,118 INFO L273 TraceCheckUtils]: 97: Hoare triple {36171#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:44,119 INFO L273 TraceCheckUtils]: 98: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:44,119 INFO L273 TraceCheckUtils]: 99: Hoare triple {36171#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:44,119 INFO L273 TraceCheckUtils]: 100: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:44,119 INFO L273 TraceCheckUtils]: 101: Hoare triple {36171#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:44,119 INFO L273 TraceCheckUtils]: 102: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:44,119 INFO L273 TraceCheckUtils]: 103: Hoare triple {36171#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:44,120 INFO L273 TraceCheckUtils]: 104: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:44,120 INFO L273 TraceCheckUtils]: 105: Hoare triple {36171#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:44,120 INFO L273 TraceCheckUtils]: 106: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:44,120 INFO L273 TraceCheckUtils]: 107: Hoare triple {36171#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:44,120 INFO L273 TraceCheckUtils]: 108: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:44,120 INFO L273 TraceCheckUtils]: 109: Hoare triple {36171#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:44,120 INFO L273 TraceCheckUtils]: 110: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:44,121 INFO L273 TraceCheckUtils]: 111: Hoare triple {36171#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:44,121 INFO L273 TraceCheckUtils]: 112: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:44,121 INFO L273 TraceCheckUtils]: 113: Hoare triple {36171#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:44,121 INFO L273 TraceCheckUtils]: 114: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:44,121 INFO L273 TraceCheckUtils]: 115: Hoare triple {36171#true} assume !(~i~0 < 100000); {36171#true} is VALID [2018-11-23 12:28:44,121 INFO L273 TraceCheckUtils]: 116: Hoare triple {36171#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {36171#true} is VALID [2018-11-23 12:28:44,121 INFO L273 TraceCheckUtils]: 117: Hoare triple {36171#true} assume true; {36171#true} is VALID [2018-11-23 12:28:44,121 INFO L268 TraceCheckUtils]: 118: Hoare quadruple {36171#true} {36172#false} #70#return; {36172#false} is VALID [2018-11-23 12:28:44,121 INFO L273 TraceCheckUtils]: 119: Hoare triple {36172#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {36172#false} is VALID [2018-11-23 12:28:44,121 INFO L256 TraceCheckUtils]: 120: Hoare triple {36172#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {36171#true} is VALID [2018-11-23 12:28:44,122 INFO L273 TraceCheckUtils]: 121: Hoare triple {36171#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {36171#true} is VALID [2018-11-23 12:28:44,122 INFO L273 TraceCheckUtils]: 122: Hoare triple {36171#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:44,122 INFO L273 TraceCheckUtils]: 123: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:44,122 INFO L273 TraceCheckUtils]: 124: Hoare triple {36171#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:44,122 INFO L273 TraceCheckUtils]: 125: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:44,122 INFO L273 TraceCheckUtils]: 126: Hoare triple {36171#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:44,122 INFO L273 TraceCheckUtils]: 127: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:44,122 INFO L273 TraceCheckUtils]: 128: Hoare triple {36171#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:44,122 INFO L273 TraceCheckUtils]: 129: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:44,122 INFO L273 TraceCheckUtils]: 130: Hoare triple {36171#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:44,123 INFO L273 TraceCheckUtils]: 131: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:44,123 INFO L273 TraceCheckUtils]: 132: Hoare triple {36171#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:44,123 INFO L273 TraceCheckUtils]: 133: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:44,123 INFO L273 TraceCheckUtils]: 134: Hoare triple {36171#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:44,123 INFO L273 TraceCheckUtils]: 135: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:44,123 INFO L273 TraceCheckUtils]: 136: Hoare triple {36171#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:44,123 INFO L273 TraceCheckUtils]: 137: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:44,123 INFO L273 TraceCheckUtils]: 138: Hoare triple {36171#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:44,123 INFO L273 TraceCheckUtils]: 139: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:44,123 INFO L273 TraceCheckUtils]: 140: Hoare triple {36171#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:44,124 INFO L273 TraceCheckUtils]: 141: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:44,124 INFO L273 TraceCheckUtils]: 142: Hoare triple {36171#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:44,124 INFO L273 TraceCheckUtils]: 143: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:44,124 INFO L273 TraceCheckUtils]: 144: Hoare triple {36171#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:44,124 INFO L273 TraceCheckUtils]: 145: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:44,124 INFO L273 TraceCheckUtils]: 146: Hoare triple {36171#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:44,124 INFO L273 TraceCheckUtils]: 147: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:44,124 INFO L273 TraceCheckUtils]: 148: Hoare triple {36171#true} assume !(~i~0 < 100000); {36171#true} is VALID [2018-11-23 12:28:44,124 INFO L273 TraceCheckUtils]: 149: Hoare triple {36171#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {36171#true} is VALID [2018-11-23 12:28:44,124 INFO L273 TraceCheckUtils]: 150: Hoare triple {36171#true} assume true; {36171#true} is VALID [2018-11-23 12:28:44,125 INFO L268 TraceCheckUtils]: 151: Hoare quadruple {36171#true} {36172#false} #72#return; {36172#false} is VALID [2018-11-23 12:28:44,125 INFO L273 TraceCheckUtils]: 152: Hoare triple {36172#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {36172#false} is VALID [2018-11-23 12:28:44,125 INFO L273 TraceCheckUtils]: 153: Hoare triple {36172#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36172#false} is VALID [2018-11-23 12:28:44,125 INFO L273 TraceCheckUtils]: 154: Hoare triple {36172#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36172#false} is VALID [2018-11-23 12:28:44,125 INFO L273 TraceCheckUtils]: 155: Hoare triple {36172#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36172#false} is VALID [2018-11-23 12:28:44,125 INFO L273 TraceCheckUtils]: 156: Hoare triple {36172#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36172#false} is VALID [2018-11-23 12:28:44,125 INFO L273 TraceCheckUtils]: 157: Hoare triple {36172#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36172#false} is VALID [2018-11-23 12:28:44,125 INFO L273 TraceCheckUtils]: 158: Hoare triple {36172#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36172#false} is VALID [2018-11-23 12:28:44,125 INFO L273 TraceCheckUtils]: 159: Hoare triple {36172#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36172#false} is VALID [2018-11-23 12:28:44,125 INFO L273 TraceCheckUtils]: 160: Hoare triple {36172#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36172#false} is VALID [2018-11-23 12:28:44,126 INFO L273 TraceCheckUtils]: 161: Hoare triple {36172#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36172#false} is VALID [2018-11-23 12:28:44,126 INFO L273 TraceCheckUtils]: 162: Hoare triple {36172#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36172#false} is VALID [2018-11-23 12:28:44,126 INFO L273 TraceCheckUtils]: 163: Hoare triple {36172#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36172#false} is VALID [2018-11-23 12:28:44,126 INFO L273 TraceCheckUtils]: 164: Hoare triple {36172#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36172#false} is VALID [2018-11-23 12:28:44,126 INFO L273 TraceCheckUtils]: 165: Hoare triple {36172#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36172#false} is VALID [2018-11-23 12:28:44,126 INFO L273 TraceCheckUtils]: 166: Hoare triple {36172#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36172#false} is VALID [2018-11-23 12:28:44,126 INFO L273 TraceCheckUtils]: 167: Hoare triple {36172#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36172#false} is VALID [2018-11-23 12:28:44,126 INFO L273 TraceCheckUtils]: 168: Hoare triple {36172#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36172#false} is VALID [2018-11-23 12:28:44,126 INFO L273 TraceCheckUtils]: 169: Hoare triple {36172#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36172#false} is VALID [2018-11-23 12:28:44,126 INFO L273 TraceCheckUtils]: 170: Hoare triple {36172#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36172#false} is VALID [2018-11-23 12:28:44,127 INFO L273 TraceCheckUtils]: 171: Hoare triple {36172#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36172#false} is VALID [2018-11-23 12:28:44,127 INFO L273 TraceCheckUtils]: 172: Hoare triple {36172#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36172#false} is VALID [2018-11-23 12:28:44,127 INFO L273 TraceCheckUtils]: 173: Hoare triple {36172#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36172#false} is VALID [2018-11-23 12:28:44,127 INFO L273 TraceCheckUtils]: 174: Hoare triple {36172#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36172#false} is VALID [2018-11-23 12:28:44,127 INFO L273 TraceCheckUtils]: 175: Hoare triple {36172#false} assume !(~i~2 < 99999); {36172#false} is VALID [2018-11-23 12:28:44,127 INFO L273 TraceCheckUtils]: 176: Hoare triple {36172#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {36172#false} is VALID [2018-11-23 12:28:44,127 INFO L256 TraceCheckUtils]: 177: Hoare triple {36172#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {36171#true} is VALID [2018-11-23 12:28:44,127 INFO L273 TraceCheckUtils]: 178: Hoare triple {36171#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {36171#true} is VALID [2018-11-23 12:28:44,127 INFO L273 TraceCheckUtils]: 179: Hoare triple {36171#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:44,128 INFO L273 TraceCheckUtils]: 180: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:44,128 INFO L273 TraceCheckUtils]: 181: Hoare triple {36171#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:44,128 INFO L273 TraceCheckUtils]: 182: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:44,128 INFO L273 TraceCheckUtils]: 183: Hoare triple {36171#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:44,128 INFO L273 TraceCheckUtils]: 184: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:44,128 INFO L273 TraceCheckUtils]: 185: Hoare triple {36171#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:44,128 INFO L273 TraceCheckUtils]: 186: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:44,128 INFO L273 TraceCheckUtils]: 187: Hoare triple {36171#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:44,128 INFO L273 TraceCheckUtils]: 188: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:44,128 INFO L273 TraceCheckUtils]: 189: Hoare triple {36171#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:44,129 INFO L273 TraceCheckUtils]: 190: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:44,129 INFO L273 TraceCheckUtils]: 191: Hoare triple {36171#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:44,129 INFO L273 TraceCheckUtils]: 192: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:44,129 INFO L273 TraceCheckUtils]: 193: Hoare triple {36171#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:44,129 INFO L273 TraceCheckUtils]: 194: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:44,129 INFO L273 TraceCheckUtils]: 195: Hoare triple {36171#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:44,129 INFO L273 TraceCheckUtils]: 196: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:44,129 INFO L273 TraceCheckUtils]: 197: Hoare triple {36171#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:44,129 INFO L273 TraceCheckUtils]: 198: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:44,129 INFO L273 TraceCheckUtils]: 199: Hoare triple {36171#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:44,130 INFO L273 TraceCheckUtils]: 200: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:44,130 INFO L273 TraceCheckUtils]: 201: Hoare triple {36171#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:44,130 INFO L273 TraceCheckUtils]: 202: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:44,130 INFO L273 TraceCheckUtils]: 203: Hoare triple {36171#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:28:44,130 INFO L273 TraceCheckUtils]: 204: Hoare triple {36171#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36171#true} is VALID [2018-11-23 12:28:44,130 INFO L273 TraceCheckUtils]: 205: Hoare triple {36171#true} assume !(~i~0 < 100000); {36171#true} is VALID [2018-11-23 12:28:44,130 INFO L273 TraceCheckUtils]: 206: Hoare triple {36171#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {36171#true} is VALID [2018-11-23 12:28:44,130 INFO L273 TraceCheckUtils]: 207: Hoare triple {36171#true} assume true; {36171#true} is VALID [2018-11-23 12:28:44,130 INFO L268 TraceCheckUtils]: 208: Hoare quadruple {36171#true} {36172#false} #74#return; {36172#false} is VALID [2018-11-23 12:28:44,130 INFO L273 TraceCheckUtils]: 209: Hoare triple {36172#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {36172#false} is VALID [2018-11-23 12:28:44,131 INFO L273 TraceCheckUtils]: 210: Hoare triple {36172#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {36172#false} is VALID [2018-11-23 12:28:44,131 INFO L273 TraceCheckUtils]: 211: Hoare triple {36172#false} assume !false; {36172#false} is VALID [2018-11-23 12:28:44,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3335 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 1735 trivial. 0 not checked. [2018-11-23 12:28:44,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:44,150 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:28:44,160 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:28:44,241 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:28:44,241 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:28:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:44,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:28:44,865 INFO L256 TraceCheckUtils]: 0: Hoare triple {36171#true} call ULTIMATE.init(); {36171#true} is VALID [2018-11-23 12:28:44,865 INFO L273 TraceCheckUtils]: 1: Hoare triple {36171#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {36171#true} is VALID [2018-11-23 12:28:44,865 INFO L273 TraceCheckUtils]: 2: Hoare triple {36171#true} assume true; {36171#true} is VALID [2018-11-23 12:28:44,865 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36171#true} {36171#true} #66#return; {36171#true} is VALID [2018-11-23 12:28:44,865 INFO L256 TraceCheckUtils]: 4: Hoare triple {36171#true} call #t~ret13 := main(); {36171#true} is VALID [2018-11-23 12:28:44,871 INFO L273 TraceCheckUtils]: 5: Hoare triple {36171#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; {36232#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:44,871 INFO L273 TraceCheckUtils]: 6: Hoare triple {36232#(<= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36232#(<= main_~i~1 0)} is VALID [2018-11-23 12:28:44,873 INFO L273 TraceCheckUtils]: 7: Hoare triple {36232#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36174#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:44,873 INFO L273 TraceCheckUtils]: 8: Hoare triple {36174#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36174#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:44,875 INFO L273 TraceCheckUtils]: 9: Hoare triple {36174#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36175#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:44,875 INFO L273 TraceCheckUtils]: 10: Hoare triple {36175#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36175#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:44,877 INFO L273 TraceCheckUtils]: 11: Hoare triple {36175#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36176#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:44,877 INFO L273 TraceCheckUtils]: 12: Hoare triple {36176#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36176#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:44,879 INFO L273 TraceCheckUtils]: 13: Hoare triple {36176#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36177#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:44,879 INFO L273 TraceCheckUtils]: 14: Hoare triple {36177#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36177#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:44,881 INFO L273 TraceCheckUtils]: 15: Hoare triple {36177#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36178#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:44,881 INFO L273 TraceCheckUtils]: 16: Hoare triple {36178#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36178#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:44,883 INFO L273 TraceCheckUtils]: 17: Hoare triple {36178#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36179#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:44,883 INFO L273 TraceCheckUtils]: 18: Hoare triple {36179#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36179#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:44,886 INFO L273 TraceCheckUtils]: 19: Hoare triple {36179#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36180#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:44,886 INFO L273 TraceCheckUtils]: 20: Hoare triple {36180#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36180#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:44,888 INFO L273 TraceCheckUtils]: 21: Hoare triple {36180#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36181#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:44,888 INFO L273 TraceCheckUtils]: 22: Hoare triple {36181#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36181#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:44,890 INFO L273 TraceCheckUtils]: 23: Hoare triple {36181#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36182#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:44,890 INFO L273 TraceCheckUtils]: 24: Hoare triple {36182#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36182#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:44,892 INFO L273 TraceCheckUtils]: 25: Hoare triple {36182#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36183#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:44,892 INFO L273 TraceCheckUtils]: 26: Hoare triple {36183#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36183#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:44,894 INFO L273 TraceCheckUtils]: 27: Hoare triple {36183#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36184#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:44,894 INFO L273 TraceCheckUtils]: 28: Hoare triple {36184#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36184#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:44,897 INFO L273 TraceCheckUtils]: 29: Hoare triple {36184#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36185#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:44,897 INFO L273 TraceCheckUtils]: 30: Hoare triple {36185#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36185#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:44,899 INFO L273 TraceCheckUtils]: 31: Hoare triple {36185#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36186#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:44,899 INFO L273 TraceCheckUtils]: 32: Hoare triple {36186#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36186#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:44,901 INFO L273 TraceCheckUtils]: 33: Hoare triple {36186#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36187#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:44,901 INFO L273 TraceCheckUtils]: 34: Hoare triple {36187#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36187#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:44,903 INFO L273 TraceCheckUtils]: 35: Hoare triple {36187#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36188#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:44,903 INFO L273 TraceCheckUtils]: 36: Hoare triple {36188#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36188#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:44,905 INFO L273 TraceCheckUtils]: 37: Hoare triple {36188#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36189#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:44,905 INFO L273 TraceCheckUtils]: 38: Hoare triple {36189#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36189#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:44,907 INFO L273 TraceCheckUtils]: 39: Hoare triple {36189#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36190#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:44,907 INFO L273 TraceCheckUtils]: 40: Hoare triple {36190#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36190#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:44,909 INFO L273 TraceCheckUtils]: 41: Hoare triple {36190#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36191#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:44,909 INFO L273 TraceCheckUtils]: 42: Hoare triple {36191#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36191#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:44,911 INFO L273 TraceCheckUtils]: 43: Hoare triple {36191#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36192#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:44,911 INFO L273 TraceCheckUtils]: 44: Hoare triple {36192#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36192#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:44,917 INFO L273 TraceCheckUtils]: 45: Hoare triple {36192#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36193#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:44,917 INFO L273 TraceCheckUtils]: 46: Hoare triple {36193#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36193#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:44,919 INFO L273 TraceCheckUtils]: 47: Hoare triple {36193#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36194#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:44,919 INFO L273 TraceCheckUtils]: 48: Hoare triple {36194#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36194#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:44,921 INFO L273 TraceCheckUtils]: 49: Hoare triple {36194#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36195#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:44,921 INFO L273 TraceCheckUtils]: 50: Hoare triple {36195#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36195#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:44,923 INFO L273 TraceCheckUtils]: 51: Hoare triple {36195#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36196#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:44,923 INFO L273 TraceCheckUtils]: 52: Hoare triple {36196#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36196#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:44,925 INFO L273 TraceCheckUtils]: 53: Hoare triple {36196#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36197#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:44,925 INFO L273 TraceCheckUtils]: 54: Hoare triple {36197#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36197#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:44,927 INFO L273 TraceCheckUtils]: 55: Hoare triple {36197#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36198#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:44,927 INFO L273 TraceCheckUtils]: 56: Hoare triple {36198#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36198#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:44,929 INFO L273 TraceCheckUtils]: 57: Hoare triple {36198#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36199#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:44,929 INFO L273 TraceCheckUtils]: 58: Hoare triple {36199#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36199#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:44,935 INFO L273 TraceCheckUtils]: 59: Hoare triple {36199#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36200#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:44,935 INFO L273 TraceCheckUtils]: 60: Hoare triple {36200#(<= main_~i~1 27)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36200#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:44,938 INFO L273 TraceCheckUtils]: 61: Hoare triple {36200#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36201#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:44,938 INFO L273 TraceCheckUtils]: 62: Hoare triple {36201#(<= main_~i~1 28)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36201#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:44,941 INFO L273 TraceCheckUtils]: 63: Hoare triple {36201#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36202#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:44,941 INFO L273 TraceCheckUtils]: 64: Hoare triple {36202#(<= main_~i~1 29)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36202#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:44,943 INFO L273 TraceCheckUtils]: 65: Hoare triple {36202#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36203#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:44,943 INFO L273 TraceCheckUtils]: 66: Hoare triple {36203#(<= main_~i~1 30)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36203#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:44,945 INFO L273 TraceCheckUtils]: 67: Hoare triple {36203#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36204#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:44,945 INFO L273 TraceCheckUtils]: 68: Hoare triple {36204#(<= main_~i~1 31)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36204#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:44,948 INFO L273 TraceCheckUtils]: 69: Hoare triple {36204#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36205#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:44,948 INFO L273 TraceCheckUtils]: 70: Hoare triple {36205#(<= main_~i~1 32)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36205#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:44,950 INFO L273 TraceCheckUtils]: 71: Hoare triple {36205#(<= main_~i~1 32)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36206#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:44,950 INFO L273 TraceCheckUtils]: 72: Hoare triple {36206#(<= main_~i~1 33)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36206#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:44,952 INFO L273 TraceCheckUtils]: 73: Hoare triple {36206#(<= main_~i~1 33)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36207#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:44,952 INFO L273 TraceCheckUtils]: 74: Hoare triple {36207#(<= main_~i~1 34)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36207#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:44,955 INFO L273 TraceCheckUtils]: 75: Hoare triple {36207#(<= main_~i~1 34)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36208#(<= main_~i~1 35)} is VALID [2018-11-23 12:28:44,955 INFO L273 TraceCheckUtils]: 76: Hoare triple {36208#(<= main_~i~1 35)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36208#(<= main_~i~1 35)} is VALID [2018-11-23 12:28:44,957 INFO L273 TraceCheckUtils]: 77: Hoare triple {36208#(<= main_~i~1 35)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36209#(<= main_~i~1 36)} is VALID [2018-11-23 12:28:44,957 INFO L273 TraceCheckUtils]: 78: Hoare triple {36209#(<= main_~i~1 36)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36209#(<= main_~i~1 36)} is VALID [2018-11-23 12:28:44,959 INFO L273 TraceCheckUtils]: 79: Hoare triple {36209#(<= main_~i~1 36)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36210#(<= main_~i~1 37)} is VALID [2018-11-23 12:28:44,959 INFO L273 TraceCheckUtils]: 80: Hoare triple {36210#(<= main_~i~1 37)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36210#(<= main_~i~1 37)} is VALID [2018-11-23 12:28:44,961 INFO L273 TraceCheckUtils]: 81: Hoare triple {36210#(<= main_~i~1 37)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36211#(<= main_~i~1 38)} is VALID [2018-11-23 12:28:44,961 INFO L273 TraceCheckUtils]: 82: Hoare triple {36211#(<= main_~i~1 38)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36211#(<= main_~i~1 38)} is VALID [2018-11-23 12:28:44,963 INFO L273 TraceCheckUtils]: 83: Hoare triple {36211#(<= main_~i~1 38)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36212#(<= main_~i~1 39)} is VALID [2018-11-23 12:28:44,963 INFO L273 TraceCheckUtils]: 84: Hoare triple {36212#(<= main_~i~1 39)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {36212#(<= main_~i~1 39)} is VALID [2018-11-23 12:28:44,965 INFO L273 TraceCheckUtils]: 85: Hoare triple {36212#(<= main_~i~1 39)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {36213#(<= main_~i~1 40)} is VALID [2018-11-23 12:28:44,965 INFO L273 TraceCheckUtils]: 86: Hoare triple {36213#(<= main_~i~1 40)} assume !(~i~1 < 100000); {36172#false} is VALID [2018-11-23 12:28:44,965 INFO L256 TraceCheckUtils]: 87: Hoare triple {36172#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {36172#false} is VALID [2018-11-23 12:28:44,965 INFO L273 TraceCheckUtils]: 88: Hoare triple {36172#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {36172#false} is VALID [2018-11-23 12:28:44,965 INFO L273 TraceCheckUtils]: 89: Hoare triple {36172#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:44,965 INFO L273 TraceCheckUtils]: 90: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:44,966 INFO L273 TraceCheckUtils]: 91: Hoare triple {36172#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:44,966 INFO L273 TraceCheckUtils]: 92: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:44,966 INFO L273 TraceCheckUtils]: 93: Hoare triple {36172#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:44,966 INFO L273 TraceCheckUtils]: 94: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:44,966 INFO L273 TraceCheckUtils]: 95: Hoare triple {36172#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:44,966 INFO L273 TraceCheckUtils]: 96: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:44,966 INFO L273 TraceCheckUtils]: 97: Hoare triple {36172#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:44,966 INFO L273 TraceCheckUtils]: 98: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:44,966 INFO L273 TraceCheckUtils]: 99: Hoare triple {36172#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:44,966 INFO L273 TraceCheckUtils]: 100: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:44,967 INFO L273 TraceCheckUtils]: 101: Hoare triple {36172#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:44,967 INFO L273 TraceCheckUtils]: 102: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:44,967 INFO L273 TraceCheckUtils]: 103: Hoare triple {36172#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:44,967 INFO L273 TraceCheckUtils]: 104: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:44,967 INFO L273 TraceCheckUtils]: 105: Hoare triple {36172#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:44,967 INFO L273 TraceCheckUtils]: 106: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:44,967 INFO L273 TraceCheckUtils]: 107: Hoare triple {36172#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:44,967 INFO L273 TraceCheckUtils]: 108: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:44,967 INFO L273 TraceCheckUtils]: 109: Hoare triple {36172#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:44,968 INFO L273 TraceCheckUtils]: 110: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:44,968 INFO L273 TraceCheckUtils]: 111: Hoare triple {36172#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:44,968 INFO L273 TraceCheckUtils]: 112: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:44,968 INFO L273 TraceCheckUtils]: 113: Hoare triple {36172#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:44,968 INFO L273 TraceCheckUtils]: 114: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:44,968 INFO L273 TraceCheckUtils]: 115: Hoare triple {36172#false} assume !(~i~0 < 100000); {36172#false} is VALID [2018-11-23 12:28:44,968 INFO L273 TraceCheckUtils]: 116: Hoare triple {36172#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {36172#false} is VALID [2018-11-23 12:28:44,968 INFO L273 TraceCheckUtils]: 117: Hoare triple {36172#false} assume true; {36172#false} is VALID [2018-11-23 12:28:44,968 INFO L268 TraceCheckUtils]: 118: Hoare quadruple {36172#false} {36172#false} #70#return; {36172#false} is VALID [2018-11-23 12:28:44,968 INFO L273 TraceCheckUtils]: 119: Hoare triple {36172#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {36172#false} is VALID [2018-11-23 12:28:44,969 INFO L256 TraceCheckUtils]: 120: Hoare triple {36172#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {36172#false} is VALID [2018-11-23 12:28:44,969 INFO L273 TraceCheckUtils]: 121: Hoare triple {36172#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {36172#false} is VALID [2018-11-23 12:28:44,969 INFO L273 TraceCheckUtils]: 122: Hoare triple {36172#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:44,969 INFO L273 TraceCheckUtils]: 123: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:44,969 INFO L273 TraceCheckUtils]: 124: Hoare triple {36172#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:44,969 INFO L273 TraceCheckUtils]: 125: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:44,969 INFO L273 TraceCheckUtils]: 126: Hoare triple {36172#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:44,969 INFO L273 TraceCheckUtils]: 127: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:44,969 INFO L273 TraceCheckUtils]: 128: Hoare triple {36172#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:44,969 INFO L273 TraceCheckUtils]: 129: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:44,970 INFO L273 TraceCheckUtils]: 130: Hoare triple {36172#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:44,970 INFO L273 TraceCheckUtils]: 131: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:44,970 INFO L273 TraceCheckUtils]: 132: Hoare triple {36172#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:44,970 INFO L273 TraceCheckUtils]: 133: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:44,970 INFO L273 TraceCheckUtils]: 134: Hoare triple {36172#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:44,970 INFO L273 TraceCheckUtils]: 135: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:44,970 INFO L273 TraceCheckUtils]: 136: Hoare triple {36172#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:44,970 INFO L273 TraceCheckUtils]: 137: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:44,970 INFO L273 TraceCheckUtils]: 138: Hoare triple {36172#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:44,970 INFO L273 TraceCheckUtils]: 139: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:44,971 INFO L273 TraceCheckUtils]: 140: Hoare triple {36172#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:44,971 INFO L273 TraceCheckUtils]: 141: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:44,971 INFO L273 TraceCheckUtils]: 142: Hoare triple {36172#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:44,971 INFO L273 TraceCheckUtils]: 143: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:44,971 INFO L273 TraceCheckUtils]: 144: Hoare triple {36172#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:44,971 INFO L273 TraceCheckUtils]: 145: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:44,971 INFO L273 TraceCheckUtils]: 146: Hoare triple {36172#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:44,971 INFO L273 TraceCheckUtils]: 147: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:44,971 INFO L273 TraceCheckUtils]: 148: Hoare triple {36172#false} assume !(~i~0 < 100000); {36172#false} is VALID [2018-11-23 12:28:44,971 INFO L273 TraceCheckUtils]: 149: Hoare triple {36172#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {36172#false} is VALID [2018-11-23 12:28:44,972 INFO L273 TraceCheckUtils]: 150: Hoare triple {36172#false} assume true; {36172#false} is VALID [2018-11-23 12:28:44,972 INFO L268 TraceCheckUtils]: 151: Hoare quadruple {36172#false} {36172#false} #72#return; {36172#false} is VALID [2018-11-23 12:28:44,972 INFO L273 TraceCheckUtils]: 152: Hoare triple {36172#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {36172#false} is VALID [2018-11-23 12:28:44,972 INFO L273 TraceCheckUtils]: 153: Hoare triple {36172#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36172#false} is VALID [2018-11-23 12:28:44,972 INFO L273 TraceCheckUtils]: 154: Hoare triple {36172#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36172#false} is VALID [2018-11-23 12:28:44,972 INFO L273 TraceCheckUtils]: 155: Hoare triple {36172#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36172#false} is VALID [2018-11-23 12:28:44,972 INFO L273 TraceCheckUtils]: 156: Hoare triple {36172#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36172#false} is VALID [2018-11-23 12:28:44,972 INFO L273 TraceCheckUtils]: 157: Hoare triple {36172#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36172#false} is VALID [2018-11-23 12:28:44,972 INFO L273 TraceCheckUtils]: 158: Hoare triple {36172#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36172#false} is VALID [2018-11-23 12:28:44,972 INFO L273 TraceCheckUtils]: 159: Hoare triple {36172#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36172#false} is VALID [2018-11-23 12:28:44,973 INFO L273 TraceCheckUtils]: 160: Hoare triple {36172#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36172#false} is VALID [2018-11-23 12:28:44,973 INFO L273 TraceCheckUtils]: 161: Hoare triple {36172#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36172#false} is VALID [2018-11-23 12:28:44,973 INFO L273 TraceCheckUtils]: 162: Hoare triple {36172#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36172#false} is VALID [2018-11-23 12:28:44,973 INFO L273 TraceCheckUtils]: 163: Hoare triple {36172#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36172#false} is VALID [2018-11-23 12:28:44,973 INFO L273 TraceCheckUtils]: 164: Hoare triple {36172#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36172#false} is VALID [2018-11-23 12:28:44,973 INFO L273 TraceCheckUtils]: 165: Hoare triple {36172#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36172#false} is VALID [2018-11-23 12:28:44,973 INFO L273 TraceCheckUtils]: 166: Hoare triple {36172#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36172#false} is VALID [2018-11-23 12:28:44,973 INFO L273 TraceCheckUtils]: 167: Hoare triple {36172#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36172#false} is VALID [2018-11-23 12:28:44,973 INFO L273 TraceCheckUtils]: 168: Hoare triple {36172#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36172#false} is VALID [2018-11-23 12:28:44,973 INFO L273 TraceCheckUtils]: 169: Hoare triple {36172#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36172#false} is VALID [2018-11-23 12:28:44,974 INFO L273 TraceCheckUtils]: 170: Hoare triple {36172#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36172#false} is VALID [2018-11-23 12:28:44,974 INFO L273 TraceCheckUtils]: 171: Hoare triple {36172#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36172#false} is VALID [2018-11-23 12:28:44,974 INFO L273 TraceCheckUtils]: 172: Hoare triple {36172#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36172#false} is VALID [2018-11-23 12:28:44,974 INFO L273 TraceCheckUtils]: 173: Hoare triple {36172#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {36172#false} is VALID [2018-11-23 12:28:44,974 INFO L273 TraceCheckUtils]: 174: Hoare triple {36172#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {36172#false} is VALID [2018-11-23 12:28:44,974 INFO L273 TraceCheckUtils]: 175: Hoare triple {36172#false} assume !(~i~2 < 99999); {36172#false} is VALID [2018-11-23 12:28:44,974 INFO L273 TraceCheckUtils]: 176: Hoare triple {36172#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {36172#false} is VALID [2018-11-23 12:28:44,974 INFO L256 TraceCheckUtils]: 177: Hoare triple {36172#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {36172#false} is VALID [2018-11-23 12:28:44,974 INFO L273 TraceCheckUtils]: 178: Hoare triple {36172#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {36172#false} is VALID [2018-11-23 12:28:44,975 INFO L273 TraceCheckUtils]: 179: Hoare triple {36172#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:44,975 INFO L273 TraceCheckUtils]: 180: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:44,975 INFO L273 TraceCheckUtils]: 181: Hoare triple {36172#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:44,975 INFO L273 TraceCheckUtils]: 182: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:44,975 INFO L273 TraceCheckUtils]: 183: Hoare triple {36172#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:44,975 INFO L273 TraceCheckUtils]: 184: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:44,975 INFO L273 TraceCheckUtils]: 185: Hoare triple {36172#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:44,975 INFO L273 TraceCheckUtils]: 186: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:44,975 INFO L273 TraceCheckUtils]: 187: Hoare triple {36172#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:44,975 INFO L273 TraceCheckUtils]: 188: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:44,976 INFO L273 TraceCheckUtils]: 189: Hoare triple {36172#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:44,976 INFO L273 TraceCheckUtils]: 190: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:44,976 INFO L273 TraceCheckUtils]: 191: Hoare triple {36172#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:44,976 INFO L273 TraceCheckUtils]: 192: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:44,976 INFO L273 TraceCheckUtils]: 193: Hoare triple {36172#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:44,976 INFO L273 TraceCheckUtils]: 194: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:44,976 INFO L273 TraceCheckUtils]: 195: Hoare triple {36172#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:44,976 INFO L273 TraceCheckUtils]: 196: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:44,976 INFO L273 TraceCheckUtils]: 197: Hoare triple {36172#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:44,976 INFO L273 TraceCheckUtils]: 198: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:44,977 INFO L273 TraceCheckUtils]: 199: Hoare triple {36172#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:44,977 INFO L273 TraceCheckUtils]: 200: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:44,977 INFO L273 TraceCheckUtils]: 201: Hoare triple {36172#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:44,977 INFO L273 TraceCheckUtils]: 202: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:44,977 INFO L273 TraceCheckUtils]: 203: Hoare triple {36172#false} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:28:44,977 INFO L273 TraceCheckUtils]: 204: Hoare triple {36172#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36172#false} is VALID [2018-11-23 12:28:44,977 INFO L273 TraceCheckUtils]: 205: Hoare triple {36172#false} assume !(~i~0 < 100000); {36172#false} is VALID [2018-11-23 12:28:44,977 INFO L273 TraceCheckUtils]: 206: Hoare triple {36172#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {36172#false} is VALID [2018-11-23 12:28:44,977 INFO L273 TraceCheckUtils]: 207: Hoare triple {36172#false} assume true; {36172#false} is VALID [2018-11-23 12:28:44,977 INFO L268 TraceCheckUtils]: 208: Hoare quadruple {36172#false} {36172#false} #74#return; {36172#false} is VALID [2018-11-23 12:28:44,978 INFO L273 TraceCheckUtils]: 209: Hoare triple {36172#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {36172#false} is VALID [2018-11-23 12:28:44,978 INFO L273 TraceCheckUtils]: 210: Hoare triple {36172#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {36172#false} is VALID [2018-11-23 12:28:44,978 INFO L273 TraceCheckUtils]: 211: Hoare triple {36172#false} assume !false; {36172#false} is VALID [2018-11-23 12:28:44,998 INFO L134 CoverageAnalysis]: Checked inductivity of 3335 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 1735 trivial. 0 not checked. [2018-11-23 12:28:45,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:28:45,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2018-11-23 12:28:45,027 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 212 [2018-11-23 12:28:45,027 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:28:45,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states. [2018-11-23 12:28:45,224 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:45,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-23 12:28:45,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-23 12:28:45,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 12:28:45,226 INFO L87 Difference]: Start difference. First operand 151 states and 155 transitions. Second operand 44 states. [2018-11-23 12:28:46,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:46,355 INFO L93 Difference]: Finished difference Result 218 states and 226 transitions. [2018-11-23 12:28:46,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-23 12:28:46,355 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 212 [2018-11-23 12:28:46,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:28:46,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 12:28:46,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 134 transitions. [2018-11-23 12:28:46,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 12:28:46,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 134 transitions. [2018-11-23 12:28:46,357 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 134 transitions. [2018-11-23 12:28:46,486 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:28:46,490 INFO L225 Difference]: With dead ends: 218 [2018-11-23 12:28:46,490 INFO L226 Difference]: Without dead ends: 154 [2018-11-23 12:28:46,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 12:28:46,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-11-23 12:28:46,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2018-11-23 12:28:46,547 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:28:46,547 INFO L82 GeneralOperation]: Start isEquivalent. First operand 154 states. Second operand 153 states. [2018-11-23 12:28:46,547 INFO L74 IsIncluded]: Start isIncluded. First operand 154 states. Second operand 153 states. [2018-11-23 12:28:46,547 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 153 states. [2018-11-23 12:28:46,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:46,551 INFO L93 Difference]: Finished difference Result 154 states and 158 transitions. [2018-11-23 12:28:46,551 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 158 transitions. [2018-11-23 12:28:46,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:46,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:46,551 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 154 states. [2018-11-23 12:28:46,552 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 154 states. [2018-11-23 12:28:46,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:28:46,554 INFO L93 Difference]: Finished difference Result 154 states and 158 transitions. [2018-11-23 12:28:46,554 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 158 transitions. [2018-11-23 12:28:46,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:28:46,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:28:46,555 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:28:46,555 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:28:46,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-11-23 12:28:46,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 157 transitions. [2018-11-23 12:28:46,558 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 157 transitions. Word has length 212 [2018-11-23 12:28:46,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:28:46,558 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 157 transitions. [2018-11-23 12:28:46,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-23 12:28:46,558 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2018-11-23 12:28:46,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-11-23 12:28:46,559 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:28:46,560 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 39, 39, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:28:46,560 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:28:46,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:28:46,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1698842739, now seen corresponding path program 41 times [2018-11-23 12:28:46,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:28:46,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:28:46,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:46,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:28:46,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:28:46,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:28:47,782 INFO L256 TraceCheckUtils]: 0: Hoare triple {37711#true} call ULTIMATE.init(); {37711#true} is VALID [2018-11-23 12:28:47,782 INFO L273 TraceCheckUtils]: 1: Hoare triple {37711#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {37711#true} is VALID [2018-11-23 12:28:47,782 INFO L273 TraceCheckUtils]: 2: Hoare triple {37711#true} assume true; {37711#true} is VALID [2018-11-23 12:28:47,782 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37711#true} {37711#true} #66#return; {37711#true} is VALID [2018-11-23 12:28:47,782 INFO L256 TraceCheckUtils]: 4: Hoare triple {37711#true} call #t~ret13 := main(); {37711#true} is VALID [2018-11-23 12:28:47,783 INFO L273 TraceCheckUtils]: 5: Hoare triple {37711#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; {37713#(= main_~i~1 0)} is VALID [2018-11-23 12:28:47,783 INFO L273 TraceCheckUtils]: 6: Hoare triple {37713#(= main_~i~1 0)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37713#(= main_~i~1 0)} is VALID [2018-11-23 12:28:47,783 INFO L273 TraceCheckUtils]: 7: Hoare triple {37713#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37714#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:47,784 INFO L273 TraceCheckUtils]: 8: Hoare triple {37714#(<= main_~i~1 1)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37714#(<= main_~i~1 1)} is VALID [2018-11-23 12:28:47,784 INFO L273 TraceCheckUtils]: 9: Hoare triple {37714#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37715#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:47,784 INFO L273 TraceCheckUtils]: 10: Hoare triple {37715#(<= main_~i~1 2)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37715#(<= main_~i~1 2)} is VALID [2018-11-23 12:28:47,785 INFO L273 TraceCheckUtils]: 11: Hoare triple {37715#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37716#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:47,785 INFO L273 TraceCheckUtils]: 12: Hoare triple {37716#(<= main_~i~1 3)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37716#(<= main_~i~1 3)} is VALID [2018-11-23 12:28:47,786 INFO L273 TraceCheckUtils]: 13: Hoare triple {37716#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37717#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:47,786 INFO L273 TraceCheckUtils]: 14: Hoare triple {37717#(<= main_~i~1 4)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37717#(<= main_~i~1 4)} is VALID [2018-11-23 12:28:47,787 INFO L273 TraceCheckUtils]: 15: Hoare triple {37717#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37718#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:47,787 INFO L273 TraceCheckUtils]: 16: Hoare triple {37718#(<= main_~i~1 5)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37718#(<= main_~i~1 5)} is VALID [2018-11-23 12:28:47,788 INFO L273 TraceCheckUtils]: 17: Hoare triple {37718#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37719#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:47,788 INFO L273 TraceCheckUtils]: 18: Hoare triple {37719#(<= main_~i~1 6)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37719#(<= main_~i~1 6)} is VALID [2018-11-23 12:28:47,789 INFO L273 TraceCheckUtils]: 19: Hoare triple {37719#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37720#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:47,790 INFO L273 TraceCheckUtils]: 20: Hoare triple {37720#(<= main_~i~1 7)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37720#(<= main_~i~1 7)} is VALID [2018-11-23 12:28:47,790 INFO L273 TraceCheckUtils]: 21: Hoare triple {37720#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37721#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:47,791 INFO L273 TraceCheckUtils]: 22: Hoare triple {37721#(<= main_~i~1 8)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37721#(<= main_~i~1 8)} is VALID [2018-11-23 12:28:47,792 INFO L273 TraceCheckUtils]: 23: Hoare triple {37721#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37722#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:47,792 INFO L273 TraceCheckUtils]: 24: Hoare triple {37722#(<= main_~i~1 9)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37722#(<= main_~i~1 9)} is VALID [2018-11-23 12:28:47,793 INFO L273 TraceCheckUtils]: 25: Hoare triple {37722#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37723#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:47,793 INFO L273 TraceCheckUtils]: 26: Hoare triple {37723#(<= main_~i~1 10)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37723#(<= main_~i~1 10)} is VALID [2018-11-23 12:28:47,794 INFO L273 TraceCheckUtils]: 27: Hoare triple {37723#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37724#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:47,795 INFO L273 TraceCheckUtils]: 28: Hoare triple {37724#(<= main_~i~1 11)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37724#(<= main_~i~1 11)} is VALID [2018-11-23 12:28:47,795 INFO L273 TraceCheckUtils]: 29: Hoare triple {37724#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37725#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:47,796 INFO L273 TraceCheckUtils]: 30: Hoare triple {37725#(<= main_~i~1 12)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37725#(<= main_~i~1 12)} is VALID [2018-11-23 12:28:47,796 INFO L273 TraceCheckUtils]: 31: Hoare triple {37725#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37726#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:47,797 INFO L273 TraceCheckUtils]: 32: Hoare triple {37726#(<= main_~i~1 13)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37726#(<= main_~i~1 13)} is VALID [2018-11-23 12:28:47,798 INFO L273 TraceCheckUtils]: 33: Hoare triple {37726#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37727#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:47,798 INFO L273 TraceCheckUtils]: 34: Hoare triple {37727#(<= main_~i~1 14)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37727#(<= main_~i~1 14)} is VALID [2018-11-23 12:28:47,799 INFO L273 TraceCheckUtils]: 35: Hoare triple {37727#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37728#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:47,799 INFO L273 TraceCheckUtils]: 36: Hoare triple {37728#(<= main_~i~1 15)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37728#(<= main_~i~1 15)} is VALID [2018-11-23 12:28:47,800 INFO L273 TraceCheckUtils]: 37: Hoare triple {37728#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37729#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:47,801 INFO L273 TraceCheckUtils]: 38: Hoare triple {37729#(<= main_~i~1 16)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37729#(<= main_~i~1 16)} is VALID [2018-11-23 12:28:47,801 INFO L273 TraceCheckUtils]: 39: Hoare triple {37729#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37730#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:47,802 INFO L273 TraceCheckUtils]: 40: Hoare triple {37730#(<= main_~i~1 17)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37730#(<= main_~i~1 17)} is VALID [2018-11-23 12:28:47,803 INFO L273 TraceCheckUtils]: 41: Hoare triple {37730#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37731#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:47,803 INFO L273 TraceCheckUtils]: 42: Hoare triple {37731#(<= main_~i~1 18)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37731#(<= main_~i~1 18)} is VALID [2018-11-23 12:28:47,804 INFO L273 TraceCheckUtils]: 43: Hoare triple {37731#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37732#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:47,804 INFO L273 TraceCheckUtils]: 44: Hoare triple {37732#(<= main_~i~1 19)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37732#(<= main_~i~1 19)} is VALID [2018-11-23 12:28:47,805 INFO L273 TraceCheckUtils]: 45: Hoare triple {37732#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37733#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:47,806 INFO L273 TraceCheckUtils]: 46: Hoare triple {37733#(<= main_~i~1 20)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37733#(<= main_~i~1 20)} is VALID [2018-11-23 12:28:47,806 INFO L273 TraceCheckUtils]: 47: Hoare triple {37733#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37734#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:47,807 INFO L273 TraceCheckUtils]: 48: Hoare triple {37734#(<= main_~i~1 21)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37734#(<= main_~i~1 21)} is VALID [2018-11-23 12:28:47,808 INFO L273 TraceCheckUtils]: 49: Hoare triple {37734#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37735#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:47,808 INFO L273 TraceCheckUtils]: 50: Hoare triple {37735#(<= main_~i~1 22)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37735#(<= main_~i~1 22)} is VALID [2018-11-23 12:28:47,809 INFO L273 TraceCheckUtils]: 51: Hoare triple {37735#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37736#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:47,809 INFO L273 TraceCheckUtils]: 52: Hoare triple {37736#(<= main_~i~1 23)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37736#(<= main_~i~1 23)} is VALID [2018-11-23 12:28:47,810 INFO L273 TraceCheckUtils]: 53: Hoare triple {37736#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37737#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:47,811 INFO L273 TraceCheckUtils]: 54: Hoare triple {37737#(<= main_~i~1 24)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37737#(<= main_~i~1 24)} is VALID [2018-11-23 12:28:47,811 INFO L273 TraceCheckUtils]: 55: Hoare triple {37737#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37738#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:47,812 INFO L273 TraceCheckUtils]: 56: Hoare triple {37738#(<= main_~i~1 25)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37738#(<= main_~i~1 25)} is VALID [2018-11-23 12:28:47,813 INFO L273 TraceCheckUtils]: 57: Hoare triple {37738#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37739#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:47,813 INFO L273 TraceCheckUtils]: 58: Hoare triple {37739#(<= main_~i~1 26)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37739#(<= main_~i~1 26)} is VALID [2018-11-23 12:28:47,814 INFO L273 TraceCheckUtils]: 59: Hoare triple {37739#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37740#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:47,814 INFO L273 TraceCheckUtils]: 60: Hoare triple {37740#(<= main_~i~1 27)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37740#(<= main_~i~1 27)} is VALID [2018-11-23 12:28:47,815 INFO L273 TraceCheckUtils]: 61: Hoare triple {37740#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37741#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:47,816 INFO L273 TraceCheckUtils]: 62: Hoare triple {37741#(<= main_~i~1 28)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37741#(<= main_~i~1 28)} is VALID [2018-11-23 12:28:47,816 INFO L273 TraceCheckUtils]: 63: Hoare triple {37741#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37742#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:47,817 INFO L273 TraceCheckUtils]: 64: Hoare triple {37742#(<= main_~i~1 29)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37742#(<= main_~i~1 29)} is VALID [2018-11-23 12:28:47,817 INFO L273 TraceCheckUtils]: 65: Hoare triple {37742#(<= main_~i~1 29)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37743#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:47,818 INFO L273 TraceCheckUtils]: 66: Hoare triple {37743#(<= main_~i~1 30)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37743#(<= main_~i~1 30)} is VALID [2018-11-23 12:28:47,819 INFO L273 TraceCheckUtils]: 67: Hoare triple {37743#(<= main_~i~1 30)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37744#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:47,819 INFO L273 TraceCheckUtils]: 68: Hoare triple {37744#(<= main_~i~1 31)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37744#(<= main_~i~1 31)} is VALID [2018-11-23 12:28:47,820 INFO L273 TraceCheckUtils]: 69: Hoare triple {37744#(<= main_~i~1 31)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37745#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:47,820 INFO L273 TraceCheckUtils]: 70: Hoare triple {37745#(<= main_~i~1 32)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37745#(<= main_~i~1 32)} is VALID [2018-11-23 12:28:47,821 INFO L273 TraceCheckUtils]: 71: Hoare triple {37745#(<= main_~i~1 32)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37746#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:47,822 INFO L273 TraceCheckUtils]: 72: Hoare triple {37746#(<= main_~i~1 33)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37746#(<= main_~i~1 33)} is VALID [2018-11-23 12:28:47,822 INFO L273 TraceCheckUtils]: 73: Hoare triple {37746#(<= main_~i~1 33)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37747#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:47,823 INFO L273 TraceCheckUtils]: 74: Hoare triple {37747#(<= main_~i~1 34)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37747#(<= main_~i~1 34)} is VALID [2018-11-23 12:28:47,824 INFO L273 TraceCheckUtils]: 75: Hoare triple {37747#(<= main_~i~1 34)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37748#(<= main_~i~1 35)} is VALID [2018-11-23 12:28:47,824 INFO L273 TraceCheckUtils]: 76: Hoare triple {37748#(<= main_~i~1 35)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37748#(<= main_~i~1 35)} is VALID [2018-11-23 12:28:47,825 INFO L273 TraceCheckUtils]: 77: Hoare triple {37748#(<= main_~i~1 35)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37749#(<= main_~i~1 36)} is VALID [2018-11-23 12:28:47,825 INFO L273 TraceCheckUtils]: 78: Hoare triple {37749#(<= main_~i~1 36)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37749#(<= main_~i~1 36)} is VALID [2018-11-23 12:28:47,826 INFO L273 TraceCheckUtils]: 79: Hoare triple {37749#(<= main_~i~1 36)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37750#(<= main_~i~1 37)} is VALID [2018-11-23 12:28:47,827 INFO L273 TraceCheckUtils]: 80: Hoare triple {37750#(<= main_~i~1 37)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37750#(<= main_~i~1 37)} is VALID [2018-11-23 12:28:47,827 INFO L273 TraceCheckUtils]: 81: Hoare triple {37750#(<= main_~i~1 37)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37751#(<= main_~i~1 38)} is VALID [2018-11-23 12:28:47,828 INFO L273 TraceCheckUtils]: 82: Hoare triple {37751#(<= main_~i~1 38)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37751#(<= main_~i~1 38)} is VALID [2018-11-23 12:28:47,829 INFO L273 TraceCheckUtils]: 83: Hoare triple {37751#(<= main_~i~1 38)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37752#(<= main_~i~1 39)} is VALID [2018-11-23 12:28:47,829 INFO L273 TraceCheckUtils]: 84: Hoare triple {37752#(<= main_~i~1 39)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37752#(<= main_~i~1 39)} is VALID [2018-11-23 12:28:47,830 INFO L273 TraceCheckUtils]: 85: Hoare triple {37752#(<= main_~i~1 39)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37753#(<= main_~i~1 40)} is VALID [2018-11-23 12:28:47,830 INFO L273 TraceCheckUtils]: 86: Hoare triple {37753#(<= main_~i~1 40)} assume !!(~i~1 < 100000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + 4 * ~i~1, 4);havoc #t~nondet4; {37753#(<= main_~i~1 40)} is VALID [2018-11-23 12:28:47,831 INFO L273 TraceCheckUtils]: 87: Hoare triple {37753#(<= main_~i~1 40)} #t~post3 := ~i~1;~i~1 := 1 + #t~post3;havoc #t~post3; {37754#(<= main_~i~1 41)} is VALID [2018-11-23 12:28:47,832 INFO L273 TraceCheckUtils]: 88: Hoare triple {37754#(<= main_~i~1 41)} assume !(~i~1 < 100000); {37712#false} is VALID [2018-11-23 12:28:47,832 INFO L256 TraceCheckUtils]: 89: Hoare triple {37712#false} call #t~ret5 := bor(~#x~0.base, ~#x~0.offset); {37711#true} is VALID [2018-11-23 12:28:47,832 INFO L273 TraceCheckUtils]: 90: Hoare triple {37711#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {37711#true} is VALID [2018-11-23 12:28:47,832 INFO L273 TraceCheckUtils]: 91: Hoare triple {37711#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:47,832 INFO L273 TraceCheckUtils]: 92: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:47,833 INFO L273 TraceCheckUtils]: 93: Hoare triple {37711#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:47,833 INFO L273 TraceCheckUtils]: 94: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:47,833 INFO L273 TraceCheckUtils]: 95: Hoare triple {37711#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:47,833 INFO L273 TraceCheckUtils]: 96: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:47,833 INFO L273 TraceCheckUtils]: 97: Hoare triple {37711#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:47,833 INFO L273 TraceCheckUtils]: 98: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:47,834 INFO L273 TraceCheckUtils]: 99: Hoare triple {37711#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:47,834 INFO L273 TraceCheckUtils]: 100: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:47,834 INFO L273 TraceCheckUtils]: 101: Hoare triple {37711#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:47,834 INFO L273 TraceCheckUtils]: 102: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:47,834 INFO L273 TraceCheckUtils]: 103: Hoare triple {37711#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:47,834 INFO L273 TraceCheckUtils]: 104: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:47,835 INFO L273 TraceCheckUtils]: 105: Hoare triple {37711#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:47,835 INFO L273 TraceCheckUtils]: 106: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:47,835 INFO L273 TraceCheckUtils]: 107: Hoare triple {37711#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:47,835 INFO L273 TraceCheckUtils]: 108: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:47,835 INFO L273 TraceCheckUtils]: 109: Hoare triple {37711#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:47,835 INFO L273 TraceCheckUtils]: 110: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:47,835 INFO L273 TraceCheckUtils]: 111: Hoare triple {37711#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:47,836 INFO L273 TraceCheckUtils]: 112: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:47,836 INFO L273 TraceCheckUtils]: 113: Hoare triple {37711#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:47,836 INFO L273 TraceCheckUtils]: 114: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:47,836 INFO L273 TraceCheckUtils]: 115: Hoare triple {37711#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:47,836 INFO L273 TraceCheckUtils]: 116: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:47,836 INFO L273 TraceCheckUtils]: 117: Hoare triple {37711#true} assume !(~i~0 < 100000); {37711#true} is VALID [2018-11-23 12:28:47,836 INFO L273 TraceCheckUtils]: 118: Hoare triple {37711#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {37711#true} is VALID [2018-11-23 12:28:47,836 INFO L273 TraceCheckUtils]: 119: Hoare triple {37711#true} assume true; {37711#true} is VALID [2018-11-23 12:28:47,836 INFO L268 TraceCheckUtils]: 120: Hoare quadruple {37711#true} {37712#false} #70#return; {37712#false} is VALID [2018-11-23 12:28:47,836 INFO L273 TraceCheckUtils]: 121: Hoare triple {37712#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;~ret~0 := #t~ret5;havoc #t~ret5;call #t~mem6 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, 4 + ~#x~0.offset, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, 4 + ~#x~0.offset, 4); {37712#false} is VALID [2018-11-23 12:28:47,837 INFO L256 TraceCheckUtils]: 122: Hoare triple {37712#false} call #t~ret8 := bor(~#x~0.base, ~#x~0.offset); {37711#true} is VALID [2018-11-23 12:28:47,837 INFO L273 TraceCheckUtils]: 123: Hoare triple {37711#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {37711#true} is VALID [2018-11-23 12:28:47,837 INFO L273 TraceCheckUtils]: 124: Hoare triple {37711#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:47,837 INFO L273 TraceCheckUtils]: 125: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:47,837 INFO L273 TraceCheckUtils]: 126: Hoare triple {37711#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:47,837 INFO L273 TraceCheckUtils]: 127: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:47,837 INFO L273 TraceCheckUtils]: 128: Hoare triple {37711#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:47,837 INFO L273 TraceCheckUtils]: 129: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:47,837 INFO L273 TraceCheckUtils]: 130: Hoare triple {37711#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:47,837 INFO L273 TraceCheckUtils]: 131: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:47,838 INFO L273 TraceCheckUtils]: 132: Hoare triple {37711#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:47,838 INFO L273 TraceCheckUtils]: 133: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:47,838 INFO L273 TraceCheckUtils]: 134: Hoare triple {37711#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:47,838 INFO L273 TraceCheckUtils]: 135: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:47,838 INFO L273 TraceCheckUtils]: 136: Hoare triple {37711#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:47,838 INFO L273 TraceCheckUtils]: 137: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:47,838 INFO L273 TraceCheckUtils]: 138: Hoare triple {37711#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:47,838 INFO L273 TraceCheckUtils]: 139: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:47,838 INFO L273 TraceCheckUtils]: 140: Hoare triple {37711#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:47,838 INFO L273 TraceCheckUtils]: 141: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:47,839 INFO L273 TraceCheckUtils]: 142: Hoare triple {37711#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:47,839 INFO L273 TraceCheckUtils]: 143: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:47,839 INFO L273 TraceCheckUtils]: 144: Hoare triple {37711#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:47,839 INFO L273 TraceCheckUtils]: 145: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:47,839 INFO L273 TraceCheckUtils]: 146: Hoare triple {37711#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:47,839 INFO L273 TraceCheckUtils]: 147: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:47,839 INFO L273 TraceCheckUtils]: 148: Hoare triple {37711#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:47,839 INFO L273 TraceCheckUtils]: 149: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:47,839 INFO L273 TraceCheckUtils]: 150: Hoare triple {37711#true} assume !(~i~0 < 100000); {37711#true} is VALID [2018-11-23 12:28:47,839 INFO L273 TraceCheckUtils]: 151: Hoare triple {37711#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {37711#true} is VALID [2018-11-23 12:28:47,840 INFO L273 TraceCheckUtils]: 152: Hoare triple {37711#true} assume true; {37711#true} is VALID [2018-11-23 12:28:47,840 INFO L268 TraceCheckUtils]: 153: Hoare quadruple {37711#true} {37712#false} #72#return; {37712#false} is VALID [2018-11-23 12:28:47,840 INFO L273 TraceCheckUtils]: 154: Hoare triple {37712#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~ret2~0 := #t~ret8;havoc #t~ret8;call #t~mem9 := read~int(~#x~0.base, ~#x~0.offset, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {37712#false} is VALID [2018-11-23 12:28:47,840 INFO L273 TraceCheckUtils]: 155: Hoare triple {37712#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {37712#false} is VALID [2018-11-23 12:28:47,840 INFO L273 TraceCheckUtils]: 156: Hoare triple {37712#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {37712#false} is VALID [2018-11-23 12:28:47,840 INFO L273 TraceCheckUtils]: 157: Hoare triple {37712#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {37712#false} is VALID [2018-11-23 12:28:47,840 INFO L273 TraceCheckUtils]: 158: Hoare triple {37712#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {37712#false} is VALID [2018-11-23 12:28:47,840 INFO L273 TraceCheckUtils]: 159: Hoare triple {37712#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {37712#false} is VALID [2018-11-23 12:28:47,840 INFO L273 TraceCheckUtils]: 160: Hoare triple {37712#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {37712#false} is VALID [2018-11-23 12:28:47,840 INFO L273 TraceCheckUtils]: 161: Hoare triple {37712#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {37712#false} is VALID [2018-11-23 12:28:47,841 INFO L273 TraceCheckUtils]: 162: Hoare triple {37712#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {37712#false} is VALID [2018-11-23 12:28:47,841 INFO L273 TraceCheckUtils]: 163: Hoare triple {37712#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {37712#false} is VALID [2018-11-23 12:28:47,841 INFO L273 TraceCheckUtils]: 164: Hoare triple {37712#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {37712#false} is VALID [2018-11-23 12:28:47,841 INFO L273 TraceCheckUtils]: 165: Hoare triple {37712#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {37712#false} is VALID [2018-11-23 12:28:47,841 INFO L273 TraceCheckUtils]: 166: Hoare triple {37712#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {37712#false} is VALID [2018-11-23 12:28:47,841 INFO L273 TraceCheckUtils]: 167: Hoare triple {37712#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {37712#false} is VALID [2018-11-23 12:28:47,841 INFO L273 TraceCheckUtils]: 168: Hoare triple {37712#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {37712#false} is VALID [2018-11-23 12:28:47,841 INFO L273 TraceCheckUtils]: 169: Hoare triple {37712#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {37712#false} is VALID [2018-11-23 12:28:47,841 INFO L273 TraceCheckUtils]: 170: Hoare triple {37712#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {37712#false} is VALID [2018-11-23 12:28:47,841 INFO L273 TraceCheckUtils]: 171: Hoare triple {37712#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {37712#false} is VALID [2018-11-23 12:28:47,842 INFO L273 TraceCheckUtils]: 172: Hoare triple {37712#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {37712#false} is VALID [2018-11-23 12:28:47,842 INFO L273 TraceCheckUtils]: 173: Hoare triple {37712#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {37712#false} is VALID [2018-11-23 12:28:47,842 INFO L273 TraceCheckUtils]: 174: Hoare triple {37712#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {37712#false} is VALID [2018-11-23 12:28:47,842 INFO L273 TraceCheckUtils]: 175: Hoare triple {37712#false} assume !!(~i~2 < 99999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + 4 * (1 + ~i~2), 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + 4 * ~i~2, 4);havoc #t~mem11; {37712#false} is VALID [2018-11-23 12:28:47,842 INFO L273 TraceCheckUtils]: 176: Hoare triple {37712#false} #t~post10 := ~i~2;~i~2 := 1 + #t~post10;havoc #t~post10; {37712#false} is VALID [2018-11-23 12:28:47,842 INFO L273 TraceCheckUtils]: 177: Hoare triple {37712#false} assume !(~i~2 < 99999); {37712#false} is VALID [2018-11-23 12:28:47,842 INFO L273 TraceCheckUtils]: 178: Hoare triple {37712#false} call write~int(~temp~0, ~#x~0.base, 399996 + ~#x~0.offset, 4); {37712#false} is VALID [2018-11-23 12:28:47,842 INFO L256 TraceCheckUtils]: 179: Hoare triple {37712#false} call #t~ret12 := bor(~#x~0.base, ~#x~0.offset); {37711#true} is VALID [2018-11-23 12:28:47,842 INFO L273 TraceCheckUtils]: 180: Hoare triple {37711#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {37711#true} is VALID [2018-11-23 12:28:47,842 INFO L273 TraceCheckUtils]: 181: Hoare triple {37711#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:47,843 INFO L273 TraceCheckUtils]: 182: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:47,843 INFO L273 TraceCheckUtils]: 183: Hoare triple {37711#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:47,843 INFO L273 TraceCheckUtils]: 184: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:47,843 INFO L273 TraceCheckUtils]: 185: Hoare triple {37711#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:47,843 INFO L273 TraceCheckUtils]: 186: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:47,843 INFO L273 TraceCheckUtils]: 187: Hoare triple {37711#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:47,843 INFO L273 TraceCheckUtils]: 188: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:47,843 INFO L273 TraceCheckUtils]: 189: Hoare triple {37711#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:47,843 INFO L273 TraceCheckUtils]: 190: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:47,843 INFO L273 TraceCheckUtils]: 191: Hoare triple {37711#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:47,844 INFO L273 TraceCheckUtils]: 192: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:47,844 INFO L273 TraceCheckUtils]: 193: Hoare triple {37711#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:47,844 INFO L273 TraceCheckUtils]: 194: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:47,844 INFO L273 TraceCheckUtils]: 195: Hoare triple {37711#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:47,844 INFO L273 TraceCheckUtils]: 196: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:47,844 INFO L273 TraceCheckUtils]: 197: Hoare triple {37711#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:47,844 INFO L273 TraceCheckUtils]: 198: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:47,844 INFO L273 TraceCheckUtils]: 199: Hoare triple {37711#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:47,844 INFO L273 TraceCheckUtils]: 200: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:47,844 INFO L273 TraceCheckUtils]: 201: Hoare triple {37711#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:47,845 INFO L273 TraceCheckUtils]: 202: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:47,845 INFO L273 TraceCheckUtils]: 203: Hoare triple {37711#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:47,845 INFO L273 TraceCheckUtils]: 204: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:47,845 INFO L273 TraceCheckUtils]: 205: Hoare triple {37711#true} assume !!(~i~0 < 100000);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseOr(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:28:47,845 INFO L273 TraceCheckUtils]: 206: Hoare triple {37711#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37711#true} is VALID [2018-11-23 12:28:47,845 INFO L273 TraceCheckUtils]: 207: Hoare triple {37711#true} assume !(~i~0 < 100000); {37711#true} is VALID [2018-11-23 12:28:47,845 INFO L273 TraceCheckUtils]: 208: Hoare triple {37711#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {37711#true} is VALID [2018-11-23 12:28:47,845 INFO L273 TraceCheckUtils]: 209: Hoare triple {37711#true} assume true; {37711#true} is VALID [2018-11-23 12:28:47,845 INFO L268 TraceCheckUtils]: 210: Hoare quadruple {37711#true} {37712#false} #74#return; {37712#false} is VALID [2018-11-23 12:28:47,845 INFO L273 TraceCheckUtils]: 211: Hoare triple {37712#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {37712#false} is VALID [2018-11-23 12:28:47,846 INFO L273 TraceCheckUtils]: 212: Hoare triple {37712#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {37712#false} is VALID [2018-11-23 12:28:47,846 INFO L273 TraceCheckUtils]: 213: Hoare triple {37712#false} assume !false; {37712#false} is VALID [2018-11-23 12:28:47,865 INFO L134 CoverageAnalysis]: Checked inductivity of 3416 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 1735 trivial. 0 not checked. [2018-11-23 12:28:47,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:28:47,866 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:28:47,875 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1