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/bAnd1_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:23:54,229 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:23:54,231 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:23:54,246 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:23:54,247 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:23:54,248 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:23:54,249 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:23:54,252 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:23:54,254 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:23:54,255 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:23:54,263 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:23:54,263 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:23:54,264 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:23:54,265 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:23:54,267 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:23:54,268 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:23:54,270 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:23:54,273 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:23:54,277 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:23:54,279 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:23:54,281 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:23:54,284 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:23:54,286 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:23:54,286 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:23:54,289 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:23:54,290 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:23:54,291 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:23:54,293 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:23:54,294 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:23:54,295 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:23:54,295 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:23:54,297 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:23:54,297 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:23:54,298 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:23:54,298 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:23:54,299 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:23:54,299 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:23:54,314 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:23:54,314 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:23:54,315 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:23:54,315 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:23:54,315 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:23:54,316 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:23:54,316 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:23:54,316 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:23:54,316 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:23:54,316 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:23:54,317 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:23:54,317 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:23:54,317 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:23:54,317 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:23:54,317 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:23:54,317 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:23:54,318 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:23:54,318 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:23:54,318 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:23:54,318 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:23:54,318 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:23:54,319 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:23:54,319 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:23:54,319 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:23:54,319 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:23:54,319 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:23:54,320 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:23:54,320 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:23:54,320 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:23:54,320 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:23:54,320 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:23:54,371 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:23:54,383 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:23:54,387 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:23:54,389 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:23:54,389 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:23:54,390 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/bAnd1_true-unreach-call.i [2018-11-23 12:23:54,452 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/893d6ff73/136cc91f4b75472285930d371901f659/FLAG0d2626295 [2018-11-23 12:23:54,878 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:23:54,879 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/bAnd1_true-unreach-call.i [2018-11-23 12:23:54,884 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/893d6ff73/136cc91f4b75472285930d371901f659/FLAG0d2626295 [2018-11-23 12:23:55,260 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/893d6ff73/136cc91f4b75472285930d371901f659 [2018-11-23 12:23:55,269 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:23:55,270 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:23:55,271 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:23:55,271 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:23:55,275 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:23:55,276 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:23:55" (1/1) ... [2018-11-23 12:23:55,279 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a6e76f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:55, skipping insertion in model container [2018-11-23 12:23:55,280 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:23:55" (1/1) ... [2018-11-23 12:23:55,290 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:23:55,318 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:23:55,567 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:23:55,578 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:23:55,610 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:23:55,637 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:23:55,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:55 WrapperNode [2018-11-23 12:23:55,638 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:23:55,639 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:23:55,639 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:23:55,639 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:23:55,649 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:23:55" (1/1) ... [2018-11-23 12:23:55,657 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:23:55" (1/1) ... [2018-11-23 12:23:55,663 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:23:55,663 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:23:55,663 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:23:55,663 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:23:55,671 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:55" (1/1) ... [2018-11-23 12:23:55,671 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:55" (1/1) ... [2018-11-23 12:23:55,673 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:55" (1/1) ... [2018-11-23 12:23:55,674 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:55" (1/1) ... [2018-11-23 12:23:55,693 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:55" (1/1) ... [2018-11-23 12:23:55,704 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:55" (1/1) ... [2018-11-23 12:23:55,706 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:55" (1/1) ... [2018-11-23 12:23:55,713 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:23:55,714 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:23:55,714 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:23:55,714 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:23:55,715 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23: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:23:55,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:23:55,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:23:55,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:23:55,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:23:55,837 INFO L130 BoogieDeclarations]: Found specification of procedure bAnd [2018-11-23 12:23:55,838 INFO L138 BoogieDeclarations]: Found implementation of procedure bAnd [2018-11-23 12:23:55,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:23:55,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:23:55,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:23:55,838 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:23:55,838 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:23:55,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:23:56,498 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:23:56,499 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 12:23:56,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:23:56 BoogieIcfgContainer [2018-11-23 12:23:56,500 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:23:56,502 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:23:56,502 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:23:56,505 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:23:56,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:23:55" (1/3) ... [2018-11-23 12:23:56,506 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34a4ddc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:23:56, skipping insertion in model container [2018-11-23 12:23:56,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:55" (2/3) ... [2018-11-23 12:23:56,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34a4ddc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:23:56, skipping insertion in model container [2018-11-23 12:23:56,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:23:56" (3/3) ... [2018-11-23 12:23:56,510 INFO L112 eAbstractionObserver]: Analyzing ICFG bAnd1_true-unreach-call.i [2018-11-23 12:23:56,520 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:23:56,530 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:23:56,549 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:23:56,586 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:23:56,587 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:23:56,587 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:23:56,587 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:23:56,587 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:23:56,588 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:23:56,588 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:23:56,588 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:23:56,588 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:23:56,606 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-23 12:23:56,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:23:56,613 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:23:56,614 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:23:56,617 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:23:56,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:23:56,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1283808693, now seen corresponding path program 1 times [2018-11-23 12:23:56,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:23:56,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:23:56,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:56,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:23:56,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:56,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:56,822 INFO L256 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {34#true} is VALID [2018-11-23 12:23:56,826 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:23:56,827 INFO L273 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:23:56,828 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #66#return; {34#true} is VALID [2018-11-23 12:23:56,828 INFO L256 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret13 := main(); {34#true} is VALID [2018-11-23 12:23:56,829 INFO L273 TraceCheckUtils]: 5: Hoare triple {34#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {34#true} is VALID [2018-11-23 12:23:56,842 INFO L273 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2018-11-23 12:23:56,842 INFO L256 TraceCheckUtils]: 7: Hoare triple {35#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {34#true} is VALID [2018-11-23 12:23:56,843 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:23:56,843 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#true} assume !(~i~0 < 100); {34#true} is VALID [2018-11-23 12:23:56,843 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:23:56,844 INFO L273 TraceCheckUtils]: 11: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:23:56,844 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {34#true} {35#false} #70#return; {35#false} is VALID [2018-11-23 12:23:56,844 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:23:56,845 INFO L256 TraceCheckUtils]: 14: Hoare triple {35#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {34#true} is VALID [2018-11-23 12:23:56,845 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:23:56,845 INFO L273 TraceCheckUtils]: 16: Hoare triple {34#true} assume !(~i~0 < 100); {34#true} is VALID [2018-11-23 12:23:56,846 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:23:56,846 INFO L273 TraceCheckUtils]: 18: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:23:56,846 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {34#true} {35#false} #72#return; {35#false} is VALID [2018-11-23 12:23:56,847 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:23:56,847 INFO L273 TraceCheckUtils]: 21: Hoare triple {35#false} assume !true; {35#false} is VALID [2018-11-23 12:23:56,848 INFO L273 TraceCheckUtils]: 22: Hoare triple {35#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {35#false} is VALID [2018-11-23 12:23:56,848 INFO L256 TraceCheckUtils]: 23: Hoare triple {35#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {34#true} is VALID [2018-11-23 12:23:56,848 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:23:56,849 INFO L273 TraceCheckUtils]: 25: Hoare triple {34#true} assume !(~i~0 < 100); {34#true} is VALID [2018-11-23 12:23:56,849 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:23:56,849 INFO L273 TraceCheckUtils]: 27: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:23:56,849 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {34#true} {35#false} #74#return; {35#false} is VALID [2018-11-23 12:23:56,850 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:23:56,850 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:23:56,851 INFO L273 TraceCheckUtils]: 31: Hoare triple {35#false} assume !false; {35#false} is VALID [2018-11-23 12:23:56,857 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:23:56,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:23:56,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:23:56,865 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-23 12:23:56,868 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:23:56,872 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:23:57,084 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:23:57,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:23:57,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:23:57,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:23:57,097 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-11-23 12:23:57,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:57,413 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2018-11-23 12:23:57,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:23:57,413 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-23 12:23:57,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:23:57,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:23:57,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-23 12:23:57,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:23:57,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-23 12:23:57,433 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 71 transitions. [2018-11-23 12:23:57,716 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:23:57,727 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:23:57,728 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 12:23:57,731 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:23:57,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 12:23:57,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 12:23:57,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:23:57,814 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-23 12:23:57,814 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 12:23:57,815 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 12:23:57,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:57,821 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-23 12:23:57,821 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 12:23:57,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:57,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:57,822 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 12:23:57,823 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 12:23:57,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:57,829 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-23 12:23:57,830 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 12:23:57,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:57,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:57,831 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:23:57,831 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:23:57,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:23:57,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-11-23 12:23:57,837 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 32 [2018-11-23 12:23:57,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:23:57,837 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-23 12:23:57,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:23:57,837 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 12:23:57,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:23:57,839 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:23:57,839 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:23:57,840 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:23:57,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:23:57,840 INFO L82 PathProgramCache]: Analyzing trace with hash 721846027, now seen corresponding path program 1 times [2018-11-23 12:23:57,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:23:57,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:23:57,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:57,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:23:57,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:57,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:57,933 INFO L256 TraceCheckUtils]: 0: Hoare triple {198#true} call ULTIMATE.init(); {198#true} is VALID [2018-11-23 12:23:57,934 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:23:57,934 INFO L273 TraceCheckUtils]: 2: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:23:57,934 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {198#true} {198#true} #66#return; {198#true} is VALID [2018-11-23 12:23:57,935 INFO L256 TraceCheckUtils]: 4: Hoare triple {198#true} call #t~ret13 := main(); {198#true} is VALID [2018-11-23 12:23:57,939 INFO L273 TraceCheckUtils]: 5: Hoare triple {198#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:23:57,940 INFO L273 TraceCheckUtils]: 6: Hoare triple {200#(= main_~i~1 0)} assume !(~i~1 < 100); {199#false} is VALID [2018-11-23 12:23:57,940 INFO L256 TraceCheckUtils]: 7: Hoare triple {199#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {198#true} is VALID [2018-11-23 12:23:57,940 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:23:57,940 INFO L273 TraceCheckUtils]: 9: Hoare triple {198#true} assume !(~i~0 < 100); {198#true} is VALID [2018-11-23 12:23:57,941 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:23:57,941 INFO L273 TraceCheckUtils]: 11: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:23:57,941 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {198#true} {199#false} #70#return; {199#false} is VALID [2018-11-23 12:23:57,942 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:23:57,942 INFO L256 TraceCheckUtils]: 14: Hoare triple {199#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {198#true} is VALID [2018-11-23 12:23:57,942 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:23:57,942 INFO L273 TraceCheckUtils]: 16: Hoare triple {198#true} assume !(~i~0 < 100); {198#true} is VALID [2018-11-23 12:23:57,943 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:23:57,943 INFO L273 TraceCheckUtils]: 18: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:23:57,943 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {198#true} {199#false} #72#return; {199#false} is VALID [2018-11-23 12:23:57,944 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:23:57,944 INFO L273 TraceCheckUtils]: 21: Hoare triple {199#false} assume !(~i~2 < 99); {199#false} is VALID [2018-11-23 12:23:57,944 INFO L273 TraceCheckUtils]: 22: Hoare triple {199#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {199#false} is VALID [2018-11-23 12:23:57,945 INFO L256 TraceCheckUtils]: 23: Hoare triple {199#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {198#true} is VALID [2018-11-23 12:23:57,945 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:23:57,945 INFO L273 TraceCheckUtils]: 25: Hoare triple {198#true} assume !(~i~0 < 100); {198#true} is VALID [2018-11-23 12:23:57,946 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:23:57,946 INFO L273 TraceCheckUtils]: 27: Hoare triple {198#true} assume true; {198#true} is VALID [2018-11-23 12:23:57,946 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {198#true} {199#false} #74#return; {199#false} is VALID [2018-11-23 12:23:57,947 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:23:57,947 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:23:57,948 INFO L273 TraceCheckUtils]: 31: Hoare triple {199#false} assume !false; {199#false} is VALID [2018-11-23 12:23:57,950 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:23:57,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:23:57,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:23:57,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 12:23:57,953 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:23:57,953 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:23:58,020 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:23:58,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:23:58,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:23:58,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:23:58,021 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 3 states. [2018-11-23 12:23:58,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:58,534 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-23 12:23:58,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:23:58,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 12:23:58,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:23:58,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:23:58,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2018-11-23 12:23:58,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:23:58,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2018-11-23 12:23:58,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2018-11-23 12:23:58,758 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:23:58,760 INFO L225 Difference]: With dead ends: 46 [2018-11-23 12:23:58,760 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 12:23:58,761 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:23:58,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 12:23:58,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-23 12:23:58,779 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:23:58,779 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 27 states. [2018-11-23 12:23:58,780 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 27 states. [2018-11-23 12:23:58,780 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 27 states. [2018-11-23 12:23:58,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:58,783 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 12:23:58,784 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 12:23:58,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:58,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:58,785 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states. [2018-11-23 12:23:58,785 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states. [2018-11-23 12:23:58,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:58,788 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 12:23:58,788 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 12:23:58,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:58,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:58,789 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:23:58,789 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:23:58,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:23:58,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-23 12:23:58,792 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 32 [2018-11-23 12:23:58,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:23:58,793 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 12:23:58,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:23:58,793 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-23 12:23:58,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 12:23:58,794 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:23:58,795 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:23:58,795 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:23:58,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:23:58,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1487444845, now seen corresponding path program 1 times [2018-11-23 12:23:58,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:23:58,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:23:58,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:58,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:23:58,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:58,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:58,883 INFO L256 TraceCheckUtils]: 0: Hoare triple {362#true} call ULTIMATE.init(); {362#true} is VALID [2018-11-23 12:23:58,884 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:23:58,884 INFO L273 TraceCheckUtils]: 2: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:23:58,885 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {362#true} {362#true} #66#return; {362#true} is VALID [2018-11-23 12:23:58,885 INFO L256 TraceCheckUtils]: 4: Hoare triple {362#true} call #t~ret13 := main(); {362#true} is VALID [2018-11-23 12:23:58,886 INFO L273 TraceCheckUtils]: 5: Hoare triple {362#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {362#true} is VALID [2018-11-23 12:23:58,886 INFO L273 TraceCheckUtils]: 6: Hoare triple {362#true} assume !!(~i~1 < 100);assume -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:23:58,886 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:23:58,887 INFO L273 TraceCheckUtils]: 8: Hoare triple {362#true} assume !(~i~1 < 100); {362#true} is VALID [2018-11-23 12:23:58,887 INFO L256 TraceCheckUtils]: 9: Hoare triple {362#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {362#true} is VALID [2018-11-23 12:23:58,887 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#(= bAnd_~i~0 1)} is VALID [2018-11-23 12:23:58,898 INFO L273 TraceCheckUtils]: 11: Hoare triple {364#(= bAnd_~i~0 1)} assume !(~i~0 < 100); {363#false} is VALID [2018-11-23 12:23:58,898 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:23:58,898 INFO L273 TraceCheckUtils]: 13: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:23:58,899 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {363#false} {362#true} #70#return; {363#false} is VALID [2018-11-23 12:23:58,899 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:23:58,899 INFO L256 TraceCheckUtils]: 16: Hoare triple {363#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {362#true} is VALID [2018-11-23 12:23:58,900 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:23:58,900 INFO L273 TraceCheckUtils]: 18: Hoare triple {362#true} assume !(~i~0 < 100); {362#true} is VALID [2018-11-23 12:23:58,900 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:23:58,901 INFO L273 TraceCheckUtils]: 20: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:23:58,901 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {362#true} {363#false} #72#return; {363#false} is VALID [2018-11-23 12:23:58,901 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:23:58,902 INFO L273 TraceCheckUtils]: 23: Hoare triple {363#false} assume !(~i~2 < 99); {363#false} is VALID [2018-11-23 12:23:58,902 INFO L273 TraceCheckUtils]: 24: Hoare triple {363#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {363#false} is VALID [2018-11-23 12:23:58,902 INFO L256 TraceCheckUtils]: 25: Hoare triple {363#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {362#true} is VALID [2018-11-23 12:23:58,903 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:23:58,903 INFO L273 TraceCheckUtils]: 27: Hoare triple {362#true} assume !(~i~0 < 100); {362#true} is VALID [2018-11-23 12:23:58,903 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:23:58,904 INFO L273 TraceCheckUtils]: 29: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:23:58,904 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {362#true} {363#false} #74#return; {363#false} is VALID [2018-11-23 12:23:58,904 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:23:58,905 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:23:58,905 INFO L273 TraceCheckUtils]: 33: Hoare triple {363#false} assume !false; {363#false} is VALID [2018-11-23 12:23:58,907 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:23:58,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:23:58,908 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:23:58,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:23:58,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:58,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:58,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:23:59,139 INFO L256 TraceCheckUtils]: 0: Hoare triple {362#true} call ULTIMATE.init(); {362#true} is VALID [2018-11-23 12:23:59,140 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:23:59,140 INFO L273 TraceCheckUtils]: 2: Hoare triple {362#true} assume true; {362#true} is VALID [2018-11-23 12:23:59,140 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {362#true} {362#true} #66#return; {362#true} is VALID [2018-11-23 12:23:59,141 INFO L256 TraceCheckUtils]: 4: Hoare triple {362#true} call #t~ret13 := main(); {362#true} is VALID [2018-11-23 12:23:59,141 INFO L273 TraceCheckUtils]: 5: Hoare triple {362#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {362#true} is VALID [2018-11-23 12:23:59,142 INFO L273 TraceCheckUtils]: 6: Hoare triple {362#true} assume !!(~i~1 < 100);assume -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:23:59,142 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:23:59,143 INFO L273 TraceCheckUtils]: 8: Hoare triple {362#true} assume !(~i~1 < 100); {362#true} is VALID [2018-11-23 12:23:59,143 INFO L256 TraceCheckUtils]: 9: Hoare triple {362#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {362#true} is VALID [2018-11-23 12:23:59,147 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#(<= bAnd_~i~0 1)} is VALID [2018-11-23 12:23:59,148 INFO L273 TraceCheckUtils]: 11: Hoare triple {398#(<= bAnd_~i~0 1)} assume !(~i~0 < 100); {363#false} is VALID [2018-11-23 12:23:59,148 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:23:59,148 INFO L273 TraceCheckUtils]: 13: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:23:59,148 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {363#false} {362#true} #70#return; {363#false} is VALID [2018-11-23 12:23:59,149 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:23:59,149 INFO L256 TraceCheckUtils]: 16: Hoare triple {363#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {363#false} is VALID [2018-11-23 12:23:59,149 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:23:59,149 INFO L273 TraceCheckUtils]: 18: Hoare triple {363#false} assume !(~i~0 < 100); {363#false} is VALID [2018-11-23 12:23:59,150 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:23:59,150 INFO L273 TraceCheckUtils]: 20: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:23:59,150 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {363#false} {363#false} #72#return; {363#false} is VALID [2018-11-23 12:23:59,151 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:23:59,151 INFO L273 TraceCheckUtils]: 23: Hoare triple {363#false} assume !(~i~2 < 99); {363#false} is VALID [2018-11-23 12:23:59,152 INFO L273 TraceCheckUtils]: 24: Hoare triple {363#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {363#false} is VALID [2018-11-23 12:23:59,152 INFO L256 TraceCheckUtils]: 25: Hoare triple {363#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {363#false} is VALID [2018-11-23 12:23:59,152 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:23:59,153 INFO L273 TraceCheckUtils]: 27: Hoare triple {363#false} assume !(~i~0 < 100); {363#false} is VALID [2018-11-23 12:23:59,153 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:23:59,153 INFO L273 TraceCheckUtils]: 29: Hoare triple {363#false} assume true; {363#false} is VALID [2018-11-23 12:23:59,154 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {363#false} {363#false} #74#return; {363#false} is VALID [2018-11-23 12:23:59,154 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:23:59,154 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:23:59,155 INFO L273 TraceCheckUtils]: 33: Hoare triple {363#false} assume !false; {363#false} is VALID [2018-11-23 12:23:59,157 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:23:59,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:23:59,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-11-23 12:23:59,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 12:23:59,187 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:23:59,187 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:23:59,285 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:23:59,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:23:59,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:23:59,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:23:59,286 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 4 states. [2018-11-23 12:23:59,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:59,610 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2018-11-23 12:23:59,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:23:59,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 12:23:59,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:23:59,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:23:59,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2018-11-23 12:23:59,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:23:59,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2018-11-23 12:23:59,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2018-11-23 12:23:59,729 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:23:59,732 INFO L225 Difference]: With dead ends: 46 [2018-11-23 12:23:59,732 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 12:23:59,733 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:23:59,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 12:23:59,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-11-23 12:23:59,750 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:23:59,750 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 28 states. [2018-11-23 12:23:59,750 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 28 states. [2018-11-23 12:23:59,750 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 28 states. [2018-11-23 12:23:59,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:59,753 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-23 12:23:59,753 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 12:23:59,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:59,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:59,755 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 29 states. [2018-11-23 12:23:59,755 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 29 states. [2018-11-23 12:23:59,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:59,757 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-23 12:23:59,758 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 12:23:59,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:59,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:59,759 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:23:59,759 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:23:59,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:23:59,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-11-23 12:23:59,761 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 34 [2018-11-23 12:23:59,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:23:59,762 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-23 12:23:59,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:23:59,762 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 12:23:59,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 12:23:59,763 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:23:59,764 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:23:59,764 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:23:59,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:23:59,764 INFO L82 PathProgramCache]: Analyzing trace with hash 2063023467, now seen corresponding path program 1 times [2018-11-23 12:23:59,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:23:59,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:23:59,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:59,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:23:59,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:59,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:59,878 INFO L256 TraceCheckUtils]: 0: Hoare triple {630#true} call ULTIMATE.init(); {630#true} is VALID [2018-11-23 12:23:59,879 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:23:59,879 INFO L273 TraceCheckUtils]: 2: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:23:59,879 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {630#true} {630#true} #66#return; {630#true} is VALID [2018-11-23 12:23:59,879 INFO L256 TraceCheckUtils]: 4: Hoare triple {630#true} call #t~ret13 := main(); {630#true} is VALID [2018-11-23 12:23:59,880 INFO L273 TraceCheckUtils]: 5: Hoare triple {630#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {630#true} is VALID [2018-11-23 12:23:59,880 INFO L273 TraceCheckUtils]: 6: Hoare triple {630#true} assume !!(~i~1 < 100);assume -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:23:59,880 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:23:59,881 INFO L273 TraceCheckUtils]: 8: Hoare triple {630#true} assume !(~i~1 < 100); {630#true} is VALID [2018-11-23 12:23:59,881 INFO L256 TraceCheckUtils]: 9: Hoare triple {630#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {630#true} is VALID [2018-11-23 12:23:59,881 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:23:59,882 INFO L273 TraceCheckUtils]: 11: Hoare triple {630#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {630#true} is VALID [2018-11-23 12:23:59,882 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:23:59,882 INFO L273 TraceCheckUtils]: 13: Hoare triple {630#true} assume !(~i~0 < 100); {630#true} is VALID [2018-11-23 12:23:59,882 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:23:59,883 INFO L273 TraceCheckUtils]: 15: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:23:59,883 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {630#true} {630#true} #70#return; {630#true} is VALID [2018-11-23 12:23:59,883 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:23:59,884 INFO L256 TraceCheckUtils]: 18: Hoare triple {630#true} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {630#true} is VALID [2018-11-23 12:23:59,884 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:23:59,884 INFO L273 TraceCheckUtils]: 20: Hoare triple {630#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {630#true} is VALID [2018-11-23 12:23:59,885 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:23:59,885 INFO L273 TraceCheckUtils]: 22: Hoare triple {630#true} assume !(~i~0 < 100); {630#true} is VALID [2018-11-23 12:23:59,885 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:23:59,885 INFO L273 TraceCheckUtils]: 24: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:23:59,886 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {630#true} {630#true} #72#return; {630#true} is VALID [2018-11-23 12:23:59,895 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:23:59,899 INFO L273 TraceCheckUtils]: 27: Hoare triple {632#(= main_~i~2 0)} assume !(~i~2 < 99); {631#false} is VALID [2018-11-23 12:23:59,899 INFO L273 TraceCheckUtils]: 28: Hoare triple {631#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {631#false} is VALID [2018-11-23 12:23:59,899 INFO L256 TraceCheckUtils]: 29: Hoare triple {631#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {630#true} is VALID [2018-11-23 12:23:59,900 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:23:59,900 INFO L273 TraceCheckUtils]: 31: Hoare triple {630#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {630#true} is VALID [2018-11-23 12:23:59,900 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:23:59,900 INFO L273 TraceCheckUtils]: 33: Hoare triple {630#true} assume !(~i~0 < 100); {630#true} is VALID [2018-11-23 12:23:59,901 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:23:59,901 INFO L273 TraceCheckUtils]: 35: Hoare triple {630#true} assume true; {630#true} is VALID [2018-11-23 12:23:59,901 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {630#true} {631#false} #74#return; {631#false} is VALID [2018-11-23 12:23:59,901 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:23:59,901 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:23:59,902 INFO L273 TraceCheckUtils]: 39: Hoare triple {631#false} assume !false; {631#false} is VALID [2018-11-23 12:23:59,905 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:23:59,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:23:59,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:23:59,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-23 12:23:59,906 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:23:59,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:23:59,973 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:23:59,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:23:59,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:23:59,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:23:59,974 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 3 states. [2018-11-23 12:24:00,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:00,069 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-11-23 12:24:00,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:24:00,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-23 12:24:00,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:00,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:24:00,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2018-11-23 12:24:00,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:24:00,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2018-11-23 12:24:00,074 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 45 transitions. [2018-11-23 12:24:00,169 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:24:00,171 INFO L225 Difference]: With dead ends: 43 [2018-11-23 12:24:00,171 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 12:24:00,171 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:24:00,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 12:24:00,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-23 12:24:00,221 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:00,221 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2018-11-23 12:24:00,221 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2018-11-23 12:24:00,221 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2018-11-23 12:24:00,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:00,225 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-23 12:24:00,227 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-23 12:24:00,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:00,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:00,228 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2018-11-23 12:24:00,228 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2018-11-23 12:24:00,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:00,235 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-23 12:24:00,235 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-23 12:24:00,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:00,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:00,236 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:00,236 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:00,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:24:00,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-11-23 12:24:00,240 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 40 [2018-11-23 12:24:00,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:00,242 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-23 12:24:00,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:24:00,242 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 12:24:00,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 12:24:00,246 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:00,247 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:24:00,247 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:00,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:00,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1550668567, now seen corresponding path program 1 times [2018-11-23 12:24:00,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:00,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:00,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:00,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:24:00,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:00,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:00,380 INFO L256 TraceCheckUtils]: 0: Hoare triple {799#true} call ULTIMATE.init(); {799#true} is VALID [2018-11-23 12:24:00,381 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:24:00,381 INFO L273 TraceCheckUtils]: 2: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:24:00,381 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {799#true} {799#true} #66#return; {799#true} is VALID [2018-11-23 12:24:00,381 INFO L256 TraceCheckUtils]: 4: Hoare triple {799#true} call #t~ret13 := main(); {799#true} is VALID [2018-11-23 12:24:00,382 INFO L273 TraceCheckUtils]: 5: Hoare triple {799#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:24:00,382 INFO L273 TraceCheckUtils]: 6: Hoare triple {801#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:24:00,383 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:24:00,383 INFO L273 TraceCheckUtils]: 8: Hoare triple {802#(<= main_~i~1 1)} assume !(~i~1 < 100); {800#false} is VALID [2018-11-23 12:24:00,384 INFO L256 TraceCheckUtils]: 9: Hoare triple {800#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {799#true} is VALID [2018-11-23 12:24:00,384 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:24:00,384 INFO L273 TraceCheckUtils]: 11: Hoare triple {799#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {799#true} is VALID [2018-11-23 12:24:00,384 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:24:00,385 INFO L273 TraceCheckUtils]: 13: Hoare triple {799#true} assume !(~i~0 < 100); {799#true} is VALID [2018-11-23 12:24:00,385 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:24:00,385 INFO L273 TraceCheckUtils]: 15: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:24:00,385 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {799#true} {800#false} #70#return; {800#false} is VALID [2018-11-23 12:24:00,386 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:24:00,386 INFO L256 TraceCheckUtils]: 18: Hoare triple {800#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {799#true} is VALID [2018-11-23 12:24:00,387 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:24:00,387 INFO L273 TraceCheckUtils]: 20: Hoare triple {799#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {799#true} is VALID [2018-11-23 12:24:00,387 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:24:00,388 INFO L273 TraceCheckUtils]: 22: Hoare triple {799#true} assume !(~i~0 < 100); {799#true} is VALID [2018-11-23 12:24:00,388 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:24:00,388 INFO L273 TraceCheckUtils]: 24: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:24:00,389 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {799#true} {800#false} #72#return; {800#false} is VALID [2018-11-23 12:24:00,389 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:24:00,389 INFO L273 TraceCheckUtils]: 27: Hoare triple {800#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:00,390 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:24:00,390 INFO L273 TraceCheckUtils]: 29: Hoare triple {800#false} assume !(~i~2 < 99); {800#false} is VALID [2018-11-23 12:24:00,390 INFO L273 TraceCheckUtils]: 30: Hoare triple {800#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {800#false} is VALID [2018-11-23 12:24:00,390 INFO L256 TraceCheckUtils]: 31: Hoare triple {800#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {799#true} is VALID [2018-11-23 12:24:00,391 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:24:00,391 INFO L273 TraceCheckUtils]: 33: Hoare triple {799#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {799#true} is VALID [2018-11-23 12:24:00,391 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:24:00,391 INFO L273 TraceCheckUtils]: 35: Hoare triple {799#true} assume !(~i~0 < 100); {799#true} is VALID [2018-11-23 12:24:00,392 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:24:00,392 INFO L273 TraceCheckUtils]: 37: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:24:00,392 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {799#true} {800#false} #74#return; {800#false} is VALID [2018-11-23 12:24:00,393 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:24:00,393 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:24:00,393 INFO L273 TraceCheckUtils]: 41: Hoare triple {800#false} assume !false; {800#false} is VALID [2018-11-23 12:24:00,396 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:24:00,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:00,397 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:24:00,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:24:00,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:00,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:00,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:00,735 INFO L256 TraceCheckUtils]: 0: Hoare triple {799#true} call ULTIMATE.init(); {799#true} is VALID [2018-11-23 12:24:00,735 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:24:00,735 INFO L273 TraceCheckUtils]: 2: Hoare triple {799#true} assume true; {799#true} is VALID [2018-11-23 12:24:00,736 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {799#true} {799#true} #66#return; {799#true} is VALID [2018-11-23 12:24:00,736 INFO L256 TraceCheckUtils]: 4: Hoare triple {799#true} call #t~ret13 := main(); {799#true} is VALID [2018-11-23 12:24:00,737 INFO L273 TraceCheckUtils]: 5: Hoare triple {799#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:24:00,738 INFO L273 TraceCheckUtils]: 6: Hoare triple {821#(<= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:24:00,738 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:24:00,739 INFO L273 TraceCheckUtils]: 8: Hoare triple {802#(<= main_~i~1 1)} assume !(~i~1 < 100); {800#false} is VALID [2018-11-23 12:24:00,739 INFO L256 TraceCheckUtils]: 9: Hoare triple {800#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {800#false} is VALID [2018-11-23 12:24:00,739 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:24:00,740 INFO L273 TraceCheckUtils]: 11: Hoare triple {800#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {800#false} is VALID [2018-11-23 12:24:00,740 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:24:00,740 INFO L273 TraceCheckUtils]: 13: Hoare triple {800#false} assume !(~i~0 < 100); {800#false} is VALID [2018-11-23 12:24:00,741 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:24:00,741 INFO L273 TraceCheckUtils]: 15: Hoare triple {800#false} assume true; {800#false} is VALID [2018-11-23 12:24:00,742 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {800#false} {800#false} #70#return; {800#false} is VALID [2018-11-23 12:24:00,742 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:24:00,742 INFO L256 TraceCheckUtils]: 18: Hoare triple {800#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {800#false} is VALID [2018-11-23 12:24:00,743 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:24:00,743 INFO L273 TraceCheckUtils]: 20: Hoare triple {800#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {800#false} is VALID [2018-11-23 12:24:00,743 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:24:00,743 INFO L273 TraceCheckUtils]: 22: Hoare triple {800#false} assume !(~i~0 < 100); {800#false} is VALID [2018-11-23 12:24:00,744 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:24:00,744 INFO L273 TraceCheckUtils]: 24: Hoare triple {800#false} assume true; {800#false} is VALID [2018-11-23 12:24:00,744 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {800#false} {800#false} #72#return; {800#false} is VALID [2018-11-23 12:24:00,744 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:24:00,744 INFO L273 TraceCheckUtils]: 27: Hoare triple {800#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:00,745 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:24:00,745 INFO L273 TraceCheckUtils]: 29: Hoare triple {800#false} assume !(~i~2 < 99); {800#false} is VALID [2018-11-23 12:24:00,745 INFO L273 TraceCheckUtils]: 30: Hoare triple {800#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {800#false} is VALID [2018-11-23 12:24:00,745 INFO L256 TraceCheckUtils]: 31: Hoare triple {800#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {800#false} is VALID [2018-11-23 12:24:00,745 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:24:00,746 INFO L273 TraceCheckUtils]: 33: Hoare triple {800#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {800#false} is VALID [2018-11-23 12:24:00,746 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:24:00,746 INFO L273 TraceCheckUtils]: 35: Hoare triple {800#false} assume !(~i~0 < 100); {800#false} is VALID [2018-11-23 12:24:00,747 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:24:00,747 INFO L273 TraceCheckUtils]: 37: Hoare triple {800#false} assume true; {800#false} is VALID [2018-11-23 12:24:00,747 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {800#false} {800#false} #74#return; {800#false} is VALID [2018-11-23 12:24:00,747 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:24:00,748 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:24:00,748 INFO L273 TraceCheckUtils]: 41: Hoare triple {800#false} assume !false; {800#false} is VALID [2018-11-23 12:24:00,750 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:24:00,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:00,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 12:24:00,770 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-11-23 12:24:00,771 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:00,771 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:24:00,833 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:24:00,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:24:00,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:24:00,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:24:00,835 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 5 states. [2018-11-23 12:24:01,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:01,036 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-11-23 12:24:01,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:24:01,037 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-11-23 12:24:01,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:01,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:24:01,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2018-11-23 12:24:01,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:24:01,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2018-11-23 12:24:01,041 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2018-11-23 12:24:01,125 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:24:01,127 INFO L225 Difference]: With dead ends: 52 [2018-11-23 12:24:01,127 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 12:24:01,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:24:01,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 12:24:01,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-23 12:24:01,204 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:01,205 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 31 states. [2018-11-23 12:24:01,205 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 31 states. [2018-11-23 12:24:01,205 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 31 states. [2018-11-23 12:24:01,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:01,207 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 12:24:01,207 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 12:24:01,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:01,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:01,208 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 32 states. [2018-11-23 12:24:01,208 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 32 states. [2018-11-23 12:24:01,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:01,210 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 12:24:01,210 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 12:24:01,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:01,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:01,211 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:01,211 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:01,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:24:01,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-23 12:24:01,213 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 42 [2018-11-23 12:24:01,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:01,214 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-23 12:24:01,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:24:01,214 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-23 12:24:01,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 12:24:01,215 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:01,215 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:24:01,215 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:01,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:01,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1311885621, now seen corresponding path program 2 times [2018-11-23 12:24:01,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:01,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:01,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:01,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:24:01,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:01,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:01,441 INFO L256 TraceCheckUtils]: 0: Hoare triple {1114#true} call ULTIMATE.init(); {1114#true} is VALID [2018-11-23 12:24:01,442 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:24:01,442 INFO L273 TraceCheckUtils]: 2: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:24:01,442 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1114#true} {1114#true} #66#return; {1114#true} is VALID [2018-11-23 12:24:01,442 INFO L256 TraceCheckUtils]: 4: Hoare triple {1114#true} call #t~ret13 := main(); {1114#true} is VALID [2018-11-23 12:24:01,444 INFO L273 TraceCheckUtils]: 5: Hoare triple {1114#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:24:01,449 INFO L273 TraceCheckUtils]: 6: Hoare triple {1116#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:24:01,450 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:24:01,450 INFO L273 TraceCheckUtils]: 8: Hoare triple {1117#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:24:01,451 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:24:01,451 INFO L273 TraceCheckUtils]: 10: Hoare triple {1118#(<= main_~i~1 2)} assume !(~i~1 < 100); {1115#false} is VALID [2018-11-23 12:24:01,452 INFO L256 TraceCheckUtils]: 11: Hoare triple {1115#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {1114#true} is VALID [2018-11-23 12:24:01,452 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:24:01,452 INFO L273 TraceCheckUtils]: 13: Hoare triple {1114#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {1114#true} is VALID [2018-11-23 12:24:01,452 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:24:01,453 INFO L273 TraceCheckUtils]: 15: Hoare triple {1114#true} assume !(~i~0 < 100); {1114#true} is VALID [2018-11-23 12:24:01,453 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:24:01,453 INFO L273 TraceCheckUtils]: 17: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:24:01,453 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1114#true} {1115#false} #70#return; {1115#false} is VALID [2018-11-23 12:24:01,454 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:24:01,454 INFO L256 TraceCheckUtils]: 20: Hoare triple {1115#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {1114#true} is VALID [2018-11-23 12:24:01,454 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:24:01,455 INFO L273 TraceCheckUtils]: 22: Hoare triple {1114#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {1114#true} is VALID [2018-11-23 12:24:01,455 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:24:01,455 INFO L273 TraceCheckUtils]: 24: Hoare triple {1114#true} assume !(~i~0 < 100); {1114#true} is VALID [2018-11-23 12:24:01,455 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:24:01,456 INFO L273 TraceCheckUtils]: 26: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:24:01,456 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1114#true} {1115#false} #72#return; {1115#false} is VALID [2018-11-23 12:24:01,456 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:24:01,456 INFO L273 TraceCheckUtils]: 29: Hoare triple {1115#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:01,456 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:24:01,457 INFO L273 TraceCheckUtils]: 31: Hoare triple {1115#false} assume !(~i~2 < 99); {1115#false} is VALID [2018-11-23 12:24:01,457 INFO L273 TraceCheckUtils]: 32: Hoare triple {1115#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {1115#false} is VALID [2018-11-23 12:24:01,457 INFO L256 TraceCheckUtils]: 33: Hoare triple {1115#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {1114#true} is VALID [2018-11-23 12:24:01,457 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:24:01,457 INFO L273 TraceCheckUtils]: 35: Hoare triple {1114#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {1114#true} is VALID [2018-11-23 12:24:01,458 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:24:01,458 INFO L273 TraceCheckUtils]: 37: Hoare triple {1114#true} assume !(~i~0 < 100); {1114#true} is VALID [2018-11-23 12:24:01,458 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:24:01,458 INFO L273 TraceCheckUtils]: 39: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:24:01,458 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1114#true} {1115#false} #74#return; {1115#false} is VALID [2018-11-23 12:24:01,459 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:24:01,459 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:24:01,459 INFO L273 TraceCheckUtils]: 43: Hoare triple {1115#false} assume !false; {1115#false} is VALID [2018-11-23 12:24:01,461 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:24:01,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:01,461 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:24:01,471 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:24:01,523 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:24:01,523 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:24:01,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:01,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:01,647 INFO L256 TraceCheckUtils]: 0: Hoare triple {1114#true} call ULTIMATE.init(); {1114#true} is VALID [2018-11-23 12:24:01,648 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:24:01,648 INFO L273 TraceCheckUtils]: 2: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 12:24:01,648 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1114#true} {1114#true} #66#return; {1114#true} is VALID [2018-11-23 12:24:01,648 INFO L256 TraceCheckUtils]: 4: Hoare triple {1114#true} call #t~ret13 := main(); {1114#true} is VALID [2018-11-23 12:24:01,649 INFO L273 TraceCheckUtils]: 5: Hoare triple {1114#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:24:01,650 INFO L273 TraceCheckUtils]: 6: Hoare triple {1137#(<= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:24:01,650 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:24:01,651 INFO L273 TraceCheckUtils]: 8: Hoare triple {1117#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:24:01,652 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:24:01,659 INFO L273 TraceCheckUtils]: 10: Hoare triple {1118#(<= main_~i~1 2)} assume !(~i~1 < 100); {1115#false} is VALID [2018-11-23 12:24:01,660 INFO L256 TraceCheckUtils]: 11: Hoare triple {1115#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {1115#false} is VALID [2018-11-23 12:24:01,660 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:24:01,660 INFO L273 TraceCheckUtils]: 13: Hoare triple {1115#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {1115#false} is VALID [2018-11-23 12:24:01,660 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:24:01,661 INFO L273 TraceCheckUtils]: 15: Hoare triple {1115#false} assume !(~i~0 < 100); {1115#false} is VALID [2018-11-23 12:24:01,661 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:24:01,661 INFO L273 TraceCheckUtils]: 17: Hoare triple {1115#false} assume true; {1115#false} is VALID [2018-11-23 12:24:01,661 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1115#false} {1115#false} #70#return; {1115#false} is VALID [2018-11-23 12:24:01,661 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:24:01,662 INFO L256 TraceCheckUtils]: 20: Hoare triple {1115#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {1115#false} is VALID [2018-11-23 12:24:01,662 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:24:01,662 INFO L273 TraceCheckUtils]: 22: Hoare triple {1115#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {1115#false} is VALID [2018-11-23 12:24:01,662 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:24:01,662 INFO L273 TraceCheckUtils]: 24: Hoare triple {1115#false} assume !(~i~0 < 100); {1115#false} is VALID [2018-11-23 12:24:01,663 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:24:01,663 INFO L273 TraceCheckUtils]: 26: Hoare triple {1115#false} assume true; {1115#false} is VALID [2018-11-23 12:24:01,663 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1115#false} {1115#false} #72#return; {1115#false} is VALID [2018-11-23 12:24:01,663 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:24:01,663 INFO L273 TraceCheckUtils]: 29: Hoare triple {1115#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:01,664 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:24:01,664 INFO L273 TraceCheckUtils]: 31: Hoare triple {1115#false} assume !(~i~2 < 99); {1115#false} is VALID [2018-11-23 12:24:01,664 INFO L273 TraceCheckUtils]: 32: Hoare triple {1115#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {1115#false} is VALID [2018-11-23 12:24:01,664 INFO L256 TraceCheckUtils]: 33: Hoare triple {1115#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {1115#false} is VALID [2018-11-23 12:24:01,664 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:24:01,665 INFO L273 TraceCheckUtils]: 35: Hoare triple {1115#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {1115#false} is VALID [2018-11-23 12:24:01,665 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:24:01,665 INFO L273 TraceCheckUtils]: 37: Hoare triple {1115#false} assume !(~i~0 < 100); {1115#false} is VALID [2018-11-23 12:24:01,665 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:24:01,666 INFO L273 TraceCheckUtils]: 39: Hoare triple {1115#false} assume true; {1115#false} is VALID [2018-11-23 12:24:01,666 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1115#false} {1115#false} #74#return; {1115#false} is VALID [2018-11-23 12:24:01,666 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:24:01,666 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:24:01,667 INFO L273 TraceCheckUtils]: 43: Hoare triple {1115#false} assume !false; {1115#false} is VALID [2018-11-23 12:24:01,669 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:24:01,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:01,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 12:24:01,688 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-11-23 12:24:01,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:01,689 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:24:01,749 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:24:01,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:24:01,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:24:01,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:24:01,750 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 6 states. [2018-11-23 12:24:01,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:01,920 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2018-11-23 12:24:01,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:24:01,920 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-11-23 12:24:01,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:01,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:24:01,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2018-11-23 12:24:01,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:24:01,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2018-11-23 12:24:01,925 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 58 transitions. [2018-11-23 12:24:02,046 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:24:02,047 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:24:02,047 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 12:24:02,048 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:24:02,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 12:24:02,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-23 12:24:02,199 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:02,199 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2018-11-23 12:24:02,199 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2018-11-23 12:24:02,200 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2018-11-23 12:24:02,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:02,202 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 12:24:02,202 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 12:24:02,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:02,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:02,203 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2018-11-23 12:24:02,203 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2018-11-23 12:24:02,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:02,205 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 12:24:02,205 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 12:24:02,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:02,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:02,206 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:02,206 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:02,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:24:02,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-23 12:24:02,208 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 44 [2018-11-23 12:24:02,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:02,208 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-23 12:24:02,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:24:02,209 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 12:24:02,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 12:24:02,209 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:02,210 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:24:02,210 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:02,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:02,210 INFO L82 PathProgramCache]: Analyzing trace with hash 525258797, now seen corresponding path program 3 times [2018-11-23 12:24:02,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:02,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:02,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:02,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:24:02,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:02,812 INFO L256 TraceCheckUtils]: 0: Hoare triple {1446#true} call ULTIMATE.init(); {1446#true} is VALID [2018-11-23 12:24:02,813 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:24:02,813 INFO L273 TraceCheckUtils]: 2: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:24:02,813 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1446#true} {1446#true} #66#return; {1446#true} is VALID [2018-11-23 12:24:02,814 INFO L256 TraceCheckUtils]: 4: Hoare triple {1446#true} call #t~ret13 := main(); {1446#true} is VALID [2018-11-23 12:24:02,815 INFO L273 TraceCheckUtils]: 5: Hoare triple {1446#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:24:02,815 INFO L273 TraceCheckUtils]: 6: Hoare triple {1448#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:24:02,816 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:24:02,817 INFO L273 TraceCheckUtils]: 8: Hoare triple {1449#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:24:02,817 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:24:02,818 INFO L273 TraceCheckUtils]: 10: Hoare triple {1450#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:24:02,818 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:24:02,819 INFO L273 TraceCheckUtils]: 12: Hoare triple {1451#(<= main_~i~1 3)} assume !(~i~1 < 100); {1447#false} is VALID [2018-11-23 12:24:02,819 INFO L256 TraceCheckUtils]: 13: Hoare triple {1447#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {1446#true} is VALID [2018-11-23 12:24:02,819 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:24:02,820 INFO L273 TraceCheckUtils]: 15: Hoare triple {1446#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {1446#true} is VALID [2018-11-23 12:24:02,820 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:24:02,821 INFO L273 TraceCheckUtils]: 17: Hoare triple {1446#true} assume !(~i~0 < 100); {1446#true} is VALID [2018-11-23 12:24:02,821 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:24:02,821 INFO L273 TraceCheckUtils]: 19: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:24:02,822 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1446#true} {1447#false} #70#return; {1447#false} is VALID [2018-11-23 12:24:02,822 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:24:02,823 INFO L256 TraceCheckUtils]: 22: Hoare triple {1447#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {1446#true} is VALID [2018-11-23 12:24:02,823 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:24:02,823 INFO L273 TraceCheckUtils]: 24: Hoare triple {1446#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {1446#true} is VALID [2018-11-23 12:24:02,824 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:24:02,824 INFO L273 TraceCheckUtils]: 26: Hoare triple {1446#true} assume !(~i~0 < 100); {1446#true} is VALID [2018-11-23 12:24:02,824 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:24:02,824 INFO L273 TraceCheckUtils]: 28: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:24:02,824 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1446#true} {1447#false} #72#return; {1447#false} is VALID [2018-11-23 12:24:02,825 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:24:02,825 INFO L273 TraceCheckUtils]: 31: Hoare triple {1447#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:02,825 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:24:02,826 INFO L273 TraceCheckUtils]: 33: Hoare triple {1447#false} assume !(~i~2 < 99); {1447#false} is VALID [2018-11-23 12:24:02,826 INFO L273 TraceCheckUtils]: 34: Hoare triple {1447#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {1447#false} is VALID [2018-11-23 12:24:02,826 INFO L256 TraceCheckUtils]: 35: Hoare triple {1447#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {1446#true} is VALID [2018-11-23 12:24:02,826 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:24:02,827 INFO L273 TraceCheckUtils]: 37: Hoare triple {1446#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {1446#true} is VALID [2018-11-23 12:24:02,827 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:24:02,827 INFO L273 TraceCheckUtils]: 39: Hoare triple {1446#true} assume !(~i~0 < 100); {1446#true} is VALID [2018-11-23 12:24:02,827 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:24:02,828 INFO L273 TraceCheckUtils]: 41: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:24:02,828 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1446#true} {1447#false} #74#return; {1447#false} is VALID [2018-11-23 12:24:02,828 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:24:02,828 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:24:02,829 INFO L273 TraceCheckUtils]: 45: Hoare triple {1447#false} assume !false; {1447#false} is VALID [2018-11-23 12:24:02,831 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:24:02,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:02,832 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:24:02,842 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:24:02,876 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 12:24:02,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:24:02,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:02,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:03,065 INFO L256 TraceCheckUtils]: 0: Hoare triple {1446#true} call ULTIMATE.init(); {1446#true} is VALID [2018-11-23 12:24:03,065 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:24:03,066 INFO L273 TraceCheckUtils]: 2: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:24:03,066 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1446#true} {1446#true} #66#return; {1446#true} is VALID [2018-11-23 12:24:03,066 INFO L256 TraceCheckUtils]: 4: Hoare triple {1446#true} call #t~ret13 := main(); {1446#true} is VALID [2018-11-23 12:24:03,067 INFO L273 TraceCheckUtils]: 5: Hoare triple {1446#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1446#true} is VALID [2018-11-23 12:24:03,067 INFO L273 TraceCheckUtils]: 6: Hoare triple {1446#true} assume !!(~i~1 < 100);assume -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:24:03,067 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:24:03,068 INFO L273 TraceCheckUtils]: 8: Hoare triple {1446#true} assume !!(~i~1 < 100);assume -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:24:03,068 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:24:03,068 INFO L273 TraceCheckUtils]: 10: Hoare triple {1446#true} assume !!(~i~1 < 100);assume -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:24:03,068 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:24:03,068 INFO L273 TraceCheckUtils]: 12: Hoare triple {1446#true} assume !(~i~1 < 100); {1446#true} is VALID [2018-11-23 12:24:03,068 INFO L256 TraceCheckUtils]: 13: Hoare triple {1446#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {1446#true} is VALID [2018-11-23 12:24:03,069 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:24:03,069 INFO L273 TraceCheckUtils]: 15: Hoare triple {1446#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {1446#true} is VALID [2018-11-23 12:24:03,069 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:24:03,069 INFO L273 TraceCheckUtils]: 17: Hoare triple {1446#true} assume !(~i~0 < 100); {1446#true} is VALID [2018-11-23 12:24:03,069 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:24:03,069 INFO L273 TraceCheckUtils]: 19: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:24:03,070 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {1446#true} {1446#true} #70#return; {1446#true} is VALID [2018-11-23 12:24:03,070 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:24:03,070 INFO L256 TraceCheckUtils]: 22: Hoare triple {1446#true} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {1446#true} is VALID [2018-11-23 12:24:03,070 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:24:03,070 INFO L273 TraceCheckUtils]: 24: Hoare triple {1446#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {1446#true} is VALID [2018-11-23 12:24:03,071 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:24:03,071 INFO L273 TraceCheckUtils]: 26: Hoare triple {1446#true} assume !(~i~0 < 100); {1446#true} is VALID [2018-11-23 12:24:03,071 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:24:03,071 INFO L273 TraceCheckUtils]: 28: Hoare triple {1446#true} assume true; {1446#true} is VALID [2018-11-23 12:24:03,071 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1446#true} {1446#true} #72#return; {1446#true} is VALID [2018-11-23 12:24:03,071 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:24:03,072 INFO L273 TraceCheckUtils]: 31: Hoare triple {1446#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:03,072 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:24:03,072 INFO L273 TraceCheckUtils]: 33: Hoare triple {1446#true} assume !(~i~2 < 99); {1446#true} is VALID [2018-11-23 12:24:03,072 INFO L273 TraceCheckUtils]: 34: Hoare triple {1446#true} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {1446#true} is VALID [2018-11-23 12:24:03,072 INFO L256 TraceCheckUtils]: 35: Hoare triple {1446#true} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {1446#true} is VALID [2018-11-23 12:24:03,073 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#(<= bAnd_~i~0 1)} is VALID [2018-11-23 12:24:03,073 INFO L273 TraceCheckUtils]: 37: Hoare triple {1563#(<= bAnd_~i~0 1)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {1563#(<= bAnd_~i~0 1)} is VALID [2018-11-23 12:24:03,074 INFO L273 TraceCheckUtils]: 38: Hoare triple {1563#(<= bAnd_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1570#(<= bAnd_~i~0 2)} is VALID [2018-11-23 12:24:03,075 INFO L273 TraceCheckUtils]: 39: Hoare triple {1570#(<= bAnd_~i~0 2)} assume !(~i~0 < 100); {1447#false} is VALID [2018-11-23 12:24:03,075 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:24:03,075 INFO L273 TraceCheckUtils]: 41: Hoare triple {1447#false} assume true; {1447#false} is VALID [2018-11-23 12:24:03,075 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1447#false} {1446#true} #74#return; {1447#false} is VALID [2018-11-23 12:24:03,075 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:24:03,075 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:24:03,076 INFO L273 TraceCheckUtils]: 45: Hoare triple {1447#false} assume !false; {1447#false} is VALID [2018-11-23 12:24:03,078 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:24:03,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:03,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-11-23 12:24:03,098 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-11-23 12:24:03,098 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:03,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:24:03,193 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:24:03,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:24:03,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:24:03,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:24:03,194 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 8 states. [2018-11-23 12:24:03,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:03,415 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2018-11-23 12:24:03,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:24:03,415 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-11-23 12:24:03,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:03,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:24:03,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2018-11-23 12:24:03,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:24:03,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2018-11-23 12:24:03,419 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 68 transitions. [2018-11-23 12:24:03,521 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:24:03,522 INFO L225 Difference]: With dead ends: 59 [2018-11-23 12:24:03,523 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 12:24:03,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:24:03,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 12:24:03,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-11-23 12:24:03,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:03,545 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 37 states. [2018-11-23 12:24:03,545 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 37 states. [2018-11-23 12:24:03,545 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 37 states. [2018-11-23 12:24:03,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:03,547 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-23 12:24:03,548 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 12:24:03,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:03,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:03,548 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 39 states. [2018-11-23 12:24:03,549 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 39 states. [2018-11-23 12:24:03,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:03,550 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-23 12:24:03,551 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 12:24:03,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:03,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:03,551 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:03,552 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:03,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:24:03,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-23 12:24:03,554 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 46 [2018-11-23 12:24:03,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:03,554 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-23 12:24:03,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:24:03,554 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-23 12:24:03,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 12:24:03,555 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:03,555 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:24:03,555 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:03,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:03,556 INFO L82 PathProgramCache]: Analyzing trace with hash -174499699, now seen corresponding path program 4 times [2018-11-23 12:24:03,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:03,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:03,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:03,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:24:03,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:03,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:03,716 INFO L256 TraceCheckUtils]: 0: Hoare triple {1809#true} call ULTIMATE.init(); {1809#true} is VALID [2018-11-23 12:24:03,717 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:24:03,717 INFO L273 TraceCheckUtils]: 2: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:24:03,717 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1809#true} {1809#true} #66#return; {1809#true} is VALID [2018-11-23 12:24:03,718 INFO L256 TraceCheckUtils]: 4: Hoare triple {1809#true} call #t~ret13 := main(); {1809#true} is VALID [2018-11-23 12:24:03,718 INFO L273 TraceCheckUtils]: 5: Hoare triple {1809#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:24:03,719 INFO L273 TraceCheckUtils]: 6: Hoare triple {1811#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:24:03,720 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:24:03,720 INFO L273 TraceCheckUtils]: 8: Hoare triple {1812#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:24:03,721 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:24:03,722 INFO L273 TraceCheckUtils]: 10: Hoare triple {1813#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:24:03,722 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:24:03,722 INFO L273 TraceCheckUtils]: 12: Hoare triple {1814#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -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:24:03,723 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:24:03,724 INFO L273 TraceCheckUtils]: 14: Hoare triple {1815#(<= main_~i~1 4)} assume !(~i~1 < 100); {1810#false} is VALID [2018-11-23 12:24:03,724 INFO L256 TraceCheckUtils]: 15: Hoare triple {1810#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {1809#true} is VALID [2018-11-23 12:24:03,725 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:24:03,725 INFO L273 TraceCheckUtils]: 17: Hoare triple {1809#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {1809#true} is VALID [2018-11-23 12:24:03,725 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:24:03,726 INFO L273 TraceCheckUtils]: 19: Hoare triple {1809#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {1809#true} is VALID [2018-11-23 12:24:03,726 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:24:03,726 INFO L273 TraceCheckUtils]: 21: Hoare triple {1809#true} assume !(~i~0 < 100); {1809#true} is VALID [2018-11-23 12:24:03,727 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:24:03,727 INFO L273 TraceCheckUtils]: 23: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:24:03,727 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1809#true} {1810#false} #70#return; {1810#false} is VALID [2018-11-23 12:24:03,727 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:24:03,728 INFO L256 TraceCheckUtils]: 26: Hoare triple {1810#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {1809#true} is VALID [2018-11-23 12:24:03,728 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:24:03,728 INFO L273 TraceCheckUtils]: 28: Hoare triple {1809#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {1809#true} is VALID [2018-11-23 12:24:03,728 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:24:03,729 INFO L273 TraceCheckUtils]: 30: Hoare triple {1809#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {1809#true} is VALID [2018-11-23 12:24:03,729 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:24:03,729 INFO L273 TraceCheckUtils]: 32: Hoare triple {1809#true} assume !(~i~0 < 100); {1809#true} is VALID [2018-11-23 12:24:03,729 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:24:03,730 INFO L273 TraceCheckUtils]: 34: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:24:03,730 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1809#true} {1810#false} #72#return; {1810#false} is VALID [2018-11-23 12:24:03,730 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:24:03,730 INFO L273 TraceCheckUtils]: 37: Hoare triple {1810#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:03,731 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:24:03,731 INFO L273 TraceCheckUtils]: 39: Hoare triple {1810#false} assume !(~i~2 < 99); {1810#false} is VALID [2018-11-23 12:24:03,731 INFO L273 TraceCheckUtils]: 40: Hoare triple {1810#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {1810#false} is VALID [2018-11-23 12:24:03,731 INFO L256 TraceCheckUtils]: 41: Hoare triple {1810#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {1809#true} is VALID [2018-11-23 12:24:03,732 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:24:03,732 INFO L273 TraceCheckUtils]: 43: Hoare triple {1809#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {1809#true} is VALID [2018-11-23 12:24:03,732 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:24:03,732 INFO L273 TraceCheckUtils]: 45: Hoare triple {1809#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {1809#true} is VALID [2018-11-23 12:24:03,733 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:24:03,733 INFO L273 TraceCheckUtils]: 47: Hoare triple {1809#true} assume !(~i~0 < 100); {1809#true} is VALID [2018-11-23 12:24:03,733 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:24:03,733 INFO L273 TraceCheckUtils]: 49: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:24:03,733 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {1809#true} {1810#false} #74#return; {1810#false} is VALID [2018-11-23 12:24:03,734 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:24:03,734 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:24:03,734 INFO L273 TraceCheckUtils]: 53: Hoare triple {1810#false} assume !false; {1810#false} is VALID [2018-11-23 12:24:03,738 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:24:03,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:03,738 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:24:03,756 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:24:03,817 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:24:03,817 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:24:03,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:03,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:03,966 INFO L256 TraceCheckUtils]: 0: Hoare triple {1809#true} call ULTIMATE.init(); {1809#true} is VALID [2018-11-23 12:24:03,966 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:24:03,966 INFO L273 TraceCheckUtils]: 2: Hoare triple {1809#true} assume true; {1809#true} is VALID [2018-11-23 12:24:03,967 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1809#true} {1809#true} #66#return; {1809#true} is VALID [2018-11-23 12:24:03,967 INFO L256 TraceCheckUtils]: 4: Hoare triple {1809#true} call #t~ret13 := main(); {1809#true} is VALID [2018-11-23 12:24:03,967 INFO L273 TraceCheckUtils]: 5: Hoare triple {1809#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:24:03,968 INFO L273 TraceCheckUtils]: 6: Hoare triple {1834#(<= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:24:03,968 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:24:03,969 INFO L273 TraceCheckUtils]: 8: Hoare triple {1812#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:24:03,969 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:24:03,970 INFO L273 TraceCheckUtils]: 10: Hoare triple {1813#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:24:03,971 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:24:03,972 INFO L273 TraceCheckUtils]: 12: Hoare triple {1814#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -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:24:03,973 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:24:03,973 INFO L273 TraceCheckUtils]: 14: Hoare triple {1815#(<= main_~i~1 4)} assume !(~i~1 < 100); {1810#false} is VALID [2018-11-23 12:24:03,974 INFO L256 TraceCheckUtils]: 15: Hoare triple {1810#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {1810#false} is VALID [2018-11-23 12:24:03,974 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:24:03,974 INFO L273 TraceCheckUtils]: 17: Hoare triple {1810#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {1810#false} is VALID [2018-11-23 12:24:03,974 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:24:03,975 INFO L273 TraceCheckUtils]: 19: Hoare triple {1810#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {1810#false} is VALID [2018-11-23 12:24:03,975 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:24:03,975 INFO L273 TraceCheckUtils]: 21: Hoare triple {1810#false} assume !(~i~0 < 100); {1810#false} is VALID [2018-11-23 12:24:03,976 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:24:03,976 INFO L273 TraceCheckUtils]: 23: Hoare triple {1810#false} assume true; {1810#false} is VALID [2018-11-23 12:24:03,977 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1810#false} {1810#false} #70#return; {1810#false} is VALID [2018-11-23 12:24:03,977 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:24:03,977 INFO L256 TraceCheckUtils]: 26: Hoare triple {1810#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {1810#false} is VALID [2018-11-23 12:24:03,978 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:24:03,978 INFO L273 TraceCheckUtils]: 28: Hoare triple {1810#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {1810#false} is VALID [2018-11-23 12:24:03,978 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:24:03,978 INFO L273 TraceCheckUtils]: 30: Hoare triple {1810#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {1810#false} is VALID [2018-11-23 12:24:03,979 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:24:03,979 INFO L273 TraceCheckUtils]: 32: Hoare triple {1810#false} assume !(~i~0 < 100); {1810#false} is VALID [2018-11-23 12:24:03,979 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:24:03,979 INFO L273 TraceCheckUtils]: 34: Hoare triple {1810#false} assume true; {1810#false} is VALID [2018-11-23 12:24:03,979 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {1810#false} {1810#false} #72#return; {1810#false} is VALID [2018-11-23 12:24:03,980 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:24:03,980 INFO L273 TraceCheckUtils]: 37: Hoare triple {1810#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:03,980 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:24:03,980 INFO L273 TraceCheckUtils]: 39: Hoare triple {1810#false} assume !(~i~2 < 99); {1810#false} is VALID [2018-11-23 12:24:03,981 INFO L273 TraceCheckUtils]: 40: Hoare triple {1810#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {1810#false} is VALID [2018-11-23 12:24:03,981 INFO L256 TraceCheckUtils]: 41: Hoare triple {1810#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {1810#false} is VALID [2018-11-23 12:24:03,981 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:24:03,981 INFO L273 TraceCheckUtils]: 43: Hoare triple {1810#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {1810#false} is VALID [2018-11-23 12:24:03,982 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:24:03,982 INFO L273 TraceCheckUtils]: 45: Hoare triple {1810#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {1810#false} is VALID [2018-11-23 12:24:03,982 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:24:03,982 INFO L273 TraceCheckUtils]: 47: Hoare triple {1810#false} assume !(~i~0 < 100); {1810#false} is VALID [2018-11-23 12:24:03,982 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:24:03,983 INFO L273 TraceCheckUtils]: 49: Hoare triple {1810#false} assume true; {1810#false} is VALID [2018-11-23 12:24:03,983 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {1810#false} {1810#false} #74#return; {1810#false} is VALID [2018-11-23 12:24:03,983 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:24:03,983 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:24:03,984 INFO L273 TraceCheckUtils]: 53: Hoare triple {1810#false} assume !false; {1810#false} is VALID [2018-11-23 12:24:03,987 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:24:04,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:04,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 12:24:04,010 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-11-23 12:24:04,011 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:04,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:24:04,095 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:24:04,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:24:04,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:24:04,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:24:04,096 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 8 states. [2018-11-23 12:24:04,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:04,454 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-11-23 12:24:04,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:24:04,455 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-11-23 12:24:04,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:04,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:24:04,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2018-11-23 12:24:04,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:24:04,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2018-11-23 12:24:04,458 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 62 transitions. [2018-11-23 12:24:04,562 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:24:04,564 INFO L225 Difference]: With dead ends: 62 [2018-11-23 12:24:04,564 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 12:24:04,565 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:24:04,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 12:24:04,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-23 12:24:04,590 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:04,590 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 39 states. [2018-11-23 12:24:04,590 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 39 states. [2018-11-23 12:24:04,590 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 39 states. [2018-11-23 12:24:04,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:04,592 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-23 12:24:04,592 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-23 12:24:04,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:04,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:04,593 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 40 states. [2018-11-23 12:24:04,593 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 40 states. [2018-11-23 12:24:04,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:04,595 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-23 12:24:04,595 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-23 12:24:04,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:04,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:04,596 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:04,596 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:04,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:24:04,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-11-23 12:24:04,597 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 54 [2018-11-23 12:24:04,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:04,598 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-23 12:24:04,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:24:04,598 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 12:24:04,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 12:24:04,599 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:04,599 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:24:04,599 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:04,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:04,599 INFO L82 PathProgramCache]: Analyzing trace with hash 830152559, now seen corresponding path program 5 times [2018-11-23 12:24:04,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:04,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:04,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:04,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:24:04,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:04,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:04,761 INFO L256 TraceCheckUtils]: 0: Hoare triple {2206#true} call ULTIMATE.init(); {2206#true} is VALID [2018-11-23 12:24:04,761 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:24:04,761 INFO L273 TraceCheckUtils]: 2: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:24:04,761 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2206#true} {2206#true} #66#return; {2206#true} is VALID [2018-11-23 12:24:04,762 INFO L256 TraceCheckUtils]: 4: Hoare triple {2206#true} call #t~ret13 := main(); {2206#true} is VALID [2018-11-23 12:24:04,765 INFO L273 TraceCheckUtils]: 5: Hoare triple {2206#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:24:04,765 INFO L273 TraceCheckUtils]: 6: Hoare triple {2208#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:24:04,766 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:24:04,766 INFO L273 TraceCheckUtils]: 8: Hoare triple {2209#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:24:04,783 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:24:04,783 INFO L273 TraceCheckUtils]: 10: Hoare triple {2210#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:24:04,784 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:24:04,784 INFO L273 TraceCheckUtils]: 12: Hoare triple {2211#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -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:24:04,786 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:24:04,786 INFO L273 TraceCheckUtils]: 14: Hoare triple {2212#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -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:24:04,788 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:24:04,788 INFO L273 TraceCheckUtils]: 16: Hoare triple {2213#(<= main_~i~1 5)} assume !(~i~1 < 100); {2207#false} is VALID [2018-11-23 12:24:04,788 INFO L256 TraceCheckUtils]: 17: Hoare triple {2207#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {2206#true} is VALID [2018-11-23 12:24:04,788 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:24:04,789 INFO L273 TraceCheckUtils]: 19: Hoare triple {2206#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2206#true} is VALID [2018-11-23 12:24:04,789 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:24:04,789 INFO L273 TraceCheckUtils]: 21: Hoare triple {2206#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2206#true} is VALID [2018-11-23 12:24:04,789 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:24:04,789 INFO L273 TraceCheckUtils]: 23: Hoare triple {2206#true} assume !(~i~0 < 100); {2206#true} is VALID [2018-11-23 12:24:04,789 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:24:04,789 INFO L273 TraceCheckUtils]: 25: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:24:04,789 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {2206#true} {2207#false} #70#return; {2207#false} is VALID [2018-11-23 12:24:04,790 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:24:04,790 INFO L256 TraceCheckUtils]: 28: Hoare triple {2207#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {2206#true} is VALID [2018-11-23 12:24:04,790 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:24:04,790 INFO L273 TraceCheckUtils]: 30: Hoare triple {2206#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2206#true} is VALID [2018-11-23 12:24:04,790 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:24:04,790 INFO L273 TraceCheckUtils]: 32: Hoare triple {2206#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2206#true} is VALID [2018-11-23 12:24:04,790 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:24:04,790 INFO L273 TraceCheckUtils]: 34: Hoare triple {2206#true} assume !(~i~0 < 100); {2206#true} is VALID [2018-11-23 12:24:04,791 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:24:04,791 INFO L273 TraceCheckUtils]: 36: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:24:04,791 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {2206#true} {2207#false} #72#return; {2207#false} is VALID [2018-11-23 12:24:04,791 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:24:04,791 INFO L273 TraceCheckUtils]: 39: Hoare triple {2207#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:04,791 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:24:04,791 INFO L273 TraceCheckUtils]: 41: Hoare triple {2207#false} assume !(~i~2 < 99); {2207#false} is VALID [2018-11-23 12:24:04,791 INFO L273 TraceCheckUtils]: 42: Hoare triple {2207#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {2207#false} is VALID [2018-11-23 12:24:04,792 INFO L256 TraceCheckUtils]: 43: Hoare triple {2207#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {2206#true} is VALID [2018-11-23 12:24:04,792 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:24:04,792 INFO L273 TraceCheckUtils]: 45: Hoare triple {2206#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2206#true} is VALID [2018-11-23 12:24:04,792 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:24:04,792 INFO L273 TraceCheckUtils]: 47: Hoare triple {2206#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2206#true} is VALID [2018-11-23 12:24:04,792 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:24:04,792 INFO L273 TraceCheckUtils]: 49: Hoare triple {2206#true} assume !(~i~0 < 100); {2206#true} is VALID [2018-11-23 12:24:04,793 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:24:04,793 INFO L273 TraceCheckUtils]: 51: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:24:04,793 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {2206#true} {2207#false} #74#return; {2207#false} is VALID [2018-11-23 12:24:04,793 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:24:04,793 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:24:04,793 INFO L273 TraceCheckUtils]: 55: Hoare triple {2207#false} assume !false; {2207#false} is VALID [2018-11-23 12:24:04,795 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:24:04,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:04,795 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:24:04,806 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:24:04,842 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 12:24:04,842 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:24:04,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:04,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:04,994 INFO L256 TraceCheckUtils]: 0: Hoare triple {2206#true} call ULTIMATE.init(); {2206#true} is VALID [2018-11-23 12:24:04,995 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:24:04,995 INFO L273 TraceCheckUtils]: 2: Hoare triple {2206#true} assume true; {2206#true} is VALID [2018-11-23 12:24:04,995 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2206#true} {2206#true} #66#return; {2206#true} is VALID [2018-11-23 12:24:04,995 INFO L256 TraceCheckUtils]: 4: Hoare triple {2206#true} call #t~ret13 := main(); {2206#true} is VALID [2018-11-23 12:24:04,995 INFO L273 TraceCheckUtils]: 5: Hoare triple {2206#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2206#true} is VALID [2018-11-23 12:24:04,995 INFO L273 TraceCheckUtils]: 6: Hoare triple {2206#true} assume !!(~i~1 < 100);assume -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:24:04,996 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:24:04,996 INFO L273 TraceCheckUtils]: 8: Hoare triple {2206#true} assume !!(~i~1 < 100);assume -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:24:04,996 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:24:04,996 INFO L273 TraceCheckUtils]: 10: Hoare triple {2206#true} assume !!(~i~1 < 100);assume -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:24:04,996 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:24:04,996 INFO L273 TraceCheckUtils]: 12: Hoare triple {2206#true} assume !!(~i~1 < 100);assume -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:24:04,996 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:24:04,996 INFO L273 TraceCheckUtils]: 14: Hoare triple {2206#true} assume !!(~i~1 < 100);assume -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:24:04,997 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:24:04,997 INFO L273 TraceCheckUtils]: 16: Hoare triple {2206#true} assume !(~i~1 < 100); {2206#true} is VALID [2018-11-23 12:24:04,997 INFO L256 TraceCheckUtils]: 17: Hoare triple {2206#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {2206#true} is VALID [2018-11-23 12:24:04,997 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#(<= bAnd_~i~0 1)} is VALID [2018-11-23 12:24:04,998 INFO L273 TraceCheckUtils]: 19: Hoare triple {2271#(<= bAnd_~i~0 1)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2271#(<= bAnd_~i~0 1)} is VALID [2018-11-23 12:24:04,998 INFO L273 TraceCheckUtils]: 20: Hoare triple {2271#(<= bAnd_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2278#(<= bAnd_~i~0 2)} is VALID [2018-11-23 12:24:04,999 INFO L273 TraceCheckUtils]: 21: Hoare triple {2278#(<= bAnd_~i~0 2)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2278#(<= bAnd_~i~0 2)} is VALID [2018-11-23 12:24:04,999 INFO L273 TraceCheckUtils]: 22: Hoare triple {2278#(<= bAnd_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2285#(<= bAnd_~i~0 3)} is VALID [2018-11-23 12:24:04,999 INFO L273 TraceCheckUtils]: 23: Hoare triple {2285#(<= bAnd_~i~0 3)} assume !(~i~0 < 100); {2207#false} is VALID [2018-11-23 12:24:05,000 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:24:05,000 INFO L273 TraceCheckUtils]: 25: Hoare triple {2207#false} assume true; {2207#false} is VALID [2018-11-23 12:24:05,000 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {2207#false} {2206#true} #70#return; {2207#false} is VALID [2018-11-23 12:24:05,000 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:24:05,000 INFO L256 TraceCheckUtils]: 28: Hoare triple {2207#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {2207#false} is VALID [2018-11-23 12:24:05,000 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:24:05,001 INFO L273 TraceCheckUtils]: 30: Hoare triple {2207#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2207#false} is VALID [2018-11-23 12:24:05,001 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:24:05,001 INFO L273 TraceCheckUtils]: 32: Hoare triple {2207#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2207#false} is VALID [2018-11-23 12:24:05,001 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:24:05,001 INFO L273 TraceCheckUtils]: 34: Hoare triple {2207#false} assume !(~i~0 < 100); {2207#false} is VALID [2018-11-23 12:24:05,001 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:24:05,001 INFO L273 TraceCheckUtils]: 36: Hoare triple {2207#false} assume true; {2207#false} is VALID [2018-11-23 12:24:05,001 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {2207#false} {2207#false} #72#return; {2207#false} is VALID [2018-11-23 12:24:05,002 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:24:05,002 INFO L273 TraceCheckUtils]: 39: Hoare triple {2207#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:05,002 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:24:05,002 INFO L273 TraceCheckUtils]: 41: Hoare triple {2207#false} assume !(~i~2 < 99); {2207#false} is VALID [2018-11-23 12:24:05,002 INFO L273 TraceCheckUtils]: 42: Hoare triple {2207#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {2207#false} is VALID [2018-11-23 12:24:05,003 INFO L256 TraceCheckUtils]: 43: Hoare triple {2207#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {2207#false} is VALID [2018-11-23 12:24:05,003 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:24:05,003 INFO L273 TraceCheckUtils]: 45: Hoare triple {2207#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2207#false} is VALID [2018-11-23 12:24:05,003 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:24:05,004 INFO L273 TraceCheckUtils]: 47: Hoare triple {2207#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2207#false} is VALID [2018-11-23 12:24:05,004 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:24:05,004 INFO L273 TraceCheckUtils]: 49: Hoare triple {2207#false} assume !(~i~0 < 100); {2207#false} is VALID [2018-11-23 12:24:05,005 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:24:05,005 INFO L273 TraceCheckUtils]: 51: Hoare triple {2207#false} assume true; {2207#false} is VALID [2018-11-23 12:24:05,005 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {2207#false} {2207#false} #74#return; {2207#false} is VALID [2018-11-23 12:24:05,005 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:24:05,005 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:24:05,006 INFO L273 TraceCheckUtils]: 55: Hoare triple {2207#false} assume !false; {2207#false} is VALID [2018-11-23 12:24:05,008 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:24:05,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:05,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-11-23 12:24:05,033 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2018-11-23 12:24:05,034 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:05,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:24:05,241 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:24:05,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:24:05,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:24:05,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:24:05,242 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 11 states. [2018-11-23 12:24:05,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:05,895 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2018-11-23 12:24:05,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:24:05,896 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2018-11-23 12:24:05,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:05,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:24:05,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 74 transitions. [2018-11-23 12:24:05,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:24:05,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 74 transitions. [2018-11-23 12:24:05,900 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 74 transitions. [2018-11-23 12:24:05,974 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:24:05,976 INFO L225 Difference]: With dead ends: 67 [2018-11-23 12:24:05,976 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 12:24:05,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:24:05,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 12:24:05,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-11-23 12:24:05,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:05,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 43 states. [2018-11-23 12:24:05,998 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 43 states. [2018-11-23 12:24:05,998 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 43 states. [2018-11-23 12:24:06,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:06,000 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-11-23 12:24:06,000 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-23 12:24:06,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:06,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:06,001 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 45 states. [2018-11-23 12:24:06,001 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 45 states. [2018-11-23 12:24:06,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:06,003 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-11-23 12:24:06,003 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-23 12:24:06,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:06,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:06,003 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:06,004 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:06,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:24:06,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-11-23 12:24:06,005 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 56 [2018-11-23 12:24:06,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:06,006 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-11-23 12:24:06,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:24:06,006 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-23 12:24:06,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 12:24:06,007 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:06,007 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:24:06,007 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:06,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:06,007 INFO L82 PathProgramCache]: Analyzing trace with hash 968039375, now seen corresponding path program 6 times [2018-11-23 12:24:06,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:06,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:06,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:06,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:24:06,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:06,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:06,299 INFO L256 TraceCheckUtils]: 0: Hoare triple {2635#true} call ULTIMATE.init(); {2635#true} is VALID [2018-11-23 12:24:06,299 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:24:06,300 INFO L273 TraceCheckUtils]: 2: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:24:06,300 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2635#true} {2635#true} #66#return; {2635#true} is VALID [2018-11-23 12:24:06,300 INFO L256 TraceCheckUtils]: 4: Hoare triple {2635#true} call #t~ret13 := main(); {2635#true} is VALID [2018-11-23 12:24:06,301 INFO L273 TraceCheckUtils]: 5: Hoare triple {2635#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:24:06,301 INFO L273 TraceCheckUtils]: 6: Hoare triple {2637#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:24:06,302 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:24:06,302 INFO L273 TraceCheckUtils]: 8: Hoare triple {2638#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:24:06,303 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:24:06,303 INFO L273 TraceCheckUtils]: 10: Hoare triple {2639#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:24:06,303 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:24:06,304 INFO L273 TraceCheckUtils]: 12: Hoare triple {2640#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -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:24:06,304 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:24:06,305 INFO L273 TraceCheckUtils]: 14: Hoare triple {2641#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -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:24:06,305 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:24:06,306 INFO L273 TraceCheckUtils]: 16: Hoare triple {2642#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -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:24:06,307 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:24:06,307 INFO L273 TraceCheckUtils]: 18: Hoare triple {2643#(<= main_~i~1 6)} assume !(~i~1 < 100); {2636#false} is VALID [2018-11-23 12:24:06,307 INFO L256 TraceCheckUtils]: 19: Hoare triple {2636#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {2635#true} is VALID [2018-11-23 12:24:06,308 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:24:06,308 INFO L273 TraceCheckUtils]: 21: Hoare triple {2635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:24:06,308 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:24:06,308 INFO L273 TraceCheckUtils]: 23: Hoare triple {2635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:24:06,308 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:24:06,309 INFO L273 TraceCheckUtils]: 25: Hoare triple {2635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:24:06,309 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:24:06,309 INFO L273 TraceCheckUtils]: 27: Hoare triple {2635#true} assume !(~i~0 < 100); {2635#true} is VALID [2018-11-23 12:24:06,309 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:24:06,309 INFO L273 TraceCheckUtils]: 29: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:24:06,310 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {2635#true} {2636#false} #70#return; {2636#false} is VALID [2018-11-23 12:24:06,310 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:24:06,310 INFO L256 TraceCheckUtils]: 32: Hoare triple {2636#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {2635#true} is VALID [2018-11-23 12:24:06,310 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:24:06,310 INFO L273 TraceCheckUtils]: 34: Hoare triple {2635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:24:06,311 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:24:06,311 INFO L273 TraceCheckUtils]: 36: Hoare triple {2635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:24:06,311 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:24:06,311 INFO L273 TraceCheckUtils]: 38: Hoare triple {2635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:24:06,311 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:24:06,312 INFO L273 TraceCheckUtils]: 40: Hoare triple {2635#true} assume !(~i~0 < 100); {2635#true} is VALID [2018-11-23 12:24:06,312 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:24:06,312 INFO L273 TraceCheckUtils]: 42: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:24:06,312 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {2635#true} {2636#false} #72#return; {2636#false} is VALID [2018-11-23 12:24:06,312 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:24:06,312 INFO L273 TraceCheckUtils]: 45: Hoare triple {2636#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:06,312 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:24:06,312 INFO L273 TraceCheckUtils]: 47: Hoare triple {2636#false} assume !(~i~2 < 99); {2636#false} is VALID [2018-11-23 12:24:06,313 INFO L273 TraceCheckUtils]: 48: Hoare triple {2636#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {2636#false} is VALID [2018-11-23 12:24:06,313 INFO L256 TraceCheckUtils]: 49: Hoare triple {2636#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {2635#true} is VALID [2018-11-23 12:24:06,313 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:24:06,313 INFO L273 TraceCheckUtils]: 51: Hoare triple {2635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:24:06,313 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:24:06,313 INFO L273 TraceCheckUtils]: 53: Hoare triple {2635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:24:06,313 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:24:06,313 INFO L273 TraceCheckUtils]: 55: Hoare triple {2635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:24:06,314 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:24:06,314 INFO L273 TraceCheckUtils]: 57: Hoare triple {2635#true} assume !(~i~0 < 100); {2635#true} is VALID [2018-11-23 12:24:06,314 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:24:06,314 INFO L273 TraceCheckUtils]: 59: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:24:06,314 INFO L268 TraceCheckUtils]: 60: Hoare quadruple {2635#true} {2636#false} #74#return; {2636#false} is VALID [2018-11-23 12:24:06,314 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:24:06,314 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:24:06,314 INFO L273 TraceCheckUtils]: 63: Hoare triple {2636#false} assume !false; {2636#false} is VALID [2018-11-23 12:24:06,316 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:24:06,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:06,317 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:24:06,326 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:24:06,359 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-11-23 12:24:06,359 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:24:06,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:06,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:06,589 INFO L256 TraceCheckUtils]: 0: Hoare triple {2635#true} call ULTIMATE.init(); {2635#true} is VALID [2018-11-23 12:24:06,589 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:24:06,589 INFO L273 TraceCheckUtils]: 2: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:24:06,590 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2635#true} {2635#true} #66#return; {2635#true} is VALID [2018-11-23 12:24:06,590 INFO L256 TraceCheckUtils]: 4: Hoare triple {2635#true} call #t~ret13 := main(); {2635#true} is VALID [2018-11-23 12:24:06,590 INFO L273 TraceCheckUtils]: 5: Hoare triple {2635#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2635#true} is VALID [2018-11-23 12:24:06,590 INFO L273 TraceCheckUtils]: 6: Hoare triple {2635#true} assume !!(~i~1 < 100);assume -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:24:06,591 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:24:06,591 INFO L273 TraceCheckUtils]: 8: Hoare triple {2635#true} assume !!(~i~1 < 100);assume -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:24:06,591 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:24:06,591 INFO L273 TraceCheckUtils]: 10: Hoare triple {2635#true} assume !!(~i~1 < 100);assume -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:24:06,591 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:24:06,592 INFO L273 TraceCheckUtils]: 12: Hoare triple {2635#true} assume !!(~i~1 < 100);assume -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:24:06,592 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:24:06,592 INFO L273 TraceCheckUtils]: 14: Hoare triple {2635#true} assume !!(~i~1 < 100);assume -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:24:06,592 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:24:06,592 INFO L273 TraceCheckUtils]: 16: Hoare triple {2635#true} assume !!(~i~1 < 100);assume -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:24:06,593 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:24:06,593 INFO L273 TraceCheckUtils]: 18: Hoare triple {2635#true} assume !(~i~1 < 100); {2635#true} is VALID [2018-11-23 12:24:06,593 INFO L256 TraceCheckUtils]: 19: Hoare triple {2635#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {2635#true} is VALID [2018-11-23 12:24:06,593 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:24:06,593 INFO L273 TraceCheckUtils]: 21: Hoare triple {2635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:24:06,594 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:24:06,594 INFO L273 TraceCheckUtils]: 23: Hoare triple {2635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:24:06,594 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:24:06,594 INFO L273 TraceCheckUtils]: 25: Hoare triple {2635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:24:06,594 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:24:06,594 INFO L273 TraceCheckUtils]: 27: Hoare triple {2635#true} assume !(~i~0 < 100); {2635#true} is VALID [2018-11-23 12:24:06,594 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:24:06,595 INFO L273 TraceCheckUtils]: 29: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:24:06,595 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {2635#true} {2635#true} #70#return; {2635#true} is VALID [2018-11-23 12:24:06,595 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:24:06,595 INFO L256 TraceCheckUtils]: 32: Hoare triple {2635#true} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {2635#true} is VALID [2018-11-23 12:24:06,595 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:24:06,595 INFO L273 TraceCheckUtils]: 34: Hoare triple {2635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:24:06,595 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:24:06,595 INFO L273 TraceCheckUtils]: 36: Hoare triple {2635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:24:06,596 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:24:06,596 INFO L273 TraceCheckUtils]: 38: Hoare triple {2635#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2635#true} is VALID [2018-11-23 12:24:06,596 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:24:06,596 INFO L273 TraceCheckUtils]: 40: Hoare triple {2635#true} assume !(~i~0 < 100); {2635#true} is VALID [2018-11-23 12:24:06,596 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:24:06,596 INFO L273 TraceCheckUtils]: 42: Hoare triple {2635#true} assume true; {2635#true} is VALID [2018-11-23 12:24:06,596 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {2635#true} {2635#true} #72#return; {2635#true} is VALID [2018-11-23 12:24:06,597 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:24:06,597 INFO L273 TraceCheckUtils]: 45: Hoare triple {2779#(<= main_~i~2 0)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:06,598 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:24:06,598 INFO L273 TraceCheckUtils]: 47: Hoare triple {2786#(<= main_~i~2 1)} assume !(~i~2 < 99); {2636#false} is VALID [2018-11-23 12:24:06,598 INFO L273 TraceCheckUtils]: 48: Hoare triple {2636#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {2636#false} is VALID [2018-11-23 12:24:06,598 INFO L256 TraceCheckUtils]: 49: Hoare triple {2636#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {2636#false} is VALID [2018-11-23 12:24:06,598 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:24:06,599 INFO L273 TraceCheckUtils]: 51: Hoare triple {2636#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2636#false} is VALID [2018-11-23 12:24:06,599 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:24:06,599 INFO L273 TraceCheckUtils]: 53: Hoare triple {2636#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2636#false} is VALID [2018-11-23 12:24:06,599 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:24:06,599 INFO L273 TraceCheckUtils]: 55: Hoare triple {2636#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {2636#false} is VALID [2018-11-23 12:24:06,599 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:24:06,600 INFO L273 TraceCheckUtils]: 57: Hoare triple {2636#false} assume !(~i~0 < 100); {2636#false} is VALID [2018-11-23 12:24:06,600 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:24:06,600 INFO L273 TraceCheckUtils]: 59: Hoare triple {2636#false} assume true; {2636#false} is VALID [2018-11-23 12:24:06,600 INFO L268 TraceCheckUtils]: 60: Hoare quadruple {2636#false} {2636#false} #74#return; {2636#false} is VALID [2018-11-23 12:24:06,600 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:24:06,600 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:24:06,601 INFO L273 TraceCheckUtils]: 63: Hoare triple {2636#false} assume !false; {2636#false} is VALID [2018-11-23 12:24:06,603 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:24:06,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:06,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2018-11-23 12:24:06,630 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2018-11-23 12:24:06,630 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:06,630 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:24:06,768 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:24:06,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:24:06,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:24:06,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:24:06,769 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 11 states. [2018-11-23 12:24:07,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:07,036 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-11-23 12:24:07,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:24:07,036 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2018-11-23 12:24:07,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:07,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:24:07,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 71 transitions. [2018-11-23 12:24:07,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:24:07,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 71 transitions. [2018-11-23 12:24:07,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 71 transitions. [2018-11-23 12:24:07,164 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:24:07,165 INFO L225 Difference]: With dead ends: 73 [2018-11-23 12:24:07,165 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 12:24:07,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:24:07,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 12:24:07,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-11-23 12:24:07,187 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:07,188 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 47 states. [2018-11-23 12:24:07,188 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 47 states. [2018-11-23 12:24:07,188 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 47 states. [2018-11-23 12:24:07,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:07,190 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-23 12:24:07,190 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-23 12:24:07,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:07,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:07,191 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 49 states. [2018-11-23 12:24:07,191 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 49 states. [2018-11-23 12:24:07,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:07,193 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-23 12:24:07,193 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-23 12:24:07,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:07,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:07,194 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:07,194 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:07,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:24:07,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-11-23 12:24:07,195 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 64 [2018-11-23 12:24:07,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:07,195 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-11-23 12:24:07,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:24:07,196 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-23 12:24:07,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 12:24:07,196 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:07,197 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:24:07,197 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:07,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:07,197 INFO L82 PathProgramCache]: Analyzing trace with hash -117250513, now seen corresponding path program 7 times [2018-11-23 12:24:07,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:07,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:07,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:07,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:24:07,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:07,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:07,419 INFO L256 TraceCheckUtils]: 0: Hoare triple {3111#true} call ULTIMATE.init(); {3111#true} is VALID [2018-11-23 12:24:07,420 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:24:07,420 INFO L273 TraceCheckUtils]: 2: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:24:07,420 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3111#true} {3111#true} #66#return; {3111#true} is VALID [2018-11-23 12:24:07,420 INFO L256 TraceCheckUtils]: 4: Hoare triple {3111#true} call #t~ret13 := main(); {3111#true} is VALID [2018-11-23 12:24:07,421 INFO L273 TraceCheckUtils]: 5: Hoare triple {3111#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:24:07,422 INFO L273 TraceCheckUtils]: 6: Hoare triple {3113#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:24:07,422 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:24:07,422 INFO L273 TraceCheckUtils]: 8: Hoare triple {3114#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:24:07,423 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:24:07,423 INFO L273 TraceCheckUtils]: 10: Hoare triple {3115#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:24:07,424 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:24:07,424 INFO L273 TraceCheckUtils]: 12: Hoare triple {3116#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -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:24:07,424 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:24:07,425 INFO L273 TraceCheckUtils]: 14: Hoare triple {3117#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -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:24:07,426 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:24:07,426 INFO L273 TraceCheckUtils]: 16: Hoare triple {3118#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -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:24:07,427 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:24:07,427 INFO L273 TraceCheckUtils]: 18: Hoare triple {3119#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -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:24:07,428 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:24:07,429 INFO L273 TraceCheckUtils]: 20: Hoare triple {3120#(<= main_~i~1 7)} assume !(~i~1 < 100); {3112#false} is VALID [2018-11-23 12:24:07,429 INFO L256 TraceCheckUtils]: 21: Hoare triple {3112#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {3111#true} is VALID [2018-11-23 12:24:07,429 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:24:07,429 INFO L273 TraceCheckUtils]: 23: Hoare triple {3111#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3111#true} is VALID [2018-11-23 12:24:07,429 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:24:07,430 INFO L273 TraceCheckUtils]: 25: Hoare triple {3111#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3111#true} is VALID [2018-11-23 12:24:07,430 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:24:07,430 INFO L273 TraceCheckUtils]: 27: Hoare triple {3111#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3111#true} is VALID [2018-11-23 12:24:07,430 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:24:07,430 INFO L273 TraceCheckUtils]: 29: Hoare triple {3111#true} assume !(~i~0 < 100); {3111#true} is VALID [2018-11-23 12:24:07,431 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:24:07,431 INFO L273 TraceCheckUtils]: 31: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:24:07,431 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {3111#true} {3112#false} #70#return; {3112#false} is VALID [2018-11-23 12:24:07,431 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:24:07,431 INFO L256 TraceCheckUtils]: 34: Hoare triple {3112#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {3111#true} is VALID [2018-11-23 12:24:07,432 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:24:07,432 INFO L273 TraceCheckUtils]: 36: Hoare triple {3111#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3111#true} is VALID [2018-11-23 12:24:07,432 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:24:07,432 INFO L273 TraceCheckUtils]: 38: Hoare triple {3111#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3111#true} is VALID [2018-11-23 12:24:07,432 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:24:07,433 INFO L273 TraceCheckUtils]: 40: Hoare triple {3111#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3111#true} is VALID [2018-11-23 12:24:07,433 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:24:07,433 INFO L273 TraceCheckUtils]: 42: Hoare triple {3111#true} assume !(~i~0 < 100); {3111#true} is VALID [2018-11-23 12:24:07,433 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:24:07,433 INFO L273 TraceCheckUtils]: 44: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:24:07,433 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {3111#true} {3112#false} #72#return; {3112#false} is VALID [2018-11-23 12:24:07,434 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:24:07,434 INFO L273 TraceCheckUtils]: 47: Hoare triple {3112#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:07,434 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:24:07,434 INFO L273 TraceCheckUtils]: 49: Hoare triple {3112#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:07,434 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:24:07,434 INFO L273 TraceCheckUtils]: 51: Hoare triple {3112#false} assume !(~i~2 < 99); {3112#false} is VALID [2018-11-23 12:24:07,434 INFO L273 TraceCheckUtils]: 52: Hoare triple {3112#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {3112#false} is VALID [2018-11-23 12:24:07,434 INFO L256 TraceCheckUtils]: 53: Hoare triple {3112#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {3111#true} is VALID [2018-11-23 12:24:07,435 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:24:07,435 INFO L273 TraceCheckUtils]: 55: Hoare triple {3111#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3111#true} is VALID [2018-11-23 12:24:07,435 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:24:07,435 INFO L273 TraceCheckUtils]: 57: Hoare triple {3111#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3111#true} is VALID [2018-11-23 12:24:07,435 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:24:07,435 INFO L273 TraceCheckUtils]: 59: Hoare triple {3111#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3111#true} is VALID [2018-11-23 12:24:07,435 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:24:07,435 INFO L273 TraceCheckUtils]: 61: Hoare triple {3111#true} assume !(~i~0 < 100); {3111#true} is VALID [2018-11-23 12:24:07,436 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:24:07,436 INFO L273 TraceCheckUtils]: 63: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:24:07,436 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {3111#true} {3112#false} #74#return; {3112#false} is VALID [2018-11-23 12:24:07,436 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:24:07,436 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:24:07,436 INFO L273 TraceCheckUtils]: 67: Hoare triple {3112#false} assume !false; {3112#false} is VALID [2018-11-23 12:24:07,441 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:24:07,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:07,441 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:24:07,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:24:07,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:07,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:07,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:07,604 INFO L256 TraceCheckUtils]: 0: Hoare triple {3111#true} call ULTIMATE.init(); {3111#true} is VALID [2018-11-23 12:24:07,604 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:24:07,604 INFO L273 TraceCheckUtils]: 2: Hoare triple {3111#true} assume true; {3111#true} is VALID [2018-11-23 12:24:07,604 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3111#true} {3111#true} #66#return; {3111#true} is VALID [2018-11-23 12:24:07,605 INFO L256 TraceCheckUtils]: 4: Hoare triple {3111#true} call #t~ret13 := main(); {3111#true} is VALID [2018-11-23 12:24:07,605 INFO L273 TraceCheckUtils]: 5: Hoare triple {3111#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:24:07,606 INFO L273 TraceCheckUtils]: 6: Hoare triple {3139#(<= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:24:07,606 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:24:07,607 INFO L273 TraceCheckUtils]: 8: Hoare triple {3114#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:24:07,607 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:24:07,608 INFO L273 TraceCheckUtils]: 10: Hoare triple {3115#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:24:07,608 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:24:07,608 INFO L273 TraceCheckUtils]: 12: Hoare triple {3116#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -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:24:07,609 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:24:07,609 INFO L273 TraceCheckUtils]: 14: Hoare triple {3117#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -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:24:07,610 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:24:07,610 INFO L273 TraceCheckUtils]: 16: Hoare triple {3118#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -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:24:07,611 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:24:07,612 INFO L273 TraceCheckUtils]: 18: Hoare triple {3119#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -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:24:07,612 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:24:07,613 INFO L273 TraceCheckUtils]: 20: Hoare triple {3120#(<= main_~i~1 7)} assume !(~i~1 < 100); {3112#false} is VALID [2018-11-23 12:24:07,613 INFO L256 TraceCheckUtils]: 21: Hoare triple {3112#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {3112#false} is VALID [2018-11-23 12:24:07,613 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:24:07,614 INFO L273 TraceCheckUtils]: 23: Hoare triple {3112#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3112#false} is VALID [2018-11-23 12:24:07,614 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:24:07,614 INFO L273 TraceCheckUtils]: 25: Hoare triple {3112#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3112#false} is VALID [2018-11-23 12:24:07,614 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:24:07,614 INFO L273 TraceCheckUtils]: 27: Hoare triple {3112#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3112#false} is VALID [2018-11-23 12:24:07,615 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:24:07,615 INFO L273 TraceCheckUtils]: 29: Hoare triple {3112#false} assume !(~i~0 < 100); {3112#false} is VALID [2018-11-23 12:24:07,615 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:24:07,615 INFO L273 TraceCheckUtils]: 31: Hoare triple {3112#false} assume true; {3112#false} is VALID [2018-11-23 12:24:07,615 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {3112#false} {3112#false} #70#return; {3112#false} is VALID [2018-11-23 12:24:07,616 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:24:07,616 INFO L256 TraceCheckUtils]: 34: Hoare triple {3112#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {3112#false} is VALID [2018-11-23 12:24:07,616 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:24:07,616 INFO L273 TraceCheckUtils]: 36: Hoare triple {3112#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3112#false} is VALID [2018-11-23 12:24:07,616 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:24:07,617 INFO L273 TraceCheckUtils]: 38: Hoare triple {3112#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3112#false} is VALID [2018-11-23 12:24:07,617 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:24:07,617 INFO L273 TraceCheckUtils]: 40: Hoare triple {3112#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3112#false} is VALID [2018-11-23 12:24:07,617 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:24:07,617 INFO L273 TraceCheckUtils]: 42: Hoare triple {3112#false} assume !(~i~0 < 100); {3112#false} is VALID [2018-11-23 12:24:07,617 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:24:07,617 INFO L273 TraceCheckUtils]: 44: Hoare triple {3112#false} assume true; {3112#false} is VALID [2018-11-23 12:24:07,617 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {3112#false} {3112#false} #72#return; {3112#false} is VALID [2018-11-23 12:24:07,618 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:24:07,618 INFO L273 TraceCheckUtils]: 47: Hoare triple {3112#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:07,618 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:24:07,618 INFO L273 TraceCheckUtils]: 49: Hoare triple {3112#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:07,618 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:24:07,619 INFO L273 TraceCheckUtils]: 51: Hoare triple {3112#false} assume !(~i~2 < 99); {3112#false} is VALID [2018-11-23 12:24:07,619 INFO L273 TraceCheckUtils]: 52: Hoare triple {3112#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {3112#false} is VALID [2018-11-23 12:24:07,619 INFO L256 TraceCheckUtils]: 53: Hoare triple {3112#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {3112#false} is VALID [2018-11-23 12:24:07,619 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:24:07,619 INFO L273 TraceCheckUtils]: 55: Hoare triple {3112#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3112#false} is VALID [2018-11-23 12:24:07,619 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:24:07,620 INFO L273 TraceCheckUtils]: 57: Hoare triple {3112#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3112#false} is VALID [2018-11-23 12:24:07,620 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:24:07,620 INFO L273 TraceCheckUtils]: 59: Hoare triple {3112#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3112#false} is VALID [2018-11-23 12:24:07,620 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:24:07,620 INFO L273 TraceCheckUtils]: 61: Hoare triple {3112#false} assume !(~i~0 < 100); {3112#false} is VALID [2018-11-23 12:24:07,620 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:24:07,620 INFO L273 TraceCheckUtils]: 63: Hoare triple {3112#false} assume true; {3112#false} is VALID [2018-11-23 12:24:07,621 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {3112#false} {3112#false} #74#return; {3112#false} is VALID [2018-11-23 12:24:07,621 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:24:07,621 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:24:07,621 INFO L273 TraceCheckUtils]: 67: Hoare triple {3112#false} assume !false; {3112#false} is VALID [2018-11-23 12:24:07,624 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:24:07,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:07,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 12:24:07,645 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-11-23 12:24:07,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:07,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:24:07,703 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:24:07,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:24:07,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:24:07,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:24:07,704 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 11 states. [2018-11-23 12:24:07,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:07,920 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2018-11-23 12:24:07,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:24:07,920 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-11-23 12:24:07,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:07,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:24:07,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 68 transitions. [2018-11-23 12:24:07,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:24:07,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 68 transitions. [2018-11-23 12:24:07,923 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 68 transitions. [2018-11-23 12:24:07,982 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:24:07,984 INFO L225 Difference]: With dead ends: 76 [2018-11-23 12:24:07,984 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 12:24:07,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:24:07,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 12:24:08,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-11-23 12:24:08,146 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:08,146 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 49 states. [2018-11-23 12:24:08,146 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 49 states. [2018-11-23 12:24:08,146 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 49 states. [2018-11-23 12:24:08,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:08,150 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-11-23 12:24:08,150 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-23 12:24:08,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:08,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:08,151 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 50 states. [2018-11-23 12:24:08,151 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 50 states. [2018-11-23 12:24:08,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:08,152 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-11-23 12:24:08,153 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-23 12:24:08,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:08,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:08,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:08,153 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:08,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:24:08,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-11-23 12:24:08,155 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 68 [2018-11-23 12:24:08,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:08,155 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-11-23 12:24:08,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:24:08,156 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-23 12:24:08,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 12:24:08,157 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:08,157 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:24:08,157 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:08,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:08,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1594227089, now seen corresponding path program 8 times [2018-11-23 12:24:08,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:08,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:08,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:08,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:24:08,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:08,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:08,456 INFO L256 TraceCheckUtils]: 0: Hoare triple {3609#true} call ULTIMATE.init(); {3609#true} is VALID [2018-11-23 12:24:08,456 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:24:08,457 INFO L273 TraceCheckUtils]: 2: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:24:08,457 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3609#true} {3609#true} #66#return; {3609#true} is VALID [2018-11-23 12:24:08,457 INFO L256 TraceCheckUtils]: 4: Hoare triple {3609#true} call #t~ret13 := main(); {3609#true} is VALID [2018-11-23 12:24:08,458 INFO L273 TraceCheckUtils]: 5: Hoare triple {3609#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:24:08,458 INFO L273 TraceCheckUtils]: 6: Hoare triple {3611#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:24:08,459 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:24:08,459 INFO L273 TraceCheckUtils]: 8: Hoare triple {3612#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:24:08,460 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:24:08,460 INFO L273 TraceCheckUtils]: 10: Hoare triple {3613#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:24:08,461 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:24:08,462 INFO L273 TraceCheckUtils]: 12: Hoare triple {3614#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -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:24:08,462 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:24:08,463 INFO L273 TraceCheckUtils]: 14: Hoare triple {3615#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -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:24:08,464 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:24:08,464 INFO L273 TraceCheckUtils]: 16: Hoare triple {3616#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -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:24:08,465 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:24:08,466 INFO L273 TraceCheckUtils]: 18: Hoare triple {3617#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -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:24:08,467 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:24:08,467 INFO L273 TraceCheckUtils]: 20: Hoare triple {3618#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -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:24:08,468 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:24:08,469 INFO L273 TraceCheckUtils]: 22: Hoare triple {3619#(<= main_~i~1 8)} assume !(~i~1 < 100); {3610#false} is VALID [2018-11-23 12:24:08,469 INFO L256 TraceCheckUtils]: 23: Hoare triple {3610#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {3609#true} is VALID [2018-11-23 12:24:08,469 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:24:08,470 INFO L273 TraceCheckUtils]: 25: Hoare triple {3609#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3609#true} is VALID [2018-11-23 12:24:08,470 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:24:08,470 INFO L273 TraceCheckUtils]: 27: Hoare triple {3609#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3609#true} is VALID [2018-11-23 12:24:08,470 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:24:08,471 INFO L273 TraceCheckUtils]: 29: Hoare triple {3609#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3609#true} is VALID [2018-11-23 12:24:08,471 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:24:08,471 INFO L273 TraceCheckUtils]: 31: Hoare triple {3609#true} assume !(~i~0 < 100); {3609#true} is VALID [2018-11-23 12:24:08,471 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:24:08,472 INFO L273 TraceCheckUtils]: 33: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:24:08,472 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {3609#true} {3610#false} #70#return; {3610#false} is VALID [2018-11-23 12:24:08,472 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:24:08,472 INFO L256 TraceCheckUtils]: 36: Hoare triple {3610#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {3609#true} is VALID [2018-11-23 12:24:08,472 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:24:08,473 INFO L273 TraceCheckUtils]: 38: Hoare triple {3609#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3609#true} is VALID [2018-11-23 12:24:08,473 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:24:08,473 INFO L273 TraceCheckUtils]: 40: Hoare triple {3609#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3609#true} is VALID [2018-11-23 12:24:08,473 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:24:08,473 INFO L273 TraceCheckUtils]: 42: Hoare triple {3609#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3609#true} is VALID [2018-11-23 12:24:08,473 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:24:08,474 INFO L273 TraceCheckUtils]: 44: Hoare triple {3609#true} assume !(~i~0 < 100); {3609#true} is VALID [2018-11-23 12:24:08,474 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:24:08,474 INFO L273 TraceCheckUtils]: 46: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:24:08,474 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {3609#true} {3610#false} #72#return; {3610#false} is VALID [2018-11-23 12:24:08,474 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:24:08,475 INFO L273 TraceCheckUtils]: 49: Hoare triple {3610#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:08,475 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:24:08,475 INFO L273 TraceCheckUtils]: 51: Hoare triple {3610#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:08,475 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:24:08,475 INFO L273 TraceCheckUtils]: 53: Hoare triple {3610#false} assume !(~i~2 < 99); {3610#false} is VALID [2018-11-23 12:24:08,475 INFO L273 TraceCheckUtils]: 54: Hoare triple {3610#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {3610#false} is VALID [2018-11-23 12:24:08,476 INFO L256 TraceCheckUtils]: 55: Hoare triple {3610#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {3609#true} is VALID [2018-11-23 12:24:08,476 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:24:08,476 INFO L273 TraceCheckUtils]: 57: Hoare triple {3609#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3609#true} is VALID [2018-11-23 12:24:08,476 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:24:08,476 INFO L273 TraceCheckUtils]: 59: Hoare triple {3609#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3609#true} is VALID [2018-11-23 12:24:08,476 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:24:08,476 INFO L273 TraceCheckUtils]: 61: Hoare triple {3609#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3609#true} is VALID [2018-11-23 12:24:08,477 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:24:08,477 INFO L273 TraceCheckUtils]: 63: Hoare triple {3609#true} assume !(~i~0 < 100); {3609#true} is VALID [2018-11-23 12:24:08,477 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:24:08,477 INFO L273 TraceCheckUtils]: 65: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:24:08,477 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {3609#true} {3610#false} #74#return; {3610#false} is VALID [2018-11-23 12:24:08,477 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:24:08,477 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:24:08,477 INFO L273 TraceCheckUtils]: 69: Hoare triple {3610#false} assume !false; {3610#false} is VALID [2018-11-23 12:24:08,480 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:24:08,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:08,480 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:24:08,489 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:24:08,546 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:24:08,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:24:08,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:08,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:08,681 INFO L256 TraceCheckUtils]: 0: Hoare triple {3609#true} call ULTIMATE.init(); {3609#true} is VALID [2018-11-23 12:24:08,681 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:24:08,682 INFO L273 TraceCheckUtils]: 2: Hoare triple {3609#true} assume true; {3609#true} is VALID [2018-11-23 12:24:08,682 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3609#true} {3609#true} #66#return; {3609#true} is VALID [2018-11-23 12:24:08,682 INFO L256 TraceCheckUtils]: 4: Hoare triple {3609#true} call #t~ret13 := main(); {3609#true} is VALID [2018-11-23 12:24:08,683 INFO L273 TraceCheckUtils]: 5: Hoare triple {3609#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:24:08,683 INFO L273 TraceCheckUtils]: 6: Hoare triple {3638#(<= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:24:08,684 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:24:08,684 INFO L273 TraceCheckUtils]: 8: Hoare triple {3612#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:24:08,684 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:24:08,685 INFO L273 TraceCheckUtils]: 10: Hoare triple {3613#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:24:08,685 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:24:08,686 INFO L273 TraceCheckUtils]: 12: Hoare triple {3614#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -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:24:08,687 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:24:08,687 INFO L273 TraceCheckUtils]: 14: Hoare triple {3615#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -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:24:08,688 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:24:08,688 INFO L273 TraceCheckUtils]: 16: Hoare triple {3616#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -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:24:08,689 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:24:08,690 INFO L273 TraceCheckUtils]: 18: Hoare triple {3617#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -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:24:08,690 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:24:08,691 INFO L273 TraceCheckUtils]: 20: Hoare triple {3618#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -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:24:08,692 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:24:08,692 INFO L273 TraceCheckUtils]: 22: Hoare triple {3619#(<= main_~i~1 8)} assume !(~i~1 < 100); {3610#false} is VALID [2018-11-23 12:24:08,692 INFO L256 TraceCheckUtils]: 23: Hoare triple {3610#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {3610#false} is VALID [2018-11-23 12:24:08,693 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:24:08,693 INFO L273 TraceCheckUtils]: 25: Hoare triple {3610#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3610#false} is VALID [2018-11-23 12:24:08,693 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:24:08,693 INFO L273 TraceCheckUtils]: 27: Hoare triple {3610#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3610#false} is VALID [2018-11-23 12:24:08,693 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:24:08,694 INFO L273 TraceCheckUtils]: 29: Hoare triple {3610#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3610#false} is VALID [2018-11-23 12:24:08,694 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:24:08,694 INFO L273 TraceCheckUtils]: 31: Hoare triple {3610#false} assume !(~i~0 < 100); {3610#false} is VALID [2018-11-23 12:24:08,694 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:24:08,694 INFO L273 TraceCheckUtils]: 33: Hoare triple {3610#false} assume true; {3610#false} is VALID [2018-11-23 12:24:08,695 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {3610#false} {3610#false} #70#return; {3610#false} is VALID [2018-11-23 12:24:08,695 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:24:08,695 INFO L256 TraceCheckUtils]: 36: Hoare triple {3610#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {3610#false} is VALID [2018-11-23 12:24:08,695 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:24:08,695 INFO L273 TraceCheckUtils]: 38: Hoare triple {3610#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3610#false} is VALID [2018-11-23 12:24:08,695 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:24:08,695 INFO L273 TraceCheckUtils]: 40: Hoare triple {3610#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3610#false} is VALID [2018-11-23 12:24:08,696 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:24:08,696 INFO L273 TraceCheckUtils]: 42: Hoare triple {3610#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3610#false} is VALID [2018-11-23 12:24:08,696 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:24:08,696 INFO L273 TraceCheckUtils]: 44: Hoare triple {3610#false} assume !(~i~0 < 100); {3610#false} is VALID [2018-11-23 12:24:08,696 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:24:08,696 INFO L273 TraceCheckUtils]: 46: Hoare triple {3610#false} assume true; {3610#false} is VALID [2018-11-23 12:24:08,696 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {3610#false} {3610#false} #72#return; {3610#false} is VALID [2018-11-23 12:24:08,696 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:24:08,697 INFO L273 TraceCheckUtils]: 49: Hoare triple {3610#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:08,697 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:24:08,697 INFO L273 TraceCheckUtils]: 51: Hoare triple {3610#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:08,697 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:24:08,697 INFO L273 TraceCheckUtils]: 53: Hoare triple {3610#false} assume !(~i~2 < 99); {3610#false} is VALID [2018-11-23 12:24:08,697 INFO L273 TraceCheckUtils]: 54: Hoare triple {3610#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {3610#false} is VALID [2018-11-23 12:24:08,697 INFO L256 TraceCheckUtils]: 55: Hoare triple {3610#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {3610#false} is VALID [2018-11-23 12:24:08,697 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:24:08,697 INFO L273 TraceCheckUtils]: 57: Hoare triple {3610#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3610#false} is VALID [2018-11-23 12:24:08,698 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:24:08,698 INFO L273 TraceCheckUtils]: 59: Hoare triple {3610#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3610#false} is VALID [2018-11-23 12:24:08,698 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:24:08,698 INFO L273 TraceCheckUtils]: 61: Hoare triple {3610#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {3610#false} is VALID [2018-11-23 12:24:08,698 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:24:08,698 INFO L273 TraceCheckUtils]: 63: Hoare triple {3610#false} assume !(~i~0 < 100); {3610#false} is VALID [2018-11-23 12:24:08,698 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:24:08,698 INFO L273 TraceCheckUtils]: 65: Hoare triple {3610#false} assume true; {3610#false} is VALID [2018-11-23 12:24:08,699 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {3610#false} {3610#false} #74#return; {3610#false} is VALID [2018-11-23 12:24:08,699 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:24:08,699 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:24:08,699 INFO L273 TraceCheckUtils]: 69: Hoare triple {3610#false} assume !false; {3610#false} is VALID [2018-11-23 12:24:08,701 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:24:08,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:08,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 12:24:08,720 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-11-23 12:24:08,721 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:08,721 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:24:08,777 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:24:08,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:24:08,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:24:08,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:24:08,778 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 12 states. [2018-11-23 12:24:08,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:08,954 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2018-11-23 12:24:08,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:24:08,955 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-11-23 12:24:08,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:08,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:24:08,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2018-11-23 12:24:08,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:24:08,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 70 transitions. [2018-11-23 12:24:08,957 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 70 transitions. [2018-11-23 12:24:09,037 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:24:09,038 INFO L225 Difference]: With dead ends: 78 [2018-11-23 12:24:09,038 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 12:24:09,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:24:09,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 12:24:09,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-11-23 12:24:09,058 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:09,058 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 51 states. [2018-11-23 12:24:09,058 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 51 states. [2018-11-23 12:24:09,059 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 51 states. [2018-11-23 12:24:09,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:09,060 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-11-23 12:24:09,060 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-23 12:24:09,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:09,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:09,060 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 52 states. [2018-11-23 12:24:09,060 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 52 states. [2018-11-23 12:24:09,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:09,064 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-11-23 12:24:09,064 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-23 12:24:09,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:09,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:09,065 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:09,065 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:09,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:24:09,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-11-23 12:24:09,067 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 70 [2018-11-23 12:24:09,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:09,067 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-11-23 12:24:09,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:24:09,067 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-23 12:24:09,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-23 12:24:09,068 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:09,068 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:24:09,068 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:09,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:09,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1351728243, now seen corresponding path program 9 times [2018-11-23 12:24:09,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:09,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:09,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:09,070 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:24:09,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:09,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:09,350 INFO L256 TraceCheckUtils]: 0: Hoare triple {4124#true} call ULTIMATE.init(); {4124#true} is VALID [2018-11-23 12:24:09,351 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:24:09,351 INFO L273 TraceCheckUtils]: 2: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:24:09,351 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4124#true} {4124#true} #66#return; {4124#true} is VALID [2018-11-23 12:24:09,351 INFO L256 TraceCheckUtils]: 4: Hoare triple {4124#true} call #t~ret13 := main(); {4124#true} is VALID [2018-11-23 12:24:09,352 INFO L273 TraceCheckUtils]: 5: Hoare triple {4124#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:24:09,352 INFO L273 TraceCheckUtils]: 6: Hoare triple {4126#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:24:09,353 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:24:09,353 INFO L273 TraceCheckUtils]: 8: Hoare triple {4127#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:24:09,354 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:24:09,354 INFO L273 TraceCheckUtils]: 10: Hoare triple {4128#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:24:09,355 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:24:09,355 INFO L273 TraceCheckUtils]: 12: Hoare triple {4129#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -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:24:09,356 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:24:09,356 INFO L273 TraceCheckUtils]: 14: Hoare triple {4130#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -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:24:09,357 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:24:09,358 INFO L273 TraceCheckUtils]: 16: Hoare triple {4131#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -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:24:09,359 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:24:09,359 INFO L273 TraceCheckUtils]: 18: Hoare triple {4132#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -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:24:09,360 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:24:09,361 INFO L273 TraceCheckUtils]: 20: Hoare triple {4133#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -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:24:09,361 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:24:09,362 INFO L273 TraceCheckUtils]: 22: Hoare triple {4134#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -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:24:09,363 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:24:09,364 INFO L273 TraceCheckUtils]: 24: Hoare triple {4135#(<= main_~i~1 9)} assume !(~i~1 < 100); {4125#false} is VALID [2018-11-23 12:24:09,364 INFO L256 TraceCheckUtils]: 25: Hoare triple {4125#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {4124#true} is VALID [2018-11-23 12:24:09,364 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:24:09,364 INFO L273 TraceCheckUtils]: 27: Hoare triple {4124#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:24:09,365 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:24:09,365 INFO L273 TraceCheckUtils]: 29: Hoare triple {4124#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:24:09,365 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:24:09,365 INFO L273 TraceCheckUtils]: 31: Hoare triple {4124#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:24:09,366 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:24:09,366 INFO L273 TraceCheckUtils]: 33: Hoare triple {4124#true} assume !(~i~0 < 100); {4124#true} is VALID [2018-11-23 12:24:09,366 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:24:09,366 INFO L273 TraceCheckUtils]: 35: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:24:09,366 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {4124#true} {4125#false} #70#return; {4125#false} is VALID [2018-11-23 12:24:09,367 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:24:09,367 INFO L256 TraceCheckUtils]: 38: Hoare triple {4125#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {4124#true} is VALID [2018-11-23 12:24:09,367 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:24:09,367 INFO L273 TraceCheckUtils]: 40: Hoare triple {4124#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:24:09,367 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:24:09,367 INFO L273 TraceCheckUtils]: 42: Hoare triple {4124#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:24:09,368 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:24:09,368 INFO L273 TraceCheckUtils]: 44: Hoare triple {4124#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:24:09,368 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:24:09,368 INFO L273 TraceCheckUtils]: 46: Hoare triple {4124#true} assume !(~i~0 < 100); {4124#true} is VALID [2018-11-23 12:24:09,368 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:24:09,368 INFO L273 TraceCheckUtils]: 48: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:24:09,368 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {4124#true} {4125#false} #72#return; {4125#false} is VALID [2018-11-23 12:24:09,369 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:24:09,369 INFO L273 TraceCheckUtils]: 51: Hoare triple {4125#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:09,369 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:24:09,369 INFO L273 TraceCheckUtils]: 53: Hoare triple {4125#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:09,369 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:24:09,369 INFO L273 TraceCheckUtils]: 55: Hoare triple {4125#false} assume !(~i~2 < 99); {4125#false} is VALID [2018-11-23 12:24:09,370 INFO L273 TraceCheckUtils]: 56: Hoare triple {4125#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {4125#false} is VALID [2018-11-23 12:24:09,370 INFO L256 TraceCheckUtils]: 57: Hoare triple {4125#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {4124#true} is VALID [2018-11-23 12:24:09,370 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:24:09,370 INFO L273 TraceCheckUtils]: 59: Hoare triple {4124#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:24:09,370 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:24:09,370 INFO L273 TraceCheckUtils]: 61: Hoare triple {4124#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:24:09,370 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:24:09,371 INFO L273 TraceCheckUtils]: 63: Hoare triple {4124#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:24:09,371 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:24:09,371 INFO L273 TraceCheckUtils]: 65: Hoare triple {4124#true} assume !(~i~0 < 100); {4124#true} is VALID [2018-11-23 12:24:09,371 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:24:09,371 INFO L273 TraceCheckUtils]: 67: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:24:09,371 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {4124#true} {4125#false} #74#return; {4125#false} is VALID [2018-11-23 12:24:09,372 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:24:09,372 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:24:09,372 INFO L273 TraceCheckUtils]: 71: Hoare triple {4125#false} assume !false; {4125#false} is VALID [2018-11-23 12:24:09,377 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:24:09,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:09,377 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:24:09,388 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:24:09,471 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 12:24:09,471 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:24:09,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:09,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:09,624 INFO L256 TraceCheckUtils]: 0: Hoare triple {4124#true} call ULTIMATE.init(); {4124#true} is VALID [2018-11-23 12:24:09,624 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:24:09,624 INFO L273 TraceCheckUtils]: 2: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:24:09,625 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4124#true} {4124#true} #66#return; {4124#true} is VALID [2018-11-23 12:24:09,625 INFO L256 TraceCheckUtils]: 4: Hoare triple {4124#true} call #t~ret13 := main(); {4124#true} is VALID [2018-11-23 12:24:09,625 INFO L273 TraceCheckUtils]: 5: Hoare triple {4124#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {4124#true} is VALID [2018-11-23 12:24:09,626 INFO L273 TraceCheckUtils]: 6: Hoare triple {4124#true} assume !!(~i~1 < 100);assume -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:24:09,626 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:24:09,626 INFO L273 TraceCheckUtils]: 8: Hoare triple {4124#true} assume !!(~i~1 < 100);assume -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:24:09,626 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:24:09,627 INFO L273 TraceCheckUtils]: 10: Hoare triple {4124#true} assume !!(~i~1 < 100);assume -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:24:09,627 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:24:09,627 INFO L273 TraceCheckUtils]: 12: Hoare triple {4124#true} assume !!(~i~1 < 100);assume -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:24:09,627 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:24:09,627 INFO L273 TraceCheckUtils]: 14: Hoare triple {4124#true} assume !!(~i~1 < 100);assume -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:24:09,627 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:24:09,627 INFO L273 TraceCheckUtils]: 16: Hoare triple {4124#true} assume !!(~i~1 < 100);assume -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:24:09,628 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:24:09,628 INFO L273 TraceCheckUtils]: 18: Hoare triple {4124#true} assume !!(~i~1 < 100);assume -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:24:09,628 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:24:09,628 INFO L273 TraceCheckUtils]: 20: Hoare triple {4124#true} assume !!(~i~1 < 100);assume -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:24:09,628 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:24:09,628 INFO L273 TraceCheckUtils]: 22: Hoare triple {4124#true} assume !!(~i~1 < 100);assume -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:24:09,629 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:24:09,629 INFO L273 TraceCheckUtils]: 24: Hoare triple {4124#true} assume !(~i~1 < 100); {4124#true} is VALID [2018-11-23 12:24:09,629 INFO L256 TraceCheckUtils]: 25: Hoare triple {4124#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {4124#true} is VALID [2018-11-23 12:24:09,629 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:24:09,629 INFO L273 TraceCheckUtils]: 27: Hoare triple {4124#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:24:09,629 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:24:09,629 INFO L273 TraceCheckUtils]: 29: Hoare triple {4124#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:24:09,630 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:24:09,630 INFO L273 TraceCheckUtils]: 31: Hoare triple {4124#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:24:09,630 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:24:09,630 INFO L273 TraceCheckUtils]: 33: Hoare triple {4124#true} assume !(~i~0 < 100); {4124#true} is VALID [2018-11-23 12:24:09,630 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:24:09,630 INFO L273 TraceCheckUtils]: 35: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:24:09,631 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {4124#true} {4124#true} #70#return; {4124#true} is VALID [2018-11-23 12:24:09,631 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:24:09,631 INFO L256 TraceCheckUtils]: 38: Hoare triple {4124#true} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {4124#true} is VALID [2018-11-23 12:24:09,631 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:24:09,631 INFO L273 TraceCheckUtils]: 40: Hoare triple {4124#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:24:09,631 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:24:09,631 INFO L273 TraceCheckUtils]: 42: Hoare triple {4124#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:24:09,632 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:24:09,632 INFO L273 TraceCheckUtils]: 44: Hoare triple {4124#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4124#true} is VALID [2018-11-23 12:24:09,632 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:24:09,632 INFO L273 TraceCheckUtils]: 46: Hoare triple {4124#true} assume !(~i~0 < 100); {4124#true} is VALID [2018-11-23 12:24:09,632 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:24:09,632 INFO L273 TraceCheckUtils]: 48: Hoare triple {4124#true} assume true; {4124#true} is VALID [2018-11-23 12:24:09,633 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {4124#true} {4124#true} #72#return; {4124#true} is VALID [2018-11-23 12:24:09,633 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:24:09,634 INFO L273 TraceCheckUtils]: 51: Hoare triple {4289#(<= main_~i~2 0)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:09,634 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:24:09,635 INFO L273 TraceCheckUtils]: 53: Hoare triple {4296#(<= main_~i~2 1)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:09,635 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:24:09,636 INFO L273 TraceCheckUtils]: 55: Hoare triple {4303#(<= main_~i~2 2)} assume !(~i~2 < 99); {4125#false} is VALID [2018-11-23 12:24:09,636 INFO L273 TraceCheckUtils]: 56: Hoare triple {4125#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {4125#false} is VALID [2018-11-23 12:24:09,636 INFO L256 TraceCheckUtils]: 57: Hoare triple {4125#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {4125#false} is VALID [2018-11-23 12:24:09,636 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:24:09,636 INFO L273 TraceCheckUtils]: 59: Hoare triple {4125#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4125#false} is VALID [2018-11-23 12:24:09,636 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:24:09,636 INFO L273 TraceCheckUtils]: 61: Hoare triple {4125#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4125#false} is VALID [2018-11-23 12:24:09,637 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:24:09,637 INFO L273 TraceCheckUtils]: 63: Hoare triple {4125#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4125#false} is VALID [2018-11-23 12:24:09,637 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:24:09,637 INFO L273 TraceCheckUtils]: 65: Hoare triple {4125#false} assume !(~i~0 < 100); {4125#false} is VALID [2018-11-23 12:24:09,638 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:24:09,638 INFO L273 TraceCheckUtils]: 67: Hoare triple {4125#false} assume true; {4125#false} is VALID [2018-11-23 12:24:09,638 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {4125#false} {4125#false} #74#return; {4125#false} is VALID [2018-11-23 12:24:09,638 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:24:09,639 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:24:09,639 INFO L273 TraceCheckUtils]: 71: Hoare triple {4125#false} assume !false; {4125#false} is VALID [2018-11-23 12:24:09,644 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:24:09,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:09,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2018-11-23 12:24:09,663 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2018-11-23 12:24:09,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:09,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 12:24:09,746 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:24:09,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 12:24:09,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 12:24:09,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:24:09,747 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 15 states. [2018-11-23 12:24:10,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:10,178 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2018-11-23 12:24:10,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 12:24:10,178 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2018-11-23 12:24:10,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:10,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:24:10,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 79 transitions. [2018-11-23 12:24:10,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:24:10,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 79 transitions. [2018-11-23 12:24:10,183 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 79 transitions. [2018-11-23 12:24:10,257 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:24:10,259 INFO L225 Difference]: With dead ends: 83 [2018-11-23 12:24:10,259 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 12:24:10,260 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:24:10,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 12:24:10,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-11-23 12:24:10,285 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:10,286 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 55 states. [2018-11-23 12:24:10,286 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 55 states. [2018-11-23 12:24:10,286 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 55 states. [2018-11-23 12:24:10,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:10,288 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-11-23 12:24:10,288 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-11-23 12:24:10,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:10,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:10,289 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 57 states. [2018-11-23 12:24:10,289 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 57 states. [2018-11-23 12:24:10,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:10,291 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-11-23 12:24:10,291 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-11-23 12:24:10,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:10,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:10,291 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:10,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:10,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 12:24:10,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-11-23 12:24:10,293 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 72 [2018-11-23 12:24:10,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:10,293 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-11-23 12:24:10,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 12:24:10,294 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-11-23 12:24:10,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 12:24:10,295 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:10,295 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:24:10,295 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:10,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:10,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1743973331, now seen corresponding path program 10 times [2018-11-23 12:24:10,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:10,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:10,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:10,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:24:10,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:10,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:10,604 INFO L256 TraceCheckUtils]: 0: Hoare triple {4671#true} call ULTIMATE.init(); {4671#true} is VALID [2018-11-23 12:24:10,604 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:24:10,604 INFO L273 TraceCheckUtils]: 2: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:24:10,604 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4671#true} {4671#true} #66#return; {4671#true} is VALID [2018-11-23 12:24:10,605 INFO L256 TraceCheckUtils]: 4: Hoare triple {4671#true} call #t~ret13 := main(); {4671#true} is VALID [2018-11-23 12:24:10,605 INFO L273 TraceCheckUtils]: 5: Hoare triple {4671#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:24:10,606 INFO L273 TraceCheckUtils]: 6: Hoare triple {4673#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:24:10,606 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:24:10,606 INFO L273 TraceCheckUtils]: 8: Hoare triple {4674#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:24:10,607 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:24:10,607 INFO L273 TraceCheckUtils]: 10: Hoare triple {4675#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:24:10,608 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:24:10,608 INFO L273 TraceCheckUtils]: 12: Hoare triple {4676#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -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:24:10,609 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:24:10,610 INFO L273 TraceCheckUtils]: 14: Hoare triple {4677#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -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:24:10,610 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:24:10,611 INFO L273 TraceCheckUtils]: 16: Hoare triple {4678#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -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:24:10,611 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:24:10,612 INFO L273 TraceCheckUtils]: 18: Hoare triple {4679#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -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:24:10,613 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:24:10,613 INFO L273 TraceCheckUtils]: 20: Hoare triple {4680#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -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:24:10,614 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:24:10,614 INFO L273 TraceCheckUtils]: 22: Hoare triple {4681#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -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:24:10,615 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:24:10,616 INFO L273 TraceCheckUtils]: 24: Hoare triple {4682#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -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:24:10,616 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:24:10,617 INFO L273 TraceCheckUtils]: 26: Hoare triple {4683#(<= main_~i~1 10)} assume !(~i~1 < 100); {4672#false} is VALID [2018-11-23 12:24:10,617 INFO L256 TraceCheckUtils]: 27: Hoare triple {4672#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {4671#true} is VALID [2018-11-23 12:24:10,617 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:24:10,618 INFO L273 TraceCheckUtils]: 29: Hoare triple {4671#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:24:10,618 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:24:10,618 INFO L273 TraceCheckUtils]: 31: Hoare triple {4671#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:24:10,618 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:24:10,618 INFO L273 TraceCheckUtils]: 33: Hoare triple {4671#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:24:10,619 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:24:10,619 INFO L273 TraceCheckUtils]: 35: Hoare triple {4671#true} assume !(~i~0 < 100); {4671#true} is VALID [2018-11-23 12:24:10,619 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:24:10,619 INFO L273 TraceCheckUtils]: 37: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:24:10,619 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {4671#true} {4672#false} #70#return; {4672#false} is VALID [2018-11-23 12:24:10,619 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:24:10,620 INFO L256 TraceCheckUtils]: 40: Hoare triple {4672#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {4671#true} is VALID [2018-11-23 12:24:10,620 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:24:10,620 INFO L273 TraceCheckUtils]: 42: Hoare triple {4671#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:24:10,620 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:24:10,620 INFO L273 TraceCheckUtils]: 44: Hoare triple {4671#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:24:10,620 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:24:10,620 INFO L273 TraceCheckUtils]: 46: Hoare triple {4671#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:24:10,620 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:24:10,621 INFO L273 TraceCheckUtils]: 48: Hoare triple {4671#true} assume !(~i~0 < 100); {4671#true} is VALID [2018-11-23 12:24:10,621 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:24:10,621 INFO L273 TraceCheckUtils]: 50: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:24:10,621 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {4671#true} {4672#false} #72#return; {4672#false} is VALID [2018-11-23 12:24:10,621 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:24:10,621 INFO L273 TraceCheckUtils]: 53: Hoare triple {4672#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:10,621 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:24:10,621 INFO L273 TraceCheckUtils]: 55: Hoare triple {4672#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:10,622 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:24:10,622 INFO L273 TraceCheckUtils]: 57: Hoare triple {4672#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:10,622 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:24:10,622 INFO L273 TraceCheckUtils]: 59: Hoare triple {4672#false} assume !(~i~2 < 99); {4672#false} is VALID [2018-11-23 12:24:10,622 INFO L273 TraceCheckUtils]: 60: Hoare triple {4672#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {4672#false} is VALID [2018-11-23 12:24:10,622 INFO L256 TraceCheckUtils]: 61: Hoare triple {4672#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {4671#true} is VALID [2018-11-23 12:24:10,622 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:24:10,622 INFO L273 TraceCheckUtils]: 63: Hoare triple {4671#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:24:10,622 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:24:10,623 INFO L273 TraceCheckUtils]: 65: Hoare triple {4671#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:24:10,623 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:24:10,623 INFO L273 TraceCheckUtils]: 67: Hoare triple {4671#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:24:10,623 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:24:10,623 INFO L273 TraceCheckUtils]: 69: Hoare triple {4671#true} assume !(~i~0 < 100); {4671#true} is VALID [2018-11-23 12:24:10,623 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:24:10,623 INFO L273 TraceCheckUtils]: 71: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:24:10,623 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {4671#true} {4672#false} #74#return; {4672#false} is VALID [2018-11-23 12:24:10,624 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:24:10,624 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:24:10,624 INFO L273 TraceCheckUtils]: 75: Hoare triple {4672#false} assume !false; {4672#false} is VALID [2018-11-23 12:24:10,626 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:24:10,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:10,627 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:24:10,638 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:24:10,673 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:24:10,673 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:24:10,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:10,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:10,868 INFO L256 TraceCheckUtils]: 0: Hoare triple {4671#true} call ULTIMATE.init(); {4671#true} is VALID [2018-11-23 12:24:10,868 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:24:10,869 INFO L273 TraceCheckUtils]: 2: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:24:10,869 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4671#true} {4671#true} #66#return; {4671#true} is VALID [2018-11-23 12:24:10,869 INFO L256 TraceCheckUtils]: 4: Hoare triple {4671#true} call #t~ret13 := main(); {4671#true} is VALID [2018-11-23 12:24:10,869 INFO L273 TraceCheckUtils]: 5: Hoare triple {4671#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {4671#true} is VALID [2018-11-23 12:24:10,869 INFO L273 TraceCheckUtils]: 6: Hoare triple {4671#true} assume !!(~i~1 < 100);assume -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:24:10,870 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:24:10,870 INFO L273 TraceCheckUtils]: 8: Hoare triple {4671#true} assume !!(~i~1 < 100);assume -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:24:10,870 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:24:10,870 INFO L273 TraceCheckUtils]: 10: Hoare triple {4671#true} assume !!(~i~1 < 100);assume -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:24:10,870 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:24:10,871 INFO L273 TraceCheckUtils]: 12: Hoare triple {4671#true} assume !!(~i~1 < 100);assume -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:24:10,871 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:24:10,871 INFO L273 TraceCheckUtils]: 14: Hoare triple {4671#true} assume !!(~i~1 < 100);assume -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:24:10,871 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:24:10,871 INFO L273 TraceCheckUtils]: 16: Hoare triple {4671#true} assume !!(~i~1 < 100);assume -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:24:10,871 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:24:10,871 INFO L273 TraceCheckUtils]: 18: Hoare triple {4671#true} assume !!(~i~1 < 100);assume -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:24:10,872 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:24:10,872 INFO L273 TraceCheckUtils]: 20: Hoare triple {4671#true} assume !!(~i~1 < 100);assume -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:24:10,872 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:24:10,872 INFO L273 TraceCheckUtils]: 22: Hoare triple {4671#true} assume !!(~i~1 < 100);assume -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:24:10,872 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:24:10,872 INFO L273 TraceCheckUtils]: 24: Hoare triple {4671#true} assume !!(~i~1 < 100);assume -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:24:10,872 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:24:10,872 INFO L273 TraceCheckUtils]: 26: Hoare triple {4671#true} assume !(~i~1 < 100); {4671#true} is VALID [2018-11-23 12:24:10,873 INFO L256 TraceCheckUtils]: 27: Hoare triple {4671#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {4671#true} is VALID [2018-11-23 12:24:10,873 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:24:10,873 INFO L273 TraceCheckUtils]: 29: Hoare triple {4671#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:24:10,873 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:24:10,873 INFO L273 TraceCheckUtils]: 31: Hoare triple {4671#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:24:10,873 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:24:10,873 INFO L273 TraceCheckUtils]: 33: Hoare triple {4671#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:24:10,873 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:24:10,873 INFO L273 TraceCheckUtils]: 35: Hoare triple {4671#true} assume !(~i~0 < 100); {4671#true} is VALID [2018-11-23 12:24:10,874 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:24:10,874 INFO L273 TraceCheckUtils]: 37: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:24:10,874 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {4671#true} {4671#true} #70#return; {4671#true} is VALID [2018-11-23 12:24:10,874 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:24:10,874 INFO L256 TraceCheckUtils]: 40: Hoare triple {4671#true} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {4671#true} is VALID [2018-11-23 12:24:10,874 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:24:10,874 INFO L273 TraceCheckUtils]: 42: Hoare triple {4671#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:24:10,874 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:24:10,875 INFO L273 TraceCheckUtils]: 44: Hoare triple {4671#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:24:10,875 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:24:10,875 INFO L273 TraceCheckUtils]: 46: Hoare triple {4671#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4671#true} is VALID [2018-11-23 12:24:10,875 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:24:10,875 INFO L273 TraceCheckUtils]: 48: Hoare triple {4671#true} assume !(~i~0 < 100); {4671#true} is VALID [2018-11-23 12:24:10,875 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:24:10,875 INFO L273 TraceCheckUtils]: 50: Hoare triple {4671#true} assume true; {4671#true} is VALID [2018-11-23 12:24:10,875 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {4671#true} {4671#true} #72#return; {4671#true} is VALID [2018-11-23 12:24:10,875 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:24:10,876 INFO L273 TraceCheckUtils]: 53: Hoare triple {4671#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:10,876 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:24:10,876 INFO L273 TraceCheckUtils]: 55: Hoare triple {4671#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:10,876 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:24:10,876 INFO L273 TraceCheckUtils]: 57: Hoare triple {4671#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:10,876 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:24:10,876 INFO L273 TraceCheckUtils]: 59: Hoare triple {4671#true} assume !(~i~2 < 99); {4671#true} is VALID [2018-11-23 12:24:10,876 INFO L273 TraceCheckUtils]: 60: Hoare triple {4671#true} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {4671#true} is VALID [2018-11-23 12:24:10,877 INFO L256 TraceCheckUtils]: 61: Hoare triple {4671#true} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {4671#true} is VALID [2018-11-23 12:24:10,877 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#(<= bAnd_~i~0 1)} is VALID [2018-11-23 12:24:10,877 INFO L273 TraceCheckUtils]: 63: Hoare triple {4873#(<= bAnd_~i~0 1)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4873#(<= bAnd_~i~0 1)} is VALID [2018-11-23 12:24:10,878 INFO L273 TraceCheckUtils]: 64: Hoare triple {4873#(<= bAnd_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4880#(<= bAnd_~i~0 2)} is VALID [2018-11-23 12:24:10,878 INFO L273 TraceCheckUtils]: 65: Hoare triple {4880#(<= bAnd_~i~0 2)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4880#(<= bAnd_~i~0 2)} is VALID [2018-11-23 12:24:10,879 INFO L273 TraceCheckUtils]: 66: Hoare triple {4880#(<= bAnd_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4887#(<= bAnd_~i~0 3)} is VALID [2018-11-23 12:24:10,879 INFO L273 TraceCheckUtils]: 67: Hoare triple {4887#(<= bAnd_~i~0 3)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {4887#(<= bAnd_~i~0 3)} is VALID [2018-11-23 12:24:10,879 INFO L273 TraceCheckUtils]: 68: Hoare triple {4887#(<= bAnd_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4894#(<= bAnd_~i~0 4)} is VALID [2018-11-23 12:24:10,880 INFO L273 TraceCheckUtils]: 69: Hoare triple {4894#(<= bAnd_~i~0 4)} assume !(~i~0 < 100); {4672#false} is VALID [2018-11-23 12:24:10,880 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:24:10,880 INFO L273 TraceCheckUtils]: 71: Hoare triple {4672#false} assume true; {4672#false} is VALID [2018-11-23 12:24:10,880 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {4672#false} {4671#true} #74#return; {4672#false} is VALID [2018-11-23 12:24:10,880 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:24:10,881 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:24:10,881 INFO L273 TraceCheckUtils]: 75: Hoare triple {4672#false} assume !false; {4672#false} is VALID [2018-11-23 12:24:10,883 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:24:10,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:10,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6] total 17 [2018-11-23 12:24:10,903 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 76 [2018-11-23 12:24:10,903 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:10,904 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:24:10,968 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:24:10,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:24:10,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:24:10,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:24:10,969 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 17 states. [2018-11-23 12:24:11,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:11,467 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2018-11-23 12:24:11,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:24:11,467 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 76 [2018-11-23 12:24:11,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:11,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:24:11,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 86 transitions. [2018-11-23 12:24:11,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:24:11,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 86 transitions. [2018-11-23 12:24:11,470 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 86 transitions. [2018-11-23 12:24:12,420 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:24:12,421 INFO L225 Difference]: With dead ends: 89 [2018-11-23 12:24:12,421 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 12:24:12,422 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:24:12,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 12:24:12,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-11-23 12:24:12,467 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:12,467 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 59 states. [2018-11-23 12:24:12,467 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 59 states. [2018-11-23 12:24:12,467 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 59 states. [2018-11-23 12:24:12,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:12,469 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-11-23 12:24:12,469 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-11-23 12:24:12,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:12,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:12,470 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 61 states. [2018-11-23 12:24:12,470 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 61 states. [2018-11-23 12:24:12,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:12,471 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-11-23 12:24:12,471 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-11-23 12:24:12,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:12,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:12,472 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:12,472 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:12,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 12:24:12,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-11-23 12:24:12,474 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 76 [2018-11-23 12:24:12,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:12,474 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-11-23 12:24:12,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:24:12,474 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-11-23 12:24:12,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-23 12:24:12,475 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:12,476 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:24:12,476 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:12,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:12,476 INFO L82 PathProgramCache]: Analyzing trace with hash -506591693, now seen corresponding path program 11 times [2018-11-23 12:24:12,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:12,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:12,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:12,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:24:12,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:12,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:13,574 INFO L256 TraceCheckUtils]: 0: Hoare triple {5255#true} call ULTIMATE.init(); {5255#true} is VALID [2018-11-23 12:24:13,574 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:24:13,574 INFO L273 TraceCheckUtils]: 2: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:24:13,575 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5255#true} {5255#true} #66#return; {5255#true} is VALID [2018-11-23 12:24:13,575 INFO L256 TraceCheckUtils]: 4: Hoare triple {5255#true} call #t~ret13 := main(); {5255#true} is VALID [2018-11-23 12:24:13,575 INFO L273 TraceCheckUtils]: 5: Hoare triple {5255#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:24:13,575 INFO L273 TraceCheckUtils]: 6: Hoare triple {5257#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:24:13,576 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:24:13,576 INFO L273 TraceCheckUtils]: 8: Hoare triple {5258#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:24:13,577 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:24:13,577 INFO L273 TraceCheckUtils]: 10: Hoare triple {5259#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:24:13,578 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:24:13,578 INFO L273 TraceCheckUtils]: 12: Hoare triple {5260#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -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:24:13,579 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:24:13,579 INFO L273 TraceCheckUtils]: 14: Hoare triple {5261#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -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:24:13,580 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:24:13,581 INFO L273 TraceCheckUtils]: 16: Hoare triple {5262#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -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:24:13,581 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:24:13,601 INFO L273 TraceCheckUtils]: 18: Hoare triple {5263#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -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:24:13,605 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:24:13,605 INFO L273 TraceCheckUtils]: 20: Hoare triple {5264#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -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:24:13,606 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:24:13,606 INFO L273 TraceCheckUtils]: 22: Hoare triple {5265#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -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:24:13,606 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:24:13,607 INFO L273 TraceCheckUtils]: 24: Hoare triple {5266#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -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:24:13,607 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:24:13,607 INFO L273 TraceCheckUtils]: 26: Hoare triple {5267#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -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:24:13,608 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:24:13,608 INFO L273 TraceCheckUtils]: 28: Hoare triple {5268#(<= main_~i~1 11)} assume !(~i~1 < 100); {5256#false} is VALID [2018-11-23 12:24:13,608 INFO L256 TraceCheckUtils]: 29: Hoare triple {5256#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {5255#true} is VALID [2018-11-23 12:24:13,609 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:24:13,609 INFO L273 TraceCheckUtils]: 31: Hoare triple {5255#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:24:13,609 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:24:13,609 INFO L273 TraceCheckUtils]: 33: Hoare triple {5255#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:24:13,609 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:24:13,609 INFO L273 TraceCheckUtils]: 35: Hoare triple {5255#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:24:13,609 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:24:13,610 INFO L273 TraceCheckUtils]: 37: Hoare triple {5255#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:24:13,610 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:24:13,610 INFO L273 TraceCheckUtils]: 39: Hoare triple {5255#true} assume !(~i~0 < 100); {5255#true} is VALID [2018-11-23 12:24:13,610 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:24:13,610 INFO L273 TraceCheckUtils]: 41: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:24:13,610 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {5255#true} {5256#false} #70#return; {5256#false} is VALID [2018-11-23 12:24:13,611 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:24:13,611 INFO L256 TraceCheckUtils]: 44: Hoare triple {5256#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {5255#true} is VALID [2018-11-23 12:24:13,611 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:24:13,611 INFO L273 TraceCheckUtils]: 46: Hoare triple {5255#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:24:13,611 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:24:13,611 INFO L273 TraceCheckUtils]: 48: Hoare triple {5255#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:24:13,611 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:24:13,611 INFO L273 TraceCheckUtils]: 50: Hoare triple {5255#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:24:13,612 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:24:13,612 INFO L273 TraceCheckUtils]: 52: Hoare triple {5255#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:24:13,612 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:24:13,612 INFO L273 TraceCheckUtils]: 54: Hoare triple {5255#true} assume !(~i~0 < 100); {5255#true} is VALID [2018-11-23 12:24:13,612 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:24:13,612 INFO L273 TraceCheckUtils]: 56: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:24:13,612 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {5255#true} {5256#false} #72#return; {5256#false} is VALID [2018-11-23 12:24:13,612 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:24:13,612 INFO L273 TraceCheckUtils]: 59: Hoare triple {5256#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:13,613 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:24:13,613 INFO L273 TraceCheckUtils]: 61: Hoare triple {5256#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:13,613 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:24:13,613 INFO L273 TraceCheckUtils]: 63: Hoare triple {5256#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:13,613 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:24:13,613 INFO L273 TraceCheckUtils]: 65: Hoare triple {5256#false} assume !(~i~2 < 99); {5256#false} is VALID [2018-11-23 12:24:13,613 INFO L273 TraceCheckUtils]: 66: Hoare triple {5256#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {5256#false} is VALID [2018-11-23 12:24:13,613 INFO L256 TraceCheckUtils]: 67: Hoare triple {5256#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {5255#true} is VALID [2018-11-23 12:24:13,614 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:24:13,614 INFO L273 TraceCheckUtils]: 69: Hoare triple {5255#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:24:13,614 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:24:13,614 INFO L273 TraceCheckUtils]: 71: Hoare triple {5255#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:24:13,614 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:24:13,614 INFO L273 TraceCheckUtils]: 73: Hoare triple {5255#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:24:13,614 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:24:13,614 INFO L273 TraceCheckUtils]: 75: Hoare triple {5255#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5255#true} is VALID [2018-11-23 12:24:13,614 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:24:13,615 INFO L273 TraceCheckUtils]: 77: Hoare triple {5255#true} assume !(~i~0 < 100); {5255#true} is VALID [2018-11-23 12:24:13,615 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:24:13,615 INFO L273 TraceCheckUtils]: 79: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:24:13,615 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {5255#true} {5256#false} #74#return; {5256#false} is VALID [2018-11-23 12:24:13,615 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:24:13,615 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:24:13,615 INFO L273 TraceCheckUtils]: 83: Hoare triple {5256#false} assume !false; {5256#false} is VALID [2018-11-23 12:24:13,618 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:24:13,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:13,619 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:24:13,627 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:24:13,842 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-11-23 12:24:13,842 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:24:13,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:13,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:13,996 INFO L256 TraceCheckUtils]: 0: Hoare triple {5255#true} call ULTIMATE.init(); {5255#true} is VALID [2018-11-23 12:24:13,997 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:24:13,997 INFO L273 TraceCheckUtils]: 2: Hoare triple {5255#true} assume true; {5255#true} is VALID [2018-11-23 12:24:13,997 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5255#true} {5255#true} #66#return; {5255#true} is VALID [2018-11-23 12:24:13,997 INFO L256 TraceCheckUtils]: 4: Hoare triple {5255#true} call #t~ret13 := main(); {5255#true} is VALID [2018-11-23 12:24:13,997 INFO L273 TraceCheckUtils]: 5: Hoare triple {5255#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5255#true} is VALID [2018-11-23 12:24:13,998 INFO L273 TraceCheckUtils]: 6: Hoare triple {5255#true} assume !!(~i~1 < 100);assume -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:24:13,998 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:24:13,998 INFO L273 TraceCheckUtils]: 8: Hoare triple {5255#true} assume !!(~i~1 < 100);assume -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:24:13,998 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:24:13,998 INFO L273 TraceCheckUtils]: 10: Hoare triple {5255#true} assume !!(~i~1 < 100);assume -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:24:13,999 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:24:13,999 INFO L273 TraceCheckUtils]: 12: Hoare triple {5255#true} assume !!(~i~1 < 100);assume -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:24:13,999 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:24:13,999 INFO L273 TraceCheckUtils]: 14: Hoare triple {5255#true} assume !!(~i~1 < 100);assume -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:24:13,999 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:24:13,999 INFO L273 TraceCheckUtils]: 16: Hoare triple {5255#true} assume !!(~i~1 < 100);assume -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:24:13,999 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:24:14,000 INFO L273 TraceCheckUtils]: 18: Hoare triple {5255#true} assume !!(~i~1 < 100);assume -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:24:14,000 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:24:14,000 INFO L273 TraceCheckUtils]: 20: Hoare triple {5255#true} assume !!(~i~1 < 100);assume -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:24:14,000 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:24:14,000 INFO L273 TraceCheckUtils]: 22: Hoare triple {5255#true} assume !!(~i~1 < 100);assume -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:24:14,000 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:24:14,000 INFO L273 TraceCheckUtils]: 24: Hoare triple {5255#true} assume !!(~i~1 < 100);assume -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:24:14,000 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:24:14,001 INFO L273 TraceCheckUtils]: 26: Hoare triple {5255#true} assume !!(~i~1 < 100);assume -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:24:14,001 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:24:14,001 INFO L273 TraceCheckUtils]: 28: Hoare triple {5255#true} assume !(~i~1 < 100); {5255#true} is VALID [2018-11-23 12:24:14,001 INFO L256 TraceCheckUtils]: 29: Hoare triple {5255#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {5255#true} is VALID [2018-11-23 12:24:14,001 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#(<= bAnd_~i~0 1)} is VALID [2018-11-23 12:24:14,002 INFO L273 TraceCheckUtils]: 31: Hoare triple {5362#(<= bAnd_~i~0 1)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5362#(<= bAnd_~i~0 1)} is VALID [2018-11-23 12:24:14,002 INFO L273 TraceCheckUtils]: 32: Hoare triple {5362#(<= bAnd_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5369#(<= bAnd_~i~0 2)} is VALID [2018-11-23 12:24:14,002 INFO L273 TraceCheckUtils]: 33: Hoare triple {5369#(<= bAnd_~i~0 2)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5369#(<= bAnd_~i~0 2)} is VALID [2018-11-23 12:24:14,003 INFO L273 TraceCheckUtils]: 34: Hoare triple {5369#(<= bAnd_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5376#(<= bAnd_~i~0 3)} is VALID [2018-11-23 12:24:14,003 INFO L273 TraceCheckUtils]: 35: Hoare triple {5376#(<= bAnd_~i~0 3)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5376#(<= bAnd_~i~0 3)} is VALID [2018-11-23 12:24:14,004 INFO L273 TraceCheckUtils]: 36: Hoare triple {5376#(<= bAnd_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5383#(<= bAnd_~i~0 4)} is VALID [2018-11-23 12:24:14,004 INFO L273 TraceCheckUtils]: 37: Hoare triple {5383#(<= bAnd_~i~0 4)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5383#(<= bAnd_~i~0 4)} is VALID [2018-11-23 12:24:14,005 INFO L273 TraceCheckUtils]: 38: Hoare triple {5383#(<= bAnd_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5390#(<= bAnd_~i~0 5)} is VALID [2018-11-23 12:24:14,005 INFO L273 TraceCheckUtils]: 39: Hoare triple {5390#(<= bAnd_~i~0 5)} assume !(~i~0 < 100); {5256#false} is VALID [2018-11-23 12:24:14,006 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:24:14,006 INFO L273 TraceCheckUtils]: 41: Hoare triple {5256#false} assume true; {5256#false} is VALID [2018-11-23 12:24:14,006 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {5256#false} {5255#true} #70#return; {5256#false} is VALID [2018-11-23 12:24:14,006 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:24:14,006 INFO L256 TraceCheckUtils]: 44: Hoare triple {5256#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {5256#false} is VALID [2018-11-23 12:24:14,007 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:24:14,007 INFO L273 TraceCheckUtils]: 46: Hoare triple {5256#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5256#false} is VALID [2018-11-23 12:24:14,007 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:24:14,007 INFO L273 TraceCheckUtils]: 48: Hoare triple {5256#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5256#false} is VALID [2018-11-23 12:24:14,007 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:24:14,008 INFO L273 TraceCheckUtils]: 50: Hoare triple {5256#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5256#false} is VALID [2018-11-23 12:24:14,008 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:24:14,008 INFO L273 TraceCheckUtils]: 52: Hoare triple {5256#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5256#false} is VALID [2018-11-23 12:24:14,008 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:24:14,008 INFO L273 TraceCheckUtils]: 54: Hoare triple {5256#false} assume !(~i~0 < 100); {5256#false} is VALID [2018-11-23 12:24:14,009 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:24:14,009 INFO L273 TraceCheckUtils]: 56: Hoare triple {5256#false} assume true; {5256#false} is VALID [2018-11-23 12:24:14,009 INFO L268 TraceCheckUtils]: 57: Hoare quadruple {5256#false} {5256#false} #72#return; {5256#false} is VALID [2018-11-23 12:24:14,009 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:24:14,009 INFO L273 TraceCheckUtils]: 59: Hoare triple {5256#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:14,009 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:24:14,009 INFO L273 TraceCheckUtils]: 61: Hoare triple {5256#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:14,010 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:24:14,010 INFO L273 TraceCheckUtils]: 63: Hoare triple {5256#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:14,010 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:24:14,010 INFO L273 TraceCheckUtils]: 65: Hoare triple {5256#false} assume !(~i~2 < 99); {5256#false} is VALID [2018-11-23 12:24:14,010 INFO L273 TraceCheckUtils]: 66: Hoare triple {5256#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {5256#false} is VALID [2018-11-23 12:24:14,010 INFO L256 TraceCheckUtils]: 67: Hoare triple {5256#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {5256#false} is VALID [2018-11-23 12:24:14,010 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:24:14,010 INFO L273 TraceCheckUtils]: 69: Hoare triple {5256#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5256#false} is VALID [2018-11-23 12:24:14,010 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:24:14,011 INFO L273 TraceCheckUtils]: 71: Hoare triple {5256#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5256#false} is VALID [2018-11-23 12:24:14,011 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:24:14,011 INFO L273 TraceCheckUtils]: 73: Hoare triple {5256#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5256#false} is VALID [2018-11-23 12:24:14,011 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:24:14,011 INFO L273 TraceCheckUtils]: 75: Hoare triple {5256#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5256#false} is VALID [2018-11-23 12:24:14,011 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:24:14,011 INFO L273 TraceCheckUtils]: 77: Hoare triple {5256#false} assume !(~i~0 < 100); {5256#false} is VALID [2018-11-23 12:24:14,011 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:24:14,012 INFO L273 TraceCheckUtils]: 79: Hoare triple {5256#false} assume true; {5256#false} is VALID [2018-11-23 12:24:14,012 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {5256#false} {5256#false} #74#return; {5256#false} is VALID [2018-11-23 12:24:14,012 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:24:14,012 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:24:14,012 INFO L273 TraceCheckUtils]: 83: Hoare triple {5256#false} assume !false; {5256#false} is VALID [2018-11-23 12:24:14,014 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:24:14,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:14,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 19 [2018-11-23 12:24:14,033 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 84 [2018-11-23 12:24:14,034 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:14,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 12:24:14,102 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:24:14,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 12:24:14,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 12:24:14,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:24:14,104 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 19 states. [2018-11-23 12:24:14,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:14,559 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2018-11-23 12:24:14,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:24:14,559 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 84 [2018-11-23 12:24:14,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:14,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:24:14,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 90 transitions. [2018-11-23 12:24:14,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:24:14,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 90 transitions. [2018-11-23 12:24:14,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 90 transitions. [2018-11-23 12:24:14,676 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:24:14,678 INFO L225 Difference]: With dead ends: 95 [2018-11-23 12:24:14,678 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 12:24:14,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:24:14,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 12:24:14,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-11-23 12:24:14,702 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:14,702 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 63 states. [2018-11-23 12:24:14,702 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 63 states. [2018-11-23 12:24:14,702 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 63 states. [2018-11-23 12:24:14,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:14,704 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-11-23 12:24:14,705 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-11-23 12:24:14,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:14,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:14,705 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 65 states. [2018-11-23 12:24:14,705 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 65 states. [2018-11-23 12:24:14,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:14,707 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-11-23 12:24:14,707 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-11-23 12:24:14,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:14,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:14,708 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:14,708 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:14,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 12:24:14,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-11-23 12:24:14,710 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 84 [2018-11-23 12:24:14,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:14,710 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-11-23 12:24:14,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 12:24:14,710 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-11-23 12:24:14,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-23 12:24:14,711 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:14,711 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:24:14,711 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:14,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:14,712 INFO L82 PathProgramCache]: Analyzing trace with hash -416573805, now seen corresponding path program 12 times [2018-11-23 12:24:14,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:14,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:14,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:14,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:24:14,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:14,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:16,293 INFO L256 TraceCheckUtils]: 0: Hoare triple {5888#true} call ULTIMATE.init(); {5888#true} is VALID [2018-11-23 12:24:16,294 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:24:16,294 INFO L273 TraceCheckUtils]: 2: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:24:16,294 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5888#true} {5888#true} #66#return; {5888#true} is VALID [2018-11-23 12:24:16,294 INFO L256 TraceCheckUtils]: 4: Hoare triple {5888#true} call #t~ret13 := main(); {5888#true} is VALID [2018-11-23 12:24:16,294 INFO L273 TraceCheckUtils]: 5: Hoare triple {5888#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:24:16,295 INFO L273 TraceCheckUtils]: 6: Hoare triple {5890#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:24:16,295 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:24:16,296 INFO L273 TraceCheckUtils]: 8: Hoare triple {5891#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:24:16,296 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:24:16,297 INFO L273 TraceCheckUtils]: 10: Hoare triple {5892#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:24:16,298 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:24:16,299 INFO L273 TraceCheckUtils]: 12: Hoare triple {5893#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -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:24:16,300 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:24:16,300 INFO L273 TraceCheckUtils]: 14: Hoare triple {5894#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -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:24:16,301 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:24:16,301 INFO L273 TraceCheckUtils]: 16: Hoare triple {5895#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -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:24:16,302 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:24:16,303 INFO L273 TraceCheckUtils]: 18: Hoare triple {5896#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -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:24:16,303 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:24:16,304 INFO L273 TraceCheckUtils]: 20: Hoare triple {5897#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -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:24:16,304 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:24:16,305 INFO L273 TraceCheckUtils]: 22: Hoare triple {5898#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -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:24:16,306 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:24:16,306 INFO L273 TraceCheckUtils]: 24: Hoare triple {5899#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -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:24:16,307 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:24:16,307 INFO L273 TraceCheckUtils]: 26: Hoare triple {5900#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -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:24:16,308 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:24:16,309 INFO L273 TraceCheckUtils]: 28: Hoare triple {5901#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -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:24:16,309 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:24:16,310 INFO L273 TraceCheckUtils]: 30: Hoare triple {5902#(<= main_~i~1 12)} assume !(~i~1 < 100); {5889#false} is VALID [2018-11-23 12:24:16,310 INFO L256 TraceCheckUtils]: 31: Hoare triple {5889#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {5888#true} is VALID [2018-11-23 12:24:16,310 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:24:16,311 INFO L273 TraceCheckUtils]: 33: Hoare triple {5888#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:24:16,311 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:24:16,311 INFO L273 TraceCheckUtils]: 35: Hoare triple {5888#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:24:16,311 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:24:16,311 INFO L273 TraceCheckUtils]: 37: Hoare triple {5888#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:24:16,312 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:24:16,312 INFO L273 TraceCheckUtils]: 39: Hoare triple {5888#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:24:16,312 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:24:16,312 INFO L273 TraceCheckUtils]: 41: Hoare triple {5888#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:24:16,312 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:24:16,312 INFO L273 TraceCheckUtils]: 43: Hoare triple {5888#true} assume !(~i~0 < 100); {5888#true} is VALID [2018-11-23 12:24:16,313 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:24:16,313 INFO L273 TraceCheckUtils]: 45: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:24:16,313 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {5888#true} {5889#false} #70#return; {5889#false} is VALID [2018-11-23 12:24:16,313 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:24:16,313 INFO L256 TraceCheckUtils]: 48: Hoare triple {5889#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {5888#true} is VALID [2018-11-23 12:24:16,314 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:24:16,314 INFO L273 TraceCheckUtils]: 50: Hoare triple {5888#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:24:16,314 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:24:16,314 INFO L273 TraceCheckUtils]: 52: Hoare triple {5888#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:24:16,314 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:24:16,314 INFO L273 TraceCheckUtils]: 54: Hoare triple {5888#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:24:16,315 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:24:16,315 INFO L273 TraceCheckUtils]: 56: Hoare triple {5888#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:24:16,315 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:24:16,315 INFO L273 TraceCheckUtils]: 58: Hoare triple {5888#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:24:16,315 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:24:16,315 INFO L273 TraceCheckUtils]: 60: Hoare triple {5888#true} assume !(~i~0 < 100); {5888#true} is VALID [2018-11-23 12:24:16,315 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:24:16,315 INFO L273 TraceCheckUtils]: 62: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:24:16,316 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {5888#true} {5889#false} #72#return; {5889#false} is VALID [2018-11-23 12:24:16,316 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:24:16,316 INFO L273 TraceCheckUtils]: 65: Hoare triple {5889#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:16,316 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:24:16,316 INFO L273 TraceCheckUtils]: 67: Hoare triple {5889#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:16,316 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:24:16,316 INFO L273 TraceCheckUtils]: 69: Hoare triple {5889#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:16,316 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:24:16,316 INFO L273 TraceCheckUtils]: 71: Hoare triple {5889#false} assume !(~i~2 < 99); {5889#false} is VALID [2018-11-23 12:24:16,317 INFO L273 TraceCheckUtils]: 72: Hoare triple {5889#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {5889#false} is VALID [2018-11-23 12:24:16,317 INFO L256 TraceCheckUtils]: 73: Hoare triple {5889#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {5888#true} is VALID [2018-11-23 12:24:16,317 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:24:16,317 INFO L273 TraceCheckUtils]: 75: Hoare triple {5888#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:24:16,317 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:24:16,317 INFO L273 TraceCheckUtils]: 77: Hoare triple {5888#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:24:16,317 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:24:16,317 INFO L273 TraceCheckUtils]: 79: Hoare triple {5888#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:24:16,318 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:24:16,318 INFO L273 TraceCheckUtils]: 81: Hoare triple {5888#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:24:16,318 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:24:16,318 INFO L273 TraceCheckUtils]: 83: Hoare triple {5888#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:24:16,318 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:24:16,318 INFO L273 TraceCheckUtils]: 85: Hoare triple {5888#true} assume !(~i~0 < 100); {5888#true} is VALID [2018-11-23 12:24:16,318 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:24:16,318 INFO L273 TraceCheckUtils]: 87: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:24:16,318 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {5888#true} {5889#false} #74#return; {5889#false} is VALID [2018-11-23 12:24:16,319 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:24:16,319 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:24:16,319 INFO L273 TraceCheckUtils]: 91: Hoare triple {5889#false} assume !false; {5889#false} is VALID [2018-11-23 12:24:16,323 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:24:16,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:16,323 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:24:16,331 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:24:16,424 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-11-23 12:24:16,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:24:16,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:16,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:16,642 INFO L256 TraceCheckUtils]: 0: Hoare triple {5888#true} call ULTIMATE.init(); {5888#true} is VALID [2018-11-23 12:24:16,643 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:24:16,643 INFO L273 TraceCheckUtils]: 2: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:24:16,643 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5888#true} {5888#true} #66#return; {5888#true} is VALID [2018-11-23 12:24:16,643 INFO L256 TraceCheckUtils]: 4: Hoare triple {5888#true} call #t~ret13 := main(); {5888#true} is VALID [2018-11-23 12:24:16,643 INFO L273 TraceCheckUtils]: 5: Hoare triple {5888#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5888#true} is VALID [2018-11-23 12:24:16,643 INFO L273 TraceCheckUtils]: 6: Hoare triple {5888#true} assume !!(~i~1 < 100);assume -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:24:16,643 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:24:16,644 INFO L273 TraceCheckUtils]: 8: Hoare triple {5888#true} assume !!(~i~1 < 100);assume -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:24:16,644 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:24:16,644 INFO L273 TraceCheckUtils]: 10: Hoare triple {5888#true} assume !!(~i~1 < 100);assume -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:24:16,644 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:24:16,644 INFO L273 TraceCheckUtils]: 12: Hoare triple {5888#true} assume !!(~i~1 < 100);assume -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:24:16,644 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:24:16,644 INFO L273 TraceCheckUtils]: 14: Hoare triple {5888#true} assume !!(~i~1 < 100);assume -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:24:16,644 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:24:16,644 INFO L273 TraceCheckUtils]: 16: Hoare triple {5888#true} assume !!(~i~1 < 100);assume -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:24:16,645 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:24:16,645 INFO L273 TraceCheckUtils]: 18: Hoare triple {5888#true} assume !!(~i~1 < 100);assume -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:24:16,645 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:24:16,645 INFO L273 TraceCheckUtils]: 20: Hoare triple {5888#true} assume !!(~i~1 < 100);assume -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:24:16,645 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:24:16,645 INFO L273 TraceCheckUtils]: 22: Hoare triple {5888#true} assume !!(~i~1 < 100);assume -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:24:16,645 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:24:16,645 INFO L273 TraceCheckUtils]: 24: Hoare triple {5888#true} assume !!(~i~1 < 100);assume -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:24:16,646 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:24:16,646 INFO L273 TraceCheckUtils]: 26: Hoare triple {5888#true} assume !!(~i~1 < 100);assume -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:24:16,646 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:24:16,646 INFO L273 TraceCheckUtils]: 28: Hoare triple {5888#true} assume !!(~i~1 < 100);assume -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:24:16,646 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:24:16,646 INFO L273 TraceCheckUtils]: 30: Hoare triple {5888#true} assume !(~i~1 < 100); {5888#true} is VALID [2018-11-23 12:24:16,646 INFO L256 TraceCheckUtils]: 31: Hoare triple {5888#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {5888#true} is VALID [2018-11-23 12:24:16,646 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:24:16,646 INFO L273 TraceCheckUtils]: 33: Hoare triple {5888#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:24:16,647 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:24:16,647 INFO L273 TraceCheckUtils]: 35: Hoare triple {5888#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:24:16,647 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:24:16,647 INFO L273 TraceCheckUtils]: 37: Hoare triple {5888#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:24:16,647 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:24:16,647 INFO L273 TraceCheckUtils]: 39: Hoare triple {5888#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:24:16,647 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:24:16,647 INFO L273 TraceCheckUtils]: 41: Hoare triple {5888#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:24:16,648 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:24:16,648 INFO L273 TraceCheckUtils]: 43: Hoare triple {5888#true} assume !(~i~0 < 100); {5888#true} is VALID [2018-11-23 12:24:16,648 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:24:16,648 INFO L273 TraceCheckUtils]: 45: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:24:16,648 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {5888#true} {5888#true} #70#return; {5888#true} is VALID [2018-11-23 12:24:16,648 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:24:16,648 INFO L256 TraceCheckUtils]: 48: Hoare triple {5888#true} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {5888#true} is VALID [2018-11-23 12:24:16,648 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:24:16,649 INFO L273 TraceCheckUtils]: 50: Hoare triple {5888#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:24:16,649 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:24:16,649 INFO L273 TraceCheckUtils]: 52: Hoare triple {5888#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:24:16,649 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:24:16,649 INFO L273 TraceCheckUtils]: 54: Hoare triple {5888#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:24:16,649 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:24:16,649 INFO L273 TraceCheckUtils]: 56: Hoare triple {5888#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:24:16,649 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:24:16,649 INFO L273 TraceCheckUtils]: 58: Hoare triple {5888#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5888#true} is VALID [2018-11-23 12:24:16,650 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:24:16,650 INFO L273 TraceCheckUtils]: 60: Hoare triple {5888#true} assume !(~i~0 < 100); {5888#true} is VALID [2018-11-23 12:24:16,650 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:24:16,650 INFO L273 TraceCheckUtils]: 62: Hoare triple {5888#true} assume true; {5888#true} is VALID [2018-11-23 12:24:16,650 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {5888#true} {5888#true} #72#return; {5888#true} is VALID [2018-11-23 12:24:16,650 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:24:16,651 INFO L273 TraceCheckUtils]: 65: Hoare triple {6098#(<= main_~i~2 0)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:16,651 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:24:16,652 INFO L273 TraceCheckUtils]: 67: Hoare triple {6105#(<= main_~i~2 1)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:16,652 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:24:16,652 INFO L273 TraceCheckUtils]: 69: Hoare triple {6112#(<= main_~i~2 2)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:16,653 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:24:16,653 INFO L273 TraceCheckUtils]: 71: Hoare triple {6119#(<= main_~i~2 3)} assume !(~i~2 < 99); {5889#false} is VALID [2018-11-23 12:24:16,654 INFO L273 TraceCheckUtils]: 72: Hoare triple {5889#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {5889#false} is VALID [2018-11-23 12:24:16,654 INFO L256 TraceCheckUtils]: 73: Hoare triple {5889#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {5889#false} is VALID [2018-11-23 12:24:16,654 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:24:16,654 INFO L273 TraceCheckUtils]: 75: Hoare triple {5889#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5889#false} is VALID [2018-11-23 12:24:16,654 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:24:16,655 INFO L273 TraceCheckUtils]: 77: Hoare triple {5889#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5889#false} is VALID [2018-11-23 12:24:16,655 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:24:16,655 INFO L273 TraceCheckUtils]: 79: Hoare triple {5889#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5889#false} is VALID [2018-11-23 12:24:16,655 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:24:16,655 INFO L273 TraceCheckUtils]: 81: Hoare triple {5889#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5889#false} is VALID [2018-11-23 12:24:16,656 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:24:16,656 INFO L273 TraceCheckUtils]: 83: Hoare triple {5889#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {5889#false} is VALID [2018-11-23 12:24:16,656 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:24:16,657 INFO L273 TraceCheckUtils]: 85: Hoare triple {5889#false} assume !(~i~0 < 100); {5889#false} is VALID [2018-11-23 12:24:16,657 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:24:16,657 INFO L273 TraceCheckUtils]: 87: Hoare triple {5889#false} assume true; {5889#false} is VALID [2018-11-23 12:24:16,657 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {5889#false} {5889#false} #74#return; {5889#false} is VALID [2018-11-23 12:24:16,658 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:24:16,658 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:24:16,658 INFO L273 TraceCheckUtils]: 91: Hoare triple {5889#false} assume !false; {5889#false} is VALID [2018-11-23 12:24:16,662 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:24:16,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:16,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6] total 19 [2018-11-23 12:24:16,683 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2018-11-23 12:24:16,683 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:16,683 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 12:24:16,751 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:24:16,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 12:24:16,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 12:24:16,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:24:16,752 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 19 states. [2018-11-23 12:24:17,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:17,316 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2018-11-23 12:24:17,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:24:17,316 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2018-11-23 12:24:17,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:17,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:24:17,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 87 transitions. [2018-11-23 12:24:17,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:24:17,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 87 transitions. [2018-11-23 12:24:17,319 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 87 transitions. [2018-11-23 12:24:17,744 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:24:17,746 INFO L225 Difference]: With dead ends: 101 [2018-11-23 12:24:17,746 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 12:24:17,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:24:17,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 12:24:17,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-11-23 12:24:17,771 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:17,771 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 67 states. [2018-11-23 12:24:17,771 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 67 states. [2018-11-23 12:24:17,772 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 67 states. [2018-11-23 12:24:17,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:17,773 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-23 12:24:17,774 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-23 12:24:17,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:17,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:17,774 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 69 states. [2018-11-23 12:24:17,774 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 69 states. [2018-11-23 12:24:17,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:17,776 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-23 12:24:17,776 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-23 12:24:17,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:17,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:17,777 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:17,777 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:17,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 12:24:17,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-11-23 12:24:17,779 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 92 [2018-11-23 12:24:17,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:17,779 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-11-23 12:24:17,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 12:24:17,780 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-23 12:24:17,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-23 12:24:17,780 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:17,781 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:24:17,781 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:17,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:17,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1508563187, now seen corresponding path program 13 times [2018-11-23 12:24:17,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:17,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:17,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:17,782 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:24:17,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:17,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:18,487 INFO L256 TraceCheckUtils]: 0: Hoare triple {6568#true} call ULTIMATE.init(); {6568#true} is VALID [2018-11-23 12:24:18,487 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:24:18,487 INFO L273 TraceCheckUtils]: 2: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:24:18,488 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6568#true} {6568#true} #66#return; {6568#true} is VALID [2018-11-23 12:24:18,488 INFO L256 TraceCheckUtils]: 4: Hoare triple {6568#true} call #t~ret13 := main(); {6568#true} is VALID [2018-11-23 12:24:18,489 INFO L273 TraceCheckUtils]: 5: Hoare triple {6568#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:24:18,489 INFO L273 TraceCheckUtils]: 6: Hoare triple {6570#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:24:18,490 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:24:18,490 INFO L273 TraceCheckUtils]: 8: Hoare triple {6571#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:24:18,491 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:24:18,491 INFO L273 TraceCheckUtils]: 10: Hoare triple {6572#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:24:18,492 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:24:18,492 INFO L273 TraceCheckUtils]: 12: Hoare triple {6573#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -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:24:18,493 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:24:18,494 INFO L273 TraceCheckUtils]: 14: Hoare triple {6574#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -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:24:18,494 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:24:18,495 INFO L273 TraceCheckUtils]: 16: Hoare triple {6575#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -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:24:18,496 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:24:18,496 INFO L273 TraceCheckUtils]: 18: Hoare triple {6576#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -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:24:18,497 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:24:18,498 INFO L273 TraceCheckUtils]: 20: Hoare triple {6577#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -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:24:18,499 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:24:18,499 INFO L273 TraceCheckUtils]: 22: Hoare triple {6578#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -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:24:18,500 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:24:18,501 INFO L273 TraceCheckUtils]: 24: Hoare triple {6579#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -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:24:18,501 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:24:18,502 INFO L273 TraceCheckUtils]: 26: Hoare triple {6580#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -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:24:18,503 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:24:18,503 INFO L273 TraceCheckUtils]: 28: Hoare triple {6581#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -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:24:18,504 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:24:18,505 INFO L273 TraceCheckUtils]: 30: Hoare triple {6582#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -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:24:18,506 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:24:18,506 INFO L273 TraceCheckUtils]: 32: Hoare triple {6583#(<= main_~i~1 13)} assume !(~i~1 < 100); {6569#false} is VALID [2018-11-23 12:24:18,507 INFO L256 TraceCheckUtils]: 33: Hoare triple {6569#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {6568#true} is VALID [2018-11-23 12:24:18,507 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:24:18,507 INFO L273 TraceCheckUtils]: 35: Hoare triple {6568#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:24:18,507 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:24:18,508 INFO L273 TraceCheckUtils]: 37: Hoare triple {6568#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:24:18,508 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:24:18,508 INFO L273 TraceCheckUtils]: 39: Hoare triple {6568#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:24:18,508 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:24:18,509 INFO L273 TraceCheckUtils]: 41: Hoare triple {6568#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:24:18,509 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:24:18,509 INFO L273 TraceCheckUtils]: 43: Hoare triple {6568#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:24:18,509 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:24:18,510 INFO L273 TraceCheckUtils]: 45: Hoare triple {6568#true} assume !(~i~0 < 100); {6568#true} is VALID [2018-11-23 12:24:18,510 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:24:18,510 INFO L273 TraceCheckUtils]: 47: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:24:18,510 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {6568#true} {6569#false} #70#return; {6569#false} is VALID [2018-11-23 12:24:18,510 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:24:18,510 INFO L256 TraceCheckUtils]: 50: Hoare triple {6569#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {6568#true} is VALID [2018-11-23 12:24:18,511 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:24:18,511 INFO L273 TraceCheckUtils]: 52: Hoare triple {6568#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:24:18,511 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:24:18,511 INFO L273 TraceCheckUtils]: 54: Hoare triple {6568#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:24:18,511 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:24:18,511 INFO L273 TraceCheckUtils]: 56: Hoare triple {6568#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:24:18,511 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:24:18,512 INFO L273 TraceCheckUtils]: 58: Hoare triple {6568#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:24:18,512 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:24:18,512 INFO L273 TraceCheckUtils]: 60: Hoare triple {6568#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:24:18,512 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:24:18,512 INFO L273 TraceCheckUtils]: 62: Hoare triple {6568#true} assume !(~i~0 < 100); {6568#true} is VALID [2018-11-23 12:24:18,512 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:24:18,513 INFO L273 TraceCheckUtils]: 64: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:24:18,513 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {6568#true} {6569#false} #72#return; {6569#false} is VALID [2018-11-23 12:24:18,513 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:24:18,513 INFO L273 TraceCheckUtils]: 67: Hoare triple {6569#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:18,513 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:24:18,513 INFO L273 TraceCheckUtils]: 69: Hoare triple {6569#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:18,513 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:24:18,514 INFO L273 TraceCheckUtils]: 71: Hoare triple {6569#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:18,514 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:24:18,514 INFO L273 TraceCheckUtils]: 73: Hoare triple {6569#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:18,514 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:24:18,514 INFO L273 TraceCheckUtils]: 75: Hoare triple {6569#false} assume !(~i~2 < 99); {6569#false} is VALID [2018-11-23 12:24:18,514 INFO L273 TraceCheckUtils]: 76: Hoare triple {6569#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {6569#false} is VALID [2018-11-23 12:24:18,514 INFO L256 TraceCheckUtils]: 77: Hoare triple {6569#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {6568#true} is VALID [2018-11-23 12:24:18,515 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:24:18,515 INFO L273 TraceCheckUtils]: 79: Hoare triple {6568#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:24:18,515 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:24:18,515 INFO L273 TraceCheckUtils]: 81: Hoare triple {6568#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:24:18,515 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:24:18,515 INFO L273 TraceCheckUtils]: 83: Hoare triple {6568#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:24:18,516 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:24:18,516 INFO L273 TraceCheckUtils]: 85: Hoare triple {6568#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:24:18,516 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:24:18,516 INFO L273 TraceCheckUtils]: 87: Hoare triple {6568#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6568#true} is VALID [2018-11-23 12:24:18,516 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:24:18,516 INFO L273 TraceCheckUtils]: 89: Hoare triple {6568#true} assume !(~i~0 < 100); {6568#true} is VALID [2018-11-23 12:24:18,517 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:24:18,517 INFO L273 TraceCheckUtils]: 91: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:24:18,517 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {6568#true} {6569#false} #74#return; {6569#false} is VALID [2018-11-23 12:24:18,517 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:24:18,517 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:24:18,517 INFO L273 TraceCheckUtils]: 95: Hoare triple {6569#false} assume !false; {6569#false} is VALID [2018-11-23 12:24:18,526 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:24:18,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:18,527 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:24:18,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:24:18,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:18,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:18,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:18,971 INFO L256 TraceCheckUtils]: 0: Hoare triple {6568#true} call ULTIMATE.init(); {6568#true} is VALID [2018-11-23 12:24:18,971 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:24:18,971 INFO L273 TraceCheckUtils]: 2: Hoare triple {6568#true} assume true; {6568#true} is VALID [2018-11-23 12:24:18,971 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6568#true} {6568#true} #66#return; {6568#true} is VALID [2018-11-23 12:24:18,971 INFO L256 TraceCheckUtils]: 4: Hoare triple {6568#true} call #t~ret13 := main(); {6568#true} is VALID [2018-11-23 12:24:18,972 INFO L273 TraceCheckUtils]: 5: Hoare triple {6568#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:24:18,972 INFO L273 TraceCheckUtils]: 6: Hoare triple {6602#(<= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:24:18,973 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:24:18,973 INFO L273 TraceCheckUtils]: 8: Hoare triple {6571#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:24:18,973 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:24:18,974 INFO L273 TraceCheckUtils]: 10: Hoare triple {6572#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:24:18,974 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:24:18,975 INFO L273 TraceCheckUtils]: 12: Hoare triple {6573#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -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:24:18,975 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:24:18,975 INFO L273 TraceCheckUtils]: 14: Hoare triple {6574#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -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:24:18,976 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:24:18,977 INFO L273 TraceCheckUtils]: 16: Hoare triple {6575#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -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:24:18,977 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:24:18,980 INFO L273 TraceCheckUtils]: 18: Hoare triple {6576#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -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:24:18,980 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:24:18,981 INFO L273 TraceCheckUtils]: 20: Hoare triple {6577#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -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:24:18,982 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:24:18,982 INFO L273 TraceCheckUtils]: 22: Hoare triple {6578#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -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:24:18,983 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:24:18,983 INFO L273 TraceCheckUtils]: 24: Hoare triple {6579#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -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:24:18,984 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:24:18,985 INFO L273 TraceCheckUtils]: 26: Hoare triple {6580#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -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:24:18,985 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:24:18,986 INFO L273 TraceCheckUtils]: 28: Hoare triple {6581#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -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:24:18,986 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:24:18,987 INFO L273 TraceCheckUtils]: 30: Hoare triple {6582#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -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:24:18,988 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:24:18,988 INFO L273 TraceCheckUtils]: 32: Hoare triple {6583#(<= main_~i~1 13)} assume !(~i~1 < 100); {6569#false} is VALID [2018-11-23 12:24:18,989 INFO L256 TraceCheckUtils]: 33: Hoare triple {6569#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {6569#false} is VALID [2018-11-23 12:24:18,989 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:24:18,989 INFO L273 TraceCheckUtils]: 35: Hoare triple {6569#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:24:18,989 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:24:18,989 INFO L273 TraceCheckUtils]: 37: Hoare triple {6569#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:24:18,990 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:24:18,990 INFO L273 TraceCheckUtils]: 39: Hoare triple {6569#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:24:18,990 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:24:18,990 INFO L273 TraceCheckUtils]: 41: Hoare triple {6569#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:24:18,990 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:24:18,990 INFO L273 TraceCheckUtils]: 43: Hoare triple {6569#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:24:18,991 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:24:18,991 INFO L273 TraceCheckUtils]: 45: Hoare triple {6569#false} assume !(~i~0 < 100); {6569#false} is VALID [2018-11-23 12:24:18,991 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:24:18,991 INFO L273 TraceCheckUtils]: 47: Hoare triple {6569#false} assume true; {6569#false} is VALID [2018-11-23 12:24:18,991 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {6569#false} {6569#false} #70#return; {6569#false} is VALID [2018-11-23 12:24:18,992 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:24:18,992 INFO L256 TraceCheckUtils]: 50: Hoare triple {6569#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {6569#false} is VALID [2018-11-23 12:24:18,992 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:24:18,992 INFO L273 TraceCheckUtils]: 52: Hoare triple {6569#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:24:18,992 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:24:18,993 INFO L273 TraceCheckUtils]: 54: Hoare triple {6569#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:24:18,993 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:24:18,993 INFO L273 TraceCheckUtils]: 56: Hoare triple {6569#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:24:18,993 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:24:18,993 INFO L273 TraceCheckUtils]: 58: Hoare triple {6569#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:24:18,993 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:24:18,993 INFO L273 TraceCheckUtils]: 60: Hoare triple {6569#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:24:18,993 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:24:18,993 INFO L273 TraceCheckUtils]: 62: Hoare triple {6569#false} assume !(~i~0 < 100); {6569#false} is VALID [2018-11-23 12:24:18,994 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:24:18,994 INFO L273 TraceCheckUtils]: 64: Hoare triple {6569#false} assume true; {6569#false} is VALID [2018-11-23 12:24:18,994 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {6569#false} {6569#false} #72#return; {6569#false} is VALID [2018-11-23 12:24:18,994 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:24:18,994 INFO L273 TraceCheckUtils]: 67: Hoare triple {6569#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:18,994 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:24:18,994 INFO L273 TraceCheckUtils]: 69: Hoare triple {6569#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:18,994 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:24:18,995 INFO L273 TraceCheckUtils]: 71: Hoare triple {6569#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:18,995 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:24:18,995 INFO L273 TraceCheckUtils]: 73: Hoare triple {6569#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:18,995 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:24:18,995 INFO L273 TraceCheckUtils]: 75: Hoare triple {6569#false} assume !(~i~2 < 99); {6569#false} is VALID [2018-11-23 12:24:18,995 INFO L273 TraceCheckUtils]: 76: Hoare triple {6569#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {6569#false} is VALID [2018-11-23 12:24:18,995 INFO L256 TraceCheckUtils]: 77: Hoare triple {6569#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {6569#false} is VALID [2018-11-23 12:24:18,995 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:24:18,995 INFO L273 TraceCheckUtils]: 79: Hoare triple {6569#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:24:18,996 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:24:18,996 INFO L273 TraceCheckUtils]: 81: Hoare triple {6569#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:24:18,996 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:24:18,996 INFO L273 TraceCheckUtils]: 83: Hoare triple {6569#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:24:18,996 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:24:18,996 INFO L273 TraceCheckUtils]: 85: Hoare triple {6569#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:24:18,996 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:24:18,996 INFO L273 TraceCheckUtils]: 87: Hoare triple {6569#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {6569#false} is VALID [2018-11-23 12:24:18,996 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:24:18,997 INFO L273 TraceCheckUtils]: 89: Hoare triple {6569#false} assume !(~i~0 < 100); {6569#false} is VALID [2018-11-23 12:24:18,997 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:24:18,997 INFO L273 TraceCheckUtils]: 91: Hoare triple {6569#false} assume true; {6569#false} is VALID [2018-11-23 12:24:18,997 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {6569#false} {6569#false} #74#return; {6569#false} is VALID [2018-11-23 12:24:18,997 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:24:18,997 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:24:18,997 INFO L273 TraceCheckUtils]: 95: Hoare triple {6569#false} assume !false; {6569#false} is VALID [2018-11-23 12:24:19,001 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:24:19,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:19,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 12:24:19,022 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2018-11-23 12:24:19,023 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:19,023 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:24:19,102 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:24:19,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:24:19,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:24:19,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:24:19,103 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 17 states. [2018-11-23 12:24:19,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:19,743 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2018-11-23 12:24:19,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:24:19,743 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2018-11-23 12:24:19,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:19,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:24:19,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 80 transitions. [2018-11-23 12:24:19,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:24:19,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 80 transitions. [2018-11-23 12:24:19,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 80 transitions. [2018-11-23 12:24:20,181 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:24:20,183 INFO L225 Difference]: With dead ends: 104 [2018-11-23 12:24:20,184 INFO L226 Difference]: Without dead ends: 70 [2018-11-23 12:24:20,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:24:20,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-23 12:24:20,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-11-23 12:24:20,213 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:20,213 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 69 states. [2018-11-23 12:24:20,213 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 69 states. [2018-11-23 12:24:20,213 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 69 states. [2018-11-23 12:24:20,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:20,218 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-11-23 12:24:20,218 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-11-23 12:24:20,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:20,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:20,219 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 70 states. [2018-11-23 12:24:20,219 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 70 states. [2018-11-23 12:24:20,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:20,220 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-11-23 12:24:20,220 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-11-23 12:24:20,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:20,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:20,221 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:20,221 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:20,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 12:24:20,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-11-23 12:24:20,223 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 96 [2018-11-23 12:24:20,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:20,223 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-11-23 12:24:20,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:24:20,224 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-23 12:24:20,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-23 12:24:20,225 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:20,225 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:24:20,225 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:20,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:20,225 INFO L82 PathProgramCache]: Analyzing trace with hash 737731925, now seen corresponding path program 14 times [2018-11-23 12:24:20,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:20,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:20,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:20,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:24:20,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:20,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:20,837 INFO L256 TraceCheckUtils]: 0: Hoare triple {7268#true} call ULTIMATE.init(); {7268#true} is VALID [2018-11-23 12:24:20,838 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:24:20,838 INFO L273 TraceCheckUtils]: 2: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:24:20,838 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7268#true} {7268#true} #66#return; {7268#true} is VALID [2018-11-23 12:24:20,838 INFO L256 TraceCheckUtils]: 4: Hoare triple {7268#true} call #t~ret13 := main(); {7268#true} is VALID [2018-11-23 12:24:20,839 INFO L273 TraceCheckUtils]: 5: Hoare triple {7268#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:24:20,839 INFO L273 TraceCheckUtils]: 6: Hoare triple {7270#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:24:20,840 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:24:20,840 INFO L273 TraceCheckUtils]: 8: Hoare triple {7271#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:24:20,841 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:24:20,841 INFO L273 TraceCheckUtils]: 10: Hoare triple {7272#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:24:20,842 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:24:20,842 INFO L273 TraceCheckUtils]: 12: Hoare triple {7273#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -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:24:20,843 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:24:20,843 INFO L273 TraceCheckUtils]: 14: Hoare triple {7274#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -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:24:20,844 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:24:20,844 INFO L273 TraceCheckUtils]: 16: Hoare triple {7275#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -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:24:20,845 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:24:20,846 INFO L273 TraceCheckUtils]: 18: Hoare triple {7276#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -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:24:20,846 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:24:20,847 INFO L273 TraceCheckUtils]: 20: Hoare triple {7277#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -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:24:20,847 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:24:20,848 INFO L273 TraceCheckUtils]: 22: Hoare triple {7278#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -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:24:20,849 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:24:20,849 INFO L273 TraceCheckUtils]: 24: Hoare triple {7279#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -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:24:20,850 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:24:20,850 INFO L273 TraceCheckUtils]: 26: Hoare triple {7280#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -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:24:20,851 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:24:20,852 INFO L273 TraceCheckUtils]: 28: Hoare triple {7281#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -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:24:20,852 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:24:20,853 INFO L273 TraceCheckUtils]: 30: Hoare triple {7282#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -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:24:20,854 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:24:20,854 INFO L273 TraceCheckUtils]: 32: Hoare triple {7283#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -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:24:20,855 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:24:20,855 INFO L273 TraceCheckUtils]: 34: Hoare triple {7284#(<= main_~i~1 14)} assume !(~i~1 < 100); {7269#false} is VALID [2018-11-23 12:24:20,856 INFO L256 TraceCheckUtils]: 35: Hoare triple {7269#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {7268#true} is VALID [2018-11-23 12:24:20,856 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:24:20,856 INFO L273 TraceCheckUtils]: 37: Hoare triple {7268#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:24:20,856 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:24:20,856 INFO L273 TraceCheckUtils]: 39: Hoare triple {7268#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:24:20,857 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:24:20,857 INFO L273 TraceCheckUtils]: 41: Hoare triple {7268#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:24:20,857 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:24:20,857 INFO L273 TraceCheckUtils]: 43: Hoare triple {7268#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:24:20,857 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:24:20,858 INFO L273 TraceCheckUtils]: 45: Hoare triple {7268#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:24:20,858 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:24:20,858 INFO L273 TraceCheckUtils]: 47: Hoare triple {7268#true} assume !(~i~0 < 100); {7268#true} is VALID [2018-11-23 12:24:20,858 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:24:20,858 INFO L273 TraceCheckUtils]: 49: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:24:20,858 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {7268#true} {7269#false} #70#return; {7269#false} is VALID [2018-11-23 12:24:20,859 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:24:20,859 INFO L256 TraceCheckUtils]: 52: Hoare triple {7269#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {7268#true} is VALID [2018-11-23 12:24:20,859 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:24:20,859 INFO L273 TraceCheckUtils]: 54: Hoare triple {7268#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:24:20,859 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:24:20,860 INFO L273 TraceCheckUtils]: 56: Hoare triple {7268#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:24:20,860 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:24:20,860 INFO L273 TraceCheckUtils]: 58: Hoare triple {7268#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:24:20,860 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:24:20,860 INFO L273 TraceCheckUtils]: 60: Hoare triple {7268#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:24:20,860 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:24:20,860 INFO L273 TraceCheckUtils]: 62: Hoare triple {7268#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:24:20,861 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:24:20,861 INFO L273 TraceCheckUtils]: 64: Hoare triple {7268#true} assume !(~i~0 < 100); {7268#true} is VALID [2018-11-23 12:24:20,861 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:24:20,861 INFO L273 TraceCheckUtils]: 66: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:24:20,861 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {7268#true} {7269#false} #72#return; {7269#false} is VALID [2018-11-23 12:24:20,861 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:24:20,862 INFO L273 TraceCheckUtils]: 69: Hoare triple {7269#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:20,862 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:24:20,862 INFO L273 TraceCheckUtils]: 71: Hoare triple {7269#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:20,862 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:24:20,862 INFO L273 TraceCheckUtils]: 73: Hoare triple {7269#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:20,863 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:24:20,863 INFO L273 TraceCheckUtils]: 75: Hoare triple {7269#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:20,863 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:24:20,863 INFO L273 TraceCheckUtils]: 77: Hoare triple {7269#false} assume !(~i~2 < 99); {7269#false} is VALID [2018-11-23 12:24:20,863 INFO L273 TraceCheckUtils]: 78: Hoare triple {7269#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {7269#false} is VALID [2018-11-23 12:24:20,863 INFO L256 TraceCheckUtils]: 79: Hoare triple {7269#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {7268#true} is VALID [2018-11-23 12:24:20,863 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:24:20,864 INFO L273 TraceCheckUtils]: 81: Hoare triple {7268#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:24:20,864 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:24:20,864 INFO L273 TraceCheckUtils]: 83: Hoare triple {7268#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:24:20,864 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:24:20,864 INFO L273 TraceCheckUtils]: 85: Hoare triple {7268#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:24:20,864 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:24:20,865 INFO L273 TraceCheckUtils]: 87: Hoare triple {7268#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:24:20,865 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:24:20,865 INFO L273 TraceCheckUtils]: 89: Hoare triple {7268#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7268#true} is VALID [2018-11-23 12:24:20,865 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:24:20,865 INFO L273 TraceCheckUtils]: 91: Hoare triple {7268#true} assume !(~i~0 < 100); {7268#true} is VALID [2018-11-23 12:24:20,865 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:24:20,866 INFO L273 TraceCheckUtils]: 93: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:24:20,866 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {7268#true} {7269#false} #74#return; {7269#false} is VALID [2018-11-23 12:24:20,866 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:24:20,866 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:24:20,866 INFO L273 TraceCheckUtils]: 97: Hoare triple {7269#false} assume !false; {7269#false} is VALID [2018-11-23 12:24:20,871 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:24:20,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:20,871 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:24:20,880 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:24:20,923 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:24:20,924 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:24:20,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:20,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:21,139 INFO L256 TraceCheckUtils]: 0: Hoare triple {7268#true} call ULTIMATE.init(); {7268#true} is VALID [2018-11-23 12:24:21,139 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:24:21,139 INFO L273 TraceCheckUtils]: 2: Hoare triple {7268#true} assume true; {7268#true} is VALID [2018-11-23 12:24:21,140 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7268#true} {7268#true} #66#return; {7268#true} is VALID [2018-11-23 12:24:21,140 INFO L256 TraceCheckUtils]: 4: Hoare triple {7268#true} call #t~ret13 := main(); {7268#true} is VALID [2018-11-23 12:24:21,140 INFO L273 TraceCheckUtils]: 5: Hoare triple {7268#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:24:21,141 INFO L273 TraceCheckUtils]: 6: Hoare triple {7303#(<= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:24:21,142 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:24:21,142 INFO L273 TraceCheckUtils]: 8: Hoare triple {7271#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:24:21,142 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:24:21,143 INFO L273 TraceCheckUtils]: 10: Hoare triple {7272#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:24:21,143 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:24:21,144 INFO L273 TraceCheckUtils]: 12: Hoare triple {7273#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -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:24:21,144 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:24:21,145 INFO L273 TraceCheckUtils]: 14: Hoare triple {7274#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -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:24:21,146 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:24:21,146 INFO L273 TraceCheckUtils]: 16: Hoare triple {7275#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -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:24:21,147 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:24:21,147 INFO L273 TraceCheckUtils]: 18: Hoare triple {7276#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -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:24:21,148 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:24:21,148 INFO L273 TraceCheckUtils]: 20: Hoare triple {7277#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -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:24:21,149 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:24:21,150 INFO L273 TraceCheckUtils]: 22: Hoare triple {7278#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -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:24:21,150 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:24:21,151 INFO L273 TraceCheckUtils]: 24: Hoare triple {7279#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -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:24:21,152 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:24:21,152 INFO L273 TraceCheckUtils]: 26: Hoare triple {7280#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -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:24:21,153 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:24:21,153 INFO L273 TraceCheckUtils]: 28: Hoare triple {7281#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -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:24:21,154 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:24:21,155 INFO L273 TraceCheckUtils]: 30: Hoare triple {7282#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -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:24:21,155 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:24:21,156 INFO L273 TraceCheckUtils]: 32: Hoare triple {7283#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -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:24:21,156 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:24:21,157 INFO L273 TraceCheckUtils]: 34: Hoare triple {7284#(<= main_~i~1 14)} assume !(~i~1 < 100); {7269#false} is VALID [2018-11-23 12:24:21,157 INFO L256 TraceCheckUtils]: 35: Hoare triple {7269#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {7269#false} is VALID [2018-11-23 12:24:21,158 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:24:21,158 INFO L273 TraceCheckUtils]: 37: Hoare triple {7269#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:24:21,158 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:24:21,158 INFO L273 TraceCheckUtils]: 39: Hoare triple {7269#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:24:21,158 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:24:21,159 INFO L273 TraceCheckUtils]: 41: Hoare triple {7269#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:24:21,159 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:24:21,159 INFO L273 TraceCheckUtils]: 43: Hoare triple {7269#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:24:21,159 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:24:21,159 INFO L273 TraceCheckUtils]: 45: Hoare triple {7269#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:24:21,159 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:24:21,160 INFO L273 TraceCheckUtils]: 47: Hoare triple {7269#false} assume !(~i~0 < 100); {7269#false} is VALID [2018-11-23 12:24:21,160 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:24:21,160 INFO L273 TraceCheckUtils]: 49: Hoare triple {7269#false} assume true; {7269#false} is VALID [2018-11-23 12:24:21,160 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {7269#false} {7269#false} #70#return; {7269#false} is VALID [2018-11-23 12:24:21,160 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:24:21,160 INFO L256 TraceCheckUtils]: 52: Hoare triple {7269#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {7269#false} is VALID [2018-11-23 12:24:21,160 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:24:21,160 INFO L273 TraceCheckUtils]: 54: Hoare triple {7269#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:24:21,161 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:24:21,161 INFO L273 TraceCheckUtils]: 56: Hoare triple {7269#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:24:21,161 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:24:21,161 INFO L273 TraceCheckUtils]: 58: Hoare triple {7269#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:24:21,161 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:24:21,161 INFO L273 TraceCheckUtils]: 60: Hoare triple {7269#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:24:21,161 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:24:21,161 INFO L273 TraceCheckUtils]: 62: Hoare triple {7269#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:24:21,161 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:24:21,162 INFO L273 TraceCheckUtils]: 64: Hoare triple {7269#false} assume !(~i~0 < 100); {7269#false} is VALID [2018-11-23 12:24:21,162 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:24:21,162 INFO L273 TraceCheckUtils]: 66: Hoare triple {7269#false} assume true; {7269#false} is VALID [2018-11-23 12:24:21,162 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {7269#false} {7269#false} #72#return; {7269#false} is VALID [2018-11-23 12:24:21,162 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:24:21,162 INFO L273 TraceCheckUtils]: 69: Hoare triple {7269#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:21,162 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:24:21,162 INFO L273 TraceCheckUtils]: 71: Hoare triple {7269#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:21,163 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:24:21,163 INFO L273 TraceCheckUtils]: 73: Hoare triple {7269#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:21,163 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:24:21,163 INFO L273 TraceCheckUtils]: 75: Hoare triple {7269#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:21,163 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:24:21,163 INFO L273 TraceCheckUtils]: 77: Hoare triple {7269#false} assume !(~i~2 < 99); {7269#false} is VALID [2018-11-23 12:24:21,163 INFO L273 TraceCheckUtils]: 78: Hoare triple {7269#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {7269#false} is VALID [2018-11-23 12:24:21,163 INFO L256 TraceCheckUtils]: 79: Hoare triple {7269#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {7269#false} is VALID [2018-11-23 12:24:21,163 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:24:21,164 INFO L273 TraceCheckUtils]: 81: Hoare triple {7269#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:24:21,164 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:24:21,164 INFO L273 TraceCheckUtils]: 83: Hoare triple {7269#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:24:21,164 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:24:21,164 INFO L273 TraceCheckUtils]: 85: Hoare triple {7269#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:24:21,164 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:24:21,164 INFO L273 TraceCheckUtils]: 87: Hoare triple {7269#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:24:21,164 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:24:21,165 INFO L273 TraceCheckUtils]: 89: Hoare triple {7269#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7269#false} is VALID [2018-11-23 12:24:21,165 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:24:21,165 INFO L273 TraceCheckUtils]: 91: Hoare triple {7269#false} assume !(~i~0 < 100); {7269#false} is VALID [2018-11-23 12:24:21,165 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:24:21,165 INFO L273 TraceCheckUtils]: 93: Hoare triple {7269#false} assume true; {7269#false} is VALID [2018-11-23 12:24:21,165 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {7269#false} {7269#false} #74#return; {7269#false} is VALID [2018-11-23 12:24:21,165 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:24:21,165 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:24:21,165 INFO L273 TraceCheckUtils]: 97: Hoare triple {7269#false} assume !false; {7269#false} is VALID [2018-11-23 12:24:21,170 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:24:21,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:21,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 12:24:21,189 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 98 [2018-11-23 12:24:21,190 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:21,190 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 12:24:21,251 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:24:21,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 12:24:21,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 12:24:21,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:24:21,252 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 18 states. [2018-11-23 12:24:21,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:21,803 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2018-11-23 12:24:21,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:24:21,803 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 98 [2018-11-23 12:24:21,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:21,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:24:21,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions. [2018-11-23 12:24:21,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:24:21,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions. [2018-11-23 12:24:21,807 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 82 transitions. [2018-11-23 12:24:21,898 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:24:21,900 INFO L225 Difference]: With dead ends: 106 [2018-11-23 12:24:21,900 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 12:24:21,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:24:21,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 12:24:21,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2018-11-23 12:24:21,929 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:21,929 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 71 states. [2018-11-23 12:24:21,929 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 71 states. [2018-11-23 12:24:21,930 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 71 states. [2018-11-23 12:24:21,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:21,932 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-11-23 12:24:21,932 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-11-23 12:24:21,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:21,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:21,932 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 72 states. [2018-11-23 12:24:21,933 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 72 states. [2018-11-23 12:24:21,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:21,934 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-11-23 12:24:21,934 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-11-23 12:24:21,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:21,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:21,935 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:21,935 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:21,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-23 12:24:21,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-11-23 12:24:21,937 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 98 [2018-11-23 12:24:21,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:21,937 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-11-23 12:24:21,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 12:24:21,937 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-11-23 12:24:21,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-23 12:24:21,938 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:21,938 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:24:21,938 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:21,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:21,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1296735945, now seen corresponding path program 15 times [2018-11-23 12:24:21,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:21,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:21,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:21,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:24:21,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:21,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:22,670 INFO L256 TraceCheckUtils]: 0: Hoare triple {7985#true} call ULTIMATE.init(); {7985#true} is VALID [2018-11-23 12:24:22,671 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:24:22,671 INFO L273 TraceCheckUtils]: 2: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:24:22,671 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7985#true} {7985#true} #66#return; {7985#true} is VALID [2018-11-23 12:24:22,671 INFO L256 TraceCheckUtils]: 4: Hoare triple {7985#true} call #t~ret13 := main(); {7985#true} is VALID [2018-11-23 12:24:22,672 INFO L273 TraceCheckUtils]: 5: Hoare triple {7985#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:24:22,672 INFO L273 TraceCheckUtils]: 6: Hoare triple {7987#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:24:22,673 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:24:22,674 INFO L273 TraceCheckUtils]: 8: Hoare triple {7988#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:24:22,674 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:24:22,675 INFO L273 TraceCheckUtils]: 10: Hoare triple {7989#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:24:22,676 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:24:22,676 INFO L273 TraceCheckUtils]: 12: Hoare triple {7990#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -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:24:22,677 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:24:22,677 INFO L273 TraceCheckUtils]: 14: Hoare triple {7991#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -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:24:22,678 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:24:22,679 INFO L273 TraceCheckUtils]: 16: Hoare triple {7992#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -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:24:22,679 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:24:22,680 INFO L273 TraceCheckUtils]: 18: Hoare triple {7993#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -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:24:22,680 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:24:22,681 INFO L273 TraceCheckUtils]: 20: Hoare triple {7994#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -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:24:22,682 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:24:22,682 INFO L273 TraceCheckUtils]: 22: Hoare triple {7995#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -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:24:22,683 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:24:22,683 INFO L273 TraceCheckUtils]: 24: Hoare triple {7996#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -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:24:22,684 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:24:22,685 INFO L273 TraceCheckUtils]: 26: Hoare triple {7997#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -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:24:22,685 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:24:22,686 INFO L273 TraceCheckUtils]: 28: Hoare triple {7998#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -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:24:22,687 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:24:22,687 INFO L273 TraceCheckUtils]: 30: Hoare triple {7999#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -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:24:22,688 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:24:22,688 INFO L273 TraceCheckUtils]: 32: Hoare triple {8000#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -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:24:22,689 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:24:22,689 INFO L273 TraceCheckUtils]: 34: Hoare triple {8001#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -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:24:22,690 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:24:22,691 INFO L273 TraceCheckUtils]: 36: Hoare triple {8002#(<= main_~i~1 15)} assume !(~i~1 < 100); {7986#false} is VALID [2018-11-23 12:24:22,691 INFO L256 TraceCheckUtils]: 37: Hoare triple {7986#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {7985#true} is VALID [2018-11-23 12:24:22,691 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:24:22,691 INFO L273 TraceCheckUtils]: 39: Hoare triple {7985#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:24:22,692 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:24:22,692 INFO L273 TraceCheckUtils]: 41: Hoare triple {7985#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:24:22,692 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:24:22,692 INFO L273 TraceCheckUtils]: 43: Hoare triple {7985#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:24:22,692 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:24:22,693 INFO L273 TraceCheckUtils]: 45: Hoare triple {7985#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:24:22,693 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:24:22,693 INFO L273 TraceCheckUtils]: 47: Hoare triple {7985#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:24:22,693 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:24:22,693 INFO L273 TraceCheckUtils]: 49: Hoare triple {7985#true} assume !(~i~0 < 100); {7985#true} is VALID [2018-11-23 12:24:22,693 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:24:22,694 INFO L273 TraceCheckUtils]: 51: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:24:22,694 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {7985#true} {7986#false} #70#return; {7986#false} is VALID [2018-11-23 12:24:22,694 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:24:22,694 INFO L256 TraceCheckUtils]: 54: Hoare triple {7986#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {7985#true} is VALID [2018-11-23 12:24:22,694 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:24:22,695 INFO L273 TraceCheckUtils]: 56: Hoare triple {7985#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:24:22,695 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:24:22,695 INFO L273 TraceCheckUtils]: 58: Hoare triple {7985#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:24:22,695 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:24:22,695 INFO L273 TraceCheckUtils]: 60: Hoare triple {7985#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:24:22,696 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:24:22,696 INFO L273 TraceCheckUtils]: 62: Hoare triple {7985#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:24:22,696 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:24:22,696 INFO L273 TraceCheckUtils]: 64: Hoare triple {7985#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:24:22,696 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:24:22,696 INFO L273 TraceCheckUtils]: 66: Hoare triple {7985#true} assume !(~i~0 < 100); {7985#true} is VALID [2018-11-23 12:24:22,696 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:24:22,696 INFO L273 TraceCheckUtils]: 68: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:24:22,696 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {7985#true} {7986#false} #72#return; {7986#false} is VALID [2018-11-23 12:24:22,697 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:24:22,697 INFO L273 TraceCheckUtils]: 71: Hoare triple {7986#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:22,697 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:24:22,697 INFO L273 TraceCheckUtils]: 73: Hoare triple {7986#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:22,697 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:24:22,697 INFO L273 TraceCheckUtils]: 75: Hoare triple {7986#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:22,697 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:24:22,697 INFO L273 TraceCheckUtils]: 77: Hoare triple {7986#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:22,697 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:24:22,698 INFO L273 TraceCheckUtils]: 79: Hoare triple {7986#false} assume !(~i~2 < 99); {7986#false} is VALID [2018-11-23 12:24:22,698 INFO L273 TraceCheckUtils]: 80: Hoare triple {7986#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {7986#false} is VALID [2018-11-23 12:24:22,698 INFO L256 TraceCheckUtils]: 81: Hoare triple {7986#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {7985#true} is VALID [2018-11-23 12:24:22,698 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:24:22,698 INFO L273 TraceCheckUtils]: 83: Hoare triple {7985#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:24:22,698 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:24:22,698 INFO L273 TraceCheckUtils]: 85: Hoare triple {7985#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:24:22,698 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:24:22,699 INFO L273 TraceCheckUtils]: 87: Hoare triple {7985#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:24:22,699 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:24:22,699 INFO L273 TraceCheckUtils]: 89: Hoare triple {7985#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:24:22,699 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:24:22,699 INFO L273 TraceCheckUtils]: 91: Hoare triple {7985#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:24:22,699 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:24:22,699 INFO L273 TraceCheckUtils]: 93: Hoare triple {7985#true} assume !(~i~0 < 100); {7985#true} is VALID [2018-11-23 12:24:22,699 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:24:22,699 INFO L273 TraceCheckUtils]: 95: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:24:22,700 INFO L268 TraceCheckUtils]: 96: Hoare quadruple {7985#true} {7986#false} #74#return; {7986#false} is VALID [2018-11-23 12:24:22,700 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:24:22,700 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:24:22,700 INFO L273 TraceCheckUtils]: 99: Hoare triple {7986#false} assume !false; {7986#false} is VALID [2018-11-23 12:24:22,704 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:24:22,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:22,705 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:24:22,713 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:24:22,790 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 12:24:22,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:24:22,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:22,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:22,974 INFO L256 TraceCheckUtils]: 0: Hoare triple {7985#true} call ULTIMATE.init(); {7985#true} is VALID [2018-11-23 12:24:22,974 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:24:22,974 INFO L273 TraceCheckUtils]: 2: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:24:22,974 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7985#true} {7985#true} #66#return; {7985#true} is VALID [2018-11-23 12:24:22,975 INFO L256 TraceCheckUtils]: 4: Hoare triple {7985#true} call #t~ret13 := main(); {7985#true} is VALID [2018-11-23 12:24:22,975 INFO L273 TraceCheckUtils]: 5: Hoare triple {7985#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {7985#true} is VALID [2018-11-23 12:24:22,975 INFO L273 TraceCheckUtils]: 6: Hoare triple {7985#true} assume !!(~i~1 < 100);assume -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:24:22,975 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:24:22,975 INFO L273 TraceCheckUtils]: 8: Hoare triple {7985#true} assume !!(~i~1 < 100);assume -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:24:22,976 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:24:22,976 INFO L273 TraceCheckUtils]: 10: Hoare triple {7985#true} assume !!(~i~1 < 100);assume -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:24:22,976 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:24:22,976 INFO L273 TraceCheckUtils]: 12: Hoare triple {7985#true} assume !!(~i~1 < 100);assume -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:24:22,976 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:24:22,976 INFO L273 TraceCheckUtils]: 14: Hoare triple {7985#true} assume !!(~i~1 < 100);assume -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:24:22,977 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:24:22,977 INFO L273 TraceCheckUtils]: 16: Hoare triple {7985#true} assume !!(~i~1 < 100);assume -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:24:22,977 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:24:22,977 INFO L273 TraceCheckUtils]: 18: Hoare triple {7985#true} assume !!(~i~1 < 100);assume -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:24:22,977 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:24:22,977 INFO L273 TraceCheckUtils]: 20: Hoare triple {7985#true} assume !!(~i~1 < 100);assume -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:24:22,977 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:24:22,978 INFO L273 TraceCheckUtils]: 22: Hoare triple {7985#true} assume !!(~i~1 < 100);assume -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:24:22,978 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:24:22,978 INFO L273 TraceCheckUtils]: 24: Hoare triple {7985#true} assume !!(~i~1 < 100);assume -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:24:22,978 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:24:22,978 INFO L273 TraceCheckUtils]: 26: Hoare triple {7985#true} assume !!(~i~1 < 100);assume -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:24:22,978 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:24:22,978 INFO L273 TraceCheckUtils]: 28: Hoare triple {7985#true} assume !!(~i~1 < 100);assume -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:24:22,978 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:24:22,979 INFO L273 TraceCheckUtils]: 30: Hoare triple {7985#true} assume !!(~i~1 < 100);assume -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:24:22,979 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:24:22,979 INFO L273 TraceCheckUtils]: 32: Hoare triple {7985#true} assume !!(~i~1 < 100);assume -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:24:22,979 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:24:22,979 INFO L273 TraceCheckUtils]: 34: Hoare triple {7985#true} assume !!(~i~1 < 100);assume -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:24:22,979 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:24:22,979 INFO L273 TraceCheckUtils]: 36: Hoare triple {7985#true} assume !(~i~1 < 100); {7985#true} is VALID [2018-11-23 12:24:22,979 INFO L256 TraceCheckUtils]: 37: Hoare triple {7985#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {7985#true} is VALID [2018-11-23 12:24:22,979 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:24:22,980 INFO L273 TraceCheckUtils]: 39: Hoare triple {7985#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:24:22,980 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:24:22,980 INFO L273 TraceCheckUtils]: 41: Hoare triple {7985#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:24:22,980 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:24:22,980 INFO L273 TraceCheckUtils]: 43: Hoare triple {7985#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:24:22,980 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:24:22,980 INFO L273 TraceCheckUtils]: 45: Hoare triple {7985#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:24:22,980 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:24:22,981 INFO L273 TraceCheckUtils]: 47: Hoare triple {7985#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:24:22,981 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:24:22,981 INFO L273 TraceCheckUtils]: 49: Hoare triple {7985#true} assume !(~i~0 < 100); {7985#true} is VALID [2018-11-23 12:24:22,981 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:24:22,981 INFO L273 TraceCheckUtils]: 51: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:24:22,981 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {7985#true} {7985#true} #70#return; {7985#true} is VALID [2018-11-23 12:24:22,981 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:24:22,981 INFO L256 TraceCheckUtils]: 54: Hoare triple {7985#true} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {7985#true} is VALID [2018-11-23 12:24:22,981 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:24:22,982 INFO L273 TraceCheckUtils]: 56: Hoare triple {7985#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:24:22,982 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:24:22,982 INFO L273 TraceCheckUtils]: 58: Hoare triple {7985#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:24:22,982 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:24:22,982 INFO L273 TraceCheckUtils]: 60: Hoare triple {7985#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:24:22,982 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:24:22,982 INFO L273 TraceCheckUtils]: 62: Hoare triple {7985#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:24:22,982 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:24:22,983 INFO L273 TraceCheckUtils]: 64: Hoare triple {7985#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {7985#true} is VALID [2018-11-23 12:24:22,983 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:24:22,983 INFO L273 TraceCheckUtils]: 66: Hoare triple {7985#true} assume !(~i~0 < 100); {7985#true} is VALID [2018-11-23 12:24:22,983 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:24:22,983 INFO L273 TraceCheckUtils]: 68: Hoare triple {7985#true} assume true; {7985#true} is VALID [2018-11-23 12:24:22,983 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {7985#true} {7985#true} #72#return; {7985#true} is VALID [2018-11-23 12:24:22,983 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:24:22,983 INFO L273 TraceCheckUtils]: 71: Hoare triple {7985#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:22,983 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:24:22,984 INFO L273 TraceCheckUtils]: 73: Hoare triple {7985#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:22,984 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:24:22,984 INFO L273 TraceCheckUtils]: 75: Hoare triple {7985#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:22,984 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:24:22,984 INFO L273 TraceCheckUtils]: 77: Hoare triple {7985#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:22,984 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:24:22,984 INFO L273 TraceCheckUtils]: 79: Hoare triple {7985#true} assume !(~i~2 < 99); {7985#true} is VALID [2018-11-23 12:24:22,984 INFO L273 TraceCheckUtils]: 80: Hoare triple {7985#true} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {7985#true} is VALID [2018-11-23 12:24:22,985 INFO L256 TraceCheckUtils]: 81: Hoare triple {7985#true} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {7985#true} is VALID [2018-11-23 12:24:22,985 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#(<= bAnd_~i~0 1)} is VALID [2018-11-23 12:24:22,985 INFO L273 TraceCheckUtils]: 83: Hoare triple {8252#(<= bAnd_~i~0 1)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8252#(<= bAnd_~i~0 1)} is VALID [2018-11-23 12:24:22,986 INFO L273 TraceCheckUtils]: 84: Hoare triple {8252#(<= bAnd_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8259#(<= bAnd_~i~0 2)} is VALID [2018-11-23 12:24:22,986 INFO L273 TraceCheckUtils]: 85: Hoare triple {8259#(<= bAnd_~i~0 2)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8259#(<= bAnd_~i~0 2)} is VALID [2018-11-23 12:24:22,987 INFO L273 TraceCheckUtils]: 86: Hoare triple {8259#(<= bAnd_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8266#(<= bAnd_~i~0 3)} is VALID [2018-11-23 12:24:22,987 INFO L273 TraceCheckUtils]: 87: Hoare triple {8266#(<= bAnd_~i~0 3)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8266#(<= bAnd_~i~0 3)} is VALID [2018-11-23 12:24:22,987 INFO L273 TraceCheckUtils]: 88: Hoare triple {8266#(<= bAnd_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8273#(<= bAnd_~i~0 4)} is VALID [2018-11-23 12:24:22,988 INFO L273 TraceCheckUtils]: 89: Hoare triple {8273#(<= bAnd_~i~0 4)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8273#(<= bAnd_~i~0 4)} is VALID [2018-11-23 12:24:22,988 INFO L273 TraceCheckUtils]: 90: Hoare triple {8273#(<= bAnd_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8280#(<= bAnd_~i~0 5)} is VALID [2018-11-23 12:24:22,989 INFO L273 TraceCheckUtils]: 91: Hoare triple {8280#(<= bAnd_~i~0 5)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8280#(<= bAnd_~i~0 5)} is VALID [2018-11-23 12:24:22,989 INFO L273 TraceCheckUtils]: 92: Hoare triple {8280#(<= bAnd_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8287#(<= bAnd_~i~0 6)} is VALID [2018-11-23 12:24:22,990 INFO L273 TraceCheckUtils]: 93: Hoare triple {8287#(<= bAnd_~i~0 6)} assume !(~i~0 < 100); {7986#false} is VALID [2018-11-23 12:24:22,990 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:24:22,990 INFO L273 TraceCheckUtils]: 95: Hoare triple {7986#false} assume true; {7986#false} is VALID [2018-11-23 12:24:22,991 INFO L268 TraceCheckUtils]: 96: Hoare quadruple {7986#false} {7985#true} #74#return; {7986#false} is VALID [2018-11-23 12:24:22,991 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:24:22,991 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:24:22,991 INFO L273 TraceCheckUtils]: 99: Hoare triple {7986#false} assume !false; {7986#false} is VALID [2018-11-23 12:24:22,996 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:24:23,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:23,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8] total 24 [2018-11-23 12:24:23,016 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 100 [2018-11-23 12:24:23,016 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:23,016 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 12:24:23,131 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:24:23,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 12:24:23,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 12:24:23,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:24:23,132 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 24 states. [2018-11-23 12:24:23,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:23,533 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2018-11-23 12:24:23,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 12:24:23,533 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 100 [2018-11-23 12:24:23,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:23,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:24:23,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 100 transitions. [2018-11-23 12:24:23,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:24:23,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 100 transitions. [2018-11-23 12:24:23,536 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 100 transitions. [2018-11-23 12:24:23,714 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:24:23,716 INFO L225 Difference]: With dead ends: 111 [2018-11-23 12:24:23,716 INFO L226 Difference]: Without dead ends: 77 [2018-11-23 12:24:23,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:24:23,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-23 12:24:23,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-11-23 12:24:23,764 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:23,765 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 75 states. [2018-11-23 12:24:23,765 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 75 states. [2018-11-23 12:24:23,765 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 75 states. [2018-11-23 12:24:23,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:23,767 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-11-23 12:24:23,767 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-23 12:24:23,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:23,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:23,768 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 77 states. [2018-11-23 12:24:23,768 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 77 states. [2018-11-23 12:24:23,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:23,769 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-11-23 12:24:23,769 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-23 12:24:23,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:23,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:23,770 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:23,770 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:23,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 12:24:23,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-11-23 12:24:23,772 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 100 [2018-11-23 12:24:23,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:23,772 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-11-23 12:24:23,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 12:24:23,772 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-11-23 12:24:23,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-23 12:24:23,773 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:23,774 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:24:23,774 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:23,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:23,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1648969321, now seen corresponding path program 16 times [2018-11-23 12:24:23,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:23,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:23,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:23,775 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:24:23,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:23,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:25,005 INFO L256 TraceCheckUtils]: 0: Hoare triple {8737#true} call ULTIMATE.init(); {8737#true} is VALID [2018-11-23 12:24:25,005 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:24:25,005 INFO L273 TraceCheckUtils]: 2: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:24:25,006 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8737#true} {8737#true} #66#return; {8737#true} is VALID [2018-11-23 12:24:25,006 INFO L256 TraceCheckUtils]: 4: Hoare triple {8737#true} call #t~ret13 := main(); {8737#true} is VALID [2018-11-23 12:24:25,006 INFO L273 TraceCheckUtils]: 5: Hoare triple {8737#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:24:25,006 INFO L273 TraceCheckUtils]: 6: Hoare triple {8739#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:24:25,007 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:24:25,007 INFO L273 TraceCheckUtils]: 8: Hoare triple {8740#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:24:25,008 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:24:25,008 INFO L273 TraceCheckUtils]: 10: Hoare triple {8741#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:24:25,008 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:24:25,009 INFO L273 TraceCheckUtils]: 12: Hoare triple {8742#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -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:24:25,009 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:24:25,010 INFO L273 TraceCheckUtils]: 14: Hoare triple {8743#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -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:24:25,011 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:24:25,011 INFO L273 TraceCheckUtils]: 16: Hoare triple {8744#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -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:24:25,012 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:24:25,012 INFO L273 TraceCheckUtils]: 18: Hoare triple {8745#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -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:24:25,013 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:24:25,014 INFO L273 TraceCheckUtils]: 20: Hoare triple {8746#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -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:24:25,014 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:24:25,015 INFO L273 TraceCheckUtils]: 22: Hoare triple {8747#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -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:24:25,015 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:24:25,016 INFO L273 TraceCheckUtils]: 24: Hoare triple {8748#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -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:24:25,017 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:24:25,017 INFO L273 TraceCheckUtils]: 26: Hoare triple {8749#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -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:24:25,018 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:24:25,018 INFO L273 TraceCheckUtils]: 28: Hoare triple {8750#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -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:24:25,019 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:24:25,020 INFO L273 TraceCheckUtils]: 30: Hoare triple {8751#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -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:24:25,020 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:24:25,021 INFO L273 TraceCheckUtils]: 32: Hoare triple {8752#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -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:24:25,021 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:24:25,022 INFO L273 TraceCheckUtils]: 34: Hoare triple {8753#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -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:24:25,023 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:24:25,023 INFO L273 TraceCheckUtils]: 36: Hoare triple {8754#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -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:24:25,024 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:24:25,024 INFO L273 TraceCheckUtils]: 38: Hoare triple {8755#(<= main_~i~1 16)} assume !(~i~1 < 100); {8738#false} is VALID [2018-11-23 12:24:25,025 INFO L256 TraceCheckUtils]: 39: Hoare triple {8738#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {8737#true} is VALID [2018-11-23 12:24:25,025 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:24:25,025 INFO L273 TraceCheckUtils]: 41: Hoare triple {8737#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:24:25,025 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:24:25,025 INFO L273 TraceCheckUtils]: 43: Hoare triple {8737#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:24:25,026 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:24:25,026 INFO L273 TraceCheckUtils]: 45: Hoare triple {8737#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:24:25,026 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:24:25,026 INFO L273 TraceCheckUtils]: 47: Hoare triple {8737#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:24:25,026 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:24:25,027 INFO L273 TraceCheckUtils]: 49: Hoare triple {8737#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:24:25,027 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:24:25,027 INFO L273 TraceCheckUtils]: 51: Hoare triple {8737#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:24:25,027 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:24:25,027 INFO L273 TraceCheckUtils]: 53: Hoare triple {8737#true} assume !(~i~0 < 100); {8737#true} is VALID [2018-11-23 12:24:25,028 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:24:25,028 INFO L273 TraceCheckUtils]: 55: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:24:25,028 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {8737#true} {8738#false} #70#return; {8738#false} is VALID [2018-11-23 12:24:25,028 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:24:25,028 INFO L256 TraceCheckUtils]: 58: Hoare triple {8738#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {8737#true} is VALID [2018-11-23 12:24:25,028 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:24:25,028 INFO L273 TraceCheckUtils]: 60: Hoare triple {8737#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:24:25,028 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:24:25,029 INFO L273 TraceCheckUtils]: 62: Hoare triple {8737#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:24:25,029 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:24:25,029 INFO L273 TraceCheckUtils]: 64: Hoare triple {8737#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:24:25,029 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:24:25,029 INFO L273 TraceCheckUtils]: 66: Hoare triple {8737#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:24:25,029 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:24:25,029 INFO L273 TraceCheckUtils]: 68: Hoare triple {8737#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:24:25,029 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:24:25,029 INFO L273 TraceCheckUtils]: 70: Hoare triple {8737#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:24:25,030 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:24:25,030 INFO L273 TraceCheckUtils]: 72: Hoare triple {8737#true} assume !(~i~0 < 100); {8737#true} is VALID [2018-11-23 12:24:25,030 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:24:25,030 INFO L273 TraceCheckUtils]: 74: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:24:25,030 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {8737#true} {8738#false} #72#return; {8738#false} is VALID [2018-11-23 12:24:25,030 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:24:25,030 INFO L273 TraceCheckUtils]: 77: Hoare triple {8738#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:25,030 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:24:25,031 INFO L273 TraceCheckUtils]: 79: Hoare triple {8738#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:25,031 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:24:25,031 INFO L273 TraceCheckUtils]: 81: Hoare triple {8738#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:25,031 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:24:25,031 INFO L273 TraceCheckUtils]: 83: Hoare triple {8738#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:25,031 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:24:25,031 INFO L273 TraceCheckUtils]: 85: Hoare triple {8738#false} assume !(~i~2 < 99); {8738#false} is VALID [2018-11-23 12:24:25,031 INFO L273 TraceCheckUtils]: 86: Hoare triple {8738#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {8738#false} is VALID [2018-11-23 12:24:25,031 INFO L256 TraceCheckUtils]: 87: Hoare triple {8738#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {8737#true} is VALID [2018-11-23 12:24:25,032 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:24:25,032 INFO L273 TraceCheckUtils]: 89: Hoare triple {8737#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:24:25,032 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:24:25,032 INFO L273 TraceCheckUtils]: 91: Hoare triple {8737#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:24:25,032 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:24:25,032 INFO L273 TraceCheckUtils]: 93: Hoare triple {8737#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:24:25,032 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:24:25,032 INFO L273 TraceCheckUtils]: 95: Hoare triple {8737#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:24:25,032 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:24:25,033 INFO L273 TraceCheckUtils]: 97: Hoare triple {8737#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:24:25,033 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:24:25,033 INFO L273 TraceCheckUtils]: 99: Hoare triple {8737#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8737#true} is VALID [2018-11-23 12:24:25,033 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:24:25,033 INFO L273 TraceCheckUtils]: 101: Hoare triple {8737#true} assume !(~i~0 < 100); {8737#true} is VALID [2018-11-23 12:24:25,033 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:24:25,033 INFO L273 TraceCheckUtils]: 103: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:24:25,033 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {8737#true} {8738#false} #74#return; {8738#false} is VALID [2018-11-23 12:24:25,034 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:24:25,034 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:24:25,034 INFO L273 TraceCheckUtils]: 107: Hoare triple {8738#false} assume !false; {8738#false} is VALID [2018-11-23 12:24:25,039 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:24:25,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:25,039 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:24:25,048 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:24:25,092 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:24:25,092 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:24:25,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:25,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:25,278 INFO L256 TraceCheckUtils]: 0: Hoare triple {8737#true} call ULTIMATE.init(); {8737#true} is VALID [2018-11-23 12:24:25,278 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:24:25,278 INFO L273 TraceCheckUtils]: 2: Hoare triple {8737#true} assume true; {8737#true} is VALID [2018-11-23 12:24:25,279 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8737#true} {8737#true} #66#return; {8737#true} is VALID [2018-11-23 12:24:25,279 INFO L256 TraceCheckUtils]: 4: Hoare triple {8737#true} call #t~ret13 := main(); {8737#true} is VALID [2018-11-23 12:24:25,280 INFO L273 TraceCheckUtils]: 5: Hoare triple {8737#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:24:25,280 INFO L273 TraceCheckUtils]: 6: Hoare triple {8774#(<= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:24:25,280 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:24:25,281 INFO L273 TraceCheckUtils]: 8: Hoare triple {8740#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:24:25,281 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:24:25,281 INFO L273 TraceCheckUtils]: 10: Hoare triple {8741#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:24:25,282 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:24:25,282 INFO L273 TraceCheckUtils]: 12: Hoare triple {8742#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -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:24:25,283 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:24:25,283 INFO L273 TraceCheckUtils]: 14: Hoare triple {8743#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -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:24:25,284 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:24:25,285 INFO L273 TraceCheckUtils]: 16: Hoare triple {8744#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -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:24:25,285 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:24:25,286 INFO L273 TraceCheckUtils]: 18: Hoare triple {8745#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -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:24:25,286 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:24:25,287 INFO L273 TraceCheckUtils]: 20: Hoare triple {8746#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -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:24:25,288 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:24:25,288 INFO L273 TraceCheckUtils]: 22: Hoare triple {8747#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -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:24:25,289 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:24:25,289 INFO L273 TraceCheckUtils]: 24: Hoare triple {8748#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -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:24:25,290 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:24:25,291 INFO L273 TraceCheckUtils]: 26: Hoare triple {8749#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -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:24:25,291 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:24:25,292 INFO L273 TraceCheckUtils]: 28: Hoare triple {8750#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -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:24:25,293 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:24:25,293 INFO L273 TraceCheckUtils]: 30: Hoare triple {8751#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -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:24:25,294 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:24:25,294 INFO L273 TraceCheckUtils]: 32: Hoare triple {8752#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -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:24:25,295 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:24:25,295 INFO L273 TraceCheckUtils]: 34: Hoare triple {8753#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -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:24:25,296 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:24:25,297 INFO L273 TraceCheckUtils]: 36: Hoare triple {8754#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -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:24:25,297 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:24:25,298 INFO L273 TraceCheckUtils]: 38: Hoare triple {8755#(<= main_~i~1 16)} assume !(~i~1 < 100); {8738#false} is VALID [2018-11-23 12:24:25,298 INFO L256 TraceCheckUtils]: 39: Hoare triple {8738#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {8738#false} is VALID [2018-11-23 12:24:25,298 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:24:25,299 INFO L273 TraceCheckUtils]: 41: Hoare triple {8738#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:24:25,299 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:24:25,299 INFO L273 TraceCheckUtils]: 43: Hoare triple {8738#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:24:25,299 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:24:25,299 INFO L273 TraceCheckUtils]: 45: Hoare triple {8738#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:24:25,299 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:24:25,300 INFO L273 TraceCheckUtils]: 47: Hoare triple {8738#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:24:25,300 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:24:25,300 INFO L273 TraceCheckUtils]: 49: Hoare triple {8738#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:24:25,300 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:24:25,300 INFO L273 TraceCheckUtils]: 51: Hoare triple {8738#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:24:25,301 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:24:25,301 INFO L273 TraceCheckUtils]: 53: Hoare triple {8738#false} assume !(~i~0 < 100); {8738#false} is VALID [2018-11-23 12:24:25,301 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:24:25,301 INFO L273 TraceCheckUtils]: 55: Hoare triple {8738#false} assume true; {8738#false} is VALID [2018-11-23 12:24:25,301 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {8738#false} {8738#false} #70#return; {8738#false} is VALID [2018-11-23 12:24:25,302 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:24:25,302 INFO L256 TraceCheckUtils]: 58: Hoare triple {8738#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {8738#false} is VALID [2018-11-23 12:24:25,302 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:24:25,302 INFO L273 TraceCheckUtils]: 60: Hoare triple {8738#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:24:25,302 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:24:25,302 INFO L273 TraceCheckUtils]: 62: Hoare triple {8738#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:24:25,303 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:24:25,303 INFO L273 TraceCheckUtils]: 64: Hoare triple {8738#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:24:25,303 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:24:25,303 INFO L273 TraceCheckUtils]: 66: Hoare triple {8738#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:24:25,303 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:24:25,303 INFO L273 TraceCheckUtils]: 68: Hoare triple {8738#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:24:25,304 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:24:25,304 INFO L273 TraceCheckUtils]: 70: Hoare triple {8738#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:24:25,304 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:24:25,304 INFO L273 TraceCheckUtils]: 72: Hoare triple {8738#false} assume !(~i~0 < 100); {8738#false} is VALID [2018-11-23 12:24:25,304 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:24:25,304 INFO L273 TraceCheckUtils]: 74: Hoare triple {8738#false} assume true; {8738#false} is VALID [2018-11-23 12:24:25,304 INFO L268 TraceCheckUtils]: 75: Hoare quadruple {8738#false} {8738#false} #72#return; {8738#false} is VALID [2018-11-23 12:24:25,304 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:24:25,305 INFO L273 TraceCheckUtils]: 77: Hoare triple {8738#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:25,305 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:24:25,305 INFO L273 TraceCheckUtils]: 79: Hoare triple {8738#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:25,305 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:24:25,305 INFO L273 TraceCheckUtils]: 81: Hoare triple {8738#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:25,305 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:24:25,305 INFO L273 TraceCheckUtils]: 83: Hoare triple {8738#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:25,305 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:24:25,305 INFO L273 TraceCheckUtils]: 85: Hoare triple {8738#false} assume !(~i~2 < 99); {8738#false} is VALID [2018-11-23 12:24:25,306 INFO L273 TraceCheckUtils]: 86: Hoare triple {8738#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {8738#false} is VALID [2018-11-23 12:24:25,306 INFO L256 TraceCheckUtils]: 87: Hoare triple {8738#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {8738#false} is VALID [2018-11-23 12:24:25,306 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:24:25,306 INFO L273 TraceCheckUtils]: 89: Hoare triple {8738#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:24:25,306 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:24:25,306 INFO L273 TraceCheckUtils]: 91: Hoare triple {8738#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:24:25,306 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:24:25,306 INFO L273 TraceCheckUtils]: 93: Hoare triple {8738#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:24:25,306 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:24:25,307 INFO L273 TraceCheckUtils]: 95: Hoare triple {8738#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:24:25,307 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:24:25,307 INFO L273 TraceCheckUtils]: 97: Hoare triple {8738#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:24:25,307 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:24:25,307 INFO L273 TraceCheckUtils]: 99: Hoare triple {8738#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {8738#false} is VALID [2018-11-23 12:24:25,307 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:24:25,307 INFO L273 TraceCheckUtils]: 101: Hoare triple {8738#false} assume !(~i~0 < 100); {8738#false} is VALID [2018-11-23 12:24:25,307 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:24:25,307 INFO L273 TraceCheckUtils]: 103: Hoare triple {8738#false} assume true; {8738#false} is VALID [2018-11-23 12:24:25,307 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {8738#false} {8738#false} #74#return; {8738#false} is VALID [2018-11-23 12:24:25,308 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:24:25,308 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:24:25,308 INFO L273 TraceCheckUtils]: 107: Hoare triple {8738#false} assume !false; {8738#false} is VALID [2018-11-23 12:24:25,312 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:24:25,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:25,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 12:24:25,332 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 108 [2018-11-23 12:24:25,332 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:25,332 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 12:24:25,401 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:24:25,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 12:24:25,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 12:24:25,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:24:25,403 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 20 states. [2018-11-23 12:24:25,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:25,915 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2018-11-23 12:24:25,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:24:25,915 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 108 [2018-11-23 12:24:25,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:25,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:24:25,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 86 transitions. [2018-11-23 12:24:25,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:24:25,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 86 transitions. [2018-11-23 12:24:25,918 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 86 transitions. [2018-11-23 12:24:26,122 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:24:26,124 INFO L225 Difference]: With dead ends: 114 [2018-11-23 12:24:26,124 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 12:24:26,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:24:26,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 12:24:26,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-11-23 12:24:26,161 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:26,161 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 77 states. [2018-11-23 12:24:26,161 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 77 states. [2018-11-23 12:24:26,162 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 77 states. [2018-11-23 12:24:26,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:26,163 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-11-23 12:24:26,163 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-11-23 12:24:26,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:26,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:26,164 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 78 states. [2018-11-23 12:24:26,164 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 78 states. [2018-11-23 12:24:26,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:26,165 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-11-23 12:24:26,165 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-11-23 12:24:26,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:26,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:26,167 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:26,167 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:26,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-23 12:24:26,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-11-23 12:24:26,169 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 108 [2018-11-23 12:24:26,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:26,169 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-11-23 12:24:26,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 12:24:26,169 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-23 12:24:26,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-23 12:24:26,170 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:26,170 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:24:26,170 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:26,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:26,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1027293945, now seen corresponding path program 17 times [2018-11-23 12:24:26,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:26,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:26,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:26,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:24:26,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:26,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:26,536 INFO L256 TraceCheckUtils]: 0: Hoare triple {9519#true} call ULTIMATE.init(); {9519#true} is VALID [2018-11-23 12:24:26,536 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:24:26,536 INFO L273 TraceCheckUtils]: 2: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:24:26,536 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9519#true} {9519#true} #66#return; {9519#true} is VALID [2018-11-23 12:24:26,536 INFO L256 TraceCheckUtils]: 4: Hoare triple {9519#true} call #t~ret13 := main(); {9519#true} is VALID [2018-11-23 12:24:26,537 INFO L273 TraceCheckUtils]: 5: Hoare triple {9519#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:24:26,537 INFO L273 TraceCheckUtils]: 6: Hoare triple {9521#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:24:26,538 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:24:26,538 INFO L273 TraceCheckUtils]: 8: Hoare triple {9522#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:24:26,539 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:24:26,540 INFO L273 TraceCheckUtils]: 10: Hoare triple {9523#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:24:26,540 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:24:26,541 INFO L273 TraceCheckUtils]: 12: Hoare triple {9524#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -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:24:26,542 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:24:26,542 INFO L273 TraceCheckUtils]: 14: Hoare triple {9525#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -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:24:26,543 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:24:26,543 INFO L273 TraceCheckUtils]: 16: Hoare triple {9526#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -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:24:26,544 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:24:26,544 INFO L273 TraceCheckUtils]: 18: Hoare triple {9527#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -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:24:26,545 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:24:26,546 INFO L273 TraceCheckUtils]: 20: Hoare triple {9528#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -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:24:26,546 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:24:26,547 INFO L273 TraceCheckUtils]: 22: Hoare triple {9529#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -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:24:26,548 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:24:26,548 INFO L273 TraceCheckUtils]: 24: Hoare triple {9530#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -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:24:26,549 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:24:26,552 INFO L273 TraceCheckUtils]: 26: Hoare triple {9531#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -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:24:26,552 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:24:26,553 INFO L273 TraceCheckUtils]: 28: Hoare triple {9532#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -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:24:26,553 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:24:26,554 INFO L273 TraceCheckUtils]: 30: Hoare triple {9533#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -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:24:26,554 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:24:26,554 INFO L273 TraceCheckUtils]: 32: Hoare triple {9534#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -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:24:26,555 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:24:26,555 INFO L273 TraceCheckUtils]: 34: Hoare triple {9535#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -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:24:26,556 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:24:26,556 INFO L273 TraceCheckUtils]: 36: Hoare triple {9536#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -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:24:26,557 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:24:26,577 INFO L273 TraceCheckUtils]: 38: Hoare triple {9537#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -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:24:26,592 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:24:26,601 INFO L273 TraceCheckUtils]: 40: Hoare triple {9538#(<= main_~i~1 17)} assume !(~i~1 < 100); {9520#false} is VALID [2018-11-23 12:24:26,601 INFO L256 TraceCheckUtils]: 41: Hoare triple {9520#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {9519#true} is VALID [2018-11-23 12:24:26,601 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:24:26,601 INFO L273 TraceCheckUtils]: 43: Hoare triple {9519#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:24:26,601 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:24:26,601 INFO L273 TraceCheckUtils]: 45: Hoare triple {9519#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:24:26,602 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:24:26,602 INFO L273 TraceCheckUtils]: 47: Hoare triple {9519#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:24:26,602 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:24:26,602 INFO L273 TraceCheckUtils]: 49: Hoare triple {9519#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:24:26,602 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:24:26,602 INFO L273 TraceCheckUtils]: 51: Hoare triple {9519#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:24:26,603 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:24:26,603 INFO L273 TraceCheckUtils]: 53: Hoare triple {9519#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:24:26,603 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:24:26,603 INFO L273 TraceCheckUtils]: 55: Hoare triple {9519#true} assume !(~i~0 < 100); {9519#true} is VALID [2018-11-23 12:24:26,603 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:24:26,603 INFO L273 TraceCheckUtils]: 57: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:24:26,604 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {9519#true} {9520#false} #70#return; {9520#false} is VALID [2018-11-23 12:24:26,604 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:24:26,604 INFO L256 TraceCheckUtils]: 60: Hoare triple {9520#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {9519#true} is VALID [2018-11-23 12:24:26,604 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:24:26,604 INFO L273 TraceCheckUtils]: 62: Hoare triple {9519#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:24:26,604 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:24:26,604 INFO L273 TraceCheckUtils]: 64: Hoare triple {9519#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:24:26,605 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:24:26,605 INFO L273 TraceCheckUtils]: 66: Hoare triple {9519#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:24:26,605 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:24:26,605 INFO L273 TraceCheckUtils]: 68: Hoare triple {9519#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:24:26,605 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:24:26,605 INFO L273 TraceCheckUtils]: 70: Hoare triple {9519#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:24:26,606 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:24:26,606 INFO L273 TraceCheckUtils]: 72: Hoare triple {9519#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:24:26,606 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:24:26,606 INFO L273 TraceCheckUtils]: 74: Hoare triple {9519#true} assume !(~i~0 < 100); {9519#true} is VALID [2018-11-23 12:24:26,606 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:24:26,606 INFO L273 TraceCheckUtils]: 76: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:24:26,606 INFO L268 TraceCheckUtils]: 77: Hoare quadruple {9519#true} {9520#false} #72#return; {9520#false} is VALID [2018-11-23 12:24:26,607 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:24:26,607 INFO L273 TraceCheckUtils]: 79: Hoare triple {9520#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:26,607 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:24:26,607 INFO L273 TraceCheckUtils]: 81: Hoare triple {9520#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:26,607 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:24:26,608 INFO L273 TraceCheckUtils]: 83: Hoare triple {9520#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:26,608 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:24:26,608 INFO L273 TraceCheckUtils]: 85: Hoare triple {9520#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:26,608 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:24:26,608 INFO L273 TraceCheckUtils]: 87: Hoare triple {9520#false} assume !(~i~2 < 99); {9520#false} is VALID [2018-11-23 12:24:26,608 INFO L273 TraceCheckUtils]: 88: Hoare triple {9520#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {9520#false} is VALID [2018-11-23 12:24:26,609 INFO L256 TraceCheckUtils]: 89: Hoare triple {9520#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {9519#true} is VALID [2018-11-23 12:24:26,609 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:24:26,609 INFO L273 TraceCheckUtils]: 91: Hoare triple {9519#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:24:26,609 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:24:26,609 INFO L273 TraceCheckUtils]: 93: Hoare triple {9519#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:24:26,610 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:24:26,610 INFO L273 TraceCheckUtils]: 95: Hoare triple {9519#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:24:26,610 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:24:26,610 INFO L273 TraceCheckUtils]: 97: Hoare triple {9519#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:24:26,610 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:24:26,611 INFO L273 TraceCheckUtils]: 99: Hoare triple {9519#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:24:26,611 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:24:26,611 INFO L273 TraceCheckUtils]: 101: Hoare triple {9519#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9519#true} is VALID [2018-11-23 12:24:26,611 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:24:26,611 INFO L273 TraceCheckUtils]: 103: Hoare triple {9519#true} assume !(~i~0 < 100); {9519#true} is VALID [2018-11-23 12:24:26,612 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:24:26,612 INFO L273 TraceCheckUtils]: 105: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:24:26,612 INFO L268 TraceCheckUtils]: 106: Hoare quadruple {9519#true} {9520#false} #74#return; {9520#false} is VALID [2018-11-23 12:24:26,612 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:24:26,612 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:24:26,612 INFO L273 TraceCheckUtils]: 109: Hoare triple {9520#false} assume !false; {9520#false} is VALID [2018-11-23 12:24:26,620 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:24:26,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:26,620 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:24:26,633 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:24:27,314 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2018-11-23 12:24:27,315 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:24:27,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:27,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:27,568 INFO L256 TraceCheckUtils]: 0: Hoare triple {9519#true} call ULTIMATE.init(); {9519#true} is VALID [2018-11-23 12:24:27,568 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:24:27,569 INFO L273 TraceCheckUtils]: 2: Hoare triple {9519#true} assume true; {9519#true} is VALID [2018-11-23 12:24:27,569 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9519#true} {9519#true} #66#return; {9519#true} is VALID [2018-11-23 12:24:27,569 INFO L256 TraceCheckUtils]: 4: Hoare triple {9519#true} call #t~ret13 := main(); {9519#true} is VALID [2018-11-23 12:24:27,569 INFO L273 TraceCheckUtils]: 5: Hoare triple {9519#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {9519#true} is VALID [2018-11-23 12:24:27,570 INFO L273 TraceCheckUtils]: 6: Hoare triple {9519#true} assume !!(~i~1 < 100);assume -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:24:27,570 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:24:27,570 INFO L273 TraceCheckUtils]: 8: Hoare triple {9519#true} assume !!(~i~1 < 100);assume -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:24:27,570 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:24:27,570 INFO L273 TraceCheckUtils]: 10: Hoare triple {9519#true} assume !!(~i~1 < 100);assume -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:24:27,571 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:24:27,571 INFO L273 TraceCheckUtils]: 12: Hoare triple {9519#true} assume !!(~i~1 < 100);assume -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:24:27,571 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:24:27,571 INFO L273 TraceCheckUtils]: 14: Hoare triple {9519#true} assume !!(~i~1 < 100);assume -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:24:27,571 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:24:27,571 INFO L273 TraceCheckUtils]: 16: Hoare triple {9519#true} assume !!(~i~1 < 100);assume -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:24:27,572 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:24:27,572 INFO L273 TraceCheckUtils]: 18: Hoare triple {9519#true} assume !!(~i~1 < 100);assume -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:24:27,572 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:24:27,572 INFO L273 TraceCheckUtils]: 20: Hoare triple {9519#true} assume !!(~i~1 < 100);assume -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:24:27,572 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:24:27,572 INFO L273 TraceCheckUtils]: 22: Hoare triple {9519#true} assume !!(~i~1 < 100);assume -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:24:27,573 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:24:27,573 INFO L273 TraceCheckUtils]: 24: Hoare triple {9519#true} assume !!(~i~1 < 100);assume -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:24:27,573 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:24:27,573 INFO L273 TraceCheckUtils]: 26: Hoare triple {9519#true} assume !!(~i~1 < 100);assume -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:24:27,573 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:24:27,574 INFO L273 TraceCheckUtils]: 28: Hoare triple {9519#true} assume !!(~i~1 < 100);assume -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:24:27,574 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:24:27,574 INFO L273 TraceCheckUtils]: 30: Hoare triple {9519#true} assume !!(~i~1 < 100);assume -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:24:27,574 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:24:27,574 INFO L273 TraceCheckUtils]: 32: Hoare triple {9519#true} assume !!(~i~1 < 100);assume -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:24:27,574 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:24:27,574 INFO L273 TraceCheckUtils]: 34: Hoare triple {9519#true} assume !!(~i~1 < 100);assume -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:24:27,575 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:24:27,575 INFO L273 TraceCheckUtils]: 36: Hoare triple {9519#true} assume !!(~i~1 < 100);assume -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:24:27,575 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:24:27,575 INFO L273 TraceCheckUtils]: 38: Hoare triple {9519#true} assume !!(~i~1 < 100);assume -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:24:27,575 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:24:27,575 INFO L273 TraceCheckUtils]: 40: Hoare triple {9519#true} assume !(~i~1 < 100); {9519#true} is VALID [2018-11-23 12:24:27,576 INFO L256 TraceCheckUtils]: 41: Hoare triple {9519#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {9519#true} is VALID [2018-11-23 12:24:27,592 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#(<= bAnd_~i~0 1)} is VALID [2018-11-23 12:24:27,600 INFO L273 TraceCheckUtils]: 43: Hoare triple {9668#(<= bAnd_~i~0 1)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9668#(<= bAnd_~i~0 1)} is VALID [2018-11-23 12:24:27,601 INFO L273 TraceCheckUtils]: 44: Hoare triple {9668#(<= bAnd_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9675#(<= bAnd_~i~0 2)} is VALID [2018-11-23 12:24:27,601 INFO L273 TraceCheckUtils]: 45: Hoare triple {9675#(<= bAnd_~i~0 2)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9675#(<= bAnd_~i~0 2)} is VALID [2018-11-23 12:24:27,602 INFO L273 TraceCheckUtils]: 46: Hoare triple {9675#(<= bAnd_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9682#(<= bAnd_~i~0 3)} is VALID [2018-11-23 12:24:27,606 INFO L273 TraceCheckUtils]: 47: Hoare triple {9682#(<= bAnd_~i~0 3)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9682#(<= bAnd_~i~0 3)} is VALID [2018-11-23 12:24:27,606 INFO L273 TraceCheckUtils]: 48: Hoare triple {9682#(<= bAnd_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9689#(<= bAnd_~i~0 4)} is VALID [2018-11-23 12:24:27,606 INFO L273 TraceCheckUtils]: 49: Hoare triple {9689#(<= bAnd_~i~0 4)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9689#(<= bAnd_~i~0 4)} is VALID [2018-11-23 12:24:27,607 INFO L273 TraceCheckUtils]: 50: Hoare triple {9689#(<= bAnd_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9696#(<= bAnd_~i~0 5)} is VALID [2018-11-23 12:24:27,607 INFO L273 TraceCheckUtils]: 51: Hoare triple {9696#(<= bAnd_~i~0 5)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9696#(<= bAnd_~i~0 5)} is VALID [2018-11-23 12:24:27,608 INFO L273 TraceCheckUtils]: 52: Hoare triple {9696#(<= bAnd_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9703#(<= bAnd_~i~0 6)} is VALID [2018-11-23 12:24:27,608 INFO L273 TraceCheckUtils]: 53: Hoare triple {9703#(<= bAnd_~i~0 6)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9703#(<= bAnd_~i~0 6)} is VALID [2018-11-23 12:24:27,608 INFO L273 TraceCheckUtils]: 54: Hoare triple {9703#(<= bAnd_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9710#(<= bAnd_~i~0 7)} is VALID [2018-11-23 12:24:27,609 INFO L273 TraceCheckUtils]: 55: Hoare triple {9710#(<= bAnd_~i~0 7)} assume !(~i~0 < 100); {9520#false} is VALID [2018-11-23 12:24:27,609 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:24:27,609 INFO L273 TraceCheckUtils]: 57: Hoare triple {9520#false} assume true; {9520#false} is VALID [2018-11-23 12:24:27,609 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {9520#false} {9519#true} #70#return; {9520#false} is VALID [2018-11-23 12:24:27,609 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:24:27,609 INFO L256 TraceCheckUtils]: 60: Hoare triple {9520#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {9520#false} is VALID [2018-11-23 12:24:27,609 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:24:27,610 INFO L273 TraceCheckUtils]: 62: Hoare triple {9520#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9520#false} is VALID [2018-11-23 12:24:27,610 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:24:27,610 INFO L273 TraceCheckUtils]: 64: Hoare triple {9520#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9520#false} is VALID [2018-11-23 12:24:27,610 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:24:27,610 INFO L273 TraceCheckUtils]: 66: Hoare triple {9520#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9520#false} is VALID [2018-11-23 12:24:27,610 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:24:27,610 INFO L273 TraceCheckUtils]: 68: Hoare triple {9520#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9520#false} is VALID [2018-11-23 12:24:27,610 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:24:27,610 INFO L273 TraceCheckUtils]: 70: Hoare triple {9520#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9520#false} is VALID [2018-11-23 12:24:27,611 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:24:27,611 INFO L273 TraceCheckUtils]: 72: Hoare triple {9520#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9520#false} is VALID [2018-11-23 12:24:27,611 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:24:27,611 INFO L273 TraceCheckUtils]: 74: Hoare triple {9520#false} assume !(~i~0 < 100); {9520#false} is VALID [2018-11-23 12:24:27,611 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:24:27,611 INFO L273 TraceCheckUtils]: 76: Hoare triple {9520#false} assume true; {9520#false} is VALID [2018-11-23 12:24:27,612 INFO L268 TraceCheckUtils]: 77: Hoare quadruple {9520#false} {9520#false} #72#return; {9520#false} is VALID [2018-11-23 12:24:27,612 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:24:27,612 INFO L273 TraceCheckUtils]: 79: Hoare triple {9520#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:27,612 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:24:27,612 INFO L273 TraceCheckUtils]: 81: Hoare triple {9520#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:27,613 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:24:27,613 INFO L273 TraceCheckUtils]: 83: Hoare triple {9520#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:27,613 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:24:27,613 INFO L273 TraceCheckUtils]: 85: Hoare triple {9520#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:27,613 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:24:27,613 INFO L273 TraceCheckUtils]: 87: Hoare triple {9520#false} assume !(~i~2 < 99); {9520#false} is VALID [2018-11-23 12:24:27,613 INFO L273 TraceCheckUtils]: 88: Hoare triple {9520#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {9520#false} is VALID [2018-11-23 12:24:27,613 INFO L256 TraceCheckUtils]: 89: Hoare triple {9520#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {9520#false} is VALID [2018-11-23 12:24:27,613 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:24:27,614 INFO L273 TraceCheckUtils]: 91: Hoare triple {9520#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9520#false} is VALID [2018-11-23 12:24:27,614 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:24:27,614 INFO L273 TraceCheckUtils]: 93: Hoare triple {9520#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9520#false} is VALID [2018-11-23 12:24:27,614 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:24:27,614 INFO L273 TraceCheckUtils]: 95: Hoare triple {9520#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9520#false} is VALID [2018-11-23 12:24:27,614 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:24:27,614 INFO L273 TraceCheckUtils]: 97: Hoare triple {9520#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9520#false} is VALID [2018-11-23 12:24:27,614 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:24:27,614 INFO L273 TraceCheckUtils]: 99: Hoare triple {9520#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9520#false} is VALID [2018-11-23 12:24:27,615 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:24:27,615 INFO L273 TraceCheckUtils]: 101: Hoare triple {9520#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {9520#false} is VALID [2018-11-23 12:24:27,615 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:24:27,615 INFO L273 TraceCheckUtils]: 103: Hoare triple {9520#false} assume !(~i~0 < 100); {9520#false} is VALID [2018-11-23 12:24:27,615 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:24:27,615 INFO L273 TraceCheckUtils]: 105: Hoare triple {9520#false} assume true; {9520#false} is VALID [2018-11-23 12:24:27,615 INFO L268 TraceCheckUtils]: 106: Hoare quadruple {9520#false} {9520#false} #74#return; {9520#false} is VALID [2018-11-23 12:24:27,615 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:24:27,615 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:24:27,616 INFO L273 TraceCheckUtils]: 109: Hoare triple {9520#false} assume !false; {9520#false} is VALID [2018-11-23 12:24:27,620 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:24:27,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:27,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9] total 27 [2018-11-23 12:24:27,641 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 110 [2018-11-23 12:24:27,642 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:27,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-23 12:24:27,728 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:24:27,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 12:24:27,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 12:24:27,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2018-11-23 12:24:27,729 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 27 states. [2018-11-23 12:24:28,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:28,191 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2018-11-23 12:24:28,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 12:24:28,191 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 110 [2018-11-23 12:24:28,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:28,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:24:28,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 106 transitions. [2018-11-23 12:24:28,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:24:28,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 106 transitions. [2018-11-23 12:24:28,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 106 transitions. [2018-11-23 12:24:28,316 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:24:28,318 INFO L225 Difference]: With dead ends: 119 [2018-11-23 12:24:28,318 INFO L226 Difference]: Without dead ends: 83 [2018-11-23 12:24:28,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2018-11-23 12:24:28,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-23 12:24:28,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-11-23 12:24:28,356 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:28,356 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 81 states. [2018-11-23 12:24:28,356 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 81 states. [2018-11-23 12:24:28,356 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 81 states. [2018-11-23 12:24:28,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:28,359 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-11-23 12:24:28,359 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-11-23 12:24:28,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:28,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:28,360 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 83 states. [2018-11-23 12:24:28,360 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 83 states. [2018-11-23 12:24:28,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:28,362 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-11-23 12:24:28,364 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-11-23 12:24:28,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:28,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:28,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:28,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:28,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-23 12:24:28,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2018-11-23 12:24:28,367 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 110 [2018-11-23 12:24:28,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:28,367 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-11-23 12:24:28,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 12:24:28,367 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-11-23 12:24:28,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-23 12:24:28,368 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:28,368 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:24:28,369 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:28,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:28,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1680928935, now seen corresponding path program 18 times [2018-11-23 12:24:28,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:28,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:28,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:28,370 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:24:28,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:28,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:29,141 INFO L256 TraceCheckUtils]: 0: Hoare triple {10337#true} call ULTIMATE.init(); {10337#true} is VALID [2018-11-23 12:24:29,141 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:24:29,141 INFO L273 TraceCheckUtils]: 2: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:24:29,141 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10337#true} {10337#true} #66#return; {10337#true} is VALID [2018-11-23 12:24:29,142 INFO L256 TraceCheckUtils]: 4: Hoare triple {10337#true} call #t~ret13 := main(); {10337#true} is VALID [2018-11-23 12:24:29,142 INFO L273 TraceCheckUtils]: 5: Hoare triple {10337#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:24:29,143 INFO L273 TraceCheckUtils]: 6: Hoare triple {10339#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:24:29,143 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:24:29,143 INFO L273 TraceCheckUtils]: 8: Hoare triple {10340#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:24:29,144 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:24:29,144 INFO L273 TraceCheckUtils]: 10: Hoare triple {10341#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:24:29,145 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:24:29,145 INFO L273 TraceCheckUtils]: 12: Hoare triple {10342#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -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:24:29,145 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:24:29,146 INFO L273 TraceCheckUtils]: 14: Hoare triple {10343#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -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:24:29,146 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:24:29,147 INFO L273 TraceCheckUtils]: 16: Hoare triple {10344#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -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:24:29,148 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:24:29,148 INFO L273 TraceCheckUtils]: 18: Hoare triple {10345#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -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:24:29,149 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:24:29,151 INFO L273 TraceCheckUtils]: 20: Hoare triple {10346#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -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:24:29,152 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:24:29,153 INFO L273 TraceCheckUtils]: 22: Hoare triple {10347#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -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:24:29,153 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:24:29,154 INFO L273 TraceCheckUtils]: 24: Hoare triple {10348#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -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:24:29,155 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:24:29,155 INFO L273 TraceCheckUtils]: 26: Hoare triple {10349#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -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:24:29,156 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:24:29,156 INFO L273 TraceCheckUtils]: 28: Hoare triple {10350#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -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:24:29,157 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:24:29,158 INFO L273 TraceCheckUtils]: 30: Hoare triple {10351#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -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:24:29,158 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:24:29,159 INFO L273 TraceCheckUtils]: 32: Hoare triple {10352#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -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:24:29,159 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:24:29,162 INFO L273 TraceCheckUtils]: 34: Hoare triple {10353#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -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:24:29,163 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:24:29,163 INFO L273 TraceCheckUtils]: 36: Hoare triple {10354#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -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:24:29,164 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:24:29,164 INFO L273 TraceCheckUtils]: 38: Hoare triple {10355#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -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:24:29,164 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:24:29,165 INFO L273 TraceCheckUtils]: 40: Hoare triple {10356#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -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:24:29,165 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:24:29,166 INFO L273 TraceCheckUtils]: 42: Hoare triple {10357#(<= main_~i~1 18)} assume !(~i~1 < 100); {10338#false} is VALID [2018-11-23 12:24:29,166 INFO L256 TraceCheckUtils]: 43: Hoare triple {10338#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {10337#true} is VALID [2018-11-23 12:24:29,167 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:24:29,167 INFO L273 TraceCheckUtils]: 45: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:24:29,167 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:24:29,167 INFO L273 TraceCheckUtils]: 47: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:24:29,167 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:24:29,167 INFO L273 TraceCheckUtils]: 49: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:24:29,168 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:24:29,168 INFO L273 TraceCheckUtils]: 51: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:24:29,168 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:24:29,168 INFO L273 TraceCheckUtils]: 53: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:24:29,168 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:24:29,169 INFO L273 TraceCheckUtils]: 55: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:24:29,169 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:24:29,169 INFO L273 TraceCheckUtils]: 57: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:24:29,169 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:24:29,169 INFO L273 TraceCheckUtils]: 59: Hoare triple {10337#true} assume !(~i~0 < 100); {10337#true} is VALID [2018-11-23 12:24:29,169 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:24:29,170 INFO L273 TraceCheckUtils]: 61: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:24:29,170 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {10337#true} {10338#false} #70#return; {10338#false} is VALID [2018-11-23 12:24:29,170 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:24:29,170 INFO L256 TraceCheckUtils]: 64: Hoare triple {10338#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {10337#true} is VALID [2018-11-23 12:24:29,170 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:24:29,170 INFO L273 TraceCheckUtils]: 66: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:24:29,170 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:24:29,170 INFO L273 TraceCheckUtils]: 68: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:24:29,171 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:24:29,171 INFO L273 TraceCheckUtils]: 70: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:24:29,171 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:24:29,171 INFO L273 TraceCheckUtils]: 72: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:24:29,171 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:24:29,171 INFO L273 TraceCheckUtils]: 74: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:24:29,171 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:24:29,171 INFO L273 TraceCheckUtils]: 76: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:24:29,171 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:24:29,172 INFO L273 TraceCheckUtils]: 78: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:24:29,172 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:24:29,172 INFO L273 TraceCheckUtils]: 80: Hoare triple {10337#true} assume !(~i~0 < 100); {10337#true} is VALID [2018-11-23 12:24:29,172 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:24:29,172 INFO L273 TraceCheckUtils]: 82: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:24:29,172 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {10337#true} {10338#false} #72#return; {10338#false} is VALID [2018-11-23 12:24:29,172 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:24:29,172 INFO L273 TraceCheckUtils]: 85: Hoare triple {10338#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:29,173 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:24:29,173 INFO L273 TraceCheckUtils]: 87: Hoare triple {10338#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:29,173 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:24:29,173 INFO L273 TraceCheckUtils]: 89: Hoare triple {10338#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:29,173 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:24:29,173 INFO L273 TraceCheckUtils]: 91: Hoare triple {10338#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:29,173 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:24:29,173 INFO L273 TraceCheckUtils]: 93: Hoare triple {10338#false} assume !(~i~2 < 99); {10338#false} is VALID [2018-11-23 12:24:29,173 INFO L273 TraceCheckUtils]: 94: Hoare triple {10338#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {10338#false} is VALID [2018-11-23 12:24:29,174 INFO L256 TraceCheckUtils]: 95: Hoare triple {10338#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {10337#true} is VALID [2018-11-23 12:24:29,174 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:24:29,174 INFO L273 TraceCheckUtils]: 97: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:24:29,174 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:24:29,174 INFO L273 TraceCheckUtils]: 99: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:24:29,174 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:24:29,174 INFO L273 TraceCheckUtils]: 101: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:24:29,174 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:24:29,174 INFO L273 TraceCheckUtils]: 103: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:24:29,175 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:24:29,175 INFO L273 TraceCheckUtils]: 105: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:24:29,175 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:24:29,175 INFO L273 TraceCheckUtils]: 107: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:24:29,175 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:24:29,175 INFO L273 TraceCheckUtils]: 109: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:24:29,175 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:24:29,175 INFO L273 TraceCheckUtils]: 111: Hoare triple {10337#true} assume !(~i~0 < 100); {10337#true} is VALID [2018-11-23 12:24:29,175 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:24:29,176 INFO L273 TraceCheckUtils]: 113: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:24:29,176 INFO L268 TraceCheckUtils]: 114: Hoare quadruple {10337#true} {10338#false} #74#return; {10338#false} is VALID [2018-11-23 12:24:29,176 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:24:29,176 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:24:29,176 INFO L273 TraceCheckUtils]: 117: Hoare triple {10338#false} assume !false; {10338#false} is VALID [2018-11-23 12:24:29,182 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:24:29,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:29,182 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:24:29,190 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:24:29,344 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-11-23 12:24:29,344 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:24:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:29,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:29,524 INFO L256 TraceCheckUtils]: 0: Hoare triple {10337#true} call ULTIMATE.init(); {10337#true} is VALID [2018-11-23 12:24:29,524 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:24:29,524 INFO L273 TraceCheckUtils]: 2: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:24:29,524 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10337#true} {10337#true} #66#return; {10337#true} is VALID [2018-11-23 12:24:29,524 INFO L256 TraceCheckUtils]: 4: Hoare triple {10337#true} call #t~ret13 := main(); {10337#true} is VALID [2018-11-23 12:24:29,525 INFO L273 TraceCheckUtils]: 5: Hoare triple {10337#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {10337#true} is VALID [2018-11-23 12:24:29,525 INFO L273 TraceCheckUtils]: 6: Hoare triple {10337#true} assume !!(~i~1 < 100);assume -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:24:29,525 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:24:29,525 INFO L273 TraceCheckUtils]: 8: Hoare triple {10337#true} assume !!(~i~1 < 100);assume -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:24:29,525 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:24:29,525 INFO L273 TraceCheckUtils]: 10: Hoare triple {10337#true} assume !!(~i~1 < 100);assume -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:24:29,526 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:24:29,526 INFO L273 TraceCheckUtils]: 12: Hoare triple {10337#true} assume !!(~i~1 < 100);assume -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:24:29,526 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:24:29,526 INFO L273 TraceCheckUtils]: 14: Hoare triple {10337#true} assume !!(~i~1 < 100);assume -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:24:29,526 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:24:29,526 INFO L273 TraceCheckUtils]: 16: Hoare triple {10337#true} assume !!(~i~1 < 100);assume -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:24:29,526 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:24:29,526 INFO L273 TraceCheckUtils]: 18: Hoare triple {10337#true} assume !!(~i~1 < 100);assume -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:24:29,526 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:24:29,527 INFO L273 TraceCheckUtils]: 20: Hoare triple {10337#true} assume !!(~i~1 < 100);assume -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:24:29,527 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:24:29,527 INFO L273 TraceCheckUtils]: 22: Hoare triple {10337#true} assume !!(~i~1 < 100);assume -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:24:29,527 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:24:29,527 INFO L273 TraceCheckUtils]: 24: Hoare triple {10337#true} assume !!(~i~1 < 100);assume -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:24:29,527 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:24:29,527 INFO L273 TraceCheckUtils]: 26: Hoare triple {10337#true} assume !!(~i~1 < 100);assume -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:24:29,527 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:24:29,527 INFO L273 TraceCheckUtils]: 28: Hoare triple {10337#true} assume !!(~i~1 < 100);assume -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:24:29,528 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:24:29,528 INFO L273 TraceCheckUtils]: 30: Hoare triple {10337#true} assume !!(~i~1 < 100);assume -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:24:29,528 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:24:29,528 INFO L273 TraceCheckUtils]: 32: Hoare triple {10337#true} assume !!(~i~1 < 100);assume -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:24:29,528 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:24:29,528 INFO L273 TraceCheckUtils]: 34: Hoare triple {10337#true} assume !!(~i~1 < 100);assume -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:24:29,528 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:24:29,528 INFO L273 TraceCheckUtils]: 36: Hoare triple {10337#true} assume !!(~i~1 < 100);assume -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:24:29,529 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:24:29,529 INFO L273 TraceCheckUtils]: 38: Hoare triple {10337#true} assume !!(~i~1 < 100);assume -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:24:29,529 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:24:29,529 INFO L273 TraceCheckUtils]: 40: Hoare triple {10337#true} assume !!(~i~1 < 100);assume -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:24:29,529 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:24:29,529 INFO L273 TraceCheckUtils]: 42: Hoare triple {10337#true} assume !(~i~1 < 100); {10337#true} is VALID [2018-11-23 12:24:29,529 INFO L256 TraceCheckUtils]: 43: Hoare triple {10337#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {10337#true} is VALID [2018-11-23 12:24:29,529 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:24:29,529 INFO L273 TraceCheckUtils]: 45: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:24:29,530 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:24:29,530 INFO L273 TraceCheckUtils]: 47: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:24:29,530 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:24:29,530 INFO L273 TraceCheckUtils]: 49: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:24:29,530 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:24:29,530 INFO L273 TraceCheckUtils]: 51: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:24:29,530 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:24:29,530 INFO L273 TraceCheckUtils]: 53: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:24:29,530 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:24:29,531 INFO L273 TraceCheckUtils]: 55: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:24:29,531 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:24:29,531 INFO L273 TraceCheckUtils]: 57: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:24:29,531 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:24:29,531 INFO L273 TraceCheckUtils]: 59: Hoare triple {10337#true} assume !(~i~0 < 100); {10337#true} is VALID [2018-11-23 12:24:29,531 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:24:29,531 INFO L273 TraceCheckUtils]: 61: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:24:29,531 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {10337#true} {10337#true} #70#return; {10337#true} is VALID [2018-11-23 12:24:29,531 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:24:29,532 INFO L256 TraceCheckUtils]: 64: Hoare triple {10337#true} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {10337#true} is VALID [2018-11-23 12:24:29,532 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:24:29,532 INFO L273 TraceCheckUtils]: 66: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:24:29,532 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:24:29,532 INFO L273 TraceCheckUtils]: 68: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:24:29,532 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:24:29,532 INFO L273 TraceCheckUtils]: 70: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:24:29,532 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:24:29,532 INFO L273 TraceCheckUtils]: 72: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:24:29,533 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:24:29,533 INFO L273 TraceCheckUtils]: 74: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:24:29,533 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:24:29,533 INFO L273 TraceCheckUtils]: 76: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:24:29,533 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:24:29,533 INFO L273 TraceCheckUtils]: 78: Hoare triple {10337#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10337#true} is VALID [2018-11-23 12:24:29,533 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:24:29,533 INFO L273 TraceCheckUtils]: 80: Hoare triple {10337#true} assume !(~i~0 < 100); {10337#true} is VALID [2018-11-23 12:24:29,533 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:24:29,534 INFO L273 TraceCheckUtils]: 82: Hoare triple {10337#true} assume true; {10337#true} is VALID [2018-11-23 12:24:29,534 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {10337#true} {10337#true} #72#return; {10337#true} is VALID [2018-11-23 12:24:29,534 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:24:29,534 INFO L273 TraceCheckUtils]: 85: Hoare triple {10613#(<= main_~i~2 0)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:29,535 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:24:29,535 INFO L273 TraceCheckUtils]: 87: Hoare triple {10620#(<= main_~i~2 1)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:29,536 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:24:29,536 INFO L273 TraceCheckUtils]: 89: Hoare triple {10627#(<= main_~i~2 2)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:29,536 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:24:29,537 INFO L273 TraceCheckUtils]: 91: Hoare triple {10634#(<= main_~i~2 3)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:29,538 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:24:29,538 INFO L273 TraceCheckUtils]: 93: Hoare triple {10641#(<= main_~i~2 4)} assume !(~i~2 < 99); {10338#false} is VALID [2018-11-23 12:24:29,538 INFO L273 TraceCheckUtils]: 94: Hoare triple {10338#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {10338#false} is VALID [2018-11-23 12:24:29,539 INFO L256 TraceCheckUtils]: 95: Hoare triple {10338#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {10338#false} is VALID [2018-11-23 12:24:29,539 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:24:29,539 INFO L273 TraceCheckUtils]: 97: Hoare triple {10338#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10338#false} is VALID [2018-11-23 12:24:29,539 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:24:29,539 INFO L273 TraceCheckUtils]: 99: Hoare triple {10338#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10338#false} is VALID [2018-11-23 12:24:29,540 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:24:29,540 INFO L273 TraceCheckUtils]: 101: Hoare triple {10338#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10338#false} is VALID [2018-11-23 12:24:29,540 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:24:29,540 INFO L273 TraceCheckUtils]: 103: Hoare triple {10338#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10338#false} is VALID [2018-11-23 12:24:29,540 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:24:29,540 INFO L273 TraceCheckUtils]: 105: Hoare triple {10338#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10338#false} is VALID [2018-11-23 12:24:29,541 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:24:29,541 INFO L273 TraceCheckUtils]: 107: Hoare triple {10338#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10338#false} is VALID [2018-11-23 12:24:29,541 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:24:29,541 INFO L273 TraceCheckUtils]: 109: Hoare triple {10338#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {10338#false} is VALID [2018-11-23 12:24:29,541 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:24:29,542 INFO L273 TraceCheckUtils]: 111: Hoare triple {10338#false} assume !(~i~0 < 100); {10338#false} is VALID [2018-11-23 12:24:29,542 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:24:29,542 INFO L273 TraceCheckUtils]: 113: Hoare triple {10338#false} assume true; {10338#false} is VALID [2018-11-23 12:24:29,542 INFO L268 TraceCheckUtils]: 114: Hoare quadruple {10338#false} {10338#false} #74#return; {10338#false} is VALID [2018-11-23 12:24:29,542 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:24:29,542 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:24:29,543 INFO L273 TraceCheckUtils]: 117: Hoare triple {10338#false} assume !false; {10338#false} is VALID [2018-11-23 12:24:29,548 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:24:29,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:29,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7] total 26 [2018-11-23 12:24:29,568 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 118 [2018-11-23 12:24:29,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:29,568 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 12:24:29,657 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:24:29,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 12:24:29,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 12:24:29,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:24:29,658 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 26 states. [2018-11-23 12:24:30,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:30,477 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2018-11-23 12:24:30,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 12:24:30,477 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 118 [2018-11-23 12:24:30,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:30,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:24:30,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 101 transitions. [2018-11-23 12:24:30,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:24:30,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 101 transitions. [2018-11-23 12:24:30,479 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 101 transitions. [2018-11-23 12:24:30,746 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:24:30,747 INFO L225 Difference]: With dead ends: 125 [2018-11-23 12:24:30,747 INFO L226 Difference]: Without dead ends: 87 [2018-11-23 12:24:30,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:24:30,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-23 12:24:30,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-11-23 12:24:30,779 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:30,779 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 85 states. [2018-11-23 12:24:30,780 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 85 states. [2018-11-23 12:24:30,780 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 85 states. [2018-11-23 12:24:30,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:30,782 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2018-11-23 12:24:30,782 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-11-23 12:24:30,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:30,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:30,783 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 87 states. [2018-11-23 12:24:30,783 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 87 states. [2018-11-23 12:24:30,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:30,785 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2018-11-23 12:24:30,785 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-11-23 12:24:30,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:30,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:30,785 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:30,785 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:30,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-23 12:24:30,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2018-11-23 12:24:30,786 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 118 [2018-11-23 12:24:30,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:30,787 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-11-23 12:24:30,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 12:24:30,787 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-11-23 12:24:30,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-23 12:24:30,787 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:30,788 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:24:30,788 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:30,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:30,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1116806727, now seen corresponding path program 19 times [2018-11-23 12:24:30,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:30,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:30,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:30,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:24:30,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:30,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:31,148 INFO L256 TraceCheckUtils]: 0: Hoare triple {11201#true} call ULTIMATE.init(); {11201#true} is VALID [2018-11-23 12:24:31,148 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:24:31,149 INFO L273 TraceCheckUtils]: 2: Hoare triple {11201#true} assume true; {11201#true} is VALID [2018-11-23 12:24:31,149 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11201#true} {11201#true} #66#return; {11201#true} is VALID [2018-11-23 12:24:31,149 INFO L256 TraceCheckUtils]: 4: Hoare triple {11201#true} call #t~ret13 := main(); {11201#true} is VALID [2018-11-23 12:24:31,149 INFO L273 TraceCheckUtils]: 5: Hoare triple {11201#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:24:31,150 INFO L273 TraceCheckUtils]: 6: Hoare triple {11203#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:24:31,151 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:24:31,151 INFO L273 TraceCheckUtils]: 8: Hoare triple {11204#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:24:31,152 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:24:31,152 INFO L273 TraceCheckUtils]: 10: Hoare triple {11205#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:24:31,152 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:24:31,153 INFO L273 TraceCheckUtils]: 12: Hoare triple {11206#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -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:24:31,153 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:24:31,153 INFO L273 TraceCheckUtils]: 14: Hoare triple {11207#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -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:24:31,154 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:24:31,155 INFO L273 TraceCheckUtils]: 16: Hoare triple {11208#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -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:24:31,155 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:24:31,156 INFO L273 TraceCheckUtils]: 18: Hoare triple {11209#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -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:24:31,157 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:24:31,157 INFO L273 TraceCheckUtils]: 20: Hoare triple {11210#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -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:24:31,158 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:24:31,158 INFO L273 TraceCheckUtils]: 22: Hoare triple {11211#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -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:24:31,159 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:24:31,159 INFO L273 TraceCheckUtils]: 24: Hoare triple {11212#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -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:24:31,160 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:24:31,161 INFO L273 TraceCheckUtils]: 26: Hoare triple {11213#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -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:24:31,161 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:24:31,162 INFO L273 TraceCheckUtils]: 28: Hoare triple {11214#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -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:24:31,162 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:24:31,163 INFO L273 TraceCheckUtils]: 30: Hoare triple {11215#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -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:24:31,164 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:24:31,164 INFO L273 TraceCheckUtils]: 32: Hoare triple {11216#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -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:24:31,165 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:24:31,165 INFO L273 TraceCheckUtils]: 34: Hoare triple {11217#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -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:24:31,166 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:24:31,166 INFO L273 TraceCheckUtils]: 36: Hoare triple {11218#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -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:24:31,167 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:24:31,168 INFO L273 TraceCheckUtils]: 38: Hoare triple {11219#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -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:24:31,168 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:24:31,169 INFO L273 TraceCheckUtils]: 40: Hoare triple {11220#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -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:24:31,170 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:24:31,170 INFO L273 TraceCheckUtils]: 42: Hoare triple {11221#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -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:24:31,171 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:24:31,171 INFO L273 TraceCheckUtils]: 44: Hoare triple {11222#(<= main_~i~1 19)} assume !(~i~1 < 100); {11202#false} is VALID [2018-11-23 12:24:31,172 INFO L256 TraceCheckUtils]: 45: Hoare triple {11202#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {11201#true} is VALID [2018-11-23 12:24:31,172 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:24:31,172 INFO L273 TraceCheckUtils]: 47: Hoare triple {11201#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:24:31,172 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:24:31,172 INFO L273 TraceCheckUtils]: 49: Hoare triple {11201#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:24:31,173 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:24:31,173 INFO L273 TraceCheckUtils]: 51: Hoare triple {11201#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:24:31,173 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:24:31,173 INFO L273 TraceCheckUtils]: 53: Hoare triple {11201#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:24:31,173 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:24:31,173 INFO L273 TraceCheckUtils]: 55: Hoare triple {11201#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:24:31,174 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:24:31,174 INFO L273 TraceCheckUtils]: 57: Hoare triple {11201#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:24:31,174 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:24:31,174 INFO L273 TraceCheckUtils]: 59: Hoare triple {11201#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:24:31,174 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:24:31,174 INFO L273 TraceCheckUtils]: 61: Hoare triple {11201#true} assume !(~i~0 < 100); {11201#true} is VALID [2018-11-23 12:24:31,175 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:24:31,175 INFO L273 TraceCheckUtils]: 63: Hoare triple {11201#true} assume true; {11201#true} is VALID [2018-11-23 12:24:31,175 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {11201#true} {11202#false} #70#return; {11202#false} is VALID [2018-11-23 12:24:31,175 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:24:31,175 INFO L256 TraceCheckUtils]: 66: Hoare triple {11202#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {11201#true} is VALID [2018-11-23 12:24:31,176 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:24:31,176 INFO L273 TraceCheckUtils]: 68: Hoare triple {11201#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:24:31,176 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:24:31,176 INFO L273 TraceCheckUtils]: 70: Hoare triple {11201#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:24:31,176 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:24:31,176 INFO L273 TraceCheckUtils]: 72: Hoare triple {11201#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:24:31,177 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:24:31,177 INFO L273 TraceCheckUtils]: 74: Hoare triple {11201#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:24:31,177 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:24:31,177 INFO L273 TraceCheckUtils]: 76: Hoare triple {11201#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:24:31,177 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:24:31,177 INFO L273 TraceCheckUtils]: 78: Hoare triple {11201#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:24:31,177 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:24:31,177 INFO L273 TraceCheckUtils]: 80: Hoare triple {11201#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:24:31,178 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:24:31,178 INFO L273 TraceCheckUtils]: 82: Hoare triple {11201#true} assume !(~i~0 < 100); {11201#true} is VALID [2018-11-23 12:24:31,178 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:24:31,178 INFO L273 TraceCheckUtils]: 84: Hoare triple {11201#true} assume true; {11201#true} is VALID [2018-11-23 12:24:31,178 INFO L268 TraceCheckUtils]: 85: Hoare quadruple {11201#true} {11202#false} #72#return; {11202#false} is VALID [2018-11-23 12:24:31,178 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:24:31,178 INFO L273 TraceCheckUtils]: 87: Hoare triple {11202#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:31,178 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:24:31,178 INFO L273 TraceCheckUtils]: 89: Hoare triple {11202#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:31,179 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:24:31,179 INFO L273 TraceCheckUtils]: 91: Hoare triple {11202#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:31,179 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:24:31,179 INFO L273 TraceCheckUtils]: 93: Hoare triple {11202#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:31,179 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:24:31,179 INFO L273 TraceCheckUtils]: 95: Hoare triple {11202#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:31,179 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:24:31,179 INFO L273 TraceCheckUtils]: 97: Hoare triple {11202#false} assume !(~i~2 < 99); {11202#false} is VALID [2018-11-23 12:24:31,179 INFO L273 TraceCheckUtils]: 98: Hoare triple {11202#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {11202#false} is VALID [2018-11-23 12:24:31,180 INFO L256 TraceCheckUtils]: 99: Hoare triple {11202#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {11201#true} is VALID [2018-11-23 12:24:31,180 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:24:31,180 INFO L273 TraceCheckUtils]: 101: Hoare triple {11201#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:24:31,180 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:24:31,180 INFO L273 TraceCheckUtils]: 103: Hoare triple {11201#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:24:31,180 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:24:31,180 INFO L273 TraceCheckUtils]: 105: Hoare triple {11201#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:24:31,180 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:24:31,180 INFO L273 TraceCheckUtils]: 107: Hoare triple {11201#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:24:31,181 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:24:31,181 INFO L273 TraceCheckUtils]: 109: Hoare triple {11201#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:24:31,181 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:24:31,181 INFO L273 TraceCheckUtils]: 111: Hoare triple {11201#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:24:31,181 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:24:31,181 INFO L273 TraceCheckUtils]: 113: Hoare triple {11201#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11201#true} is VALID [2018-11-23 12:24:31,181 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:24:31,181 INFO L273 TraceCheckUtils]: 115: Hoare triple {11201#true} assume !(~i~0 < 100); {11201#true} is VALID [2018-11-23 12:24:31,181 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:24:31,182 INFO L273 TraceCheckUtils]: 117: Hoare triple {11201#true} assume true; {11201#true} is VALID [2018-11-23 12:24:31,182 INFO L268 TraceCheckUtils]: 118: Hoare quadruple {11201#true} {11202#false} #74#return; {11202#false} is VALID [2018-11-23 12:24:31,182 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:24:31,182 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:24:31,182 INFO L273 TraceCheckUtils]: 121: Hoare triple {11202#false} assume !false; {11202#false} is VALID [2018-11-23 12:24:31,190 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:24:31,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:31,190 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:24:31,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:24:31,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:31,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:31,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:31,575 INFO L256 TraceCheckUtils]: 0: Hoare triple {11201#true} call ULTIMATE.init(); {11201#true} is VALID [2018-11-23 12:24:31,575 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:24:31,575 INFO L273 TraceCheckUtils]: 2: Hoare triple {11201#true} assume true; {11201#true} is VALID [2018-11-23 12:24:31,576 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11201#true} {11201#true} #66#return; {11201#true} is VALID [2018-11-23 12:24:31,576 INFO L256 TraceCheckUtils]: 4: Hoare triple {11201#true} call #t~ret13 := main(); {11201#true} is VALID [2018-11-23 12:24:31,576 INFO L273 TraceCheckUtils]: 5: Hoare triple {11201#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:24:31,577 INFO L273 TraceCheckUtils]: 6: Hoare triple {11241#(<= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:24:31,578 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:24:31,578 INFO L273 TraceCheckUtils]: 8: Hoare triple {11204#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:24:31,578 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:24:31,579 INFO L273 TraceCheckUtils]: 10: Hoare triple {11205#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:24:31,579 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:24:31,579 INFO L273 TraceCheckUtils]: 12: Hoare triple {11206#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -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:24:31,580 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:24:31,581 INFO L273 TraceCheckUtils]: 14: Hoare triple {11207#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -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:24:31,581 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:24:31,582 INFO L273 TraceCheckUtils]: 16: Hoare triple {11208#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -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:24:31,583 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:24:31,583 INFO L273 TraceCheckUtils]: 18: Hoare triple {11209#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -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:24:31,584 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:24:31,584 INFO L273 TraceCheckUtils]: 20: Hoare triple {11210#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -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:24:31,585 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:24:31,585 INFO L273 TraceCheckUtils]: 22: Hoare triple {11211#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -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:24:31,586 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:24:31,587 INFO L273 TraceCheckUtils]: 24: Hoare triple {11212#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -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:24:31,587 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:24:31,588 INFO L273 TraceCheckUtils]: 26: Hoare triple {11213#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -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:24:31,589 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:24:31,589 INFO L273 TraceCheckUtils]: 28: Hoare triple {11214#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -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:24:31,590 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:24:31,590 INFO L273 TraceCheckUtils]: 30: Hoare triple {11215#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -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:24:31,591 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:24:31,591 INFO L273 TraceCheckUtils]: 32: Hoare triple {11216#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -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:24:31,592 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:24:31,593 INFO L273 TraceCheckUtils]: 34: Hoare triple {11217#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -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:24:31,593 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:24:31,594 INFO L273 TraceCheckUtils]: 36: Hoare triple {11218#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -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:24:31,595 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:24:31,595 INFO L273 TraceCheckUtils]: 38: Hoare triple {11219#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -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:24:31,596 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:24:31,596 INFO L273 TraceCheckUtils]: 40: Hoare triple {11220#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -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:24:31,597 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:24:31,597 INFO L273 TraceCheckUtils]: 42: Hoare triple {11221#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -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:24:31,598 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:24:31,599 INFO L273 TraceCheckUtils]: 44: Hoare triple {11222#(<= main_~i~1 19)} assume !(~i~1 < 100); {11202#false} is VALID [2018-11-23 12:24:31,599 INFO L256 TraceCheckUtils]: 45: Hoare triple {11202#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {11202#false} is VALID [2018-11-23 12:24:31,599 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:24:31,599 INFO L273 TraceCheckUtils]: 47: Hoare triple {11202#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:24:31,600 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:24:31,600 INFO L273 TraceCheckUtils]: 49: Hoare triple {11202#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:24:31,600 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:24:31,600 INFO L273 TraceCheckUtils]: 51: Hoare triple {11202#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:24:31,600 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:24:31,600 INFO L273 TraceCheckUtils]: 53: Hoare triple {11202#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:24:31,601 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:24:31,601 INFO L273 TraceCheckUtils]: 55: Hoare triple {11202#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:24:31,601 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:24:31,601 INFO L273 TraceCheckUtils]: 57: Hoare triple {11202#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:24:31,601 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:24:31,601 INFO L273 TraceCheckUtils]: 59: Hoare triple {11202#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:24:31,602 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:24:31,602 INFO L273 TraceCheckUtils]: 61: Hoare triple {11202#false} assume !(~i~0 < 100); {11202#false} is VALID [2018-11-23 12:24:31,602 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:24:31,602 INFO L273 TraceCheckUtils]: 63: Hoare triple {11202#false} assume true; {11202#false} is VALID [2018-11-23 12:24:31,602 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {11202#false} {11202#false} #70#return; {11202#false} is VALID [2018-11-23 12:24:31,602 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:24:31,603 INFO L256 TraceCheckUtils]: 66: Hoare triple {11202#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {11202#false} is VALID [2018-11-23 12:24:31,603 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:24:31,603 INFO L273 TraceCheckUtils]: 68: Hoare triple {11202#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:24:31,603 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:24:31,603 INFO L273 TraceCheckUtils]: 70: Hoare triple {11202#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:24:31,603 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:24:31,603 INFO L273 TraceCheckUtils]: 72: Hoare triple {11202#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:24:31,603 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:24:31,603 INFO L273 TraceCheckUtils]: 74: Hoare triple {11202#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:24:31,604 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:24:31,604 INFO L273 TraceCheckUtils]: 76: Hoare triple {11202#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:24:31,604 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:24:31,604 INFO L273 TraceCheckUtils]: 78: Hoare triple {11202#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:24:31,604 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:24:31,604 INFO L273 TraceCheckUtils]: 80: Hoare triple {11202#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:24:31,604 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:24:31,604 INFO L273 TraceCheckUtils]: 82: Hoare triple {11202#false} assume !(~i~0 < 100); {11202#false} is VALID [2018-11-23 12:24:31,604 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:24:31,605 INFO L273 TraceCheckUtils]: 84: Hoare triple {11202#false} assume true; {11202#false} is VALID [2018-11-23 12:24:31,605 INFO L268 TraceCheckUtils]: 85: Hoare quadruple {11202#false} {11202#false} #72#return; {11202#false} is VALID [2018-11-23 12:24:31,605 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:24:31,605 INFO L273 TraceCheckUtils]: 87: Hoare triple {11202#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:31,605 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:24:31,605 INFO L273 TraceCheckUtils]: 89: Hoare triple {11202#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:31,605 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:24:31,605 INFO L273 TraceCheckUtils]: 91: Hoare triple {11202#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:31,605 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:24:31,606 INFO L273 TraceCheckUtils]: 93: Hoare triple {11202#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:31,606 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:24:31,606 INFO L273 TraceCheckUtils]: 95: Hoare triple {11202#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:31,606 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:24:31,606 INFO L273 TraceCheckUtils]: 97: Hoare triple {11202#false} assume !(~i~2 < 99); {11202#false} is VALID [2018-11-23 12:24:31,606 INFO L273 TraceCheckUtils]: 98: Hoare triple {11202#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {11202#false} is VALID [2018-11-23 12:24:31,606 INFO L256 TraceCheckUtils]: 99: Hoare triple {11202#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {11202#false} is VALID [2018-11-23 12:24:31,606 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:24:31,606 INFO L273 TraceCheckUtils]: 101: Hoare triple {11202#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:24:31,607 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:24:31,607 INFO L273 TraceCheckUtils]: 103: Hoare triple {11202#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:24:31,607 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:24:31,607 INFO L273 TraceCheckUtils]: 105: Hoare triple {11202#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:24:31,607 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:24:31,607 INFO L273 TraceCheckUtils]: 107: Hoare triple {11202#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:24:31,607 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:24:31,607 INFO L273 TraceCheckUtils]: 109: Hoare triple {11202#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:24:31,607 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:24:31,608 INFO L273 TraceCheckUtils]: 111: Hoare triple {11202#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:24:31,608 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:24:31,608 INFO L273 TraceCheckUtils]: 113: Hoare triple {11202#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {11202#false} is VALID [2018-11-23 12:24:31,608 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:24:31,608 INFO L273 TraceCheckUtils]: 115: Hoare triple {11202#false} assume !(~i~0 < 100); {11202#false} is VALID [2018-11-23 12:24:31,608 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:24:31,608 INFO L273 TraceCheckUtils]: 117: Hoare triple {11202#false} assume true; {11202#false} is VALID [2018-11-23 12:24:31,608 INFO L268 TraceCheckUtils]: 118: Hoare quadruple {11202#false} {11202#false} #74#return; {11202#false} is VALID [2018-11-23 12:24:31,608 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:24:31,609 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:24:31,609 INFO L273 TraceCheckUtils]: 121: Hoare triple {11202#false} assume !false; {11202#false} is VALID [2018-11-23 12:24:31,621 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:24:31,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:31,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-23 12:24:31,642 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 122 [2018-11-23 12:24:31,642 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:31,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 12:24:31,726 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:24:31,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 12:24:31,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 12:24:31,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:24:31,727 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 23 states. [2018-11-23 12:24:32,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:32,395 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-11-23 12:24:32,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 12:24:32,395 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 122 [2018-11-23 12:24:32,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:32,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:24:32,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 92 transitions. [2018-11-23 12:24:32,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:24:32,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 92 transitions. [2018-11-23 12:24:32,397 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 92 transitions. [2018-11-23 12:24:32,479 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:24:32,481 INFO L225 Difference]: With dead ends: 128 [2018-11-23 12:24:32,481 INFO L226 Difference]: Without dead ends: 88 [2018-11-23 12:24:32,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:24:32,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-23 12:24:32,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2018-11-23 12:24:32,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:32,513 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 87 states. [2018-11-23 12:24:32,513 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 87 states. [2018-11-23 12:24:32,513 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 87 states. [2018-11-23 12:24:32,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:32,515 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2018-11-23 12:24:32,515 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-11-23 12:24:32,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:32,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:32,516 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 88 states. [2018-11-23 12:24:32,516 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 88 states. [2018-11-23 12:24:32,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:32,517 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2018-11-23 12:24:32,517 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2018-11-23 12:24:32,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:32,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:32,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:32,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:32,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-23 12:24:32,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2018-11-23 12:24:32,520 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 122 [2018-11-23 12:24:32,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:32,520 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2018-11-23 12:24:32,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 12:24:32,520 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-11-23 12:24:32,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-23 12:24:32,521 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:32,521 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:24:32,522 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:32,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:32,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1211213925, now seen corresponding path program 20 times [2018-11-23 12:24:32,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:32,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:32,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:32,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:24:32,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:32,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:33,209 INFO L256 TraceCheckUtils]: 0: Hoare triple {12084#true} call ULTIMATE.init(); {12084#true} is VALID [2018-11-23 12:24:33,209 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:24:33,209 INFO L273 TraceCheckUtils]: 2: Hoare triple {12084#true} assume true; {12084#true} is VALID [2018-11-23 12:24:33,210 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12084#true} {12084#true} #66#return; {12084#true} is VALID [2018-11-23 12:24:33,210 INFO L256 TraceCheckUtils]: 4: Hoare triple {12084#true} call #t~ret13 := main(); {12084#true} is VALID [2018-11-23 12:24:33,210 INFO L273 TraceCheckUtils]: 5: Hoare triple {12084#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:24:33,210 INFO L273 TraceCheckUtils]: 6: Hoare triple {12086#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:24:33,211 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:24:33,211 INFO L273 TraceCheckUtils]: 8: Hoare triple {12087#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:24:33,212 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:24:33,212 INFO L273 TraceCheckUtils]: 10: Hoare triple {12088#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:24:33,212 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:24:33,213 INFO L273 TraceCheckUtils]: 12: Hoare triple {12089#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -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:24:33,214 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:24:33,214 INFO L273 TraceCheckUtils]: 14: Hoare triple {12090#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -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:24:33,215 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:24:33,215 INFO L273 TraceCheckUtils]: 16: Hoare triple {12091#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -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:24:33,216 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:24:33,217 INFO L273 TraceCheckUtils]: 18: Hoare triple {12092#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -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:24:33,217 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:24:33,218 INFO L273 TraceCheckUtils]: 20: Hoare triple {12093#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -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:24:33,218 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:24:33,219 INFO L273 TraceCheckUtils]: 22: Hoare triple {12094#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -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:24:33,220 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:24:33,220 INFO L273 TraceCheckUtils]: 24: Hoare triple {12095#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -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:24:33,221 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:24:33,221 INFO L273 TraceCheckUtils]: 26: Hoare triple {12096#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -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:24:33,222 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:24:33,223 INFO L273 TraceCheckUtils]: 28: Hoare triple {12097#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -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:24:33,223 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:24:33,224 INFO L273 TraceCheckUtils]: 30: Hoare triple {12098#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -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:24:33,224 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:24:33,225 INFO L273 TraceCheckUtils]: 32: Hoare triple {12099#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -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:24:33,226 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:24:33,226 INFO L273 TraceCheckUtils]: 34: Hoare triple {12100#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -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:24:33,227 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:24:33,227 INFO L273 TraceCheckUtils]: 36: Hoare triple {12101#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -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:24:33,228 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:24:33,229 INFO L273 TraceCheckUtils]: 38: Hoare triple {12102#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -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:24:33,229 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:24:33,230 INFO L273 TraceCheckUtils]: 40: Hoare triple {12103#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -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:24:33,230 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:24:33,231 INFO L273 TraceCheckUtils]: 42: Hoare triple {12104#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -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:24:33,232 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:24:33,232 INFO L273 TraceCheckUtils]: 44: Hoare triple {12105#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -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:24:33,233 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:24:33,233 INFO L273 TraceCheckUtils]: 46: Hoare triple {12106#(<= main_~i~1 20)} assume !(~i~1 < 100); {12085#false} is VALID [2018-11-23 12:24:33,234 INFO L256 TraceCheckUtils]: 47: Hoare triple {12085#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {12084#true} is VALID [2018-11-23 12:24:33,234 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:24:33,234 INFO L273 TraceCheckUtils]: 49: Hoare triple {12084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:24:33,234 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:24:33,234 INFO L273 TraceCheckUtils]: 51: Hoare triple {12084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:24:33,235 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:24:33,235 INFO L273 TraceCheckUtils]: 53: Hoare triple {12084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:24:33,235 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:24:33,235 INFO L273 TraceCheckUtils]: 55: Hoare triple {12084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:24:33,235 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:24:33,236 INFO L273 TraceCheckUtils]: 57: Hoare triple {12084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:24:33,236 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:24:33,236 INFO L273 TraceCheckUtils]: 59: Hoare triple {12084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:24:33,236 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:24:33,236 INFO L273 TraceCheckUtils]: 61: Hoare triple {12084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:24:33,236 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:24:33,236 INFO L273 TraceCheckUtils]: 63: Hoare triple {12084#true} assume !(~i~0 < 100); {12084#true} is VALID [2018-11-23 12:24:33,237 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:24:33,237 INFO L273 TraceCheckUtils]: 65: Hoare triple {12084#true} assume true; {12084#true} is VALID [2018-11-23 12:24:33,237 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {12084#true} {12085#false} #70#return; {12085#false} is VALID [2018-11-23 12:24:33,237 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:24:33,237 INFO L256 TraceCheckUtils]: 68: Hoare triple {12085#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {12084#true} is VALID [2018-11-23 12:24:33,237 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:24:33,237 INFO L273 TraceCheckUtils]: 70: Hoare triple {12084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:24:33,237 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:24:33,238 INFO L273 TraceCheckUtils]: 72: Hoare triple {12084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:24:33,238 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:24:33,238 INFO L273 TraceCheckUtils]: 74: Hoare triple {12084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:24:33,238 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:24:33,238 INFO L273 TraceCheckUtils]: 76: Hoare triple {12084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:24:33,238 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:24:33,238 INFO L273 TraceCheckUtils]: 78: Hoare triple {12084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:24:33,238 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:24:33,239 INFO L273 TraceCheckUtils]: 80: Hoare triple {12084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:24:33,239 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:24:33,239 INFO L273 TraceCheckUtils]: 82: Hoare triple {12084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:24:33,239 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:24:33,239 INFO L273 TraceCheckUtils]: 84: Hoare triple {12084#true} assume !(~i~0 < 100); {12084#true} is VALID [2018-11-23 12:24:33,239 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:24:33,240 INFO L273 TraceCheckUtils]: 86: Hoare triple {12084#true} assume true; {12084#true} is VALID [2018-11-23 12:24:33,240 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {12084#true} {12085#false} #72#return; {12085#false} is VALID [2018-11-23 12:24:33,240 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:24:33,240 INFO L273 TraceCheckUtils]: 89: Hoare triple {12085#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:33,240 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:24:33,241 INFO L273 TraceCheckUtils]: 91: Hoare triple {12085#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:33,241 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:24:33,241 INFO L273 TraceCheckUtils]: 93: Hoare triple {12085#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:33,241 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:24:33,241 INFO L273 TraceCheckUtils]: 95: Hoare triple {12085#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:33,241 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:24:33,242 INFO L273 TraceCheckUtils]: 97: Hoare triple {12085#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:33,242 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:24:33,242 INFO L273 TraceCheckUtils]: 99: Hoare triple {12085#false} assume !(~i~2 < 99); {12085#false} is VALID [2018-11-23 12:24:33,242 INFO L273 TraceCheckUtils]: 100: Hoare triple {12085#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {12085#false} is VALID [2018-11-23 12:24:33,242 INFO L256 TraceCheckUtils]: 101: Hoare triple {12085#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {12084#true} is VALID [2018-11-23 12:24:33,242 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:24:33,243 INFO L273 TraceCheckUtils]: 103: Hoare triple {12084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:24:33,243 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:24:33,243 INFO L273 TraceCheckUtils]: 105: Hoare triple {12084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:24:33,243 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:24:33,243 INFO L273 TraceCheckUtils]: 107: Hoare triple {12084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:24:33,243 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:24:33,244 INFO L273 TraceCheckUtils]: 109: Hoare triple {12084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:24:33,244 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:24:33,244 INFO L273 TraceCheckUtils]: 111: Hoare triple {12084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:24:33,244 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:24:33,244 INFO L273 TraceCheckUtils]: 113: Hoare triple {12084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:24:33,245 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:24:33,245 INFO L273 TraceCheckUtils]: 115: Hoare triple {12084#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12084#true} is VALID [2018-11-23 12:24:33,245 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:24:33,245 INFO L273 TraceCheckUtils]: 117: Hoare triple {12084#true} assume !(~i~0 < 100); {12084#true} is VALID [2018-11-23 12:24:33,245 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:24:33,245 INFO L273 TraceCheckUtils]: 119: Hoare triple {12084#true} assume true; {12084#true} is VALID [2018-11-23 12:24:33,245 INFO L268 TraceCheckUtils]: 120: Hoare quadruple {12084#true} {12085#false} #74#return; {12085#false} is VALID [2018-11-23 12:24:33,246 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:24:33,246 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:24:33,246 INFO L273 TraceCheckUtils]: 123: Hoare triple {12085#false} assume !false; {12085#false} is VALID [2018-11-23 12:24:33,255 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:24:33,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:33,255 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:24:33,272 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:24:33,323 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:24:33,323 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:24:33,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:33,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:33,549 INFO L256 TraceCheckUtils]: 0: Hoare triple {12084#true} call ULTIMATE.init(); {12084#true} is VALID [2018-11-23 12:24:33,550 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:24:33,550 INFO L273 TraceCheckUtils]: 2: Hoare triple {12084#true} assume true; {12084#true} is VALID [2018-11-23 12:24:33,550 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12084#true} {12084#true} #66#return; {12084#true} is VALID [2018-11-23 12:24:33,550 INFO L256 TraceCheckUtils]: 4: Hoare triple {12084#true} call #t~ret13 := main(); {12084#true} is VALID [2018-11-23 12:24:33,551 INFO L273 TraceCheckUtils]: 5: Hoare triple {12084#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:24:33,551 INFO L273 TraceCheckUtils]: 6: Hoare triple {12125#(<= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:24:33,552 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:24:33,552 INFO L273 TraceCheckUtils]: 8: Hoare triple {12087#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:24:33,553 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:24:33,553 INFO L273 TraceCheckUtils]: 10: Hoare triple {12088#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:24:33,554 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:24:33,554 INFO L273 TraceCheckUtils]: 12: Hoare triple {12089#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -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:24:33,555 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:24:33,555 INFO L273 TraceCheckUtils]: 14: Hoare triple {12090#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -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:24:33,556 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:24:33,556 INFO L273 TraceCheckUtils]: 16: Hoare triple {12091#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -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:24:33,557 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:24:33,558 INFO L273 TraceCheckUtils]: 18: Hoare triple {12092#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -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:24:33,558 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:24:33,559 INFO L273 TraceCheckUtils]: 20: Hoare triple {12093#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -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:24:33,559 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:24:33,560 INFO L273 TraceCheckUtils]: 22: Hoare triple {12094#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -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:24:33,561 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:24:33,561 INFO L273 TraceCheckUtils]: 24: Hoare triple {12095#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -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:24:33,562 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:24:33,562 INFO L273 TraceCheckUtils]: 26: Hoare triple {12096#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -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:24:33,563 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:24:33,564 INFO L273 TraceCheckUtils]: 28: Hoare triple {12097#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -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:24:33,564 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:24:33,565 INFO L273 TraceCheckUtils]: 30: Hoare triple {12098#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -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:24:33,565 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:24:33,566 INFO L273 TraceCheckUtils]: 32: Hoare triple {12099#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -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:24:33,567 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:24:33,567 INFO L273 TraceCheckUtils]: 34: Hoare triple {12100#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -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:24:33,568 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:24:33,568 INFO L273 TraceCheckUtils]: 36: Hoare triple {12101#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -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:24:33,569 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:24:33,569 INFO L273 TraceCheckUtils]: 38: Hoare triple {12102#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -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:24:33,570 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:24:33,571 INFO L273 TraceCheckUtils]: 40: Hoare triple {12103#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -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:24:33,571 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:24:33,572 INFO L273 TraceCheckUtils]: 42: Hoare triple {12104#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -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:24:33,573 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:24:33,573 INFO L273 TraceCheckUtils]: 44: Hoare triple {12105#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -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:24:33,574 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:24:33,574 INFO L273 TraceCheckUtils]: 46: Hoare triple {12106#(<= main_~i~1 20)} assume !(~i~1 < 100); {12085#false} is VALID [2018-11-23 12:24:33,575 INFO L256 TraceCheckUtils]: 47: Hoare triple {12085#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {12085#false} is VALID [2018-11-23 12:24:33,575 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:24:33,575 INFO L273 TraceCheckUtils]: 49: Hoare triple {12085#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:24:33,575 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:24:33,575 INFO L273 TraceCheckUtils]: 51: Hoare triple {12085#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:24:33,575 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:24:33,576 INFO L273 TraceCheckUtils]: 53: Hoare triple {12085#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:24:33,576 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:24:33,576 INFO L273 TraceCheckUtils]: 55: Hoare triple {12085#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:24:33,576 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:24:33,576 INFO L273 TraceCheckUtils]: 57: Hoare triple {12085#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:24:33,577 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:24:33,577 INFO L273 TraceCheckUtils]: 59: Hoare triple {12085#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:24:33,577 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:24:33,577 INFO L273 TraceCheckUtils]: 61: Hoare triple {12085#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:24:33,577 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:24:33,577 INFO L273 TraceCheckUtils]: 63: Hoare triple {12085#false} assume !(~i~0 < 100); {12085#false} is VALID [2018-11-23 12:24:33,578 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:24:33,578 INFO L273 TraceCheckUtils]: 65: Hoare triple {12085#false} assume true; {12085#false} is VALID [2018-11-23 12:24:33,578 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {12085#false} {12085#false} #70#return; {12085#false} is VALID [2018-11-23 12:24:33,578 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:24:33,578 INFO L256 TraceCheckUtils]: 68: Hoare triple {12085#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {12085#false} is VALID [2018-11-23 12:24:33,579 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:24:33,579 INFO L273 TraceCheckUtils]: 70: Hoare triple {12085#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:24:33,579 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:24:33,579 INFO L273 TraceCheckUtils]: 72: Hoare triple {12085#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:24:33,579 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:24:33,579 INFO L273 TraceCheckUtils]: 74: Hoare triple {12085#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:24:33,580 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:24:33,580 INFO L273 TraceCheckUtils]: 76: Hoare triple {12085#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:24:33,580 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:24:33,580 INFO L273 TraceCheckUtils]: 78: Hoare triple {12085#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:24:33,580 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:24:33,580 INFO L273 TraceCheckUtils]: 80: Hoare triple {12085#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:24:33,580 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:24:33,581 INFO L273 TraceCheckUtils]: 82: Hoare triple {12085#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:24:33,581 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:24:33,581 INFO L273 TraceCheckUtils]: 84: Hoare triple {12085#false} assume !(~i~0 < 100); {12085#false} is VALID [2018-11-23 12:24:33,581 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:24:33,581 INFO L273 TraceCheckUtils]: 86: Hoare triple {12085#false} assume true; {12085#false} is VALID [2018-11-23 12:24:33,581 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {12085#false} {12085#false} #72#return; {12085#false} is VALID [2018-11-23 12:24:33,581 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:24:33,581 INFO L273 TraceCheckUtils]: 89: Hoare triple {12085#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:33,581 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:24:33,582 INFO L273 TraceCheckUtils]: 91: Hoare triple {12085#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:33,582 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:24:33,582 INFO L273 TraceCheckUtils]: 93: Hoare triple {12085#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:33,582 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:24:33,582 INFO L273 TraceCheckUtils]: 95: Hoare triple {12085#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:33,582 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:24:33,582 INFO L273 TraceCheckUtils]: 97: Hoare triple {12085#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:33,582 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:24:33,582 INFO L273 TraceCheckUtils]: 99: Hoare triple {12085#false} assume !(~i~2 < 99); {12085#false} is VALID [2018-11-23 12:24:33,583 INFO L273 TraceCheckUtils]: 100: Hoare triple {12085#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {12085#false} is VALID [2018-11-23 12:24:33,583 INFO L256 TraceCheckUtils]: 101: Hoare triple {12085#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {12085#false} is VALID [2018-11-23 12:24:33,583 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:24:33,583 INFO L273 TraceCheckUtils]: 103: Hoare triple {12085#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:24:33,583 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:24:33,583 INFO L273 TraceCheckUtils]: 105: Hoare triple {12085#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:24:33,583 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:24:33,583 INFO L273 TraceCheckUtils]: 107: Hoare triple {12085#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:24:33,583 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:24:33,584 INFO L273 TraceCheckUtils]: 109: Hoare triple {12085#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:24:33,584 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:24:33,584 INFO L273 TraceCheckUtils]: 111: Hoare triple {12085#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:24:33,584 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:24:33,584 INFO L273 TraceCheckUtils]: 113: Hoare triple {12085#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:24:33,584 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:24:33,584 INFO L273 TraceCheckUtils]: 115: Hoare triple {12085#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12085#false} is VALID [2018-11-23 12:24:33,584 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:24:33,584 INFO L273 TraceCheckUtils]: 117: Hoare triple {12085#false} assume !(~i~0 < 100); {12085#false} is VALID [2018-11-23 12:24:33,585 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:24:33,585 INFO L273 TraceCheckUtils]: 119: Hoare triple {12085#false} assume true; {12085#false} is VALID [2018-11-23 12:24:33,585 INFO L268 TraceCheckUtils]: 120: Hoare quadruple {12085#false} {12085#false} #74#return; {12085#false} is VALID [2018-11-23 12:24:33,585 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:24:33,585 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:24:33,585 INFO L273 TraceCheckUtils]: 123: Hoare triple {12085#false} assume !false; {12085#false} is VALID [2018-11-23 12:24:33,592 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:24:33,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:33,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-23 12:24:33,611 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 124 [2018-11-23 12:24:33,612 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:33,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 12:24:33,713 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:24:33,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 12:24:33,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 12:24:33,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:24:33,714 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 24 states. [2018-11-23 12:24:34,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:34,241 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2018-11-23 12:24:34,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 12:24:34,241 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 124 [2018-11-23 12:24:34,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:34,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:24:34,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 94 transitions. [2018-11-23 12:24:34,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:24:34,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 94 transitions. [2018-11-23 12:24:34,243 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 94 transitions. [2018-11-23 12:24:34,374 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:24:34,377 INFO L225 Difference]: With dead ends: 130 [2018-11-23 12:24:34,377 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 12:24:34,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:24:34,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 12:24:34,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-11-23 12:24:34,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:34,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 89 states. [2018-11-23 12:24:34,408 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 89 states. [2018-11-23 12:24:34,408 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 89 states. [2018-11-23 12:24:34,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:34,410 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-11-23 12:24:34,410 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-11-23 12:24:34,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:34,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:34,411 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 90 states. [2018-11-23 12:24:34,411 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 90 states. [2018-11-23 12:24:34,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:34,413 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-11-23 12:24:34,413 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-11-23 12:24:34,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:34,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:34,414 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:34,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:34,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-23 12:24:34,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-11-23 12:24:34,416 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 124 [2018-11-23 12:24:34,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:34,416 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-11-23 12:24:34,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 12:24:34,416 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-11-23 12:24:34,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-23 12:24:34,417 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:34,417 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:24:34,417 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:34,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:34,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1742217987, now seen corresponding path program 21 times [2018-11-23 12:24:34,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:34,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:34,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:34,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:24:34,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:34,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:34,923 INFO L256 TraceCheckUtils]: 0: Hoare triple {12984#true} call ULTIMATE.init(); {12984#true} is VALID [2018-11-23 12:24:34,924 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:24:34,924 INFO L273 TraceCheckUtils]: 2: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:24:34,924 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12984#true} {12984#true} #66#return; {12984#true} is VALID [2018-11-23 12:24:34,924 INFO L256 TraceCheckUtils]: 4: Hoare triple {12984#true} call #t~ret13 := main(); {12984#true} is VALID [2018-11-23 12:24:34,925 INFO L273 TraceCheckUtils]: 5: Hoare triple {12984#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:24:34,925 INFO L273 TraceCheckUtils]: 6: Hoare triple {12986#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:24:34,926 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:24:34,926 INFO L273 TraceCheckUtils]: 8: Hoare triple {12987#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:24:34,927 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:24:34,927 INFO L273 TraceCheckUtils]: 10: Hoare triple {12988#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:24:34,927 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:24:34,928 INFO L273 TraceCheckUtils]: 12: Hoare triple {12989#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -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:24:34,928 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:24:34,929 INFO L273 TraceCheckUtils]: 14: Hoare triple {12990#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -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:24:34,930 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:24:34,930 INFO L273 TraceCheckUtils]: 16: Hoare triple {12991#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -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:24:34,931 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:24:34,931 INFO L273 TraceCheckUtils]: 18: Hoare triple {12992#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -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:24:34,932 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:24:34,932 INFO L273 TraceCheckUtils]: 20: Hoare triple {12993#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -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:24:34,933 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:24:34,934 INFO L273 TraceCheckUtils]: 22: Hoare triple {12994#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -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:24:34,934 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:24:34,935 INFO L273 TraceCheckUtils]: 24: Hoare triple {12995#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -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:24:34,935 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:24:34,936 INFO L273 TraceCheckUtils]: 26: Hoare triple {12996#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -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:24:34,937 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:24:34,937 INFO L273 TraceCheckUtils]: 28: Hoare triple {12997#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -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:24:34,938 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:24:34,938 INFO L273 TraceCheckUtils]: 30: Hoare triple {12998#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -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:24:34,939 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:24:34,940 INFO L273 TraceCheckUtils]: 32: Hoare triple {12999#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -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:24:34,940 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:24:34,941 INFO L273 TraceCheckUtils]: 34: Hoare triple {13000#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -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:24:34,941 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:24:34,942 INFO L273 TraceCheckUtils]: 36: Hoare triple {13001#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -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:24:34,943 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:24:34,943 INFO L273 TraceCheckUtils]: 38: Hoare triple {13002#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -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:24:34,944 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:24:34,944 INFO L273 TraceCheckUtils]: 40: Hoare triple {13003#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -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:24:34,945 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:24:34,945 INFO L273 TraceCheckUtils]: 42: Hoare triple {13004#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -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:24:34,964 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:24:34,973 INFO L273 TraceCheckUtils]: 44: Hoare triple {13005#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -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:24:34,986 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:24:34,995 INFO L273 TraceCheckUtils]: 46: Hoare triple {13006#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -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:24:35,008 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:24:35,017 INFO L273 TraceCheckUtils]: 48: Hoare triple {13007#(<= main_~i~1 21)} assume !(~i~1 < 100); {12985#false} is VALID [2018-11-23 12:24:35,017 INFO L256 TraceCheckUtils]: 49: Hoare triple {12985#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {12984#true} is VALID [2018-11-23 12:24:35,017 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:24:35,017 INFO L273 TraceCheckUtils]: 51: Hoare triple {12984#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:24:35,017 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:24:35,018 INFO L273 TraceCheckUtils]: 53: Hoare triple {12984#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:24:35,018 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:24:35,018 INFO L273 TraceCheckUtils]: 55: Hoare triple {12984#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:24:35,018 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:24:35,018 INFO L273 TraceCheckUtils]: 57: Hoare triple {12984#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:24:35,018 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:24:35,019 INFO L273 TraceCheckUtils]: 59: Hoare triple {12984#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:24:35,019 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:24:35,019 INFO L273 TraceCheckUtils]: 61: Hoare triple {12984#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:24:35,019 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:24:35,019 INFO L273 TraceCheckUtils]: 63: Hoare triple {12984#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:24:35,019 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:24:35,020 INFO L273 TraceCheckUtils]: 65: Hoare triple {12984#true} assume !(~i~0 < 100); {12984#true} is VALID [2018-11-23 12:24:35,020 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:24:35,020 INFO L273 TraceCheckUtils]: 67: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:24:35,020 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {12984#true} {12985#false} #70#return; {12985#false} is VALID [2018-11-23 12:24:35,020 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:24:35,020 INFO L256 TraceCheckUtils]: 70: Hoare triple {12985#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {12984#true} is VALID [2018-11-23 12:24:35,021 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:24:35,021 INFO L273 TraceCheckUtils]: 72: Hoare triple {12984#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:24:35,021 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:24:35,021 INFO L273 TraceCheckUtils]: 74: Hoare triple {12984#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:24:35,021 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:24:35,021 INFO L273 TraceCheckUtils]: 76: Hoare triple {12984#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:24:35,022 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:24:35,022 INFO L273 TraceCheckUtils]: 78: Hoare triple {12984#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:24:35,022 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:24:35,022 INFO L273 TraceCheckUtils]: 80: Hoare triple {12984#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:24:35,022 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:24:35,022 INFO L273 TraceCheckUtils]: 82: Hoare triple {12984#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:24:35,022 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:24:35,023 INFO L273 TraceCheckUtils]: 84: Hoare triple {12984#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:24:35,023 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:24:35,023 INFO L273 TraceCheckUtils]: 86: Hoare triple {12984#true} assume !(~i~0 < 100); {12984#true} is VALID [2018-11-23 12:24:35,023 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:24:35,023 INFO L273 TraceCheckUtils]: 88: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:24:35,023 INFO L268 TraceCheckUtils]: 89: Hoare quadruple {12984#true} {12985#false} #72#return; {12985#false} is VALID [2018-11-23 12:24:35,024 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:24:35,024 INFO L273 TraceCheckUtils]: 91: Hoare triple {12985#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:35,024 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:24:35,024 INFO L273 TraceCheckUtils]: 93: Hoare triple {12985#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:35,024 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:24:35,024 INFO L273 TraceCheckUtils]: 95: Hoare triple {12985#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:35,025 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:24:35,025 INFO L273 TraceCheckUtils]: 97: Hoare triple {12985#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:35,025 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:24:35,025 INFO L273 TraceCheckUtils]: 99: Hoare triple {12985#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:35,025 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:24:35,025 INFO L273 TraceCheckUtils]: 101: Hoare triple {12985#false} assume !(~i~2 < 99); {12985#false} is VALID [2018-11-23 12:24:35,026 INFO L273 TraceCheckUtils]: 102: Hoare triple {12985#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {12985#false} is VALID [2018-11-23 12:24:35,026 INFO L256 TraceCheckUtils]: 103: Hoare triple {12985#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {12984#true} is VALID [2018-11-23 12:24:35,026 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:24:35,026 INFO L273 TraceCheckUtils]: 105: Hoare triple {12984#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:24:35,026 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:24:35,026 INFO L273 TraceCheckUtils]: 107: Hoare triple {12984#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:24:35,026 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:24:35,027 INFO L273 TraceCheckUtils]: 109: Hoare triple {12984#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:24:35,027 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:24:35,027 INFO L273 TraceCheckUtils]: 111: Hoare triple {12984#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:24:35,027 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:24:35,027 INFO L273 TraceCheckUtils]: 113: Hoare triple {12984#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:24:35,027 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:24:35,028 INFO L273 TraceCheckUtils]: 115: Hoare triple {12984#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:24:35,028 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:24:35,028 INFO L273 TraceCheckUtils]: 117: Hoare triple {12984#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:24:35,028 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:24:35,028 INFO L273 TraceCheckUtils]: 119: Hoare triple {12984#true} assume !(~i~0 < 100); {12984#true} is VALID [2018-11-23 12:24:35,028 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:24:35,028 INFO L273 TraceCheckUtils]: 121: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:24:35,029 INFO L268 TraceCheckUtils]: 122: Hoare quadruple {12984#true} {12985#false} #74#return; {12985#false} is VALID [2018-11-23 12:24:35,029 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:24:35,029 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:24:35,029 INFO L273 TraceCheckUtils]: 125: Hoare triple {12985#false} assume !false; {12985#false} is VALID [2018-11-23 12:24:35,039 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:24:35,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:35,040 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:24:35,059 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:24:35,218 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-23 12:24:35,218 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:24:35,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:35,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:35,446 INFO L256 TraceCheckUtils]: 0: Hoare triple {12984#true} call ULTIMATE.init(); {12984#true} is VALID [2018-11-23 12:24:35,446 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:24:35,447 INFO L273 TraceCheckUtils]: 2: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:24:35,447 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12984#true} {12984#true} #66#return; {12984#true} is VALID [2018-11-23 12:24:35,447 INFO L256 TraceCheckUtils]: 4: Hoare triple {12984#true} call #t~ret13 := main(); {12984#true} is VALID [2018-11-23 12:24:35,447 INFO L273 TraceCheckUtils]: 5: Hoare triple {12984#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {12984#true} is VALID [2018-11-23 12:24:35,447 INFO L273 TraceCheckUtils]: 6: Hoare triple {12984#true} assume !!(~i~1 < 100);assume -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:24:35,447 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:24:35,448 INFO L273 TraceCheckUtils]: 8: Hoare triple {12984#true} assume !!(~i~1 < 100);assume -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:24:35,448 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:24:35,448 INFO L273 TraceCheckUtils]: 10: Hoare triple {12984#true} assume !!(~i~1 < 100);assume -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:24:35,448 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:24:35,448 INFO L273 TraceCheckUtils]: 12: Hoare triple {12984#true} assume !!(~i~1 < 100);assume -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:24:35,449 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:24:35,449 INFO L273 TraceCheckUtils]: 14: Hoare triple {12984#true} assume !!(~i~1 < 100);assume -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:24:35,449 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:24:35,449 INFO L273 TraceCheckUtils]: 16: Hoare triple {12984#true} assume !!(~i~1 < 100);assume -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:24:35,449 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:24:35,449 INFO L273 TraceCheckUtils]: 18: Hoare triple {12984#true} assume !!(~i~1 < 100);assume -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:24:35,449 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:24:35,449 INFO L273 TraceCheckUtils]: 20: Hoare triple {12984#true} assume !!(~i~1 < 100);assume -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:24:35,449 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:24:35,450 INFO L273 TraceCheckUtils]: 22: Hoare triple {12984#true} assume !!(~i~1 < 100);assume -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:24:35,450 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:24:35,450 INFO L273 TraceCheckUtils]: 24: Hoare triple {12984#true} assume !!(~i~1 < 100);assume -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:24:35,450 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:24:35,450 INFO L273 TraceCheckUtils]: 26: Hoare triple {12984#true} assume !!(~i~1 < 100);assume -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:24:35,450 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:24:35,450 INFO L273 TraceCheckUtils]: 28: Hoare triple {12984#true} assume !!(~i~1 < 100);assume -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:24:35,450 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:24:35,450 INFO L273 TraceCheckUtils]: 30: Hoare triple {12984#true} assume !!(~i~1 < 100);assume -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:24:35,451 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:24:35,453 INFO L273 TraceCheckUtils]: 32: Hoare triple {12984#true} assume !!(~i~1 < 100);assume -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:24:35,453 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:24:35,453 INFO L273 TraceCheckUtils]: 34: Hoare triple {12984#true} assume !!(~i~1 < 100);assume -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:24:35,453 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:24:35,453 INFO L273 TraceCheckUtils]: 36: Hoare triple {12984#true} assume !!(~i~1 < 100);assume -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:24:35,453 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:24:35,454 INFO L273 TraceCheckUtils]: 38: Hoare triple {12984#true} assume !!(~i~1 < 100);assume -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:24:35,454 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:24:35,454 INFO L273 TraceCheckUtils]: 40: Hoare triple {12984#true} assume !!(~i~1 < 100);assume -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:24:35,454 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:24:35,454 INFO L273 TraceCheckUtils]: 42: Hoare triple {12984#true} assume !!(~i~1 < 100);assume -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:24:35,454 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:24:35,454 INFO L273 TraceCheckUtils]: 44: Hoare triple {12984#true} assume !!(~i~1 < 100);assume -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:24:35,454 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:24:35,454 INFO L273 TraceCheckUtils]: 46: Hoare triple {12984#true} assume !!(~i~1 < 100);assume -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:24:35,454 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:24:35,455 INFO L273 TraceCheckUtils]: 48: Hoare triple {12984#true} assume !(~i~1 < 100); {12984#true} is VALID [2018-11-23 12:24:35,455 INFO L256 TraceCheckUtils]: 49: Hoare triple {12984#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {12984#true} is VALID [2018-11-23 12:24:35,455 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:24:35,455 INFO L273 TraceCheckUtils]: 51: Hoare triple {12984#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:24:35,455 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:24:35,455 INFO L273 TraceCheckUtils]: 53: Hoare triple {12984#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:24:35,455 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:24:35,455 INFO L273 TraceCheckUtils]: 55: Hoare triple {12984#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:24:35,456 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:24:35,456 INFO L273 TraceCheckUtils]: 57: Hoare triple {12984#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:24:35,456 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:24:35,456 INFO L273 TraceCheckUtils]: 59: Hoare triple {12984#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:24:35,456 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:24:35,456 INFO L273 TraceCheckUtils]: 61: Hoare triple {12984#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:24:35,457 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:24:35,457 INFO L273 TraceCheckUtils]: 63: Hoare triple {12984#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:24:35,457 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:24:35,457 INFO L273 TraceCheckUtils]: 65: Hoare triple {12984#true} assume !(~i~0 < 100); {12984#true} is VALID [2018-11-23 12:24:35,457 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:24:35,457 INFO L273 TraceCheckUtils]: 67: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:24:35,457 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {12984#true} {12984#true} #70#return; {12984#true} is VALID [2018-11-23 12:24:35,458 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:24:35,458 INFO L256 TraceCheckUtils]: 70: Hoare triple {12984#true} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {12984#true} is VALID [2018-11-23 12:24:35,458 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:24:35,458 INFO L273 TraceCheckUtils]: 72: Hoare triple {12984#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:24:35,458 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:24:35,458 INFO L273 TraceCheckUtils]: 74: Hoare triple {12984#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:24:35,459 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:24:35,459 INFO L273 TraceCheckUtils]: 76: Hoare triple {12984#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:24:35,459 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:24:35,459 INFO L273 TraceCheckUtils]: 78: Hoare triple {12984#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:24:35,459 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:24:35,459 INFO L273 TraceCheckUtils]: 80: Hoare triple {12984#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:24:35,460 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:24:35,460 INFO L273 TraceCheckUtils]: 82: Hoare triple {12984#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:24:35,460 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:24:35,460 INFO L273 TraceCheckUtils]: 84: Hoare triple {12984#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12984#true} is VALID [2018-11-23 12:24:35,460 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:24:35,460 INFO L273 TraceCheckUtils]: 86: Hoare triple {12984#true} assume !(~i~0 < 100); {12984#true} is VALID [2018-11-23 12:24:35,460 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:24:35,461 INFO L273 TraceCheckUtils]: 88: Hoare triple {12984#true} assume true; {12984#true} is VALID [2018-11-23 12:24:35,461 INFO L268 TraceCheckUtils]: 89: Hoare quadruple {12984#true} {12984#true} #72#return; {12984#true} is VALID [2018-11-23 12:24:35,469 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:24:35,470 INFO L273 TraceCheckUtils]: 91: Hoare triple {13281#(<= main_~i~2 0)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:35,470 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:24:35,470 INFO L273 TraceCheckUtils]: 93: Hoare triple {13288#(<= main_~i~2 1)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:35,471 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:24:35,471 INFO L273 TraceCheckUtils]: 95: Hoare triple {13295#(<= main_~i~2 2)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:35,472 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:24:35,472 INFO L273 TraceCheckUtils]: 97: Hoare triple {13302#(<= main_~i~2 3)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:35,472 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:24:35,473 INFO L273 TraceCheckUtils]: 99: Hoare triple {13309#(<= main_~i~2 4)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:35,473 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:24:35,474 INFO L273 TraceCheckUtils]: 101: Hoare triple {13316#(<= main_~i~2 5)} assume !(~i~2 < 99); {12985#false} is VALID [2018-11-23 12:24:35,474 INFO L273 TraceCheckUtils]: 102: Hoare triple {12985#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {12985#false} is VALID [2018-11-23 12:24:35,474 INFO L256 TraceCheckUtils]: 103: Hoare triple {12985#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {12985#false} is VALID [2018-11-23 12:24:35,475 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:24:35,475 INFO L273 TraceCheckUtils]: 105: Hoare triple {12985#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12985#false} is VALID [2018-11-23 12:24:35,475 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:24:35,475 INFO L273 TraceCheckUtils]: 107: Hoare triple {12985#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12985#false} is VALID [2018-11-23 12:24:35,475 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:24:35,476 INFO L273 TraceCheckUtils]: 109: Hoare triple {12985#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12985#false} is VALID [2018-11-23 12:24:35,476 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:24:35,476 INFO L273 TraceCheckUtils]: 111: Hoare triple {12985#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12985#false} is VALID [2018-11-23 12:24:35,476 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:24:35,476 INFO L273 TraceCheckUtils]: 113: Hoare triple {12985#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12985#false} is VALID [2018-11-23 12:24:35,476 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:24:35,477 INFO L273 TraceCheckUtils]: 115: Hoare triple {12985#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12985#false} is VALID [2018-11-23 12:24:35,477 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:24:35,477 INFO L273 TraceCheckUtils]: 117: Hoare triple {12985#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {12985#false} is VALID [2018-11-23 12:24:35,477 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:24:35,477 INFO L273 TraceCheckUtils]: 119: Hoare triple {12985#false} assume !(~i~0 < 100); {12985#false} is VALID [2018-11-23 12:24:35,477 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:24:35,477 INFO L273 TraceCheckUtils]: 121: Hoare triple {12985#false} assume true; {12985#false} is VALID [2018-11-23 12:24:35,477 INFO L268 TraceCheckUtils]: 122: Hoare quadruple {12985#false} {12985#false} #74#return; {12985#false} is VALID [2018-11-23 12:24:35,477 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:24:35,478 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:24:35,478 INFO L273 TraceCheckUtils]: 125: Hoare triple {12985#false} assume !false; {12985#false} is VALID [2018-11-23 12:24:35,484 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:24:35,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:35,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 8] total 30 [2018-11-23 12:24:35,503 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 126 [2018-11-23 12:24:35,503 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:35,503 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 12:24:35,603 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:24:35,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 12:24:35,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 12:24:35,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=567, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:24:35,605 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 30 states. [2018-11-23 12:24:36,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:36,168 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2018-11-23 12:24:36,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 12:24:36,168 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 126 [2018-11-23 12:24:36,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:36,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:24:36,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 109 transitions. [2018-11-23 12:24:36,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:24:36,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 109 transitions. [2018-11-23 12:24:36,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 109 transitions. [2018-11-23 12:24:36,283 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:24:36,284 INFO L225 Difference]: With dead ends: 135 [2018-11-23 12:24:36,285 INFO L226 Difference]: Without dead ends: 95 [2018-11-23 12:24:36,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=303, Invalid=567, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:24:36,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-23 12:24:36,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2018-11-23 12:24:36,330 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:36,330 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 93 states. [2018-11-23 12:24:36,330 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 93 states. [2018-11-23 12:24:36,331 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 93 states. [2018-11-23 12:24:36,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:36,332 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2018-11-23 12:24:36,332 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-11-23 12:24:36,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:36,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:36,333 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 95 states. [2018-11-23 12:24:36,333 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 95 states. [2018-11-23 12:24:36,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:36,334 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2018-11-23 12:24:36,334 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-11-23 12:24:36,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:36,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:36,335 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:36,335 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:36,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-23 12:24:36,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2018-11-23 12:24:36,337 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 126 [2018-11-23 12:24:36,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:36,337 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2018-11-23 12:24:36,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 12:24:36,337 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2018-11-23 12:24:36,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-23 12:24:36,338 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:36,338 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:24:36,339 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:36,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:36,339 INFO L82 PathProgramCache]: Analyzing trace with hash -2078845859, now seen corresponding path program 22 times [2018-11-23 12:24:36,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:36,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:36,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:36,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:24:36,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:36,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:36,868 INFO L256 TraceCheckUtils]: 0: Hoare triple {13919#true} call ULTIMATE.init(); {13919#true} is VALID [2018-11-23 12:24:36,869 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:24:36,869 INFO L273 TraceCheckUtils]: 2: Hoare triple {13919#true} assume true; {13919#true} is VALID [2018-11-23 12:24:36,869 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13919#true} {13919#true} #66#return; {13919#true} is VALID [2018-11-23 12:24:36,869 INFO L256 TraceCheckUtils]: 4: Hoare triple {13919#true} call #t~ret13 := main(); {13919#true} is VALID [2018-11-23 12:24:36,870 INFO L273 TraceCheckUtils]: 5: Hoare triple {13919#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:24:36,870 INFO L273 TraceCheckUtils]: 6: Hoare triple {13921#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:24:36,871 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:24:36,871 INFO L273 TraceCheckUtils]: 8: Hoare triple {13922#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:24:36,872 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:24:36,872 INFO L273 TraceCheckUtils]: 10: Hoare triple {13923#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:24:36,873 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:24:36,873 INFO L273 TraceCheckUtils]: 12: Hoare triple {13924#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -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:24:36,874 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:24:36,878 INFO L273 TraceCheckUtils]: 14: Hoare triple {13925#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -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:24:36,878 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:24:36,879 INFO L273 TraceCheckUtils]: 16: Hoare triple {13926#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -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:24:36,879 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:24:36,879 INFO L273 TraceCheckUtils]: 18: Hoare triple {13927#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -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:24:36,880 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:24:36,880 INFO L273 TraceCheckUtils]: 20: Hoare triple {13928#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -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:24:36,881 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:24:36,881 INFO L273 TraceCheckUtils]: 22: Hoare triple {13929#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -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:24:36,881 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:24:36,882 INFO L273 TraceCheckUtils]: 24: Hoare triple {13930#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -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:24:36,883 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:24:36,883 INFO L273 TraceCheckUtils]: 26: Hoare triple {13931#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -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:24:36,884 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:24:36,884 INFO L273 TraceCheckUtils]: 28: Hoare triple {13932#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -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:24:36,885 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:24:36,885 INFO L273 TraceCheckUtils]: 30: Hoare triple {13933#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -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:24:36,886 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:24:36,887 INFO L273 TraceCheckUtils]: 32: Hoare triple {13934#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -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:24:36,887 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:24:36,888 INFO L273 TraceCheckUtils]: 34: Hoare triple {13935#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -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:24:36,888 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:24:36,889 INFO L273 TraceCheckUtils]: 36: Hoare triple {13936#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -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:24:36,890 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:24:36,890 INFO L273 TraceCheckUtils]: 38: Hoare triple {13937#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -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:24:36,891 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:24:36,891 INFO L273 TraceCheckUtils]: 40: Hoare triple {13938#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -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:24:36,892 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:24:36,893 INFO L273 TraceCheckUtils]: 42: Hoare triple {13939#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -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:24:36,893 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:24:36,894 INFO L273 TraceCheckUtils]: 44: Hoare triple {13940#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -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:24:36,894 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:24:36,895 INFO L273 TraceCheckUtils]: 46: Hoare triple {13941#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -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:24:36,896 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:24:36,896 INFO L273 TraceCheckUtils]: 48: Hoare triple {13942#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -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:24:36,897 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:24:36,897 INFO L273 TraceCheckUtils]: 50: Hoare triple {13943#(<= main_~i~1 22)} assume !(~i~1 < 100); {13920#false} is VALID [2018-11-23 12:24:36,898 INFO L256 TraceCheckUtils]: 51: Hoare triple {13920#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {13919#true} is VALID [2018-11-23 12:24:36,898 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:24:36,898 INFO L273 TraceCheckUtils]: 53: Hoare triple {13919#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:24:36,898 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:24:36,898 INFO L273 TraceCheckUtils]: 55: Hoare triple {13919#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:24:36,898 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:24:36,899 INFO L273 TraceCheckUtils]: 57: Hoare triple {13919#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:24:36,899 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:24:36,899 INFO L273 TraceCheckUtils]: 59: Hoare triple {13919#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:24:36,899 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:24:36,899 INFO L273 TraceCheckUtils]: 61: Hoare triple {13919#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:24:36,900 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:24:36,900 INFO L273 TraceCheckUtils]: 63: Hoare triple {13919#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:24:36,900 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:24:36,900 INFO L273 TraceCheckUtils]: 65: Hoare triple {13919#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:24:36,900 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:24:36,900 INFO L273 TraceCheckUtils]: 67: Hoare triple {13919#true} assume !(~i~0 < 100); {13919#true} is VALID [2018-11-23 12:24:36,901 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:24:36,901 INFO L273 TraceCheckUtils]: 69: Hoare triple {13919#true} assume true; {13919#true} is VALID [2018-11-23 12:24:36,901 INFO L268 TraceCheckUtils]: 70: Hoare quadruple {13919#true} {13920#false} #70#return; {13920#false} is VALID [2018-11-23 12:24:36,901 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:24:36,901 INFO L256 TraceCheckUtils]: 72: Hoare triple {13920#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {13919#true} is VALID [2018-11-23 12:24:36,901 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:24:36,902 INFO L273 TraceCheckUtils]: 74: Hoare triple {13919#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:24:36,902 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:24:36,902 INFO L273 TraceCheckUtils]: 76: Hoare triple {13919#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:24:36,902 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:24:36,902 INFO L273 TraceCheckUtils]: 78: Hoare triple {13919#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:24:36,902 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:24:36,902 INFO L273 TraceCheckUtils]: 80: Hoare triple {13919#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:24:36,902 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:24:36,902 INFO L273 TraceCheckUtils]: 82: Hoare triple {13919#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:24:36,902 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:24:36,903 INFO L273 TraceCheckUtils]: 84: Hoare triple {13919#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:24:36,903 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:24:36,903 INFO L273 TraceCheckUtils]: 86: Hoare triple {13919#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:24:36,903 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:24:36,903 INFO L273 TraceCheckUtils]: 88: Hoare triple {13919#true} assume !(~i~0 < 100); {13919#true} is VALID [2018-11-23 12:24:36,903 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:24:36,903 INFO L273 TraceCheckUtils]: 90: Hoare triple {13919#true} assume true; {13919#true} is VALID [2018-11-23 12:24:36,903 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {13919#true} {13920#false} #72#return; {13920#false} is VALID [2018-11-23 12:24:36,903 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:24:36,904 INFO L273 TraceCheckUtils]: 93: Hoare triple {13920#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:36,904 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:24:36,904 INFO L273 TraceCheckUtils]: 95: Hoare triple {13920#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:36,904 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:24:36,904 INFO L273 TraceCheckUtils]: 97: Hoare triple {13920#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:36,904 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:24:36,904 INFO L273 TraceCheckUtils]: 99: Hoare triple {13920#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:36,904 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:24:36,904 INFO L273 TraceCheckUtils]: 101: Hoare triple {13920#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:36,905 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:24:36,905 INFO L273 TraceCheckUtils]: 103: Hoare triple {13920#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:36,905 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:24:36,905 INFO L273 TraceCheckUtils]: 105: Hoare triple {13920#false} assume !(~i~2 < 99); {13920#false} is VALID [2018-11-23 12:24:36,905 INFO L273 TraceCheckUtils]: 106: Hoare triple {13920#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {13920#false} is VALID [2018-11-23 12:24:36,905 INFO L256 TraceCheckUtils]: 107: Hoare triple {13920#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {13919#true} is VALID [2018-11-23 12:24:36,905 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:24:36,905 INFO L273 TraceCheckUtils]: 109: Hoare triple {13919#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:24:36,905 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:24:36,905 INFO L273 TraceCheckUtils]: 111: Hoare triple {13919#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:24:36,906 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:24:36,906 INFO L273 TraceCheckUtils]: 113: Hoare triple {13919#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:24:36,906 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:24:36,906 INFO L273 TraceCheckUtils]: 115: Hoare triple {13919#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:24:36,906 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:24:36,906 INFO L273 TraceCheckUtils]: 117: Hoare triple {13919#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:24:36,906 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:24:36,906 INFO L273 TraceCheckUtils]: 119: Hoare triple {13919#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:24:36,906 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:24:36,907 INFO L273 TraceCheckUtils]: 121: Hoare triple {13919#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13919#true} is VALID [2018-11-23 12:24:36,907 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:24:36,907 INFO L273 TraceCheckUtils]: 123: Hoare triple {13919#true} assume !(~i~0 < 100); {13919#true} is VALID [2018-11-23 12:24:36,907 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:24:36,907 INFO L273 TraceCheckUtils]: 125: Hoare triple {13919#true} assume true; {13919#true} is VALID [2018-11-23 12:24:36,907 INFO L268 TraceCheckUtils]: 126: Hoare quadruple {13919#true} {13920#false} #74#return; {13920#false} is VALID [2018-11-23 12:24:36,907 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:24:36,907 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:24:36,907 INFO L273 TraceCheckUtils]: 129: Hoare triple {13920#false} assume !false; {13920#false} is VALID [2018-11-23 12:24:36,915 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:24:36,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:36,915 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:24:36,924 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:24:36,978 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:24:36,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:24:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:37,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:37,254 INFO L256 TraceCheckUtils]: 0: Hoare triple {13919#true} call ULTIMATE.init(); {13919#true} is VALID [2018-11-23 12:24:37,255 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:24:37,255 INFO L273 TraceCheckUtils]: 2: Hoare triple {13919#true} assume true; {13919#true} is VALID [2018-11-23 12:24:37,255 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13919#true} {13919#true} #66#return; {13919#true} is VALID [2018-11-23 12:24:37,255 INFO L256 TraceCheckUtils]: 4: Hoare triple {13919#true} call #t~ret13 := main(); {13919#true} is VALID [2018-11-23 12:24:37,256 INFO L273 TraceCheckUtils]: 5: Hoare triple {13919#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:24:37,256 INFO L273 TraceCheckUtils]: 6: Hoare triple {13962#(<= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:24:37,257 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:24:37,258 INFO L273 TraceCheckUtils]: 8: Hoare triple {13922#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:24:37,258 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:24:37,259 INFO L273 TraceCheckUtils]: 10: Hoare triple {13923#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:24:37,260 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:24:37,260 INFO L273 TraceCheckUtils]: 12: Hoare triple {13924#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -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:24:37,261 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:24:37,261 INFO L273 TraceCheckUtils]: 14: Hoare triple {13925#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -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:24:37,262 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:24:37,263 INFO L273 TraceCheckUtils]: 16: Hoare triple {13926#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -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:24:37,263 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:24:37,264 INFO L273 TraceCheckUtils]: 18: Hoare triple {13927#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -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:24:37,264 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:24:37,265 INFO L273 TraceCheckUtils]: 20: Hoare triple {13928#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -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:24:37,266 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:24:37,266 INFO L273 TraceCheckUtils]: 22: Hoare triple {13929#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -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:24:37,267 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:24:37,267 INFO L273 TraceCheckUtils]: 24: Hoare triple {13930#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -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:24:37,268 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:24:37,268 INFO L273 TraceCheckUtils]: 26: Hoare triple {13931#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -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:24:37,269 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:24:37,270 INFO L273 TraceCheckUtils]: 28: Hoare triple {13932#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -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:24:37,270 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:24:37,271 INFO L273 TraceCheckUtils]: 30: Hoare triple {13933#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -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:24:37,271 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:24:37,272 INFO L273 TraceCheckUtils]: 32: Hoare triple {13934#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -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:24:37,273 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:24:37,273 INFO L273 TraceCheckUtils]: 34: Hoare triple {13935#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -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:24:37,274 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:24:37,274 INFO L273 TraceCheckUtils]: 36: Hoare triple {13936#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -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:24:37,275 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:24:37,275 INFO L273 TraceCheckUtils]: 38: Hoare triple {13937#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -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:24:37,276 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:24:37,277 INFO L273 TraceCheckUtils]: 40: Hoare triple {13938#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -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:24:37,277 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:24:37,278 INFO L273 TraceCheckUtils]: 42: Hoare triple {13939#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -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:24:37,278 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:24:37,279 INFO L273 TraceCheckUtils]: 44: Hoare triple {13940#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -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:24:37,280 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:24:37,280 INFO L273 TraceCheckUtils]: 46: Hoare triple {13941#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -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:24:37,281 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:24:37,281 INFO L273 TraceCheckUtils]: 48: Hoare triple {13942#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -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:24:37,282 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:24:37,283 INFO L273 TraceCheckUtils]: 50: Hoare triple {13943#(<= main_~i~1 22)} assume !(~i~1 < 100); {13920#false} is VALID [2018-11-23 12:24:37,283 INFO L256 TraceCheckUtils]: 51: Hoare triple {13920#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {13920#false} is VALID [2018-11-23 12:24:37,283 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:24:37,283 INFO L273 TraceCheckUtils]: 53: Hoare triple {13920#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:24:37,283 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:24:37,284 INFO L273 TraceCheckUtils]: 55: Hoare triple {13920#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:24:37,284 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:24:37,284 INFO L273 TraceCheckUtils]: 57: Hoare triple {13920#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:24:37,284 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:24:37,284 INFO L273 TraceCheckUtils]: 59: Hoare triple {13920#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:24:37,284 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:24:37,285 INFO L273 TraceCheckUtils]: 61: Hoare triple {13920#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:24:37,285 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:24:37,285 INFO L273 TraceCheckUtils]: 63: Hoare triple {13920#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:24:37,285 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:24:37,285 INFO L273 TraceCheckUtils]: 65: Hoare triple {13920#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:24:37,285 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:24:37,286 INFO L273 TraceCheckUtils]: 67: Hoare triple {13920#false} assume !(~i~0 < 100); {13920#false} is VALID [2018-11-23 12:24:37,286 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:24:37,286 INFO L273 TraceCheckUtils]: 69: Hoare triple {13920#false} assume true; {13920#false} is VALID [2018-11-23 12:24:37,286 INFO L268 TraceCheckUtils]: 70: Hoare quadruple {13920#false} {13920#false} #70#return; {13920#false} is VALID [2018-11-23 12:24:37,286 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:24:37,286 INFO L256 TraceCheckUtils]: 72: Hoare triple {13920#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {13920#false} is VALID [2018-11-23 12:24:37,287 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:24:37,287 INFO L273 TraceCheckUtils]: 74: Hoare triple {13920#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:24:37,287 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:24:37,287 INFO L273 TraceCheckUtils]: 76: Hoare triple {13920#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:24:37,287 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:24:37,287 INFO L273 TraceCheckUtils]: 78: Hoare triple {13920#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:24:37,287 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:24:37,288 INFO L273 TraceCheckUtils]: 80: Hoare triple {13920#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:24:37,288 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:24:37,288 INFO L273 TraceCheckUtils]: 82: Hoare triple {13920#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:24:37,288 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:24:37,288 INFO L273 TraceCheckUtils]: 84: Hoare triple {13920#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:24:37,288 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:24:37,288 INFO L273 TraceCheckUtils]: 86: Hoare triple {13920#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:24:37,288 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:24:37,288 INFO L273 TraceCheckUtils]: 88: Hoare triple {13920#false} assume !(~i~0 < 100); {13920#false} is VALID [2018-11-23 12:24:37,289 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:24:37,289 INFO L273 TraceCheckUtils]: 90: Hoare triple {13920#false} assume true; {13920#false} is VALID [2018-11-23 12:24:37,289 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {13920#false} {13920#false} #72#return; {13920#false} is VALID [2018-11-23 12:24:37,289 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:24:37,289 INFO L273 TraceCheckUtils]: 93: Hoare triple {13920#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:37,289 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:24:37,289 INFO L273 TraceCheckUtils]: 95: Hoare triple {13920#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:37,289 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:24:37,289 INFO L273 TraceCheckUtils]: 97: Hoare triple {13920#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:37,289 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:24:37,290 INFO L273 TraceCheckUtils]: 99: Hoare triple {13920#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:37,290 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:24:37,290 INFO L273 TraceCheckUtils]: 101: Hoare triple {13920#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:37,290 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:24:37,290 INFO L273 TraceCheckUtils]: 103: Hoare triple {13920#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:37,290 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:24:37,290 INFO L273 TraceCheckUtils]: 105: Hoare triple {13920#false} assume !(~i~2 < 99); {13920#false} is VALID [2018-11-23 12:24:37,290 INFO L273 TraceCheckUtils]: 106: Hoare triple {13920#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {13920#false} is VALID [2018-11-23 12:24:37,290 INFO L256 TraceCheckUtils]: 107: Hoare triple {13920#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {13920#false} is VALID [2018-11-23 12:24:37,291 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:24:37,291 INFO L273 TraceCheckUtils]: 109: Hoare triple {13920#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:24:37,291 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:24:37,291 INFO L273 TraceCheckUtils]: 111: Hoare triple {13920#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:24:37,291 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:24:37,291 INFO L273 TraceCheckUtils]: 113: Hoare triple {13920#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:24:37,291 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:24:37,291 INFO L273 TraceCheckUtils]: 115: Hoare triple {13920#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:24:37,291 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:24:37,291 INFO L273 TraceCheckUtils]: 117: Hoare triple {13920#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:24:37,292 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:24:37,292 INFO L273 TraceCheckUtils]: 119: Hoare triple {13920#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:24:37,292 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:24:37,292 INFO L273 TraceCheckUtils]: 121: Hoare triple {13920#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {13920#false} is VALID [2018-11-23 12:24:37,292 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:24:37,292 INFO L273 TraceCheckUtils]: 123: Hoare triple {13920#false} assume !(~i~0 < 100); {13920#false} is VALID [2018-11-23 12:24:37,292 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:24:37,292 INFO L273 TraceCheckUtils]: 125: Hoare triple {13920#false} assume true; {13920#false} is VALID [2018-11-23 12:24:37,292 INFO L268 TraceCheckUtils]: 126: Hoare quadruple {13920#false} {13920#false} #74#return; {13920#false} is VALID [2018-11-23 12:24:37,293 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:24:37,293 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:24:37,293 INFO L273 TraceCheckUtils]: 129: Hoare triple {13920#false} assume !false; {13920#false} is VALID [2018-11-23 12:24:37,302 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:24:37,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:37,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-11-23 12:24:37,327 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 130 [2018-11-23 12:24:37,327 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:37,327 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 12:24:37,458 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:24:37,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 12:24:37,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 12:24:37,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:24:37,460 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand 26 states. [2018-11-23 12:24:38,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:38,336 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2018-11-23 12:24:38,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 12:24:38,336 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 130 [2018-11-23 12:24:38,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:38,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:24:38,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 98 transitions. [2018-11-23 12:24:38,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:24:38,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 98 transitions. [2018-11-23 12:24:38,339 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 98 transitions. [2018-11-23 12:24:38,426 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:24:38,428 INFO L225 Difference]: With dead ends: 138 [2018-11-23 12:24:38,428 INFO L226 Difference]: Without dead ends: 96 [2018-11-23 12:24:38,429 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:24:38,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-23 12:24:38,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2018-11-23 12:24:38,471 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:38,472 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 95 states. [2018-11-23 12:24:38,472 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 95 states. [2018-11-23 12:24:38,472 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 95 states. [2018-11-23 12:24:38,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:38,474 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-11-23 12:24:38,474 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-11-23 12:24:38,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:38,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:38,475 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 96 states. [2018-11-23 12:24:38,475 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 96 states. [2018-11-23 12:24:38,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:38,477 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-11-23 12:24:38,477 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-11-23 12:24:38,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:38,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:38,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:38,478 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:38,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-23 12:24:38,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2018-11-23 12:24:38,479 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 130 [2018-11-23 12:24:38,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:38,480 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2018-11-23 12:24:38,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 12:24:38,480 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-11-23 12:24:38,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-23 12:24:38,481 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:38,481 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:24:38,481 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:38,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:38,482 INFO L82 PathProgramCache]: Analyzing trace with hash -627324865, now seen corresponding path program 23 times [2018-11-23 12:24:38,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:38,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:38,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:38,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:24:38,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:38,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:39,653 INFO L256 TraceCheckUtils]: 0: Hoare triple {14872#true} call ULTIMATE.init(); {14872#true} is VALID [2018-11-23 12:24:39,653 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:24:39,653 INFO L273 TraceCheckUtils]: 2: Hoare triple {14872#true} assume true; {14872#true} is VALID [2018-11-23 12:24:39,654 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14872#true} {14872#true} #66#return; {14872#true} is VALID [2018-11-23 12:24:39,656 INFO L256 TraceCheckUtils]: 4: Hoare triple {14872#true} call #t~ret13 := main(); {14872#true} is VALID [2018-11-23 12:24:39,657 INFO L273 TraceCheckUtils]: 5: Hoare triple {14872#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:24:39,658 INFO L273 TraceCheckUtils]: 6: Hoare triple {14874#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:24:39,658 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:24:39,658 INFO L273 TraceCheckUtils]: 8: Hoare triple {14875#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:24:39,659 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:24:39,659 INFO L273 TraceCheckUtils]: 10: Hoare triple {14876#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:24:39,660 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:24:39,660 INFO L273 TraceCheckUtils]: 12: Hoare triple {14877#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -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:24:39,660 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:24:39,661 INFO L273 TraceCheckUtils]: 14: Hoare triple {14878#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -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:24:39,662 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:24:39,662 INFO L273 TraceCheckUtils]: 16: Hoare triple {14879#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -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:24:39,663 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:24:39,663 INFO L273 TraceCheckUtils]: 18: Hoare triple {14880#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -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:24:39,664 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:24:39,664 INFO L273 TraceCheckUtils]: 20: Hoare triple {14881#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -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:24:39,665 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:24:39,666 INFO L273 TraceCheckUtils]: 22: Hoare triple {14882#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -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:24:39,666 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:24:39,667 INFO L273 TraceCheckUtils]: 24: Hoare triple {14883#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -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:24:39,667 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:24:39,668 INFO L273 TraceCheckUtils]: 26: Hoare triple {14884#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -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:24:39,669 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:24:39,669 INFO L273 TraceCheckUtils]: 28: Hoare triple {14885#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -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:24:39,670 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:24:39,670 INFO L273 TraceCheckUtils]: 30: Hoare triple {14886#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -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:24:39,671 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:24:39,671 INFO L273 TraceCheckUtils]: 32: Hoare triple {14887#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -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:24:39,672 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:24:39,673 INFO L273 TraceCheckUtils]: 34: Hoare triple {14888#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -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:24:39,673 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:24:39,674 INFO L273 TraceCheckUtils]: 36: Hoare triple {14889#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -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:24:39,674 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:24:39,675 INFO L273 TraceCheckUtils]: 38: Hoare triple {14890#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -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:24:39,676 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:24:39,676 INFO L273 TraceCheckUtils]: 40: Hoare triple {14891#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -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:24:39,677 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:24:39,677 INFO L273 TraceCheckUtils]: 42: Hoare triple {14892#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -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:24:39,678 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:24:39,678 INFO L273 TraceCheckUtils]: 44: Hoare triple {14893#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -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:24:39,679 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:24:39,680 INFO L273 TraceCheckUtils]: 46: Hoare triple {14894#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -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:24:39,680 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:24:39,681 INFO L273 TraceCheckUtils]: 48: Hoare triple {14895#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -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:24:39,681 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:24:39,682 INFO L273 TraceCheckUtils]: 50: Hoare triple {14896#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -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:24:39,683 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:24:39,683 INFO L273 TraceCheckUtils]: 52: Hoare triple {14897#(<= main_~i~1 23)} assume !(~i~1 < 100); {14873#false} is VALID [2018-11-23 12:24:39,683 INFO L256 TraceCheckUtils]: 53: Hoare triple {14873#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {14872#true} is VALID [2018-11-23 12:24:39,684 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:24:39,684 INFO L273 TraceCheckUtils]: 55: Hoare triple {14872#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:24:39,684 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:24:39,684 INFO L273 TraceCheckUtils]: 57: Hoare triple {14872#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:24:39,684 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:24:39,684 INFO L273 TraceCheckUtils]: 59: Hoare triple {14872#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:24:39,685 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:24:39,685 INFO L273 TraceCheckUtils]: 61: Hoare triple {14872#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:24:39,685 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:24:39,685 INFO L273 TraceCheckUtils]: 63: Hoare triple {14872#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:24:39,685 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:24:39,685 INFO L273 TraceCheckUtils]: 65: Hoare triple {14872#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:24:39,686 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:24:39,686 INFO L273 TraceCheckUtils]: 67: Hoare triple {14872#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:24:39,686 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:24:39,686 INFO L273 TraceCheckUtils]: 69: Hoare triple {14872#true} assume !(~i~0 < 100); {14872#true} is VALID [2018-11-23 12:24:39,686 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:24:39,686 INFO L273 TraceCheckUtils]: 71: Hoare triple {14872#true} assume true; {14872#true} is VALID [2018-11-23 12:24:39,687 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {14872#true} {14873#false} #70#return; {14873#false} is VALID [2018-11-23 12:24:39,687 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:24:39,687 INFO L256 TraceCheckUtils]: 74: Hoare triple {14873#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {14872#true} is VALID [2018-11-23 12:24:39,687 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:24:39,687 INFO L273 TraceCheckUtils]: 76: Hoare triple {14872#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:24:39,688 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:24:39,688 INFO L273 TraceCheckUtils]: 78: Hoare triple {14872#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:24:39,688 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:24:39,688 INFO L273 TraceCheckUtils]: 80: Hoare triple {14872#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:24:39,688 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:24:39,688 INFO L273 TraceCheckUtils]: 82: Hoare triple {14872#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:24:39,688 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:24:39,688 INFO L273 TraceCheckUtils]: 84: Hoare triple {14872#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:24:39,688 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:24:39,689 INFO L273 TraceCheckUtils]: 86: Hoare triple {14872#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:24:39,689 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:24:39,689 INFO L273 TraceCheckUtils]: 88: Hoare triple {14872#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:24:39,689 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:24:39,689 INFO L273 TraceCheckUtils]: 90: Hoare triple {14872#true} assume !(~i~0 < 100); {14872#true} is VALID [2018-11-23 12:24:39,689 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:24:39,689 INFO L273 TraceCheckUtils]: 92: Hoare triple {14872#true} assume true; {14872#true} is VALID [2018-11-23 12:24:39,689 INFO L268 TraceCheckUtils]: 93: Hoare quadruple {14872#true} {14873#false} #72#return; {14873#false} is VALID [2018-11-23 12:24:39,689 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:24:39,689 INFO L273 TraceCheckUtils]: 95: Hoare triple {14873#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:39,690 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:24:39,690 INFO L273 TraceCheckUtils]: 97: Hoare triple {14873#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:39,690 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:24:39,690 INFO L273 TraceCheckUtils]: 99: Hoare triple {14873#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:39,690 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:24:39,690 INFO L273 TraceCheckUtils]: 101: Hoare triple {14873#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:39,690 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:24:39,690 INFO L273 TraceCheckUtils]: 103: Hoare triple {14873#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:39,690 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:24:39,691 INFO L273 TraceCheckUtils]: 105: Hoare triple {14873#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:39,691 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:24:39,691 INFO L273 TraceCheckUtils]: 107: Hoare triple {14873#false} assume !(~i~2 < 99); {14873#false} is VALID [2018-11-23 12:24:39,691 INFO L273 TraceCheckUtils]: 108: Hoare triple {14873#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {14873#false} is VALID [2018-11-23 12:24:39,691 INFO L256 TraceCheckUtils]: 109: Hoare triple {14873#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {14872#true} is VALID [2018-11-23 12:24:39,691 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:24:39,691 INFO L273 TraceCheckUtils]: 111: Hoare triple {14872#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:24:39,691 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:24:39,691 INFO L273 TraceCheckUtils]: 113: Hoare triple {14872#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:24:39,692 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:24:39,692 INFO L273 TraceCheckUtils]: 115: Hoare triple {14872#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:24:39,692 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:24:39,692 INFO L273 TraceCheckUtils]: 117: Hoare triple {14872#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:24:39,692 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:24:39,692 INFO L273 TraceCheckUtils]: 119: Hoare triple {14872#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:24:39,692 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:24:39,692 INFO L273 TraceCheckUtils]: 121: Hoare triple {14872#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:24:39,692 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:24:39,692 INFO L273 TraceCheckUtils]: 123: Hoare triple {14872#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14872#true} is VALID [2018-11-23 12:24:39,693 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:24:39,693 INFO L273 TraceCheckUtils]: 125: Hoare triple {14872#true} assume !(~i~0 < 100); {14872#true} is VALID [2018-11-23 12:24:39,693 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:24:39,693 INFO L273 TraceCheckUtils]: 127: Hoare triple {14872#true} assume true; {14872#true} is VALID [2018-11-23 12:24:39,693 INFO L268 TraceCheckUtils]: 128: Hoare quadruple {14872#true} {14873#false} #74#return; {14873#false} is VALID [2018-11-23 12:24:39,693 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:24:39,693 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:24:39,693 INFO L273 TraceCheckUtils]: 131: Hoare triple {14873#false} assume !false; {14873#false} is VALID [2018-11-23 12:24:39,701 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:24:39,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:39,701 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:24:39,712 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:24:42,624 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2018-11-23 12:24:42,624 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:24:42,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:42,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:43,334 INFO L256 TraceCheckUtils]: 0: Hoare triple {14872#true} call ULTIMATE.init(); {14872#true} is VALID [2018-11-23 12:24:43,335 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:24:43,335 INFO L273 TraceCheckUtils]: 2: Hoare triple {14872#true} assume true; {14872#true} is VALID [2018-11-23 12:24:43,335 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14872#true} {14872#true} #66#return; {14872#true} is VALID [2018-11-23 12:24:43,335 INFO L256 TraceCheckUtils]: 4: Hoare triple {14872#true} call #t~ret13 := main(); {14872#true} is VALID [2018-11-23 12:24:43,335 INFO L273 TraceCheckUtils]: 5: Hoare triple {14872#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {14872#true} is VALID [2018-11-23 12:24:43,336 INFO L273 TraceCheckUtils]: 6: Hoare triple {14872#true} assume !!(~i~1 < 100);assume -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:24:43,337 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:24:43,337 INFO L273 TraceCheckUtils]: 8: Hoare triple {14872#true} assume !!(~i~1 < 100);assume -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:24:43,337 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:24:43,337 INFO L273 TraceCheckUtils]: 10: Hoare triple {14872#true} assume !!(~i~1 < 100);assume -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:24:43,337 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:24:43,337 INFO L273 TraceCheckUtils]: 12: Hoare triple {14872#true} assume !!(~i~1 < 100);assume -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:24:43,337 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:24:43,337 INFO L273 TraceCheckUtils]: 14: Hoare triple {14872#true} assume !!(~i~1 < 100);assume -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:24:43,337 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:24:43,337 INFO L273 TraceCheckUtils]: 16: Hoare triple {14872#true} assume !!(~i~1 < 100);assume -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:24:43,338 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:24:43,338 INFO L273 TraceCheckUtils]: 18: Hoare triple {14872#true} assume !!(~i~1 < 100);assume -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:24:43,338 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:24:43,338 INFO L273 TraceCheckUtils]: 20: Hoare triple {14872#true} assume !!(~i~1 < 100);assume -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:24:43,338 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:24:43,338 INFO L273 TraceCheckUtils]: 22: Hoare triple {14872#true} assume !!(~i~1 < 100);assume -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:24:43,338 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:24:43,338 INFO L273 TraceCheckUtils]: 24: Hoare triple {14872#true} assume !!(~i~1 < 100);assume -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:24:43,338 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:24:43,339 INFO L273 TraceCheckUtils]: 26: Hoare triple {14872#true} assume !!(~i~1 < 100);assume -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:24:43,339 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:24:43,339 INFO L273 TraceCheckUtils]: 28: Hoare triple {14872#true} assume !!(~i~1 < 100);assume -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:24:43,339 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:24:43,339 INFO L273 TraceCheckUtils]: 30: Hoare triple {14872#true} assume !!(~i~1 < 100);assume -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:24:43,339 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:24:43,339 INFO L273 TraceCheckUtils]: 32: Hoare triple {14872#true} assume !!(~i~1 < 100);assume -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:24:43,339 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:24:43,339 INFO L273 TraceCheckUtils]: 34: Hoare triple {14872#true} assume !!(~i~1 < 100);assume -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:24:43,340 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:24:43,340 INFO L273 TraceCheckUtils]: 36: Hoare triple {14872#true} assume !!(~i~1 < 100);assume -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:24:43,340 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:24:43,340 INFO L273 TraceCheckUtils]: 38: Hoare triple {14872#true} assume !!(~i~1 < 100);assume -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:24:43,340 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:24:43,340 INFO L273 TraceCheckUtils]: 40: Hoare triple {14872#true} assume !!(~i~1 < 100);assume -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:24:43,340 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:24:43,340 INFO L273 TraceCheckUtils]: 42: Hoare triple {14872#true} assume !!(~i~1 < 100);assume -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:24:43,340 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:24:43,341 INFO L273 TraceCheckUtils]: 44: Hoare triple {14872#true} assume !!(~i~1 < 100);assume -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:24:43,341 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:24:43,341 INFO L273 TraceCheckUtils]: 46: Hoare triple {14872#true} assume !!(~i~1 < 100);assume -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:24:43,341 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:24:43,341 INFO L273 TraceCheckUtils]: 48: Hoare triple {14872#true} assume !!(~i~1 < 100);assume -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:24:43,341 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:24:43,341 INFO L273 TraceCheckUtils]: 50: Hoare triple {14872#true} assume !!(~i~1 < 100);assume -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:24:43,341 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:24:43,341 INFO L273 TraceCheckUtils]: 52: Hoare triple {14872#true} assume !(~i~1 < 100); {14872#true} is VALID [2018-11-23 12:24:43,341 INFO L256 TraceCheckUtils]: 53: Hoare triple {14872#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {14872#true} is VALID [2018-11-23 12:24:43,342 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#(<= bAnd_~i~0 1)} is VALID [2018-11-23 12:24:43,342 INFO L273 TraceCheckUtils]: 55: Hoare triple {15063#(<= bAnd_~i~0 1)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15063#(<= bAnd_~i~0 1)} is VALID [2018-11-23 12:24:43,343 INFO L273 TraceCheckUtils]: 56: Hoare triple {15063#(<= bAnd_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15070#(<= bAnd_~i~0 2)} is VALID [2018-11-23 12:24:43,343 INFO L273 TraceCheckUtils]: 57: Hoare triple {15070#(<= bAnd_~i~0 2)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15070#(<= bAnd_~i~0 2)} is VALID [2018-11-23 12:24:43,343 INFO L273 TraceCheckUtils]: 58: Hoare triple {15070#(<= bAnd_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15077#(<= bAnd_~i~0 3)} is VALID [2018-11-23 12:24:43,344 INFO L273 TraceCheckUtils]: 59: Hoare triple {15077#(<= bAnd_~i~0 3)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15077#(<= bAnd_~i~0 3)} is VALID [2018-11-23 12:24:43,344 INFO L273 TraceCheckUtils]: 60: Hoare triple {15077#(<= bAnd_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15084#(<= bAnd_~i~0 4)} is VALID [2018-11-23 12:24:43,345 INFO L273 TraceCheckUtils]: 61: Hoare triple {15084#(<= bAnd_~i~0 4)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15084#(<= bAnd_~i~0 4)} is VALID [2018-11-23 12:24:43,345 INFO L273 TraceCheckUtils]: 62: Hoare triple {15084#(<= bAnd_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15091#(<= bAnd_~i~0 5)} is VALID [2018-11-23 12:24:43,346 INFO L273 TraceCheckUtils]: 63: Hoare triple {15091#(<= bAnd_~i~0 5)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15091#(<= bAnd_~i~0 5)} is VALID [2018-11-23 12:24:43,346 INFO L273 TraceCheckUtils]: 64: Hoare triple {15091#(<= bAnd_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15098#(<= bAnd_~i~0 6)} is VALID [2018-11-23 12:24:43,347 INFO L273 TraceCheckUtils]: 65: Hoare triple {15098#(<= bAnd_~i~0 6)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15098#(<= bAnd_~i~0 6)} is VALID [2018-11-23 12:24:43,348 INFO L273 TraceCheckUtils]: 66: Hoare triple {15098#(<= bAnd_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15105#(<= bAnd_~i~0 7)} is VALID [2018-11-23 12:24:43,348 INFO L273 TraceCheckUtils]: 67: Hoare triple {15105#(<= bAnd_~i~0 7)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15105#(<= bAnd_~i~0 7)} is VALID [2018-11-23 12:24:43,349 INFO L273 TraceCheckUtils]: 68: Hoare triple {15105#(<= bAnd_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15112#(<= bAnd_~i~0 8)} is VALID [2018-11-23 12:24:43,349 INFO L273 TraceCheckUtils]: 69: Hoare triple {15112#(<= bAnd_~i~0 8)} assume !(~i~0 < 100); {14873#false} is VALID [2018-11-23 12:24:43,350 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:24:43,350 INFO L273 TraceCheckUtils]: 71: Hoare triple {14873#false} assume true; {14873#false} is VALID [2018-11-23 12:24:43,350 INFO L268 TraceCheckUtils]: 72: Hoare quadruple {14873#false} {14872#true} #70#return; {14873#false} is VALID [2018-11-23 12:24:43,350 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:24:43,350 INFO L256 TraceCheckUtils]: 74: Hoare triple {14873#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {14873#false} is VALID [2018-11-23 12:24:43,350 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:24:43,351 INFO L273 TraceCheckUtils]: 76: Hoare triple {14873#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14873#false} is VALID [2018-11-23 12:24:43,351 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:24:43,351 INFO L273 TraceCheckUtils]: 78: Hoare triple {14873#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14873#false} is VALID [2018-11-23 12:24:43,351 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:24:43,351 INFO L273 TraceCheckUtils]: 80: Hoare triple {14873#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14873#false} is VALID [2018-11-23 12:24:43,352 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:24:43,352 INFO L273 TraceCheckUtils]: 82: Hoare triple {14873#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14873#false} is VALID [2018-11-23 12:24:43,352 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:24:43,352 INFO L273 TraceCheckUtils]: 84: Hoare triple {14873#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14873#false} is VALID [2018-11-23 12:24:43,352 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:24:43,352 INFO L273 TraceCheckUtils]: 86: Hoare triple {14873#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14873#false} is VALID [2018-11-23 12:24:43,352 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:24:43,352 INFO L273 TraceCheckUtils]: 88: Hoare triple {14873#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14873#false} is VALID [2018-11-23 12:24:43,352 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:24:43,352 INFO L273 TraceCheckUtils]: 90: Hoare triple {14873#false} assume !(~i~0 < 100); {14873#false} is VALID [2018-11-23 12:24:43,353 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:24:43,353 INFO L273 TraceCheckUtils]: 92: Hoare triple {14873#false} assume true; {14873#false} is VALID [2018-11-23 12:24:43,353 INFO L268 TraceCheckUtils]: 93: Hoare quadruple {14873#false} {14873#false} #72#return; {14873#false} is VALID [2018-11-23 12:24:43,353 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:24:43,353 INFO L273 TraceCheckUtils]: 95: Hoare triple {14873#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:43,353 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:24:43,353 INFO L273 TraceCheckUtils]: 97: Hoare triple {14873#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:43,353 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:24:43,353 INFO L273 TraceCheckUtils]: 99: Hoare triple {14873#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:43,354 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:24:43,354 INFO L273 TraceCheckUtils]: 101: Hoare triple {14873#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:43,354 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:24:43,354 INFO L273 TraceCheckUtils]: 103: Hoare triple {14873#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:43,354 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:24:43,354 INFO L273 TraceCheckUtils]: 105: Hoare triple {14873#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:43,354 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:24:43,354 INFO L273 TraceCheckUtils]: 107: Hoare triple {14873#false} assume !(~i~2 < 99); {14873#false} is VALID [2018-11-23 12:24:43,354 INFO L273 TraceCheckUtils]: 108: Hoare triple {14873#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {14873#false} is VALID [2018-11-23 12:24:43,355 INFO L256 TraceCheckUtils]: 109: Hoare triple {14873#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {14873#false} is VALID [2018-11-23 12:24:43,355 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:24:43,355 INFO L273 TraceCheckUtils]: 111: Hoare triple {14873#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14873#false} is VALID [2018-11-23 12:24:43,355 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:24:43,355 INFO L273 TraceCheckUtils]: 113: Hoare triple {14873#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14873#false} is VALID [2018-11-23 12:24:43,355 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:24:43,355 INFO L273 TraceCheckUtils]: 115: Hoare triple {14873#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14873#false} is VALID [2018-11-23 12:24:43,355 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:24:43,355 INFO L273 TraceCheckUtils]: 117: Hoare triple {14873#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14873#false} is VALID [2018-11-23 12:24:43,355 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:24:43,356 INFO L273 TraceCheckUtils]: 119: Hoare triple {14873#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14873#false} is VALID [2018-11-23 12:24:43,356 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:24:43,356 INFO L273 TraceCheckUtils]: 121: Hoare triple {14873#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14873#false} is VALID [2018-11-23 12:24:43,356 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:24:43,356 INFO L273 TraceCheckUtils]: 123: Hoare triple {14873#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {14873#false} is VALID [2018-11-23 12:24:43,356 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:24:43,356 INFO L273 TraceCheckUtils]: 125: Hoare triple {14873#false} assume !(~i~0 < 100); {14873#false} is VALID [2018-11-23 12:24:43,356 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:24:43,356 INFO L273 TraceCheckUtils]: 127: Hoare triple {14873#false} assume true; {14873#false} is VALID [2018-11-23 12:24:43,357 INFO L268 TraceCheckUtils]: 128: Hoare quadruple {14873#false} {14873#false} #74#return; {14873#false} is VALID [2018-11-23 12:24:43,357 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:24:43,357 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:24:43,357 INFO L273 TraceCheckUtils]: 131: Hoare triple {14873#false} assume !false; {14873#false} is VALID [2018-11-23 12:24:43,363 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:24:43,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:43,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 10] total 34 [2018-11-23 12:24:43,384 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 132 [2018-11-23 12:24:43,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:43,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-23 12:24:43,479 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:24:43,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 12:24:43,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 12:24:43,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=753, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:24:43,480 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 34 states. [2018-11-23 12:24:44,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:44,700 INFO L93 Difference]: Finished difference Result 143 states and 155 transitions. [2018-11-23 12:24:44,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 12:24:44,701 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 132 [2018-11-23 12:24:44,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:44,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:24:44,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 120 transitions. [2018-11-23 12:24:44,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:24:44,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 120 transitions. [2018-11-23 12:24:44,703 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 120 transitions. [2018-11-23 12:24:45,071 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:24:45,073 INFO L225 Difference]: With dead ends: 143 [2018-11-23 12:24:45,073 INFO L226 Difference]: Without dead ends: 101 [2018-11-23 12:24:45,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=369, Invalid=753, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:24:45,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-23 12:24:45,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2018-11-23 12:24:45,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:45,627 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 99 states. [2018-11-23 12:24:45,627 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 99 states. [2018-11-23 12:24:45,628 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 99 states. [2018-11-23 12:24:45,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:45,630 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-11-23 12:24:45,630 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-11-23 12:24:45,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:45,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:45,631 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 101 states. [2018-11-23 12:24:45,631 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 101 states. [2018-11-23 12:24:45,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:45,633 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-11-23 12:24:45,633 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-11-23 12:24:45,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:45,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:45,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:45,633 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:45,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-23 12:24:45,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2018-11-23 12:24:45,635 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 132 [2018-11-23 12:24:45,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:45,636 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2018-11-23 12:24:45,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-23 12:24:45,636 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2018-11-23 12:24:45,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-23 12:24:45,637 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:45,637 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:24:45,637 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:45,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:45,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1976094561, now seen corresponding path program 24 times [2018-11-23 12:24:45,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:45,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:45,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:45,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:24:45,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:45,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:46,136 INFO L256 TraceCheckUtils]: 0: Hoare triple {15862#true} call ULTIMATE.init(); {15862#true} is VALID [2018-11-23 12:24:46,136 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:24:46,136 INFO L273 TraceCheckUtils]: 2: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:24:46,137 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15862#true} {15862#true} #66#return; {15862#true} is VALID [2018-11-23 12:24:46,137 INFO L256 TraceCheckUtils]: 4: Hoare triple {15862#true} call #t~ret13 := main(); {15862#true} is VALID [2018-11-23 12:24:46,138 INFO L273 TraceCheckUtils]: 5: Hoare triple {15862#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:24:46,138 INFO L273 TraceCheckUtils]: 6: Hoare triple {15864#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:24:46,139 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:24:46,140 INFO L273 TraceCheckUtils]: 8: Hoare triple {15865#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:24:46,140 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:24:46,141 INFO L273 TraceCheckUtils]: 10: Hoare triple {15866#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:24:46,141 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:24:46,142 INFO L273 TraceCheckUtils]: 12: Hoare triple {15867#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -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:24:46,143 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:24:46,143 INFO L273 TraceCheckUtils]: 14: Hoare triple {15868#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -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:24:46,144 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:24:46,144 INFO L273 TraceCheckUtils]: 16: Hoare triple {15869#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -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:24:46,145 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:24:46,145 INFO L273 TraceCheckUtils]: 18: Hoare triple {15870#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -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:24:46,146 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:24:46,147 INFO L273 TraceCheckUtils]: 20: Hoare triple {15871#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -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:24:46,147 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:24:46,148 INFO L273 TraceCheckUtils]: 22: Hoare triple {15872#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -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:24:46,148 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:24:46,170 INFO L273 TraceCheckUtils]: 24: Hoare triple {15873#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -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:24:46,186 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:24:46,194 INFO L273 TraceCheckUtils]: 26: Hoare triple {15874#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -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:24:46,197 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:24:46,198 INFO L273 TraceCheckUtils]: 28: Hoare triple {15875#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -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:24:46,198 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:24:46,199 INFO L273 TraceCheckUtils]: 30: Hoare triple {15876#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -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:24:46,199 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:24:46,199 INFO L273 TraceCheckUtils]: 32: Hoare triple {15877#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -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:24:46,200 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:24:46,200 INFO L273 TraceCheckUtils]: 34: Hoare triple {15878#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -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:24:46,200 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:24:46,201 INFO L273 TraceCheckUtils]: 36: Hoare triple {15879#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -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:24:46,201 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:24:46,202 INFO L273 TraceCheckUtils]: 38: Hoare triple {15880#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -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:24:46,203 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:24:46,203 INFO L273 TraceCheckUtils]: 40: Hoare triple {15881#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -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:24:46,204 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:24:46,204 INFO L273 TraceCheckUtils]: 42: Hoare triple {15882#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -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:24:46,205 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:24:46,205 INFO L273 TraceCheckUtils]: 44: Hoare triple {15883#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -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:24:46,206 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:24:46,207 INFO L273 TraceCheckUtils]: 46: Hoare triple {15884#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -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:24:46,207 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:24:46,208 INFO L273 TraceCheckUtils]: 48: Hoare triple {15885#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -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:24:46,208 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:24:46,209 INFO L273 TraceCheckUtils]: 50: Hoare triple {15886#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -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:24:46,210 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:24:46,210 INFO L273 TraceCheckUtils]: 52: Hoare triple {15887#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -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:24:46,211 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:24:46,211 INFO L273 TraceCheckUtils]: 54: Hoare triple {15888#(<= main_~i~1 24)} assume !(~i~1 < 100); {15863#false} is VALID [2018-11-23 12:24:46,212 INFO L256 TraceCheckUtils]: 55: Hoare triple {15863#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {15862#true} is VALID [2018-11-23 12:24:46,212 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:24:46,212 INFO L273 TraceCheckUtils]: 57: Hoare triple {15862#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:24:46,212 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:24:46,212 INFO L273 TraceCheckUtils]: 59: Hoare triple {15862#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:24:46,212 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:24:46,213 INFO L273 TraceCheckUtils]: 61: Hoare triple {15862#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:24:46,213 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:24:46,213 INFO L273 TraceCheckUtils]: 63: Hoare triple {15862#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:24:46,213 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:24:46,213 INFO L273 TraceCheckUtils]: 65: Hoare triple {15862#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:24:46,213 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:24:46,214 INFO L273 TraceCheckUtils]: 67: Hoare triple {15862#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:24:46,214 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:24:46,214 INFO L273 TraceCheckUtils]: 69: Hoare triple {15862#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:24:46,214 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:24:46,214 INFO L273 TraceCheckUtils]: 71: Hoare triple {15862#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:24:46,214 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:24:46,215 INFO L273 TraceCheckUtils]: 73: Hoare triple {15862#true} assume !(~i~0 < 100); {15862#true} is VALID [2018-11-23 12:24:46,215 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:24:46,215 INFO L273 TraceCheckUtils]: 75: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:24:46,215 INFO L268 TraceCheckUtils]: 76: Hoare quadruple {15862#true} {15863#false} #70#return; {15863#false} is VALID [2018-11-23 12:24:46,215 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:24:46,215 INFO L256 TraceCheckUtils]: 78: Hoare triple {15863#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {15862#true} is VALID [2018-11-23 12:24:46,216 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:24:46,216 INFO L273 TraceCheckUtils]: 80: Hoare triple {15862#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:24:46,216 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:24:46,216 INFO L273 TraceCheckUtils]: 82: Hoare triple {15862#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:24:46,216 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:24:46,216 INFO L273 TraceCheckUtils]: 84: Hoare triple {15862#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:24:46,217 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:24:46,217 INFO L273 TraceCheckUtils]: 86: Hoare triple {15862#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:24:46,217 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:24:46,217 INFO L273 TraceCheckUtils]: 88: Hoare triple {15862#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:24:46,217 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:24:46,217 INFO L273 TraceCheckUtils]: 90: Hoare triple {15862#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:24:46,217 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:24:46,217 INFO L273 TraceCheckUtils]: 92: Hoare triple {15862#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:24:46,218 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:24:46,218 INFO L273 TraceCheckUtils]: 94: Hoare triple {15862#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:24:46,218 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:24:46,218 INFO L273 TraceCheckUtils]: 96: Hoare triple {15862#true} assume !(~i~0 < 100); {15862#true} is VALID [2018-11-23 12:24:46,218 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:24:46,218 INFO L273 TraceCheckUtils]: 98: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:24:46,218 INFO L268 TraceCheckUtils]: 99: Hoare quadruple {15862#true} {15863#false} #72#return; {15863#false} is VALID [2018-11-23 12:24:46,218 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:24:46,218 INFO L273 TraceCheckUtils]: 101: Hoare triple {15863#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:46,218 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:24:46,219 INFO L273 TraceCheckUtils]: 103: Hoare triple {15863#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:46,219 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:24:46,219 INFO L273 TraceCheckUtils]: 105: Hoare triple {15863#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:46,219 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:24:46,219 INFO L273 TraceCheckUtils]: 107: Hoare triple {15863#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:46,219 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:24:46,219 INFO L273 TraceCheckUtils]: 109: Hoare triple {15863#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:46,219 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:24:46,219 INFO L273 TraceCheckUtils]: 111: Hoare triple {15863#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:46,220 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:24:46,220 INFO L273 TraceCheckUtils]: 113: Hoare triple {15863#false} assume !(~i~2 < 99); {15863#false} is VALID [2018-11-23 12:24:46,220 INFO L273 TraceCheckUtils]: 114: Hoare triple {15863#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {15863#false} is VALID [2018-11-23 12:24:46,220 INFO L256 TraceCheckUtils]: 115: Hoare triple {15863#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {15862#true} is VALID [2018-11-23 12:24:46,220 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:24:46,220 INFO L273 TraceCheckUtils]: 117: Hoare triple {15862#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:24:46,220 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:24:46,220 INFO L273 TraceCheckUtils]: 119: Hoare triple {15862#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:24:46,220 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:24:46,220 INFO L273 TraceCheckUtils]: 121: Hoare triple {15862#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:24:46,221 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:24:46,221 INFO L273 TraceCheckUtils]: 123: Hoare triple {15862#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:24:46,221 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:24:46,221 INFO L273 TraceCheckUtils]: 125: Hoare triple {15862#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:24:46,221 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:24:46,221 INFO L273 TraceCheckUtils]: 127: Hoare triple {15862#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:24:46,221 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:24:46,221 INFO L273 TraceCheckUtils]: 129: Hoare triple {15862#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:24:46,221 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:24:46,221 INFO L273 TraceCheckUtils]: 131: Hoare triple {15862#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:24:46,222 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:24:46,222 INFO L273 TraceCheckUtils]: 133: Hoare triple {15862#true} assume !(~i~0 < 100); {15862#true} is VALID [2018-11-23 12:24:46,222 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:24:46,222 INFO L273 TraceCheckUtils]: 135: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:24:46,222 INFO L268 TraceCheckUtils]: 136: Hoare quadruple {15862#true} {15863#false} #74#return; {15863#false} is VALID [2018-11-23 12:24:46,222 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:24:46,222 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:24:46,222 INFO L273 TraceCheckUtils]: 139: Hoare triple {15863#false} assume !false; {15863#false} is VALID [2018-11-23 12:24:46,231 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:24:46,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:46,231 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:24:46,240 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:24:46,833 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2018-11-23 12:24:46,833 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:24:46,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:46,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:47,078 INFO L256 TraceCheckUtils]: 0: Hoare triple {15862#true} call ULTIMATE.init(); {15862#true} is VALID [2018-11-23 12:24:47,079 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:24:47,079 INFO L273 TraceCheckUtils]: 2: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:24:47,079 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15862#true} {15862#true} #66#return; {15862#true} is VALID [2018-11-23 12:24:47,079 INFO L256 TraceCheckUtils]: 4: Hoare triple {15862#true} call #t~ret13 := main(); {15862#true} is VALID [2018-11-23 12:24:47,079 INFO L273 TraceCheckUtils]: 5: Hoare triple {15862#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {15862#true} is VALID [2018-11-23 12:24:47,080 INFO L273 TraceCheckUtils]: 6: Hoare triple {15862#true} assume !!(~i~1 < 100);assume -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:24:47,080 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:24:47,080 INFO L273 TraceCheckUtils]: 8: Hoare triple {15862#true} assume !!(~i~1 < 100);assume -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:24:47,080 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:24:47,080 INFO L273 TraceCheckUtils]: 10: Hoare triple {15862#true} assume !!(~i~1 < 100);assume -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:24:47,081 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:24:47,081 INFO L273 TraceCheckUtils]: 12: Hoare triple {15862#true} assume !!(~i~1 < 100);assume -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:24:47,081 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:24:47,081 INFO L273 TraceCheckUtils]: 14: Hoare triple {15862#true} assume !!(~i~1 < 100);assume -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:24:47,081 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:24:47,081 INFO L273 TraceCheckUtils]: 16: Hoare triple {15862#true} assume !!(~i~1 < 100);assume -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:24:47,081 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:24:47,081 INFO L273 TraceCheckUtils]: 18: Hoare triple {15862#true} assume !!(~i~1 < 100);assume -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:24:47,081 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:24:47,082 INFO L273 TraceCheckUtils]: 20: Hoare triple {15862#true} assume !!(~i~1 < 100);assume -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:24:47,082 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:24:47,082 INFO L273 TraceCheckUtils]: 22: Hoare triple {15862#true} assume !!(~i~1 < 100);assume -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:24:47,082 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:24:47,082 INFO L273 TraceCheckUtils]: 24: Hoare triple {15862#true} assume !!(~i~1 < 100);assume -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:24:47,082 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:24:47,082 INFO L273 TraceCheckUtils]: 26: Hoare triple {15862#true} assume !!(~i~1 < 100);assume -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:24:47,082 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:24:47,082 INFO L273 TraceCheckUtils]: 28: Hoare triple {15862#true} assume !!(~i~1 < 100);assume -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:24:47,083 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:24:47,083 INFO L273 TraceCheckUtils]: 30: Hoare triple {15862#true} assume !!(~i~1 < 100);assume -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:24:47,083 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:24:47,083 INFO L273 TraceCheckUtils]: 32: Hoare triple {15862#true} assume !!(~i~1 < 100);assume -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:24:47,083 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:24:47,083 INFO L273 TraceCheckUtils]: 34: Hoare triple {15862#true} assume !!(~i~1 < 100);assume -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:24:47,083 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:24:47,083 INFO L273 TraceCheckUtils]: 36: Hoare triple {15862#true} assume !!(~i~1 < 100);assume -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:24:47,083 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:24:47,084 INFO L273 TraceCheckUtils]: 38: Hoare triple {15862#true} assume !!(~i~1 < 100);assume -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:24:47,084 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:24:47,084 INFO L273 TraceCheckUtils]: 40: Hoare triple {15862#true} assume !!(~i~1 < 100);assume -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:24:47,084 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:24:47,084 INFO L273 TraceCheckUtils]: 42: Hoare triple {15862#true} assume !!(~i~1 < 100);assume -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:24:47,084 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:24:47,084 INFO L273 TraceCheckUtils]: 44: Hoare triple {15862#true} assume !!(~i~1 < 100);assume -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:24:47,084 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:24:47,084 INFO L273 TraceCheckUtils]: 46: Hoare triple {15862#true} assume !!(~i~1 < 100);assume -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:24:47,085 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:24:47,085 INFO L273 TraceCheckUtils]: 48: Hoare triple {15862#true} assume !!(~i~1 < 100);assume -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:24:47,085 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:24:47,085 INFO L273 TraceCheckUtils]: 50: Hoare triple {15862#true} assume !!(~i~1 < 100);assume -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:24:47,085 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:24:47,085 INFO L273 TraceCheckUtils]: 52: Hoare triple {15862#true} assume !!(~i~1 < 100);assume -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:24:47,085 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:24:47,085 INFO L273 TraceCheckUtils]: 54: Hoare triple {15862#true} assume !(~i~1 < 100); {15862#true} is VALID [2018-11-23 12:24:47,085 INFO L256 TraceCheckUtils]: 55: Hoare triple {15862#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {15862#true} is VALID [2018-11-23 12:24:47,086 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:24:47,086 INFO L273 TraceCheckUtils]: 57: Hoare triple {15862#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:24:47,086 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:24:47,086 INFO L273 TraceCheckUtils]: 59: Hoare triple {15862#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:24:47,086 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:24:47,086 INFO L273 TraceCheckUtils]: 61: Hoare triple {15862#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:24:47,086 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:24:47,086 INFO L273 TraceCheckUtils]: 63: Hoare triple {15862#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:24:47,086 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:24:47,087 INFO L273 TraceCheckUtils]: 65: Hoare triple {15862#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:24:47,087 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:24:47,087 INFO L273 TraceCheckUtils]: 67: Hoare triple {15862#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:24:47,087 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:24:47,087 INFO L273 TraceCheckUtils]: 69: Hoare triple {15862#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:24:47,087 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:24:47,087 INFO L273 TraceCheckUtils]: 71: Hoare triple {15862#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:24:47,088 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:24:47,088 INFO L273 TraceCheckUtils]: 73: Hoare triple {15862#true} assume !(~i~0 < 100); {15862#true} is VALID [2018-11-23 12:24:47,088 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:24:47,088 INFO L273 TraceCheckUtils]: 75: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:24:47,088 INFO L268 TraceCheckUtils]: 76: Hoare quadruple {15862#true} {15862#true} #70#return; {15862#true} is VALID [2018-11-23 12:24:47,088 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:24:47,089 INFO L256 TraceCheckUtils]: 78: Hoare triple {15862#true} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {15862#true} is VALID [2018-11-23 12:24:47,089 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:24:47,089 INFO L273 TraceCheckUtils]: 80: Hoare triple {15862#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:24:47,089 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:24:47,089 INFO L273 TraceCheckUtils]: 82: Hoare triple {15862#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:24:47,089 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:24:47,089 INFO L273 TraceCheckUtils]: 84: Hoare triple {15862#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:24:47,090 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:24:47,090 INFO L273 TraceCheckUtils]: 86: Hoare triple {15862#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:24:47,090 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:24:47,090 INFO L273 TraceCheckUtils]: 88: Hoare triple {15862#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:24:47,090 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:24:47,090 INFO L273 TraceCheckUtils]: 90: Hoare triple {15862#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:24:47,090 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:24:47,091 INFO L273 TraceCheckUtils]: 92: Hoare triple {15862#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:24:47,091 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:24:47,091 INFO L273 TraceCheckUtils]: 94: Hoare triple {15862#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15862#true} is VALID [2018-11-23 12:24:47,091 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:24:47,091 INFO L273 TraceCheckUtils]: 96: Hoare triple {15862#true} assume !(~i~0 < 100); {15862#true} is VALID [2018-11-23 12:24:47,091 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:24:47,091 INFO L273 TraceCheckUtils]: 98: Hoare triple {15862#true} assume true; {15862#true} is VALID [2018-11-23 12:24:47,091 INFO L268 TraceCheckUtils]: 99: Hoare quadruple {15862#true} {15862#true} #72#return; {15862#true} is VALID [2018-11-23 12:24:47,092 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:24:47,092 INFO L273 TraceCheckUtils]: 101: Hoare triple {16192#(<= main_~i~2 0)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:47,093 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:24:47,093 INFO L273 TraceCheckUtils]: 103: Hoare triple {16199#(<= main_~i~2 1)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:47,093 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:24:47,094 INFO L273 TraceCheckUtils]: 105: Hoare triple {16206#(<= main_~i~2 2)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:47,094 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:24:47,094 INFO L273 TraceCheckUtils]: 107: Hoare triple {16213#(<= main_~i~2 3)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:47,095 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:24:47,095 INFO L273 TraceCheckUtils]: 109: Hoare triple {16220#(<= main_~i~2 4)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:47,096 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:24:47,096 INFO L273 TraceCheckUtils]: 111: Hoare triple {16227#(<= main_~i~2 5)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:47,097 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:24:47,097 INFO L273 TraceCheckUtils]: 113: Hoare triple {16234#(<= main_~i~2 6)} assume !(~i~2 < 99); {15863#false} is VALID [2018-11-23 12:24:47,098 INFO L273 TraceCheckUtils]: 114: Hoare triple {15863#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {15863#false} is VALID [2018-11-23 12:24:47,098 INFO L256 TraceCheckUtils]: 115: Hoare triple {15863#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {15863#false} is VALID [2018-11-23 12:24:47,098 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:24:47,098 INFO L273 TraceCheckUtils]: 117: Hoare triple {15863#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15863#false} is VALID [2018-11-23 12:24:47,098 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:24:47,098 INFO L273 TraceCheckUtils]: 119: Hoare triple {15863#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15863#false} is VALID [2018-11-23 12:24:47,099 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:24:47,099 INFO L273 TraceCheckUtils]: 121: Hoare triple {15863#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15863#false} is VALID [2018-11-23 12:24:47,099 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:24:47,099 INFO L273 TraceCheckUtils]: 123: Hoare triple {15863#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15863#false} is VALID [2018-11-23 12:24:47,099 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:24:47,099 INFO L273 TraceCheckUtils]: 125: Hoare triple {15863#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15863#false} is VALID [2018-11-23 12:24:47,100 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:24:47,100 INFO L273 TraceCheckUtils]: 127: Hoare triple {15863#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15863#false} is VALID [2018-11-23 12:24:47,100 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:24:47,100 INFO L273 TraceCheckUtils]: 129: Hoare triple {15863#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15863#false} is VALID [2018-11-23 12:24:47,100 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:24:47,100 INFO L273 TraceCheckUtils]: 131: Hoare triple {15863#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {15863#false} is VALID [2018-11-23 12:24:47,101 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:24:47,101 INFO L273 TraceCheckUtils]: 133: Hoare triple {15863#false} assume !(~i~0 < 100); {15863#false} is VALID [2018-11-23 12:24:47,101 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:24:47,101 INFO L273 TraceCheckUtils]: 135: Hoare triple {15863#false} assume true; {15863#false} is VALID [2018-11-23 12:24:47,101 INFO L268 TraceCheckUtils]: 136: Hoare quadruple {15863#false} {15863#false} #74#return; {15863#false} is VALID [2018-11-23 12:24:47,101 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:24:47,101 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:24:47,101 INFO L273 TraceCheckUtils]: 139: Hoare triple {15863#false} assume !false; {15863#false} is VALID [2018-11-23 12:24:47,109 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:24:47,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:47,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 9] total 34 [2018-11-23 12:24:47,130 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 140 [2018-11-23 12:24:47,131 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:47,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-23 12:24:47,702 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:24:47,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 12:24:47,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 12:24:47,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=736, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:24:47,704 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand 34 states. [2018-11-23 12:24:48,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:48,629 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2018-11-23 12:24:48,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 12:24:48,629 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 140 [2018-11-23 12:24:48,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:48,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:24:48,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 117 transitions. [2018-11-23 12:24:48,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:24:48,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 117 transitions. [2018-11-23 12:24:48,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 117 transitions. [2018-11-23 12:24:48,739 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:24:48,741 INFO L225 Difference]: With dead ends: 149 [2018-11-23 12:24:48,741 INFO L226 Difference]: Without dead ends: 105 [2018-11-23 12:24:48,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=386, Invalid=736, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:24:48,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-23 12:24:48,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-11-23 12:24:48,798 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:48,799 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand 103 states. [2018-11-23 12:24:48,799 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 103 states. [2018-11-23 12:24:48,799 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 103 states. [2018-11-23 12:24:48,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:48,801 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2018-11-23 12:24:48,801 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-11-23 12:24:48,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:48,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:48,802 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 105 states. [2018-11-23 12:24:48,802 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 105 states. [2018-11-23 12:24:48,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:48,804 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2018-11-23 12:24:48,805 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-11-23 12:24:48,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:48,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:48,805 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:48,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:48,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-23 12:24:48,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2018-11-23 12:24:48,807 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 140 [2018-11-23 12:24:48,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:48,808 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2018-11-23 12:24:48,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-23 12:24:48,808 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2018-11-23 12:24:48,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-23 12:24:48,809 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:48,809 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:24:48,810 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:48,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:48,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1521279999, now seen corresponding path program 25 times [2018-11-23 12:24:48,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:48,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:48,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:48,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:24:48,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:48,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:49,873 INFO L256 TraceCheckUtils]: 0: Hoare triple {16899#true} call ULTIMATE.init(); {16899#true} is VALID [2018-11-23 12:24:49,873 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:24:49,874 INFO L273 TraceCheckUtils]: 2: Hoare triple {16899#true} assume true; {16899#true} is VALID [2018-11-23 12:24:49,874 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16899#true} {16899#true} #66#return; {16899#true} is VALID [2018-11-23 12:24:49,874 INFO L256 TraceCheckUtils]: 4: Hoare triple {16899#true} call #t~ret13 := main(); {16899#true} is VALID [2018-11-23 12:24:49,875 INFO L273 TraceCheckUtils]: 5: Hoare triple {16899#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:24:49,875 INFO L273 TraceCheckUtils]: 6: Hoare triple {16901#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:24:49,875 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:24:49,876 INFO L273 TraceCheckUtils]: 8: Hoare triple {16902#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:24:49,876 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:24:49,876 INFO L273 TraceCheckUtils]: 10: Hoare triple {16903#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:24:49,877 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:24:49,877 INFO L273 TraceCheckUtils]: 12: Hoare triple {16904#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -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:24:49,878 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:24:49,878 INFO L273 TraceCheckUtils]: 14: Hoare triple {16905#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -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:24:49,879 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:24:49,879 INFO L273 TraceCheckUtils]: 16: Hoare triple {16906#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -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:24:49,880 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:24:49,880 INFO L273 TraceCheckUtils]: 18: Hoare triple {16907#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -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:24:49,881 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:24:49,881 INFO L273 TraceCheckUtils]: 20: Hoare triple {16908#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -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:24:49,882 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:24:49,883 INFO L273 TraceCheckUtils]: 22: Hoare triple {16909#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -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:24:49,887 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:24:49,887 INFO L273 TraceCheckUtils]: 24: Hoare triple {16910#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -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:24:49,887 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:24:49,888 INFO L273 TraceCheckUtils]: 26: Hoare triple {16911#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -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:24:49,888 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:24:49,888 INFO L273 TraceCheckUtils]: 28: Hoare triple {16912#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -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:24:49,889 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:24:49,889 INFO L273 TraceCheckUtils]: 30: Hoare triple {16913#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -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:24:49,890 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:24:49,890 INFO L273 TraceCheckUtils]: 32: Hoare triple {16914#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -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:24:49,891 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:24:49,891 INFO L273 TraceCheckUtils]: 34: Hoare triple {16915#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -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:24:49,892 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:24:49,892 INFO L273 TraceCheckUtils]: 36: Hoare triple {16916#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -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:24:49,893 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:24:49,894 INFO L273 TraceCheckUtils]: 38: Hoare triple {16917#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -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:24:49,894 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:24:49,895 INFO L273 TraceCheckUtils]: 40: Hoare triple {16918#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -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:24:49,895 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:24:49,896 INFO L273 TraceCheckUtils]: 42: Hoare triple {16919#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -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:24:49,897 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:24:49,897 INFO L273 TraceCheckUtils]: 44: Hoare triple {16920#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -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:24:49,898 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:24:49,898 INFO L273 TraceCheckUtils]: 46: Hoare triple {16921#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -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:24:49,899 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:24:49,899 INFO L273 TraceCheckUtils]: 48: Hoare triple {16922#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -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:24:49,900 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:24:49,901 INFO L273 TraceCheckUtils]: 50: Hoare triple {16923#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -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:24:49,901 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:24:49,902 INFO L273 TraceCheckUtils]: 52: Hoare triple {16924#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -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:24:49,902 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:24:49,903 INFO L273 TraceCheckUtils]: 54: Hoare triple {16925#(<= main_~i~1 24)} assume !!(~i~1 < 100);assume -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:24:49,904 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:24:49,904 INFO L273 TraceCheckUtils]: 56: Hoare triple {16926#(<= main_~i~1 25)} assume !(~i~1 < 100); {16900#false} is VALID [2018-11-23 12:24:49,904 INFO L256 TraceCheckUtils]: 57: Hoare triple {16900#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {16899#true} is VALID [2018-11-23 12:24:49,905 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:24:49,905 INFO L273 TraceCheckUtils]: 59: Hoare triple {16899#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:24:49,905 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:24:49,905 INFO L273 TraceCheckUtils]: 61: Hoare triple {16899#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:24:49,905 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:24:49,905 INFO L273 TraceCheckUtils]: 63: Hoare triple {16899#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:24:49,906 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:24:49,906 INFO L273 TraceCheckUtils]: 65: Hoare triple {16899#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:24:49,906 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:24:49,906 INFO L273 TraceCheckUtils]: 67: Hoare triple {16899#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:24:49,906 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:24:49,906 INFO L273 TraceCheckUtils]: 69: Hoare triple {16899#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:24:49,907 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:24:49,907 INFO L273 TraceCheckUtils]: 71: Hoare triple {16899#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:24:49,907 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:24:49,907 INFO L273 TraceCheckUtils]: 73: Hoare triple {16899#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:24:49,907 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:24:49,907 INFO L273 TraceCheckUtils]: 75: Hoare triple {16899#true} assume !(~i~0 < 100); {16899#true} is VALID [2018-11-23 12:24:49,908 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:24:49,908 INFO L273 TraceCheckUtils]: 77: Hoare triple {16899#true} assume true; {16899#true} is VALID [2018-11-23 12:24:49,908 INFO L268 TraceCheckUtils]: 78: Hoare quadruple {16899#true} {16900#false} #70#return; {16900#false} is VALID [2018-11-23 12:24:49,908 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:24:49,908 INFO L256 TraceCheckUtils]: 80: Hoare triple {16900#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {16899#true} is VALID [2018-11-23 12:24:49,908 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:24:49,909 INFO L273 TraceCheckUtils]: 82: Hoare triple {16899#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:24:49,909 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:24:49,909 INFO L273 TraceCheckUtils]: 84: Hoare triple {16899#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:24:49,909 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:24:49,909 INFO L273 TraceCheckUtils]: 86: Hoare triple {16899#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:24:49,909 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:24:49,910 INFO L273 TraceCheckUtils]: 88: Hoare triple {16899#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:24:49,910 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:24:49,910 INFO L273 TraceCheckUtils]: 90: Hoare triple {16899#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:24:49,910 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:24:49,910 INFO L273 TraceCheckUtils]: 92: Hoare triple {16899#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:24:49,910 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:24:49,910 INFO L273 TraceCheckUtils]: 94: Hoare triple {16899#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:24:49,910 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:24:49,911 INFO L273 TraceCheckUtils]: 96: Hoare triple {16899#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:24:49,911 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:24:49,911 INFO L273 TraceCheckUtils]: 98: Hoare triple {16899#true} assume !(~i~0 < 100); {16899#true} is VALID [2018-11-23 12:24:49,911 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:24:49,911 INFO L273 TraceCheckUtils]: 100: Hoare triple {16899#true} assume true; {16899#true} is VALID [2018-11-23 12:24:49,911 INFO L268 TraceCheckUtils]: 101: Hoare quadruple {16899#true} {16900#false} #72#return; {16900#false} is VALID [2018-11-23 12:24:49,911 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:24:49,911 INFO L273 TraceCheckUtils]: 103: Hoare triple {16900#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:49,911 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:24:49,911 INFO L273 TraceCheckUtils]: 105: Hoare triple {16900#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:49,912 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:24:49,912 INFO L273 TraceCheckUtils]: 107: Hoare triple {16900#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:49,912 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:24:49,912 INFO L273 TraceCheckUtils]: 109: Hoare triple {16900#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:49,912 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:24:49,912 INFO L273 TraceCheckUtils]: 111: Hoare triple {16900#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:49,912 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:24:49,912 INFO L273 TraceCheckUtils]: 113: Hoare triple {16900#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:49,912 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:24:49,913 INFO L273 TraceCheckUtils]: 115: Hoare triple {16900#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:49,913 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:24:49,913 INFO L273 TraceCheckUtils]: 117: Hoare triple {16900#false} assume !(~i~2 < 99); {16900#false} is VALID [2018-11-23 12:24:49,913 INFO L273 TraceCheckUtils]: 118: Hoare triple {16900#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {16900#false} is VALID [2018-11-23 12:24:49,913 INFO L256 TraceCheckUtils]: 119: Hoare triple {16900#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {16899#true} is VALID [2018-11-23 12:24:49,913 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:24:49,913 INFO L273 TraceCheckUtils]: 121: Hoare triple {16899#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:24:49,913 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:24:49,913 INFO L273 TraceCheckUtils]: 123: Hoare triple {16899#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:24:49,913 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:24:49,914 INFO L273 TraceCheckUtils]: 125: Hoare triple {16899#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:24:49,914 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:24:49,914 INFO L273 TraceCheckUtils]: 127: Hoare triple {16899#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:24:49,914 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:24:49,914 INFO L273 TraceCheckUtils]: 129: Hoare triple {16899#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:24:49,914 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:24:49,914 INFO L273 TraceCheckUtils]: 131: Hoare triple {16899#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:24:49,914 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:24:49,914 INFO L273 TraceCheckUtils]: 133: Hoare triple {16899#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:24:49,914 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:24:49,915 INFO L273 TraceCheckUtils]: 135: Hoare triple {16899#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16899#true} is VALID [2018-11-23 12:24:49,915 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:24:49,915 INFO L273 TraceCheckUtils]: 137: Hoare triple {16899#true} assume !(~i~0 < 100); {16899#true} is VALID [2018-11-23 12:24:49,915 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:24:49,915 INFO L273 TraceCheckUtils]: 139: Hoare triple {16899#true} assume true; {16899#true} is VALID [2018-11-23 12:24:49,915 INFO L268 TraceCheckUtils]: 140: Hoare quadruple {16899#true} {16900#false} #74#return; {16900#false} is VALID [2018-11-23 12:24:49,915 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:24:49,915 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:24:49,915 INFO L273 TraceCheckUtils]: 143: Hoare triple {16900#false} assume !false; {16900#false} is VALID [2018-11-23 12:24:49,925 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:24:49,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:49,925 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:24:49,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:24:49,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:50,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:50,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:51,073 INFO L256 TraceCheckUtils]: 0: Hoare triple {16899#true} call ULTIMATE.init(); {16899#true} is VALID [2018-11-23 12:24:51,074 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:24:51,074 INFO L273 TraceCheckUtils]: 2: Hoare triple {16899#true} assume true; {16899#true} is VALID [2018-11-23 12:24:51,074 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16899#true} {16899#true} #66#return; {16899#true} is VALID [2018-11-23 12:24:51,074 INFO L256 TraceCheckUtils]: 4: Hoare triple {16899#true} call #t~ret13 := main(); {16899#true} is VALID [2018-11-23 12:24:51,075 INFO L273 TraceCheckUtils]: 5: Hoare triple {16899#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:24:51,076 INFO L273 TraceCheckUtils]: 6: Hoare triple {16945#(<= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:24:51,076 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:24:51,077 INFO L273 TraceCheckUtils]: 8: Hoare triple {16902#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:24:51,077 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:24:51,078 INFO L273 TraceCheckUtils]: 10: Hoare triple {16903#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:24:51,079 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:24:51,079 INFO L273 TraceCheckUtils]: 12: Hoare triple {16904#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -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:24:51,080 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:24:51,080 INFO L273 TraceCheckUtils]: 14: Hoare triple {16905#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -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:24:51,081 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:24:51,081 INFO L273 TraceCheckUtils]: 16: Hoare triple {16906#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -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:24:51,082 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:24:51,083 INFO L273 TraceCheckUtils]: 18: Hoare triple {16907#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -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:24:51,083 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:24:51,084 INFO L273 TraceCheckUtils]: 20: Hoare triple {16908#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -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:24:51,084 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:24:51,085 INFO L273 TraceCheckUtils]: 22: Hoare triple {16909#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -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:24:51,086 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:24:51,086 INFO L273 TraceCheckUtils]: 24: Hoare triple {16910#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -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:24:51,087 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:24:51,087 INFO L273 TraceCheckUtils]: 26: Hoare triple {16911#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -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:24:51,088 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:24:51,088 INFO L273 TraceCheckUtils]: 28: Hoare triple {16912#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -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:24:51,089 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:24:51,090 INFO L273 TraceCheckUtils]: 30: Hoare triple {16913#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -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:24:51,090 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:24:51,091 INFO L273 TraceCheckUtils]: 32: Hoare triple {16914#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -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:24:51,091 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:24:51,092 INFO L273 TraceCheckUtils]: 34: Hoare triple {16915#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -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:24:51,093 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:24:51,093 INFO L273 TraceCheckUtils]: 36: Hoare triple {16916#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -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:24:51,094 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:24:51,094 INFO L273 TraceCheckUtils]: 38: Hoare triple {16917#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -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:24:51,095 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:24:51,095 INFO L273 TraceCheckUtils]: 40: Hoare triple {16918#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -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:24:51,096 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:24:51,097 INFO L273 TraceCheckUtils]: 42: Hoare triple {16919#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -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:24:51,097 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:24:51,098 INFO L273 TraceCheckUtils]: 44: Hoare triple {16920#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -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:24:51,098 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:24:51,099 INFO L273 TraceCheckUtils]: 46: Hoare triple {16921#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -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:24:51,100 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:24:51,100 INFO L273 TraceCheckUtils]: 48: Hoare triple {16922#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -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:24:51,101 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:24:51,101 INFO L273 TraceCheckUtils]: 50: Hoare triple {16923#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -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:24:51,102 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:24:51,102 INFO L273 TraceCheckUtils]: 52: Hoare triple {16924#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -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:24:51,103 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:24:51,103 INFO L273 TraceCheckUtils]: 54: Hoare triple {16925#(<= main_~i~1 24)} assume !!(~i~1 < 100);assume -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:24:51,104 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:24:51,105 INFO L273 TraceCheckUtils]: 56: Hoare triple {16926#(<= main_~i~1 25)} assume !(~i~1 < 100); {16900#false} is VALID [2018-11-23 12:24:51,105 INFO L256 TraceCheckUtils]: 57: Hoare triple {16900#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {16900#false} is VALID [2018-11-23 12:24:51,105 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:24:51,105 INFO L273 TraceCheckUtils]: 59: Hoare triple {16900#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:24:51,105 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:24:51,106 INFO L273 TraceCheckUtils]: 61: Hoare triple {16900#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:24:51,106 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:24:51,106 INFO L273 TraceCheckUtils]: 63: Hoare triple {16900#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:24:51,106 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:24:51,106 INFO L273 TraceCheckUtils]: 65: Hoare triple {16900#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:24:51,107 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:24:51,107 INFO L273 TraceCheckUtils]: 67: Hoare triple {16900#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:24:51,107 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:24:51,107 INFO L273 TraceCheckUtils]: 69: Hoare triple {16900#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:24:51,107 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:24:51,107 INFO L273 TraceCheckUtils]: 71: Hoare triple {16900#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:24:51,108 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:24:51,108 INFO L273 TraceCheckUtils]: 73: Hoare triple {16900#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:24:51,108 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:24:51,108 INFO L273 TraceCheckUtils]: 75: Hoare triple {16900#false} assume !(~i~0 < 100); {16900#false} is VALID [2018-11-23 12:24:51,108 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:24:51,108 INFO L273 TraceCheckUtils]: 77: Hoare triple {16900#false} assume true; {16900#false} is VALID [2018-11-23 12:24:51,108 INFO L268 TraceCheckUtils]: 78: Hoare quadruple {16900#false} {16900#false} #70#return; {16900#false} is VALID [2018-11-23 12:24:51,108 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:24:51,109 INFO L256 TraceCheckUtils]: 80: Hoare triple {16900#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {16900#false} is VALID [2018-11-23 12:24:51,109 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:24:51,109 INFO L273 TraceCheckUtils]: 82: Hoare triple {16900#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:24:51,109 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:24:51,109 INFO L273 TraceCheckUtils]: 84: Hoare triple {16900#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:24:51,109 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:24:51,109 INFO L273 TraceCheckUtils]: 86: Hoare triple {16900#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:24:51,109 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:24:51,109 INFO L273 TraceCheckUtils]: 88: Hoare triple {16900#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:24:51,110 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:24:51,110 INFO L273 TraceCheckUtils]: 90: Hoare triple {16900#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:24:51,110 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:24:51,110 INFO L273 TraceCheckUtils]: 92: Hoare triple {16900#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:24:51,110 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:24:51,110 INFO L273 TraceCheckUtils]: 94: Hoare triple {16900#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:24:51,110 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:24:51,110 INFO L273 TraceCheckUtils]: 96: Hoare triple {16900#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:24:51,110 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:24:51,110 INFO L273 TraceCheckUtils]: 98: Hoare triple {16900#false} assume !(~i~0 < 100); {16900#false} is VALID [2018-11-23 12:24:51,111 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:24:51,111 INFO L273 TraceCheckUtils]: 100: Hoare triple {16900#false} assume true; {16900#false} is VALID [2018-11-23 12:24:51,111 INFO L268 TraceCheckUtils]: 101: Hoare quadruple {16900#false} {16900#false} #72#return; {16900#false} is VALID [2018-11-23 12:24:51,111 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:24:51,111 INFO L273 TraceCheckUtils]: 103: Hoare triple {16900#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:51,111 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:24:51,111 INFO L273 TraceCheckUtils]: 105: Hoare triple {16900#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:51,111 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:24:51,111 INFO L273 TraceCheckUtils]: 107: Hoare triple {16900#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:51,111 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:24:51,112 INFO L273 TraceCheckUtils]: 109: Hoare triple {16900#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:51,112 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:24:51,112 INFO L273 TraceCheckUtils]: 111: Hoare triple {16900#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:51,112 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:24:51,112 INFO L273 TraceCheckUtils]: 113: Hoare triple {16900#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:51,112 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:24:51,112 INFO L273 TraceCheckUtils]: 115: Hoare triple {16900#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:51,112 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:24:51,112 INFO L273 TraceCheckUtils]: 117: Hoare triple {16900#false} assume !(~i~2 < 99); {16900#false} is VALID [2018-11-23 12:24:51,113 INFO L273 TraceCheckUtils]: 118: Hoare triple {16900#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {16900#false} is VALID [2018-11-23 12:24:51,113 INFO L256 TraceCheckUtils]: 119: Hoare triple {16900#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {16900#false} is VALID [2018-11-23 12:24:51,113 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:24:51,113 INFO L273 TraceCheckUtils]: 121: Hoare triple {16900#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:24:51,113 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:24:51,113 INFO L273 TraceCheckUtils]: 123: Hoare triple {16900#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:24:51,113 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:24:51,113 INFO L273 TraceCheckUtils]: 125: Hoare triple {16900#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:24:51,113 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:24:51,113 INFO L273 TraceCheckUtils]: 127: Hoare triple {16900#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:24:51,114 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:24:51,114 INFO L273 TraceCheckUtils]: 129: Hoare triple {16900#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:24:51,114 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:24:51,114 INFO L273 TraceCheckUtils]: 131: Hoare triple {16900#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:24:51,114 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:24:51,114 INFO L273 TraceCheckUtils]: 133: Hoare triple {16900#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:24:51,114 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:24:51,114 INFO L273 TraceCheckUtils]: 135: Hoare triple {16900#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {16900#false} is VALID [2018-11-23 12:24:51,114 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:24:51,114 INFO L273 TraceCheckUtils]: 137: Hoare triple {16900#false} assume !(~i~0 < 100); {16900#false} is VALID [2018-11-23 12:24:51,115 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:24:51,115 INFO L273 TraceCheckUtils]: 139: Hoare triple {16900#false} assume true; {16900#false} is VALID [2018-11-23 12:24:51,115 INFO L268 TraceCheckUtils]: 140: Hoare quadruple {16900#false} {16900#false} #74#return; {16900#false} is VALID [2018-11-23 12:24:51,115 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:24:51,115 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:24:51,115 INFO L273 TraceCheckUtils]: 143: Hoare triple {16900#false} assume !false; {16900#false} is VALID [2018-11-23 12:24:51,125 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:24:51,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:51,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-11-23 12:24:51,144 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 144 [2018-11-23 12:24:51,144 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:51,144 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 12:24:51,227 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:24:51,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 12:24:51,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 12:24:51,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 12:24:51,228 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand 29 states. [2018-11-23 12:24:51,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:51,887 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2018-11-23 12:24:51,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 12:24:51,887 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 144 [2018-11-23 12:24:51,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:51,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:24:51,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 104 transitions. [2018-11-23 12:24:51,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:24:51,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 104 transitions. [2018-11-23 12:24:51,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 104 transitions. [2018-11-23 12:24:51,982 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:24:51,984 INFO L225 Difference]: With dead ends: 152 [2018-11-23 12:24:51,984 INFO L226 Difference]: Without dead ends: 106 [2018-11-23 12:24:51,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 12:24:51,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-23 12:24:52,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-11-23 12:24:52,019 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:52,020 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 105 states. [2018-11-23 12:24:52,020 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 105 states. [2018-11-23 12:24:52,020 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 105 states. [2018-11-23 12:24:52,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:52,022 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2018-11-23 12:24:52,022 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2018-11-23 12:24:52,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:52,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:52,023 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 106 states. [2018-11-23 12:24:52,023 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 106 states. [2018-11-23 12:24:52,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:52,025 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2018-11-23 12:24:52,025 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2018-11-23 12:24:52,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:52,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:52,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:52,026 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:52,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-23 12:24:52,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2018-11-23 12:24:52,027 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 144 [2018-11-23 12:24:52,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:52,028 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2018-11-23 12:24:52,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 12:24:52,028 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-11-23 12:24:52,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-23 12:24:52,029 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:52,029 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:24:52,029 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:52,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:52,030 INFO L82 PathProgramCache]: Analyzing trace with hash -559946655, now seen corresponding path program 26 times [2018-11-23 12:24:52,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:52,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:52,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:52,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:24:52,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:52,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:52,511 INFO L256 TraceCheckUtils]: 0: Hoare triple {17953#true} call ULTIMATE.init(); {17953#true} is VALID [2018-11-23 12:24:52,511 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:24:52,511 INFO L273 TraceCheckUtils]: 2: Hoare triple {17953#true} assume true; {17953#true} is VALID [2018-11-23 12:24:52,511 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17953#true} {17953#true} #66#return; {17953#true} is VALID [2018-11-23 12:24:52,511 INFO L256 TraceCheckUtils]: 4: Hoare triple {17953#true} call #t~ret13 := main(); {17953#true} is VALID [2018-11-23 12:24:52,512 INFO L273 TraceCheckUtils]: 5: Hoare triple {17953#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:24:52,512 INFO L273 TraceCheckUtils]: 6: Hoare triple {17955#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:24:52,513 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:24:52,513 INFO L273 TraceCheckUtils]: 8: Hoare triple {17956#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:24:52,514 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:24:52,515 INFO L273 TraceCheckUtils]: 10: Hoare triple {17957#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:24:52,515 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:24:52,516 INFO L273 TraceCheckUtils]: 12: Hoare triple {17958#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -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:24:52,516 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:24:52,517 INFO L273 TraceCheckUtils]: 14: Hoare triple {17959#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -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:24:52,518 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:24:52,518 INFO L273 TraceCheckUtils]: 16: Hoare triple {17960#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -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:24:52,519 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:24:52,519 INFO L273 TraceCheckUtils]: 18: Hoare triple {17961#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -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:24:52,520 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:24:52,520 INFO L273 TraceCheckUtils]: 20: Hoare triple {17962#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -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:24:52,521 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:24:52,522 INFO L273 TraceCheckUtils]: 22: Hoare triple {17963#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -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:24:52,522 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:24:52,523 INFO L273 TraceCheckUtils]: 24: Hoare triple {17964#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -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:24:52,523 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:24:52,524 INFO L273 TraceCheckUtils]: 26: Hoare triple {17965#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -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:24:52,524 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:24:52,525 INFO L273 TraceCheckUtils]: 28: Hoare triple {17966#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -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:24:52,526 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:24:52,526 INFO L273 TraceCheckUtils]: 30: Hoare triple {17967#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -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:24:52,527 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:24:52,527 INFO L273 TraceCheckUtils]: 32: Hoare triple {17968#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -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:24:52,528 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:24:52,528 INFO L273 TraceCheckUtils]: 34: Hoare triple {17969#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -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:24:52,529 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:24:52,530 INFO L273 TraceCheckUtils]: 36: Hoare triple {17970#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -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:24:52,530 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:24:52,531 INFO L273 TraceCheckUtils]: 38: Hoare triple {17971#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -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:24:52,531 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:24:52,532 INFO L273 TraceCheckUtils]: 40: Hoare triple {17972#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -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:24:52,533 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:24:52,533 INFO L273 TraceCheckUtils]: 42: Hoare triple {17973#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -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:24:52,534 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:24:52,534 INFO L273 TraceCheckUtils]: 44: Hoare triple {17974#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -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:24:52,535 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:24:52,535 INFO L273 TraceCheckUtils]: 46: Hoare triple {17975#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -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:24:52,536 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:24:52,537 INFO L273 TraceCheckUtils]: 48: Hoare triple {17976#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -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:24:52,537 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:24:52,538 INFO L273 TraceCheckUtils]: 50: Hoare triple {17977#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -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:24:52,538 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:24:52,539 INFO L273 TraceCheckUtils]: 52: Hoare triple {17978#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -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:24:52,540 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:24:52,540 INFO L273 TraceCheckUtils]: 54: Hoare triple {17979#(<= main_~i~1 24)} assume !!(~i~1 < 100);assume -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:24:52,541 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:24:52,541 INFO L273 TraceCheckUtils]: 56: Hoare triple {17980#(<= main_~i~1 25)} assume !!(~i~1 < 100);assume -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:24:52,542 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:24:52,542 INFO L273 TraceCheckUtils]: 58: Hoare triple {17981#(<= main_~i~1 26)} assume !(~i~1 < 100); {17954#false} is VALID [2018-11-23 12:24:52,543 INFO L256 TraceCheckUtils]: 59: Hoare triple {17954#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {17953#true} is VALID [2018-11-23 12:24:52,543 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:24:52,543 INFO L273 TraceCheckUtils]: 61: Hoare triple {17953#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:24:52,543 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:24:52,543 INFO L273 TraceCheckUtils]: 63: Hoare triple {17953#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:24:52,544 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:24:52,544 INFO L273 TraceCheckUtils]: 65: Hoare triple {17953#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:24:52,544 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:24:52,544 INFO L273 TraceCheckUtils]: 67: Hoare triple {17953#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:24:52,544 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:24:52,544 INFO L273 TraceCheckUtils]: 69: Hoare triple {17953#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:24:52,545 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:24:52,545 INFO L273 TraceCheckUtils]: 71: Hoare triple {17953#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:24:52,545 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:24:52,545 INFO L273 TraceCheckUtils]: 73: Hoare triple {17953#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:24:52,545 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:24:52,545 INFO L273 TraceCheckUtils]: 75: Hoare triple {17953#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:24:52,546 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:24:52,546 INFO L273 TraceCheckUtils]: 77: Hoare triple {17953#true} assume !(~i~0 < 100); {17953#true} is VALID [2018-11-23 12:24:52,546 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:24:52,546 INFO L273 TraceCheckUtils]: 79: Hoare triple {17953#true} assume true; {17953#true} is VALID [2018-11-23 12:24:52,546 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {17953#true} {17954#false} #70#return; {17954#false} is VALID [2018-11-23 12:24:52,546 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:24:52,547 INFO L256 TraceCheckUtils]: 82: Hoare triple {17954#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {17953#true} is VALID [2018-11-23 12:24:52,547 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:24:52,547 INFO L273 TraceCheckUtils]: 84: Hoare triple {17953#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:24:52,547 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:24:52,547 INFO L273 TraceCheckUtils]: 86: Hoare triple {17953#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:24:52,547 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:24:52,548 INFO L273 TraceCheckUtils]: 88: Hoare triple {17953#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:24:52,548 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:24:52,548 INFO L273 TraceCheckUtils]: 90: Hoare triple {17953#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:24:52,548 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:24:52,548 INFO L273 TraceCheckUtils]: 92: Hoare triple {17953#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:24:52,548 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:24:52,548 INFO L273 TraceCheckUtils]: 94: Hoare triple {17953#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:24:52,548 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:24:52,549 INFO L273 TraceCheckUtils]: 96: Hoare triple {17953#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:24:52,549 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:24:52,549 INFO L273 TraceCheckUtils]: 98: Hoare triple {17953#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:24:52,549 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:24:52,549 INFO L273 TraceCheckUtils]: 100: Hoare triple {17953#true} assume !(~i~0 < 100); {17953#true} is VALID [2018-11-23 12:24:52,549 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:24:52,549 INFO L273 TraceCheckUtils]: 102: Hoare triple {17953#true} assume true; {17953#true} is VALID [2018-11-23 12:24:52,549 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {17953#true} {17954#false} #72#return; {17954#false} is VALID [2018-11-23 12:24:52,549 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:24:52,550 INFO L273 TraceCheckUtils]: 105: Hoare triple {17954#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:52,550 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:24:52,550 INFO L273 TraceCheckUtils]: 107: Hoare triple {17954#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:52,550 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:24:52,550 INFO L273 TraceCheckUtils]: 109: Hoare triple {17954#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:52,550 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:24:52,550 INFO L273 TraceCheckUtils]: 111: Hoare triple {17954#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:52,550 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:24:52,550 INFO L273 TraceCheckUtils]: 113: Hoare triple {17954#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:52,550 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:24:52,551 INFO L273 TraceCheckUtils]: 115: Hoare triple {17954#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:52,551 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:24:52,551 INFO L273 TraceCheckUtils]: 117: Hoare triple {17954#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:52,551 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:24:52,551 INFO L273 TraceCheckUtils]: 119: Hoare triple {17954#false} assume !(~i~2 < 99); {17954#false} is VALID [2018-11-23 12:24:52,551 INFO L273 TraceCheckUtils]: 120: Hoare triple {17954#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {17954#false} is VALID [2018-11-23 12:24:52,551 INFO L256 TraceCheckUtils]: 121: Hoare triple {17954#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {17953#true} is VALID [2018-11-23 12:24:52,551 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:24:52,551 INFO L273 TraceCheckUtils]: 123: Hoare triple {17953#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:24:52,551 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:24:52,552 INFO L273 TraceCheckUtils]: 125: Hoare triple {17953#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:24:52,552 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:24:52,552 INFO L273 TraceCheckUtils]: 127: Hoare triple {17953#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:24:52,552 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:24:52,552 INFO L273 TraceCheckUtils]: 129: Hoare triple {17953#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:24:52,552 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:24:52,552 INFO L273 TraceCheckUtils]: 131: Hoare triple {17953#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:24:52,552 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:24:52,552 INFO L273 TraceCheckUtils]: 133: Hoare triple {17953#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:24:52,552 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:24:52,553 INFO L273 TraceCheckUtils]: 135: Hoare triple {17953#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:24:52,553 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:24:52,553 INFO L273 TraceCheckUtils]: 137: Hoare triple {17953#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17953#true} is VALID [2018-11-23 12:24:52,553 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:24:52,553 INFO L273 TraceCheckUtils]: 139: Hoare triple {17953#true} assume !(~i~0 < 100); {17953#true} is VALID [2018-11-23 12:24:52,553 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:24:52,553 INFO L273 TraceCheckUtils]: 141: Hoare triple {17953#true} assume true; {17953#true} is VALID [2018-11-23 12:24:52,553 INFO L268 TraceCheckUtils]: 142: Hoare quadruple {17953#true} {17954#false} #74#return; {17954#false} is VALID [2018-11-23 12:24:52,553 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:24:52,554 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:24:52,554 INFO L273 TraceCheckUtils]: 145: Hoare triple {17954#false} assume !false; {17954#false} is VALID [2018-11-23 12:24:52,563 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:24:52,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:52,564 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:24:52,575 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:24:52,641 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:24:52,642 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:24:52,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:52,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:52,904 INFO L256 TraceCheckUtils]: 0: Hoare triple {17953#true} call ULTIMATE.init(); {17953#true} is VALID [2018-11-23 12:24:52,904 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:24:52,904 INFO L273 TraceCheckUtils]: 2: Hoare triple {17953#true} assume true; {17953#true} is VALID [2018-11-23 12:24:52,904 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17953#true} {17953#true} #66#return; {17953#true} is VALID [2018-11-23 12:24:52,904 INFO L256 TraceCheckUtils]: 4: Hoare triple {17953#true} call #t~ret13 := main(); {17953#true} is VALID [2018-11-23 12:24:52,905 INFO L273 TraceCheckUtils]: 5: Hoare triple {17953#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:24:52,906 INFO L273 TraceCheckUtils]: 6: Hoare triple {18000#(<= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:24:52,906 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:24:52,906 INFO L273 TraceCheckUtils]: 8: Hoare triple {17956#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:24:52,907 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:24:52,907 INFO L273 TraceCheckUtils]: 10: Hoare triple {17957#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:24:52,908 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:24:52,908 INFO L273 TraceCheckUtils]: 12: Hoare triple {17958#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -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:24:52,909 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:24:52,909 INFO L273 TraceCheckUtils]: 14: Hoare triple {17959#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -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:24:52,910 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:24:52,911 INFO L273 TraceCheckUtils]: 16: Hoare triple {17960#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -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:24:52,911 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:24:52,912 INFO L273 TraceCheckUtils]: 18: Hoare triple {17961#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -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:24:52,912 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:24:52,913 INFO L273 TraceCheckUtils]: 20: Hoare triple {17962#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -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:24:52,914 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:24:52,914 INFO L273 TraceCheckUtils]: 22: Hoare triple {17963#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -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:24:52,915 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:24:52,915 INFO L273 TraceCheckUtils]: 24: Hoare triple {17964#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -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:24:52,916 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:24:52,916 INFO L273 TraceCheckUtils]: 26: Hoare triple {17965#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -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:24:52,917 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:24:52,917 INFO L273 TraceCheckUtils]: 28: Hoare triple {17966#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -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:24:52,918 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:24:52,919 INFO L273 TraceCheckUtils]: 30: Hoare triple {17967#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -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:24:52,919 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:24:52,920 INFO L273 TraceCheckUtils]: 32: Hoare triple {17968#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -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:24:52,920 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:24:52,921 INFO L273 TraceCheckUtils]: 34: Hoare triple {17969#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -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:24:52,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:24:52,922 INFO L273 TraceCheckUtils]: 36: Hoare triple {17970#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -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:24:52,923 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:24:52,923 INFO L273 TraceCheckUtils]: 38: Hoare triple {17971#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -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:24:52,924 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:24:52,924 INFO L273 TraceCheckUtils]: 40: Hoare triple {17972#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -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:24:52,925 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:24:52,926 INFO L273 TraceCheckUtils]: 42: Hoare triple {17973#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -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:24:52,926 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:24:52,927 INFO L273 TraceCheckUtils]: 44: Hoare triple {17974#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -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:24:52,927 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:24:52,928 INFO L273 TraceCheckUtils]: 46: Hoare triple {17975#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -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:24:52,929 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:24:52,929 INFO L273 TraceCheckUtils]: 48: Hoare triple {17976#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -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:24:52,930 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:24:52,930 INFO L273 TraceCheckUtils]: 50: Hoare triple {17977#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -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:24:52,931 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:24:52,931 INFO L273 TraceCheckUtils]: 52: Hoare triple {17978#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -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:24:52,932 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:24:52,933 INFO L273 TraceCheckUtils]: 54: Hoare triple {17979#(<= main_~i~1 24)} assume !!(~i~1 < 100);assume -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:24:52,933 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:24:52,934 INFO L273 TraceCheckUtils]: 56: Hoare triple {17980#(<= main_~i~1 25)} assume !!(~i~1 < 100);assume -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:24:52,934 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:24:52,935 INFO L273 TraceCheckUtils]: 58: Hoare triple {17981#(<= main_~i~1 26)} assume !(~i~1 < 100); {17954#false} is VALID [2018-11-23 12:24:52,935 INFO L256 TraceCheckUtils]: 59: Hoare triple {17954#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {17954#false} is VALID [2018-11-23 12:24:52,935 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:24:52,936 INFO L273 TraceCheckUtils]: 61: Hoare triple {17954#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:24:52,936 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:24:52,936 INFO L273 TraceCheckUtils]: 63: Hoare triple {17954#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:24:52,936 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:24:52,936 INFO L273 TraceCheckUtils]: 65: Hoare triple {17954#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:24:52,936 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:24:52,937 INFO L273 TraceCheckUtils]: 67: Hoare triple {17954#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:24:52,937 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:24:52,937 INFO L273 TraceCheckUtils]: 69: Hoare triple {17954#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:24:52,937 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:24:52,937 INFO L273 TraceCheckUtils]: 71: Hoare triple {17954#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:24:52,937 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:24:52,938 INFO L273 TraceCheckUtils]: 73: Hoare triple {17954#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:24:52,938 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:24:52,938 INFO L273 TraceCheckUtils]: 75: Hoare triple {17954#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:24:52,938 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:24:52,938 INFO L273 TraceCheckUtils]: 77: Hoare triple {17954#false} assume !(~i~0 < 100); {17954#false} is VALID [2018-11-23 12:24:52,938 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:24:52,939 INFO L273 TraceCheckUtils]: 79: Hoare triple {17954#false} assume true; {17954#false} is VALID [2018-11-23 12:24:52,939 INFO L268 TraceCheckUtils]: 80: Hoare quadruple {17954#false} {17954#false} #70#return; {17954#false} is VALID [2018-11-23 12:24:52,939 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:24:52,939 INFO L256 TraceCheckUtils]: 82: Hoare triple {17954#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {17954#false} is VALID [2018-11-23 12:24:52,939 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:24:52,940 INFO L273 TraceCheckUtils]: 84: Hoare triple {17954#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:24:52,940 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:24:52,940 INFO L273 TraceCheckUtils]: 86: Hoare triple {17954#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:24:52,940 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:24:52,940 INFO L273 TraceCheckUtils]: 88: Hoare triple {17954#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:24:52,940 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:24:52,940 INFO L273 TraceCheckUtils]: 90: Hoare triple {17954#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:24:52,940 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:24:52,940 INFO L273 TraceCheckUtils]: 92: Hoare triple {17954#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:24:52,940 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:24:52,941 INFO L273 TraceCheckUtils]: 94: Hoare triple {17954#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:24:52,941 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:24:52,941 INFO L273 TraceCheckUtils]: 96: Hoare triple {17954#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:24:52,941 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:24:52,941 INFO L273 TraceCheckUtils]: 98: Hoare triple {17954#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:24:52,941 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:24:52,941 INFO L273 TraceCheckUtils]: 100: Hoare triple {17954#false} assume !(~i~0 < 100); {17954#false} is VALID [2018-11-23 12:24:52,941 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:24:52,941 INFO L273 TraceCheckUtils]: 102: Hoare triple {17954#false} assume true; {17954#false} is VALID [2018-11-23 12:24:52,941 INFO L268 TraceCheckUtils]: 103: Hoare quadruple {17954#false} {17954#false} #72#return; {17954#false} is VALID [2018-11-23 12:24:52,942 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:24:52,942 INFO L273 TraceCheckUtils]: 105: Hoare triple {17954#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:52,942 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:24:52,942 INFO L273 TraceCheckUtils]: 107: Hoare triple {17954#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:52,942 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:24:52,942 INFO L273 TraceCheckUtils]: 109: Hoare triple {17954#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:52,942 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:24:52,942 INFO L273 TraceCheckUtils]: 111: Hoare triple {17954#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:52,942 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:24:52,943 INFO L273 TraceCheckUtils]: 113: Hoare triple {17954#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:52,943 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:24:52,943 INFO L273 TraceCheckUtils]: 115: Hoare triple {17954#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:52,943 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:24:52,943 INFO L273 TraceCheckUtils]: 117: Hoare triple {17954#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:52,943 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:24:52,943 INFO L273 TraceCheckUtils]: 119: Hoare triple {17954#false} assume !(~i~2 < 99); {17954#false} is VALID [2018-11-23 12:24:52,943 INFO L273 TraceCheckUtils]: 120: Hoare triple {17954#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {17954#false} is VALID [2018-11-23 12:24:52,943 INFO L256 TraceCheckUtils]: 121: Hoare triple {17954#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {17954#false} is VALID [2018-11-23 12:24:52,943 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:24:52,944 INFO L273 TraceCheckUtils]: 123: Hoare triple {17954#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:24:52,944 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:24:52,944 INFO L273 TraceCheckUtils]: 125: Hoare triple {17954#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:24:52,944 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:24:52,944 INFO L273 TraceCheckUtils]: 127: Hoare triple {17954#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:24:52,944 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:24:52,944 INFO L273 TraceCheckUtils]: 129: Hoare triple {17954#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:24:52,944 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:24:52,944 INFO L273 TraceCheckUtils]: 131: Hoare triple {17954#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:24:52,945 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:24:52,945 INFO L273 TraceCheckUtils]: 133: Hoare triple {17954#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:24:52,945 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:24:52,945 INFO L273 TraceCheckUtils]: 135: Hoare triple {17954#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:24:52,945 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:24:52,945 INFO L273 TraceCheckUtils]: 137: Hoare triple {17954#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {17954#false} is VALID [2018-11-23 12:24:52,945 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:24:52,945 INFO L273 TraceCheckUtils]: 139: Hoare triple {17954#false} assume !(~i~0 < 100); {17954#false} is VALID [2018-11-23 12:24:52,945 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:24:52,945 INFO L273 TraceCheckUtils]: 141: Hoare triple {17954#false} assume true; {17954#false} is VALID [2018-11-23 12:24:52,946 INFO L268 TraceCheckUtils]: 142: Hoare quadruple {17954#false} {17954#false} #74#return; {17954#false} is VALID [2018-11-23 12:24:52,946 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:24:52,946 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:24:52,946 INFO L273 TraceCheckUtils]: 145: Hoare triple {17954#false} assume !false; {17954#false} is VALID [2018-11-23 12:24:52,956 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:24:52,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:52,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-11-23 12:24:52,975 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 146 [2018-11-23 12:24:52,976 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:52,976 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 12:24:53,061 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:24:53,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 12:24:53,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 12:24:53,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:24:53,063 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand 30 states. [2018-11-23 12:24:53,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:53,773 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2018-11-23 12:24:53,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 12:24:53,773 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 146 [2018-11-23 12:24:53,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:53,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:24:53,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 106 transitions. [2018-11-23 12:24:53,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:24:53,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 106 transitions. [2018-11-23 12:24:53,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 106 transitions. [2018-11-23 12:24:53,934 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:24:53,936 INFO L225 Difference]: With dead ends: 154 [2018-11-23 12:24:53,936 INFO L226 Difference]: Without dead ends: 108 [2018-11-23 12:24:53,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:24:53,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-23 12:24:53,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2018-11-23 12:24:53,988 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:53,988 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand 107 states. [2018-11-23 12:24:53,988 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 107 states. [2018-11-23 12:24:53,988 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 107 states. [2018-11-23 12:24:53,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:53,990 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2018-11-23 12:24:53,990 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2018-11-23 12:24:53,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:53,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:53,991 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 108 states. [2018-11-23 12:24:53,991 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 108 states. [2018-11-23 12:24:53,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:53,992 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2018-11-23 12:24:53,992 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2018-11-23 12:24:53,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:53,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:53,993 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:53,993 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:53,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-23 12:24:53,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2018-11-23 12:24:53,995 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 146 [2018-11-23 12:24:53,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:53,995 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2018-11-23 12:24:53,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 12:24:53,995 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2018-11-23 12:24:53,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-23 12:24:53,996 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:53,996 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:24:53,996 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:53,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:53,997 INFO L82 PathProgramCache]: Analyzing trace with hash 835998787, now seen corresponding path program 27 times [2018-11-23 12:24:53,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:53,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:53,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:53,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:24:53,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:54,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:54,565 INFO L256 TraceCheckUtils]: 0: Hoare triple {19024#true} call ULTIMATE.init(); {19024#true} is VALID [2018-11-23 12:24:54,565 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:24:54,565 INFO L273 TraceCheckUtils]: 2: Hoare triple {19024#true} assume true; {19024#true} is VALID [2018-11-23 12:24:54,565 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19024#true} {19024#true} #66#return; {19024#true} is VALID [2018-11-23 12:24:54,566 INFO L256 TraceCheckUtils]: 4: Hoare triple {19024#true} call #t~ret13 := main(); {19024#true} is VALID [2018-11-23 12:24:54,566 INFO L273 TraceCheckUtils]: 5: Hoare triple {19024#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:24:54,566 INFO L273 TraceCheckUtils]: 6: Hoare triple {19026#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:24:54,567 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:24:54,567 INFO L273 TraceCheckUtils]: 8: Hoare triple {19027#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:24:54,568 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:24:54,568 INFO L273 TraceCheckUtils]: 10: Hoare triple {19028#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:24:54,568 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:24:54,569 INFO L273 TraceCheckUtils]: 12: Hoare triple {19029#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -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:24:54,570 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:24:54,570 INFO L273 TraceCheckUtils]: 14: Hoare triple {19030#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -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:24:54,571 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:24:54,571 INFO L273 TraceCheckUtils]: 16: Hoare triple {19031#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -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:24:54,572 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:24:54,572 INFO L273 TraceCheckUtils]: 18: Hoare triple {19032#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -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:24:54,573 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:24:54,573 INFO L273 TraceCheckUtils]: 20: Hoare triple {19033#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -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:24:54,574 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:24:54,575 INFO L273 TraceCheckUtils]: 22: Hoare triple {19034#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -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:24:54,575 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:24:54,576 INFO L273 TraceCheckUtils]: 24: Hoare triple {19035#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -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:24:54,576 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:24:54,577 INFO L273 TraceCheckUtils]: 26: Hoare triple {19036#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -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:24:54,578 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:24:54,578 INFO L273 TraceCheckUtils]: 28: Hoare triple {19037#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -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:24:54,579 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:24:54,579 INFO L273 TraceCheckUtils]: 30: Hoare triple {19038#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -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:24:54,580 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:24:54,580 INFO L273 TraceCheckUtils]: 32: Hoare triple {19039#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -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:24:54,581 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:24:54,582 INFO L273 TraceCheckUtils]: 34: Hoare triple {19040#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -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:24:54,582 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:24:54,583 INFO L273 TraceCheckUtils]: 36: Hoare triple {19041#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -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:24:54,583 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:24:54,584 INFO L273 TraceCheckUtils]: 38: Hoare triple {19042#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -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:24:54,585 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:24:54,585 INFO L273 TraceCheckUtils]: 40: Hoare triple {19043#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -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:24:54,586 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:24:54,586 INFO L273 TraceCheckUtils]: 42: Hoare triple {19044#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -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:24:54,587 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:24:54,587 INFO L273 TraceCheckUtils]: 44: Hoare triple {19045#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -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:24:54,588 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:24:54,588 INFO L273 TraceCheckUtils]: 46: Hoare triple {19046#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -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:24:54,589 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:24:54,590 INFO L273 TraceCheckUtils]: 48: Hoare triple {19047#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -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:24:54,590 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:24:54,591 INFO L273 TraceCheckUtils]: 50: Hoare triple {19048#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -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:24:54,591 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:24:54,592 INFO L273 TraceCheckUtils]: 52: Hoare triple {19049#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -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:24:54,593 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:24:54,593 INFO L273 TraceCheckUtils]: 54: Hoare triple {19050#(<= main_~i~1 24)} assume !!(~i~1 < 100);assume -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:24:54,594 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:24:54,594 INFO L273 TraceCheckUtils]: 56: Hoare triple {19051#(<= main_~i~1 25)} assume !!(~i~1 < 100);assume -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:24:54,595 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:24:54,595 INFO L273 TraceCheckUtils]: 58: Hoare triple {19052#(<= main_~i~1 26)} assume !!(~i~1 < 100);assume -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:24:54,596 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:24:54,597 INFO L273 TraceCheckUtils]: 60: Hoare triple {19053#(<= main_~i~1 27)} assume !(~i~1 < 100); {19025#false} is VALID [2018-11-23 12:24:54,597 INFO L256 TraceCheckUtils]: 61: Hoare triple {19025#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {19024#true} is VALID [2018-11-23 12:24:54,597 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:24:54,597 INFO L273 TraceCheckUtils]: 63: Hoare triple {19024#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:24:54,597 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:24:54,598 INFO L273 TraceCheckUtils]: 65: Hoare triple {19024#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:24:54,598 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:24:54,598 INFO L273 TraceCheckUtils]: 67: Hoare triple {19024#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:24:54,598 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:24:54,598 INFO L273 TraceCheckUtils]: 69: Hoare triple {19024#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:24:54,598 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:24:54,599 INFO L273 TraceCheckUtils]: 71: Hoare triple {19024#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:24:54,599 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:24:54,599 INFO L273 TraceCheckUtils]: 73: Hoare triple {19024#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:24:54,599 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:24:54,599 INFO L273 TraceCheckUtils]: 75: Hoare triple {19024#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:24:54,599 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:24:54,600 INFO L273 TraceCheckUtils]: 77: Hoare triple {19024#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:24:54,600 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:24:54,600 INFO L273 TraceCheckUtils]: 79: Hoare triple {19024#true} assume !(~i~0 < 100); {19024#true} is VALID [2018-11-23 12:24:54,600 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:24:54,600 INFO L273 TraceCheckUtils]: 81: Hoare triple {19024#true} assume true; {19024#true} is VALID [2018-11-23 12:24:54,600 INFO L268 TraceCheckUtils]: 82: Hoare quadruple {19024#true} {19025#false} #70#return; {19025#false} is VALID [2018-11-23 12:24:54,600 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:24:54,600 INFO L256 TraceCheckUtils]: 84: Hoare triple {19025#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {19024#true} is VALID [2018-11-23 12:24:54,600 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:24:54,601 INFO L273 TraceCheckUtils]: 86: Hoare triple {19024#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:24:54,601 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:24:54,601 INFO L273 TraceCheckUtils]: 88: Hoare triple {19024#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:24:54,601 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:24:54,601 INFO L273 TraceCheckUtils]: 90: Hoare triple {19024#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:24:54,601 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:24:54,601 INFO L273 TraceCheckUtils]: 92: Hoare triple {19024#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:24:54,601 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:24:54,601 INFO L273 TraceCheckUtils]: 94: Hoare triple {19024#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:24:54,602 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:24:54,602 INFO L273 TraceCheckUtils]: 96: Hoare triple {19024#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:24:54,602 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:24:54,602 INFO L273 TraceCheckUtils]: 98: Hoare triple {19024#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:24:54,602 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:24:54,602 INFO L273 TraceCheckUtils]: 100: Hoare triple {19024#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:24:54,602 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:24:54,602 INFO L273 TraceCheckUtils]: 102: Hoare triple {19024#true} assume !(~i~0 < 100); {19024#true} is VALID [2018-11-23 12:24:54,602 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:24:54,602 INFO L273 TraceCheckUtils]: 104: Hoare triple {19024#true} assume true; {19024#true} is VALID [2018-11-23 12:24:54,603 INFO L268 TraceCheckUtils]: 105: Hoare quadruple {19024#true} {19025#false} #72#return; {19025#false} is VALID [2018-11-23 12:24:54,603 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:24:54,603 INFO L273 TraceCheckUtils]: 107: Hoare triple {19025#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:54,603 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:24:54,603 INFO L273 TraceCheckUtils]: 109: Hoare triple {19025#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:54,603 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:24:54,603 INFO L273 TraceCheckUtils]: 111: Hoare triple {19025#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:54,603 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:24:54,603 INFO L273 TraceCheckUtils]: 113: Hoare triple {19025#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:54,603 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:24:54,604 INFO L273 TraceCheckUtils]: 115: Hoare triple {19025#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:54,604 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:24:54,604 INFO L273 TraceCheckUtils]: 117: Hoare triple {19025#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:54,604 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:24:54,604 INFO L273 TraceCheckUtils]: 119: Hoare triple {19025#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:54,604 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:24:54,604 INFO L273 TraceCheckUtils]: 121: Hoare triple {19025#false} assume !(~i~2 < 99); {19025#false} is VALID [2018-11-23 12:24:54,604 INFO L273 TraceCheckUtils]: 122: Hoare triple {19025#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {19025#false} is VALID [2018-11-23 12:24:54,604 INFO L256 TraceCheckUtils]: 123: Hoare triple {19025#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {19024#true} is VALID [2018-11-23 12:24:54,605 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:24:54,605 INFO L273 TraceCheckUtils]: 125: Hoare triple {19024#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:24:54,605 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:24:54,605 INFO L273 TraceCheckUtils]: 127: Hoare triple {19024#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:24:54,605 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:24:54,605 INFO L273 TraceCheckUtils]: 129: Hoare triple {19024#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:24:54,605 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:24:54,605 INFO L273 TraceCheckUtils]: 131: Hoare triple {19024#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:24:54,605 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:24:54,605 INFO L273 TraceCheckUtils]: 133: Hoare triple {19024#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:24:54,606 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:24:54,606 INFO L273 TraceCheckUtils]: 135: Hoare triple {19024#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:24:54,606 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:24:54,606 INFO L273 TraceCheckUtils]: 137: Hoare triple {19024#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:24:54,606 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:24:54,606 INFO L273 TraceCheckUtils]: 139: Hoare triple {19024#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:24:54,606 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:24:54,606 INFO L273 TraceCheckUtils]: 141: Hoare triple {19024#true} assume !(~i~0 < 100); {19024#true} is VALID [2018-11-23 12:24:54,606 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:24:54,606 INFO L273 TraceCheckUtils]: 143: Hoare triple {19024#true} assume true; {19024#true} is VALID [2018-11-23 12:24:54,607 INFO L268 TraceCheckUtils]: 144: Hoare quadruple {19024#true} {19025#false} #74#return; {19025#false} is VALID [2018-11-23 12:24:54,607 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:24:54,607 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:24:54,607 INFO L273 TraceCheckUtils]: 147: Hoare triple {19025#false} assume !false; {19025#false} is VALID [2018-11-23 12:24:54,617 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:24:54,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:54,617 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:24:54,626 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:24:54,807 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 12:24:54,807 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:24:54,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:54,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:55,152 INFO L256 TraceCheckUtils]: 0: Hoare triple {19024#true} call ULTIMATE.init(); {19024#true} is VALID [2018-11-23 12:24:55,152 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:24:55,152 INFO L273 TraceCheckUtils]: 2: Hoare triple {19024#true} assume true; {19024#true} is VALID [2018-11-23 12:24:55,153 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19024#true} {19024#true} #66#return; {19024#true} is VALID [2018-11-23 12:24:55,153 INFO L256 TraceCheckUtils]: 4: Hoare triple {19024#true} call #t~ret13 := main(); {19024#true} is VALID [2018-11-23 12:24:55,153 INFO L273 TraceCheckUtils]: 5: Hoare triple {19024#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {19024#true} is VALID [2018-11-23 12:24:55,153 INFO L273 TraceCheckUtils]: 6: Hoare triple {19024#true} assume !!(~i~1 < 100);assume -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:24:55,153 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:24:55,153 INFO L273 TraceCheckUtils]: 8: Hoare triple {19024#true} assume !!(~i~1 < 100);assume -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:24:55,154 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:24:55,154 INFO L273 TraceCheckUtils]: 10: Hoare triple {19024#true} assume !!(~i~1 < 100);assume -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:24:55,154 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:24:55,154 INFO L273 TraceCheckUtils]: 12: Hoare triple {19024#true} assume !!(~i~1 < 100);assume -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:24:55,154 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:24:55,154 INFO L273 TraceCheckUtils]: 14: Hoare triple {19024#true} assume !!(~i~1 < 100);assume -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:24:55,154 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:24:55,154 INFO L273 TraceCheckUtils]: 16: Hoare triple {19024#true} assume !!(~i~1 < 100);assume -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:24:55,154 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:24:55,155 INFO L273 TraceCheckUtils]: 18: Hoare triple {19024#true} assume !!(~i~1 < 100);assume -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:24:55,155 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:24:55,155 INFO L273 TraceCheckUtils]: 20: Hoare triple {19024#true} assume !!(~i~1 < 100);assume -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:24:55,155 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:24:55,155 INFO L273 TraceCheckUtils]: 22: Hoare triple {19024#true} assume !!(~i~1 < 100);assume -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:24:55,155 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:24:55,155 INFO L273 TraceCheckUtils]: 24: Hoare triple {19024#true} assume !!(~i~1 < 100);assume -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:24:55,155 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:24:55,155 INFO L273 TraceCheckUtils]: 26: Hoare triple {19024#true} assume !!(~i~1 < 100);assume -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:24:55,156 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:24:55,156 INFO L273 TraceCheckUtils]: 28: Hoare triple {19024#true} assume !!(~i~1 < 100);assume -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:24:55,156 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:24:55,156 INFO L273 TraceCheckUtils]: 30: Hoare triple {19024#true} assume !!(~i~1 < 100);assume -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:24:55,156 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:24:55,156 INFO L273 TraceCheckUtils]: 32: Hoare triple {19024#true} assume !!(~i~1 < 100);assume -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:24:55,156 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:24:55,156 INFO L273 TraceCheckUtils]: 34: Hoare triple {19024#true} assume !!(~i~1 < 100);assume -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:24:55,156 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:24:55,156 INFO L273 TraceCheckUtils]: 36: Hoare triple {19024#true} assume !!(~i~1 < 100);assume -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:24:55,157 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:24:55,157 INFO L273 TraceCheckUtils]: 38: Hoare triple {19024#true} assume !!(~i~1 < 100);assume -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:24:55,157 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:24:55,157 INFO L273 TraceCheckUtils]: 40: Hoare triple {19024#true} assume !!(~i~1 < 100);assume -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:24:55,157 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:24:55,157 INFO L273 TraceCheckUtils]: 42: Hoare triple {19024#true} assume !!(~i~1 < 100);assume -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:24:55,157 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:24:55,157 INFO L273 TraceCheckUtils]: 44: Hoare triple {19024#true} assume !!(~i~1 < 100);assume -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:24:55,157 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:24:55,157 INFO L273 TraceCheckUtils]: 46: Hoare triple {19024#true} assume !!(~i~1 < 100);assume -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:24:55,158 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:24:55,158 INFO L273 TraceCheckUtils]: 48: Hoare triple {19024#true} assume !!(~i~1 < 100);assume -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:24:55,158 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:24:55,158 INFO L273 TraceCheckUtils]: 50: Hoare triple {19024#true} assume !!(~i~1 < 100);assume -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:24:55,158 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:24:55,158 INFO L273 TraceCheckUtils]: 52: Hoare triple {19024#true} assume !!(~i~1 < 100);assume -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:24:55,158 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:24:55,158 INFO L273 TraceCheckUtils]: 54: Hoare triple {19024#true} assume !!(~i~1 < 100);assume -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:24:55,158 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:24:55,159 INFO L273 TraceCheckUtils]: 56: Hoare triple {19024#true} assume !!(~i~1 < 100);assume -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:24:55,159 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:24:55,159 INFO L273 TraceCheckUtils]: 58: Hoare triple {19024#true} assume !!(~i~1 < 100);assume -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:24:55,159 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:24:55,159 INFO L273 TraceCheckUtils]: 60: Hoare triple {19024#true} assume !(~i~1 < 100); {19024#true} is VALID [2018-11-23 12:24:55,159 INFO L256 TraceCheckUtils]: 61: Hoare triple {19024#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {19024#true} is VALID [2018-11-23 12:24:55,159 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:24:55,159 INFO L273 TraceCheckUtils]: 63: Hoare triple {19024#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:24:55,159 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:24:55,159 INFO L273 TraceCheckUtils]: 65: Hoare triple {19024#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:24:55,160 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:24:55,160 INFO L273 TraceCheckUtils]: 67: Hoare triple {19024#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:24:55,160 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:24:55,160 INFO L273 TraceCheckUtils]: 69: Hoare triple {19024#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:24:55,160 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:24:55,160 INFO L273 TraceCheckUtils]: 71: Hoare triple {19024#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:24:55,160 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:24:55,160 INFO L273 TraceCheckUtils]: 73: Hoare triple {19024#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:24:55,160 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:24:55,160 INFO L273 TraceCheckUtils]: 75: Hoare triple {19024#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:24:55,161 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:24:55,161 INFO L273 TraceCheckUtils]: 77: Hoare triple {19024#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:24:55,161 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:24:55,161 INFO L273 TraceCheckUtils]: 79: Hoare triple {19024#true} assume !(~i~0 < 100); {19024#true} is VALID [2018-11-23 12:24:55,161 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:24:55,161 INFO L273 TraceCheckUtils]: 81: Hoare triple {19024#true} assume true; {19024#true} is VALID [2018-11-23 12:24:55,161 INFO L268 TraceCheckUtils]: 82: Hoare quadruple {19024#true} {19024#true} #70#return; {19024#true} is VALID [2018-11-23 12:24:55,161 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:24:55,161 INFO L256 TraceCheckUtils]: 84: Hoare triple {19024#true} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {19024#true} is VALID [2018-11-23 12:24:55,161 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:24:55,162 INFO L273 TraceCheckUtils]: 86: Hoare triple {19024#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:24:55,162 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:24:55,162 INFO L273 TraceCheckUtils]: 88: Hoare triple {19024#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:24:55,162 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:24:55,162 INFO L273 TraceCheckUtils]: 90: Hoare triple {19024#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:24:55,162 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:24:55,162 INFO L273 TraceCheckUtils]: 92: Hoare triple {19024#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:24:55,162 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:24:55,162 INFO L273 TraceCheckUtils]: 94: Hoare triple {19024#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:24:55,163 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:24:55,163 INFO L273 TraceCheckUtils]: 96: Hoare triple {19024#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:24:55,163 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:24:55,163 INFO L273 TraceCheckUtils]: 98: Hoare triple {19024#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:24:55,163 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:24:55,163 INFO L273 TraceCheckUtils]: 100: Hoare triple {19024#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19024#true} is VALID [2018-11-23 12:24:55,163 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:24:55,163 INFO L273 TraceCheckUtils]: 102: Hoare triple {19024#true} assume !(~i~0 < 100); {19024#true} is VALID [2018-11-23 12:24:55,163 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:24:55,163 INFO L273 TraceCheckUtils]: 104: Hoare triple {19024#true} assume true; {19024#true} is VALID [2018-11-23 12:24:55,164 INFO L268 TraceCheckUtils]: 105: Hoare quadruple {19024#true} {19024#true} #72#return; {19024#true} is VALID [2018-11-23 12:24:55,164 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:24:55,164 INFO L273 TraceCheckUtils]: 107: Hoare triple {19375#(<= main_~i~2 0)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:55,165 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:24:55,165 INFO L273 TraceCheckUtils]: 109: Hoare triple {19382#(<= main_~i~2 1)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:55,166 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:24:55,166 INFO L273 TraceCheckUtils]: 111: Hoare triple {19389#(<= main_~i~2 2)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:55,166 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:24:55,167 INFO L273 TraceCheckUtils]: 113: Hoare triple {19396#(<= main_~i~2 3)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:55,167 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:24:55,168 INFO L273 TraceCheckUtils]: 115: Hoare triple {19403#(<= main_~i~2 4)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:55,168 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:24:55,169 INFO L273 TraceCheckUtils]: 117: Hoare triple {19410#(<= main_~i~2 5)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:55,169 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:24:55,170 INFO L273 TraceCheckUtils]: 119: Hoare triple {19417#(<= main_~i~2 6)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:55,171 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:24:55,171 INFO L273 TraceCheckUtils]: 121: Hoare triple {19424#(<= main_~i~2 7)} assume !(~i~2 < 99); {19025#false} is VALID [2018-11-23 12:24:55,171 INFO L273 TraceCheckUtils]: 122: Hoare triple {19025#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {19025#false} is VALID [2018-11-23 12:24:55,172 INFO L256 TraceCheckUtils]: 123: Hoare triple {19025#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {19025#false} is VALID [2018-11-23 12:24:55,172 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:24:55,172 INFO L273 TraceCheckUtils]: 125: Hoare triple {19025#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19025#false} is VALID [2018-11-23 12:24:55,172 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:24:55,172 INFO L273 TraceCheckUtils]: 127: Hoare triple {19025#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19025#false} is VALID [2018-11-23 12:24:55,172 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:24:55,173 INFO L273 TraceCheckUtils]: 129: Hoare triple {19025#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19025#false} is VALID [2018-11-23 12:24:55,173 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:24:55,173 INFO L273 TraceCheckUtils]: 131: Hoare triple {19025#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19025#false} is VALID [2018-11-23 12:24:55,173 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:24:55,174 INFO L273 TraceCheckUtils]: 133: Hoare triple {19025#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19025#false} is VALID [2018-11-23 12:24:55,174 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:24:55,174 INFO L273 TraceCheckUtils]: 135: Hoare triple {19025#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19025#false} is VALID [2018-11-23 12:24:55,174 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:24:55,175 INFO L273 TraceCheckUtils]: 137: Hoare triple {19025#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19025#false} is VALID [2018-11-23 12:24:55,175 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:24:55,175 INFO L273 TraceCheckUtils]: 139: Hoare triple {19025#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {19025#false} is VALID [2018-11-23 12:24:55,175 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:24:55,176 INFO L273 TraceCheckUtils]: 141: Hoare triple {19025#false} assume !(~i~0 < 100); {19025#false} is VALID [2018-11-23 12:24:55,176 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:24:55,176 INFO L273 TraceCheckUtils]: 143: Hoare triple {19025#false} assume true; {19025#false} is VALID [2018-11-23 12:24:55,176 INFO L268 TraceCheckUtils]: 144: Hoare quadruple {19025#false} {19025#false} #74#return; {19025#false} is VALID [2018-11-23 12:24:55,176 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:24:55,176 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:24:55,177 INFO L273 TraceCheckUtils]: 147: Hoare triple {19025#false} assume !false; {19025#false} is VALID [2018-11-23 12:24:55,210 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:24:55,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:55,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 10] total 38 [2018-11-23 12:24:55,229 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 148 [2018-11-23 12:24:55,230 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:55,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-23 12:24:55,567 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:24:55,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-23 12:24:55,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-23 12:24:55,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=479, Invalid=927, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 12:24:55,569 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 38 states. [2018-11-23 12:24:56,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:56,494 INFO L93 Difference]: Finished difference Result 159 states and 168 transitions. [2018-11-23 12:24:56,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-23 12:24:56,494 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 148 [2018-11-23 12:24:56,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:56,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:24:56,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 125 transitions. [2018-11-23 12:24:56,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:24:56,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 125 transitions. [2018-11-23 12:24:56,497 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 125 transitions. [2018-11-23 12:24:56,655 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:24:56,657 INFO L225 Difference]: With dead ends: 159 [2018-11-23 12:24:56,658 INFO L226 Difference]: Without dead ends: 113 [2018-11-23 12:24:56,659 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:24:56,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-23 12:24:56,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2018-11-23 12:24:56,817 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:56,817 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand 111 states. [2018-11-23 12:24:56,817 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 111 states. [2018-11-23 12:24:56,817 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 111 states. [2018-11-23 12:24:56,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:56,819 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-11-23 12:24:56,819 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2018-11-23 12:24:56,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:56,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:56,820 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 113 states. [2018-11-23 12:24:56,820 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 113 states. [2018-11-23 12:24:56,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:56,822 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-11-23 12:24:56,822 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2018-11-23 12:24:56,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:56,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:56,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:56,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:56,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-23 12:24:56,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2018-11-23 12:24:56,825 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 148 [2018-11-23 12:24:56,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:56,826 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2018-11-23 12:24:56,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-23 12:24:56,826 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2018-11-23 12:24:56,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-23 12:24:56,827 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:56,827 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:24:56,827 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:56,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:56,827 INFO L82 PathProgramCache]: Analyzing trace with hash 894020771, now seen corresponding path program 28 times [2018-11-23 12:24:56,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:56,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:56,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:56,828 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:24:56,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:56,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:57,502 INFO L256 TraceCheckUtils]: 0: Hoare triple {20132#true} call ULTIMATE.init(); {20132#true} is VALID [2018-11-23 12:24:57,502 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:24:57,502 INFO L273 TraceCheckUtils]: 2: Hoare triple {20132#true} assume true; {20132#true} is VALID [2018-11-23 12:24:57,502 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20132#true} {20132#true} #66#return; {20132#true} is VALID [2018-11-23 12:24:57,503 INFO L256 TraceCheckUtils]: 4: Hoare triple {20132#true} call #t~ret13 := main(); {20132#true} is VALID [2018-11-23 12:24:57,503 INFO L273 TraceCheckUtils]: 5: Hoare triple {20132#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:24:57,504 INFO L273 TraceCheckUtils]: 6: Hoare triple {20134#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:24:57,504 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:24:57,505 INFO L273 TraceCheckUtils]: 8: Hoare triple {20135#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:24:57,505 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:24:57,505 INFO L273 TraceCheckUtils]: 10: Hoare triple {20136#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:24:57,506 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:24:57,506 INFO L273 TraceCheckUtils]: 12: Hoare triple {20137#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -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:24:57,507 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:24:57,507 INFO L273 TraceCheckUtils]: 14: Hoare triple {20138#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -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:24:57,508 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:24:57,508 INFO L273 TraceCheckUtils]: 16: Hoare triple {20139#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -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:24:57,509 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:24:57,509 INFO L273 TraceCheckUtils]: 18: Hoare triple {20140#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -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:24:57,510 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:24:57,511 INFO L273 TraceCheckUtils]: 20: Hoare triple {20141#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -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:24:57,511 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:24:57,512 INFO L273 TraceCheckUtils]: 22: Hoare triple {20142#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -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:24:57,512 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:24:57,513 INFO L273 TraceCheckUtils]: 24: Hoare triple {20143#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -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:24:57,514 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:24:57,514 INFO L273 TraceCheckUtils]: 26: Hoare triple {20144#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -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:24:57,515 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:24:57,515 INFO L273 TraceCheckUtils]: 28: Hoare triple {20145#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -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:24:57,516 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:24:57,517 INFO L273 TraceCheckUtils]: 30: Hoare triple {20146#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -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:24:57,517 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:24:57,518 INFO L273 TraceCheckUtils]: 32: Hoare triple {20147#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -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:24:57,518 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:24:57,519 INFO L273 TraceCheckUtils]: 34: Hoare triple {20148#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -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:24:57,520 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:24:57,520 INFO L273 TraceCheckUtils]: 36: Hoare triple {20149#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -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:24:57,521 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:24:57,521 INFO L273 TraceCheckUtils]: 38: Hoare triple {20150#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -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:24:57,522 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:24:57,522 INFO L273 TraceCheckUtils]: 40: Hoare triple {20151#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -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:24:57,523 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:24:57,523 INFO L273 TraceCheckUtils]: 42: Hoare triple {20152#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -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:24:57,524 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:24:57,525 INFO L273 TraceCheckUtils]: 44: Hoare triple {20153#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -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:24:57,525 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:24:57,526 INFO L273 TraceCheckUtils]: 46: Hoare triple {20154#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -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:24:57,526 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:24:57,527 INFO L273 TraceCheckUtils]: 48: Hoare triple {20155#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -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:24:57,528 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:24:57,528 INFO L273 TraceCheckUtils]: 50: Hoare triple {20156#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -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:24:57,529 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:24:57,529 INFO L273 TraceCheckUtils]: 52: Hoare triple {20157#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -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:24:57,530 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:24:57,530 INFO L273 TraceCheckUtils]: 54: Hoare triple {20158#(<= main_~i~1 24)} assume !!(~i~1 < 100);assume -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:24:57,531 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:24:57,532 INFO L273 TraceCheckUtils]: 56: Hoare triple {20159#(<= main_~i~1 25)} assume !!(~i~1 < 100);assume -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:24:57,532 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:24:57,533 INFO L273 TraceCheckUtils]: 58: Hoare triple {20160#(<= main_~i~1 26)} assume !!(~i~1 < 100);assume -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:24:57,533 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:24:57,534 INFO L273 TraceCheckUtils]: 60: Hoare triple {20161#(<= main_~i~1 27)} assume !!(~i~1 < 100);assume -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:24:57,535 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:24:57,535 INFO L273 TraceCheckUtils]: 62: Hoare triple {20162#(<= main_~i~1 28)} assume !(~i~1 < 100); {20133#false} is VALID [2018-11-23 12:24:57,535 INFO L256 TraceCheckUtils]: 63: Hoare triple {20133#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {20132#true} is VALID [2018-11-23 12:24:57,536 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:24:57,536 INFO L273 TraceCheckUtils]: 65: Hoare triple {20132#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:24:57,536 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:24:57,536 INFO L273 TraceCheckUtils]: 67: Hoare triple {20132#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:24:57,536 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:24:57,536 INFO L273 TraceCheckUtils]: 69: Hoare triple {20132#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:24:57,537 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:24:57,537 INFO L273 TraceCheckUtils]: 71: Hoare triple {20132#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:24:57,537 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:24:57,537 INFO L273 TraceCheckUtils]: 73: Hoare triple {20132#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:24:57,537 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:24:57,537 INFO L273 TraceCheckUtils]: 75: Hoare triple {20132#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:24:57,538 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:24:57,538 INFO L273 TraceCheckUtils]: 77: Hoare triple {20132#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:24:57,538 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:24:57,538 INFO L273 TraceCheckUtils]: 79: Hoare triple {20132#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:24:57,538 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:24:57,538 INFO L273 TraceCheckUtils]: 81: Hoare triple {20132#true} assume !(~i~0 < 100); {20132#true} is VALID [2018-11-23 12:24:57,539 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:24:57,539 INFO L273 TraceCheckUtils]: 83: Hoare triple {20132#true} assume true; {20132#true} is VALID [2018-11-23 12:24:57,539 INFO L268 TraceCheckUtils]: 84: Hoare quadruple {20132#true} {20133#false} #70#return; {20133#false} is VALID [2018-11-23 12:24:57,539 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:24:57,539 INFO L256 TraceCheckUtils]: 86: Hoare triple {20133#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {20132#true} is VALID [2018-11-23 12:24:57,539 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:24:57,539 INFO L273 TraceCheckUtils]: 88: Hoare triple {20132#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:24:57,540 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:24:57,540 INFO L273 TraceCheckUtils]: 90: Hoare triple {20132#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:24:57,540 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:24:57,540 INFO L273 TraceCheckUtils]: 92: Hoare triple {20132#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:24:57,540 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:24:57,540 INFO L273 TraceCheckUtils]: 94: Hoare triple {20132#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:24:57,540 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:24:57,540 INFO L273 TraceCheckUtils]: 96: Hoare triple {20132#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:24:57,540 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:24:57,541 INFO L273 TraceCheckUtils]: 98: Hoare triple {20132#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:24:57,541 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:24:57,541 INFO L273 TraceCheckUtils]: 100: Hoare triple {20132#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:24:57,541 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:24:57,541 INFO L273 TraceCheckUtils]: 102: Hoare triple {20132#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:24:57,541 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:24:57,541 INFO L273 TraceCheckUtils]: 104: Hoare triple {20132#true} assume !(~i~0 < 100); {20132#true} is VALID [2018-11-23 12:24:57,541 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:24:57,541 INFO L273 TraceCheckUtils]: 106: Hoare triple {20132#true} assume true; {20132#true} is VALID [2018-11-23 12:24:57,541 INFO L268 TraceCheckUtils]: 107: Hoare quadruple {20132#true} {20133#false} #72#return; {20133#false} is VALID [2018-11-23 12:24:57,542 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:24:57,542 INFO L273 TraceCheckUtils]: 109: Hoare triple {20133#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:57,542 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:24:57,542 INFO L273 TraceCheckUtils]: 111: Hoare triple {20133#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:57,542 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:24:57,542 INFO L273 TraceCheckUtils]: 113: Hoare triple {20133#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:57,542 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:24:57,542 INFO L273 TraceCheckUtils]: 115: Hoare triple {20133#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:57,542 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:24:57,543 INFO L273 TraceCheckUtils]: 117: Hoare triple {20133#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:57,543 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:24:57,543 INFO L273 TraceCheckUtils]: 119: Hoare triple {20133#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:57,543 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:24:57,543 INFO L273 TraceCheckUtils]: 121: Hoare triple {20133#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:57,543 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:24:57,544 INFO L273 TraceCheckUtils]: 123: Hoare triple {20133#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:57,544 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:24:57,544 INFO L273 TraceCheckUtils]: 125: Hoare triple {20133#false} assume !(~i~2 < 99); {20133#false} is VALID [2018-11-23 12:24:57,544 INFO L273 TraceCheckUtils]: 126: Hoare triple {20133#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {20133#false} is VALID [2018-11-23 12:24:57,544 INFO L256 TraceCheckUtils]: 127: Hoare triple {20133#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {20132#true} is VALID [2018-11-23 12:24:57,544 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:24:57,545 INFO L273 TraceCheckUtils]: 129: Hoare triple {20132#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:24:57,545 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:24:57,545 INFO L273 TraceCheckUtils]: 131: Hoare triple {20132#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:24:57,545 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:24:57,545 INFO L273 TraceCheckUtils]: 133: Hoare triple {20132#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:24:57,545 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:24:57,546 INFO L273 TraceCheckUtils]: 135: Hoare triple {20132#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:24:57,546 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:24:57,546 INFO L273 TraceCheckUtils]: 137: Hoare triple {20132#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:24:57,546 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:24:57,546 INFO L273 TraceCheckUtils]: 139: Hoare triple {20132#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:24:57,546 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:24:57,547 INFO L273 TraceCheckUtils]: 141: Hoare triple {20132#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:24:57,547 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:24:57,547 INFO L273 TraceCheckUtils]: 143: Hoare triple {20132#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:24:57,547 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:24:57,547 INFO L273 TraceCheckUtils]: 145: Hoare triple {20132#true} assume !(~i~0 < 100); {20132#true} is VALID [2018-11-23 12:24:57,547 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:24:57,548 INFO L273 TraceCheckUtils]: 147: Hoare triple {20132#true} assume true; {20132#true} is VALID [2018-11-23 12:24:57,548 INFO L268 TraceCheckUtils]: 148: Hoare quadruple {20132#true} {20133#false} #74#return; {20133#false} is VALID [2018-11-23 12:24:57,548 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:24:57,548 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:24:57,548 INFO L273 TraceCheckUtils]: 151: Hoare triple {20133#false} assume !false; {20133#false} is VALID [2018-11-23 12:24:57,562 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:24:57,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:57,562 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:24:57,581 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:24:57,643 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:24:57,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:24:57,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:57,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:57,960 INFO L256 TraceCheckUtils]: 0: Hoare triple {20132#true} call ULTIMATE.init(); {20132#true} is VALID [2018-11-23 12:24:57,960 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:24:57,960 INFO L273 TraceCheckUtils]: 2: Hoare triple {20132#true} assume true; {20132#true} is VALID [2018-11-23 12:24:57,960 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20132#true} {20132#true} #66#return; {20132#true} is VALID [2018-11-23 12:24:57,961 INFO L256 TraceCheckUtils]: 4: Hoare triple {20132#true} call #t~ret13 := main(); {20132#true} is VALID [2018-11-23 12:24:57,961 INFO L273 TraceCheckUtils]: 5: Hoare triple {20132#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {20132#true} is VALID [2018-11-23 12:24:57,961 INFO L273 TraceCheckUtils]: 6: Hoare triple {20132#true} assume !!(~i~1 < 100);assume -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:24:57,961 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:24:57,961 INFO L273 TraceCheckUtils]: 8: Hoare triple {20132#true} assume !!(~i~1 < 100);assume -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:24:57,962 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:24:57,962 INFO L273 TraceCheckUtils]: 10: Hoare triple {20132#true} assume !!(~i~1 < 100);assume -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:24:57,962 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:24:57,962 INFO L273 TraceCheckUtils]: 12: Hoare triple {20132#true} assume !!(~i~1 < 100);assume -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:24:57,962 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:24:57,962 INFO L273 TraceCheckUtils]: 14: Hoare triple {20132#true} assume !!(~i~1 < 100);assume -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:24:57,962 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:24:57,962 INFO L273 TraceCheckUtils]: 16: Hoare triple {20132#true} assume !!(~i~1 < 100);assume -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:24:57,963 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:24:57,963 INFO L273 TraceCheckUtils]: 18: Hoare triple {20132#true} assume !!(~i~1 < 100);assume -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:24:57,963 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:24:57,963 INFO L273 TraceCheckUtils]: 20: Hoare triple {20132#true} assume !!(~i~1 < 100);assume -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:24:57,963 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:24:57,963 INFO L273 TraceCheckUtils]: 22: Hoare triple {20132#true} assume !!(~i~1 < 100);assume -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:24:57,963 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:24:57,963 INFO L273 TraceCheckUtils]: 24: Hoare triple {20132#true} assume !!(~i~1 < 100);assume -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:24:57,963 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:24:57,963 INFO L273 TraceCheckUtils]: 26: Hoare triple {20132#true} assume !!(~i~1 < 100);assume -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:24:57,964 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:24:57,964 INFO L273 TraceCheckUtils]: 28: Hoare triple {20132#true} assume !!(~i~1 < 100);assume -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:24:57,964 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:24:57,964 INFO L273 TraceCheckUtils]: 30: Hoare triple {20132#true} assume !!(~i~1 < 100);assume -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:24:57,964 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:24:57,964 INFO L273 TraceCheckUtils]: 32: Hoare triple {20132#true} assume !!(~i~1 < 100);assume -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:24:57,964 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:24:57,964 INFO L273 TraceCheckUtils]: 34: Hoare triple {20132#true} assume !!(~i~1 < 100);assume -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:24:57,964 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:24:57,964 INFO L273 TraceCheckUtils]: 36: Hoare triple {20132#true} assume !!(~i~1 < 100);assume -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:24:57,965 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:24:57,965 INFO L273 TraceCheckUtils]: 38: Hoare triple {20132#true} assume !!(~i~1 < 100);assume -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:24:57,965 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:24:57,965 INFO L273 TraceCheckUtils]: 40: Hoare triple {20132#true} assume !!(~i~1 < 100);assume -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:24:57,965 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:24:57,965 INFO L273 TraceCheckUtils]: 42: Hoare triple {20132#true} assume !!(~i~1 < 100);assume -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:24:57,965 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:24:57,965 INFO L273 TraceCheckUtils]: 44: Hoare triple {20132#true} assume !!(~i~1 < 100);assume -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:24:57,965 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:24:57,965 INFO L273 TraceCheckUtils]: 46: Hoare triple {20132#true} assume !!(~i~1 < 100);assume -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:24:57,966 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:24:57,966 INFO L273 TraceCheckUtils]: 48: Hoare triple {20132#true} assume !!(~i~1 < 100);assume -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:24:57,966 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:24:57,966 INFO L273 TraceCheckUtils]: 50: Hoare triple {20132#true} assume !!(~i~1 < 100);assume -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:24:57,966 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:24:57,966 INFO L273 TraceCheckUtils]: 52: Hoare triple {20132#true} assume !!(~i~1 < 100);assume -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:24:57,966 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:24:57,966 INFO L273 TraceCheckUtils]: 54: Hoare triple {20132#true} assume !!(~i~1 < 100);assume -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:24:57,966 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:24:57,967 INFO L273 TraceCheckUtils]: 56: Hoare triple {20132#true} assume !!(~i~1 < 100);assume -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:24:57,967 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:24:57,967 INFO L273 TraceCheckUtils]: 58: Hoare triple {20132#true} assume !!(~i~1 < 100);assume -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:24:57,967 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:24:57,967 INFO L273 TraceCheckUtils]: 60: Hoare triple {20132#true} assume !!(~i~1 < 100);assume -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:24:57,967 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:24:57,967 INFO L273 TraceCheckUtils]: 62: Hoare triple {20132#true} assume !(~i~1 < 100); {20132#true} is VALID [2018-11-23 12:24:57,967 INFO L256 TraceCheckUtils]: 63: Hoare triple {20132#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {20132#true} is VALID [2018-11-23 12:24:57,967 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:24:57,967 INFO L273 TraceCheckUtils]: 65: Hoare triple {20132#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:24:57,968 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:24:57,968 INFO L273 TraceCheckUtils]: 67: Hoare triple {20132#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:24:57,968 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:24:57,968 INFO L273 TraceCheckUtils]: 69: Hoare triple {20132#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:24:57,968 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:24:57,968 INFO L273 TraceCheckUtils]: 71: Hoare triple {20132#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:24:57,968 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:24:57,968 INFO L273 TraceCheckUtils]: 73: Hoare triple {20132#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:24:57,968 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:24:57,968 INFO L273 TraceCheckUtils]: 75: Hoare triple {20132#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:24:57,969 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:24:57,969 INFO L273 TraceCheckUtils]: 77: Hoare triple {20132#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:24:57,969 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:24:57,969 INFO L273 TraceCheckUtils]: 79: Hoare triple {20132#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:24:57,969 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:24:57,969 INFO L273 TraceCheckUtils]: 81: Hoare triple {20132#true} assume !(~i~0 < 100); {20132#true} is VALID [2018-11-23 12:24:57,969 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:24:57,969 INFO L273 TraceCheckUtils]: 83: Hoare triple {20132#true} assume true; {20132#true} is VALID [2018-11-23 12:24:57,969 INFO L268 TraceCheckUtils]: 84: Hoare quadruple {20132#true} {20132#true} #70#return; {20132#true} is VALID [2018-11-23 12:24:57,970 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:24:57,970 INFO L256 TraceCheckUtils]: 86: Hoare triple {20132#true} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {20132#true} is VALID [2018-11-23 12:24:57,970 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:24:57,970 INFO L273 TraceCheckUtils]: 88: Hoare triple {20132#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:24:57,970 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:24:57,970 INFO L273 TraceCheckUtils]: 90: Hoare triple {20132#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:24:57,970 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:24:57,971 INFO L273 TraceCheckUtils]: 92: Hoare triple {20132#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:24:57,971 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:24:57,971 INFO L273 TraceCheckUtils]: 94: Hoare triple {20132#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:24:57,971 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:24:57,971 INFO L273 TraceCheckUtils]: 96: Hoare triple {20132#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:24:57,971 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:24:57,971 INFO L273 TraceCheckUtils]: 98: Hoare triple {20132#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:24:57,971 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:24:57,971 INFO L273 TraceCheckUtils]: 100: Hoare triple {20132#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:24:57,972 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:24:57,972 INFO L273 TraceCheckUtils]: 102: Hoare triple {20132#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20132#true} is VALID [2018-11-23 12:24:57,972 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:24:57,972 INFO L273 TraceCheckUtils]: 104: Hoare triple {20132#true} assume !(~i~0 < 100); {20132#true} is VALID [2018-11-23 12:24:57,972 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:24:57,972 INFO L273 TraceCheckUtils]: 106: Hoare triple {20132#true} assume true; {20132#true} is VALID [2018-11-23 12:24:57,972 INFO L268 TraceCheckUtils]: 107: Hoare quadruple {20132#true} {20132#true} #72#return; {20132#true} is VALID [2018-11-23 12:24:57,972 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:24:57,972 INFO L273 TraceCheckUtils]: 109: Hoare triple {20132#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:57,972 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:24:57,973 INFO L273 TraceCheckUtils]: 111: Hoare triple {20132#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:57,973 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:24:57,973 INFO L273 TraceCheckUtils]: 113: Hoare triple {20132#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:57,973 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:24:57,973 INFO L273 TraceCheckUtils]: 115: Hoare triple {20132#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:57,973 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:24:57,973 INFO L273 TraceCheckUtils]: 117: Hoare triple {20132#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:57,973 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:24:57,973 INFO L273 TraceCheckUtils]: 119: Hoare triple {20132#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:57,973 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:24:57,974 INFO L273 TraceCheckUtils]: 121: Hoare triple {20132#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:57,974 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:24:57,974 INFO L273 TraceCheckUtils]: 123: Hoare triple {20132#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:57,974 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:24:57,974 INFO L273 TraceCheckUtils]: 125: Hoare triple {20132#true} assume !(~i~2 < 99); {20132#true} is VALID [2018-11-23 12:24:57,974 INFO L273 TraceCheckUtils]: 126: Hoare triple {20132#true} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {20132#true} is VALID [2018-11-23 12:24:57,974 INFO L256 TraceCheckUtils]: 127: Hoare triple {20132#true} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {20132#true} is VALID [2018-11-23 12:24:57,975 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#(<= bAnd_~i~0 1)} is VALID [2018-11-23 12:24:57,975 INFO L273 TraceCheckUtils]: 129: Hoare triple {20550#(<= bAnd_~i~0 1)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20550#(<= bAnd_~i~0 1)} is VALID [2018-11-23 12:24:57,975 INFO L273 TraceCheckUtils]: 130: Hoare triple {20550#(<= bAnd_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20557#(<= bAnd_~i~0 2)} is VALID [2018-11-23 12:24:57,976 INFO L273 TraceCheckUtils]: 131: Hoare triple {20557#(<= bAnd_~i~0 2)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20557#(<= bAnd_~i~0 2)} is VALID [2018-11-23 12:24:57,976 INFO L273 TraceCheckUtils]: 132: Hoare triple {20557#(<= bAnd_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20564#(<= bAnd_~i~0 3)} is VALID [2018-11-23 12:24:57,976 INFO L273 TraceCheckUtils]: 133: Hoare triple {20564#(<= bAnd_~i~0 3)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20564#(<= bAnd_~i~0 3)} is VALID [2018-11-23 12:24:57,977 INFO L273 TraceCheckUtils]: 134: Hoare triple {20564#(<= bAnd_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20571#(<= bAnd_~i~0 4)} is VALID [2018-11-23 12:24:57,977 INFO L273 TraceCheckUtils]: 135: Hoare triple {20571#(<= bAnd_~i~0 4)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20571#(<= bAnd_~i~0 4)} is VALID [2018-11-23 12:24:57,978 INFO L273 TraceCheckUtils]: 136: Hoare triple {20571#(<= bAnd_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20578#(<= bAnd_~i~0 5)} is VALID [2018-11-23 12:24:57,978 INFO L273 TraceCheckUtils]: 137: Hoare triple {20578#(<= bAnd_~i~0 5)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20578#(<= bAnd_~i~0 5)} is VALID [2018-11-23 12:24:57,978 INFO L273 TraceCheckUtils]: 138: Hoare triple {20578#(<= bAnd_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20585#(<= bAnd_~i~0 6)} is VALID [2018-11-23 12:24:57,979 INFO L273 TraceCheckUtils]: 139: Hoare triple {20585#(<= bAnd_~i~0 6)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20585#(<= bAnd_~i~0 6)} is VALID [2018-11-23 12:24:57,980 INFO L273 TraceCheckUtils]: 140: Hoare triple {20585#(<= bAnd_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20592#(<= bAnd_~i~0 7)} is VALID [2018-11-23 12:24:57,980 INFO L273 TraceCheckUtils]: 141: Hoare triple {20592#(<= bAnd_~i~0 7)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20592#(<= bAnd_~i~0 7)} is VALID [2018-11-23 12:24:57,981 INFO L273 TraceCheckUtils]: 142: Hoare triple {20592#(<= bAnd_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20599#(<= bAnd_~i~0 8)} is VALID [2018-11-23 12:24:57,981 INFO L273 TraceCheckUtils]: 143: Hoare triple {20599#(<= bAnd_~i~0 8)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {20599#(<= bAnd_~i~0 8)} is VALID [2018-11-23 12:24:57,982 INFO L273 TraceCheckUtils]: 144: Hoare triple {20599#(<= bAnd_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20606#(<= bAnd_~i~0 9)} is VALID [2018-11-23 12:24:57,982 INFO L273 TraceCheckUtils]: 145: Hoare triple {20606#(<= bAnd_~i~0 9)} assume !(~i~0 < 100); {20133#false} is VALID [2018-11-23 12:24:57,983 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:24:57,983 INFO L273 TraceCheckUtils]: 147: Hoare triple {20133#false} assume true; {20133#false} is VALID [2018-11-23 12:24:57,983 INFO L268 TraceCheckUtils]: 148: Hoare quadruple {20133#false} {20132#true} #74#return; {20133#false} is VALID [2018-11-23 12:24:57,983 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:24:57,983 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:24:57,983 INFO L273 TraceCheckUtils]: 151: Hoare triple {20133#false} assume !false; {20133#false} is VALID [2018-11-23 12:24:57,993 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:24:58,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:58,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 11] total 40 [2018-11-23 12:24:58,014 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 152 [2018-11-23 12:24:58,014 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:58,014 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states. [2018-11-23 12:24:58,126 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:24:58,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-23 12:24:58,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-23 12:24:58,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=519, Invalid=1041, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 12:24:58,128 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand 40 states. [2018-11-23 12:24:58,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:58,634 INFO L93 Difference]: Finished difference Result 165 states and 177 transitions. [2018-11-23 12:24:58,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-23 12:24:58,634 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 152 [2018-11-23 12:24:58,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:58,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:24:58,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 132 transitions. [2018-11-23 12:24:58,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:24:58,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 132 transitions. [2018-11-23 12:24:58,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 132 transitions. [2018-11-23 12:24:58,754 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:24:58,756 INFO L225 Difference]: With dead ends: 165 [2018-11-23 12:24:58,756 INFO L226 Difference]: Without dead ends: 117 [2018-11-23 12:24:58,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=519, Invalid=1041, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 12:24:58,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-23 12:24:58,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-11-23 12:24:58,806 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:58,806 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand 115 states. [2018-11-23 12:24:58,806 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 115 states. [2018-11-23 12:24:58,807 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 115 states. [2018-11-23 12:24:58,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:58,808 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2018-11-23 12:24:58,809 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2018-11-23 12:24:58,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:58,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:58,809 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 117 states. [2018-11-23 12:24:58,809 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 117 states. [2018-11-23 12:24:58,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:58,811 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2018-11-23 12:24:58,811 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2018-11-23 12:24:58,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:58,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:58,811 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:58,811 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:58,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-23 12:24:58,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 119 transitions. [2018-11-23 12:24:58,813 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 119 transitions. Word has length 152 [2018-11-23 12:24:58,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:58,813 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 119 transitions. [2018-11-23 12:24:58,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-23 12:24:58,813 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2018-11-23 12:24:58,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-23 12:24:58,814 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:58,814 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:24:58,814 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:58,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:58,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1573539069, now seen corresponding path program 29 times [2018-11-23 12:24:58,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:58,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:58,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:58,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:24:58,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:58,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:59,888 INFO L256 TraceCheckUtils]: 0: Hoare triple {21277#true} call ULTIMATE.init(); {21277#true} is VALID [2018-11-23 12:24:59,888 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:24:59,888 INFO L273 TraceCheckUtils]: 2: Hoare triple {21277#true} assume true; {21277#true} is VALID [2018-11-23 12:24:59,889 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21277#true} {21277#true} #66#return; {21277#true} is VALID [2018-11-23 12:24:59,889 INFO L256 TraceCheckUtils]: 4: Hoare triple {21277#true} call #t~ret13 := main(); {21277#true} is VALID [2018-11-23 12:24:59,889 INFO L273 TraceCheckUtils]: 5: Hoare triple {21277#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:24:59,890 INFO L273 TraceCheckUtils]: 6: Hoare triple {21279#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:24:59,890 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:24:59,891 INFO L273 TraceCheckUtils]: 8: Hoare triple {21280#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:24:59,892 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:24:59,892 INFO L273 TraceCheckUtils]: 10: Hoare triple {21281#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:24:59,893 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:24:59,893 INFO L273 TraceCheckUtils]: 12: Hoare triple {21282#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -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:24:59,894 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:24:59,894 INFO L273 TraceCheckUtils]: 14: Hoare triple {21283#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -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:24:59,895 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:24:59,896 INFO L273 TraceCheckUtils]: 16: Hoare triple {21284#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -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:24:59,896 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:24:59,897 INFO L273 TraceCheckUtils]: 18: Hoare triple {21285#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -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:24:59,897 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:24:59,898 INFO L273 TraceCheckUtils]: 20: Hoare triple {21286#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -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:24:59,899 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:24:59,899 INFO L273 TraceCheckUtils]: 22: Hoare triple {21287#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -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:24:59,900 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:24:59,900 INFO L273 TraceCheckUtils]: 24: Hoare triple {21288#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -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:24:59,901 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:24:59,901 INFO L273 TraceCheckUtils]: 26: Hoare triple {21289#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -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:24:59,902 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:24:59,902 INFO L273 TraceCheckUtils]: 28: Hoare triple {21290#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -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:24:59,903 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:24:59,904 INFO L273 TraceCheckUtils]: 30: Hoare triple {21291#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -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:24:59,904 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:24:59,905 INFO L273 TraceCheckUtils]: 32: Hoare triple {21292#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -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:24:59,905 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:24:59,906 INFO L273 TraceCheckUtils]: 34: Hoare triple {21293#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -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:24:59,907 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:24:59,907 INFO L273 TraceCheckUtils]: 36: Hoare triple {21294#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -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:24:59,908 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:24:59,908 INFO L273 TraceCheckUtils]: 38: Hoare triple {21295#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -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:24:59,909 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:24:59,909 INFO L273 TraceCheckUtils]: 40: Hoare triple {21296#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -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:24:59,910 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:24:59,911 INFO L273 TraceCheckUtils]: 42: Hoare triple {21297#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -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:24:59,911 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:24:59,912 INFO L273 TraceCheckUtils]: 44: Hoare triple {21298#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -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:24:59,912 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:24:59,913 INFO L273 TraceCheckUtils]: 46: Hoare triple {21299#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -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:24:59,914 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:24:59,914 INFO L273 TraceCheckUtils]: 48: Hoare triple {21300#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -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:24:59,915 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:24:59,915 INFO L273 TraceCheckUtils]: 50: Hoare triple {21301#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -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:24:59,916 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:24:59,916 INFO L273 TraceCheckUtils]: 52: Hoare triple {21302#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -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:24:59,917 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:24:59,918 INFO L273 TraceCheckUtils]: 54: Hoare triple {21303#(<= main_~i~1 24)} assume !!(~i~1 < 100);assume -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:24:59,918 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:24:59,919 INFO L273 TraceCheckUtils]: 56: Hoare triple {21304#(<= main_~i~1 25)} assume !!(~i~1 < 100);assume -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:24:59,919 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:24:59,920 INFO L273 TraceCheckUtils]: 58: Hoare triple {21305#(<= main_~i~1 26)} assume !!(~i~1 < 100);assume -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:24:59,921 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:24:59,921 INFO L273 TraceCheckUtils]: 60: Hoare triple {21306#(<= main_~i~1 27)} assume !!(~i~1 < 100);assume -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:24:59,922 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:24:59,922 INFO L273 TraceCheckUtils]: 62: Hoare triple {21307#(<= main_~i~1 28)} assume !!(~i~1 < 100);assume -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:24:59,923 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:24:59,923 INFO L273 TraceCheckUtils]: 64: Hoare triple {21308#(<= main_~i~1 29)} assume !(~i~1 < 100); {21278#false} is VALID [2018-11-23 12:24:59,924 INFO L256 TraceCheckUtils]: 65: Hoare triple {21278#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {21277#true} is VALID [2018-11-23 12:24:59,924 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:24:59,924 INFO L273 TraceCheckUtils]: 67: Hoare triple {21277#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:24:59,924 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:24:59,924 INFO L273 TraceCheckUtils]: 69: Hoare triple {21277#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:24:59,925 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:24:59,925 INFO L273 TraceCheckUtils]: 71: Hoare triple {21277#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:24:59,925 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:24:59,925 INFO L273 TraceCheckUtils]: 73: Hoare triple {21277#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:24:59,925 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:24:59,925 INFO L273 TraceCheckUtils]: 75: Hoare triple {21277#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:24:59,926 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:24:59,926 INFO L273 TraceCheckUtils]: 77: Hoare triple {21277#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:24:59,926 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:24:59,926 INFO L273 TraceCheckUtils]: 79: Hoare triple {21277#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:24:59,926 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:24:59,926 INFO L273 TraceCheckUtils]: 81: Hoare triple {21277#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:24:59,927 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:24:59,927 INFO L273 TraceCheckUtils]: 83: Hoare triple {21277#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:24:59,927 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:24:59,927 INFO L273 TraceCheckUtils]: 85: Hoare triple {21277#true} assume !(~i~0 < 100); {21277#true} is VALID [2018-11-23 12:24:59,927 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:24:59,927 INFO L273 TraceCheckUtils]: 87: Hoare triple {21277#true} assume true; {21277#true} is VALID [2018-11-23 12:24:59,928 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {21277#true} {21278#false} #70#return; {21278#false} is VALID [2018-11-23 12:24:59,928 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:24:59,928 INFO L256 TraceCheckUtils]: 90: Hoare triple {21278#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {21277#true} is VALID [2018-11-23 12:24:59,928 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:24:59,928 INFO L273 TraceCheckUtils]: 92: Hoare triple {21277#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:24:59,928 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:24:59,929 INFO L273 TraceCheckUtils]: 94: Hoare triple {21277#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:24:59,929 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:24:59,929 INFO L273 TraceCheckUtils]: 96: Hoare triple {21277#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:24:59,929 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:24:59,929 INFO L273 TraceCheckUtils]: 98: Hoare triple {21277#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:24:59,929 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:24:59,929 INFO L273 TraceCheckUtils]: 100: Hoare triple {21277#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:24:59,929 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:24:59,929 INFO L273 TraceCheckUtils]: 102: Hoare triple {21277#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:24:59,930 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:24:59,930 INFO L273 TraceCheckUtils]: 104: Hoare triple {21277#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:24:59,930 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:24:59,930 INFO L273 TraceCheckUtils]: 106: Hoare triple {21277#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:24:59,930 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:24:59,930 INFO L273 TraceCheckUtils]: 108: Hoare triple {21277#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:24:59,930 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:24:59,930 INFO L273 TraceCheckUtils]: 110: Hoare triple {21277#true} assume !(~i~0 < 100); {21277#true} is VALID [2018-11-23 12:24:59,930 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:24:59,931 INFO L273 TraceCheckUtils]: 112: Hoare triple {21277#true} assume true; {21277#true} is VALID [2018-11-23 12:24:59,931 INFO L268 TraceCheckUtils]: 113: Hoare quadruple {21277#true} {21278#false} #72#return; {21278#false} is VALID [2018-11-23 12:24:59,931 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:24:59,931 INFO L273 TraceCheckUtils]: 115: Hoare triple {21278#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:59,931 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:24:59,931 INFO L273 TraceCheckUtils]: 117: Hoare triple {21278#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:59,931 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:24:59,931 INFO L273 TraceCheckUtils]: 119: Hoare triple {21278#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:59,931 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:24:59,931 INFO L273 TraceCheckUtils]: 121: Hoare triple {21278#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:59,932 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:24:59,932 INFO L273 TraceCheckUtils]: 123: Hoare triple {21278#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:59,932 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:24:59,932 INFO L273 TraceCheckUtils]: 125: Hoare triple {21278#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:59,932 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:24:59,932 INFO L273 TraceCheckUtils]: 127: Hoare triple {21278#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:59,932 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:24:59,932 INFO L273 TraceCheckUtils]: 129: Hoare triple {21278#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:24:59,932 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:24:59,932 INFO L273 TraceCheckUtils]: 131: Hoare triple {21278#false} assume !(~i~2 < 99); {21278#false} is VALID [2018-11-23 12:24:59,933 INFO L273 TraceCheckUtils]: 132: Hoare triple {21278#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {21278#false} is VALID [2018-11-23 12:24:59,933 INFO L256 TraceCheckUtils]: 133: Hoare triple {21278#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {21277#true} is VALID [2018-11-23 12:24:59,933 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:24:59,933 INFO L273 TraceCheckUtils]: 135: Hoare triple {21277#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:24:59,933 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:24:59,933 INFO L273 TraceCheckUtils]: 137: Hoare triple {21277#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:24:59,933 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:24:59,933 INFO L273 TraceCheckUtils]: 139: Hoare triple {21277#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:24:59,933 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:24:59,933 INFO L273 TraceCheckUtils]: 141: Hoare triple {21277#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:24:59,934 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:24:59,934 INFO L273 TraceCheckUtils]: 143: Hoare triple {21277#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:24:59,934 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:24:59,934 INFO L273 TraceCheckUtils]: 145: Hoare triple {21277#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:24:59,934 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:24:59,934 INFO L273 TraceCheckUtils]: 147: Hoare triple {21277#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:24:59,934 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:24:59,934 INFO L273 TraceCheckUtils]: 149: Hoare triple {21277#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:24:59,934 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:24:59,935 INFO L273 TraceCheckUtils]: 151: Hoare triple {21277#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21277#true} is VALID [2018-11-23 12:24:59,935 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:24:59,935 INFO L273 TraceCheckUtils]: 153: Hoare triple {21277#true} assume !(~i~0 < 100); {21277#true} is VALID [2018-11-23 12:24:59,935 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:24:59,935 INFO L273 TraceCheckUtils]: 155: Hoare triple {21277#true} assume true; {21277#true} is VALID [2018-11-23 12:24:59,935 INFO L268 TraceCheckUtils]: 156: Hoare quadruple {21277#true} {21278#false} #74#return; {21278#false} is VALID [2018-11-23 12:24:59,935 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:24:59,935 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:24:59,935 INFO L273 TraceCheckUtils]: 159: Hoare triple {21278#false} assume !false; {21278#false} is VALID [2018-11-23 12:24:59,947 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:24:59,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:59,947 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:24:59,958 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:25:23,809 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2018-11-23 12:25:23,810 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:25:23,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:25:23,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:25:24,197 INFO L256 TraceCheckUtils]: 0: Hoare triple {21277#true} call ULTIMATE.init(); {21277#true} is VALID [2018-11-23 12:25:24,198 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:25:24,198 INFO L273 TraceCheckUtils]: 2: Hoare triple {21277#true} assume true; {21277#true} is VALID [2018-11-23 12:25:24,198 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21277#true} {21277#true} #66#return; {21277#true} is VALID [2018-11-23 12:25:24,198 INFO L256 TraceCheckUtils]: 4: Hoare triple {21277#true} call #t~ret13 := main(); {21277#true} is VALID [2018-11-23 12:25:24,198 INFO L273 TraceCheckUtils]: 5: Hoare triple {21277#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {21277#true} is VALID [2018-11-23 12:25:24,198 INFO L273 TraceCheckUtils]: 6: Hoare triple {21277#true} assume !!(~i~1 < 100);assume -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:25:24,199 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:25:24,199 INFO L273 TraceCheckUtils]: 8: Hoare triple {21277#true} assume !!(~i~1 < 100);assume -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:25:24,199 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:25:24,199 INFO L273 TraceCheckUtils]: 10: Hoare triple {21277#true} assume !!(~i~1 < 100);assume -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:25:24,199 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:25:24,199 INFO L273 TraceCheckUtils]: 12: Hoare triple {21277#true} assume !!(~i~1 < 100);assume -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:25:24,200 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:25:24,200 INFO L273 TraceCheckUtils]: 14: Hoare triple {21277#true} assume !!(~i~1 < 100);assume -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:25:24,200 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:25:24,200 INFO L273 TraceCheckUtils]: 16: Hoare triple {21277#true} assume !!(~i~1 < 100);assume -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:25:24,200 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:25:24,200 INFO L273 TraceCheckUtils]: 18: Hoare triple {21277#true} assume !!(~i~1 < 100);assume -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:25:24,200 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:25:24,200 INFO L273 TraceCheckUtils]: 20: Hoare triple {21277#true} assume !!(~i~1 < 100);assume -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:25:24,200 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:25:24,201 INFO L273 TraceCheckUtils]: 22: Hoare triple {21277#true} assume !!(~i~1 < 100);assume -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:25:24,201 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:25:24,201 INFO L273 TraceCheckUtils]: 24: Hoare triple {21277#true} assume !!(~i~1 < 100);assume -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:25:24,201 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:25:24,201 INFO L273 TraceCheckUtils]: 26: Hoare triple {21277#true} assume !!(~i~1 < 100);assume -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:25:24,201 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:25:24,201 INFO L273 TraceCheckUtils]: 28: Hoare triple {21277#true} assume !!(~i~1 < 100);assume -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:25:24,201 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:25:24,201 INFO L273 TraceCheckUtils]: 30: Hoare triple {21277#true} assume !!(~i~1 < 100);assume -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:25:24,202 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:25:24,202 INFO L273 TraceCheckUtils]: 32: Hoare triple {21277#true} assume !!(~i~1 < 100);assume -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:25:24,202 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:25:24,202 INFO L273 TraceCheckUtils]: 34: Hoare triple {21277#true} assume !!(~i~1 < 100);assume -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:25:24,202 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:25:24,202 INFO L273 TraceCheckUtils]: 36: Hoare triple {21277#true} assume !!(~i~1 < 100);assume -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:25:24,202 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:25:24,202 INFO L273 TraceCheckUtils]: 38: Hoare triple {21277#true} assume !!(~i~1 < 100);assume -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:25:24,202 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:25:24,202 INFO L273 TraceCheckUtils]: 40: Hoare triple {21277#true} assume !!(~i~1 < 100);assume -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:25:24,203 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:25:24,203 INFO L273 TraceCheckUtils]: 42: Hoare triple {21277#true} assume !!(~i~1 < 100);assume -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:25:24,203 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:25:24,203 INFO L273 TraceCheckUtils]: 44: Hoare triple {21277#true} assume !!(~i~1 < 100);assume -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:25:24,203 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:25:24,203 INFO L273 TraceCheckUtils]: 46: Hoare triple {21277#true} assume !!(~i~1 < 100);assume -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:25:24,203 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:25:24,203 INFO L273 TraceCheckUtils]: 48: Hoare triple {21277#true} assume !!(~i~1 < 100);assume -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:25:24,203 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:25:24,203 INFO L273 TraceCheckUtils]: 50: Hoare triple {21277#true} assume !!(~i~1 < 100);assume -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:25:24,204 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:25:24,204 INFO L273 TraceCheckUtils]: 52: Hoare triple {21277#true} assume !!(~i~1 < 100);assume -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:25:24,204 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:25:24,204 INFO L273 TraceCheckUtils]: 54: Hoare triple {21277#true} assume !!(~i~1 < 100);assume -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:25:24,204 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:25:24,204 INFO L273 TraceCheckUtils]: 56: Hoare triple {21277#true} assume !!(~i~1 < 100);assume -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:25:24,204 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:25:24,204 INFO L273 TraceCheckUtils]: 58: Hoare triple {21277#true} assume !!(~i~1 < 100);assume -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:25:24,204 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:25:24,204 INFO L273 TraceCheckUtils]: 60: Hoare triple {21277#true} assume !!(~i~1 < 100);assume -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:25:24,205 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:25:24,205 INFO L273 TraceCheckUtils]: 62: Hoare triple {21277#true} assume !!(~i~1 < 100);assume -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:25:24,205 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:25:24,205 INFO L273 TraceCheckUtils]: 64: Hoare triple {21277#true} assume !(~i~1 < 100); {21277#true} is VALID [2018-11-23 12:25:24,205 INFO L256 TraceCheckUtils]: 65: Hoare triple {21277#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {21277#true} is VALID [2018-11-23 12:25:24,205 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#(<= bAnd_~i~0 1)} is VALID [2018-11-23 12:25:24,206 INFO L273 TraceCheckUtils]: 67: Hoare triple {21510#(<= bAnd_~i~0 1)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21510#(<= bAnd_~i~0 1)} is VALID [2018-11-23 12:25:24,206 INFO L273 TraceCheckUtils]: 68: Hoare triple {21510#(<= bAnd_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21517#(<= bAnd_~i~0 2)} is VALID [2018-11-23 12:25:24,207 INFO L273 TraceCheckUtils]: 69: Hoare triple {21517#(<= bAnd_~i~0 2)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21517#(<= bAnd_~i~0 2)} is VALID [2018-11-23 12:25:24,207 INFO L273 TraceCheckUtils]: 70: Hoare triple {21517#(<= bAnd_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21524#(<= bAnd_~i~0 3)} is VALID [2018-11-23 12:25:24,207 INFO L273 TraceCheckUtils]: 71: Hoare triple {21524#(<= bAnd_~i~0 3)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21524#(<= bAnd_~i~0 3)} is VALID [2018-11-23 12:25:24,208 INFO L273 TraceCheckUtils]: 72: Hoare triple {21524#(<= bAnd_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21531#(<= bAnd_~i~0 4)} is VALID [2018-11-23 12:25:24,208 INFO L273 TraceCheckUtils]: 73: Hoare triple {21531#(<= bAnd_~i~0 4)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21531#(<= bAnd_~i~0 4)} is VALID [2018-11-23 12:25:24,209 INFO L273 TraceCheckUtils]: 74: Hoare triple {21531#(<= bAnd_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21538#(<= bAnd_~i~0 5)} is VALID [2018-11-23 12:25:24,209 INFO L273 TraceCheckUtils]: 75: Hoare triple {21538#(<= bAnd_~i~0 5)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21538#(<= bAnd_~i~0 5)} is VALID [2018-11-23 12:25:24,210 INFO L273 TraceCheckUtils]: 76: Hoare triple {21538#(<= bAnd_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21545#(<= bAnd_~i~0 6)} is VALID [2018-11-23 12:25:24,210 INFO L273 TraceCheckUtils]: 77: Hoare triple {21545#(<= bAnd_~i~0 6)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21545#(<= bAnd_~i~0 6)} is VALID [2018-11-23 12:25:24,211 INFO L273 TraceCheckUtils]: 78: Hoare triple {21545#(<= bAnd_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21552#(<= bAnd_~i~0 7)} is VALID [2018-11-23 12:25:24,212 INFO L273 TraceCheckUtils]: 79: Hoare triple {21552#(<= bAnd_~i~0 7)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21552#(<= bAnd_~i~0 7)} is VALID [2018-11-23 12:25:24,212 INFO L273 TraceCheckUtils]: 80: Hoare triple {21552#(<= bAnd_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21559#(<= bAnd_~i~0 8)} is VALID [2018-11-23 12:25:24,213 INFO L273 TraceCheckUtils]: 81: Hoare triple {21559#(<= bAnd_~i~0 8)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21559#(<= bAnd_~i~0 8)} is VALID [2018-11-23 12:25:24,216 INFO L273 TraceCheckUtils]: 82: Hoare triple {21559#(<= bAnd_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21566#(<= bAnd_~i~0 9)} is VALID [2018-11-23 12:25:24,216 INFO L273 TraceCheckUtils]: 83: Hoare triple {21566#(<= bAnd_~i~0 9)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21566#(<= bAnd_~i~0 9)} is VALID [2018-11-23 12:25:24,217 INFO L273 TraceCheckUtils]: 84: Hoare triple {21566#(<= bAnd_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21573#(<= bAnd_~i~0 10)} is VALID [2018-11-23 12:25:24,217 INFO L273 TraceCheckUtils]: 85: Hoare triple {21573#(<= bAnd_~i~0 10)} assume !(~i~0 < 100); {21278#false} is VALID [2018-11-23 12:25:24,217 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:25:24,217 INFO L273 TraceCheckUtils]: 87: Hoare triple {21278#false} assume true; {21278#false} is VALID [2018-11-23 12:25:24,218 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {21278#false} {21277#true} #70#return; {21278#false} is VALID [2018-11-23 12:25:24,218 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:25:24,218 INFO L256 TraceCheckUtils]: 90: Hoare triple {21278#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {21278#false} is VALID [2018-11-23 12:25:24,218 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:25:24,218 INFO L273 TraceCheckUtils]: 92: Hoare triple {21278#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21278#false} is VALID [2018-11-23 12:25:24,218 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:25:24,218 INFO L273 TraceCheckUtils]: 94: Hoare triple {21278#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21278#false} is VALID [2018-11-23 12:25:24,218 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:25:24,218 INFO L273 TraceCheckUtils]: 96: Hoare triple {21278#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21278#false} is VALID [2018-11-23 12:25:24,219 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:25:24,219 INFO L273 TraceCheckUtils]: 98: Hoare triple {21278#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21278#false} is VALID [2018-11-23 12:25:24,219 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:25:24,219 INFO L273 TraceCheckUtils]: 100: Hoare triple {21278#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21278#false} is VALID [2018-11-23 12:25:24,219 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:25:24,219 INFO L273 TraceCheckUtils]: 102: Hoare triple {21278#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21278#false} is VALID [2018-11-23 12:25:24,219 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:25:24,219 INFO L273 TraceCheckUtils]: 104: Hoare triple {21278#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21278#false} is VALID [2018-11-23 12:25:24,219 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:25:24,219 INFO L273 TraceCheckUtils]: 106: Hoare triple {21278#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21278#false} is VALID [2018-11-23 12:25:24,220 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:25:24,220 INFO L273 TraceCheckUtils]: 108: Hoare triple {21278#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21278#false} is VALID [2018-11-23 12:25:24,220 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:25:24,220 INFO L273 TraceCheckUtils]: 110: Hoare triple {21278#false} assume !(~i~0 < 100); {21278#false} is VALID [2018-11-23 12:25:24,220 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:25:24,220 INFO L273 TraceCheckUtils]: 112: Hoare triple {21278#false} assume true; {21278#false} is VALID [2018-11-23 12:25:24,220 INFO L268 TraceCheckUtils]: 113: Hoare quadruple {21278#false} {21278#false} #72#return; {21278#false} is VALID [2018-11-23 12:25:24,220 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:25:24,220 INFO L273 TraceCheckUtils]: 115: Hoare triple {21278#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:24,221 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:25:24,221 INFO L273 TraceCheckUtils]: 117: Hoare triple {21278#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:24,221 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:25:24,221 INFO L273 TraceCheckUtils]: 119: Hoare triple {21278#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:24,221 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:25:24,221 INFO L273 TraceCheckUtils]: 121: Hoare triple {21278#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:24,221 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:25:24,221 INFO L273 TraceCheckUtils]: 123: Hoare triple {21278#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:24,221 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:25:24,221 INFO L273 TraceCheckUtils]: 125: Hoare triple {21278#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:24,222 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:25:24,222 INFO L273 TraceCheckUtils]: 127: Hoare triple {21278#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:24,222 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:25:24,222 INFO L273 TraceCheckUtils]: 129: Hoare triple {21278#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:24,222 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:25:24,222 INFO L273 TraceCheckUtils]: 131: Hoare triple {21278#false} assume !(~i~2 < 99); {21278#false} is VALID [2018-11-23 12:25:24,222 INFO L273 TraceCheckUtils]: 132: Hoare triple {21278#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {21278#false} is VALID [2018-11-23 12:25:24,222 INFO L256 TraceCheckUtils]: 133: Hoare triple {21278#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {21278#false} is VALID [2018-11-23 12:25:24,222 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:25:24,222 INFO L273 TraceCheckUtils]: 135: Hoare triple {21278#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21278#false} is VALID [2018-11-23 12:25:24,223 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:25:24,223 INFO L273 TraceCheckUtils]: 137: Hoare triple {21278#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21278#false} is VALID [2018-11-23 12:25:24,223 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:25:24,223 INFO L273 TraceCheckUtils]: 139: Hoare triple {21278#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21278#false} is VALID [2018-11-23 12:25:24,223 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:25:24,223 INFO L273 TraceCheckUtils]: 141: Hoare triple {21278#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21278#false} is VALID [2018-11-23 12:25:24,223 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:25:24,223 INFO L273 TraceCheckUtils]: 143: Hoare triple {21278#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21278#false} is VALID [2018-11-23 12:25:24,223 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:25:24,223 INFO L273 TraceCheckUtils]: 145: Hoare triple {21278#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21278#false} is VALID [2018-11-23 12:25:24,224 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:25:24,224 INFO L273 TraceCheckUtils]: 147: Hoare triple {21278#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21278#false} is VALID [2018-11-23 12:25:24,224 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:25:24,224 INFO L273 TraceCheckUtils]: 149: Hoare triple {21278#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21278#false} is VALID [2018-11-23 12:25:24,224 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:25:24,224 INFO L273 TraceCheckUtils]: 151: Hoare triple {21278#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {21278#false} is VALID [2018-11-23 12:25:24,224 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:25:24,224 INFO L273 TraceCheckUtils]: 153: Hoare triple {21278#false} assume !(~i~0 < 100); {21278#false} is VALID [2018-11-23 12:25:24,224 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:25:24,225 INFO L273 TraceCheckUtils]: 155: Hoare triple {21278#false} assume true; {21278#false} is VALID [2018-11-23 12:25:24,225 INFO L268 TraceCheckUtils]: 156: Hoare quadruple {21278#false} {21278#false} #74#return; {21278#false} is VALID [2018-11-23 12:25:24,225 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:25:24,225 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:25:24,225 INFO L273 TraceCheckUtils]: 159: Hoare triple {21278#false} assume !false; {21278#false} is VALID [2018-11-23 12:25:24,235 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:25:24,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:25:24,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 12] total 42 [2018-11-23 12:25:24,260 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 160 [2018-11-23 12:25:24,261 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:25:24,261 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 12:25:24,369 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:25:24,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 12:25:24,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 12:25:24,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=1161, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:25:24,371 INFO L87 Difference]: Start difference. First operand 115 states and 119 transitions. Second operand 42 states. [2018-11-23 12:25:25,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:25,452 INFO L93 Difference]: Finished difference Result 171 states and 183 transitions. [2018-11-23 12:25:25,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-23 12:25:25,452 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 160 [2018-11-23 12:25:25,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:25:25,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:25:25,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 136 transitions. [2018-11-23 12:25:25,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:25:25,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 136 transitions. [2018-11-23 12:25:25,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 136 transitions. [2018-11-23 12:25:25,576 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:25:25,578 INFO L225 Difference]: With dead ends: 171 [2018-11-23 12:25:25,579 INFO L226 Difference]: Without dead ends: 121 [2018-11-23 12:25:25,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=561, Invalid=1161, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:25:25,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-23 12:25:25,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-11-23 12:25:25,622 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:25:25,623 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand 119 states. [2018-11-23 12:25:25,623 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 119 states. [2018-11-23 12:25:25,623 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 119 states. [2018-11-23 12:25:25,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:25,625 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2018-11-23 12:25:25,626 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2018-11-23 12:25:25,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:25:25,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:25:25,626 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 121 states. [2018-11-23 12:25:25,626 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 121 states. [2018-11-23 12:25:25,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:25,628 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2018-11-23 12:25:25,628 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2018-11-23 12:25:25,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:25:25,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:25:25,629 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:25:25,629 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:25:25,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-23 12:25:25,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2018-11-23 12:25:25,631 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 160 [2018-11-23 12:25:25,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:25:25,632 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2018-11-23 12:25:25,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 12:25:25,632 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2018-11-23 12:25:25,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-23 12:25:25,633 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:25:25,633 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:25:25,633 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:25:25,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:25:25,634 INFO L82 PathProgramCache]: Analyzing trace with hash -451694749, now seen corresponding path program 30 times [2018-11-23 12:25:25,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:25:25,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:25:25,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:25:25,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:25:25,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:25:25,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:25:26,479 INFO L256 TraceCheckUtils]: 0: Hoare triple {22471#true} call ULTIMATE.init(); {22471#true} is VALID [2018-11-23 12:25:26,479 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:25:26,479 INFO L273 TraceCheckUtils]: 2: Hoare triple {22471#true} assume true; {22471#true} is VALID [2018-11-23 12:25:26,479 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22471#true} {22471#true} #66#return; {22471#true} is VALID [2018-11-23 12:25:26,480 INFO L256 TraceCheckUtils]: 4: Hoare triple {22471#true} call #t~ret13 := main(); {22471#true} is VALID [2018-11-23 12:25:26,481 INFO L273 TraceCheckUtils]: 5: Hoare triple {22471#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:25:26,481 INFO L273 TraceCheckUtils]: 6: Hoare triple {22473#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:25:26,482 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:25:26,482 INFO L273 TraceCheckUtils]: 8: Hoare triple {22474#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:25:26,482 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:25:26,483 INFO L273 TraceCheckUtils]: 10: Hoare triple {22475#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:25:26,483 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:25:26,484 INFO L273 TraceCheckUtils]: 12: Hoare triple {22476#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -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:25:26,484 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:25:26,485 INFO L273 TraceCheckUtils]: 14: Hoare triple {22477#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -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:25:26,486 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:25:26,486 INFO L273 TraceCheckUtils]: 16: Hoare triple {22478#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -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:25:26,487 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:25:26,487 INFO L273 TraceCheckUtils]: 18: Hoare triple {22479#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -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:25:26,488 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:25:26,488 INFO L273 TraceCheckUtils]: 20: Hoare triple {22480#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -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:25:26,489 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:25:26,489 INFO L273 TraceCheckUtils]: 22: Hoare triple {22481#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -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:25:26,490 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:25:26,491 INFO L273 TraceCheckUtils]: 24: Hoare triple {22482#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -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:25:26,491 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:25:26,492 INFO L273 TraceCheckUtils]: 26: Hoare triple {22483#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -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:25:26,492 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:25:26,493 INFO L273 TraceCheckUtils]: 28: Hoare triple {22484#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -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:25:26,494 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:25:26,494 INFO L273 TraceCheckUtils]: 30: Hoare triple {22485#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -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:25:26,495 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:25:26,495 INFO L273 TraceCheckUtils]: 32: Hoare triple {22486#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -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:25:26,496 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:25:26,496 INFO L273 TraceCheckUtils]: 34: Hoare triple {22487#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -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:25:26,497 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:25:26,498 INFO L273 TraceCheckUtils]: 36: Hoare triple {22488#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -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:25:26,498 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:25:26,499 INFO L273 TraceCheckUtils]: 38: Hoare triple {22489#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -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:25:26,499 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:25:26,500 INFO L273 TraceCheckUtils]: 40: Hoare triple {22490#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -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:25:26,501 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:25:26,501 INFO L273 TraceCheckUtils]: 42: Hoare triple {22491#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -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:25:26,502 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:25:26,502 INFO L273 TraceCheckUtils]: 44: Hoare triple {22492#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -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:25:26,503 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:25:26,503 INFO L273 TraceCheckUtils]: 46: Hoare triple {22493#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -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:25:26,504 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:25:26,505 INFO L273 TraceCheckUtils]: 48: Hoare triple {22494#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -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:25:26,505 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:25:26,506 INFO L273 TraceCheckUtils]: 50: Hoare triple {22495#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -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:25:26,506 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:25:26,507 INFO L273 TraceCheckUtils]: 52: Hoare triple {22496#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -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:25:26,507 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:25:26,508 INFO L273 TraceCheckUtils]: 54: Hoare triple {22497#(<= main_~i~1 24)} assume !!(~i~1 < 100);assume -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:25:26,509 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:25:26,509 INFO L273 TraceCheckUtils]: 56: Hoare triple {22498#(<= main_~i~1 25)} assume !!(~i~1 < 100);assume -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:25:26,510 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:25:26,510 INFO L273 TraceCheckUtils]: 58: Hoare triple {22499#(<= main_~i~1 26)} assume !!(~i~1 < 100);assume -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:25:26,511 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:25:26,511 INFO L273 TraceCheckUtils]: 60: Hoare triple {22500#(<= main_~i~1 27)} assume !!(~i~1 < 100);assume -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:25:26,512 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:25:26,513 INFO L273 TraceCheckUtils]: 62: Hoare triple {22501#(<= main_~i~1 28)} assume !!(~i~1 < 100);assume -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:25:26,513 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:25:26,514 INFO L273 TraceCheckUtils]: 64: Hoare triple {22502#(<= main_~i~1 29)} assume !!(~i~1 < 100);assume -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:25:26,514 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:25:26,515 INFO L273 TraceCheckUtils]: 66: Hoare triple {22503#(<= main_~i~1 30)} assume !(~i~1 < 100); {22472#false} is VALID [2018-11-23 12:25:26,515 INFO L256 TraceCheckUtils]: 67: Hoare triple {22472#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {22471#true} is VALID [2018-11-23 12:25:26,515 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:25:26,516 INFO L273 TraceCheckUtils]: 69: Hoare triple {22471#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:25:26,516 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:25:26,516 INFO L273 TraceCheckUtils]: 71: Hoare triple {22471#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:25:26,516 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:25:26,516 INFO L273 TraceCheckUtils]: 73: Hoare triple {22471#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:25:26,516 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:25:26,517 INFO L273 TraceCheckUtils]: 75: Hoare triple {22471#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:25:26,517 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:25:26,517 INFO L273 TraceCheckUtils]: 77: Hoare triple {22471#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:25:26,517 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:25:26,517 INFO L273 TraceCheckUtils]: 79: Hoare triple {22471#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:25:26,517 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:25:26,518 INFO L273 TraceCheckUtils]: 81: Hoare triple {22471#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:25:26,518 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:25:26,518 INFO L273 TraceCheckUtils]: 83: Hoare triple {22471#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:25:26,518 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:25:26,518 INFO L273 TraceCheckUtils]: 85: Hoare triple {22471#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:25:26,518 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:25:26,519 INFO L273 TraceCheckUtils]: 87: Hoare triple {22471#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:25:26,519 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:25:26,519 INFO L273 TraceCheckUtils]: 89: Hoare triple {22471#true} assume !(~i~0 < 100); {22471#true} is VALID [2018-11-23 12:25:26,519 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:25:26,519 INFO L273 TraceCheckUtils]: 91: Hoare triple {22471#true} assume true; {22471#true} is VALID [2018-11-23 12:25:26,519 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {22471#true} {22472#false} #70#return; {22472#false} is VALID [2018-11-23 12:25:26,520 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:25:26,520 INFO L256 TraceCheckUtils]: 94: Hoare triple {22472#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {22471#true} is VALID [2018-11-23 12:25:26,520 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:25:26,520 INFO L273 TraceCheckUtils]: 96: Hoare triple {22471#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:25:26,520 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:25:26,520 INFO L273 TraceCheckUtils]: 98: Hoare triple {22471#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:25:26,520 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:25:26,520 INFO L273 TraceCheckUtils]: 100: Hoare triple {22471#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:25:26,521 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:25:26,521 INFO L273 TraceCheckUtils]: 102: Hoare triple {22471#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:25:26,521 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:25:26,521 INFO L273 TraceCheckUtils]: 104: Hoare triple {22471#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:25:26,521 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:25:26,521 INFO L273 TraceCheckUtils]: 106: Hoare triple {22471#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:25:26,521 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:25:26,521 INFO L273 TraceCheckUtils]: 108: Hoare triple {22471#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:25:26,521 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:25:26,522 INFO L273 TraceCheckUtils]: 110: Hoare triple {22471#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:25:26,522 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:25:26,522 INFO L273 TraceCheckUtils]: 112: Hoare triple {22471#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:25:26,522 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:25:26,522 INFO L273 TraceCheckUtils]: 114: Hoare triple {22471#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:25:26,522 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:25:26,522 INFO L273 TraceCheckUtils]: 116: Hoare triple {22471#true} assume !(~i~0 < 100); {22471#true} is VALID [2018-11-23 12:25:26,522 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:25:26,522 INFO L273 TraceCheckUtils]: 118: Hoare triple {22471#true} assume true; {22471#true} is VALID [2018-11-23 12:25:26,522 INFO L268 TraceCheckUtils]: 119: Hoare quadruple {22471#true} {22472#false} #72#return; {22472#false} is VALID [2018-11-23 12:25:26,523 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:25:26,523 INFO L273 TraceCheckUtils]: 121: Hoare triple {22472#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:26,523 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:25:26,523 INFO L273 TraceCheckUtils]: 123: Hoare triple {22472#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:26,523 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:25:26,523 INFO L273 TraceCheckUtils]: 125: Hoare triple {22472#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:26,523 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:25:26,523 INFO L273 TraceCheckUtils]: 127: Hoare triple {22472#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:26,523 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:25:26,523 INFO L273 TraceCheckUtils]: 129: Hoare triple {22472#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:26,524 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:25:26,524 INFO L273 TraceCheckUtils]: 131: Hoare triple {22472#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:26,524 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:25:26,524 INFO L273 TraceCheckUtils]: 133: Hoare triple {22472#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:26,524 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:25:26,524 INFO L273 TraceCheckUtils]: 135: Hoare triple {22472#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:26,524 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:25:26,524 INFO L273 TraceCheckUtils]: 137: Hoare triple {22472#false} assume !(~i~2 < 99); {22472#false} is VALID [2018-11-23 12:25:26,524 INFO L273 TraceCheckUtils]: 138: Hoare triple {22472#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {22472#false} is VALID [2018-11-23 12:25:26,524 INFO L256 TraceCheckUtils]: 139: Hoare triple {22472#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {22471#true} is VALID [2018-11-23 12:25:26,525 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:25:26,525 INFO L273 TraceCheckUtils]: 141: Hoare triple {22471#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:25:26,525 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:25:26,525 INFO L273 TraceCheckUtils]: 143: Hoare triple {22471#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:25:26,525 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:25:26,525 INFO L273 TraceCheckUtils]: 145: Hoare triple {22471#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:25:26,525 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:25:26,525 INFO L273 TraceCheckUtils]: 147: Hoare triple {22471#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:25:26,525 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:25:26,525 INFO L273 TraceCheckUtils]: 149: Hoare triple {22471#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:25:26,526 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:25:26,526 INFO L273 TraceCheckUtils]: 151: Hoare triple {22471#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:25:26,526 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:25:26,526 INFO L273 TraceCheckUtils]: 153: Hoare triple {22471#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:25:26,526 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:25:26,526 INFO L273 TraceCheckUtils]: 155: Hoare triple {22471#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:25:26,526 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:25:26,526 INFO L273 TraceCheckUtils]: 157: Hoare triple {22471#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:25:26,526 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:25:26,526 INFO L273 TraceCheckUtils]: 159: Hoare triple {22471#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:25:26,527 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:25:26,527 INFO L273 TraceCheckUtils]: 161: Hoare triple {22471#true} assume !(~i~0 < 100); {22471#true} is VALID [2018-11-23 12:25:26,527 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:25:26,527 INFO L273 TraceCheckUtils]: 163: Hoare triple {22471#true} assume true; {22471#true} is VALID [2018-11-23 12:25:26,527 INFO L268 TraceCheckUtils]: 164: Hoare quadruple {22471#true} {22472#false} #74#return; {22472#false} is VALID [2018-11-23 12:25:26,527 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:25:26,527 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:25:26,527 INFO L273 TraceCheckUtils]: 167: Hoare triple {22472#false} assume !false; {22472#false} is VALID [2018-11-23 12:25:26,540 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:25:26,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:25:26,541 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:25:26,549 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:25:32,232 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-23 12:25:32,232 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:25:32,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:25:32,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:25:32,858 INFO L256 TraceCheckUtils]: 0: Hoare triple {22471#true} call ULTIMATE.init(); {22471#true} is VALID [2018-11-23 12:25:32,859 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:25:32,859 INFO L273 TraceCheckUtils]: 2: Hoare triple {22471#true} assume true; {22471#true} is VALID [2018-11-23 12:25:32,859 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22471#true} {22471#true} #66#return; {22471#true} is VALID [2018-11-23 12:25:32,860 INFO L256 TraceCheckUtils]: 4: Hoare triple {22471#true} call #t~ret13 := main(); {22471#true} is VALID [2018-11-23 12:25:32,860 INFO L273 TraceCheckUtils]: 5: Hoare triple {22471#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {22471#true} is VALID [2018-11-23 12:25:32,860 INFO L273 TraceCheckUtils]: 6: Hoare triple {22471#true} assume !!(~i~1 < 100);assume -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:25:32,860 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:25:32,860 INFO L273 TraceCheckUtils]: 8: Hoare triple {22471#true} assume !!(~i~1 < 100);assume -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:25:32,861 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:25:32,861 INFO L273 TraceCheckUtils]: 10: Hoare triple {22471#true} assume !!(~i~1 < 100);assume -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:25:32,861 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:25:32,861 INFO L273 TraceCheckUtils]: 12: Hoare triple {22471#true} assume !!(~i~1 < 100);assume -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:25:32,861 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:25:32,861 INFO L273 TraceCheckUtils]: 14: Hoare triple {22471#true} assume !!(~i~1 < 100);assume -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:25:32,862 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:25:32,862 INFO L273 TraceCheckUtils]: 16: Hoare triple {22471#true} assume !!(~i~1 < 100);assume -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:25:32,862 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:25:32,862 INFO L273 TraceCheckUtils]: 18: Hoare triple {22471#true} assume !!(~i~1 < 100);assume -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:25:32,862 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:25:32,862 INFO L273 TraceCheckUtils]: 20: Hoare triple {22471#true} assume !!(~i~1 < 100);assume -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:25:32,862 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:25:32,863 INFO L273 TraceCheckUtils]: 22: Hoare triple {22471#true} assume !!(~i~1 < 100);assume -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:25:32,863 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:25:32,863 INFO L273 TraceCheckUtils]: 24: Hoare triple {22471#true} assume !!(~i~1 < 100);assume -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:25:32,863 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:25:32,863 INFO L273 TraceCheckUtils]: 26: Hoare triple {22471#true} assume !!(~i~1 < 100);assume -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:25:32,863 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:25:32,863 INFO L273 TraceCheckUtils]: 28: Hoare triple {22471#true} assume !!(~i~1 < 100);assume -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:25:32,864 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:25:32,864 INFO L273 TraceCheckUtils]: 30: Hoare triple {22471#true} assume !!(~i~1 < 100);assume -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:25:32,864 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:25:32,864 INFO L273 TraceCheckUtils]: 32: Hoare triple {22471#true} assume !!(~i~1 < 100);assume -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:25:32,864 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:25:32,864 INFO L273 TraceCheckUtils]: 34: Hoare triple {22471#true} assume !!(~i~1 < 100);assume -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:25:32,864 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:25:32,865 INFO L273 TraceCheckUtils]: 36: Hoare triple {22471#true} assume !!(~i~1 < 100);assume -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:25:32,865 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:25:32,865 INFO L273 TraceCheckUtils]: 38: Hoare triple {22471#true} assume !!(~i~1 < 100);assume -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:25:32,865 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:25:32,865 INFO L273 TraceCheckUtils]: 40: Hoare triple {22471#true} assume !!(~i~1 < 100);assume -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:25:32,865 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:25:32,865 INFO L273 TraceCheckUtils]: 42: Hoare triple {22471#true} assume !!(~i~1 < 100);assume -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:25:32,866 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:25:32,866 INFO L273 TraceCheckUtils]: 44: Hoare triple {22471#true} assume !!(~i~1 < 100);assume -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:25:32,866 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:25:32,866 INFO L273 TraceCheckUtils]: 46: Hoare triple {22471#true} assume !!(~i~1 < 100);assume -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:25:32,866 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:25:32,866 INFO L273 TraceCheckUtils]: 48: Hoare triple {22471#true} assume !!(~i~1 < 100);assume -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:25:32,867 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:25:32,867 INFO L273 TraceCheckUtils]: 50: Hoare triple {22471#true} assume !!(~i~1 < 100);assume -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:25:32,867 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:25:32,867 INFO L273 TraceCheckUtils]: 52: Hoare triple {22471#true} assume !!(~i~1 < 100);assume -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:25:32,867 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:25:32,867 INFO L273 TraceCheckUtils]: 54: Hoare triple {22471#true} assume !!(~i~1 < 100);assume -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:25:32,867 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:25:32,868 INFO L273 TraceCheckUtils]: 56: Hoare triple {22471#true} assume !!(~i~1 < 100);assume -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:25:32,868 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:25:32,868 INFO L273 TraceCheckUtils]: 58: Hoare triple {22471#true} assume !!(~i~1 < 100);assume -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:25:32,868 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:25:32,868 INFO L273 TraceCheckUtils]: 60: Hoare triple {22471#true} assume !!(~i~1 < 100);assume -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:25:32,868 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:25:32,868 INFO L273 TraceCheckUtils]: 62: Hoare triple {22471#true} assume !!(~i~1 < 100);assume -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:25:32,869 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:25:32,869 INFO L273 TraceCheckUtils]: 64: Hoare triple {22471#true} assume !!(~i~1 < 100);assume -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:25:32,869 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:25:32,869 INFO L273 TraceCheckUtils]: 66: Hoare triple {22471#true} assume !(~i~1 < 100); {22471#true} is VALID [2018-11-23 12:25:32,869 INFO L256 TraceCheckUtils]: 67: Hoare triple {22471#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {22471#true} is VALID [2018-11-23 12:25:32,869 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:25:32,869 INFO L273 TraceCheckUtils]: 69: Hoare triple {22471#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:25:32,870 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:25:32,870 INFO L273 TraceCheckUtils]: 71: Hoare triple {22471#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:25:32,870 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:25:32,870 INFO L273 TraceCheckUtils]: 73: Hoare triple {22471#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:25:32,870 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:25:32,870 INFO L273 TraceCheckUtils]: 75: Hoare triple {22471#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:25:32,870 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:25:32,871 INFO L273 TraceCheckUtils]: 77: Hoare triple {22471#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:25:32,871 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:25:32,871 INFO L273 TraceCheckUtils]: 79: Hoare triple {22471#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:25:32,871 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:25:32,871 INFO L273 TraceCheckUtils]: 81: Hoare triple {22471#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:25:32,871 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:25:32,872 INFO L273 TraceCheckUtils]: 83: Hoare triple {22471#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:25:32,872 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:25:32,872 INFO L273 TraceCheckUtils]: 85: Hoare triple {22471#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:25:32,872 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:25:32,872 INFO L273 TraceCheckUtils]: 87: Hoare triple {22471#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:25:32,872 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:25:32,872 INFO L273 TraceCheckUtils]: 89: Hoare triple {22471#true} assume !(~i~0 < 100); {22471#true} is VALID [2018-11-23 12:25:32,873 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:25:32,873 INFO L273 TraceCheckUtils]: 91: Hoare triple {22471#true} assume true; {22471#true} is VALID [2018-11-23 12:25:32,873 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {22471#true} {22471#true} #70#return; {22471#true} is VALID [2018-11-23 12:25:32,873 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:25:32,873 INFO L256 TraceCheckUtils]: 94: Hoare triple {22471#true} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {22471#true} is VALID [2018-11-23 12:25:32,873 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:25:32,873 INFO L273 TraceCheckUtils]: 96: Hoare triple {22471#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:25:32,874 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:25:32,874 INFO L273 TraceCheckUtils]: 98: Hoare triple {22471#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:25:32,874 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:25:32,874 INFO L273 TraceCheckUtils]: 100: Hoare triple {22471#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:25:32,874 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:25:32,874 INFO L273 TraceCheckUtils]: 102: Hoare triple {22471#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:25:32,874 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:25:32,875 INFO L273 TraceCheckUtils]: 104: Hoare triple {22471#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:25:32,875 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:25:32,875 INFO L273 TraceCheckUtils]: 106: Hoare triple {22471#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:25:32,875 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:25:32,875 INFO L273 TraceCheckUtils]: 108: Hoare triple {22471#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:25:32,875 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:25:32,875 INFO L273 TraceCheckUtils]: 110: Hoare triple {22471#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:25:32,876 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:25:32,876 INFO L273 TraceCheckUtils]: 112: Hoare triple {22471#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:25:32,876 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:25:32,876 INFO L273 TraceCheckUtils]: 114: Hoare triple {22471#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22471#true} is VALID [2018-11-23 12:25:32,876 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:25:32,876 INFO L273 TraceCheckUtils]: 116: Hoare triple {22471#true} assume !(~i~0 < 100); {22471#true} is VALID [2018-11-23 12:25:32,876 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:25:32,877 INFO L273 TraceCheckUtils]: 118: Hoare triple {22471#true} assume true; {22471#true} is VALID [2018-11-23 12:25:32,877 INFO L268 TraceCheckUtils]: 119: Hoare quadruple {22471#true} {22471#true} #72#return; {22471#true} is VALID [2018-11-23 12:25:32,897 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:25:32,901 INFO L273 TraceCheckUtils]: 121: Hoare triple {22867#(<= main_~i~2 0)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:32,902 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:25:32,903 INFO L273 TraceCheckUtils]: 123: Hoare triple {22874#(<= main_~i~2 1)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:32,903 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:25:32,905 INFO L273 TraceCheckUtils]: 125: Hoare triple {22881#(<= main_~i~2 2)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:32,905 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:25:32,908 INFO L273 TraceCheckUtils]: 127: Hoare triple {22888#(<= main_~i~2 3)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:32,908 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:25:32,908 INFO L273 TraceCheckUtils]: 129: Hoare triple {22895#(<= main_~i~2 4)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:32,909 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:25:32,909 INFO L273 TraceCheckUtils]: 131: Hoare triple {22902#(<= main_~i~2 5)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:32,910 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:25:32,910 INFO L273 TraceCheckUtils]: 133: Hoare triple {22909#(<= main_~i~2 6)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:32,910 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:25:32,911 INFO L273 TraceCheckUtils]: 135: Hoare triple {22916#(<= main_~i~2 7)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:32,911 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:25:32,911 INFO L273 TraceCheckUtils]: 137: Hoare triple {22923#(<= main_~i~2 8)} assume !(~i~2 < 99); {22472#false} is VALID [2018-11-23 12:25:32,911 INFO L273 TraceCheckUtils]: 138: Hoare triple {22472#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {22472#false} is VALID [2018-11-23 12:25:32,912 INFO L256 TraceCheckUtils]: 139: Hoare triple {22472#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {22472#false} is VALID [2018-11-23 12:25:32,912 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:25:32,912 INFO L273 TraceCheckUtils]: 141: Hoare triple {22472#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22472#false} is VALID [2018-11-23 12:25:32,912 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:25:32,912 INFO L273 TraceCheckUtils]: 143: Hoare triple {22472#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22472#false} is VALID [2018-11-23 12:25:32,912 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:25:32,912 INFO L273 TraceCheckUtils]: 145: Hoare triple {22472#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22472#false} is VALID [2018-11-23 12:25:32,912 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:25:32,913 INFO L273 TraceCheckUtils]: 147: Hoare triple {22472#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22472#false} is VALID [2018-11-23 12:25:32,913 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:25:32,913 INFO L273 TraceCheckUtils]: 149: Hoare triple {22472#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22472#false} is VALID [2018-11-23 12:25:32,913 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:25:32,913 INFO L273 TraceCheckUtils]: 151: Hoare triple {22472#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22472#false} is VALID [2018-11-23 12:25:32,913 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:25:32,914 INFO L273 TraceCheckUtils]: 153: Hoare triple {22472#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22472#false} is VALID [2018-11-23 12:25:32,914 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:25:32,914 INFO L273 TraceCheckUtils]: 155: Hoare triple {22472#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22472#false} is VALID [2018-11-23 12:25:32,914 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:25:32,914 INFO L273 TraceCheckUtils]: 157: Hoare triple {22472#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22472#false} is VALID [2018-11-23 12:25:32,914 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:25:32,914 INFO L273 TraceCheckUtils]: 159: Hoare triple {22472#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {22472#false} is VALID [2018-11-23 12:25:32,915 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:25:32,915 INFO L273 TraceCheckUtils]: 161: Hoare triple {22472#false} assume !(~i~0 < 100); {22472#false} is VALID [2018-11-23 12:25:32,915 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:25:32,915 INFO L273 TraceCheckUtils]: 163: Hoare triple {22472#false} assume true; {22472#false} is VALID [2018-11-23 12:25:32,915 INFO L268 TraceCheckUtils]: 164: Hoare quadruple {22472#false} {22472#false} #74#return; {22472#false} is VALID [2018-11-23 12:25:32,915 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:25:32,915 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:25:32,915 INFO L273 TraceCheckUtils]: 167: Hoare triple {22472#false} assume !false; {22472#false} is VALID [2018-11-23 12:25:32,926 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:25:32,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:25:32,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 11] total 42 [2018-11-23 12:25:32,947 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 168 [2018-11-23 12:25:32,947 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:25:32,948 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 12:25:33,063 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:25:33,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 12:25:33,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 12:25:33,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=582, Invalid=1140, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:25:33,064 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand 42 states. [2018-11-23 12:25:34,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:34,036 INFO L93 Difference]: Finished difference Result 177 states and 186 transitions. [2018-11-23 12:25:34,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-23 12:25:34,037 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 168 [2018-11-23 12:25:34,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:25:34,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:25:34,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 133 transitions. [2018-11-23 12:25:34,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:25:34,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 133 transitions. [2018-11-23 12:25:34,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 133 transitions. [2018-11-23 12:25:34,245 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:25:34,247 INFO L225 Difference]: With dead ends: 177 [2018-11-23 12:25:34,247 INFO L226 Difference]: Without dead ends: 125 [2018-11-23 12:25:34,249 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:25:34,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-23 12:25:34,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-11-23 12:25:34,295 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:25:34,295 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand 123 states. [2018-11-23 12:25:34,295 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 123 states. [2018-11-23 12:25:34,295 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 123 states. [2018-11-23 12:25:34,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:34,298 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2018-11-23 12:25:34,298 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-11-23 12:25:34,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:25:34,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:25:34,299 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 125 states. [2018-11-23 12:25:34,299 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 125 states. [2018-11-23 12:25:34,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:34,301 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2018-11-23 12:25:34,301 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-11-23 12:25:34,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:25:34,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:25:34,302 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:25:34,302 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:25:34,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-23 12:25:34,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 127 transitions. [2018-11-23 12:25:34,304 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 127 transitions. Word has length 168 [2018-11-23 12:25:34,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:25:34,304 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 127 transitions. [2018-11-23 12:25:34,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 12:25:34,305 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2018-11-23 12:25:34,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-23 12:25:34,306 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:25:34,306 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:25:34,306 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:25:34,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:25:34,306 INFO L82 PathProgramCache]: Analyzing trace with hash 853170883, now seen corresponding path program 31 times [2018-11-23 12:25:34,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:25:34,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:25:34,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:25:34,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:25:34,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:25:34,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:25:35,831 INFO L256 TraceCheckUtils]: 0: Hoare triple {23712#true} call ULTIMATE.init(); {23712#true} is VALID [2018-11-23 12:25:35,831 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:25:35,831 INFO L273 TraceCheckUtils]: 2: Hoare triple {23712#true} assume true; {23712#true} is VALID [2018-11-23 12:25:35,831 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23712#true} {23712#true} #66#return; {23712#true} is VALID [2018-11-23 12:25:35,831 INFO L256 TraceCheckUtils]: 4: Hoare triple {23712#true} call #t~ret13 := main(); {23712#true} is VALID [2018-11-23 12:25:35,832 INFO L273 TraceCheckUtils]: 5: Hoare triple {23712#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:25:35,832 INFO L273 TraceCheckUtils]: 6: Hoare triple {23714#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:25:35,833 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:25:35,833 INFO L273 TraceCheckUtils]: 8: Hoare triple {23715#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:25:35,834 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:25:35,835 INFO L273 TraceCheckUtils]: 10: Hoare triple {23716#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:25:35,835 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:25:35,836 INFO L273 TraceCheckUtils]: 12: Hoare triple {23717#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -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:25:35,836 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:25:35,837 INFO L273 TraceCheckUtils]: 14: Hoare triple {23718#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -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:25:35,837 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:25:35,838 INFO L273 TraceCheckUtils]: 16: Hoare triple {23719#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -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:25:35,839 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:25:35,839 INFO L273 TraceCheckUtils]: 18: Hoare triple {23720#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -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:25:35,840 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:25:35,840 INFO L273 TraceCheckUtils]: 20: Hoare triple {23721#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -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:25:35,841 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:25:35,841 INFO L273 TraceCheckUtils]: 22: Hoare triple {23722#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -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:25:35,842 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:25:35,843 INFO L273 TraceCheckUtils]: 24: Hoare triple {23723#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -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:25:35,843 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:25:35,844 INFO L273 TraceCheckUtils]: 26: Hoare triple {23724#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -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:25:35,844 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:25:35,845 INFO L273 TraceCheckUtils]: 28: Hoare triple {23725#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -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:25:35,846 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:25:35,846 INFO L273 TraceCheckUtils]: 30: Hoare triple {23726#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -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:25:35,847 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:25:35,847 INFO L273 TraceCheckUtils]: 32: Hoare triple {23727#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -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:25:35,848 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:25:35,848 INFO L273 TraceCheckUtils]: 34: Hoare triple {23728#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -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:25:35,849 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:25:35,849 INFO L273 TraceCheckUtils]: 36: Hoare triple {23729#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -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:25:35,850 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:25:35,851 INFO L273 TraceCheckUtils]: 38: Hoare triple {23730#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -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:25:35,851 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:25:35,852 INFO L273 TraceCheckUtils]: 40: Hoare triple {23731#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -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:25:35,852 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:25:35,853 INFO L273 TraceCheckUtils]: 42: Hoare triple {23732#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -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:25:35,854 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:25:35,854 INFO L273 TraceCheckUtils]: 44: Hoare triple {23733#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -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:25:35,855 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:25:35,855 INFO L273 TraceCheckUtils]: 46: Hoare triple {23734#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -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:25:35,856 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:25:35,856 INFO L273 TraceCheckUtils]: 48: Hoare triple {23735#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -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:25:35,857 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:25:35,858 INFO L273 TraceCheckUtils]: 50: Hoare triple {23736#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -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:25:35,858 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:25:35,859 INFO L273 TraceCheckUtils]: 52: Hoare triple {23737#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -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:25:35,859 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:25:35,860 INFO L273 TraceCheckUtils]: 54: Hoare triple {23738#(<= main_~i~1 24)} assume !!(~i~1 < 100);assume -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:25:35,861 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:25:35,861 INFO L273 TraceCheckUtils]: 56: Hoare triple {23739#(<= main_~i~1 25)} assume !!(~i~1 < 100);assume -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:25:35,862 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:25:35,862 INFO L273 TraceCheckUtils]: 58: Hoare triple {23740#(<= main_~i~1 26)} assume !!(~i~1 < 100);assume -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:25:35,863 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:25:35,863 INFO L273 TraceCheckUtils]: 60: Hoare triple {23741#(<= main_~i~1 27)} assume !!(~i~1 < 100);assume -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:25:35,864 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:25:35,864 INFO L273 TraceCheckUtils]: 62: Hoare triple {23742#(<= main_~i~1 28)} assume !!(~i~1 < 100);assume -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:25:35,865 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:25:35,866 INFO L273 TraceCheckUtils]: 64: Hoare triple {23743#(<= main_~i~1 29)} assume !!(~i~1 < 100);assume -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:25:35,866 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:25:35,867 INFO L273 TraceCheckUtils]: 66: Hoare triple {23744#(<= main_~i~1 30)} assume !!(~i~1 < 100);assume -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:25:35,867 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:25:35,868 INFO L273 TraceCheckUtils]: 68: Hoare triple {23745#(<= main_~i~1 31)} assume !(~i~1 < 100); {23713#false} is VALID [2018-11-23 12:25:35,868 INFO L256 TraceCheckUtils]: 69: Hoare triple {23713#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {23712#true} is VALID [2018-11-23 12:25:35,868 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:25:35,869 INFO L273 TraceCheckUtils]: 71: Hoare triple {23712#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:25:35,869 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:25:35,869 INFO L273 TraceCheckUtils]: 73: Hoare triple {23712#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:25:35,869 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:25:35,869 INFO L273 TraceCheckUtils]: 75: Hoare triple {23712#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:25:35,869 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:25:35,870 INFO L273 TraceCheckUtils]: 77: Hoare triple {23712#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:25:35,870 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:25:35,870 INFO L273 TraceCheckUtils]: 79: Hoare triple {23712#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:25:35,870 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:25:35,870 INFO L273 TraceCheckUtils]: 81: Hoare triple {23712#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:25:35,870 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:25:35,871 INFO L273 TraceCheckUtils]: 83: Hoare triple {23712#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:25:35,871 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:25:35,871 INFO L273 TraceCheckUtils]: 85: Hoare triple {23712#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:25:35,871 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:25:35,871 INFO L273 TraceCheckUtils]: 87: Hoare triple {23712#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:25:35,871 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:25:35,871 INFO L273 TraceCheckUtils]: 89: Hoare triple {23712#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:25:35,871 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:25:35,871 INFO L273 TraceCheckUtils]: 91: Hoare triple {23712#true} assume !(~i~0 < 100); {23712#true} is VALID [2018-11-23 12:25:35,872 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:25:35,872 INFO L273 TraceCheckUtils]: 93: Hoare triple {23712#true} assume true; {23712#true} is VALID [2018-11-23 12:25:35,872 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {23712#true} {23713#false} #70#return; {23713#false} is VALID [2018-11-23 12:25:35,872 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:25:35,872 INFO L256 TraceCheckUtils]: 96: Hoare triple {23713#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {23712#true} is VALID [2018-11-23 12:25:35,872 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:25:35,872 INFO L273 TraceCheckUtils]: 98: Hoare triple {23712#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:25:35,872 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:25:35,872 INFO L273 TraceCheckUtils]: 100: Hoare triple {23712#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:25:35,872 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:25:35,873 INFO L273 TraceCheckUtils]: 102: Hoare triple {23712#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:25:35,873 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:25:35,873 INFO L273 TraceCheckUtils]: 104: Hoare triple {23712#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:25:35,873 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:25:35,873 INFO L273 TraceCheckUtils]: 106: Hoare triple {23712#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:25:35,873 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:25:35,873 INFO L273 TraceCheckUtils]: 108: Hoare triple {23712#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:25:35,873 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:25:35,873 INFO L273 TraceCheckUtils]: 110: Hoare triple {23712#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:25:35,874 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:25:35,874 INFO L273 TraceCheckUtils]: 112: Hoare triple {23712#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:25:35,874 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:25:35,874 INFO L273 TraceCheckUtils]: 114: Hoare triple {23712#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:25:35,874 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:25:35,874 INFO L273 TraceCheckUtils]: 116: Hoare triple {23712#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:25:35,874 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:25:35,874 INFO L273 TraceCheckUtils]: 118: Hoare triple {23712#true} assume !(~i~0 < 100); {23712#true} is VALID [2018-11-23 12:25:35,874 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:25:35,874 INFO L273 TraceCheckUtils]: 120: Hoare triple {23712#true} assume true; {23712#true} is VALID [2018-11-23 12:25:35,875 INFO L268 TraceCheckUtils]: 121: Hoare quadruple {23712#true} {23713#false} #72#return; {23713#false} is VALID [2018-11-23 12:25:35,875 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:25:35,875 INFO L273 TraceCheckUtils]: 123: Hoare triple {23713#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:35,875 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:25:35,875 INFO L273 TraceCheckUtils]: 125: Hoare triple {23713#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:35,875 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:25:35,875 INFO L273 TraceCheckUtils]: 127: Hoare triple {23713#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:35,875 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:25:35,875 INFO L273 TraceCheckUtils]: 129: Hoare triple {23713#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:35,875 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:25:35,876 INFO L273 TraceCheckUtils]: 131: Hoare triple {23713#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:35,876 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:25:35,876 INFO L273 TraceCheckUtils]: 133: Hoare triple {23713#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:35,876 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:25:35,876 INFO L273 TraceCheckUtils]: 135: Hoare triple {23713#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:35,876 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:25:35,876 INFO L273 TraceCheckUtils]: 137: Hoare triple {23713#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:35,876 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:25:35,876 INFO L273 TraceCheckUtils]: 139: Hoare triple {23713#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:35,876 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:25:35,877 INFO L273 TraceCheckUtils]: 141: Hoare triple {23713#false} assume !(~i~2 < 99); {23713#false} is VALID [2018-11-23 12:25:35,877 INFO L273 TraceCheckUtils]: 142: Hoare triple {23713#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {23713#false} is VALID [2018-11-23 12:25:35,877 INFO L256 TraceCheckUtils]: 143: Hoare triple {23713#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {23712#true} is VALID [2018-11-23 12:25:35,877 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:25:35,877 INFO L273 TraceCheckUtils]: 145: Hoare triple {23712#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:25:35,877 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:25:35,877 INFO L273 TraceCheckUtils]: 147: Hoare triple {23712#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:25:35,877 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:25:35,877 INFO L273 TraceCheckUtils]: 149: Hoare triple {23712#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:25:35,877 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:25:35,878 INFO L273 TraceCheckUtils]: 151: Hoare triple {23712#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:25:35,878 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:25:35,878 INFO L273 TraceCheckUtils]: 153: Hoare triple {23712#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:25:35,878 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:25:35,878 INFO L273 TraceCheckUtils]: 155: Hoare triple {23712#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:25:35,878 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:25:35,878 INFO L273 TraceCheckUtils]: 157: Hoare triple {23712#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:25:35,878 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:25:35,878 INFO L273 TraceCheckUtils]: 159: Hoare triple {23712#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:25:35,879 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:25:35,879 INFO L273 TraceCheckUtils]: 161: Hoare triple {23712#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:25:35,879 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:25:35,879 INFO L273 TraceCheckUtils]: 163: Hoare triple {23712#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23712#true} is VALID [2018-11-23 12:25:35,879 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:25:35,879 INFO L273 TraceCheckUtils]: 165: Hoare triple {23712#true} assume !(~i~0 < 100); {23712#true} is VALID [2018-11-23 12:25:35,879 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:25:35,879 INFO L273 TraceCheckUtils]: 167: Hoare triple {23712#true} assume true; {23712#true} is VALID [2018-11-23 12:25:35,879 INFO L268 TraceCheckUtils]: 168: Hoare quadruple {23712#true} {23713#false} #74#return; {23713#false} is VALID [2018-11-23 12:25:35,879 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:25:35,880 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:25:35,880 INFO L273 TraceCheckUtils]: 171: Hoare triple {23713#false} assume !false; {23713#false} is VALID [2018-11-23 12:25:35,893 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:25:35,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:25:35,893 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:25:35,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:25:35,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:25:36,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:25:36,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:25:36,337 INFO L256 TraceCheckUtils]: 0: Hoare triple {23712#true} call ULTIMATE.init(); {23712#true} is VALID [2018-11-23 12:25:36,337 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:25:36,337 INFO L273 TraceCheckUtils]: 2: Hoare triple {23712#true} assume true; {23712#true} is VALID [2018-11-23 12:25:36,338 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23712#true} {23712#true} #66#return; {23712#true} is VALID [2018-11-23 12:25:36,338 INFO L256 TraceCheckUtils]: 4: Hoare triple {23712#true} call #t~ret13 := main(); {23712#true} is VALID [2018-11-23 12:25:36,338 INFO L273 TraceCheckUtils]: 5: Hoare triple {23712#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:25:36,339 INFO L273 TraceCheckUtils]: 6: Hoare triple {23764#(<= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:25:36,340 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:25:36,340 INFO L273 TraceCheckUtils]: 8: Hoare triple {23715#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:25:36,341 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:25:36,341 INFO L273 TraceCheckUtils]: 10: Hoare triple {23716#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:25:36,342 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:25:36,343 INFO L273 TraceCheckUtils]: 12: Hoare triple {23717#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -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:25:36,343 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:25:36,344 INFO L273 TraceCheckUtils]: 14: Hoare triple {23718#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -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:25:36,344 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:25:36,345 INFO L273 TraceCheckUtils]: 16: Hoare triple {23719#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -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:25:36,346 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:25:36,346 INFO L273 TraceCheckUtils]: 18: Hoare triple {23720#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -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:25:36,347 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:25:36,347 INFO L273 TraceCheckUtils]: 20: Hoare triple {23721#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -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:25:36,348 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:25:36,348 INFO L273 TraceCheckUtils]: 22: Hoare triple {23722#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -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:25:36,349 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:25:36,349 INFO L273 TraceCheckUtils]: 24: Hoare triple {23723#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -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:25:36,350 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:25:36,351 INFO L273 TraceCheckUtils]: 26: Hoare triple {23724#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -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:25:36,351 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:25:36,352 INFO L273 TraceCheckUtils]: 28: Hoare triple {23725#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -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:25:36,352 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:25:36,353 INFO L273 TraceCheckUtils]: 30: Hoare triple {23726#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -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:25:36,354 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:25:36,354 INFO L273 TraceCheckUtils]: 32: Hoare triple {23727#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -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:25:36,355 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:25:36,355 INFO L273 TraceCheckUtils]: 34: Hoare triple {23728#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -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:25:36,356 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:25:36,356 INFO L273 TraceCheckUtils]: 36: Hoare triple {23729#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -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:25:36,357 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:25:36,358 INFO L273 TraceCheckUtils]: 38: Hoare triple {23730#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -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:25:36,358 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:25:36,359 INFO L273 TraceCheckUtils]: 40: Hoare triple {23731#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -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:25:36,359 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:25:36,360 INFO L273 TraceCheckUtils]: 42: Hoare triple {23732#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -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:25:36,361 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:25:36,361 INFO L273 TraceCheckUtils]: 44: Hoare triple {23733#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -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:25:36,362 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:25:36,362 INFO L273 TraceCheckUtils]: 46: Hoare triple {23734#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -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:25:36,363 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:25:36,363 INFO L273 TraceCheckUtils]: 48: Hoare triple {23735#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -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:25:36,364 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:25:36,365 INFO L273 TraceCheckUtils]: 50: Hoare triple {23736#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -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:25:36,365 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:25:36,366 INFO L273 TraceCheckUtils]: 52: Hoare triple {23737#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -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:25:36,366 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:25:36,367 INFO L273 TraceCheckUtils]: 54: Hoare triple {23738#(<= main_~i~1 24)} assume !!(~i~1 < 100);assume -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:25:36,367 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:25:36,368 INFO L273 TraceCheckUtils]: 56: Hoare triple {23739#(<= main_~i~1 25)} assume !!(~i~1 < 100);assume -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:25:36,369 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:25:36,369 INFO L273 TraceCheckUtils]: 58: Hoare triple {23740#(<= main_~i~1 26)} assume !!(~i~1 < 100);assume -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:25:36,370 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:25:36,370 INFO L273 TraceCheckUtils]: 60: Hoare triple {23741#(<= main_~i~1 27)} assume !!(~i~1 < 100);assume -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:25:36,371 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:25:36,371 INFO L273 TraceCheckUtils]: 62: Hoare triple {23742#(<= main_~i~1 28)} assume !!(~i~1 < 100);assume -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:25:36,372 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:25:36,373 INFO L273 TraceCheckUtils]: 64: Hoare triple {23743#(<= main_~i~1 29)} assume !!(~i~1 < 100);assume -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:25:36,373 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:25:36,374 INFO L273 TraceCheckUtils]: 66: Hoare triple {23744#(<= main_~i~1 30)} assume !!(~i~1 < 100);assume -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:25:36,374 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:25:36,375 INFO L273 TraceCheckUtils]: 68: Hoare triple {23745#(<= main_~i~1 31)} assume !(~i~1 < 100); {23713#false} is VALID [2018-11-23 12:25:36,375 INFO L256 TraceCheckUtils]: 69: Hoare triple {23713#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {23713#false} is VALID [2018-11-23 12:25:36,375 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:25:36,376 INFO L273 TraceCheckUtils]: 71: Hoare triple {23713#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:25:36,376 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:25:36,376 INFO L273 TraceCheckUtils]: 73: Hoare triple {23713#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:25:36,376 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:25:36,376 INFO L273 TraceCheckUtils]: 75: Hoare triple {23713#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:25:36,376 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:25:36,377 INFO L273 TraceCheckUtils]: 77: Hoare triple {23713#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:25:36,377 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:25:36,377 INFO L273 TraceCheckUtils]: 79: Hoare triple {23713#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:25:36,377 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:25:36,377 INFO L273 TraceCheckUtils]: 81: Hoare triple {23713#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:25:36,377 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:25:36,378 INFO L273 TraceCheckUtils]: 83: Hoare triple {23713#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:25:36,378 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:25:36,378 INFO L273 TraceCheckUtils]: 85: Hoare triple {23713#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:25:36,378 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:25:36,378 INFO L273 TraceCheckUtils]: 87: Hoare triple {23713#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:25:36,378 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:25:36,379 INFO L273 TraceCheckUtils]: 89: Hoare triple {23713#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:25:36,379 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:25:36,379 INFO L273 TraceCheckUtils]: 91: Hoare triple {23713#false} assume !(~i~0 < 100); {23713#false} is VALID [2018-11-23 12:25:36,379 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:25:36,379 INFO L273 TraceCheckUtils]: 93: Hoare triple {23713#false} assume true; {23713#false} is VALID [2018-11-23 12:25:36,379 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {23713#false} {23713#false} #70#return; {23713#false} is VALID [2018-11-23 12:25:36,380 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:25:36,380 INFO L256 TraceCheckUtils]: 96: Hoare triple {23713#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {23713#false} is VALID [2018-11-23 12:25:36,380 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:25:36,380 INFO L273 TraceCheckUtils]: 98: Hoare triple {23713#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:25:36,380 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:25:36,380 INFO L273 TraceCheckUtils]: 100: Hoare triple {23713#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:25:36,380 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:25:36,380 INFO L273 TraceCheckUtils]: 102: Hoare triple {23713#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:25:36,380 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:25:36,380 INFO L273 TraceCheckUtils]: 104: Hoare triple {23713#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:25:36,381 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:25:36,381 INFO L273 TraceCheckUtils]: 106: Hoare triple {23713#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:25:36,381 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:25:36,381 INFO L273 TraceCheckUtils]: 108: Hoare triple {23713#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:25:36,381 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:25:36,381 INFO L273 TraceCheckUtils]: 110: Hoare triple {23713#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:25:36,381 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:25:36,381 INFO L273 TraceCheckUtils]: 112: Hoare triple {23713#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:25:36,381 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:25:36,382 INFO L273 TraceCheckUtils]: 114: Hoare triple {23713#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:25:36,382 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:25:36,382 INFO L273 TraceCheckUtils]: 116: Hoare triple {23713#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:25:36,382 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:25:36,382 INFO L273 TraceCheckUtils]: 118: Hoare triple {23713#false} assume !(~i~0 < 100); {23713#false} is VALID [2018-11-23 12:25:36,382 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:25:36,382 INFO L273 TraceCheckUtils]: 120: Hoare triple {23713#false} assume true; {23713#false} is VALID [2018-11-23 12:25:36,382 INFO L268 TraceCheckUtils]: 121: Hoare quadruple {23713#false} {23713#false} #72#return; {23713#false} is VALID [2018-11-23 12:25:36,382 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:25:36,382 INFO L273 TraceCheckUtils]: 123: Hoare triple {23713#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:36,383 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:25:36,383 INFO L273 TraceCheckUtils]: 125: Hoare triple {23713#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:36,383 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:25:36,383 INFO L273 TraceCheckUtils]: 127: Hoare triple {23713#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:36,383 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:25:36,383 INFO L273 TraceCheckUtils]: 129: Hoare triple {23713#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:36,383 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:25:36,383 INFO L273 TraceCheckUtils]: 131: Hoare triple {23713#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:36,383 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:25:36,384 INFO L273 TraceCheckUtils]: 133: Hoare triple {23713#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:36,384 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:25:36,384 INFO L273 TraceCheckUtils]: 135: Hoare triple {23713#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:36,384 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:25:36,384 INFO L273 TraceCheckUtils]: 137: Hoare triple {23713#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:36,384 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:25:36,384 INFO L273 TraceCheckUtils]: 139: Hoare triple {23713#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:36,385 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:25:36,385 INFO L273 TraceCheckUtils]: 141: Hoare triple {23713#false} assume !(~i~2 < 99); {23713#false} is VALID [2018-11-23 12:25:36,385 INFO L273 TraceCheckUtils]: 142: Hoare triple {23713#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {23713#false} is VALID [2018-11-23 12:25:36,385 INFO L256 TraceCheckUtils]: 143: Hoare triple {23713#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {23713#false} is VALID [2018-11-23 12:25:36,385 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:25:36,385 INFO L273 TraceCheckUtils]: 145: Hoare triple {23713#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:25:36,386 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:25:36,386 INFO L273 TraceCheckUtils]: 147: Hoare triple {23713#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:25:36,386 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:25:36,386 INFO L273 TraceCheckUtils]: 149: Hoare triple {23713#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:25:36,386 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:25:36,386 INFO L273 TraceCheckUtils]: 151: Hoare triple {23713#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:25:36,387 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:25:36,387 INFO L273 TraceCheckUtils]: 153: Hoare triple {23713#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:25:36,387 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:25:36,387 INFO L273 TraceCheckUtils]: 155: Hoare triple {23713#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:25:36,387 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:25:36,387 INFO L273 TraceCheckUtils]: 157: Hoare triple {23713#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:25:36,387 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:25:36,388 INFO L273 TraceCheckUtils]: 159: Hoare triple {23713#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:25:36,388 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:25:36,388 INFO L273 TraceCheckUtils]: 161: Hoare triple {23713#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:25:36,388 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:25:36,388 INFO L273 TraceCheckUtils]: 163: Hoare triple {23713#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {23713#false} is VALID [2018-11-23 12:25:36,388 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:25:36,389 INFO L273 TraceCheckUtils]: 165: Hoare triple {23713#false} assume !(~i~0 < 100); {23713#false} is VALID [2018-11-23 12:25:36,389 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:25:36,389 INFO L273 TraceCheckUtils]: 167: Hoare triple {23713#false} assume true; {23713#false} is VALID [2018-11-23 12:25:36,389 INFO L268 TraceCheckUtils]: 168: Hoare quadruple {23713#false} {23713#false} #74#return; {23713#false} is VALID [2018-11-23 12:25:36,389 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:25:36,389 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:25:36,389 INFO L273 TraceCheckUtils]: 171: Hoare triple {23713#false} assume !false; {23713#false} is VALID [2018-11-23 12:25:36,407 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:25:36,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:25:36,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2018-11-23 12:25:36,434 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 172 [2018-11-23 12:25:36,434 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:25:36,434 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-23 12:25:36,573 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:25:36,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-23 12:25:36,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-23 12:25:36,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:25:36,574 INFO L87 Difference]: Start difference. First operand 123 states and 127 transitions. Second operand 35 states. [2018-11-23 12:25:36,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:36,893 INFO L93 Difference]: Finished difference Result 180 states and 188 transitions. [2018-11-23 12:25:36,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 12:25:36,894 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 172 [2018-11-23 12:25:36,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:25:36,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:25:36,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 116 transitions. [2018-11-23 12:25:36,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:25:36,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 116 transitions. [2018-11-23 12:25:36,896 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 116 transitions. [2018-11-23 12:25:37,026 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:25:37,029 INFO L225 Difference]: With dead ends: 180 [2018-11-23 12:25:37,029 INFO L226 Difference]: Without dead ends: 126 [2018-11-23 12:25:37,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:25:37,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-23 12:25:37,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2018-11-23 12:25:37,126 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:25:37,126 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand 125 states. [2018-11-23 12:25:37,127 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 125 states. [2018-11-23 12:25:37,127 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 125 states. [2018-11-23 12:25:37,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:37,129 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2018-11-23 12:25:37,129 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2018-11-23 12:25:37,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:25:37,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:25:37,130 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 126 states. [2018-11-23 12:25:37,130 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 126 states. [2018-11-23 12:25:37,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:37,132 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2018-11-23 12:25:37,133 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2018-11-23 12:25:37,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:25:37,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:25:37,133 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:25:37,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:25:37,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-23 12:25:37,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2018-11-23 12:25:37,135 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 172 [2018-11-23 12:25:37,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:25:37,136 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2018-11-23 12:25:37,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-23 12:25:37,136 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-11-23 12:25:37,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-23 12:25:37,137 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:25:37,137 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:25:37,137 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:25:37,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:25:37,137 INFO L82 PathProgramCache]: Analyzing trace with hash -320678875, now seen corresponding path program 32 times [2018-11-23 12:25:37,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:25:37,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:25:37,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:25:37,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:25:37,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:25:37,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:25:37,770 INFO L256 TraceCheckUtils]: 0: Hoare triple {24968#true} call ULTIMATE.init(); {24968#true} is VALID [2018-11-23 12:25:37,770 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:25:37,771 INFO L273 TraceCheckUtils]: 2: Hoare triple {24968#true} assume true; {24968#true} is VALID [2018-11-23 12:25:37,771 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24968#true} {24968#true} #66#return; {24968#true} is VALID [2018-11-23 12:25:37,771 INFO L256 TraceCheckUtils]: 4: Hoare triple {24968#true} call #t~ret13 := main(); {24968#true} is VALID [2018-11-23 12:25:37,771 INFO L273 TraceCheckUtils]: 5: Hoare triple {24968#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:25:37,772 INFO L273 TraceCheckUtils]: 6: Hoare triple {24970#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:25:37,773 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:25:37,773 INFO L273 TraceCheckUtils]: 8: Hoare triple {24971#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:25:37,774 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:25:37,774 INFO L273 TraceCheckUtils]: 10: Hoare triple {24972#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:25:37,774 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:25:37,775 INFO L273 TraceCheckUtils]: 12: Hoare triple {24973#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -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:25:37,775 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:25:37,775 INFO L273 TraceCheckUtils]: 14: Hoare triple {24974#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -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:25:37,776 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:25:37,776 INFO L273 TraceCheckUtils]: 16: Hoare triple {24975#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -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:25:37,777 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:25:37,777 INFO L273 TraceCheckUtils]: 18: Hoare triple {24976#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -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:25:37,778 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:25:37,778 INFO L273 TraceCheckUtils]: 20: Hoare triple {24977#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -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:25:37,779 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:25:37,779 INFO L273 TraceCheckUtils]: 22: Hoare triple {24978#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -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:25:37,780 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:25:37,780 INFO L273 TraceCheckUtils]: 24: Hoare triple {24979#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -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:25:37,781 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:25:37,782 INFO L273 TraceCheckUtils]: 26: Hoare triple {24980#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -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:25:37,782 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:25:37,783 INFO L273 TraceCheckUtils]: 28: Hoare triple {24981#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -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:25:37,783 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:25:37,784 INFO L273 TraceCheckUtils]: 30: Hoare triple {24982#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -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:25:37,784 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:25:37,785 INFO L273 TraceCheckUtils]: 32: Hoare triple {24983#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -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:25:37,786 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:25:37,786 INFO L273 TraceCheckUtils]: 34: Hoare triple {24984#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -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:25:37,787 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:25:37,787 INFO L273 TraceCheckUtils]: 36: Hoare triple {24985#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -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:25:37,788 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:25:37,788 INFO L273 TraceCheckUtils]: 38: Hoare triple {24986#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -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:25:37,789 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:25:37,790 INFO L273 TraceCheckUtils]: 40: Hoare triple {24987#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -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:25:37,790 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:25:37,791 INFO L273 TraceCheckUtils]: 42: Hoare triple {24988#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -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:25:37,791 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:25:37,792 INFO L273 TraceCheckUtils]: 44: Hoare triple {24989#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -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:25:37,792 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:25:37,793 INFO L273 TraceCheckUtils]: 46: Hoare triple {24990#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -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:25:37,794 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:25:37,794 INFO L273 TraceCheckUtils]: 48: Hoare triple {24991#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -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:25:37,795 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:25:37,795 INFO L273 TraceCheckUtils]: 50: Hoare triple {24992#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -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:25:37,796 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:25:37,796 INFO L273 TraceCheckUtils]: 52: Hoare triple {24993#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -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:25:37,797 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:25:37,798 INFO L273 TraceCheckUtils]: 54: Hoare triple {24994#(<= main_~i~1 24)} assume !!(~i~1 < 100);assume -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:25:37,798 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:25:37,799 INFO L273 TraceCheckUtils]: 56: Hoare triple {24995#(<= main_~i~1 25)} assume !!(~i~1 < 100);assume -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:25:37,799 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:25:37,800 INFO L273 TraceCheckUtils]: 58: Hoare triple {24996#(<= main_~i~1 26)} assume !!(~i~1 < 100);assume -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:25:37,801 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:25:37,801 INFO L273 TraceCheckUtils]: 60: Hoare triple {24997#(<= main_~i~1 27)} assume !!(~i~1 < 100);assume -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:25:37,802 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:25:37,802 INFO L273 TraceCheckUtils]: 62: Hoare triple {24998#(<= main_~i~1 28)} assume !!(~i~1 < 100);assume -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:25:37,803 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:25:37,803 INFO L273 TraceCheckUtils]: 64: Hoare triple {24999#(<= main_~i~1 29)} assume !!(~i~1 < 100);assume -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:25:37,804 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:25:37,804 INFO L273 TraceCheckUtils]: 66: Hoare triple {25000#(<= main_~i~1 30)} assume !!(~i~1 < 100);assume -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:25:37,805 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:25:37,806 INFO L273 TraceCheckUtils]: 68: Hoare triple {25001#(<= main_~i~1 31)} assume !!(~i~1 < 100);assume -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:25:37,806 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:25:37,807 INFO L273 TraceCheckUtils]: 70: Hoare triple {25002#(<= main_~i~1 32)} assume !(~i~1 < 100); {24969#false} is VALID [2018-11-23 12:25:37,807 INFO L256 TraceCheckUtils]: 71: Hoare triple {24969#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {24968#true} is VALID [2018-11-23 12:25:37,807 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:25:37,807 INFO L273 TraceCheckUtils]: 73: Hoare triple {24968#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:25:37,808 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:25:37,808 INFO L273 TraceCheckUtils]: 75: Hoare triple {24968#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:25:37,808 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:25:37,808 INFO L273 TraceCheckUtils]: 77: Hoare triple {24968#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:25:37,808 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:25:37,808 INFO L273 TraceCheckUtils]: 79: Hoare triple {24968#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:25:37,809 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:25:37,809 INFO L273 TraceCheckUtils]: 81: Hoare triple {24968#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:25:37,809 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:25:37,809 INFO L273 TraceCheckUtils]: 83: Hoare triple {24968#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:25:37,809 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:25:37,809 INFO L273 TraceCheckUtils]: 85: Hoare triple {24968#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:25:37,809 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:25:37,810 INFO L273 TraceCheckUtils]: 87: Hoare triple {24968#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:25:37,810 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:25:37,810 INFO L273 TraceCheckUtils]: 89: Hoare triple {24968#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:25:37,810 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:25:37,810 INFO L273 TraceCheckUtils]: 91: Hoare triple {24968#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:25:37,810 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:25:37,810 INFO L273 TraceCheckUtils]: 93: Hoare triple {24968#true} assume !(~i~0 < 100); {24968#true} is VALID [2018-11-23 12:25:37,810 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:25:37,810 INFO L273 TraceCheckUtils]: 95: Hoare triple {24968#true} assume true; {24968#true} is VALID [2018-11-23 12:25:37,810 INFO L268 TraceCheckUtils]: 96: Hoare quadruple {24968#true} {24969#false} #70#return; {24969#false} is VALID [2018-11-23 12:25:37,811 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:25:37,811 INFO L256 TraceCheckUtils]: 98: Hoare triple {24969#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {24968#true} is VALID [2018-11-23 12:25:37,811 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:25:37,811 INFO L273 TraceCheckUtils]: 100: Hoare triple {24968#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:25:37,811 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:25:37,811 INFO L273 TraceCheckUtils]: 102: Hoare triple {24968#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:25:37,811 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:25:37,811 INFO L273 TraceCheckUtils]: 104: Hoare triple {24968#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:25:37,811 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:25:37,811 INFO L273 TraceCheckUtils]: 106: Hoare triple {24968#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:25:37,812 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:25:37,812 INFO L273 TraceCheckUtils]: 108: Hoare triple {24968#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:25:37,812 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:25:37,812 INFO L273 TraceCheckUtils]: 110: Hoare triple {24968#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:25:37,812 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:25:37,812 INFO L273 TraceCheckUtils]: 112: Hoare triple {24968#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:25:37,812 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:25:37,812 INFO L273 TraceCheckUtils]: 114: Hoare triple {24968#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:25:37,812 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:25:37,812 INFO L273 TraceCheckUtils]: 116: Hoare triple {24968#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:25:37,813 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:25:37,813 INFO L273 TraceCheckUtils]: 118: Hoare triple {24968#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:25:37,813 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:25:37,813 INFO L273 TraceCheckUtils]: 120: Hoare triple {24968#true} assume !(~i~0 < 100); {24968#true} is VALID [2018-11-23 12:25:37,813 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:25:37,813 INFO L273 TraceCheckUtils]: 122: Hoare triple {24968#true} assume true; {24968#true} is VALID [2018-11-23 12:25:37,813 INFO L268 TraceCheckUtils]: 123: Hoare quadruple {24968#true} {24969#false} #72#return; {24969#false} is VALID [2018-11-23 12:25:37,813 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:25:37,813 INFO L273 TraceCheckUtils]: 125: Hoare triple {24969#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:37,813 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:25:37,814 INFO L273 TraceCheckUtils]: 127: Hoare triple {24969#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:37,814 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:25:37,814 INFO L273 TraceCheckUtils]: 129: Hoare triple {24969#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:37,814 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:25:37,814 INFO L273 TraceCheckUtils]: 131: Hoare triple {24969#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:37,814 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:25:37,814 INFO L273 TraceCheckUtils]: 133: Hoare triple {24969#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:37,814 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:25:37,814 INFO L273 TraceCheckUtils]: 135: Hoare triple {24969#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:37,815 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:25:37,815 INFO L273 TraceCheckUtils]: 137: Hoare triple {24969#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:37,815 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:25:37,815 INFO L273 TraceCheckUtils]: 139: Hoare triple {24969#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:37,815 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:25:37,815 INFO L273 TraceCheckUtils]: 141: Hoare triple {24969#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:37,815 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:25:37,815 INFO L273 TraceCheckUtils]: 143: Hoare triple {24969#false} assume !(~i~2 < 99); {24969#false} is VALID [2018-11-23 12:25:37,815 INFO L273 TraceCheckUtils]: 144: Hoare triple {24969#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {24969#false} is VALID [2018-11-23 12:25:37,815 INFO L256 TraceCheckUtils]: 145: Hoare triple {24969#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {24968#true} is VALID [2018-11-23 12:25:37,815 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:25:37,816 INFO L273 TraceCheckUtils]: 147: Hoare triple {24968#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:25:37,816 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:25:37,816 INFO L273 TraceCheckUtils]: 149: Hoare triple {24968#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:25:37,816 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:25:37,816 INFO L273 TraceCheckUtils]: 151: Hoare triple {24968#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:25:37,816 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:25:37,816 INFO L273 TraceCheckUtils]: 153: Hoare triple {24968#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:25:37,816 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:25:37,816 INFO L273 TraceCheckUtils]: 155: Hoare triple {24968#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:25:37,817 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:25:37,817 INFO L273 TraceCheckUtils]: 157: Hoare triple {24968#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:25:37,817 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:25:37,817 INFO L273 TraceCheckUtils]: 159: Hoare triple {24968#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:25:37,817 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:25:37,817 INFO L273 TraceCheckUtils]: 161: Hoare triple {24968#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:25:37,817 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:25:37,817 INFO L273 TraceCheckUtils]: 163: Hoare triple {24968#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:25:37,817 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:25:37,817 INFO L273 TraceCheckUtils]: 165: Hoare triple {24968#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24968#true} is VALID [2018-11-23 12:25:37,818 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:25:37,818 INFO L273 TraceCheckUtils]: 167: Hoare triple {24968#true} assume !(~i~0 < 100); {24968#true} is VALID [2018-11-23 12:25:37,818 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:25:37,818 INFO L273 TraceCheckUtils]: 169: Hoare triple {24968#true} assume true; {24968#true} is VALID [2018-11-23 12:25:37,818 INFO L268 TraceCheckUtils]: 170: Hoare quadruple {24968#true} {24969#false} #74#return; {24969#false} is VALID [2018-11-23 12:25:37,818 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:25:37,818 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:25:37,818 INFO L273 TraceCheckUtils]: 173: Hoare triple {24969#false} assume !false; {24969#false} is VALID [2018-11-23 12:25:37,832 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:25:37,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:25:37,832 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:25:37,840 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:25:37,910 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:25:37,910 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:25:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:25:37,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:25:38,240 INFO L256 TraceCheckUtils]: 0: Hoare triple {24968#true} call ULTIMATE.init(); {24968#true} is VALID [2018-11-23 12:25:38,241 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:25:38,241 INFO L273 TraceCheckUtils]: 2: Hoare triple {24968#true} assume true; {24968#true} is VALID [2018-11-23 12:25:38,241 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24968#true} {24968#true} #66#return; {24968#true} is VALID [2018-11-23 12:25:38,241 INFO L256 TraceCheckUtils]: 4: Hoare triple {24968#true} call #t~ret13 := main(); {24968#true} is VALID [2018-11-23 12:25:38,242 INFO L273 TraceCheckUtils]: 5: Hoare triple {24968#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:25:38,242 INFO L273 TraceCheckUtils]: 6: Hoare triple {25021#(<= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:25:38,243 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:25:38,243 INFO L273 TraceCheckUtils]: 8: Hoare triple {24971#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:25:38,243 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:25:38,244 INFO L273 TraceCheckUtils]: 10: Hoare triple {24972#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:25:38,244 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:25:38,245 INFO L273 TraceCheckUtils]: 12: Hoare triple {24973#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -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:25:38,245 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:25:38,246 INFO L273 TraceCheckUtils]: 14: Hoare triple {24974#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -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:25:38,247 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:25:38,247 INFO L273 TraceCheckUtils]: 16: Hoare triple {24975#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -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:25:38,248 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:25:38,248 INFO L273 TraceCheckUtils]: 18: Hoare triple {24976#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -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:25:38,249 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:25:38,249 INFO L273 TraceCheckUtils]: 20: Hoare triple {24977#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -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:25:38,250 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:25:38,251 INFO L273 TraceCheckUtils]: 22: Hoare triple {24978#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -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:25:38,251 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:25:38,252 INFO L273 TraceCheckUtils]: 24: Hoare triple {24979#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -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:25:38,252 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:25:38,253 INFO L273 TraceCheckUtils]: 26: Hoare triple {24980#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -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:25:38,254 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:25:38,254 INFO L273 TraceCheckUtils]: 28: Hoare triple {24981#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -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:25:38,255 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:25:38,255 INFO L273 TraceCheckUtils]: 30: Hoare triple {24982#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -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:25:38,256 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:25:38,256 INFO L273 TraceCheckUtils]: 32: Hoare triple {24983#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -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:25:38,257 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:25:38,257 INFO L273 TraceCheckUtils]: 34: Hoare triple {24984#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -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:25:38,258 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:25:38,259 INFO L273 TraceCheckUtils]: 36: Hoare triple {24985#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -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:25:38,259 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:25:38,260 INFO L273 TraceCheckUtils]: 38: Hoare triple {24986#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -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:25:38,260 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:25:38,261 INFO L273 TraceCheckUtils]: 40: Hoare triple {24987#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -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:25:38,262 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:25:38,262 INFO L273 TraceCheckUtils]: 42: Hoare triple {24988#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -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:25:38,263 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:25:38,263 INFO L273 TraceCheckUtils]: 44: Hoare triple {24989#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -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:25:38,264 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:25:38,264 INFO L273 TraceCheckUtils]: 46: Hoare triple {24990#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -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:25:38,265 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:25:38,266 INFO L273 TraceCheckUtils]: 48: Hoare triple {24991#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -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:25:38,266 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:25:38,267 INFO L273 TraceCheckUtils]: 50: Hoare triple {24992#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -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:25:38,267 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:25:38,268 INFO L273 TraceCheckUtils]: 52: Hoare triple {24993#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -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:25:38,268 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:25:38,269 INFO L273 TraceCheckUtils]: 54: Hoare triple {24994#(<= main_~i~1 24)} assume !!(~i~1 < 100);assume -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:25:38,270 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:25:38,270 INFO L273 TraceCheckUtils]: 56: Hoare triple {24995#(<= main_~i~1 25)} assume !!(~i~1 < 100);assume -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:25:38,271 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:25:38,271 INFO L273 TraceCheckUtils]: 58: Hoare triple {24996#(<= main_~i~1 26)} assume !!(~i~1 < 100);assume -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:25:38,272 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:25:38,272 INFO L273 TraceCheckUtils]: 60: Hoare triple {24997#(<= main_~i~1 27)} assume !!(~i~1 < 100);assume -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:25:38,273 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:25:38,274 INFO L273 TraceCheckUtils]: 62: Hoare triple {24998#(<= main_~i~1 28)} assume !!(~i~1 < 100);assume -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:25:38,274 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:25:38,275 INFO L273 TraceCheckUtils]: 64: Hoare triple {24999#(<= main_~i~1 29)} assume !!(~i~1 < 100);assume -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:25:38,275 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:25:38,276 INFO L273 TraceCheckUtils]: 66: Hoare triple {25000#(<= main_~i~1 30)} assume !!(~i~1 < 100);assume -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:25:38,277 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:25:38,277 INFO L273 TraceCheckUtils]: 68: Hoare triple {25001#(<= main_~i~1 31)} assume !!(~i~1 < 100);assume -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:25:38,278 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:25:38,278 INFO L273 TraceCheckUtils]: 70: Hoare triple {25002#(<= main_~i~1 32)} assume !(~i~1 < 100); {24969#false} is VALID [2018-11-23 12:25:38,279 INFO L256 TraceCheckUtils]: 71: Hoare triple {24969#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {24969#false} is VALID [2018-11-23 12:25:38,279 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:25:38,279 INFO L273 TraceCheckUtils]: 73: Hoare triple {24969#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:25:38,279 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:25:38,279 INFO L273 TraceCheckUtils]: 75: Hoare triple {24969#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:25:38,279 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:25:38,280 INFO L273 TraceCheckUtils]: 77: Hoare triple {24969#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:25:38,280 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:25:38,280 INFO L273 TraceCheckUtils]: 79: Hoare triple {24969#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:25:38,280 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:25:38,280 INFO L273 TraceCheckUtils]: 81: Hoare triple {24969#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:25:38,280 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:25:38,280 INFO L273 TraceCheckUtils]: 83: Hoare triple {24969#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:25:38,281 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:25:38,281 INFO L273 TraceCheckUtils]: 85: Hoare triple {24969#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:25:38,281 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:25:38,281 INFO L273 TraceCheckUtils]: 87: Hoare triple {24969#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:25:38,281 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:25:38,281 INFO L273 TraceCheckUtils]: 89: Hoare triple {24969#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:25:38,282 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:25:38,282 INFO L273 TraceCheckUtils]: 91: Hoare triple {24969#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:25:38,282 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:25:38,282 INFO L273 TraceCheckUtils]: 93: Hoare triple {24969#false} assume !(~i~0 < 100); {24969#false} is VALID [2018-11-23 12:25:38,282 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:25:38,282 INFO L273 TraceCheckUtils]: 95: Hoare triple {24969#false} assume true; {24969#false} is VALID [2018-11-23 12:25:38,282 INFO L268 TraceCheckUtils]: 96: Hoare quadruple {24969#false} {24969#false} #70#return; {24969#false} is VALID [2018-11-23 12:25:38,283 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:25:38,283 INFO L256 TraceCheckUtils]: 98: Hoare triple {24969#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {24969#false} is VALID [2018-11-23 12:25:38,283 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:25:38,283 INFO L273 TraceCheckUtils]: 100: Hoare triple {24969#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:25:38,283 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:25:38,283 INFO L273 TraceCheckUtils]: 102: Hoare triple {24969#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:25:38,283 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:25:38,283 INFO L273 TraceCheckUtils]: 104: Hoare triple {24969#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:25:38,283 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:25:38,283 INFO L273 TraceCheckUtils]: 106: Hoare triple {24969#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:25:38,284 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:25:38,284 INFO L273 TraceCheckUtils]: 108: Hoare triple {24969#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:25:38,284 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:25:38,284 INFO L273 TraceCheckUtils]: 110: Hoare triple {24969#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:25:38,284 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:25:38,284 INFO L273 TraceCheckUtils]: 112: Hoare triple {24969#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:25:38,284 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:25:38,284 INFO L273 TraceCheckUtils]: 114: Hoare triple {24969#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:25:38,284 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:25:38,284 INFO L273 TraceCheckUtils]: 116: Hoare triple {24969#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:25:38,285 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:25:38,285 INFO L273 TraceCheckUtils]: 118: Hoare triple {24969#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:25:38,285 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:25:38,285 INFO L273 TraceCheckUtils]: 120: Hoare triple {24969#false} assume !(~i~0 < 100); {24969#false} is VALID [2018-11-23 12:25:38,285 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:25:38,285 INFO L273 TraceCheckUtils]: 122: Hoare triple {24969#false} assume true; {24969#false} is VALID [2018-11-23 12:25:38,285 INFO L268 TraceCheckUtils]: 123: Hoare quadruple {24969#false} {24969#false} #72#return; {24969#false} is VALID [2018-11-23 12:25:38,285 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:25:38,285 INFO L273 TraceCheckUtils]: 125: Hoare triple {24969#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:38,285 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:25:38,286 INFO L273 TraceCheckUtils]: 127: Hoare triple {24969#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:38,286 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:25:38,286 INFO L273 TraceCheckUtils]: 129: Hoare triple {24969#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:38,286 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:25:38,286 INFO L273 TraceCheckUtils]: 131: Hoare triple {24969#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:38,286 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:25:38,286 INFO L273 TraceCheckUtils]: 133: Hoare triple {24969#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:38,286 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:25:38,286 INFO L273 TraceCheckUtils]: 135: Hoare triple {24969#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:38,286 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:25:38,287 INFO L273 TraceCheckUtils]: 137: Hoare triple {24969#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:38,287 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:25:38,287 INFO L273 TraceCheckUtils]: 139: Hoare triple {24969#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:38,287 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:25:38,287 INFO L273 TraceCheckUtils]: 141: Hoare triple {24969#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:38,287 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:25:38,287 INFO L273 TraceCheckUtils]: 143: Hoare triple {24969#false} assume !(~i~2 < 99); {24969#false} is VALID [2018-11-23 12:25:38,287 INFO L273 TraceCheckUtils]: 144: Hoare triple {24969#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {24969#false} is VALID [2018-11-23 12:25:38,287 INFO L256 TraceCheckUtils]: 145: Hoare triple {24969#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {24969#false} is VALID [2018-11-23 12:25:38,287 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:25:38,288 INFO L273 TraceCheckUtils]: 147: Hoare triple {24969#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:25:38,288 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:25:38,288 INFO L273 TraceCheckUtils]: 149: Hoare triple {24969#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:25:38,288 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:25:38,288 INFO L273 TraceCheckUtils]: 151: Hoare triple {24969#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:25:38,288 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:25:38,288 INFO L273 TraceCheckUtils]: 153: Hoare triple {24969#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:25:38,288 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:25:38,288 INFO L273 TraceCheckUtils]: 155: Hoare triple {24969#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:25:38,288 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:25:38,289 INFO L273 TraceCheckUtils]: 157: Hoare triple {24969#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:25:38,289 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:25:38,289 INFO L273 TraceCheckUtils]: 159: Hoare triple {24969#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:25:38,289 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:25:38,289 INFO L273 TraceCheckUtils]: 161: Hoare triple {24969#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:25:38,289 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:25:38,289 INFO L273 TraceCheckUtils]: 163: Hoare triple {24969#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:25:38,289 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:25:38,289 INFO L273 TraceCheckUtils]: 165: Hoare triple {24969#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {24969#false} is VALID [2018-11-23 12:25:38,290 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:25:38,290 INFO L273 TraceCheckUtils]: 167: Hoare triple {24969#false} assume !(~i~0 < 100); {24969#false} is VALID [2018-11-23 12:25:38,290 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:25:38,290 INFO L273 TraceCheckUtils]: 169: Hoare triple {24969#false} assume true; {24969#false} is VALID [2018-11-23 12:25:38,290 INFO L268 TraceCheckUtils]: 170: Hoare quadruple {24969#false} {24969#false} #74#return; {24969#false} is VALID [2018-11-23 12:25:38,290 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:25:38,290 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:25:38,290 INFO L273 TraceCheckUtils]: 173: Hoare triple {24969#false} assume !false; {24969#false} is VALID [2018-11-23 12:25:38,304 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:25:38,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:25:38,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2018-11-23 12:25:38,323 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 174 [2018-11-23 12:25:38,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:25:38,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-23 12:25:38,421 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:25:38,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-23 12:25:38,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-23 12:25:38,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 12:25:38,423 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand 36 states. [2018-11-23 12:25:39,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:39,293 INFO L93 Difference]: Finished difference Result 182 states and 190 transitions. [2018-11-23 12:25:39,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 12:25:39,294 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 174 [2018-11-23 12:25:39,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:25:39,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:25:39,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 118 transitions. [2018-11-23 12:25:39,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:25:39,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 118 transitions. [2018-11-23 12:25:39,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 118 transitions. [2018-11-23 12:25:39,402 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:25:39,405 INFO L225 Difference]: With dead ends: 182 [2018-11-23 12:25:39,405 INFO L226 Difference]: Without dead ends: 128 [2018-11-23 12:25:39,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 12:25:39,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-23 12:25:39,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2018-11-23 12:25:39,490 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:25:39,490 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand 127 states. [2018-11-23 12:25:39,490 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 127 states. [2018-11-23 12:25:39,491 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 127 states. [2018-11-23 12:25:39,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:39,493 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2018-11-23 12:25:39,493 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 132 transitions. [2018-11-23 12:25:39,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:25:39,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:25:39,494 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 128 states. [2018-11-23 12:25:39,494 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 128 states. [2018-11-23 12:25:39,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:39,496 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2018-11-23 12:25:39,496 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 132 transitions. [2018-11-23 12:25:39,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:25:39,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:25:39,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:25:39,497 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:25:39,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-23 12:25:39,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 131 transitions. [2018-11-23 12:25:39,499 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 131 transitions. Word has length 174 [2018-11-23 12:25:39,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:25:39,500 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 131 transitions. [2018-11-23 12:25:39,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-23 12:25:39,500 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2018-11-23 12:25:39,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-23 12:25:39,501 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:25:39,501 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:25:39,501 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:25:39,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:25:39,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1186102535, now seen corresponding path program 33 times [2018-11-23 12:25:39,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:25:39,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:25:39,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:25:39,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:25:39,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:25:39,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:25:40,179 INFO L256 TraceCheckUtils]: 0: Hoare triple {26241#true} call ULTIMATE.init(); {26241#true} is VALID [2018-11-23 12:25:40,179 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:25:40,179 INFO L273 TraceCheckUtils]: 2: Hoare triple {26241#true} assume true; {26241#true} is VALID [2018-11-23 12:25:40,179 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26241#true} {26241#true} #66#return; {26241#true} is VALID [2018-11-23 12:25:40,179 INFO L256 TraceCheckUtils]: 4: Hoare triple {26241#true} call #t~ret13 := main(); {26241#true} is VALID [2018-11-23 12:25:40,180 INFO L273 TraceCheckUtils]: 5: Hoare triple {26241#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:25:40,180 INFO L273 TraceCheckUtils]: 6: Hoare triple {26243#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:25:40,181 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:25:40,181 INFO L273 TraceCheckUtils]: 8: Hoare triple {26244#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:25:40,182 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:25:40,182 INFO L273 TraceCheckUtils]: 10: Hoare triple {26245#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:25:40,183 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:25:40,183 INFO L273 TraceCheckUtils]: 12: Hoare triple {26246#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -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:25:40,184 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:25:40,184 INFO L273 TraceCheckUtils]: 14: Hoare triple {26247#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -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:25:40,185 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:25:40,185 INFO L273 TraceCheckUtils]: 16: Hoare triple {26248#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -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:25:40,186 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:25:40,187 INFO L273 TraceCheckUtils]: 18: Hoare triple {26249#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -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:25:40,187 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:25:40,188 INFO L273 TraceCheckUtils]: 20: Hoare triple {26250#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -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:25:40,188 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:25:40,189 INFO L273 TraceCheckUtils]: 22: Hoare triple {26251#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -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:25:40,190 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:25:40,190 INFO L273 TraceCheckUtils]: 24: Hoare triple {26252#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -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:25:40,191 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:25:40,191 INFO L273 TraceCheckUtils]: 26: Hoare triple {26253#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -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:25:40,192 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:25:40,192 INFO L273 TraceCheckUtils]: 28: Hoare triple {26254#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -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:25:40,193 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:25:40,195 INFO L273 TraceCheckUtils]: 30: Hoare triple {26255#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -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:25:40,196 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:25:40,196 INFO L273 TraceCheckUtils]: 32: Hoare triple {26256#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -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:25:40,198 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:25:40,201 INFO L273 TraceCheckUtils]: 34: Hoare triple {26257#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -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:25:40,204 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:25:40,206 INFO L273 TraceCheckUtils]: 36: Hoare triple {26258#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -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:25:40,207 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:25:40,208 INFO L273 TraceCheckUtils]: 38: Hoare triple {26259#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -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:25:40,209 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:25:40,210 INFO L273 TraceCheckUtils]: 40: Hoare triple {26260#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -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:25:40,211 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:25:40,212 INFO L273 TraceCheckUtils]: 42: Hoare triple {26261#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -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:25:40,213 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:25:40,214 INFO L273 TraceCheckUtils]: 44: Hoare triple {26262#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -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:25:40,214 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:25:40,216 INFO L273 TraceCheckUtils]: 46: Hoare triple {26263#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -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:25:40,218 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:25:40,218 INFO L273 TraceCheckUtils]: 48: Hoare triple {26264#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -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:25:40,220 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:25:40,223 INFO L273 TraceCheckUtils]: 50: Hoare triple {26265#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -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:25:40,225 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:25:40,225 INFO L273 TraceCheckUtils]: 52: Hoare triple {26266#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -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:25:40,227 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:25:40,227 INFO L273 TraceCheckUtils]: 54: Hoare triple {26267#(<= main_~i~1 24)} assume !!(~i~1 < 100);assume -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:25:40,229 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:25:40,229 INFO L273 TraceCheckUtils]: 56: Hoare triple {26268#(<= main_~i~1 25)} assume !!(~i~1 < 100);assume -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:25:40,231 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:25:40,231 INFO L273 TraceCheckUtils]: 58: Hoare triple {26269#(<= main_~i~1 26)} assume !!(~i~1 < 100);assume -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:25:40,231 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:25:40,232 INFO L273 TraceCheckUtils]: 60: Hoare triple {26270#(<= main_~i~1 27)} assume !!(~i~1 < 100);assume -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:25:40,234 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:25:40,234 INFO L273 TraceCheckUtils]: 62: Hoare triple {26271#(<= main_~i~1 28)} assume !!(~i~1 < 100);assume -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:25:40,236 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:25:40,236 INFO L273 TraceCheckUtils]: 64: Hoare triple {26272#(<= main_~i~1 29)} assume !!(~i~1 < 100);assume -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:25:40,238 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:25:40,238 INFO L273 TraceCheckUtils]: 66: Hoare triple {26273#(<= main_~i~1 30)} assume !!(~i~1 < 100);assume -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:25:40,240 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:25:40,240 INFO L273 TraceCheckUtils]: 68: Hoare triple {26274#(<= main_~i~1 31)} assume !!(~i~1 < 100);assume -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:25:40,242 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:25:40,242 INFO L273 TraceCheckUtils]: 70: Hoare triple {26275#(<= main_~i~1 32)} assume !!(~i~1 < 100);assume -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:25:40,244 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:25:40,244 INFO L273 TraceCheckUtils]: 72: Hoare triple {26276#(<= main_~i~1 33)} assume !(~i~1 < 100); {26242#false} is VALID [2018-11-23 12:25:40,244 INFO L256 TraceCheckUtils]: 73: Hoare triple {26242#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {26241#true} is VALID [2018-11-23 12:25:40,244 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:25:40,244 INFO L273 TraceCheckUtils]: 75: Hoare triple {26241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:25:40,244 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:25:40,245 INFO L273 TraceCheckUtils]: 77: Hoare triple {26241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:25:40,245 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:25:40,245 INFO L273 TraceCheckUtils]: 79: Hoare triple {26241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:25:40,245 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:25:40,245 INFO L273 TraceCheckUtils]: 81: Hoare triple {26241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:25:40,245 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:25:40,245 INFO L273 TraceCheckUtils]: 83: Hoare triple {26241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:25:40,245 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:25:40,245 INFO L273 TraceCheckUtils]: 85: Hoare triple {26241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:25:40,245 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:25:40,246 INFO L273 TraceCheckUtils]: 87: Hoare triple {26241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:25:40,246 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:25:40,246 INFO L273 TraceCheckUtils]: 89: Hoare triple {26241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:25:40,246 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:25:40,246 INFO L273 TraceCheckUtils]: 91: Hoare triple {26241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:25:40,246 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:25:40,246 INFO L273 TraceCheckUtils]: 93: Hoare triple {26241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:25:40,246 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:25:40,246 INFO L273 TraceCheckUtils]: 95: Hoare triple {26241#true} assume !(~i~0 < 100); {26241#true} is VALID [2018-11-23 12:25:40,246 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:25:40,247 INFO L273 TraceCheckUtils]: 97: Hoare triple {26241#true} assume true; {26241#true} is VALID [2018-11-23 12:25:40,247 INFO L268 TraceCheckUtils]: 98: Hoare quadruple {26241#true} {26242#false} #70#return; {26242#false} is VALID [2018-11-23 12:25:40,247 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:25:40,247 INFO L256 TraceCheckUtils]: 100: Hoare triple {26242#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {26241#true} is VALID [2018-11-23 12:25:40,247 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:25:40,247 INFO L273 TraceCheckUtils]: 102: Hoare triple {26241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:25:40,247 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:25:40,247 INFO L273 TraceCheckUtils]: 104: Hoare triple {26241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:25:40,247 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:25:40,248 INFO L273 TraceCheckUtils]: 106: Hoare triple {26241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:25:40,248 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:25:40,248 INFO L273 TraceCheckUtils]: 108: Hoare triple {26241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:25:40,248 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:25:40,248 INFO L273 TraceCheckUtils]: 110: Hoare triple {26241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:25:40,248 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:25:40,248 INFO L273 TraceCheckUtils]: 112: Hoare triple {26241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:25:40,248 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:25:40,248 INFO L273 TraceCheckUtils]: 114: Hoare triple {26241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:25:40,248 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:25:40,249 INFO L273 TraceCheckUtils]: 116: Hoare triple {26241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:25:40,249 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:25:40,249 INFO L273 TraceCheckUtils]: 118: Hoare triple {26241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:25:40,249 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:25:40,249 INFO L273 TraceCheckUtils]: 120: Hoare triple {26241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:25:40,249 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:25:40,249 INFO L273 TraceCheckUtils]: 122: Hoare triple {26241#true} assume !(~i~0 < 100); {26241#true} is VALID [2018-11-23 12:25:40,249 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:25:40,249 INFO L273 TraceCheckUtils]: 124: Hoare triple {26241#true} assume true; {26241#true} is VALID [2018-11-23 12:25:40,249 INFO L268 TraceCheckUtils]: 125: Hoare quadruple {26241#true} {26242#false} #72#return; {26242#false} is VALID [2018-11-23 12:25:40,250 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:25:40,250 INFO L273 TraceCheckUtils]: 127: Hoare triple {26242#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:40,250 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:25:40,250 INFO L273 TraceCheckUtils]: 129: Hoare triple {26242#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:40,250 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:25:40,250 INFO L273 TraceCheckUtils]: 131: Hoare triple {26242#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:40,250 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:25:40,250 INFO L273 TraceCheckUtils]: 133: Hoare triple {26242#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:40,250 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:25:40,250 INFO L273 TraceCheckUtils]: 135: Hoare triple {26242#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:40,251 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:25:40,251 INFO L273 TraceCheckUtils]: 137: Hoare triple {26242#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:40,251 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:25:40,251 INFO L273 TraceCheckUtils]: 139: Hoare triple {26242#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:40,251 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:25:40,251 INFO L273 TraceCheckUtils]: 141: Hoare triple {26242#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:40,251 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:25:40,251 INFO L273 TraceCheckUtils]: 143: Hoare triple {26242#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:40,251 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:25:40,251 INFO L273 TraceCheckUtils]: 145: Hoare triple {26242#false} assume !(~i~2 < 99); {26242#false} is VALID [2018-11-23 12:25:40,252 INFO L273 TraceCheckUtils]: 146: Hoare triple {26242#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {26242#false} is VALID [2018-11-23 12:25:40,252 INFO L256 TraceCheckUtils]: 147: Hoare triple {26242#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {26241#true} is VALID [2018-11-23 12:25:40,252 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:25:40,252 INFO L273 TraceCheckUtils]: 149: Hoare triple {26241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:25:40,252 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:25:40,252 INFO L273 TraceCheckUtils]: 151: Hoare triple {26241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:25:40,252 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:25:40,252 INFO L273 TraceCheckUtils]: 153: Hoare triple {26241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:25:40,252 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:25:40,252 INFO L273 TraceCheckUtils]: 155: Hoare triple {26241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:25:40,253 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:25:40,253 INFO L273 TraceCheckUtils]: 157: Hoare triple {26241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:25:40,253 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:25:40,253 INFO L273 TraceCheckUtils]: 159: Hoare triple {26241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:25:40,253 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:25:40,253 INFO L273 TraceCheckUtils]: 161: Hoare triple {26241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:25:40,253 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:25:40,253 INFO L273 TraceCheckUtils]: 163: Hoare triple {26241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:25:40,253 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:25:40,253 INFO L273 TraceCheckUtils]: 165: Hoare triple {26241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:25:40,254 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:25:40,254 INFO L273 TraceCheckUtils]: 167: Hoare triple {26241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:25:40,254 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:25:40,254 INFO L273 TraceCheckUtils]: 169: Hoare triple {26241#true} assume !(~i~0 < 100); {26241#true} is VALID [2018-11-23 12:25:40,254 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:25:40,254 INFO L273 TraceCheckUtils]: 171: Hoare triple {26241#true} assume true; {26241#true} is VALID [2018-11-23 12:25:40,254 INFO L268 TraceCheckUtils]: 172: Hoare quadruple {26241#true} {26242#false} #74#return; {26242#false} is VALID [2018-11-23 12:25:40,254 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:25:40,254 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:25:40,254 INFO L273 TraceCheckUtils]: 175: Hoare triple {26242#false} assume !false; {26242#false} is VALID [2018-11-23 12:25:40,269 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:25:40,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:25:40,269 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:25:40,277 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:25:40,686 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-23 12:25:40,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:25:40,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:25:40,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:25:41,204 INFO L256 TraceCheckUtils]: 0: Hoare triple {26241#true} call ULTIMATE.init(); {26241#true} is VALID [2018-11-23 12:25:41,204 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:25:41,205 INFO L273 TraceCheckUtils]: 2: Hoare triple {26241#true} assume true; {26241#true} is VALID [2018-11-23 12:25:41,205 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26241#true} {26241#true} #66#return; {26241#true} is VALID [2018-11-23 12:25:41,205 INFO L256 TraceCheckUtils]: 4: Hoare triple {26241#true} call #t~ret13 := main(); {26241#true} is VALID [2018-11-23 12:25:41,205 INFO L273 TraceCheckUtils]: 5: Hoare triple {26241#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {26241#true} is VALID [2018-11-23 12:25:41,205 INFO L273 TraceCheckUtils]: 6: Hoare triple {26241#true} assume !!(~i~1 < 100);assume -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:25:41,206 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:25:41,206 INFO L273 TraceCheckUtils]: 8: Hoare triple {26241#true} assume !!(~i~1 < 100);assume -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:25:41,206 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:25:41,206 INFO L273 TraceCheckUtils]: 10: Hoare triple {26241#true} assume !!(~i~1 < 100);assume -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:25:41,206 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:25:41,206 INFO L273 TraceCheckUtils]: 12: Hoare triple {26241#true} assume !!(~i~1 < 100);assume -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:25:41,206 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:25:41,207 INFO L273 TraceCheckUtils]: 14: Hoare triple {26241#true} assume !!(~i~1 < 100);assume -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:25:41,207 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:25:41,207 INFO L273 TraceCheckUtils]: 16: Hoare triple {26241#true} assume !!(~i~1 < 100);assume -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:25:41,207 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:25:41,207 INFO L273 TraceCheckUtils]: 18: Hoare triple {26241#true} assume !!(~i~1 < 100);assume -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:25:41,207 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:25:41,208 INFO L273 TraceCheckUtils]: 20: Hoare triple {26241#true} assume !!(~i~1 < 100);assume -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:25:41,208 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:25:41,208 INFO L273 TraceCheckUtils]: 22: Hoare triple {26241#true} assume !!(~i~1 < 100);assume -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:25:41,208 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:25:41,208 INFO L273 TraceCheckUtils]: 24: Hoare triple {26241#true} assume !!(~i~1 < 100);assume -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:25:41,208 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:25:41,209 INFO L273 TraceCheckUtils]: 26: Hoare triple {26241#true} assume !!(~i~1 < 100);assume -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:25:41,209 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:25:41,209 INFO L273 TraceCheckUtils]: 28: Hoare triple {26241#true} assume !!(~i~1 < 100);assume -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:25:41,209 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:25:41,209 INFO L273 TraceCheckUtils]: 30: Hoare triple {26241#true} assume !!(~i~1 < 100);assume -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:25:41,209 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:25:41,209 INFO L273 TraceCheckUtils]: 32: Hoare triple {26241#true} assume !!(~i~1 < 100);assume -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:25:41,209 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:25:41,209 INFO L273 TraceCheckUtils]: 34: Hoare triple {26241#true} assume !!(~i~1 < 100);assume -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:25:41,210 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:25:41,210 INFO L273 TraceCheckUtils]: 36: Hoare triple {26241#true} assume !!(~i~1 < 100);assume -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:25:41,210 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:25:41,210 INFO L273 TraceCheckUtils]: 38: Hoare triple {26241#true} assume !!(~i~1 < 100);assume -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:25:41,210 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:25:41,210 INFO L273 TraceCheckUtils]: 40: Hoare triple {26241#true} assume !!(~i~1 < 100);assume -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:25:41,210 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:25:41,210 INFO L273 TraceCheckUtils]: 42: Hoare triple {26241#true} assume !!(~i~1 < 100);assume -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:25:41,210 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:25:41,210 INFO L273 TraceCheckUtils]: 44: Hoare triple {26241#true} assume !!(~i~1 < 100);assume -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:25:41,211 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:25:41,211 INFO L273 TraceCheckUtils]: 46: Hoare triple {26241#true} assume !!(~i~1 < 100);assume -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:25:41,211 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:25:41,211 INFO L273 TraceCheckUtils]: 48: Hoare triple {26241#true} assume !!(~i~1 < 100);assume -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:25:41,211 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:25:41,211 INFO L273 TraceCheckUtils]: 50: Hoare triple {26241#true} assume !!(~i~1 < 100);assume -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:25:41,211 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:25:41,211 INFO L273 TraceCheckUtils]: 52: Hoare triple {26241#true} assume !!(~i~1 < 100);assume -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:25:41,211 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:25:41,212 INFO L273 TraceCheckUtils]: 54: Hoare triple {26241#true} assume !!(~i~1 < 100);assume -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:25:41,212 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:25:41,212 INFO L273 TraceCheckUtils]: 56: Hoare triple {26241#true} assume !!(~i~1 < 100);assume -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:25:41,212 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:25:41,212 INFO L273 TraceCheckUtils]: 58: Hoare triple {26241#true} assume !!(~i~1 < 100);assume -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:25:41,212 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:25:41,212 INFO L273 TraceCheckUtils]: 60: Hoare triple {26241#true} assume !!(~i~1 < 100);assume -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:25:41,212 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:25:41,212 INFO L273 TraceCheckUtils]: 62: Hoare triple {26241#true} assume !!(~i~1 < 100);assume -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:25:41,212 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:25:41,213 INFO L273 TraceCheckUtils]: 64: Hoare triple {26241#true} assume !!(~i~1 < 100);assume -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:25:41,213 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:25:41,213 INFO L273 TraceCheckUtils]: 66: Hoare triple {26241#true} assume !!(~i~1 < 100);assume -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:25:41,213 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:25:41,213 INFO L273 TraceCheckUtils]: 68: Hoare triple {26241#true} assume !!(~i~1 < 100);assume -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:25:41,213 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:25:41,213 INFO L273 TraceCheckUtils]: 70: Hoare triple {26241#true} assume !!(~i~1 < 100);assume -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:25:41,213 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:25:41,213 INFO L273 TraceCheckUtils]: 72: Hoare triple {26241#true} assume !(~i~1 < 100); {26241#true} is VALID [2018-11-23 12:25:41,213 INFO L256 TraceCheckUtils]: 73: Hoare triple {26241#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {26241#true} is VALID [2018-11-23 12:25:41,214 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:25:41,214 INFO L273 TraceCheckUtils]: 75: Hoare triple {26241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:25:41,214 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:25:41,214 INFO L273 TraceCheckUtils]: 77: Hoare triple {26241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:25:41,214 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:25:41,214 INFO L273 TraceCheckUtils]: 79: Hoare triple {26241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:25:41,214 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:25:41,214 INFO L273 TraceCheckUtils]: 81: Hoare triple {26241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:25:41,214 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:25:41,214 INFO L273 TraceCheckUtils]: 83: Hoare triple {26241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:25:41,215 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:25:41,215 INFO L273 TraceCheckUtils]: 85: Hoare triple {26241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:25:41,215 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:25:41,215 INFO L273 TraceCheckUtils]: 87: Hoare triple {26241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:25:41,215 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:25:41,215 INFO L273 TraceCheckUtils]: 89: Hoare triple {26241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:25:41,215 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:25:41,215 INFO L273 TraceCheckUtils]: 91: Hoare triple {26241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:25:41,215 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:25:41,215 INFO L273 TraceCheckUtils]: 93: Hoare triple {26241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:25:41,216 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:25:41,216 INFO L273 TraceCheckUtils]: 95: Hoare triple {26241#true} assume !(~i~0 < 100); {26241#true} is VALID [2018-11-23 12:25:41,216 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:25:41,216 INFO L273 TraceCheckUtils]: 97: Hoare triple {26241#true} assume true; {26241#true} is VALID [2018-11-23 12:25:41,216 INFO L268 TraceCheckUtils]: 98: Hoare quadruple {26241#true} {26241#true} #70#return; {26241#true} is VALID [2018-11-23 12:25:41,216 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:25:41,216 INFO L256 TraceCheckUtils]: 100: Hoare triple {26241#true} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {26241#true} is VALID [2018-11-23 12:25:41,216 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:25:41,216 INFO L273 TraceCheckUtils]: 102: Hoare triple {26241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:25:41,216 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:25:41,217 INFO L273 TraceCheckUtils]: 104: Hoare triple {26241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:25:41,217 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:25:41,217 INFO L273 TraceCheckUtils]: 106: Hoare triple {26241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:25:41,217 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:25:41,217 INFO L273 TraceCheckUtils]: 108: Hoare triple {26241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:25:41,217 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:25:41,217 INFO L273 TraceCheckUtils]: 110: Hoare triple {26241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:25:41,217 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:25:41,217 INFO L273 TraceCheckUtils]: 112: Hoare triple {26241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:25:41,217 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:25:41,218 INFO L273 TraceCheckUtils]: 114: Hoare triple {26241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:25:41,218 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:25:41,218 INFO L273 TraceCheckUtils]: 116: Hoare triple {26241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:25:41,218 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:25:41,218 INFO L273 TraceCheckUtils]: 118: Hoare triple {26241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:25:41,218 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:25:41,218 INFO L273 TraceCheckUtils]: 120: Hoare triple {26241#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26241#true} is VALID [2018-11-23 12:25:41,218 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:25:41,218 INFO L273 TraceCheckUtils]: 122: Hoare triple {26241#true} assume !(~i~0 < 100); {26241#true} is VALID [2018-11-23 12:25:41,218 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:25:41,218 INFO L273 TraceCheckUtils]: 124: Hoare triple {26241#true} assume true; {26241#true} is VALID [2018-11-23 12:25:41,219 INFO L268 TraceCheckUtils]: 125: Hoare quadruple {26241#true} {26241#true} #72#return; {26241#true} is VALID [2018-11-23 12:25:41,219 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:25:41,219 INFO L273 TraceCheckUtils]: 127: Hoare triple {26658#(<= main_~i~2 0)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:41,220 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:25:41,220 INFO L273 TraceCheckUtils]: 129: Hoare triple {26665#(<= main_~i~2 1)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:41,221 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:25:41,221 INFO L273 TraceCheckUtils]: 131: Hoare triple {26672#(<= main_~i~2 2)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:41,221 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:25:41,222 INFO L273 TraceCheckUtils]: 133: Hoare triple {26679#(<= main_~i~2 3)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:41,222 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:25:41,223 INFO L273 TraceCheckUtils]: 135: Hoare triple {26686#(<= main_~i~2 4)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:41,223 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:25:41,224 INFO L273 TraceCheckUtils]: 137: Hoare triple {26693#(<= main_~i~2 5)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:41,224 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:25:41,225 INFO L273 TraceCheckUtils]: 139: Hoare triple {26700#(<= main_~i~2 6)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:41,226 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:25:41,226 INFO L273 TraceCheckUtils]: 141: Hoare triple {26707#(<= main_~i~2 7)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:41,227 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:25:41,227 INFO L273 TraceCheckUtils]: 143: Hoare triple {26714#(<= main_~i~2 8)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:41,228 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:25:41,229 INFO L273 TraceCheckUtils]: 145: Hoare triple {26721#(<= main_~i~2 9)} assume !(~i~2 < 99); {26242#false} is VALID [2018-11-23 12:25:41,229 INFO L273 TraceCheckUtils]: 146: Hoare triple {26242#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {26242#false} is VALID [2018-11-23 12:25:41,229 INFO L256 TraceCheckUtils]: 147: Hoare triple {26242#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {26242#false} is VALID [2018-11-23 12:25:41,229 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:25:41,229 INFO L273 TraceCheckUtils]: 149: Hoare triple {26242#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26242#false} is VALID [2018-11-23 12:25:41,229 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:25:41,230 INFO L273 TraceCheckUtils]: 151: Hoare triple {26242#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26242#false} is VALID [2018-11-23 12:25:41,230 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:25:41,230 INFO L273 TraceCheckUtils]: 153: Hoare triple {26242#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26242#false} is VALID [2018-11-23 12:25:41,230 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:25:41,230 INFO L273 TraceCheckUtils]: 155: Hoare triple {26242#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26242#false} is VALID [2018-11-23 12:25:41,230 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:25:41,230 INFO L273 TraceCheckUtils]: 157: Hoare triple {26242#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26242#false} is VALID [2018-11-23 12:25:41,231 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:25:41,231 INFO L273 TraceCheckUtils]: 159: Hoare triple {26242#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26242#false} is VALID [2018-11-23 12:25:41,231 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:25:41,231 INFO L273 TraceCheckUtils]: 161: Hoare triple {26242#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26242#false} is VALID [2018-11-23 12:25:41,231 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:25:41,231 INFO L273 TraceCheckUtils]: 163: Hoare triple {26242#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26242#false} is VALID [2018-11-23 12:25:41,232 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:25:41,232 INFO L273 TraceCheckUtils]: 165: Hoare triple {26242#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26242#false} is VALID [2018-11-23 12:25:41,232 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:25:41,232 INFO L273 TraceCheckUtils]: 167: Hoare triple {26242#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {26242#false} is VALID [2018-11-23 12:25:41,232 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:25:41,232 INFO L273 TraceCheckUtils]: 169: Hoare triple {26242#false} assume !(~i~0 < 100); {26242#false} is VALID [2018-11-23 12:25:41,232 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:25:41,232 INFO L273 TraceCheckUtils]: 171: Hoare triple {26242#false} assume true; {26242#false} is VALID [2018-11-23 12:25:41,233 INFO L268 TraceCheckUtils]: 172: Hoare quadruple {26242#false} {26242#false} #74#return; {26242#false} is VALID [2018-11-23 12:25:41,233 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:25:41,233 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:25:41,233 INFO L273 TraceCheckUtils]: 175: Hoare triple {26242#false} assume !false; {26242#false} is VALID [2018-11-23 12:25:41,245 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:25:41,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:25:41,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 12] total 46 [2018-11-23 12:25:41,265 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 176 [2018-11-23 12:25:41,266 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:25:41,266 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states. [2018-11-23 12:25:41,390 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:25:41,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-23 12:25:41,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-23 12:25:41,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=695, Invalid=1375, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 12:25:41,392 INFO L87 Difference]: Start difference. First operand 127 states and 131 transitions. Second operand 46 states. [2018-11-23 12:25:42,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:42,528 INFO L93 Difference]: Finished difference Result 187 states and 196 transitions. [2018-11-23 12:25:42,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-23 12:25:42,529 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 176 [2018-11-23 12:25:42,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:25:42,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:25:42,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 141 transitions. [2018-11-23 12:25:42,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:25:42,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 141 transitions. [2018-11-23 12:25:42,531 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states and 141 transitions. [2018-11-23 12:25:42,658 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:25:42,661 INFO L225 Difference]: With dead ends: 187 [2018-11-23 12:25:42,661 INFO L226 Difference]: Without dead ends: 133 [2018-11-23 12:25:42,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=695, Invalid=1375, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 12:25:42,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-23 12:25:42,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-11-23 12:25:42,974 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:25:42,975 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand 131 states. [2018-11-23 12:25:42,975 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 131 states. [2018-11-23 12:25:42,975 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 131 states. [2018-11-23 12:25:42,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:42,977 INFO L93 Difference]: Finished difference Result 133 states and 137 transitions. [2018-11-23 12:25:42,977 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2018-11-23 12:25:42,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:25:42,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:25:42,978 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand 133 states. [2018-11-23 12:25:42,978 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 133 states. [2018-11-23 12:25:42,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:42,980 INFO L93 Difference]: Finished difference Result 133 states and 137 transitions. [2018-11-23 12:25:42,980 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2018-11-23 12:25:42,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:25:42,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:25:42,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:25:42,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:25:42,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-23 12:25:42,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 135 transitions. [2018-11-23 12:25:42,982 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 135 transitions. Word has length 176 [2018-11-23 12:25:42,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:25:42,982 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 135 transitions. [2018-11-23 12:25:42,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-23 12:25:42,982 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2018-11-23 12:25:42,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-23 12:25:42,983 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:25:42,983 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:25:42,983 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:25:42,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:25:42,984 INFO L82 PathProgramCache]: Analyzing trace with hash 854412647, now seen corresponding path program 34 times [2018-11-23 12:25:42,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:25:42,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:25:42,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:25:42,985 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:25:42,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:25:43,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:25:43,909 INFO L256 TraceCheckUtils]: 0: Hoare triple {27553#true} call ULTIMATE.init(); {27553#true} is VALID [2018-11-23 12:25:43,910 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:25:43,910 INFO L273 TraceCheckUtils]: 2: Hoare triple {27553#true} assume true; {27553#true} is VALID [2018-11-23 12:25:43,910 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27553#true} {27553#true} #66#return; {27553#true} is VALID [2018-11-23 12:25:43,910 INFO L256 TraceCheckUtils]: 4: Hoare triple {27553#true} call #t~ret13 := main(); {27553#true} is VALID [2018-11-23 12:25:43,910 INFO L273 TraceCheckUtils]: 5: Hoare triple {27553#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:25:43,910 INFO L273 TraceCheckUtils]: 6: Hoare triple {27555#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:25:43,911 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:25:43,911 INFO L273 TraceCheckUtils]: 8: Hoare triple {27556#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:25:43,912 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:25:43,913 INFO L273 TraceCheckUtils]: 10: Hoare triple {27557#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:25:43,913 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:25:43,914 INFO L273 TraceCheckUtils]: 12: Hoare triple {27558#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -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:25:43,914 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:25:43,915 INFO L273 TraceCheckUtils]: 14: Hoare triple {27559#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -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:25:43,916 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:25:43,916 INFO L273 TraceCheckUtils]: 16: Hoare triple {27560#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -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:25:43,917 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:25:43,917 INFO L273 TraceCheckUtils]: 18: Hoare triple {27561#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -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:25:43,918 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:25:43,918 INFO L273 TraceCheckUtils]: 20: Hoare triple {27562#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -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:25:43,919 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:25:43,919 INFO L273 TraceCheckUtils]: 22: Hoare triple {27563#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -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:25:43,920 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:25:43,921 INFO L273 TraceCheckUtils]: 24: Hoare triple {27564#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -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:25:43,921 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:25:43,922 INFO L273 TraceCheckUtils]: 26: Hoare triple {27565#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -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:25:43,922 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:25:43,923 INFO L273 TraceCheckUtils]: 28: Hoare triple {27566#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -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:25:43,924 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:25:43,924 INFO L273 TraceCheckUtils]: 30: Hoare triple {27567#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -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:25:43,925 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:25:43,925 INFO L273 TraceCheckUtils]: 32: Hoare triple {27568#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -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:25:43,926 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:25:43,926 INFO L273 TraceCheckUtils]: 34: Hoare triple {27569#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -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:25:43,927 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:25:43,927 INFO L273 TraceCheckUtils]: 36: Hoare triple {27570#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -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:25:43,928 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:25:43,929 INFO L273 TraceCheckUtils]: 38: Hoare triple {27571#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -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:25:43,929 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:25:43,930 INFO L273 TraceCheckUtils]: 40: Hoare triple {27572#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -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:25:43,930 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:25:43,931 INFO L273 TraceCheckUtils]: 42: Hoare triple {27573#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -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:25:43,932 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:25:43,932 INFO L273 TraceCheckUtils]: 44: Hoare triple {27574#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -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:25:43,933 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:25:43,933 INFO L273 TraceCheckUtils]: 46: Hoare triple {27575#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -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:25:43,934 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:25:43,934 INFO L273 TraceCheckUtils]: 48: Hoare triple {27576#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -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:25:43,935 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:25:43,935 INFO L273 TraceCheckUtils]: 50: Hoare triple {27577#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -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:25:43,936 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:25:43,937 INFO L273 TraceCheckUtils]: 52: Hoare triple {27578#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -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:25:43,937 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:25:43,938 INFO L273 TraceCheckUtils]: 54: Hoare triple {27579#(<= main_~i~1 24)} assume !!(~i~1 < 100);assume -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:25:43,938 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:25:43,939 INFO L273 TraceCheckUtils]: 56: Hoare triple {27580#(<= main_~i~1 25)} assume !!(~i~1 < 100);assume -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:25:43,940 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:25:43,940 INFO L273 TraceCheckUtils]: 58: Hoare triple {27581#(<= main_~i~1 26)} assume !!(~i~1 < 100);assume -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:25:43,941 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:25:43,941 INFO L273 TraceCheckUtils]: 60: Hoare triple {27582#(<= main_~i~1 27)} assume !!(~i~1 < 100);assume -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:25:43,942 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:25:43,942 INFO L273 TraceCheckUtils]: 62: Hoare triple {27583#(<= main_~i~1 28)} assume !!(~i~1 < 100);assume -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:25:43,943 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:25:43,944 INFO L273 TraceCheckUtils]: 64: Hoare triple {27584#(<= main_~i~1 29)} assume !!(~i~1 < 100);assume -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:25:43,944 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:25:43,945 INFO L273 TraceCheckUtils]: 66: Hoare triple {27585#(<= main_~i~1 30)} assume !!(~i~1 < 100);assume -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:25:43,945 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:25:43,946 INFO L273 TraceCheckUtils]: 68: Hoare triple {27586#(<= main_~i~1 31)} assume !!(~i~1 < 100);assume -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:25:43,947 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:25:43,947 INFO L273 TraceCheckUtils]: 70: Hoare triple {27587#(<= main_~i~1 32)} assume !!(~i~1 < 100);assume -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:25:43,948 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:25:43,948 INFO L273 TraceCheckUtils]: 72: Hoare triple {27588#(<= main_~i~1 33)} assume !!(~i~1 < 100);assume -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:25:43,949 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:25:43,949 INFO L273 TraceCheckUtils]: 74: Hoare triple {27589#(<= main_~i~1 34)} assume !(~i~1 < 100); {27554#false} is VALID [2018-11-23 12:25:43,950 INFO L256 TraceCheckUtils]: 75: Hoare triple {27554#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {27553#true} is VALID [2018-11-23 12:25:43,950 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:25:43,950 INFO L273 TraceCheckUtils]: 77: Hoare triple {27553#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:25:43,950 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:25:43,950 INFO L273 TraceCheckUtils]: 79: Hoare triple {27553#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:25:43,950 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:25:43,951 INFO L273 TraceCheckUtils]: 81: Hoare triple {27553#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:25:43,951 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:25:43,951 INFO L273 TraceCheckUtils]: 83: Hoare triple {27553#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:25:43,951 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:25:43,951 INFO L273 TraceCheckUtils]: 85: Hoare triple {27553#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:25:43,951 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:25:43,952 INFO L273 TraceCheckUtils]: 87: Hoare triple {27553#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:25:43,952 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:25:43,952 INFO L273 TraceCheckUtils]: 89: Hoare triple {27553#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:25:43,952 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:25:43,952 INFO L273 TraceCheckUtils]: 91: Hoare triple {27553#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:25:43,952 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:25:43,953 INFO L273 TraceCheckUtils]: 93: Hoare triple {27553#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:25:43,953 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:25:43,953 INFO L273 TraceCheckUtils]: 95: Hoare triple {27553#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:25:43,953 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:25:43,953 INFO L273 TraceCheckUtils]: 97: Hoare triple {27553#true} assume !(~i~0 < 100); {27553#true} is VALID [2018-11-23 12:25:43,953 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:25:43,954 INFO L273 TraceCheckUtils]: 99: Hoare triple {27553#true} assume true; {27553#true} is VALID [2018-11-23 12:25:43,954 INFO L268 TraceCheckUtils]: 100: Hoare quadruple {27553#true} {27554#false} #70#return; {27554#false} is VALID [2018-11-23 12:25:43,954 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:25:43,954 INFO L256 TraceCheckUtils]: 102: Hoare triple {27554#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {27553#true} is VALID [2018-11-23 12:25:43,954 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:25:43,954 INFO L273 TraceCheckUtils]: 104: Hoare triple {27553#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:25:43,955 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:25:43,955 INFO L273 TraceCheckUtils]: 106: Hoare triple {27553#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:25:43,955 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:25:43,955 INFO L273 TraceCheckUtils]: 108: Hoare triple {27553#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:25:43,955 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:25:43,955 INFO L273 TraceCheckUtils]: 110: Hoare triple {27553#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:25:43,955 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:25:43,955 INFO L273 TraceCheckUtils]: 112: Hoare triple {27553#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:25:43,956 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:25:43,956 INFO L273 TraceCheckUtils]: 114: Hoare triple {27553#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:25:43,956 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:25:43,956 INFO L273 TraceCheckUtils]: 116: Hoare triple {27553#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:25:43,956 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:25:43,956 INFO L273 TraceCheckUtils]: 118: Hoare triple {27553#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:25:43,956 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:25:43,956 INFO L273 TraceCheckUtils]: 120: Hoare triple {27553#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:25:43,956 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:25:43,956 INFO L273 TraceCheckUtils]: 122: Hoare triple {27553#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:25:43,957 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:25:43,957 INFO L273 TraceCheckUtils]: 124: Hoare triple {27553#true} assume !(~i~0 < 100); {27553#true} is VALID [2018-11-23 12:25:43,957 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:25:43,957 INFO L273 TraceCheckUtils]: 126: Hoare triple {27553#true} assume true; {27553#true} is VALID [2018-11-23 12:25:43,957 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {27553#true} {27554#false} #72#return; {27554#false} is VALID [2018-11-23 12:25:43,957 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:25:43,957 INFO L273 TraceCheckUtils]: 129: Hoare triple {27554#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:43,957 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:25:43,957 INFO L273 TraceCheckUtils]: 131: Hoare triple {27554#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:43,957 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:25:43,958 INFO L273 TraceCheckUtils]: 133: Hoare triple {27554#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:43,958 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:25:43,958 INFO L273 TraceCheckUtils]: 135: Hoare triple {27554#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:43,958 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:25:43,958 INFO L273 TraceCheckUtils]: 137: Hoare triple {27554#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:43,958 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:25:43,958 INFO L273 TraceCheckUtils]: 139: Hoare triple {27554#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:43,958 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:25:43,958 INFO L273 TraceCheckUtils]: 141: Hoare triple {27554#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:43,958 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:25:43,959 INFO L273 TraceCheckUtils]: 143: Hoare triple {27554#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:43,959 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:25:43,959 INFO L273 TraceCheckUtils]: 145: Hoare triple {27554#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:43,959 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:25:43,959 INFO L273 TraceCheckUtils]: 147: Hoare triple {27554#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:43,959 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:25:43,959 INFO L273 TraceCheckUtils]: 149: Hoare triple {27554#false} assume !(~i~2 < 99); {27554#false} is VALID [2018-11-23 12:25:43,959 INFO L273 TraceCheckUtils]: 150: Hoare triple {27554#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {27554#false} is VALID [2018-11-23 12:25:43,959 INFO L256 TraceCheckUtils]: 151: Hoare triple {27554#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {27553#true} is VALID [2018-11-23 12:25:43,959 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:25:43,960 INFO L273 TraceCheckUtils]: 153: Hoare triple {27553#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:25:43,960 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:25:43,960 INFO L273 TraceCheckUtils]: 155: Hoare triple {27553#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:25:43,960 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:25:43,960 INFO L273 TraceCheckUtils]: 157: Hoare triple {27553#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:25:43,960 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:25:43,960 INFO L273 TraceCheckUtils]: 159: Hoare triple {27553#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:25:43,960 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:25:43,960 INFO L273 TraceCheckUtils]: 161: Hoare triple {27553#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:25:43,961 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:25:43,961 INFO L273 TraceCheckUtils]: 163: Hoare triple {27553#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:25:43,961 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:25:43,961 INFO L273 TraceCheckUtils]: 165: Hoare triple {27553#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:25:43,961 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:25:43,961 INFO L273 TraceCheckUtils]: 167: Hoare triple {27553#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:25:43,961 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:25:43,961 INFO L273 TraceCheckUtils]: 169: Hoare triple {27553#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:25:43,961 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:25:43,961 INFO L273 TraceCheckUtils]: 171: Hoare triple {27553#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:25:43,962 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:25:43,962 INFO L273 TraceCheckUtils]: 173: Hoare triple {27553#true} assume !(~i~0 < 100); {27553#true} is VALID [2018-11-23 12:25:43,962 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:25:43,962 INFO L273 TraceCheckUtils]: 175: Hoare triple {27553#true} assume true; {27553#true} is VALID [2018-11-23 12:25:43,962 INFO L268 TraceCheckUtils]: 176: Hoare quadruple {27553#true} {27554#false} #74#return; {27554#false} is VALID [2018-11-23 12:25:43,962 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:25:43,962 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:25:43,962 INFO L273 TraceCheckUtils]: 179: Hoare triple {27554#false} assume !false; {27554#false} is VALID [2018-11-23 12:25:43,977 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:25:43,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:25:43,977 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:25:43,987 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:25:44,061 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:25:44,061 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:25:44,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:25:44,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:25:44,461 INFO L256 TraceCheckUtils]: 0: Hoare triple {27553#true} call ULTIMATE.init(); {27553#true} is VALID [2018-11-23 12:25:44,461 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:25:44,462 INFO L273 TraceCheckUtils]: 2: Hoare triple {27553#true} assume true; {27553#true} is VALID [2018-11-23 12:25:44,462 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27553#true} {27553#true} #66#return; {27553#true} is VALID [2018-11-23 12:25:44,462 INFO L256 TraceCheckUtils]: 4: Hoare triple {27553#true} call #t~ret13 := main(); {27553#true} is VALID [2018-11-23 12:25:44,462 INFO L273 TraceCheckUtils]: 5: Hoare triple {27553#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {27553#true} is VALID [2018-11-23 12:25:44,462 INFO L273 TraceCheckUtils]: 6: Hoare triple {27553#true} assume !!(~i~1 < 100);assume -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:25:44,462 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:25:44,463 INFO L273 TraceCheckUtils]: 8: Hoare triple {27553#true} assume !!(~i~1 < 100);assume -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:25:44,463 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:25:44,463 INFO L273 TraceCheckUtils]: 10: Hoare triple {27553#true} assume !!(~i~1 < 100);assume -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:25:44,463 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:25:44,463 INFO L273 TraceCheckUtils]: 12: Hoare triple {27553#true} assume !!(~i~1 < 100);assume -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:25:44,463 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:25:44,464 INFO L273 TraceCheckUtils]: 14: Hoare triple {27553#true} assume !!(~i~1 < 100);assume -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:25:44,464 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:25:44,464 INFO L273 TraceCheckUtils]: 16: Hoare triple {27553#true} assume !!(~i~1 < 100);assume -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:25:44,464 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:25:44,464 INFO L273 TraceCheckUtils]: 18: Hoare triple {27553#true} assume !!(~i~1 < 100);assume -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:25:44,464 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:25:44,464 INFO L273 TraceCheckUtils]: 20: Hoare triple {27553#true} assume !!(~i~1 < 100);assume -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:25:44,464 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:25:44,465 INFO L273 TraceCheckUtils]: 22: Hoare triple {27553#true} assume !!(~i~1 < 100);assume -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:25:44,465 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:25:44,465 INFO L273 TraceCheckUtils]: 24: Hoare triple {27553#true} assume !!(~i~1 < 100);assume -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:25:44,465 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:25:44,465 INFO L273 TraceCheckUtils]: 26: Hoare triple {27553#true} assume !!(~i~1 < 100);assume -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:25:44,465 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:25:44,465 INFO L273 TraceCheckUtils]: 28: Hoare triple {27553#true} assume !!(~i~1 < 100);assume -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:25:44,465 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:25:44,465 INFO L273 TraceCheckUtils]: 30: Hoare triple {27553#true} assume !!(~i~1 < 100);assume -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:25:44,465 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:25:44,466 INFO L273 TraceCheckUtils]: 32: Hoare triple {27553#true} assume !!(~i~1 < 100);assume -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:25:44,466 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:25:44,466 INFO L273 TraceCheckUtils]: 34: Hoare triple {27553#true} assume !!(~i~1 < 100);assume -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:25:44,466 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:25:44,466 INFO L273 TraceCheckUtils]: 36: Hoare triple {27553#true} assume !!(~i~1 < 100);assume -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:25:44,466 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:25:44,466 INFO L273 TraceCheckUtils]: 38: Hoare triple {27553#true} assume !!(~i~1 < 100);assume -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:25:44,466 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:25:44,466 INFO L273 TraceCheckUtils]: 40: Hoare triple {27553#true} assume !!(~i~1 < 100);assume -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:25:44,466 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:25:44,467 INFO L273 TraceCheckUtils]: 42: Hoare triple {27553#true} assume !!(~i~1 < 100);assume -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:25:44,467 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:25:44,467 INFO L273 TraceCheckUtils]: 44: Hoare triple {27553#true} assume !!(~i~1 < 100);assume -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:25:44,467 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:25:44,467 INFO L273 TraceCheckUtils]: 46: Hoare triple {27553#true} assume !!(~i~1 < 100);assume -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:25:44,467 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:25:44,467 INFO L273 TraceCheckUtils]: 48: Hoare triple {27553#true} assume !!(~i~1 < 100);assume -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:25:44,467 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:25:44,467 INFO L273 TraceCheckUtils]: 50: Hoare triple {27553#true} assume !!(~i~1 < 100);assume -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:25:44,467 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:25:44,468 INFO L273 TraceCheckUtils]: 52: Hoare triple {27553#true} assume !!(~i~1 < 100);assume -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:25:44,468 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:25:44,468 INFO L273 TraceCheckUtils]: 54: Hoare triple {27553#true} assume !!(~i~1 < 100);assume -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:25:44,468 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:25:44,468 INFO L273 TraceCheckUtils]: 56: Hoare triple {27553#true} assume !!(~i~1 < 100);assume -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:25:44,468 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:25:44,468 INFO L273 TraceCheckUtils]: 58: Hoare triple {27553#true} assume !!(~i~1 < 100);assume -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:25:44,468 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:25:44,468 INFO L273 TraceCheckUtils]: 60: Hoare triple {27553#true} assume !!(~i~1 < 100);assume -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:25:44,468 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:25:44,469 INFO L273 TraceCheckUtils]: 62: Hoare triple {27553#true} assume !!(~i~1 < 100);assume -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:25:44,469 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:25:44,469 INFO L273 TraceCheckUtils]: 64: Hoare triple {27553#true} assume !!(~i~1 < 100);assume -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:25:44,469 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:25:44,469 INFO L273 TraceCheckUtils]: 66: Hoare triple {27553#true} assume !!(~i~1 < 100);assume -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:25:44,469 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:25:44,469 INFO L273 TraceCheckUtils]: 68: Hoare triple {27553#true} assume !!(~i~1 < 100);assume -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:25:44,469 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:25:44,469 INFO L273 TraceCheckUtils]: 70: Hoare triple {27553#true} assume !!(~i~1 < 100);assume -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:25:44,469 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:25:44,470 INFO L273 TraceCheckUtils]: 72: Hoare triple {27553#true} assume !!(~i~1 < 100);assume -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:25:44,470 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:25:44,470 INFO L273 TraceCheckUtils]: 74: Hoare triple {27553#true} assume !(~i~1 < 100); {27553#true} is VALID [2018-11-23 12:25:44,470 INFO L256 TraceCheckUtils]: 75: Hoare triple {27553#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {27553#true} is VALID [2018-11-23 12:25:44,470 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:25:44,470 INFO L273 TraceCheckUtils]: 77: Hoare triple {27553#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:25:44,470 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:25:44,470 INFO L273 TraceCheckUtils]: 79: Hoare triple {27553#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:25:44,470 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:25:44,470 INFO L273 TraceCheckUtils]: 81: Hoare triple {27553#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:25:44,471 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:25:44,471 INFO L273 TraceCheckUtils]: 83: Hoare triple {27553#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:25:44,471 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:25:44,471 INFO L273 TraceCheckUtils]: 85: Hoare triple {27553#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:25:44,471 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:25:44,471 INFO L273 TraceCheckUtils]: 87: Hoare triple {27553#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:25:44,471 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:25:44,471 INFO L273 TraceCheckUtils]: 89: Hoare triple {27553#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:25:44,471 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:25:44,471 INFO L273 TraceCheckUtils]: 91: Hoare triple {27553#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:25:44,472 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:25:44,472 INFO L273 TraceCheckUtils]: 93: Hoare triple {27553#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:25:44,472 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:25:44,472 INFO L273 TraceCheckUtils]: 95: Hoare triple {27553#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:25:44,472 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:25:44,472 INFO L273 TraceCheckUtils]: 97: Hoare triple {27553#true} assume !(~i~0 < 100); {27553#true} is VALID [2018-11-23 12:25:44,472 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:25:44,472 INFO L273 TraceCheckUtils]: 99: Hoare triple {27553#true} assume true; {27553#true} is VALID [2018-11-23 12:25:44,472 INFO L268 TraceCheckUtils]: 100: Hoare quadruple {27553#true} {27553#true} #70#return; {27553#true} is VALID [2018-11-23 12:25:44,472 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:25:44,473 INFO L256 TraceCheckUtils]: 102: Hoare triple {27553#true} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {27553#true} is VALID [2018-11-23 12:25:44,473 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:25:44,473 INFO L273 TraceCheckUtils]: 104: Hoare triple {27553#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:25:44,473 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:25:44,473 INFO L273 TraceCheckUtils]: 106: Hoare triple {27553#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:25:44,473 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:25:44,473 INFO L273 TraceCheckUtils]: 108: Hoare triple {27553#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:25:44,473 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:25:44,473 INFO L273 TraceCheckUtils]: 110: Hoare triple {27553#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:25:44,473 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:25:44,474 INFO L273 TraceCheckUtils]: 112: Hoare triple {27553#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:25:44,474 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:25:44,474 INFO L273 TraceCheckUtils]: 114: Hoare triple {27553#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:25:44,474 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:25:44,474 INFO L273 TraceCheckUtils]: 116: Hoare triple {27553#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:25:44,474 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:25:44,474 INFO L273 TraceCheckUtils]: 118: Hoare triple {27553#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:25:44,474 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:25:44,474 INFO L273 TraceCheckUtils]: 120: Hoare triple {27553#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:25:44,474 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:25:44,475 INFO L273 TraceCheckUtils]: 122: Hoare triple {27553#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27553#true} is VALID [2018-11-23 12:25:44,475 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:25:44,475 INFO L273 TraceCheckUtils]: 124: Hoare triple {27553#true} assume !(~i~0 < 100); {27553#true} is VALID [2018-11-23 12:25:44,475 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:25:44,475 INFO L273 TraceCheckUtils]: 126: Hoare triple {27553#true} assume true; {27553#true} is VALID [2018-11-23 12:25:44,475 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {27553#true} {27553#true} #72#return; {27553#true} is VALID [2018-11-23 12:25:44,476 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:25:44,476 INFO L273 TraceCheckUtils]: 129: Hoare triple {27977#(<= main_~i~2 0)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:44,476 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:25:44,477 INFO L273 TraceCheckUtils]: 131: Hoare triple {27984#(<= main_~i~2 1)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:44,477 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:25:44,477 INFO L273 TraceCheckUtils]: 133: Hoare triple {27991#(<= main_~i~2 2)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:44,478 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:25:44,478 INFO L273 TraceCheckUtils]: 135: Hoare triple {27998#(<= main_~i~2 3)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:44,478 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:25:44,479 INFO L273 TraceCheckUtils]: 137: Hoare triple {28005#(<= main_~i~2 4)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:44,479 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:25:44,480 INFO L273 TraceCheckUtils]: 139: Hoare triple {28012#(<= main_~i~2 5)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:44,480 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:25:44,481 INFO L273 TraceCheckUtils]: 141: Hoare triple {28019#(<= main_~i~2 6)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:44,482 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:25:44,482 INFO L273 TraceCheckUtils]: 143: Hoare triple {28026#(<= main_~i~2 7)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:44,483 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:25:44,483 INFO L273 TraceCheckUtils]: 145: Hoare triple {28033#(<= main_~i~2 8)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:44,484 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:25:44,484 INFO L273 TraceCheckUtils]: 147: Hoare triple {28040#(<= main_~i~2 9)} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:44,485 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:25:44,486 INFO L273 TraceCheckUtils]: 149: Hoare triple {28047#(<= main_~i~2 10)} assume !(~i~2 < 99); {27554#false} is VALID [2018-11-23 12:25:44,486 INFO L273 TraceCheckUtils]: 150: Hoare triple {27554#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {27554#false} is VALID [2018-11-23 12:25:44,486 INFO L256 TraceCheckUtils]: 151: Hoare triple {27554#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {27554#false} is VALID [2018-11-23 12:25:44,486 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:25:44,486 INFO L273 TraceCheckUtils]: 153: Hoare triple {27554#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27554#false} is VALID [2018-11-23 12:25:44,486 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:25:44,487 INFO L273 TraceCheckUtils]: 155: Hoare triple {27554#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27554#false} is VALID [2018-11-23 12:25:44,487 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:25:44,487 INFO L273 TraceCheckUtils]: 157: Hoare triple {27554#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27554#false} is VALID [2018-11-23 12:25:44,487 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:25:44,487 INFO L273 TraceCheckUtils]: 159: Hoare triple {27554#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27554#false} is VALID [2018-11-23 12:25:44,487 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:25:44,488 INFO L273 TraceCheckUtils]: 161: Hoare triple {27554#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27554#false} is VALID [2018-11-23 12:25:44,488 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:25:44,488 INFO L273 TraceCheckUtils]: 163: Hoare triple {27554#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27554#false} is VALID [2018-11-23 12:25:44,488 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:25:44,488 INFO L273 TraceCheckUtils]: 165: Hoare triple {27554#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27554#false} is VALID [2018-11-23 12:25:44,488 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:25:44,488 INFO L273 TraceCheckUtils]: 167: Hoare triple {27554#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27554#false} is VALID [2018-11-23 12:25:44,488 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:25:44,489 INFO L273 TraceCheckUtils]: 169: Hoare triple {27554#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27554#false} is VALID [2018-11-23 12:25:44,489 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:25:44,489 INFO L273 TraceCheckUtils]: 171: Hoare triple {27554#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {27554#false} is VALID [2018-11-23 12:25:44,489 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:25:44,489 INFO L273 TraceCheckUtils]: 173: Hoare triple {27554#false} assume !(~i~0 < 100); {27554#false} is VALID [2018-11-23 12:25:44,489 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:25:44,489 INFO L273 TraceCheckUtils]: 175: Hoare triple {27554#false} assume true; {27554#false} is VALID [2018-11-23 12:25:44,489 INFO L268 TraceCheckUtils]: 176: Hoare quadruple {27554#false} {27554#false} #74#return; {27554#false} is VALID [2018-11-23 12:25:44,489 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:25:44,489 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:25:44,490 INFO L273 TraceCheckUtils]: 179: Hoare triple {27554#false} assume !false; {27554#false} is VALID [2018-11-23 12:25:44,500 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:25:44,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:25:44,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 13] total 48 [2018-11-23 12:25:44,520 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 180 [2018-11-23 12:25:44,520 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:25:44,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 12:25:44,644 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:25:44,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 12:25:44,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 12:25:44,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=743, Invalid=1513, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 12:25:44,646 INFO L87 Difference]: Start difference. First operand 131 states and 135 transitions. Second operand 48 states. [2018-11-23 12:25:45,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:45,139 INFO L93 Difference]: Finished difference Result 193 states and 202 transitions. [2018-11-23 12:25:45,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 12:25:45,139 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 180 [2018-11-23 12:25:45,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:25:45,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:25:45,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 145 transitions. [2018-11-23 12:25:45,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:25:45,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 145 transitions. [2018-11-23 12:25:45,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 145 transitions. [2018-11-23 12:25:45,584 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:25:45,586 INFO L225 Difference]: With dead ends: 193 [2018-11-23 12:25:45,587 INFO L226 Difference]: Without dead ends: 137 [2018-11-23 12:25:45,588 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:25:45,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-11-23 12:25:45,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2018-11-23 12:25:45,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:25:45,635 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand 135 states. [2018-11-23 12:25:45,635 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 135 states. [2018-11-23 12:25:45,635 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 135 states. [2018-11-23 12:25:45,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:45,638 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2018-11-23 12:25:45,638 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 141 transitions. [2018-11-23 12:25:45,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:25:45,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:25:45,639 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand 137 states. [2018-11-23 12:25:45,639 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 137 states. [2018-11-23 12:25:45,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:25:45,641 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2018-11-23 12:25:45,641 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 141 transitions. [2018-11-23 12:25:45,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:25:45,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:25:45,642 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:25:45,642 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:25:45,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-23 12:25:45,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 139 transitions. [2018-11-23 12:25:45,644 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 139 transitions. Word has length 180 [2018-11-23 12:25:45,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:25:45,645 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 139 transitions. [2018-11-23 12:25:45,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 12:25:45,645 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2018-11-23 12:25:45,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-23 12:25:45,646 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:25:45,646 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:25:45,646 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:25:45,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:25:45,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1113930553, now seen corresponding path program 35 times [2018-11-23 12:25:45,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:25:45,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:25:45,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:25:45,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:25:45,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:25:45,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:25:46,435 INFO L256 TraceCheckUtils]: 0: Hoare triple {28902#true} call ULTIMATE.init(); {28902#true} is VALID [2018-11-23 12:25:46,435 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:25:46,436 INFO L273 TraceCheckUtils]: 2: Hoare triple {28902#true} assume true; {28902#true} is VALID [2018-11-23 12:25:46,436 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28902#true} {28902#true} #66#return; {28902#true} is VALID [2018-11-23 12:25:46,436 INFO L256 TraceCheckUtils]: 4: Hoare triple {28902#true} call #t~ret13 := main(); {28902#true} is VALID [2018-11-23 12:25:46,436 INFO L273 TraceCheckUtils]: 5: Hoare triple {28902#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:25:46,437 INFO L273 TraceCheckUtils]: 6: Hoare triple {28904#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:25:46,437 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:25:46,438 INFO L273 TraceCheckUtils]: 8: Hoare triple {28905#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:25:46,438 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:25:46,438 INFO L273 TraceCheckUtils]: 10: Hoare triple {28906#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:25:46,439 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:25:46,439 INFO L273 TraceCheckUtils]: 12: Hoare triple {28907#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -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:25:46,439 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:25:46,440 INFO L273 TraceCheckUtils]: 14: Hoare triple {28908#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -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:25:46,440 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:25:46,441 INFO L273 TraceCheckUtils]: 16: Hoare triple {28909#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -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:25:46,442 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:25:46,442 INFO L273 TraceCheckUtils]: 18: Hoare triple {28910#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -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:25:46,443 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:25:46,443 INFO L273 TraceCheckUtils]: 20: Hoare triple {28911#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -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:25:46,444 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:25:46,444 INFO L273 TraceCheckUtils]: 22: Hoare triple {28912#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -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:25:46,445 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:25:46,446 INFO L273 TraceCheckUtils]: 24: Hoare triple {28913#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -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:25:46,446 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:25:46,447 INFO L273 TraceCheckUtils]: 26: Hoare triple {28914#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -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:25:46,447 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:25:46,448 INFO L273 TraceCheckUtils]: 28: Hoare triple {28915#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -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:25:46,448 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:25:46,449 INFO L273 TraceCheckUtils]: 30: Hoare triple {28916#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -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:25:46,450 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:25:46,450 INFO L273 TraceCheckUtils]: 32: Hoare triple {28917#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -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:25:46,451 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:25:46,451 INFO L273 TraceCheckUtils]: 34: Hoare triple {28918#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -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:25:46,452 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:25:46,452 INFO L273 TraceCheckUtils]: 36: Hoare triple {28919#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -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:25:46,453 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:25:46,454 INFO L273 TraceCheckUtils]: 38: Hoare triple {28920#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -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:25:46,454 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:25:46,455 INFO L273 TraceCheckUtils]: 40: Hoare triple {28921#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -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:25:46,455 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:25:46,456 INFO L273 TraceCheckUtils]: 42: Hoare triple {28922#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -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:25:46,457 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:25:46,457 INFO L273 TraceCheckUtils]: 44: Hoare triple {28923#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -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:25:46,458 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:25:46,458 INFO L273 TraceCheckUtils]: 46: Hoare triple {28924#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -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:25:46,459 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:25:46,459 INFO L273 TraceCheckUtils]: 48: Hoare triple {28925#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -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:25:46,460 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:25:46,460 INFO L273 TraceCheckUtils]: 50: Hoare triple {28926#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -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:25:46,461 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:25:46,462 INFO L273 TraceCheckUtils]: 52: Hoare triple {28927#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -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:25:46,462 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:25:46,463 INFO L273 TraceCheckUtils]: 54: Hoare triple {28928#(<= main_~i~1 24)} assume !!(~i~1 < 100);assume -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:25:46,463 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:25:46,464 INFO L273 TraceCheckUtils]: 56: Hoare triple {28929#(<= main_~i~1 25)} assume !!(~i~1 < 100);assume -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:25:46,465 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:25:46,465 INFO L273 TraceCheckUtils]: 58: Hoare triple {28930#(<= main_~i~1 26)} assume !!(~i~1 < 100);assume -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:25:46,466 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:25:46,466 INFO L273 TraceCheckUtils]: 60: Hoare triple {28931#(<= main_~i~1 27)} assume !!(~i~1 < 100);assume -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:25:46,467 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:25:46,467 INFO L273 TraceCheckUtils]: 62: Hoare triple {28932#(<= main_~i~1 28)} assume !!(~i~1 < 100);assume -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:25:46,468 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:25:46,469 INFO L273 TraceCheckUtils]: 64: Hoare triple {28933#(<= main_~i~1 29)} assume !!(~i~1 < 100);assume -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:25:46,469 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:25:46,470 INFO L273 TraceCheckUtils]: 66: Hoare triple {28934#(<= main_~i~1 30)} assume !!(~i~1 < 100);assume -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:25:46,470 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:25:46,471 INFO L273 TraceCheckUtils]: 68: Hoare triple {28935#(<= main_~i~1 31)} assume !!(~i~1 < 100);assume -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:25:46,472 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:25:46,472 INFO L273 TraceCheckUtils]: 70: Hoare triple {28936#(<= main_~i~1 32)} assume !!(~i~1 < 100);assume -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:25:46,473 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:25:46,473 INFO L273 TraceCheckUtils]: 72: Hoare triple {28937#(<= main_~i~1 33)} assume !!(~i~1 < 100);assume -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:25:46,474 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:25:46,474 INFO L273 TraceCheckUtils]: 74: Hoare triple {28938#(<= main_~i~1 34)} assume !!(~i~1 < 100);assume -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:25:46,475 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:25:46,476 INFO L273 TraceCheckUtils]: 76: Hoare triple {28939#(<= main_~i~1 35)} assume !(~i~1 < 100); {28903#false} is VALID [2018-11-23 12:25:46,476 INFO L256 TraceCheckUtils]: 77: Hoare triple {28903#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {28902#true} is VALID [2018-11-23 12:25:46,476 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:25:46,476 INFO L273 TraceCheckUtils]: 79: Hoare triple {28902#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:25:46,476 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:25:46,476 INFO L273 TraceCheckUtils]: 81: Hoare triple {28902#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:25:46,477 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:25:46,477 INFO L273 TraceCheckUtils]: 83: Hoare triple {28902#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:25:46,477 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:25:46,477 INFO L273 TraceCheckUtils]: 85: Hoare triple {28902#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:25:46,477 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:25:46,477 INFO L273 TraceCheckUtils]: 87: Hoare triple {28902#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:25:46,478 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:25:46,478 INFO L273 TraceCheckUtils]: 89: Hoare triple {28902#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:25:46,478 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:25:46,478 INFO L273 TraceCheckUtils]: 91: Hoare triple {28902#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:25:46,478 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:25:46,478 INFO L273 TraceCheckUtils]: 93: Hoare triple {28902#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:25:46,479 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:25:46,479 INFO L273 TraceCheckUtils]: 95: Hoare triple {28902#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:25:46,479 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:25:46,479 INFO L273 TraceCheckUtils]: 97: Hoare triple {28902#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:25:46,479 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:25:46,479 INFO L273 TraceCheckUtils]: 99: Hoare triple {28902#true} assume !(~i~0 < 100); {28902#true} is VALID [2018-11-23 12:25:46,480 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:25:46,480 INFO L273 TraceCheckUtils]: 101: Hoare triple {28902#true} assume true; {28902#true} is VALID [2018-11-23 12:25:46,480 INFO L268 TraceCheckUtils]: 102: Hoare quadruple {28902#true} {28903#false} #70#return; {28903#false} is VALID [2018-11-23 12:25:46,480 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:25:46,480 INFO L256 TraceCheckUtils]: 104: Hoare triple {28903#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {28902#true} is VALID [2018-11-23 12:25:46,480 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:25:46,481 INFO L273 TraceCheckUtils]: 106: Hoare triple {28902#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:25:46,481 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:25:46,481 INFO L273 TraceCheckUtils]: 108: Hoare triple {28902#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:25:46,481 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:25:46,481 INFO L273 TraceCheckUtils]: 110: Hoare triple {28902#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:25:46,481 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:25:46,481 INFO L273 TraceCheckUtils]: 112: Hoare triple {28902#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:25:46,481 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:25:46,481 INFO L273 TraceCheckUtils]: 114: Hoare triple {28902#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:25:46,482 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:25:46,482 INFO L273 TraceCheckUtils]: 116: Hoare triple {28902#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:25:46,482 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:25:46,482 INFO L273 TraceCheckUtils]: 118: Hoare triple {28902#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:25:46,482 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:25:46,482 INFO L273 TraceCheckUtils]: 120: Hoare triple {28902#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:25:46,482 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:25:46,482 INFO L273 TraceCheckUtils]: 122: Hoare triple {28902#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:25:46,482 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:25:46,482 INFO L273 TraceCheckUtils]: 124: Hoare triple {28902#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:25:46,483 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:25:46,483 INFO L273 TraceCheckUtils]: 126: Hoare triple {28902#true} assume !(~i~0 < 100); {28902#true} is VALID [2018-11-23 12:25:46,483 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:25:46,483 INFO L273 TraceCheckUtils]: 128: Hoare triple {28902#true} assume true; {28902#true} is VALID [2018-11-23 12:25:46,483 INFO L268 TraceCheckUtils]: 129: Hoare quadruple {28902#true} {28903#false} #72#return; {28903#false} is VALID [2018-11-23 12:25:46,483 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:25:46,483 INFO L273 TraceCheckUtils]: 131: Hoare triple {28903#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:46,483 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:25:46,483 INFO L273 TraceCheckUtils]: 133: Hoare triple {28903#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:46,483 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:25:46,484 INFO L273 TraceCheckUtils]: 135: Hoare triple {28903#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:46,484 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:25:46,484 INFO L273 TraceCheckUtils]: 137: Hoare triple {28903#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:46,484 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:25:46,484 INFO L273 TraceCheckUtils]: 139: Hoare triple {28903#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:46,484 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:25:46,484 INFO L273 TraceCheckUtils]: 141: Hoare triple {28903#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:46,484 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:25:46,484 INFO L273 TraceCheckUtils]: 143: Hoare triple {28903#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:46,484 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:25:46,485 INFO L273 TraceCheckUtils]: 145: Hoare triple {28903#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:46,485 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:25:46,485 INFO L273 TraceCheckUtils]: 147: Hoare triple {28903#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:46,485 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:25:46,485 INFO L273 TraceCheckUtils]: 149: Hoare triple {28903#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:46,485 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:25:46,485 INFO L273 TraceCheckUtils]: 151: Hoare triple {28903#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:25:46,485 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:25:46,485 INFO L273 TraceCheckUtils]: 153: Hoare triple {28903#false} assume !(~i~2 < 99); {28903#false} is VALID [2018-11-23 12:25:46,485 INFO L273 TraceCheckUtils]: 154: Hoare triple {28903#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {28903#false} is VALID [2018-11-23 12:25:46,486 INFO L256 TraceCheckUtils]: 155: Hoare triple {28903#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {28902#true} is VALID [2018-11-23 12:25:46,486 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:25:46,486 INFO L273 TraceCheckUtils]: 157: Hoare triple {28902#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:25:46,486 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:25:46,486 INFO L273 TraceCheckUtils]: 159: Hoare triple {28902#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:25:46,486 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:25:46,486 INFO L273 TraceCheckUtils]: 161: Hoare triple {28902#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:25:46,486 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:25:46,486 INFO L273 TraceCheckUtils]: 163: Hoare triple {28902#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:25:46,486 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:25:46,487 INFO L273 TraceCheckUtils]: 165: Hoare triple {28902#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:25:46,487 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:25:46,487 INFO L273 TraceCheckUtils]: 167: Hoare triple {28902#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:25:46,487 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:25:46,487 INFO L273 TraceCheckUtils]: 169: Hoare triple {28902#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:25:46,487 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:25:46,487 INFO L273 TraceCheckUtils]: 171: Hoare triple {28902#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:25:46,487 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:25:46,487 INFO L273 TraceCheckUtils]: 173: Hoare triple {28902#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:25:46,487 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:25:46,488 INFO L273 TraceCheckUtils]: 175: Hoare triple {28902#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {28902#true} is VALID [2018-11-23 12:25:46,488 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:25:46,488 INFO L273 TraceCheckUtils]: 177: Hoare triple {28902#true} assume !(~i~0 < 100); {28902#true} is VALID [2018-11-23 12:25:46,488 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:25:46,488 INFO L273 TraceCheckUtils]: 179: Hoare triple {28902#true} assume true; {28902#true} is VALID [2018-11-23 12:25:46,488 INFO L268 TraceCheckUtils]: 180: Hoare quadruple {28902#true} {28903#false} #74#return; {28903#false} is VALID [2018-11-23 12:25:46,488 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:25:46,488 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:25:46,488 INFO L273 TraceCheckUtils]: 183: Hoare triple {28903#false} assume !false; {28903#false} is VALID [2018-11-23 12:25:46,503 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:25:46,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:25:46,504 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:25:46,514 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:26:35,147 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 35 check-sat command(s) [2018-11-23 12:26:35,147 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:35,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:35,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:35,661 INFO L256 TraceCheckUtils]: 0: Hoare triple {28902#true} call ULTIMATE.init(); {28902#true} is VALID [2018-11-23 12:26:35,661 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:26:35,661 INFO L273 TraceCheckUtils]: 2: Hoare triple {28902#true} assume true; {28902#true} is VALID [2018-11-23 12:26:35,661 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28902#true} {28902#true} #66#return; {28902#true} is VALID [2018-11-23 12:26:35,662 INFO L256 TraceCheckUtils]: 4: Hoare triple {28902#true} call #t~ret13 := main(); {28902#true} is VALID [2018-11-23 12:26:35,662 INFO L273 TraceCheckUtils]: 5: Hoare triple {28902#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {28902#true} is VALID [2018-11-23 12:26:35,662 INFO L273 TraceCheckUtils]: 6: Hoare triple {28902#true} assume !!(~i~1 < 100);assume -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:26:35,662 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:26:35,662 INFO L273 TraceCheckUtils]: 8: Hoare triple {28902#true} assume !!(~i~1 < 100);assume -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:26:35,662 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:26:35,663 INFO L273 TraceCheckUtils]: 10: Hoare triple {28902#true} assume !!(~i~1 < 100);assume -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:26:35,663 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:26:35,663 INFO L273 TraceCheckUtils]: 12: Hoare triple {28902#true} assume !!(~i~1 < 100);assume -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:26:35,663 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:26:35,663 INFO L273 TraceCheckUtils]: 14: Hoare triple {28902#true} assume !!(~i~1 < 100);assume -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:26:35,663 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:26:35,664 INFO L273 TraceCheckUtils]: 16: Hoare triple {28902#true} assume !!(~i~1 < 100);assume -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:26:35,664 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:26:35,664 INFO L273 TraceCheckUtils]: 18: Hoare triple {28902#true} assume !!(~i~1 < 100);assume -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:26:35,664 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:26:35,664 INFO L273 TraceCheckUtils]: 20: Hoare triple {28902#true} assume !!(~i~1 < 100);assume -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:26:35,664 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:26:35,664 INFO L273 TraceCheckUtils]: 22: Hoare triple {28902#true} assume !!(~i~1 < 100);assume -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:26:35,664 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:26:35,665 INFO L273 TraceCheckUtils]: 24: Hoare triple {28902#true} assume !!(~i~1 < 100);assume -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:26:35,665 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:26:35,665 INFO L273 TraceCheckUtils]: 26: Hoare triple {28902#true} assume !!(~i~1 < 100);assume -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:26:35,665 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:26:35,665 INFO L273 TraceCheckUtils]: 28: Hoare triple {28902#true} assume !!(~i~1 < 100);assume -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:26:35,665 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:26:35,665 INFO L273 TraceCheckUtils]: 30: Hoare triple {28902#true} assume !!(~i~1 < 100);assume -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:26:35,665 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:26:35,665 INFO L273 TraceCheckUtils]: 32: Hoare triple {28902#true} assume !!(~i~1 < 100);assume -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:26:35,665 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:26:35,666 INFO L273 TraceCheckUtils]: 34: Hoare triple {28902#true} assume !!(~i~1 < 100);assume -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:26:35,666 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:26:35,666 INFO L273 TraceCheckUtils]: 36: Hoare triple {28902#true} assume !!(~i~1 < 100);assume -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:26:35,666 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:26:35,666 INFO L273 TraceCheckUtils]: 38: Hoare triple {28902#true} assume !!(~i~1 < 100);assume -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:26:35,666 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:26:35,666 INFO L273 TraceCheckUtils]: 40: Hoare triple {28902#true} assume !!(~i~1 < 100);assume -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:26:35,666 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:26:35,666 INFO L273 TraceCheckUtils]: 42: Hoare triple {28902#true} assume !!(~i~1 < 100);assume -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:26:35,666 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:26:35,667 INFO L273 TraceCheckUtils]: 44: Hoare triple {28902#true} assume !!(~i~1 < 100);assume -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:26:35,667 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:26:35,667 INFO L273 TraceCheckUtils]: 46: Hoare triple {28902#true} assume !!(~i~1 < 100);assume -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:26:35,667 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:26:35,667 INFO L273 TraceCheckUtils]: 48: Hoare triple {28902#true} assume !!(~i~1 < 100);assume -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:26:35,667 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:26:35,667 INFO L273 TraceCheckUtils]: 50: Hoare triple {28902#true} assume !!(~i~1 < 100);assume -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:26:35,667 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:26:35,667 INFO L273 TraceCheckUtils]: 52: Hoare triple {28902#true} assume !!(~i~1 < 100);assume -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:26:35,667 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:26:35,668 INFO L273 TraceCheckUtils]: 54: Hoare triple {28902#true} assume !!(~i~1 < 100);assume -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:26:35,668 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:26:35,668 INFO L273 TraceCheckUtils]: 56: Hoare triple {28902#true} assume !!(~i~1 < 100);assume -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:26:35,668 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:26:35,668 INFO L273 TraceCheckUtils]: 58: Hoare triple {28902#true} assume !!(~i~1 < 100);assume -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:26:35,668 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:26:35,668 INFO L273 TraceCheckUtils]: 60: Hoare triple {28902#true} assume !!(~i~1 < 100);assume -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:26:35,668 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:26:35,668 INFO L273 TraceCheckUtils]: 62: Hoare triple {28902#true} assume !!(~i~1 < 100);assume -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:26:35,668 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:26:35,669 INFO L273 TraceCheckUtils]: 64: Hoare triple {28902#true} assume !!(~i~1 < 100);assume -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:26:35,669 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:26:35,669 INFO L273 TraceCheckUtils]: 66: Hoare triple {28902#true} assume !!(~i~1 < 100);assume -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:26:35,669 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:26:35,669 INFO L273 TraceCheckUtils]: 68: Hoare triple {28902#true} assume !!(~i~1 < 100);assume -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:26:35,669 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:26:35,669 INFO L273 TraceCheckUtils]: 70: Hoare triple {28902#true} assume !!(~i~1 < 100);assume -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:26:35,669 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:26:35,669 INFO L273 TraceCheckUtils]: 72: Hoare triple {28902#true} assume !!(~i~1 < 100);assume -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:26:35,669 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:26:35,670 INFO L273 TraceCheckUtils]: 74: Hoare triple {28902#true} assume !!(~i~1 < 100);assume -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:26:35,670 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:26:35,670 INFO L273 TraceCheckUtils]: 76: Hoare triple {28902#true} assume !(~i~1 < 100); {28902#true} is VALID [2018-11-23 12:26:35,670 INFO L256 TraceCheckUtils]: 77: Hoare triple {28902#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {28902#true} is VALID [2018-11-23 12:26:35,670 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#(<= bAnd_~i~0 1)} is VALID [2018-11-23 12:26:35,671 INFO L273 TraceCheckUtils]: 79: Hoare triple {29177#(<= bAnd_~i~0 1)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {29177#(<= bAnd_~i~0 1)} is VALID [2018-11-23 12:26:35,671 INFO L273 TraceCheckUtils]: 80: Hoare triple {29177#(<= bAnd_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29184#(<= bAnd_~i~0 2)} is VALID [2018-11-23 12:26:35,671 INFO L273 TraceCheckUtils]: 81: Hoare triple {29184#(<= bAnd_~i~0 2)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {29184#(<= bAnd_~i~0 2)} is VALID [2018-11-23 12:26:35,672 INFO L273 TraceCheckUtils]: 82: Hoare triple {29184#(<= bAnd_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29191#(<= bAnd_~i~0 3)} is VALID [2018-11-23 12:26:35,672 INFO L273 TraceCheckUtils]: 83: Hoare triple {29191#(<= bAnd_~i~0 3)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {29191#(<= bAnd_~i~0 3)} is VALID [2018-11-23 12:26:35,673 INFO L273 TraceCheckUtils]: 84: Hoare triple {29191#(<= bAnd_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29198#(<= bAnd_~i~0 4)} is VALID [2018-11-23 12:26:35,673 INFO L273 TraceCheckUtils]: 85: Hoare triple {29198#(<= bAnd_~i~0 4)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {29198#(<= bAnd_~i~0 4)} is VALID [2018-11-23 12:26:35,674 INFO L273 TraceCheckUtils]: 86: Hoare triple {29198#(<= bAnd_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29205#(<= bAnd_~i~0 5)} is VALID [2018-11-23 12:26:35,674 INFO L273 TraceCheckUtils]: 87: Hoare triple {29205#(<= bAnd_~i~0 5)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {29205#(<= bAnd_~i~0 5)} is VALID [2018-11-23 12:26:35,675 INFO L273 TraceCheckUtils]: 88: Hoare triple {29205#(<= bAnd_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29212#(<= bAnd_~i~0 6)} is VALID [2018-11-23 12:26:35,675 INFO L273 TraceCheckUtils]: 89: Hoare triple {29212#(<= bAnd_~i~0 6)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {29212#(<= bAnd_~i~0 6)} is VALID [2018-11-23 12:26:35,676 INFO L273 TraceCheckUtils]: 90: Hoare triple {29212#(<= bAnd_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29219#(<= bAnd_~i~0 7)} is VALID [2018-11-23 12:26:35,676 INFO L273 TraceCheckUtils]: 91: Hoare triple {29219#(<= bAnd_~i~0 7)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {29219#(<= bAnd_~i~0 7)} is VALID [2018-11-23 12:26:35,677 INFO L273 TraceCheckUtils]: 92: Hoare triple {29219#(<= bAnd_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29226#(<= bAnd_~i~0 8)} is VALID [2018-11-23 12:26:35,678 INFO L273 TraceCheckUtils]: 93: Hoare triple {29226#(<= bAnd_~i~0 8)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {29226#(<= bAnd_~i~0 8)} is VALID [2018-11-23 12:26:35,678 INFO L273 TraceCheckUtils]: 94: Hoare triple {29226#(<= bAnd_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29233#(<= bAnd_~i~0 9)} is VALID [2018-11-23 12:26:35,679 INFO L273 TraceCheckUtils]: 95: Hoare triple {29233#(<= bAnd_~i~0 9)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {29233#(<= bAnd_~i~0 9)} is VALID [2018-11-23 12:26:35,679 INFO L273 TraceCheckUtils]: 96: Hoare triple {29233#(<= bAnd_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29240#(<= bAnd_~i~0 10)} is VALID [2018-11-23 12:26:35,680 INFO L273 TraceCheckUtils]: 97: Hoare triple {29240#(<= bAnd_~i~0 10)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {29240#(<= bAnd_~i~0 10)} is VALID [2018-11-23 12:26:35,680 INFO L273 TraceCheckUtils]: 98: Hoare triple {29240#(<= bAnd_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29247#(<= bAnd_~i~0 11)} is VALID [2018-11-23 12:26:35,681 INFO L273 TraceCheckUtils]: 99: Hoare triple {29247#(<= bAnd_~i~0 11)} assume !(~i~0 < 100); {28903#false} is VALID [2018-11-23 12:26:35,681 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:26:35,681 INFO L273 TraceCheckUtils]: 101: Hoare triple {28903#false} assume true; {28903#false} is VALID [2018-11-23 12:26:35,682 INFO L268 TraceCheckUtils]: 102: Hoare quadruple {28903#false} {28902#true} #70#return; {28903#false} is VALID [2018-11-23 12:26:35,682 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:26:35,682 INFO L256 TraceCheckUtils]: 104: Hoare triple {28903#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {28903#false} is VALID [2018-11-23 12:26:35,682 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:26:35,682 INFO L273 TraceCheckUtils]: 106: Hoare triple {28903#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:26:35,683 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:26:35,683 INFO L273 TraceCheckUtils]: 108: Hoare triple {28903#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:26:35,683 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:26:35,683 INFO L273 TraceCheckUtils]: 110: Hoare triple {28903#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:26:35,683 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:26:35,683 INFO L273 TraceCheckUtils]: 112: Hoare triple {28903#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:26:35,684 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:26:35,684 INFO L273 TraceCheckUtils]: 114: Hoare triple {28903#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:26:35,684 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:26:35,684 INFO L273 TraceCheckUtils]: 116: Hoare triple {28903#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:26:35,684 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:26:35,684 INFO L273 TraceCheckUtils]: 118: Hoare triple {28903#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:26:35,684 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:26:35,684 INFO L273 TraceCheckUtils]: 120: Hoare triple {28903#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:26:35,684 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:26:35,685 INFO L273 TraceCheckUtils]: 122: Hoare triple {28903#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:26:35,685 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:26:35,685 INFO L273 TraceCheckUtils]: 124: Hoare triple {28903#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:26:35,685 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:26:35,685 INFO L273 TraceCheckUtils]: 126: Hoare triple {28903#false} assume !(~i~0 < 100); {28903#false} is VALID [2018-11-23 12:26:35,685 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:26:35,685 INFO L273 TraceCheckUtils]: 128: Hoare triple {28903#false} assume true; {28903#false} is VALID [2018-11-23 12:26:35,685 INFO L268 TraceCheckUtils]: 129: Hoare quadruple {28903#false} {28903#false} #72#return; {28903#false} is VALID [2018-11-23 12:26:35,685 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:26:35,685 INFO L273 TraceCheckUtils]: 131: Hoare triple {28903#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:35,686 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:26:35,686 INFO L273 TraceCheckUtils]: 133: Hoare triple {28903#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:35,686 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:26:35,686 INFO L273 TraceCheckUtils]: 135: Hoare triple {28903#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:35,686 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:26:35,686 INFO L273 TraceCheckUtils]: 137: Hoare triple {28903#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:35,686 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:26:35,686 INFO L273 TraceCheckUtils]: 139: Hoare triple {28903#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:35,686 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:26:35,686 INFO L273 TraceCheckUtils]: 141: Hoare triple {28903#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:35,687 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:26:35,687 INFO L273 TraceCheckUtils]: 143: Hoare triple {28903#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:35,687 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:26:35,687 INFO L273 TraceCheckUtils]: 145: Hoare triple {28903#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:35,687 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:26:35,687 INFO L273 TraceCheckUtils]: 147: Hoare triple {28903#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:35,687 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:26:35,687 INFO L273 TraceCheckUtils]: 149: Hoare triple {28903#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:35,687 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:26:35,687 INFO L273 TraceCheckUtils]: 151: Hoare triple {28903#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:35,688 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:26:35,688 INFO L273 TraceCheckUtils]: 153: Hoare triple {28903#false} assume !(~i~2 < 99); {28903#false} is VALID [2018-11-23 12:26:35,688 INFO L273 TraceCheckUtils]: 154: Hoare triple {28903#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {28903#false} is VALID [2018-11-23 12:26:35,688 INFO L256 TraceCheckUtils]: 155: Hoare triple {28903#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {28903#false} is VALID [2018-11-23 12:26:35,688 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:26:35,688 INFO L273 TraceCheckUtils]: 157: Hoare triple {28903#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:26:35,688 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:26:35,688 INFO L273 TraceCheckUtils]: 159: Hoare triple {28903#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:26:35,688 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:26:35,688 INFO L273 TraceCheckUtils]: 161: Hoare triple {28903#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:26:35,689 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:26:35,689 INFO L273 TraceCheckUtils]: 163: Hoare triple {28903#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:26:35,689 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:26:35,689 INFO L273 TraceCheckUtils]: 165: Hoare triple {28903#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:26:35,689 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:26:35,689 INFO L273 TraceCheckUtils]: 167: Hoare triple {28903#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:26:35,689 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:26:35,689 INFO L273 TraceCheckUtils]: 169: Hoare triple {28903#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:26:35,689 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:26:35,690 INFO L273 TraceCheckUtils]: 171: Hoare triple {28903#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:26:35,690 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:26:35,690 INFO L273 TraceCheckUtils]: 173: Hoare triple {28903#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:26:35,690 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:26:35,690 INFO L273 TraceCheckUtils]: 175: Hoare triple {28903#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {28903#false} is VALID [2018-11-23 12:26:35,690 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:26:35,690 INFO L273 TraceCheckUtils]: 177: Hoare triple {28903#false} assume !(~i~0 < 100); {28903#false} is VALID [2018-11-23 12:26:35,690 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:26:35,690 INFO L273 TraceCheckUtils]: 179: Hoare triple {28903#false} assume true; {28903#false} is VALID [2018-11-23 12:26:35,690 INFO L268 TraceCheckUtils]: 180: Hoare quadruple {28903#false} {28903#false} #74#return; {28903#false} is VALID [2018-11-23 12:26:35,690 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:26:35,691 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:26:35,691 INFO L273 TraceCheckUtils]: 183: Hoare triple {28903#false} assume !false; {28903#false} is VALID [2018-11-23 12:26:35,703 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:26:35,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:35,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 13] total 49 [2018-11-23 12:26:35,732 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 184 [2018-11-23 12:26:35,732 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:35,732 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states. [2018-11-23 12:26:35,856 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:26:35,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-23 12:26:35,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-23 12:26:35,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=1572, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 12:26:35,858 INFO L87 Difference]: Start difference. First operand 135 states and 139 transitions. Second operand 49 states. [2018-11-23 12:26:36,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:36,723 INFO L93 Difference]: Finished difference Result 199 states and 211 transitions. [2018-11-23 12:26:36,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-23 12:26:36,724 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 184 [2018-11-23 12:26:36,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:36,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:26:36,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 150 transitions. [2018-11-23 12:26:36,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:26:36,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 150 transitions. [2018-11-23 12:26:36,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states and 150 transitions. [2018-11-23 12:26:36,922 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:26:36,925 INFO L225 Difference]: With dead ends: 199 [2018-11-23 12:26:36,925 INFO L226 Difference]: Without dead ends: 141 [2018-11-23 12:26:36,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=780, Invalid=1572, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 12:26:36,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-23 12:26:36,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2018-11-23 12:26:36,998 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:36,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand 139 states. [2018-11-23 12:26:36,998 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand 139 states. [2018-11-23 12:26:36,999 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 139 states. [2018-11-23 12:26:37,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:37,002 INFO L93 Difference]: Finished difference Result 141 states and 145 transitions. [2018-11-23 12:26:37,002 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 145 transitions. [2018-11-23 12:26:37,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:37,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:37,002 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand 141 states. [2018-11-23 12:26:37,003 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 141 states. [2018-11-23 12:26:37,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:37,005 INFO L93 Difference]: Finished difference Result 141 states and 145 transitions. [2018-11-23 12:26:37,005 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 145 transitions. [2018-11-23 12:26:37,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:37,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:37,006 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:37,006 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:37,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-23 12:26:37,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 143 transitions. [2018-11-23 12:26:37,008 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 143 transitions. Word has length 184 [2018-11-23 12:26:37,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:37,009 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 143 transitions. [2018-11-23 12:26:37,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-23 12:26:37,009 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 143 transitions. [2018-11-23 12:26:37,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-11-23 12:26:37,010 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:37,010 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:26:37,010 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:37,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:37,011 INFO L82 PathProgramCache]: Analyzing trace with hash 2006594855, now seen corresponding path program 36 times [2018-11-23 12:26:37,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:37,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:37,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:37,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:37,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:37,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:38,047 INFO L256 TraceCheckUtils]: 0: Hoare triple {30287#true} call ULTIMATE.init(); {30287#true} is VALID [2018-11-23 12:26:38,048 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:26:38,048 INFO L273 TraceCheckUtils]: 2: Hoare triple {30287#true} assume true; {30287#true} is VALID [2018-11-23 12:26:38,048 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30287#true} {30287#true} #66#return; {30287#true} is VALID [2018-11-23 12:26:38,048 INFO L256 TraceCheckUtils]: 4: Hoare triple {30287#true} call #t~ret13 := main(); {30287#true} is VALID [2018-11-23 12:26:38,048 INFO L273 TraceCheckUtils]: 5: Hoare triple {30287#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:26:38,049 INFO L273 TraceCheckUtils]: 6: Hoare triple {30289#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:26:38,050 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:26:38,050 INFO L273 TraceCheckUtils]: 8: Hoare triple {30290#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:26:38,051 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:26:38,051 INFO L273 TraceCheckUtils]: 10: Hoare triple {30291#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:26:38,052 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:26:38,052 INFO L273 TraceCheckUtils]: 12: Hoare triple {30292#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -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:26:38,053 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:26:38,054 INFO L273 TraceCheckUtils]: 14: Hoare triple {30293#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -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:26:38,054 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:26:38,055 INFO L273 TraceCheckUtils]: 16: Hoare triple {30294#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -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:26:38,055 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:26:38,056 INFO L273 TraceCheckUtils]: 18: Hoare triple {30295#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -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:26:38,057 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:26:38,057 INFO L273 TraceCheckUtils]: 20: Hoare triple {30296#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -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:26:38,058 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:26:38,058 INFO L273 TraceCheckUtils]: 22: Hoare triple {30297#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -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:26:38,059 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:26:38,059 INFO L273 TraceCheckUtils]: 24: Hoare triple {30298#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -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:26:38,060 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:26:38,060 INFO L273 TraceCheckUtils]: 26: Hoare triple {30299#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -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:26:38,061 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:26:38,062 INFO L273 TraceCheckUtils]: 28: Hoare triple {30300#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -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:26:38,062 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:26:38,063 INFO L273 TraceCheckUtils]: 30: Hoare triple {30301#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -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:26:38,063 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:26:38,064 INFO L273 TraceCheckUtils]: 32: Hoare triple {30302#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -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:26:38,065 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:26:38,065 INFO L273 TraceCheckUtils]: 34: Hoare triple {30303#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -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:26:38,066 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:26:38,066 INFO L273 TraceCheckUtils]: 36: Hoare triple {30304#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -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:26:38,067 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:26:38,067 INFO L273 TraceCheckUtils]: 38: Hoare triple {30305#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -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:26:38,068 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:26:38,068 INFO L273 TraceCheckUtils]: 40: Hoare triple {30306#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -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:26:38,069 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:26:38,070 INFO L273 TraceCheckUtils]: 42: Hoare triple {30307#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -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:26:38,070 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:26:38,071 INFO L273 TraceCheckUtils]: 44: Hoare triple {30308#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -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:26:38,071 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:26:38,072 INFO L273 TraceCheckUtils]: 46: Hoare triple {30309#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -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:26:38,073 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:26:38,073 INFO L273 TraceCheckUtils]: 48: Hoare triple {30310#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -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:26:38,074 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:26:38,074 INFO L273 TraceCheckUtils]: 50: Hoare triple {30311#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -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:26:38,075 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:26:38,075 INFO L273 TraceCheckUtils]: 52: Hoare triple {30312#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -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:26:38,076 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:26:38,077 INFO L273 TraceCheckUtils]: 54: Hoare triple {30313#(<= main_~i~1 24)} assume !!(~i~1 < 100);assume -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:26:38,077 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:26:38,078 INFO L273 TraceCheckUtils]: 56: Hoare triple {30314#(<= main_~i~1 25)} assume !!(~i~1 < 100);assume -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:26:38,078 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:26:38,079 INFO L273 TraceCheckUtils]: 58: Hoare triple {30315#(<= main_~i~1 26)} assume !!(~i~1 < 100);assume -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:26:38,080 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:26:38,080 INFO L273 TraceCheckUtils]: 60: Hoare triple {30316#(<= main_~i~1 27)} assume !!(~i~1 < 100);assume -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:26:38,081 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:26:38,081 INFO L273 TraceCheckUtils]: 62: Hoare triple {30317#(<= main_~i~1 28)} assume !!(~i~1 < 100);assume -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:26:38,082 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:26:38,082 INFO L273 TraceCheckUtils]: 64: Hoare triple {30318#(<= main_~i~1 29)} assume !!(~i~1 < 100);assume -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:26:38,083 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:26:38,084 INFO L273 TraceCheckUtils]: 66: Hoare triple {30319#(<= main_~i~1 30)} assume !!(~i~1 < 100);assume -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:26:38,084 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:26:38,085 INFO L273 TraceCheckUtils]: 68: Hoare triple {30320#(<= main_~i~1 31)} assume !!(~i~1 < 100);assume -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:26:38,085 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:26:38,086 INFO L273 TraceCheckUtils]: 70: Hoare triple {30321#(<= main_~i~1 32)} assume !!(~i~1 < 100);assume -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:26:38,086 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:26:38,087 INFO L273 TraceCheckUtils]: 72: Hoare triple {30322#(<= main_~i~1 33)} assume !!(~i~1 < 100);assume -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:26:38,088 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:26:38,088 INFO L273 TraceCheckUtils]: 74: Hoare triple {30323#(<= main_~i~1 34)} assume !!(~i~1 < 100);assume -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:26:38,089 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:26:38,089 INFO L273 TraceCheckUtils]: 76: Hoare triple {30324#(<= main_~i~1 35)} assume !!(~i~1 < 100);assume -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:26:38,090 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:26:38,091 INFO L273 TraceCheckUtils]: 78: Hoare triple {30325#(<= main_~i~1 36)} assume !(~i~1 < 100); {30288#false} is VALID [2018-11-23 12:26:38,091 INFO L256 TraceCheckUtils]: 79: Hoare triple {30288#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {30287#true} is VALID [2018-11-23 12:26:38,091 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:26:38,091 INFO L273 TraceCheckUtils]: 81: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:38,091 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:26:38,091 INFO L273 TraceCheckUtils]: 83: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:38,092 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:26:38,092 INFO L273 TraceCheckUtils]: 85: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:38,092 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:26:38,092 INFO L273 TraceCheckUtils]: 87: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:38,092 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:26:38,092 INFO L273 TraceCheckUtils]: 89: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:38,093 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:26:38,093 INFO L273 TraceCheckUtils]: 91: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:38,093 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:26:38,093 INFO L273 TraceCheckUtils]: 93: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:38,093 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:26:38,093 INFO L273 TraceCheckUtils]: 95: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:38,093 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:26:38,094 INFO L273 TraceCheckUtils]: 97: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:38,094 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:26:38,094 INFO L273 TraceCheckUtils]: 99: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:38,094 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:26:38,094 INFO L273 TraceCheckUtils]: 101: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:38,094 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:26:38,094 INFO L273 TraceCheckUtils]: 103: Hoare triple {30287#true} assume !(~i~0 < 100); {30287#true} is VALID [2018-11-23 12:26:38,094 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:26:38,094 INFO L273 TraceCheckUtils]: 105: Hoare triple {30287#true} assume true; {30287#true} is VALID [2018-11-23 12:26:38,095 INFO L268 TraceCheckUtils]: 106: Hoare quadruple {30287#true} {30288#false} #70#return; {30288#false} is VALID [2018-11-23 12:26:38,095 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:26:38,095 INFO L256 TraceCheckUtils]: 108: Hoare triple {30288#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {30287#true} is VALID [2018-11-23 12:26:38,095 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:26:38,095 INFO L273 TraceCheckUtils]: 110: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:38,095 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:26:38,095 INFO L273 TraceCheckUtils]: 112: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:38,095 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:26:38,095 INFO L273 TraceCheckUtils]: 114: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:38,095 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:26:38,096 INFO L273 TraceCheckUtils]: 116: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:38,096 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:26:38,096 INFO L273 TraceCheckUtils]: 118: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:38,096 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:26:38,096 INFO L273 TraceCheckUtils]: 120: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:38,096 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:26:38,096 INFO L273 TraceCheckUtils]: 122: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:38,096 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:26:38,096 INFO L273 TraceCheckUtils]: 124: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:38,096 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:26:38,097 INFO L273 TraceCheckUtils]: 126: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:38,097 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:26:38,097 INFO L273 TraceCheckUtils]: 128: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:38,097 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:26:38,097 INFO L273 TraceCheckUtils]: 130: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:38,097 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:26:38,097 INFO L273 TraceCheckUtils]: 132: Hoare triple {30287#true} assume !(~i~0 < 100); {30287#true} is VALID [2018-11-23 12:26:38,097 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:26:38,097 INFO L273 TraceCheckUtils]: 134: Hoare triple {30287#true} assume true; {30287#true} is VALID [2018-11-23 12:26:38,097 INFO L268 TraceCheckUtils]: 135: Hoare quadruple {30287#true} {30288#false} #72#return; {30288#false} is VALID [2018-11-23 12:26:38,098 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:26:38,098 INFO L273 TraceCheckUtils]: 137: Hoare triple {30288#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:38,098 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:26:38,098 INFO L273 TraceCheckUtils]: 139: Hoare triple {30288#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:38,098 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:26:38,098 INFO L273 TraceCheckUtils]: 141: Hoare triple {30288#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:38,098 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:26:38,098 INFO L273 TraceCheckUtils]: 143: Hoare triple {30288#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:38,098 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:26:38,098 INFO L273 TraceCheckUtils]: 145: Hoare triple {30288#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:38,099 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:26:38,099 INFO L273 TraceCheckUtils]: 147: Hoare triple {30288#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:38,099 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:26:38,099 INFO L273 TraceCheckUtils]: 149: Hoare triple {30288#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:38,099 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:26:38,099 INFO L273 TraceCheckUtils]: 151: Hoare triple {30288#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:38,099 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:26:38,099 INFO L273 TraceCheckUtils]: 153: Hoare triple {30288#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:38,099 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:26:38,099 INFO L273 TraceCheckUtils]: 155: Hoare triple {30288#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:38,100 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:26:38,100 INFO L273 TraceCheckUtils]: 157: Hoare triple {30288#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:38,100 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:26:38,100 INFO L273 TraceCheckUtils]: 159: Hoare triple {30288#false} assume !(~i~2 < 99); {30288#false} is VALID [2018-11-23 12:26:38,100 INFO L273 TraceCheckUtils]: 160: Hoare triple {30288#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {30288#false} is VALID [2018-11-23 12:26:38,100 INFO L256 TraceCheckUtils]: 161: Hoare triple {30288#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {30287#true} is VALID [2018-11-23 12:26:38,100 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:26:38,100 INFO L273 TraceCheckUtils]: 163: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:38,100 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:26:38,100 INFO L273 TraceCheckUtils]: 165: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:38,101 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:26:38,101 INFO L273 TraceCheckUtils]: 167: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:38,101 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:26:38,101 INFO L273 TraceCheckUtils]: 169: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:38,101 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:26:38,101 INFO L273 TraceCheckUtils]: 171: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:38,101 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:26:38,101 INFO L273 TraceCheckUtils]: 173: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:38,101 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:26:38,101 INFO L273 TraceCheckUtils]: 175: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:38,102 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:26:38,102 INFO L273 TraceCheckUtils]: 177: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:38,102 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:26:38,102 INFO L273 TraceCheckUtils]: 179: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:38,102 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:26:38,102 INFO L273 TraceCheckUtils]: 181: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:38,102 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:26:38,102 INFO L273 TraceCheckUtils]: 183: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:38,102 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:26:38,102 INFO L273 TraceCheckUtils]: 185: Hoare triple {30287#true} assume !(~i~0 < 100); {30287#true} is VALID [2018-11-23 12:26:38,103 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:26:38,103 INFO L273 TraceCheckUtils]: 187: Hoare triple {30287#true} assume true; {30287#true} is VALID [2018-11-23 12:26:38,103 INFO L268 TraceCheckUtils]: 188: Hoare quadruple {30287#true} {30288#false} #74#return; {30288#false} is VALID [2018-11-23 12:26:38,103 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:26:38,103 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:26:38,103 INFO L273 TraceCheckUtils]: 191: Hoare triple {30288#false} assume !false; {30288#false} is VALID [2018-11-23 12:26:38,119 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:26:38,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:38,119 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:26:38,130 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:26:39,607 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2018-11-23 12:26:39,607 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:39,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:39,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:40,112 INFO L256 TraceCheckUtils]: 0: Hoare triple {30287#true} call ULTIMATE.init(); {30287#true} is VALID [2018-11-23 12:26:40,112 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:26:40,112 INFO L273 TraceCheckUtils]: 2: Hoare triple {30287#true} assume true; {30287#true} is VALID [2018-11-23 12:26:40,112 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30287#true} {30287#true} #66#return; {30287#true} is VALID [2018-11-23 12:26:40,113 INFO L256 TraceCheckUtils]: 4: Hoare triple {30287#true} call #t~ret13 := main(); {30287#true} is VALID [2018-11-23 12:26:40,113 INFO L273 TraceCheckUtils]: 5: Hoare triple {30287#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {30287#true} is VALID [2018-11-23 12:26:40,113 INFO L273 TraceCheckUtils]: 6: Hoare triple {30287#true} assume !!(~i~1 < 100);assume -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:26:40,113 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:26:40,113 INFO L273 TraceCheckUtils]: 8: Hoare triple {30287#true} assume !!(~i~1 < 100);assume -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:26:40,113 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:26:40,114 INFO L273 TraceCheckUtils]: 10: Hoare triple {30287#true} assume !!(~i~1 < 100);assume -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:26:40,114 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:26:40,114 INFO L273 TraceCheckUtils]: 12: Hoare triple {30287#true} assume !!(~i~1 < 100);assume -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:26:40,114 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:26:40,114 INFO L273 TraceCheckUtils]: 14: Hoare triple {30287#true} assume !!(~i~1 < 100);assume -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:26:40,114 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:26:40,114 INFO L273 TraceCheckUtils]: 16: Hoare triple {30287#true} assume !!(~i~1 < 100);assume -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:26:40,114 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:26:40,114 INFO L273 TraceCheckUtils]: 18: Hoare triple {30287#true} assume !!(~i~1 < 100);assume -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:26:40,114 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:26:40,115 INFO L273 TraceCheckUtils]: 20: Hoare triple {30287#true} assume !!(~i~1 < 100);assume -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:26:40,115 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:26:40,115 INFO L273 TraceCheckUtils]: 22: Hoare triple {30287#true} assume !!(~i~1 < 100);assume -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:26:40,115 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:26:40,115 INFO L273 TraceCheckUtils]: 24: Hoare triple {30287#true} assume !!(~i~1 < 100);assume -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:26:40,115 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:26:40,115 INFO L273 TraceCheckUtils]: 26: Hoare triple {30287#true} assume !!(~i~1 < 100);assume -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:26:40,115 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:26:40,115 INFO L273 TraceCheckUtils]: 28: Hoare triple {30287#true} assume !!(~i~1 < 100);assume -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:26:40,115 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:26:40,116 INFO L273 TraceCheckUtils]: 30: Hoare triple {30287#true} assume !!(~i~1 < 100);assume -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:26:40,116 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:26:40,116 INFO L273 TraceCheckUtils]: 32: Hoare triple {30287#true} assume !!(~i~1 < 100);assume -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:26:40,116 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:26:40,116 INFO L273 TraceCheckUtils]: 34: Hoare triple {30287#true} assume !!(~i~1 < 100);assume -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:26:40,116 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:26:40,116 INFO L273 TraceCheckUtils]: 36: Hoare triple {30287#true} assume !!(~i~1 < 100);assume -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:26:40,116 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:26:40,116 INFO L273 TraceCheckUtils]: 38: Hoare triple {30287#true} assume !!(~i~1 < 100);assume -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:26:40,116 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:26:40,117 INFO L273 TraceCheckUtils]: 40: Hoare triple {30287#true} assume !!(~i~1 < 100);assume -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:26:40,117 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:26:40,117 INFO L273 TraceCheckUtils]: 42: Hoare triple {30287#true} assume !!(~i~1 < 100);assume -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:26:40,117 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:26:40,117 INFO L273 TraceCheckUtils]: 44: Hoare triple {30287#true} assume !!(~i~1 < 100);assume -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:26:40,117 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:26:40,117 INFO L273 TraceCheckUtils]: 46: Hoare triple {30287#true} assume !!(~i~1 < 100);assume -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:26:40,117 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:26:40,117 INFO L273 TraceCheckUtils]: 48: Hoare triple {30287#true} assume !!(~i~1 < 100);assume -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:26:40,117 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:26:40,118 INFO L273 TraceCheckUtils]: 50: Hoare triple {30287#true} assume !!(~i~1 < 100);assume -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:26:40,118 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:26:40,118 INFO L273 TraceCheckUtils]: 52: Hoare triple {30287#true} assume !!(~i~1 < 100);assume -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:26:40,118 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:26:40,118 INFO L273 TraceCheckUtils]: 54: Hoare triple {30287#true} assume !!(~i~1 < 100);assume -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:26:40,118 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:26:40,118 INFO L273 TraceCheckUtils]: 56: Hoare triple {30287#true} assume !!(~i~1 < 100);assume -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:26:40,118 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:26:40,118 INFO L273 TraceCheckUtils]: 58: Hoare triple {30287#true} assume !!(~i~1 < 100);assume -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:26:40,118 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:26:40,119 INFO L273 TraceCheckUtils]: 60: Hoare triple {30287#true} assume !!(~i~1 < 100);assume -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:26:40,119 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:26:40,119 INFO L273 TraceCheckUtils]: 62: Hoare triple {30287#true} assume !!(~i~1 < 100);assume -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:26:40,119 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:26:40,119 INFO L273 TraceCheckUtils]: 64: Hoare triple {30287#true} assume !!(~i~1 < 100);assume -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:26:40,119 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:26:40,119 INFO L273 TraceCheckUtils]: 66: Hoare triple {30287#true} assume !!(~i~1 < 100);assume -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:26:40,119 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:26:40,119 INFO L273 TraceCheckUtils]: 68: Hoare triple {30287#true} assume !!(~i~1 < 100);assume -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:26:40,119 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:26:40,120 INFO L273 TraceCheckUtils]: 70: Hoare triple {30287#true} assume !!(~i~1 < 100);assume -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:26:40,120 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:26:40,120 INFO L273 TraceCheckUtils]: 72: Hoare triple {30287#true} assume !!(~i~1 < 100);assume -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:26:40,120 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:26:40,120 INFO L273 TraceCheckUtils]: 74: Hoare triple {30287#true} assume !!(~i~1 < 100);assume -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:26:40,120 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:26:40,120 INFO L273 TraceCheckUtils]: 76: Hoare triple {30287#true} assume !!(~i~1 < 100);assume -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:26:40,120 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:26:40,120 INFO L273 TraceCheckUtils]: 78: Hoare triple {30287#true} assume !(~i~1 < 100); {30287#true} is VALID [2018-11-23 12:26:40,120 INFO L256 TraceCheckUtils]: 79: Hoare triple {30287#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {30287#true} is VALID [2018-11-23 12:26:40,121 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:26:40,121 INFO L273 TraceCheckUtils]: 81: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:40,121 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:26:40,121 INFO L273 TraceCheckUtils]: 83: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:40,121 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:26:40,121 INFO L273 TraceCheckUtils]: 85: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:40,121 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:26:40,121 INFO L273 TraceCheckUtils]: 87: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:40,121 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:26:40,121 INFO L273 TraceCheckUtils]: 89: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:40,122 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:26:40,122 INFO L273 TraceCheckUtils]: 91: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:40,122 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:26:40,122 INFO L273 TraceCheckUtils]: 93: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:40,122 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:26:40,122 INFO L273 TraceCheckUtils]: 95: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:40,122 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:26:40,122 INFO L273 TraceCheckUtils]: 97: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:40,122 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:26:40,122 INFO L273 TraceCheckUtils]: 99: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:40,123 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:26:40,123 INFO L273 TraceCheckUtils]: 101: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:40,123 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:26:40,123 INFO L273 TraceCheckUtils]: 103: Hoare triple {30287#true} assume !(~i~0 < 100); {30287#true} is VALID [2018-11-23 12:26:40,123 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:26:40,123 INFO L273 TraceCheckUtils]: 105: Hoare triple {30287#true} assume true; {30287#true} is VALID [2018-11-23 12:26:40,123 INFO L268 TraceCheckUtils]: 106: Hoare quadruple {30287#true} {30287#true} #70#return; {30287#true} is VALID [2018-11-23 12:26:40,123 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:26:40,123 INFO L256 TraceCheckUtils]: 108: Hoare triple {30287#true} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {30287#true} is VALID [2018-11-23 12:26:40,123 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:26:40,124 INFO L273 TraceCheckUtils]: 110: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:40,124 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:26:40,124 INFO L273 TraceCheckUtils]: 112: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:40,124 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:26:40,124 INFO L273 TraceCheckUtils]: 114: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:40,124 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:26:40,124 INFO L273 TraceCheckUtils]: 116: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:40,124 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:26:40,124 INFO L273 TraceCheckUtils]: 118: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:40,124 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:26:40,125 INFO L273 TraceCheckUtils]: 120: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:40,125 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:26:40,125 INFO L273 TraceCheckUtils]: 122: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:40,125 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:26:40,125 INFO L273 TraceCheckUtils]: 124: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:40,125 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:26:40,125 INFO L273 TraceCheckUtils]: 126: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:40,125 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:26:40,125 INFO L273 TraceCheckUtils]: 128: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:40,125 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:26:40,126 INFO L273 TraceCheckUtils]: 130: Hoare triple {30287#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30287#true} is VALID [2018-11-23 12:26:40,126 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:26:40,126 INFO L273 TraceCheckUtils]: 132: Hoare triple {30287#true} assume !(~i~0 < 100); {30287#true} is VALID [2018-11-23 12:26:40,126 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:26:40,126 INFO L273 TraceCheckUtils]: 134: Hoare triple {30287#true} assume true; {30287#true} is VALID [2018-11-23 12:26:40,126 INFO L268 TraceCheckUtils]: 135: Hoare quadruple {30287#true} {30287#true} #72#return; {30287#true} is VALID [2018-11-23 12:26:40,126 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:26:40,126 INFO L273 TraceCheckUtils]: 137: Hoare triple {30287#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:40,126 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:26:40,126 INFO L273 TraceCheckUtils]: 139: Hoare triple {30287#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:40,127 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:26:40,127 INFO L273 TraceCheckUtils]: 141: Hoare triple {30287#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:40,127 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:26:40,127 INFO L273 TraceCheckUtils]: 143: Hoare triple {30287#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:40,127 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:26:40,127 INFO L273 TraceCheckUtils]: 145: Hoare triple {30287#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:40,127 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:26:40,127 INFO L273 TraceCheckUtils]: 147: Hoare triple {30287#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:40,127 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:26:40,127 INFO L273 TraceCheckUtils]: 149: Hoare triple {30287#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:40,128 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:26:40,128 INFO L273 TraceCheckUtils]: 151: Hoare triple {30287#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:40,128 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:26:40,128 INFO L273 TraceCheckUtils]: 153: Hoare triple {30287#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:40,128 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:26:40,128 INFO L273 TraceCheckUtils]: 155: Hoare triple {30287#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:40,128 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:26:40,128 INFO L273 TraceCheckUtils]: 157: Hoare triple {30287#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:40,128 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:26:40,128 INFO L273 TraceCheckUtils]: 159: Hoare triple {30287#true} assume !(~i~2 < 99); {30287#true} is VALID [2018-11-23 12:26:40,129 INFO L273 TraceCheckUtils]: 160: Hoare triple {30287#true} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {30287#true} is VALID [2018-11-23 12:26:40,129 INFO L256 TraceCheckUtils]: 161: Hoare triple {30287#true} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {30287#true} is VALID [2018-11-23 12:26:40,129 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#(<= bAnd_~i~0 1)} is VALID [2018-11-23 12:26:40,129 INFO L273 TraceCheckUtils]: 163: Hoare triple {30815#(<= bAnd_~i~0 1)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30815#(<= bAnd_~i~0 1)} is VALID [2018-11-23 12:26:40,130 INFO L273 TraceCheckUtils]: 164: Hoare triple {30815#(<= bAnd_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30822#(<= bAnd_~i~0 2)} is VALID [2018-11-23 12:26:40,130 INFO L273 TraceCheckUtils]: 165: Hoare triple {30822#(<= bAnd_~i~0 2)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30822#(<= bAnd_~i~0 2)} is VALID [2018-11-23 12:26:40,131 INFO L273 TraceCheckUtils]: 166: Hoare triple {30822#(<= bAnd_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30829#(<= bAnd_~i~0 3)} is VALID [2018-11-23 12:26:40,131 INFO L273 TraceCheckUtils]: 167: Hoare triple {30829#(<= bAnd_~i~0 3)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30829#(<= bAnd_~i~0 3)} is VALID [2018-11-23 12:26:40,131 INFO L273 TraceCheckUtils]: 168: Hoare triple {30829#(<= bAnd_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30836#(<= bAnd_~i~0 4)} is VALID [2018-11-23 12:26:40,132 INFO L273 TraceCheckUtils]: 169: Hoare triple {30836#(<= bAnd_~i~0 4)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30836#(<= bAnd_~i~0 4)} is VALID [2018-11-23 12:26:40,132 INFO L273 TraceCheckUtils]: 170: Hoare triple {30836#(<= bAnd_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30843#(<= bAnd_~i~0 5)} is VALID [2018-11-23 12:26:40,132 INFO L273 TraceCheckUtils]: 171: Hoare triple {30843#(<= bAnd_~i~0 5)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30843#(<= bAnd_~i~0 5)} is VALID [2018-11-23 12:26:40,133 INFO L273 TraceCheckUtils]: 172: Hoare triple {30843#(<= bAnd_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30850#(<= bAnd_~i~0 6)} is VALID [2018-11-23 12:26:40,133 INFO L273 TraceCheckUtils]: 173: Hoare triple {30850#(<= bAnd_~i~0 6)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30850#(<= bAnd_~i~0 6)} is VALID [2018-11-23 12:26:40,134 INFO L273 TraceCheckUtils]: 174: Hoare triple {30850#(<= bAnd_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30857#(<= bAnd_~i~0 7)} is VALID [2018-11-23 12:26:40,135 INFO L273 TraceCheckUtils]: 175: Hoare triple {30857#(<= bAnd_~i~0 7)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30857#(<= bAnd_~i~0 7)} is VALID [2018-11-23 12:26:40,135 INFO L273 TraceCheckUtils]: 176: Hoare triple {30857#(<= bAnd_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30864#(<= bAnd_~i~0 8)} is VALID [2018-11-23 12:26:40,136 INFO L273 TraceCheckUtils]: 177: Hoare triple {30864#(<= bAnd_~i~0 8)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30864#(<= bAnd_~i~0 8)} is VALID [2018-11-23 12:26:40,136 INFO L273 TraceCheckUtils]: 178: Hoare triple {30864#(<= bAnd_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30871#(<= bAnd_~i~0 9)} is VALID [2018-11-23 12:26:40,137 INFO L273 TraceCheckUtils]: 179: Hoare triple {30871#(<= bAnd_~i~0 9)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30871#(<= bAnd_~i~0 9)} is VALID [2018-11-23 12:26:40,138 INFO L273 TraceCheckUtils]: 180: Hoare triple {30871#(<= bAnd_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30878#(<= bAnd_~i~0 10)} is VALID [2018-11-23 12:26:40,138 INFO L273 TraceCheckUtils]: 181: Hoare triple {30878#(<= bAnd_~i~0 10)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30878#(<= bAnd_~i~0 10)} is VALID [2018-11-23 12:26:40,139 INFO L273 TraceCheckUtils]: 182: Hoare triple {30878#(<= bAnd_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30885#(<= bAnd_~i~0 11)} is VALID [2018-11-23 12:26:40,139 INFO L273 TraceCheckUtils]: 183: Hoare triple {30885#(<= bAnd_~i~0 11)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {30885#(<= bAnd_~i~0 11)} is VALID [2018-11-23 12:26:40,140 INFO L273 TraceCheckUtils]: 184: Hoare triple {30885#(<= bAnd_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30892#(<= bAnd_~i~0 12)} is VALID [2018-11-23 12:26:40,140 INFO L273 TraceCheckUtils]: 185: Hoare triple {30892#(<= bAnd_~i~0 12)} assume !(~i~0 < 100); {30288#false} is VALID [2018-11-23 12:26:40,141 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:26:40,141 INFO L273 TraceCheckUtils]: 187: Hoare triple {30288#false} assume true; {30288#false} is VALID [2018-11-23 12:26:40,141 INFO L268 TraceCheckUtils]: 188: Hoare quadruple {30288#false} {30287#true} #74#return; {30288#false} is VALID [2018-11-23 12:26:40,141 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:26:40,141 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:26:40,141 INFO L273 TraceCheckUtils]: 191: Hoare triple {30288#false} assume !false; {30288#false} is VALID [2018-11-23 12:26:40,156 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:26:40,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:40,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 14] total 51 [2018-11-23 12:26:40,176 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 192 [2018-11-23 12:26:40,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:40,177 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states. [2018-11-23 12:26:40,304 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:26:40,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-23 12:26:40,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-23 12:26:40,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=831, Invalid=1719, Unknown=0, NotChecked=0, Total=2550 [2018-11-23 12:26:40,306 INFO L87 Difference]: Start difference. First operand 139 states and 143 transitions. Second operand 51 states. [2018-11-23 12:26:41,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:41,819 INFO L93 Difference]: Finished difference Result 205 states and 217 transitions. [2018-11-23 12:26:41,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-23 12:26:41,819 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 192 [2018-11-23 12:26:41,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:41,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:26:41,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 154 transitions. [2018-11-23 12:26:41,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:26:41,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 154 transitions. [2018-11-23 12:26:41,822 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states and 154 transitions. [2018-11-23 12:26:42,005 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:26:42,007 INFO L225 Difference]: With dead ends: 205 [2018-11-23 12:26:42,008 INFO L226 Difference]: Without dead ends: 145 [2018-11-23 12:26:42,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=831, Invalid=1719, Unknown=0, NotChecked=0, Total=2550 [2018-11-23 12:26:42,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-11-23 12:26:42,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2018-11-23 12:26:42,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:42,142 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand 143 states. [2018-11-23 12:26:42,142 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand 143 states. [2018-11-23 12:26:42,142 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 143 states. [2018-11-23 12:26:42,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:42,144 INFO L93 Difference]: Finished difference Result 145 states and 149 transitions. [2018-11-23 12:26:42,144 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2018-11-23 12:26:42,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:42,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:42,144 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand 145 states. [2018-11-23 12:26:42,144 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 145 states. [2018-11-23 12:26:42,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:42,146 INFO L93 Difference]: Finished difference Result 145 states and 149 transitions. [2018-11-23 12:26:42,146 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2018-11-23 12:26:42,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:42,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:42,147 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:42,147 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:42,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-23 12:26:42,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 147 transitions. [2018-11-23 12:26:42,149 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 147 transitions. Word has length 192 [2018-11-23 12:26:42,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:42,149 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 147 transitions. [2018-11-23 12:26:42,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-23 12:26:42,149 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 147 transitions. [2018-11-23 12:26:42,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-11-23 12:26:42,150 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:42,150 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:26:42,150 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:42,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:42,150 INFO L82 PathProgramCache]: Analyzing trace with hash 2105744263, now seen corresponding path program 37 times [2018-11-23 12:26:42,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:42,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:42,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:42,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:42,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:42,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:42,989 INFO L256 TraceCheckUtils]: 0: Hoare triple {31721#true} call ULTIMATE.init(); {31721#true} is VALID [2018-11-23 12:26:42,989 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:26:42,990 INFO L273 TraceCheckUtils]: 2: Hoare triple {31721#true} assume true; {31721#true} is VALID [2018-11-23 12:26:42,990 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31721#true} {31721#true} #66#return; {31721#true} is VALID [2018-11-23 12:26:42,990 INFO L256 TraceCheckUtils]: 4: Hoare triple {31721#true} call #t~ret13 := main(); {31721#true} is VALID [2018-11-23 12:26:42,990 INFO L273 TraceCheckUtils]: 5: Hoare triple {31721#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:26:42,991 INFO L273 TraceCheckUtils]: 6: Hoare triple {31723#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:26:42,992 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:26:42,992 INFO L273 TraceCheckUtils]: 8: Hoare triple {31724#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:26:42,993 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:26:42,993 INFO L273 TraceCheckUtils]: 10: Hoare triple {31725#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:26:42,993 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:26:42,994 INFO L273 TraceCheckUtils]: 12: Hoare triple {31726#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -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:26:42,994 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:26:42,994 INFO L273 TraceCheckUtils]: 14: Hoare triple {31727#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -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:26:42,995 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:26:42,996 INFO L273 TraceCheckUtils]: 16: Hoare triple {31728#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -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:26:42,996 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:26:42,997 INFO L273 TraceCheckUtils]: 18: Hoare triple {31729#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -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:26:42,997 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:26:42,998 INFO L273 TraceCheckUtils]: 20: Hoare triple {31730#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -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:26:42,998 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:26:42,999 INFO L273 TraceCheckUtils]: 22: Hoare triple {31731#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -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:26:43,000 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:26:43,000 INFO L273 TraceCheckUtils]: 24: Hoare triple {31732#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -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:26:43,001 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:26:43,001 INFO L273 TraceCheckUtils]: 26: Hoare triple {31733#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -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:26:43,002 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:26:43,002 INFO L273 TraceCheckUtils]: 28: Hoare triple {31734#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -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:26:43,003 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:26:43,004 INFO L273 TraceCheckUtils]: 30: Hoare triple {31735#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -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:26:43,004 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:26:43,005 INFO L273 TraceCheckUtils]: 32: Hoare triple {31736#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -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:26:43,005 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:26:43,006 INFO L273 TraceCheckUtils]: 34: Hoare triple {31737#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -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:26:43,007 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:26:43,007 INFO L273 TraceCheckUtils]: 36: Hoare triple {31738#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -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:26:43,008 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:26:43,008 INFO L273 TraceCheckUtils]: 38: Hoare triple {31739#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -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:26:43,009 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:26:43,009 INFO L273 TraceCheckUtils]: 40: Hoare triple {31740#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -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:26:43,010 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:26:43,011 INFO L273 TraceCheckUtils]: 42: Hoare triple {31741#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -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:26:43,011 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:26:43,012 INFO L273 TraceCheckUtils]: 44: Hoare triple {31742#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -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:26:43,012 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:26:43,013 INFO L273 TraceCheckUtils]: 46: Hoare triple {31743#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -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:26:43,014 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:26:43,014 INFO L273 TraceCheckUtils]: 48: Hoare triple {31744#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -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:26:43,015 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:26:43,015 INFO L273 TraceCheckUtils]: 50: Hoare triple {31745#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -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:26:43,016 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:26:43,016 INFO L273 TraceCheckUtils]: 52: Hoare triple {31746#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -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:26:43,017 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:26:43,017 INFO L273 TraceCheckUtils]: 54: Hoare triple {31747#(<= main_~i~1 24)} assume !!(~i~1 < 100);assume -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:26:43,018 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:26:43,019 INFO L273 TraceCheckUtils]: 56: Hoare triple {31748#(<= main_~i~1 25)} assume !!(~i~1 < 100);assume -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:26:43,019 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:26:43,020 INFO L273 TraceCheckUtils]: 58: Hoare triple {31749#(<= main_~i~1 26)} assume !!(~i~1 < 100);assume -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:26:43,020 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:26:43,021 INFO L273 TraceCheckUtils]: 60: Hoare triple {31750#(<= main_~i~1 27)} assume !!(~i~1 < 100);assume -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:26:43,022 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:26:43,022 INFO L273 TraceCheckUtils]: 62: Hoare triple {31751#(<= main_~i~1 28)} assume !!(~i~1 < 100);assume -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:26:43,023 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:26:43,023 INFO L273 TraceCheckUtils]: 64: Hoare triple {31752#(<= main_~i~1 29)} assume !!(~i~1 < 100);assume -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:26:43,024 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:26:43,024 INFO L273 TraceCheckUtils]: 66: Hoare triple {31753#(<= main_~i~1 30)} assume !!(~i~1 < 100);assume -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:26:43,025 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:26:43,026 INFO L273 TraceCheckUtils]: 68: Hoare triple {31754#(<= main_~i~1 31)} assume !!(~i~1 < 100);assume -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:26:43,026 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:26:43,027 INFO L273 TraceCheckUtils]: 70: Hoare triple {31755#(<= main_~i~1 32)} assume !!(~i~1 < 100);assume -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:26:43,027 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:26:43,028 INFO L273 TraceCheckUtils]: 72: Hoare triple {31756#(<= main_~i~1 33)} assume !!(~i~1 < 100);assume -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:26:43,028 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:26:43,029 INFO L273 TraceCheckUtils]: 74: Hoare triple {31757#(<= main_~i~1 34)} assume !!(~i~1 < 100);assume -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:26:43,030 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:26:43,030 INFO L273 TraceCheckUtils]: 76: Hoare triple {31758#(<= main_~i~1 35)} assume !!(~i~1 < 100);assume -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:26:43,031 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:26:43,031 INFO L273 TraceCheckUtils]: 78: Hoare triple {31759#(<= main_~i~1 36)} assume !!(~i~1 < 100);assume -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:26:43,032 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:26:43,033 INFO L273 TraceCheckUtils]: 80: Hoare triple {31760#(<= main_~i~1 37)} assume !(~i~1 < 100); {31722#false} is VALID [2018-11-23 12:26:43,033 INFO L256 TraceCheckUtils]: 81: Hoare triple {31722#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {31721#true} is VALID [2018-11-23 12:26:43,033 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:26:43,033 INFO L273 TraceCheckUtils]: 83: Hoare triple {31721#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:26:43,033 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:26:43,033 INFO L273 TraceCheckUtils]: 85: Hoare triple {31721#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:26:43,034 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:26:43,034 INFO L273 TraceCheckUtils]: 87: Hoare triple {31721#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:26:43,034 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:26:43,034 INFO L273 TraceCheckUtils]: 89: Hoare triple {31721#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:26:43,034 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:26:43,034 INFO L273 TraceCheckUtils]: 91: Hoare triple {31721#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:26:43,035 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:26:43,035 INFO L273 TraceCheckUtils]: 93: Hoare triple {31721#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:26:43,035 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:26:43,035 INFO L273 TraceCheckUtils]: 95: Hoare triple {31721#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:26:43,035 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:26:43,035 INFO L273 TraceCheckUtils]: 97: Hoare triple {31721#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:26:43,036 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:26:43,036 INFO L273 TraceCheckUtils]: 99: Hoare triple {31721#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:26:43,036 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:26:43,036 INFO L273 TraceCheckUtils]: 101: Hoare triple {31721#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:26:43,036 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:26:43,036 INFO L273 TraceCheckUtils]: 103: Hoare triple {31721#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:26:43,037 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:26:43,037 INFO L273 TraceCheckUtils]: 105: Hoare triple {31721#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:26:43,037 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:26:43,037 INFO L273 TraceCheckUtils]: 107: Hoare triple {31721#true} assume !(~i~0 < 100); {31721#true} is VALID [2018-11-23 12:26:43,037 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:26:43,037 INFO L273 TraceCheckUtils]: 109: Hoare triple {31721#true} assume true; {31721#true} is VALID [2018-11-23 12:26:43,037 INFO L268 TraceCheckUtils]: 110: Hoare quadruple {31721#true} {31722#false} #70#return; {31722#false} is VALID [2018-11-23 12:26:43,037 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:26:43,037 INFO L256 TraceCheckUtils]: 112: Hoare triple {31722#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {31721#true} is VALID [2018-11-23 12:26:43,038 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:26:43,038 INFO L273 TraceCheckUtils]: 114: Hoare triple {31721#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:26:43,038 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:26:43,038 INFO L273 TraceCheckUtils]: 116: Hoare triple {31721#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:26:43,038 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:26:43,038 INFO L273 TraceCheckUtils]: 118: Hoare triple {31721#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:26:43,038 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:26:43,038 INFO L273 TraceCheckUtils]: 120: Hoare triple {31721#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:26:43,038 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:26:43,038 INFO L273 TraceCheckUtils]: 122: Hoare triple {31721#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:26:43,039 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:26:43,039 INFO L273 TraceCheckUtils]: 124: Hoare triple {31721#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:26:43,039 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:26:43,039 INFO L273 TraceCheckUtils]: 126: Hoare triple {31721#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:26:43,039 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:26:43,039 INFO L273 TraceCheckUtils]: 128: Hoare triple {31721#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:26:43,039 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:26:43,039 INFO L273 TraceCheckUtils]: 130: Hoare triple {31721#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:26:43,039 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:26:43,040 INFO L273 TraceCheckUtils]: 132: Hoare triple {31721#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:26:43,040 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:26:43,040 INFO L273 TraceCheckUtils]: 134: Hoare triple {31721#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:26:43,040 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:26:43,040 INFO L273 TraceCheckUtils]: 136: Hoare triple {31721#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:26:43,040 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:26:43,040 INFO L273 TraceCheckUtils]: 138: Hoare triple {31721#true} assume !(~i~0 < 100); {31721#true} is VALID [2018-11-23 12:26:43,040 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:26:43,040 INFO L273 TraceCheckUtils]: 140: Hoare triple {31721#true} assume true; {31721#true} is VALID [2018-11-23 12:26:43,040 INFO L268 TraceCheckUtils]: 141: Hoare quadruple {31721#true} {31722#false} #72#return; {31722#false} is VALID [2018-11-23 12:26:43,041 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:26:43,041 INFO L273 TraceCheckUtils]: 143: Hoare triple {31722#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:43,041 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:26:43,041 INFO L273 TraceCheckUtils]: 145: Hoare triple {31722#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:43,041 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:26:43,041 INFO L273 TraceCheckUtils]: 147: Hoare triple {31722#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:43,041 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:26:43,041 INFO L273 TraceCheckUtils]: 149: Hoare triple {31722#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:43,041 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:26:43,041 INFO L273 TraceCheckUtils]: 151: Hoare triple {31722#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:43,042 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:26:43,042 INFO L273 TraceCheckUtils]: 153: Hoare triple {31722#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:43,042 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:26:43,042 INFO L273 TraceCheckUtils]: 155: Hoare triple {31722#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:43,042 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:26:43,042 INFO L273 TraceCheckUtils]: 157: Hoare triple {31722#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:43,042 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:26:43,042 INFO L273 TraceCheckUtils]: 159: Hoare triple {31722#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:43,042 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:26:43,042 INFO L273 TraceCheckUtils]: 161: Hoare triple {31722#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:43,043 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:26:43,043 INFO L273 TraceCheckUtils]: 163: Hoare triple {31722#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:43,043 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:26:43,043 INFO L273 TraceCheckUtils]: 165: Hoare triple {31722#false} assume !(~i~2 < 99); {31722#false} is VALID [2018-11-23 12:26:43,043 INFO L273 TraceCheckUtils]: 166: Hoare triple {31722#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {31722#false} is VALID [2018-11-23 12:26:43,043 INFO L256 TraceCheckUtils]: 167: Hoare triple {31722#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {31721#true} is VALID [2018-11-23 12:26:43,043 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:26:43,043 INFO L273 TraceCheckUtils]: 169: Hoare triple {31721#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:26:43,043 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:26:43,043 INFO L273 TraceCheckUtils]: 171: Hoare triple {31721#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:26:43,044 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:26:43,044 INFO L273 TraceCheckUtils]: 173: Hoare triple {31721#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:26:43,044 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:26:43,044 INFO L273 TraceCheckUtils]: 175: Hoare triple {31721#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:26:43,044 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:26:43,044 INFO L273 TraceCheckUtils]: 177: Hoare triple {31721#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:26:43,044 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:26:43,044 INFO L273 TraceCheckUtils]: 179: Hoare triple {31721#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:26:43,044 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:26:43,044 INFO L273 TraceCheckUtils]: 181: Hoare triple {31721#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:26:43,045 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:26:43,045 INFO L273 TraceCheckUtils]: 183: Hoare triple {31721#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:26:43,045 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:26:43,045 INFO L273 TraceCheckUtils]: 185: Hoare triple {31721#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:26:43,045 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:26:43,045 INFO L273 TraceCheckUtils]: 187: Hoare triple {31721#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:26:43,045 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:26:43,045 INFO L273 TraceCheckUtils]: 189: Hoare triple {31721#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:26:43,045 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:26:43,045 INFO L273 TraceCheckUtils]: 191: Hoare triple {31721#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31721#true} is VALID [2018-11-23 12:26:43,046 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:26:43,046 INFO L273 TraceCheckUtils]: 193: Hoare triple {31721#true} assume !(~i~0 < 100); {31721#true} is VALID [2018-11-23 12:26:43,046 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:26:43,046 INFO L273 TraceCheckUtils]: 195: Hoare triple {31721#true} assume true; {31721#true} is VALID [2018-11-23 12:26:43,046 INFO L268 TraceCheckUtils]: 196: Hoare quadruple {31721#true} {31722#false} #74#return; {31722#false} is VALID [2018-11-23 12:26:43,046 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:26:43,046 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:26:43,046 INFO L273 TraceCheckUtils]: 199: Hoare triple {31722#false} assume !false; {31722#false} is VALID [2018-11-23 12:26:43,063 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:26:43,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:43,064 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:26:43,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:26:43,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:43,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:43,464 INFO L256 TraceCheckUtils]: 0: Hoare triple {31721#true} call ULTIMATE.init(); {31721#true} is VALID [2018-11-23 12:26:43,465 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:26:43,465 INFO L273 TraceCheckUtils]: 2: Hoare triple {31721#true} assume true; {31721#true} is VALID [2018-11-23 12:26:43,465 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31721#true} {31721#true} #66#return; {31721#true} is VALID [2018-11-23 12:26:43,465 INFO L256 TraceCheckUtils]: 4: Hoare triple {31721#true} call #t~ret13 := main(); {31721#true} is VALID [2018-11-23 12:26:43,466 INFO L273 TraceCheckUtils]: 5: Hoare triple {31721#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:26:43,467 INFO L273 TraceCheckUtils]: 6: Hoare triple {31779#(<= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:26:43,467 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:26:43,467 INFO L273 TraceCheckUtils]: 8: Hoare triple {31724#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:26:43,468 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:26:43,468 INFO L273 TraceCheckUtils]: 10: Hoare triple {31725#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:26:43,468 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:26:43,469 INFO L273 TraceCheckUtils]: 12: Hoare triple {31726#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -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:26:43,470 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:26:43,470 INFO L273 TraceCheckUtils]: 14: Hoare triple {31727#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -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:26:43,471 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:26:43,471 INFO L273 TraceCheckUtils]: 16: Hoare triple {31728#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -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:26:43,472 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:26:43,472 INFO L273 TraceCheckUtils]: 18: Hoare triple {31729#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -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:26:43,473 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:26:43,474 INFO L273 TraceCheckUtils]: 20: Hoare triple {31730#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -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:26:43,474 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:26:43,475 INFO L273 TraceCheckUtils]: 22: Hoare triple {31731#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -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:26:43,475 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:26:43,476 INFO L273 TraceCheckUtils]: 24: Hoare triple {31732#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -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:26:43,477 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:26:43,477 INFO L273 TraceCheckUtils]: 26: Hoare triple {31733#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -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:26:43,478 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:26:43,478 INFO L273 TraceCheckUtils]: 28: Hoare triple {31734#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -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:26:43,479 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:26:43,479 INFO L273 TraceCheckUtils]: 30: Hoare triple {31735#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -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:26:43,480 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:26:43,480 INFO L273 TraceCheckUtils]: 32: Hoare triple {31736#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -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:26:43,481 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:26:43,482 INFO L273 TraceCheckUtils]: 34: Hoare triple {31737#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -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:26:43,482 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:26:43,483 INFO L273 TraceCheckUtils]: 36: Hoare triple {31738#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -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:26:43,483 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:26:43,484 INFO L273 TraceCheckUtils]: 38: Hoare triple {31739#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -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:26:43,485 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:26:43,485 INFO L273 TraceCheckUtils]: 40: Hoare triple {31740#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -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:26:43,486 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:26:43,486 INFO L273 TraceCheckUtils]: 42: Hoare triple {31741#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -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:26:43,487 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:26:43,487 INFO L273 TraceCheckUtils]: 44: Hoare triple {31742#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -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:26:43,488 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:26:43,488 INFO L273 TraceCheckUtils]: 46: Hoare triple {31743#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -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:26:43,489 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:26:43,490 INFO L273 TraceCheckUtils]: 48: Hoare triple {31744#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -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:26:43,490 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:26:43,491 INFO L273 TraceCheckUtils]: 50: Hoare triple {31745#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -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:26:43,491 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:26:43,492 INFO L273 TraceCheckUtils]: 52: Hoare triple {31746#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -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:26:43,493 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:26:43,493 INFO L273 TraceCheckUtils]: 54: Hoare triple {31747#(<= main_~i~1 24)} assume !!(~i~1 < 100);assume -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:26:43,494 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:26:43,494 INFO L273 TraceCheckUtils]: 56: Hoare triple {31748#(<= main_~i~1 25)} assume !!(~i~1 < 100);assume -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:26:43,495 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:26:43,495 INFO L273 TraceCheckUtils]: 58: Hoare triple {31749#(<= main_~i~1 26)} assume !!(~i~1 < 100);assume -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:26:43,496 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:26:43,497 INFO L273 TraceCheckUtils]: 60: Hoare triple {31750#(<= main_~i~1 27)} assume !!(~i~1 < 100);assume -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:26:43,497 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:26:43,498 INFO L273 TraceCheckUtils]: 62: Hoare triple {31751#(<= main_~i~1 28)} assume !!(~i~1 < 100);assume -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:26:43,498 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:26:43,499 INFO L273 TraceCheckUtils]: 64: Hoare triple {31752#(<= main_~i~1 29)} assume !!(~i~1 < 100);assume -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:26:43,500 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:26:43,500 INFO L273 TraceCheckUtils]: 66: Hoare triple {31753#(<= main_~i~1 30)} assume !!(~i~1 < 100);assume -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:26:43,501 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:26:43,501 INFO L273 TraceCheckUtils]: 68: Hoare triple {31754#(<= main_~i~1 31)} assume !!(~i~1 < 100);assume -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:26:43,502 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:26:43,502 INFO L273 TraceCheckUtils]: 70: Hoare triple {31755#(<= main_~i~1 32)} assume !!(~i~1 < 100);assume -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:26:43,503 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:26:43,503 INFO L273 TraceCheckUtils]: 72: Hoare triple {31756#(<= main_~i~1 33)} assume !!(~i~1 < 100);assume -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:26:43,504 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:26:43,505 INFO L273 TraceCheckUtils]: 74: Hoare triple {31757#(<= main_~i~1 34)} assume !!(~i~1 < 100);assume -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:26:43,505 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:26:43,506 INFO L273 TraceCheckUtils]: 76: Hoare triple {31758#(<= main_~i~1 35)} assume !!(~i~1 < 100);assume -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:26:43,506 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:26:43,507 INFO L273 TraceCheckUtils]: 78: Hoare triple {31759#(<= main_~i~1 36)} assume !!(~i~1 < 100);assume -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:26:43,508 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:26:43,508 INFO L273 TraceCheckUtils]: 80: Hoare triple {31760#(<= main_~i~1 37)} assume !(~i~1 < 100); {31722#false} is VALID [2018-11-23 12:26:43,508 INFO L256 TraceCheckUtils]: 81: Hoare triple {31722#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {31722#false} is VALID [2018-11-23 12:26:43,509 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:26:43,509 INFO L273 TraceCheckUtils]: 83: Hoare triple {31722#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:26:43,509 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:26:43,509 INFO L273 TraceCheckUtils]: 85: Hoare triple {31722#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:26:43,509 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:26:43,509 INFO L273 TraceCheckUtils]: 87: Hoare triple {31722#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:26:43,510 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:26:43,510 INFO L273 TraceCheckUtils]: 89: Hoare triple {31722#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:26:43,510 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:26:43,510 INFO L273 TraceCheckUtils]: 91: Hoare triple {31722#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:26:43,510 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:26:43,510 INFO L273 TraceCheckUtils]: 93: Hoare triple {31722#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:26:43,511 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:26:43,511 INFO L273 TraceCheckUtils]: 95: Hoare triple {31722#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:26:43,511 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:26:43,511 INFO L273 TraceCheckUtils]: 97: Hoare triple {31722#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:26:43,511 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:26:43,511 INFO L273 TraceCheckUtils]: 99: Hoare triple {31722#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:26:43,511 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:26:43,512 INFO L273 TraceCheckUtils]: 101: Hoare triple {31722#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:26:43,512 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:26:43,512 INFO L273 TraceCheckUtils]: 103: Hoare triple {31722#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:26:43,512 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:26:43,512 INFO L273 TraceCheckUtils]: 105: Hoare triple {31722#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:26:43,512 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:26:43,513 INFO L273 TraceCheckUtils]: 107: Hoare triple {31722#false} assume !(~i~0 < 100); {31722#false} is VALID [2018-11-23 12:26:43,513 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:26:43,513 INFO L273 TraceCheckUtils]: 109: Hoare triple {31722#false} assume true; {31722#false} is VALID [2018-11-23 12:26:43,513 INFO L268 TraceCheckUtils]: 110: Hoare quadruple {31722#false} {31722#false} #70#return; {31722#false} is VALID [2018-11-23 12:26:43,513 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:26:43,513 INFO L256 TraceCheckUtils]: 112: Hoare triple {31722#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {31722#false} is VALID [2018-11-23 12:26:43,513 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:26:43,513 INFO L273 TraceCheckUtils]: 114: Hoare triple {31722#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:26:43,513 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:26:43,514 INFO L273 TraceCheckUtils]: 116: Hoare triple {31722#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:26:43,514 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:26:43,514 INFO L273 TraceCheckUtils]: 118: Hoare triple {31722#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:26:43,514 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:26:43,514 INFO L273 TraceCheckUtils]: 120: Hoare triple {31722#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:26:43,514 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:26:43,514 INFO L273 TraceCheckUtils]: 122: Hoare triple {31722#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:26:43,514 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:26:43,514 INFO L273 TraceCheckUtils]: 124: Hoare triple {31722#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:26:43,514 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:26:43,515 INFO L273 TraceCheckUtils]: 126: Hoare triple {31722#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:26:43,515 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:26:43,515 INFO L273 TraceCheckUtils]: 128: Hoare triple {31722#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:26:43,515 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:26:43,515 INFO L273 TraceCheckUtils]: 130: Hoare triple {31722#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:26:43,515 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:26:43,515 INFO L273 TraceCheckUtils]: 132: Hoare triple {31722#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:26:43,515 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:26:43,515 INFO L273 TraceCheckUtils]: 134: Hoare triple {31722#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:26:43,515 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:26:43,516 INFO L273 TraceCheckUtils]: 136: Hoare triple {31722#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:26:43,516 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:26:43,516 INFO L273 TraceCheckUtils]: 138: Hoare triple {31722#false} assume !(~i~0 < 100); {31722#false} is VALID [2018-11-23 12:26:43,516 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:26:43,516 INFO L273 TraceCheckUtils]: 140: Hoare triple {31722#false} assume true; {31722#false} is VALID [2018-11-23 12:26:43,516 INFO L268 TraceCheckUtils]: 141: Hoare quadruple {31722#false} {31722#false} #72#return; {31722#false} is VALID [2018-11-23 12:26:43,516 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:26:43,516 INFO L273 TraceCheckUtils]: 143: Hoare triple {31722#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:43,516 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:26:43,516 INFO L273 TraceCheckUtils]: 145: Hoare triple {31722#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:43,517 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:26:43,517 INFO L273 TraceCheckUtils]: 147: Hoare triple {31722#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:43,517 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:26:43,517 INFO L273 TraceCheckUtils]: 149: Hoare triple {31722#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:43,517 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:26:43,517 INFO L273 TraceCheckUtils]: 151: Hoare triple {31722#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:43,517 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:26:43,517 INFO L273 TraceCheckUtils]: 153: Hoare triple {31722#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:43,517 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:26:43,517 INFO L273 TraceCheckUtils]: 155: Hoare triple {31722#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:43,518 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:26:43,518 INFO L273 TraceCheckUtils]: 157: Hoare triple {31722#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:43,518 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:26:43,518 INFO L273 TraceCheckUtils]: 159: Hoare triple {31722#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:43,518 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:26:43,518 INFO L273 TraceCheckUtils]: 161: Hoare triple {31722#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:43,518 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:26:43,518 INFO L273 TraceCheckUtils]: 163: Hoare triple {31722#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:43,518 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:26:43,518 INFO L273 TraceCheckUtils]: 165: Hoare triple {31722#false} assume !(~i~2 < 99); {31722#false} is VALID [2018-11-23 12:26:43,519 INFO L273 TraceCheckUtils]: 166: Hoare triple {31722#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {31722#false} is VALID [2018-11-23 12:26:43,519 INFO L256 TraceCheckUtils]: 167: Hoare triple {31722#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {31722#false} is VALID [2018-11-23 12:26:43,519 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:26:43,519 INFO L273 TraceCheckUtils]: 169: Hoare triple {31722#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:26:43,519 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:26:43,519 INFO L273 TraceCheckUtils]: 171: Hoare triple {31722#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:26:43,519 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:26:43,519 INFO L273 TraceCheckUtils]: 173: Hoare triple {31722#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:26:43,519 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:26:43,519 INFO L273 TraceCheckUtils]: 175: Hoare triple {31722#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:26:43,520 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:26:43,520 INFO L273 TraceCheckUtils]: 177: Hoare triple {31722#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:26:43,520 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:26:43,520 INFO L273 TraceCheckUtils]: 179: Hoare triple {31722#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:26:43,520 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:26:43,520 INFO L273 TraceCheckUtils]: 181: Hoare triple {31722#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:26:43,520 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:26:43,520 INFO L273 TraceCheckUtils]: 183: Hoare triple {31722#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:26:43,520 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:26:43,520 INFO L273 TraceCheckUtils]: 185: Hoare triple {31722#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:26:43,521 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:26:43,521 INFO L273 TraceCheckUtils]: 187: Hoare triple {31722#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:26:43,521 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:26:43,521 INFO L273 TraceCheckUtils]: 189: Hoare triple {31722#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:26:43,521 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:26:43,521 INFO L273 TraceCheckUtils]: 191: Hoare triple {31722#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {31722#false} is VALID [2018-11-23 12:26:43,521 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:26:43,521 INFO L273 TraceCheckUtils]: 193: Hoare triple {31722#false} assume !(~i~0 < 100); {31722#false} is VALID [2018-11-23 12:26:43,521 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:26:43,521 INFO L273 TraceCheckUtils]: 195: Hoare triple {31722#false} assume true; {31722#false} is VALID [2018-11-23 12:26:43,521 INFO L268 TraceCheckUtils]: 196: Hoare quadruple {31722#false} {31722#false} #74#return; {31722#false} is VALID [2018-11-23 12:26:43,522 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:26:43,522 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:26:43,522 INFO L273 TraceCheckUtils]: 199: Hoare triple {31722#false} assume !false; {31722#false} is VALID [2018-11-23 12:26:43,539 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:26:43,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:43,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2018-11-23 12:26:43,559 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 200 [2018-11-23 12:26:43,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:43,560 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states. [2018-11-23 12:26:43,672 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:43,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-23 12:26:43,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-23 12:26:43,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 12:26:43,674 INFO L87 Difference]: Start difference. First operand 143 states and 147 transitions. Second operand 41 states. [2018-11-23 12:26:44,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:44,250 INFO L93 Difference]: Finished difference Result 208 states and 216 transitions. [2018-11-23 12:26:44,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-23 12:26:44,250 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 200 [2018-11-23 12:26:44,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:44,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:26:44,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 128 transitions. [2018-11-23 12:26:44,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:26:44,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 128 transitions. [2018-11-23 12:26:44,252 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 128 transitions. [2018-11-23 12:26:44,379 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:26:44,381 INFO L225 Difference]: With dead ends: 208 [2018-11-23 12:26:44,381 INFO L226 Difference]: Without dead ends: 146 [2018-11-23 12:26:44,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 12:26:44,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-23 12:26:44,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2018-11-23 12:26:44,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:44,437 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand 145 states. [2018-11-23 12:26:44,437 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 145 states. [2018-11-23 12:26:44,437 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 145 states. [2018-11-23 12:26:44,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:44,440 INFO L93 Difference]: Finished difference Result 146 states and 150 transitions. [2018-11-23 12:26:44,440 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 150 transitions. [2018-11-23 12:26:44,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:44,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:44,440 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand 146 states. [2018-11-23 12:26:44,440 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 146 states. [2018-11-23 12:26:44,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:44,442 INFO L93 Difference]: Finished difference Result 146 states and 150 transitions. [2018-11-23 12:26:44,442 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 150 transitions. [2018-11-23 12:26:44,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:44,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:44,443 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:44,443 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:44,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-23 12:26:44,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 149 transitions. [2018-11-23 12:26:44,445 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 149 transitions. Word has length 200 [2018-11-23 12:26:44,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:44,445 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 149 transitions. [2018-11-23 12:26:44,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-23 12:26:44,445 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2018-11-23 12:26:44,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-23 12:26:44,446 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:44,446 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:26:44,446 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:44,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:44,446 INFO L82 PathProgramCache]: Analyzing trace with hash -283013655, now seen corresponding path program 38 times [2018-11-23 12:26:44,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:44,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:44,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:44,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:26:44,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:44,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:45,295 INFO L256 TraceCheckUtils]: 0: Hoare triple {33179#true} call ULTIMATE.init(); {33179#true} is VALID [2018-11-23 12:26:45,295 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:26:45,295 INFO L273 TraceCheckUtils]: 2: Hoare triple {33179#true} assume true; {33179#true} is VALID [2018-11-23 12:26:45,295 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33179#true} {33179#true} #66#return; {33179#true} is VALID [2018-11-23 12:26:45,296 INFO L256 TraceCheckUtils]: 4: Hoare triple {33179#true} call #t~ret13 := main(); {33179#true} is VALID [2018-11-23 12:26:45,296 INFO L273 TraceCheckUtils]: 5: Hoare triple {33179#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:26:45,297 INFO L273 TraceCheckUtils]: 6: Hoare triple {33181#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:26:45,297 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:26:45,297 INFO L273 TraceCheckUtils]: 8: Hoare triple {33182#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:26:45,298 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:26:45,298 INFO L273 TraceCheckUtils]: 10: Hoare triple {33183#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:26:45,299 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:26:45,299 INFO L273 TraceCheckUtils]: 12: Hoare triple {33184#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -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:26:45,300 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:26:45,300 INFO L273 TraceCheckUtils]: 14: Hoare triple {33185#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -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:26:45,301 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:26:45,301 INFO L273 TraceCheckUtils]: 16: Hoare triple {33186#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -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:26:45,302 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:26:45,302 INFO L273 TraceCheckUtils]: 18: Hoare triple {33187#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -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:26:45,303 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:26:45,303 INFO L273 TraceCheckUtils]: 20: Hoare triple {33188#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -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:26:45,304 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:26:45,305 INFO L273 TraceCheckUtils]: 22: Hoare triple {33189#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -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:26:45,305 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:26:45,306 INFO L273 TraceCheckUtils]: 24: Hoare triple {33190#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -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:26:45,306 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:26:45,307 INFO L273 TraceCheckUtils]: 26: Hoare triple {33191#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -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:26:45,308 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:26:45,308 INFO L273 TraceCheckUtils]: 28: Hoare triple {33192#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -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:26:45,309 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:26:45,309 INFO L273 TraceCheckUtils]: 30: Hoare triple {33193#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -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:26:45,310 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:26:45,310 INFO L273 TraceCheckUtils]: 32: Hoare triple {33194#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -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:26:45,311 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:26:45,312 INFO L273 TraceCheckUtils]: 34: Hoare triple {33195#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -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:26:45,312 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:26:45,313 INFO L273 TraceCheckUtils]: 36: Hoare triple {33196#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -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:26:45,313 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:26:45,314 INFO L273 TraceCheckUtils]: 38: Hoare triple {33197#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -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:26:45,315 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:26:45,315 INFO L273 TraceCheckUtils]: 40: Hoare triple {33198#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -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:26:45,316 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:26:45,316 INFO L273 TraceCheckUtils]: 42: Hoare triple {33199#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -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:26:45,317 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:26:45,317 INFO L273 TraceCheckUtils]: 44: Hoare triple {33200#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -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:26:45,318 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:26:45,318 INFO L273 TraceCheckUtils]: 46: Hoare triple {33201#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -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:26:45,319 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:26:45,320 INFO L273 TraceCheckUtils]: 48: Hoare triple {33202#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -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:26:45,320 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:26:45,321 INFO L273 TraceCheckUtils]: 50: Hoare triple {33203#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -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:26:45,321 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:26:45,322 INFO L273 TraceCheckUtils]: 52: Hoare triple {33204#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -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:26:45,323 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:26:45,323 INFO L273 TraceCheckUtils]: 54: Hoare triple {33205#(<= main_~i~1 24)} assume !!(~i~1 < 100);assume -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:26:45,324 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:26:45,324 INFO L273 TraceCheckUtils]: 56: Hoare triple {33206#(<= main_~i~1 25)} assume !!(~i~1 < 100);assume -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:26:45,325 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:26:45,325 INFO L273 TraceCheckUtils]: 58: Hoare triple {33207#(<= main_~i~1 26)} assume !!(~i~1 < 100);assume -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:26:45,326 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:26:45,327 INFO L273 TraceCheckUtils]: 60: Hoare triple {33208#(<= main_~i~1 27)} assume !!(~i~1 < 100);assume -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:26:45,327 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:26:45,328 INFO L273 TraceCheckUtils]: 62: Hoare triple {33209#(<= main_~i~1 28)} assume !!(~i~1 < 100);assume -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:26:45,328 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:26:45,329 INFO L273 TraceCheckUtils]: 64: Hoare triple {33210#(<= main_~i~1 29)} assume !!(~i~1 < 100);assume -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:26:45,330 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:26:45,330 INFO L273 TraceCheckUtils]: 66: Hoare triple {33211#(<= main_~i~1 30)} assume !!(~i~1 < 100);assume -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:26:45,331 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:26:45,331 INFO L273 TraceCheckUtils]: 68: Hoare triple {33212#(<= main_~i~1 31)} assume !!(~i~1 < 100);assume -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:26:45,332 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:26:45,332 INFO L273 TraceCheckUtils]: 70: Hoare triple {33213#(<= main_~i~1 32)} assume !!(~i~1 < 100);assume -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:26:45,333 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:26:45,333 INFO L273 TraceCheckUtils]: 72: Hoare triple {33214#(<= main_~i~1 33)} assume !!(~i~1 < 100);assume -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:26:45,334 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:26:45,335 INFO L273 TraceCheckUtils]: 74: Hoare triple {33215#(<= main_~i~1 34)} assume !!(~i~1 < 100);assume -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:26:45,335 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:26:45,336 INFO L273 TraceCheckUtils]: 76: Hoare triple {33216#(<= main_~i~1 35)} assume !!(~i~1 < 100);assume -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:26:45,336 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:26:45,337 INFO L273 TraceCheckUtils]: 78: Hoare triple {33217#(<= main_~i~1 36)} assume !!(~i~1 < 100);assume -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:26:45,338 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:26:45,338 INFO L273 TraceCheckUtils]: 80: Hoare triple {33218#(<= main_~i~1 37)} assume !!(~i~1 < 100);assume -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:26:45,339 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:26:45,339 INFO L273 TraceCheckUtils]: 82: Hoare triple {33219#(<= main_~i~1 38)} assume !(~i~1 < 100); {33180#false} is VALID [2018-11-23 12:26:45,340 INFO L256 TraceCheckUtils]: 83: Hoare triple {33180#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {33179#true} is VALID [2018-11-23 12:26:45,340 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:26:45,340 INFO L273 TraceCheckUtils]: 85: Hoare triple {33179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:26:45,340 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:26:45,340 INFO L273 TraceCheckUtils]: 87: Hoare triple {33179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:26:45,340 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:26:45,341 INFO L273 TraceCheckUtils]: 89: Hoare triple {33179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:26:45,341 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:26:45,341 INFO L273 TraceCheckUtils]: 91: Hoare triple {33179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:26:45,341 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:26:45,341 INFO L273 TraceCheckUtils]: 93: Hoare triple {33179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:26:45,341 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:26:45,342 INFO L273 TraceCheckUtils]: 95: Hoare triple {33179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:26:45,342 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:26:45,342 INFO L273 TraceCheckUtils]: 97: Hoare triple {33179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:26:45,342 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:26:45,342 INFO L273 TraceCheckUtils]: 99: Hoare triple {33179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:26:45,342 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:26:45,343 INFO L273 TraceCheckUtils]: 101: Hoare triple {33179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:26:45,343 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:26:45,343 INFO L273 TraceCheckUtils]: 103: Hoare triple {33179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:26:45,343 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:26:45,343 INFO L273 TraceCheckUtils]: 105: Hoare triple {33179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:26:45,343 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:26:45,343 INFO L273 TraceCheckUtils]: 107: Hoare triple {33179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:26:45,343 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:26:45,344 INFO L273 TraceCheckUtils]: 109: Hoare triple {33179#true} assume !(~i~0 < 100); {33179#true} is VALID [2018-11-23 12:26:45,344 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:26:45,344 INFO L273 TraceCheckUtils]: 111: Hoare triple {33179#true} assume true; {33179#true} is VALID [2018-11-23 12:26:45,344 INFO L268 TraceCheckUtils]: 112: Hoare quadruple {33179#true} {33180#false} #70#return; {33180#false} is VALID [2018-11-23 12:26:45,344 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:26:45,344 INFO L256 TraceCheckUtils]: 114: Hoare triple {33180#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {33179#true} is VALID [2018-11-23 12:26:45,344 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:26:45,344 INFO L273 TraceCheckUtils]: 116: Hoare triple {33179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:26:45,344 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:26:45,344 INFO L273 TraceCheckUtils]: 118: Hoare triple {33179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:26:45,345 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:26:45,345 INFO L273 TraceCheckUtils]: 120: Hoare triple {33179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:26:45,345 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:26:45,345 INFO L273 TraceCheckUtils]: 122: Hoare triple {33179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:26:45,345 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:26:45,345 INFO L273 TraceCheckUtils]: 124: Hoare triple {33179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:26:45,345 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:26:45,345 INFO L273 TraceCheckUtils]: 126: Hoare triple {33179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:26:45,345 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:26:45,345 INFO L273 TraceCheckUtils]: 128: Hoare triple {33179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:26:45,346 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:26:45,346 INFO L273 TraceCheckUtils]: 130: Hoare triple {33179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:26:45,346 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:26:45,346 INFO L273 TraceCheckUtils]: 132: Hoare triple {33179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:26:45,346 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:26:45,346 INFO L273 TraceCheckUtils]: 134: Hoare triple {33179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:26:45,346 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:26:45,346 INFO L273 TraceCheckUtils]: 136: Hoare triple {33179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:26:45,346 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:26:45,347 INFO L273 TraceCheckUtils]: 138: Hoare triple {33179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:26:45,347 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:26:45,347 INFO L273 TraceCheckUtils]: 140: Hoare triple {33179#true} assume !(~i~0 < 100); {33179#true} is VALID [2018-11-23 12:26:45,347 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:26:45,347 INFO L273 TraceCheckUtils]: 142: Hoare triple {33179#true} assume true; {33179#true} is VALID [2018-11-23 12:26:45,347 INFO L268 TraceCheckUtils]: 143: Hoare quadruple {33179#true} {33180#false} #72#return; {33180#false} is VALID [2018-11-23 12:26:45,347 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:26:45,347 INFO L273 TraceCheckUtils]: 145: Hoare triple {33180#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:45,347 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:26:45,347 INFO L273 TraceCheckUtils]: 147: Hoare triple {33180#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:45,348 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:26:45,348 INFO L273 TraceCheckUtils]: 149: Hoare triple {33180#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:45,348 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:26:45,348 INFO L273 TraceCheckUtils]: 151: Hoare triple {33180#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:45,348 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:26:45,348 INFO L273 TraceCheckUtils]: 153: Hoare triple {33180#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:45,348 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:26:45,348 INFO L273 TraceCheckUtils]: 155: Hoare triple {33180#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:45,348 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:26:45,348 INFO L273 TraceCheckUtils]: 157: Hoare triple {33180#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:45,349 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:26:45,349 INFO L273 TraceCheckUtils]: 159: Hoare triple {33180#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:45,349 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:26:45,349 INFO L273 TraceCheckUtils]: 161: Hoare triple {33180#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:45,349 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:26:45,349 INFO L273 TraceCheckUtils]: 163: Hoare triple {33180#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:45,349 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:26:45,349 INFO L273 TraceCheckUtils]: 165: Hoare triple {33180#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:45,349 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:26:45,349 INFO L273 TraceCheckUtils]: 167: Hoare triple {33180#false} assume !(~i~2 < 99); {33180#false} is VALID [2018-11-23 12:26:45,350 INFO L273 TraceCheckUtils]: 168: Hoare triple {33180#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {33180#false} is VALID [2018-11-23 12:26:45,350 INFO L256 TraceCheckUtils]: 169: Hoare triple {33180#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {33179#true} is VALID [2018-11-23 12:26:45,350 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:26:45,350 INFO L273 TraceCheckUtils]: 171: Hoare triple {33179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:26:45,350 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:26:45,350 INFO L273 TraceCheckUtils]: 173: Hoare triple {33179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:26:45,350 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:26:45,350 INFO L273 TraceCheckUtils]: 175: Hoare triple {33179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:26:45,350 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:26:45,350 INFO L273 TraceCheckUtils]: 177: Hoare triple {33179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:26:45,351 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:26:45,351 INFO L273 TraceCheckUtils]: 179: Hoare triple {33179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:26:45,351 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:26:45,351 INFO L273 TraceCheckUtils]: 181: Hoare triple {33179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:26:45,351 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:26:45,351 INFO L273 TraceCheckUtils]: 183: Hoare triple {33179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:26:45,351 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:26:45,351 INFO L273 TraceCheckUtils]: 185: Hoare triple {33179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:26:45,351 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:26:45,351 INFO L273 TraceCheckUtils]: 187: Hoare triple {33179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:26:45,352 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:26:45,352 INFO L273 TraceCheckUtils]: 189: Hoare triple {33179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:26:45,352 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:26:45,352 INFO L273 TraceCheckUtils]: 191: Hoare triple {33179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:26:45,352 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:26:45,352 INFO L273 TraceCheckUtils]: 193: Hoare triple {33179#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33179#true} is VALID [2018-11-23 12:26:45,352 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:26:45,352 INFO L273 TraceCheckUtils]: 195: Hoare triple {33179#true} assume !(~i~0 < 100); {33179#true} is VALID [2018-11-23 12:26:45,352 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:26:45,352 INFO L273 TraceCheckUtils]: 197: Hoare triple {33179#true} assume true; {33179#true} is VALID [2018-11-23 12:26:45,353 INFO L268 TraceCheckUtils]: 198: Hoare quadruple {33179#true} {33180#false} #74#return; {33180#false} is VALID [2018-11-23 12:26:45,353 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:26:45,353 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:26:45,353 INFO L273 TraceCheckUtils]: 201: Hoare triple {33180#false} assume !false; {33180#false} is VALID [2018-11-23 12:26:45,370 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:26:45,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:45,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 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:26:45,379 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:26:45,483 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:26:45,483 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:45,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:45,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:46,577 INFO L256 TraceCheckUtils]: 0: Hoare triple {33179#true} call ULTIMATE.init(); {33179#true} is VALID [2018-11-23 12:26:46,578 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:26:46,578 INFO L273 TraceCheckUtils]: 2: Hoare triple {33179#true} assume true; {33179#true} is VALID [2018-11-23 12:26:46,578 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33179#true} {33179#true} #66#return; {33179#true} is VALID [2018-11-23 12:26:46,578 INFO L256 TraceCheckUtils]: 4: Hoare triple {33179#true} call #t~ret13 := main(); {33179#true} is VALID [2018-11-23 12:26:46,579 INFO L273 TraceCheckUtils]: 5: Hoare triple {33179#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:26:46,580 INFO L273 TraceCheckUtils]: 6: Hoare triple {33238#(<= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:26:46,580 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:26:46,580 INFO L273 TraceCheckUtils]: 8: Hoare triple {33182#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:26:46,581 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:26:46,581 INFO L273 TraceCheckUtils]: 10: Hoare triple {33183#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:26:46,581 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:26:46,582 INFO L273 TraceCheckUtils]: 12: Hoare triple {33184#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -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:26:46,582 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:26:46,583 INFO L273 TraceCheckUtils]: 14: Hoare triple {33185#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -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:26:46,583 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:26:46,584 INFO L273 TraceCheckUtils]: 16: Hoare triple {33186#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -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:26:46,584 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:26:46,585 INFO L273 TraceCheckUtils]: 18: Hoare triple {33187#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -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:26:46,586 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:26:46,586 INFO L273 TraceCheckUtils]: 20: Hoare triple {33188#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -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:26:46,587 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:26:46,587 INFO L273 TraceCheckUtils]: 22: Hoare triple {33189#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -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:26:46,588 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:26:46,588 INFO L273 TraceCheckUtils]: 24: Hoare triple {33190#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -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:26:46,589 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:26:46,589 INFO L273 TraceCheckUtils]: 26: Hoare triple {33191#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -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:26:46,590 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:26:46,591 INFO L273 TraceCheckUtils]: 28: Hoare triple {33192#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -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:26:46,591 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:26:46,592 INFO L273 TraceCheckUtils]: 30: Hoare triple {33193#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -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:26:46,592 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:26:46,593 INFO L273 TraceCheckUtils]: 32: Hoare triple {33194#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -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:26:46,594 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:26:46,594 INFO L273 TraceCheckUtils]: 34: Hoare triple {33195#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -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:26:46,595 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:26:46,595 INFO L273 TraceCheckUtils]: 36: Hoare triple {33196#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -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:26:46,596 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:26:46,596 INFO L273 TraceCheckUtils]: 38: Hoare triple {33197#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -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:26:46,597 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:26:46,598 INFO L273 TraceCheckUtils]: 40: Hoare triple {33198#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -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:26:46,598 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:26:46,599 INFO L273 TraceCheckUtils]: 42: Hoare triple {33199#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -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:26:46,599 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:26:46,600 INFO L273 TraceCheckUtils]: 44: Hoare triple {33200#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -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:26:46,600 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:26:46,601 INFO L273 TraceCheckUtils]: 46: Hoare triple {33201#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -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:26:46,602 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:26:46,602 INFO L273 TraceCheckUtils]: 48: Hoare triple {33202#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -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:26:46,603 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:26:46,603 INFO L273 TraceCheckUtils]: 50: Hoare triple {33203#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -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:26:46,604 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:26:46,604 INFO L273 TraceCheckUtils]: 52: Hoare triple {33204#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -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:26:46,605 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:26:46,606 INFO L273 TraceCheckUtils]: 54: Hoare triple {33205#(<= main_~i~1 24)} assume !!(~i~1 < 100);assume -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:26:46,606 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:26:46,607 INFO L273 TraceCheckUtils]: 56: Hoare triple {33206#(<= main_~i~1 25)} assume !!(~i~1 < 100);assume -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:26:46,607 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:26:46,608 INFO L273 TraceCheckUtils]: 58: Hoare triple {33207#(<= main_~i~1 26)} assume !!(~i~1 < 100);assume -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:26:46,609 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:26:46,609 INFO L273 TraceCheckUtils]: 60: Hoare triple {33208#(<= main_~i~1 27)} assume !!(~i~1 < 100);assume -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:26:46,610 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:26:46,610 INFO L273 TraceCheckUtils]: 62: Hoare triple {33209#(<= main_~i~1 28)} assume !!(~i~1 < 100);assume -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:26:46,611 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:26:46,611 INFO L273 TraceCheckUtils]: 64: Hoare triple {33210#(<= main_~i~1 29)} assume !!(~i~1 < 100);assume -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:26:46,612 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:26:46,612 INFO L273 TraceCheckUtils]: 66: Hoare triple {33211#(<= main_~i~1 30)} assume !!(~i~1 < 100);assume -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:26:46,613 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:26:46,614 INFO L273 TraceCheckUtils]: 68: Hoare triple {33212#(<= main_~i~1 31)} assume !!(~i~1 < 100);assume -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:26:46,614 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:26:46,615 INFO L273 TraceCheckUtils]: 70: Hoare triple {33213#(<= main_~i~1 32)} assume !!(~i~1 < 100);assume -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:26:46,615 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:26:46,616 INFO L273 TraceCheckUtils]: 72: Hoare triple {33214#(<= main_~i~1 33)} assume !!(~i~1 < 100);assume -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:26:46,617 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:26:46,617 INFO L273 TraceCheckUtils]: 74: Hoare triple {33215#(<= main_~i~1 34)} assume !!(~i~1 < 100);assume -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:26:46,618 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:26:46,618 INFO L273 TraceCheckUtils]: 76: Hoare triple {33216#(<= main_~i~1 35)} assume !!(~i~1 < 100);assume -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:26:46,619 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:26:46,619 INFO L273 TraceCheckUtils]: 78: Hoare triple {33217#(<= main_~i~1 36)} assume !!(~i~1 < 100);assume -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:26:46,620 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:26:46,621 INFO L273 TraceCheckUtils]: 80: Hoare triple {33218#(<= main_~i~1 37)} assume !!(~i~1 < 100);assume -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:26:46,621 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:26:46,622 INFO L273 TraceCheckUtils]: 82: Hoare triple {33219#(<= main_~i~1 38)} assume !(~i~1 < 100); {33180#false} is VALID [2018-11-23 12:26:46,622 INFO L256 TraceCheckUtils]: 83: Hoare triple {33180#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {33180#false} is VALID [2018-11-23 12:26:46,622 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:26:46,622 INFO L273 TraceCheckUtils]: 85: Hoare triple {33180#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:26:46,623 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:26:46,623 INFO L273 TraceCheckUtils]: 87: Hoare triple {33180#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:26:46,623 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:26:46,623 INFO L273 TraceCheckUtils]: 89: Hoare triple {33180#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:26:46,623 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:26:46,623 INFO L273 TraceCheckUtils]: 91: Hoare triple {33180#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:26:46,623 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:26:46,624 INFO L273 TraceCheckUtils]: 93: Hoare triple {33180#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:26:46,624 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:26:46,624 INFO L273 TraceCheckUtils]: 95: Hoare triple {33180#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:26:46,624 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:26:46,624 INFO L273 TraceCheckUtils]: 97: Hoare triple {33180#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:26:46,624 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:26:46,625 INFO L273 TraceCheckUtils]: 99: Hoare triple {33180#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:26:46,625 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:26:46,625 INFO L273 TraceCheckUtils]: 101: Hoare triple {33180#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:26:46,625 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:26:46,625 INFO L273 TraceCheckUtils]: 103: Hoare triple {33180#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:26:46,625 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:26:46,625 INFO L273 TraceCheckUtils]: 105: Hoare triple {33180#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:26:46,625 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:26:46,625 INFO L273 TraceCheckUtils]: 107: Hoare triple {33180#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:26:46,626 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:26:46,626 INFO L273 TraceCheckUtils]: 109: Hoare triple {33180#false} assume !(~i~0 < 100); {33180#false} is VALID [2018-11-23 12:26:46,626 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:26:46,626 INFO L273 TraceCheckUtils]: 111: Hoare triple {33180#false} assume true; {33180#false} is VALID [2018-11-23 12:26:46,626 INFO L268 TraceCheckUtils]: 112: Hoare quadruple {33180#false} {33180#false} #70#return; {33180#false} is VALID [2018-11-23 12:26:46,626 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:26:46,626 INFO L256 TraceCheckUtils]: 114: Hoare triple {33180#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {33180#false} is VALID [2018-11-23 12:26:46,626 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:26:46,626 INFO L273 TraceCheckUtils]: 116: Hoare triple {33180#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:26:46,626 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:26:46,627 INFO L273 TraceCheckUtils]: 118: Hoare triple {33180#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:26:46,627 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:26:46,627 INFO L273 TraceCheckUtils]: 120: Hoare triple {33180#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:26:46,627 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:26:46,627 INFO L273 TraceCheckUtils]: 122: Hoare triple {33180#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:26:46,627 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:26:46,627 INFO L273 TraceCheckUtils]: 124: Hoare triple {33180#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:26:46,627 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:26:46,627 INFO L273 TraceCheckUtils]: 126: Hoare triple {33180#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:26:46,627 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:26:46,628 INFO L273 TraceCheckUtils]: 128: Hoare triple {33180#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:26:46,628 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:26:46,628 INFO L273 TraceCheckUtils]: 130: Hoare triple {33180#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:26:46,628 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:26:46,628 INFO L273 TraceCheckUtils]: 132: Hoare triple {33180#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:26:46,628 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:26:46,628 INFO L273 TraceCheckUtils]: 134: Hoare triple {33180#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:26:46,628 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:26:46,628 INFO L273 TraceCheckUtils]: 136: Hoare triple {33180#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:26:46,628 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:26:46,629 INFO L273 TraceCheckUtils]: 138: Hoare triple {33180#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:26:46,629 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:26:46,629 INFO L273 TraceCheckUtils]: 140: Hoare triple {33180#false} assume !(~i~0 < 100); {33180#false} is VALID [2018-11-23 12:26:46,629 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:26:46,629 INFO L273 TraceCheckUtils]: 142: Hoare triple {33180#false} assume true; {33180#false} is VALID [2018-11-23 12:26:46,629 INFO L268 TraceCheckUtils]: 143: Hoare quadruple {33180#false} {33180#false} #72#return; {33180#false} is VALID [2018-11-23 12:26:46,629 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:26:46,629 INFO L273 TraceCheckUtils]: 145: Hoare triple {33180#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:46,629 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:26:46,629 INFO L273 TraceCheckUtils]: 147: Hoare triple {33180#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:46,630 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:26:46,630 INFO L273 TraceCheckUtils]: 149: Hoare triple {33180#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:46,630 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:26:46,630 INFO L273 TraceCheckUtils]: 151: Hoare triple {33180#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:46,630 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:26:46,630 INFO L273 TraceCheckUtils]: 153: Hoare triple {33180#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:46,630 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:26:46,630 INFO L273 TraceCheckUtils]: 155: Hoare triple {33180#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:46,630 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:26:46,630 INFO L273 TraceCheckUtils]: 157: Hoare triple {33180#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:46,631 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:26:46,631 INFO L273 TraceCheckUtils]: 159: Hoare triple {33180#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:46,631 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:26:46,631 INFO L273 TraceCheckUtils]: 161: Hoare triple {33180#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:46,631 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:26:46,631 INFO L273 TraceCheckUtils]: 163: Hoare triple {33180#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:46,631 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:26:46,631 INFO L273 TraceCheckUtils]: 165: Hoare triple {33180#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:46,631 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:26:46,631 INFO L273 TraceCheckUtils]: 167: Hoare triple {33180#false} assume !(~i~2 < 99); {33180#false} is VALID [2018-11-23 12:26:46,632 INFO L273 TraceCheckUtils]: 168: Hoare triple {33180#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {33180#false} is VALID [2018-11-23 12:26:46,632 INFO L256 TraceCheckUtils]: 169: Hoare triple {33180#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {33180#false} is VALID [2018-11-23 12:26:46,632 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:26:46,632 INFO L273 TraceCheckUtils]: 171: Hoare triple {33180#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:26:46,632 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:26:46,632 INFO L273 TraceCheckUtils]: 173: Hoare triple {33180#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:26:46,632 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:26:46,632 INFO L273 TraceCheckUtils]: 175: Hoare triple {33180#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:26:46,632 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:26:46,632 INFO L273 TraceCheckUtils]: 177: Hoare triple {33180#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:26:46,633 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:26:46,633 INFO L273 TraceCheckUtils]: 179: Hoare triple {33180#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:26:46,633 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:26:46,633 INFO L273 TraceCheckUtils]: 181: Hoare triple {33180#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:26:46,633 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:26:46,633 INFO L273 TraceCheckUtils]: 183: Hoare triple {33180#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:26:46,633 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:26:46,633 INFO L273 TraceCheckUtils]: 185: Hoare triple {33180#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:26:46,633 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:26:46,633 INFO L273 TraceCheckUtils]: 187: Hoare triple {33180#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:26:46,634 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:26:46,634 INFO L273 TraceCheckUtils]: 189: Hoare triple {33180#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:26:46,634 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:26:46,634 INFO L273 TraceCheckUtils]: 191: Hoare triple {33180#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:26:46,634 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:26:46,634 INFO L273 TraceCheckUtils]: 193: Hoare triple {33180#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {33180#false} is VALID [2018-11-23 12:26:46,634 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:26:46,634 INFO L273 TraceCheckUtils]: 195: Hoare triple {33180#false} assume !(~i~0 < 100); {33180#false} is VALID [2018-11-23 12:26:46,634 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:26:46,634 INFO L273 TraceCheckUtils]: 197: Hoare triple {33180#false} assume true; {33180#false} is VALID [2018-11-23 12:26:46,635 INFO L268 TraceCheckUtils]: 198: Hoare quadruple {33180#false} {33180#false} #74#return; {33180#false} is VALID [2018-11-23 12:26:46,635 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:26:46,635 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:26:46,635 INFO L273 TraceCheckUtils]: 201: Hoare triple {33180#false} assume !false; {33180#false} is VALID [2018-11-23 12:26:46,674 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:26:46,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:46,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2018-11-23 12:26:46,694 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 202 [2018-11-23 12:26:46,694 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:46,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 12:26:46,832 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:26:46,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 12:26:46,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 12:26:46,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:26:46,833 INFO L87 Difference]: Start difference. First operand 145 states and 149 transitions. Second operand 42 states. [2018-11-23 12:26:47,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:47,296 INFO L93 Difference]: Finished difference Result 210 states and 218 transitions. [2018-11-23 12:26:47,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-23 12:26:47,296 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 202 [2018-11-23 12:26:47,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:47,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:26:47,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 130 transitions. [2018-11-23 12:26:47,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:26:47,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 130 transitions. [2018-11-23 12:26:47,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 130 transitions. [2018-11-23 12:26:47,417 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:26:47,420 INFO L225 Difference]: With dead ends: 210 [2018-11-23 12:26:47,420 INFO L226 Difference]: Without dead ends: 148 [2018-11-23 12:26:47,421 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:26:47,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-23 12:26:47,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2018-11-23 12:26:47,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:47,470 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand 147 states. [2018-11-23 12:26:47,470 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand 147 states. [2018-11-23 12:26:47,470 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 147 states. [2018-11-23 12:26:47,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:47,472 INFO L93 Difference]: Finished difference Result 148 states and 152 transitions. [2018-11-23 12:26:47,472 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 152 transitions. [2018-11-23 12:26:47,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:47,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:47,473 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand 148 states. [2018-11-23 12:26:47,473 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 148 states. [2018-11-23 12:26:47,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:47,475 INFO L93 Difference]: Finished difference Result 148 states and 152 transitions. [2018-11-23 12:26:47,476 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 152 transitions. [2018-11-23 12:26:47,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:47,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:47,476 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:47,476 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:47,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-23 12:26:47,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 151 transitions. [2018-11-23 12:26:47,479 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 151 transitions. Word has length 202 [2018-11-23 12:26:47,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:47,479 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 151 transitions. [2018-11-23 12:26:47,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 12:26:47,480 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 151 transitions. [2018-11-23 12:26:47,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-23 12:26:47,481 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:47,481 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:26:47,481 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:47,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:47,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1928130507, now seen corresponding path program 39 times [2018-11-23 12:26:47,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:47,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:47,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:47,482 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:47,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:47,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:48,425 INFO L256 TraceCheckUtils]: 0: Hoare triple {34654#true} call ULTIMATE.init(); {34654#true} is VALID [2018-11-23 12:26:48,425 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:26:48,425 INFO L273 TraceCheckUtils]: 2: Hoare triple {34654#true} assume true; {34654#true} is VALID [2018-11-23 12:26:48,425 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34654#true} {34654#true} #66#return; {34654#true} is VALID [2018-11-23 12:26:48,425 INFO L256 TraceCheckUtils]: 4: Hoare triple {34654#true} call #t~ret13 := main(); {34654#true} is VALID [2018-11-23 12:26:48,426 INFO L273 TraceCheckUtils]: 5: Hoare triple {34654#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:26:48,426 INFO L273 TraceCheckUtils]: 6: Hoare triple {34656#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:26:48,427 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:26:48,427 INFO L273 TraceCheckUtils]: 8: Hoare triple {34657#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:26:48,428 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:26:48,428 INFO L273 TraceCheckUtils]: 10: Hoare triple {34658#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:26:48,429 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:26:48,429 INFO L273 TraceCheckUtils]: 12: Hoare triple {34659#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -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:26:48,430 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:26:48,430 INFO L273 TraceCheckUtils]: 14: Hoare triple {34660#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -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:26:48,430 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:26:48,431 INFO L273 TraceCheckUtils]: 16: Hoare triple {34661#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -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:26:48,432 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:26:48,432 INFO L273 TraceCheckUtils]: 18: Hoare triple {34662#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -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:26:48,433 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:26:48,433 INFO L273 TraceCheckUtils]: 20: Hoare triple {34663#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -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:26:48,434 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:26:48,434 INFO L273 TraceCheckUtils]: 22: Hoare triple {34664#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -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:26:48,435 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:26:48,436 INFO L273 TraceCheckUtils]: 24: Hoare triple {34665#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -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:26:48,436 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:26:48,437 INFO L273 TraceCheckUtils]: 26: Hoare triple {34666#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -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:26:48,437 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:26:48,438 INFO L273 TraceCheckUtils]: 28: Hoare triple {34667#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -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:26:48,439 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:26:48,439 INFO L273 TraceCheckUtils]: 30: Hoare triple {34668#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -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:26:48,440 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:26:48,440 INFO L273 TraceCheckUtils]: 32: Hoare triple {34669#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -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:26:48,441 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:26:48,441 INFO L273 TraceCheckUtils]: 34: Hoare triple {34670#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -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:26:48,442 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:26:48,442 INFO L273 TraceCheckUtils]: 36: Hoare triple {34671#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -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:26:48,443 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:26:48,444 INFO L273 TraceCheckUtils]: 38: Hoare triple {34672#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -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:26:48,444 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:26:48,445 INFO L273 TraceCheckUtils]: 40: Hoare triple {34673#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -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:26:48,445 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:26:48,446 INFO L273 TraceCheckUtils]: 42: Hoare triple {34674#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -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:26:48,447 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:26:48,447 INFO L273 TraceCheckUtils]: 44: Hoare triple {34675#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -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:26:48,448 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:26:48,448 INFO L273 TraceCheckUtils]: 46: Hoare triple {34676#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -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:26:48,449 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:26:48,449 INFO L273 TraceCheckUtils]: 48: Hoare triple {34677#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -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:26:48,450 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:26:48,451 INFO L273 TraceCheckUtils]: 50: Hoare triple {34678#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -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:26:48,451 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:26:48,452 INFO L273 TraceCheckUtils]: 52: Hoare triple {34679#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -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:26:48,452 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:26:48,453 INFO L273 TraceCheckUtils]: 54: Hoare triple {34680#(<= main_~i~1 24)} assume !!(~i~1 < 100);assume -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:26:48,454 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:26:48,454 INFO L273 TraceCheckUtils]: 56: Hoare triple {34681#(<= main_~i~1 25)} assume !!(~i~1 < 100);assume -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:26:48,455 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:26:48,455 INFO L273 TraceCheckUtils]: 58: Hoare triple {34682#(<= main_~i~1 26)} assume !!(~i~1 < 100);assume -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:26:48,456 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:26:48,456 INFO L273 TraceCheckUtils]: 60: Hoare triple {34683#(<= main_~i~1 27)} assume !!(~i~1 < 100);assume -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:26:48,457 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:26:48,457 INFO L273 TraceCheckUtils]: 62: Hoare triple {34684#(<= main_~i~1 28)} assume !!(~i~1 < 100);assume -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:26:48,458 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:26:48,459 INFO L273 TraceCheckUtils]: 64: Hoare triple {34685#(<= main_~i~1 29)} assume !!(~i~1 < 100);assume -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:26:48,459 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:26:48,460 INFO L273 TraceCheckUtils]: 66: Hoare triple {34686#(<= main_~i~1 30)} assume !!(~i~1 < 100);assume -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:26:48,460 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:26:48,461 INFO L273 TraceCheckUtils]: 68: Hoare triple {34687#(<= main_~i~1 31)} assume !!(~i~1 < 100);assume -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:26:48,462 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:26:48,462 INFO L273 TraceCheckUtils]: 70: Hoare triple {34688#(<= main_~i~1 32)} assume !!(~i~1 < 100);assume -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:26:48,463 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:26:48,463 INFO L273 TraceCheckUtils]: 72: Hoare triple {34689#(<= main_~i~1 33)} assume !!(~i~1 < 100);assume -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:26:48,464 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:26:48,464 INFO L273 TraceCheckUtils]: 74: Hoare triple {34690#(<= main_~i~1 34)} assume !!(~i~1 < 100);assume -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:26:48,465 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:26:48,466 INFO L273 TraceCheckUtils]: 76: Hoare triple {34691#(<= main_~i~1 35)} assume !!(~i~1 < 100);assume -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:26:48,466 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:26:48,467 INFO L273 TraceCheckUtils]: 78: Hoare triple {34692#(<= main_~i~1 36)} assume !!(~i~1 < 100);assume -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:26:48,467 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:26:48,468 INFO L273 TraceCheckUtils]: 80: Hoare triple {34693#(<= main_~i~1 37)} assume !!(~i~1 < 100);assume -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:26:48,469 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:26:48,469 INFO L273 TraceCheckUtils]: 82: Hoare triple {34694#(<= main_~i~1 38)} assume !!(~i~1 < 100);assume -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:26:48,470 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:26:48,470 INFO L273 TraceCheckUtils]: 84: Hoare triple {34695#(<= main_~i~1 39)} assume !(~i~1 < 100); {34655#false} is VALID [2018-11-23 12:26:48,471 INFO L256 TraceCheckUtils]: 85: Hoare triple {34655#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {34654#true} is VALID [2018-11-23 12:26:48,471 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:26:48,471 INFO L273 TraceCheckUtils]: 87: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:48,471 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:26:48,471 INFO L273 TraceCheckUtils]: 89: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:48,471 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:26:48,472 INFO L273 TraceCheckUtils]: 91: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:48,472 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:26:48,472 INFO L273 TraceCheckUtils]: 93: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:48,472 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:26:48,472 INFO L273 TraceCheckUtils]: 95: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:48,472 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:26:48,473 INFO L273 TraceCheckUtils]: 97: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:48,473 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:26:48,473 INFO L273 TraceCheckUtils]: 99: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:48,473 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:26:48,473 INFO L273 TraceCheckUtils]: 101: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:48,473 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:26:48,474 INFO L273 TraceCheckUtils]: 103: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:48,474 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:26:48,474 INFO L273 TraceCheckUtils]: 105: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:48,474 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:26:48,474 INFO L273 TraceCheckUtils]: 107: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:48,474 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:26:48,475 INFO L273 TraceCheckUtils]: 109: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:48,475 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:26:48,475 INFO L273 TraceCheckUtils]: 111: Hoare triple {34654#true} assume !(~i~0 < 100); {34654#true} is VALID [2018-11-23 12:26:48,475 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:26:48,475 INFO L273 TraceCheckUtils]: 113: Hoare triple {34654#true} assume true; {34654#true} is VALID [2018-11-23 12:26:48,475 INFO L268 TraceCheckUtils]: 114: Hoare quadruple {34654#true} {34655#false} #70#return; {34655#false} is VALID [2018-11-23 12:26:48,475 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:26:48,475 INFO L256 TraceCheckUtils]: 116: Hoare triple {34655#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {34654#true} is VALID [2018-11-23 12:26:48,476 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:26:48,476 INFO L273 TraceCheckUtils]: 118: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:48,476 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:26:48,476 INFO L273 TraceCheckUtils]: 120: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:48,476 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:26:48,476 INFO L273 TraceCheckUtils]: 122: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:48,476 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:26:48,476 INFO L273 TraceCheckUtils]: 124: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:48,476 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:26:48,476 INFO L273 TraceCheckUtils]: 126: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:48,477 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:26:48,477 INFO L273 TraceCheckUtils]: 128: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:48,477 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:26:48,477 INFO L273 TraceCheckUtils]: 130: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:48,477 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:26:48,477 INFO L273 TraceCheckUtils]: 132: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:48,477 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:26:48,477 INFO L273 TraceCheckUtils]: 134: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:48,477 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:26:48,477 INFO L273 TraceCheckUtils]: 136: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:48,478 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:26:48,478 INFO L273 TraceCheckUtils]: 138: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:48,478 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:26:48,478 INFO L273 TraceCheckUtils]: 140: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:48,478 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:26:48,478 INFO L273 TraceCheckUtils]: 142: Hoare triple {34654#true} assume !(~i~0 < 100); {34654#true} is VALID [2018-11-23 12:26:48,478 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:26:48,478 INFO L273 TraceCheckUtils]: 144: Hoare triple {34654#true} assume true; {34654#true} is VALID [2018-11-23 12:26:48,478 INFO L268 TraceCheckUtils]: 145: Hoare quadruple {34654#true} {34655#false} #72#return; {34655#false} is VALID [2018-11-23 12:26:48,479 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:26:48,479 INFO L273 TraceCheckUtils]: 147: Hoare triple {34655#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:48,479 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:26:48,479 INFO L273 TraceCheckUtils]: 149: Hoare triple {34655#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:48,479 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:26:48,479 INFO L273 TraceCheckUtils]: 151: Hoare triple {34655#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:48,479 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:26:48,479 INFO L273 TraceCheckUtils]: 153: Hoare triple {34655#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:48,479 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:26:48,479 INFO L273 TraceCheckUtils]: 155: Hoare triple {34655#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:48,480 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:26:48,480 INFO L273 TraceCheckUtils]: 157: Hoare triple {34655#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:48,480 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:26:48,480 INFO L273 TraceCheckUtils]: 159: Hoare triple {34655#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:48,480 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:26:48,480 INFO L273 TraceCheckUtils]: 161: Hoare triple {34655#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:48,480 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:26:48,480 INFO L273 TraceCheckUtils]: 163: Hoare triple {34655#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:48,480 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:26:48,480 INFO L273 TraceCheckUtils]: 165: Hoare triple {34655#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:48,481 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:26:48,481 INFO L273 TraceCheckUtils]: 167: Hoare triple {34655#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:48,481 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:26:48,481 INFO L273 TraceCheckUtils]: 169: Hoare triple {34655#false} assume !(~i~2 < 99); {34655#false} is VALID [2018-11-23 12:26:48,481 INFO L273 TraceCheckUtils]: 170: Hoare triple {34655#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {34655#false} is VALID [2018-11-23 12:26:48,481 INFO L256 TraceCheckUtils]: 171: Hoare triple {34655#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {34654#true} is VALID [2018-11-23 12:26:48,481 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:26:48,481 INFO L273 TraceCheckUtils]: 173: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:48,481 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:26:48,481 INFO L273 TraceCheckUtils]: 175: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:48,482 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:26:48,482 INFO L273 TraceCheckUtils]: 177: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:48,482 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:26:48,482 INFO L273 TraceCheckUtils]: 179: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:48,482 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:26:48,482 INFO L273 TraceCheckUtils]: 181: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:48,482 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:26:48,482 INFO L273 TraceCheckUtils]: 183: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:48,482 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:26:48,482 INFO L273 TraceCheckUtils]: 185: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:48,483 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:26:48,483 INFO L273 TraceCheckUtils]: 187: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:48,483 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:26:48,483 INFO L273 TraceCheckUtils]: 189: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:48,483 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:26:48,483 INFO L273 TraceCheckUtils]: 191: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:48,483 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:26:48,483 INFO L273 TraceCheckUtils]: 193: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:48,483 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:26:48,483 INFO L273 TraceCheckUtils]: 195: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:48,484 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:26:48,484 INFO L273 TraceCheckUtils]: 197: Hoare triple {34654#true} assume !(~i~0 < 100); {34654#true} is VALID [2018-11-23 12:26:48,484 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:26:48,484 INFO L273 TraceCheckUtils]: 199: Hoare triple {34654#true} assume true; {34654#true} is VALID [2018-11-23 12:26:48,484 INFO L268 TraceCheckUtils]: 200: Hoare quadruple {34654#true} {34655#false} #74#return; {34655#false} is VALID [2018-11-23 12:26:48,484 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:26:48,484 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:26:48,484 INFO L273 TraceCheckUtils]: 203: Hoare triple {34655#false} assume !false; {34655#false} is VALID [2018-11-23 12:26:48,502 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:26:48,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:48,503 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:26:48,511 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:26:49,393 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-11-23 12:26:49,394 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:49,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:49,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:49,921 INFO L256 TraceCheckUtils]: 0: Hoare triple {34654#true} call ULTIMATE.init(); {34654#true} is VALID [2018-11-23 12:26:49,922 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:26:49,922 INFO L273 TraceCheckUtils]: 2: Hoare triple {34654#true} assume true; {34654#true} is VALID [2018-11-23 12:26:49,922 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34654#true} {34654#true} #66#return; {34654#true} is VALID [2018-11-23 12:26:49,922 INFO L256 TraceCheckUtils]: 4: Hoare triple {34654#true} call #t~ret13 := main(); {34654#true} is VALID [2018-11-23 12:26:49,922 INFO L273 TraceCheckUtils]: 5: Hoare triple {34654#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {34654#true} is VALID [2018-11-23 12:26:49,922 INFO L273 TraceCheckUtils]: 6: Hoare triple {34654#true} assume !!(~i~1 < 100);assume -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:26:49,923 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:26:49,923 INFO L273 TraceCheckUtils]: 8: Hoare triple {34654#true} assume !!(~i~1 < 100);assume -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:26:49,923 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:26:49,923 INFO L273 TraceCheckUtils]: 10: Hoare triple {34654#true} assume !!(~i~1 < 100);assume -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:26:49,923 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:26:49,923 INFO L273 TraceCheckUtils]: 12: Hoare triple {34654#true} assume !!(~i~1 < 100);assume -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:26:49,924 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:26:49,924 INFO L273 TraceCheckUtils]: 14: Hoare triple {34654#true} assume !!(~i~1 < 100);assume -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:26:49,924 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:26:49,924 INFO L273 TraceCheckUtils]: 16: Hoare triple {34654#true} assume !!(~i~1 < 100);assume -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:26:49,924 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:26:49,924 INFO L273 TraceCheckUtils]: 18: Hoare triple {34654#true} assume !!(~i~1 < 100);assume -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:26:49,924 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:26:49,924 INFO L273 TraceCheckUtils]: 20: Hoare triple {34654#true} assume !!(~i~1 < 100);assume -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:26:49,925 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:26:49,925 INFO L273 TraceCheckUtils]: 22: Hoare triple {34654#true} assume !!(~i~1 < 100);assume -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:26:49,925 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:26:49,925 INFO L273 TraceCheckUtils]: 24: Hoare triple {34654#true} assume !!(~i~1 < 100);assume -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:26:49,925 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:26:49,925 INFO L273 TraceCheckUtils]: 26: Hoare triple {34654#true} assume !!(~i~1 < 100);assume -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:26:49,925 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:26:49,925 INFO L273 TraceCheckUtils]: 28: Hoare triple {34654#true} assume !!(~i~1 < 100);assume -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:26:49,925 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:26:49,925 INFO L273 TraceCheckUtils]: 30: Hoare triple {34654#true} assume !!(~i~1 < 100);assume -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:26:49,926 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:26:49,926 INFO L273 TraceCheckUtils]: 32: Hoare triple {34654#true} assume !!(~i~1 < 100);assume -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:26:49,926 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:26:49,926 INFO L273 TraceCheckUtils]: 34: Hoare triple {34654#true} assume !!(~i~1 < 100);assume -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:26:49,926 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:26:49,926 INFO L273 TraceCheckUtils]: 36: Hoare triple {34654#true} assume !!(~i~1 < 100);assume -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:26:49,926 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:26:49,926 INFO L273 TraceCheckUtils]: 38: Hoare triple {34654#true} assume !!(~i~1 < 100);assume -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:26:49,926 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:26:49,926 INFO L273 TraceCheckUtils]: 40: Hoare triple {34654#true} assume !!(~i~1 < 100);assume -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:26:49,927 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:26:49,927 INFO L273 TraceCheckUtils]: 42: Hoare triple {34654#true} assume !!(~i~1 < 100);assume -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:26:49,927 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:26:49,927 INFO L273 TraceCheckUtils]: 44: Hoare triple {34654#true} assume !!(~i~1 < 100);assume -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:26:49,927 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:26:49,927 INFO L273 TraceCheckUtils]: 46: Hoare triple {34654#true} assume !!(~i~1 < 100);assume -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:26:49,927 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:26:49,927 INFO L273 TraceCheckUtils]: 48: Hoare triple {34654#true} assume !!(~i~1 < 100);assume -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:26:49,927 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:26:49,927 INFO L273 TraceCheckUtils]: 50: Hoare triple {34654#true} assume !!(~i~1 < 100);assume -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:26:49,928 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:26:49,928 INFO L273 TraceCheckUtils]: 52: Hoare triple {34654#true} assume !!(~i~1 < 100);assume -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:26:49,928 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:26:49,928 INFO L273 TraceCheckUtils]: 54: Hoare triple {34654#true} assume !!(~i~1 < 100);assume -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:26:49,928 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:26:49,928 INFO L273 TraceCheckUtils]: 56: Hoare triple {34654#true} assume !!(~i~1 < 100);assume -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:26:49,928 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:26:49,928 INFO L273 TraceCheckUtils]: 58: Hoare triple {34654#true} assume !!(~i~1 < 100);assume -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:26:49,928 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:26:49,928 INFO L273 TraceCheckUtils]: 60: Hoare triple {34654#true} assume !!(~i~1 < 100);assume -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:26:49,929 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:26:49,929 INFO L273 TraceCheckUtils]: 62: Hoare triple {34654#true} assume !!(~i~1 < 100);assume -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:26:49,929 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:26:49,929 INFO L273 TraceCheckUtils]: 64: Hoare triple {34654#true} assume !!(~i~1 < 100);assume -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:26:49,929 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:26:49,929 INFO L273 TraceCheckUtils]: 66: Hoare triple {34654#true} assume !!(~i~1 < 100);assume -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:26:49,929 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:26:49,929 INFO L273 TraceCheckUtils]: 68: Hoare triple {34654#true} assume !!(~i~1 < 100);assume -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:26:49,929 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:26:49,929 INFO L273 TraceCheckUtils]: 70: Hoare triple {34654#true} assume !!(~i~1 < 100);assume -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:26:49,930 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:26:49,930 INFO L273 TraceCheckUtils]: 72: Hoare triple {34654#true} assume !!(~i~1 < 100);assume -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:26:49,930 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:26:49,930 INFO L273 TraceCheckUtils]: 74: Hoare triple {34654#true} assume !!(~i~1 < 100);assume -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:26:49,930 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:26:49,930 INFO L273 TraceCheckUtils]: 76: Hoare triple {34654#true} assume !!(~i~1 < 100);assume -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:26:49,930 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:26:49,930 INFO L273 TraceCheckUtils]: 78: Hoare triple {34654#true} assume !!(~i~1 < 100);assume -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:26:49,930 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:26:49,930 INFO L273 TraceCheckUtils]: 80: Hoare triple {34654#true} assume !!(~i~1 < 100);assume -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:26:49,931 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:26:49,931 INFO L273 TraceCheckUtils]: 82: Hoare triple {34654#true} assume !!(~i~1 < 100);assume -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:26:49,931 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:26:49,931 INFO L273 TraceCheckUtils]: 84: Hoare triple {34654#true} assume !(~i~1 < 100); {34654#true} is VALID [2018-11-23 12:26:49,931 INFO L256 TraceCheckUtils]: 85: Hoare triple {34654#true} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {34654#true} is VALID [2018-11-23 12:26:49,931 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:26:49,931 INFO L273 TraceCheckUtils]: 87: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:49,931 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:26:49,931 INFO L273 TraceCheckUtils]: 89: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:49,931 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:26:49,932 INFO L273 TraceCheckUtils]: 91: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:49,932 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:26:49,932 INFO L273 TraceCheckUtils]: 93: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:49,932 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:26:49,932 INFO L273 TraceCheckUtils]: 95: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:49,932 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:26:49,932 INFO L273 TraceCheckUtils]: 97: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:49,932 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:26:49,932 INFO L273 TraceCheckUtils]: 99: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:49,932 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:26:49,933 INFO L273 TraceCheckUtils]: 101: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:49,933 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:26:49,933 INFO L273 TraceCheckUtils]: 103: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:49,933 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:26:49,933 INFO L273 TraceCheckUtils]: 105: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:49,933 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:26:49,933 INFO L273 TraceCheckUtils]: 107: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:49,933 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:26:49,933 INFO L273 TraceCheckUtils]: 109: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:49,933 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:26:49,934 INFO L273 TraceCheckUtils]: 111: Hoare triple {34654#true} assume !(~i~0 < 100); {34654#true} is VALID [2018-11-23 12:26:49,934 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:26:49,934 INFO L273 TraceCheckUtils]: 113: Hoare triple {34654#true} assume true; {34654#true} is VALID [2018-11-23 12:26:49,934 INFO L268 TraceCheckUtils]: 114: Hoare quadruple {34654#true} {34654#true} #70#return; {34654#true} is VALID [2018-11-23 12:26:49,934 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:26:49,934 INFO L256 TraceCheckUtils]: 116: Hoare triple {34654#true} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {34654#true} is VALID [2018-11-23 12:26:49,934 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:26:49,934 INFO L273 TraceCheckUtils]: 118: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:49,934 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:26:49,934 INFO L273 TraceCheckUtils]: 120: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:49,935 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:26:49,935 INFO L273 TraceCheckUtils]: 122: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:49,935 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:26:49,935 INFO L273 TraceCheckUtils]: 124: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:49,935 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:26:49,935 INFO L273 TraceCheckUtils]: 126: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:49,935 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:26:49,935 INFO L273 TraceCheckUtils]: 128: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:49,935 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:26:49,935 INFO L273 TraceCheckUtils]: 130: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:49,936 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:26:49,936 INFO L273 TraceCheckUtils]: 132: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:49,936 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:26:49,936 INFO L273 TraceCheckUtils]: 134: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:49,936 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:26:49,936 INFO L273 TraceCheckUtils]: 136: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:49,936 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:26:49,936 INFO L273 TraceCheckUtils]: 138: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:49,936 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:26:49,936 INFO L273 TraceCheckUtils]: 140: Hoare triple {34654#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {34654#true} is VALID [2018-11-23 12:26:49,937 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:26:49,937 INFO L273 TraceCheckUtils]: 142: Hoare triple {34654#true} assume !(~i~0 < 100); {34654#true} is VALID [2018-11-23 12:26:49,937 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:26:49,937 INFO L273 TraceCheckUtils]: 144: Hoare triple {34654#true} assume true; {34654#true} is VALID [2018-11-23 12:26:49,937 INFO L268 TraceCheckUtils]: 145: Hoare quadruple {34654#true} {34654#true} #72#return; {34654#true} is VALID [2018-11-23 12:26:49,937 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:26:49,937 INFO L273 TraceCheckUtils]: 147: Hoare triple {34654#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:49,937 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:26:49,937 INFO L273 TraceCheckUtils]: 149: Hoare triple {34654#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:49,937 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:26:49,938 INFO L273 TraceCheckUtils]: 151: Hoare triple {34654#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:49,938 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:26:49,938 INFO L273 TraceCheckUtils]: 153: Hoare triple {34654#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:49,938 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:26:49,938 INFO L273 TraceCheckUtils]: 155: Hoare triple {34654#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:49,938 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:26:49,938 INFO L273 TraceCheckUtils]: 157: Hoare triple {34654#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:49,938 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:26:49,938 INFO L273 TraceCheckUtils]: 159: Hoare triple {34654#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:49,938 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:26:49,939 INFO L273 TraceCheckUtils]: 161: Hoare triple {34654#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:49,939 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:26:49,939 INFO L273 TraceCheckUtils]: 163: Hoare triple {34654#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:49,939 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:26:49,939 INFO L273 TraceCheckUtils]: 165: Hoare triple {34654#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:49,939 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:26:49,939 INFO L273 TraceCheckUtils]: 167: Hoare triple {34654#true} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:49,939 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:26:49,939 INFO L273 TraceCheckUtils]: 169: Hoare triple {34654#true} assume !(~i~2 < 99); {34654#true} is VALID [2018-11-23 12:26:49,939 INFO L273 TraceCheckUtils]: 170: Hoare triple {34654#true} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {34654#true} is VALID [2018-11-23 12:26:49,940 INFO L256 TraceCheckUtils]: 171: Hoare triple {34654#true} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {34654#true} is VALID [2018-11-23 12:26:49,940 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#(<= bAnd_~i~0 1)} is VALID [2018-11-23 12:26:49,940 INFO L273 TraceCheckUtils]: 173: Hoare triple {35215#(<= bAnd_~i~0 1)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {35215#(<= bAnd_~i~0 1)} is VALID [2018-11-23 12:26:49,941 INFO L273 TraceCheckUtils]: 174: Hoare triple {35215#(<= bAnd_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35222#(<= bAnd_~i~0 2)} is VALID [2018-11-23 12:26:49,941 INFO L273 TraceCheckUtils]: 175: Hoare triple {35222#(<= bAnd_~i~0 2)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {35222#(<= bAnd_~i~0 2)} is VALID [2018-11-23 12:26:49,941 INFO L273 TraceCheckUtils]: 176: Hoare triple {35222#(<= bAnd_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35229#(<= bAnd_~i~0 3)} is VALID [2018-11-23 12:26:49,942 INFO L273 TraceCheckUtils]: 177: Hoare triple {35229#(<= bAnd_~i~0 3)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {35229#(<= bAnd_~i~0 3)} is VALID [2018-11-23 12:26:49,942 INFO L273 TraceCheckUtils]: 178: Hoare triple {35229#(<= bAnd_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35236#(<= bAnd_~i~0 4)} is VALID [2018-11-23 12:26:49,942 INFO L273 TraceCheckUtils]: 179: Hoare triple {35236#(<= bAnd_~i~0 4)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {35236#(<= bAnd_~i~0 4)} is VALID [2018-11-23 12:26:49,943 INFO L273 TraceCheckUtils]: 180: Hoare triple {35236#(<= bAnd_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35243#(<= bAnd_~i~0 5)} is VALID [2018-11-23 12:26:49,943 INFO L273 TraceCheckUtils]: 181: Hoare triple {35243#(<= bAnd_~i~0 5)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {35243#(<= bAnd_~i~0 5)} is VALID [2018-11-23 12:26:49,944 INFO L273 TraceCheckUtils]: 182: Hoare triple {35243#(<= bAnd_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35250#(<= bAnd_~i~0 6)} is VALID [2018-11-23 12:26:49,945 INFO L273 TraceCheckUtils]: 183: Hoare triple {35250#(<= bAnd_~i~0 6)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {35250#(<= bAnd_~i~0 6)} is VALID [2018-11-23 12:26:49,945 INFO L273 TraceCheckUtils]: 184: Hoare triple {35250#(<= bAnd_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35257#(<= bAnd_~i~0 7)} is VALID [2018-11-23 12:26:49,946 INFO L273 TraceCheckUtils]: 185: Hoare triple {35257#(<= bAnd_~i~0 7)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {35257#(<= bAnd_~i~0 7)} is VALID [2018-11-23 12:26:49,946 INFO L273 TraceCheckUtils]: 186: Hoare triple {35257#(<= bAnd_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35264#(<= bAnd_~i~0 8)} is VALID [2018-11-23 12:26:49,947 INFO L273 TraceCheckUtils]: 187: Hoare triple {35264#(<= bAnd_~i~0 8)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {35264#(<= bAnd_~i~0 8)} is VALID [2018-11-23 12:26:49,948 INFO L273 TraceCheckUtils]: 188: Hoare triple {35264#(<= bAnd_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35271#(<= bAnd_~i~0 9)} is VALID [2018-11-23 12:26:49,948 INFO L273 TraceCheckUtils]: 189: Hoare triple {35271#(<= bAnd_~i~0 9)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {35271#(<= bAnd_~i~0 9)} is VALID [2018-11-23 12:26:49,949 INFO L273 TraceCheckUtils]: 190: Hoare triple {35271#(<= bAnd_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35278#(<= bAnd_~i~0 10)} is VALID [2018-11-23 12:26:49,949 INFO L273 TraceCheckUtils]: 191: Hoare triple {35278#(<= bAnd_~i~0 10)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {35278#(<= bAnd_~i~0 10)} is VALID [2018-11-23 12:26:49,950 INFO L273 TraceCheckUtils]: 192: Hoare triple {35278#(<= bAnd_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35285#(<= bAnd_~i~0 11)} is VALID [2018-11-23 12:26:49,950 INFO L273 TraceCheckUtils]: 193: Hoare triple {35285#(<= bAnd_~i~0 11)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {35285#(<= bAnd_~i~0 11)} is VALID [2018-11-23 12:26:49,951 INFO L273 TraceCheckUtils]: 194: Hoare triple {35285#(<= bAnd_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35292#(<= bAnd_~i~0 12)} is VALID [2018-11-23 12:26:49,951 INFO L273 TraceCheckUtils]: 195: Hoare triple {35292#(<= bAnd_~i~0 12)} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {35292#(<= bAnd_~i~0 12)} is VALID [2018-11-23 12:26:49,952 INFO L273 TraceCheckUtils]: 196: Hoare triple {35292#(<= bAnd_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {35299#(<= bAnd_~i~0 13)} is VALID [2018-11-23 12:26:49,953 INFO L273 TraceCheckUtils]: 197: Hoare triple {35299#(<= bAnd_~i~0 13)} assume !(~i~0 < 100); {34655#false} is VALID [2018-11-23 12:26:49,953 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:26:49,953 INFO L273 TraceCheckUtils]: 199: Hoare triple {34655#false} assume true; {34655#false} is VALID [2018-11-23 12:26:49,953 INFO L268 TraceCheckUtils]: 200: Hoare quadruple {34655#false} {34654#true} #74#return; {34655#false} is VALID [2018-11-23 12:26:49,953 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:26:49,954 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:26:49,954 INFO L273 TraceCheckUtils]: 203: Hoare triple {34655#false} assume !false; {34655#false} is VALID [2018-11-23 12:26:49,970 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:26:49,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:49,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 15] total 55 [2018-11-23 12:26:49,991 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 204 [2018-11-23 12:26:49,991 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:49,991 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states. [2018-11-23 12:26:50,159 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:26:50,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-11-23 12:26:50,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-11-23 12:26:50,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=965, Invalid=2005, Unknown=0, NotChecked=0, Total=2970 [2018-11-23 12:26:50,160 INFO L87 Difference]: Start difference. First operand 147 states and 151 transitions. Second operand 55 states. [2018-11-23 12:26:50,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:50,931 INFO L93 Difference]: Finished difference Result 215 states and 227 transitions. [2018-11-23 12:26:50,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-23 12:26:50,931 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 204 [2018-11-23 12:26:50,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:50,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 12:26:50,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 162 transitions. [2018-11-23 12:26:50,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 12:26:50,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 162 transitions. [2018-11-23 12:26:50,934 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states and 162 transitions. [2018-11-23 12:26:51,082 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:26:51,085 INFO L225 Difference]: With dead ends: 215 [2018-11-23 12:26:51,085 INFO L226 Difference]: Without dead ends: 153 [2018-11-23 12:26:51,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=965, Invalid=2005, Unknown=0, NotChecked=0, Total=2970 [2018-11-23 12:26:51,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-11-23 12:26:51,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2018-11-23 12:26:51,139 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:51,140 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand 151 states. [2018-11-23 12:26:51,140 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 151 states. [2018-11-23 12:26:51,140 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 151 states. [2018-11-23 12:26:51,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:51,143 INFO L93 Difference]: Finished difference Result 153 states and 157 transitions. [2018-11-23 12:26:51,143 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2018-11-23 12:26:51,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:51,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:51,143 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand 153 states. [2018-11-23 12:26:51,144 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 153 states. [2018-11-23 12:26:51,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:51,145 INFO L93 Difference]: Finished difference Result 153 states and 157 transitions. [2018-11-23 12:26:51,146 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2018-11-23 12:26:51,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:51,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:51,146 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:51,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:51,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-11-23 12:26:51,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 155 transitions. [2018-11-23 12:26:51,148 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 155 transitions. Word has length 204 [2018-11-23 12:26:51,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:51,148 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 155 transitions. [2018-11-23 12:26:51,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-11-23 12:26:51,148 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 155 transitions. [2018-11-23 12:26:51,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-11-23 12:26:51,149 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:51,149 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:26:51,149 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:51,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:51,150 INFO L82 PathProgramCache]: Analyzing trace with hash -15611861, now seen corresponding path program 40 times [2018-11-23 12:26:51,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:51,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:51,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:51,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:51,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:51,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:52,742 INFO L256 TraceCheckUtils]: 0: Hoare triple {36171#true} call ULTIMATE.init(); {36171#true} is VALID [2018-11-23 12:26:52,743 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:26:52,743 INFO L273 TraceCheckUtils]: 2: Hoare triple {36171#true} assume true; {36171#true} is VALID [2018-11-23 12:26:52,743 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36171#true} {36171#true} #66#return; {36171#true} is VALID [2018-11-23 12:26:52,743 INFO L256 TraceCheckUtils]: 4: Hoare triple {36171#true} call #t~ret13 := main(); {36171#true} is VALID [2018-11-23 12:26:52,744 INFO L273 TraceCheckUtils]: 5: Hoare triple {36171#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:26:52,745 INFO L273 TraceCheckUtils]: 6: Hoare triple {36173#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:26:52,746 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:26:52,746 INFO L273 TraceCheckUtils]: 8: Hoare triple {36174#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:26:52,747 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:26:52,747 INFO L273 TraceCheckUtils]: 10: Hoare triple {36175#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:26:52,747 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:26:52,748 INFO L273 TraceCheckUtils]: 12: Hoare triple {36176#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -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:26:52,748 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:26:52,748 INFO L273 TraceCheckUtils]: 14: Hoare triple {36177#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -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:26:52,749 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:26:52,750 INFO L273 TraceCheckUtils]: 16: Hoare triple {36178#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -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:26:52,750 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:26:52,751 INFO L273 TraceCheckUtils]: 18: Hoare triple {36179#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -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:26:52,751 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:26:52,752 INFO L273 TraceCheckUtils]: 20: Hoare triple {36180#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -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:26:52,753 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:26:52,753 INFO L273 TraceCheckUtils]: 22: Hoare triple {36181#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -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:26:52,754 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:26:52,754 INFO L273 TraceCheckUtils]: 24: Hoare triple {36182#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -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:26:52,755 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:26:52,755 INFO L273 TraceCheckUtils]: 26: Hoare triple {36183#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -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:26:52,756 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:26:52,757 INFO L273 TraceCheckUtils]: 28: Hoare triple {36184#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -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:26:52,757 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:26:52,758 INFO L273 TraceCheckUtils]: 30: Hoare triple {36185#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -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:26:52,758 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:26:52,759 INFO L273 TraceCheckUtils]: 32: Hoare triple {36186#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -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:26:52,759 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:26:52,760 INFO L273 TraceCheckUtils]: 34: Hoare triple {36187#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -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:26:52,761 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:26:52,761 INFO L273 TraceCheckUtils]: 36: Hoare triple {36188#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -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:26:52,762 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:26:52,762 INFO L273 TraceCheckUtils]: 38: Hoare triple {36189#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -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:26:52,763 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:26:52,763 INFO L273 TraceCheckUtils]: 40: Hoare triple {36190#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -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:26:52,764 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:26:52,765 INFO L273 TraceCheckUtils]: 42: Hoare triple {36191#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -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:26:52,765 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:26:52,766 INFO L273 TraceCheckUtils]: 44: Hoare triple {36192#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -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:26:52,766 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:26:52,767 INFO L273 TraceCheckUtils]: 46: Hoare triple {36193#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -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:26:52,768 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:26:52,768 INFO L273 TraceCheckUtils]: 48: Hoare triple {36194#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -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:26:52,769 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:26:52,769 INFO L273 TraceCheckUtils]: 50: Hoare triple {36195#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -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:26:52,770 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:26:52,770 INFO L273 TraceCheckUtils]: 52: Hoare triple {36196#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -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:26:52,771 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:26:52,771 INFO L273 TraceCheckUtils]: 54: Hoare triple {36197#(<= main_~i~1 24)} assume !!(~i~1 < 100);assume -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:26:52,772 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:26:52,773 INFO L273 TraceCheckUtils]: 56: Hoare triple {36198#(<= main_~i~1 25)} assume !!(~i~1 < 100);assume -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:26:52,773 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:26:52,774 INFO L273 TraceCheckUtils]: 58: Hoare triple {36199#(<= main_~i~1 26)} assume !!(~i~1 < 100);assume -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:26:52,774 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:26:52,775 INFO L273 TraceCheckUtils]: 60: Hoare triple {36200#(<= main_~i~1 27)} assume !!(~i~1 < 100);assume -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:26:52,776 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:26:52,776 INFO L273 TraceCheckUtils]: 62: Hoare triple {36201#(<= main_~i~1 28)} assume !!(~i~1 < 100);assume -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:26:52,777 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:26:52,777 INFO L273 TraceCheckUtils]: 64: Hoare triple {36202#(<= main_~i~1 29)} assume !!(~i~1 < 100);assume -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:26:52,778 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:26:52,778 INFO L273 TraceCheckUtils]: 66: Hoare triple {36203#(<= main_~i~1 30)} assume !!(~i~1 < 100);assume -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:26:52,779 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:26:52,779 INFO L273 TraceCheckUtils]: 68: Hoare triple {36204#(<= main_~i~1 31)} assume !!(~i~1 < 100);assume -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:26:52,780 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:26:52,781 INFO L273 TraceCheckUtils]: 70: Hoare triple {36205#(<= main_~i~1 32)} assume !!(~i~1 < 100);assume -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:26:52,781 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:26:52,782 INFO L273 TraceCheckUtils]: 72: Hoare triple {36206#(<= main_~i~1 33)} assume !!(~i~1 < 100);assume -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:26:52,782 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:26:52,783 INFO L273 TraceCheckUtils]: 74: Hoare triple {36207#(<= main_~i~1 34)} assume !!(~i~1 < 100);assume -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:26:52,784 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:26:52,784 INFO L273 TraceCheckUtils]: 76: Hoare triple {36208#(<= main_~i~1 35)} assume !!(~i~1 < 100);assume -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:26:52,785 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:26:52,785 INFO L273 TraceCheckUtils]: 78: Hoare triple {36209#(<= main_~i~1 36)} assume !!(~i~1 < 100);assume -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:26:52,786 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:26:52,786 INFO L273 TraceCheckUtils]: 80: Hoare triple {36210#(<= main_~i~1 37)} assume !!(~i~1 < 100);assume -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:26:52,787 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:26:52,788 INFO L273 TraceCheckUtils]: 82: Hoare triple {36211#(<= main_~i~1 38)} assume !!(~i~1 < 100);assume -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:26:52,788 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:26:52,789 INFO L273 TraceCheckUtils]: 84: Hoare triple {36212#(<= main_~i~1 39)} assume !!(~i~1 < 100);assume -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:26:52,789 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:26:52,790 INFO L273 TraceCheckUtils]: 86: Hoare triple {36213#(<= main_~i~1 40)} assume !(~i~1 < 100); {36172#false} is VALID [2018-11-23 12:26:52,790 INFO L256 TraceCheckUtils]: 87: Hoare triple {36172#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {36171#true} is VALID [2018-11-23 12:26:52,790 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:26:52,790 INFO L273 TraceCheckUtils]: 89: Hoare triple {36171#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:26:52,791 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:26:52,791 INFO L273 TraceCheckUtils]: 91: Hoare triple {36171#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:26:52,791 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:26:52,791 INFO L273 TraceCheckUtils]: 93: Hoare triple {36171#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:26:52,791 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:26:52,791 INFO L273 TraceCheckUtils]: 95: Hoare triple {36171#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:26:52,792 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:26:52,792 INFO L273 TraceCheckUtils]: 97: Hoare triple {36171#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:26:52,792 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:26:52,792 INFO L273 TraceCheckUtils]: 99: Hoare triple {36171#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:26:52,792 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:26:52,792 INFO L273 TraceCheckUtils]: 101: Hoare triple {36171#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:26:52,793 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:26:52,793 INFO L273 TraceCheckUtils]: 103: Hoare triple {36171#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:26:52,793 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:26:52,793 INFO L273 TraceCheckUtils]: 105: Hoare triple {36171#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:26:52,793 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:26:52,793 INFO L273 TraceCheckUtils]: 107: Hoare triple {36171#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:26:52,794 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:26:52,794 INFO L273 TraceCheckUtils]: 109: Hoare triple {36171#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:26:52,794 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:26:52,794 INFO L273 TraceCheckUtils]: 111: Hoare triple {36171#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:26:52,794 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:26:52,794 INFO L273 TraceCheckUtils]: 113: Hoare triple {36171#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:26:52,794 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:26:52,795 INFO L273 TraceCheckUtils]: 115: Hoare triple {36171#true} assume !(~i~0 < 100); {36171#true} is VALID [2018-11-23 12:26:52,795 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:26:52,795 INFO L273 TraceCheckUtils]: 117: Hoare triple {36171#true} assume true; {36171#true} is VALID [2018-11-23 12:26:52,795 INFO L268 TraceCheckUtils]: 118: Hoare quadruple {36171#true} {36172#false} #70#return; {36172#false} is VALID [2018-11-23 12:26:52,795 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:26:52,795 INFO L256 TraceCheckUtils]: 120: Hoare triple {36172#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {36171#true} is VALID [2018-11-23 12:26:52,795 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:26:52,795 INFO L273 TraceCheckUtils]: 122: Hoare triple {36171#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:26:52,795 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:26:52,795 INFO L273 TraceCheckUtils]: 124: Hoare triple {36171#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:26:52,796 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:26:52,796 INFO L273 TraceCheckUtils]: 126: Hoare triple {36171#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:26:52,796 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:26:52,796 INFO L273 TraceCheckUtils]: 128: Hoare triple {36171#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:26:52,796 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:26:52,796 INFO L273 TraceCheckUtils]: 130: Hoare triple {36171#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:26:52,796 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:26:52,796 INFO L273 TraceCheckUtils]: 132: Hoare triple {36171#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:26:52,796 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:26:52,796 INFO L273 TraceCheckUtils]: 134: Hoare triple {36171#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:26:52,797 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:26:52,797 INFO L273 TraceCheckUtils]: 136: Hoare triple {36171#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:26:52,797 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:26:52,797 INFO L273 TraceCheckUtils]: 138: Hoare triple {36171#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:26:52,797 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:26:52,797 INFO L273 TraceCheckUtils]: 140: Hoare triple {36171#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:26:52,797 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:26:52,797 INFO L273 TraceCheckUtils]: 142: Hoare triple {36171#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:26:52,797 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:26:52,797 INFO L273 TraceCheckUtils]: 144: Hoare triple {36171#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:26:52,798 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:26:52,798 INFO L273 TraceCheckUtils]: 146: Hoare triple {36171#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:26:52,798 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:26:52,798 INFO L273 TraceCheckUtils]: 148: Hoare triple {36171#true} assume !(~i~0 < 100); {36171#true} is VALID [2018-11-23 12:26:52,798 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:26:52,798 INFO L273 TraceCheckUtils]: 150: Hoare triple {36171#true} assume true; {36171#true} is VALID [2018-11-23 12:26:52,798 INFO L268 TraceCheckUtils]: 151: Hoare quadruple {36171#true} {36172#false} #72#return; {36172#false} is VALID [2018-11-23 12:26:52,798 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:26:52,798 INFO L273 TraceCheckUtils]: 153: Hoare triple {36172#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:52,798 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:26:52,799 INFO L273 TraceCheckUtils]: 155: Hoare triple {36172#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:52,799 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:26:52,799 INFO L273 TraceCheckUtils]: 157: Hoare triple {36172#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:52,799 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:26:52,799 INFO L273 TraceCheckUtils]: 159: Hoare triple {36172#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:52,799 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:26:52,799 INFO L273 TraceCheckUtils]: 161: Hoare triple {36172#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:52,799 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:26:52,799 INFO L273 TraceCheckUtils]: 163: Hoare triple {36172#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:52,799 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:26:52,800 INFO L273 TraceCheckUtils]: 165: Hoare triple {36172#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:52,800 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:26:52,800 INFO L273 TraceCheckUtils]: 167: Hoare triple {36172#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:52,800 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:26:52,800 INFO L273 TraceCheckUtils]: 169: Hoare triple {36172#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:52,800 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:26:52,800 INFO L273 TraceCheckUtils]: 171: Hoare triple {36172#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:52,800 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:26:52,800 INFO L273 TraceCheckUtils]: 173: Hoare triple {36172#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:52,800 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:26:52,801 INFO L273 TraceCheckUtils]: 175: Hoare triple {36172#false} assume !(~i~2 < 99); {36172#false} is VALID [2018-11-23 12:26:52,801 INFO L273 TraceCheckUtils]: 176: Hoare triple {36172#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {36172#false} is VALID [2018-11-23 12:26:52,801 INFO L256 TraceCheckUtils]: 177: Hoare triple {36172#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {36171#true} is VALID [2018-11-23 12:26:52,801 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:26:52,801 INFO L273 TraceCheckUtils]: 179: Hoare triple {36171#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:26:52,801 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:26:52,801 INFO L273 TraceCheckUtils]: 181: Hoare triple {36171#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:26:52,801 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:26:52,801 INFO L273 TraceCheckUtils]: 183: Hoare triple {36171#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:26:52,801 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:26:52,802 INFO L273 TraceCheckUtils]: 185: Hoare triple {36171#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:26:52,802 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:26:52,802 INFO L273 TraceCheckUtils]: 187: Hoare triple {36171#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:26:52,802 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:26:52,802 INFO L273 TraceCheckUtils]: 189: Hoare triple {36171#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:26:52,802 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:26:52,802 INFO L273 TraceCheckUtils]: 191: Hoare triple {36171#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:26:52,802 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:26:52,802 INFO L273 TraceCheckUtils]: 193: Hoare triple {36171#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:26:52,803 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:26:52,803 INFO L273 TraceCheckUtils]: 195: Hoare triple {36171#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:26:52,803 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:26:52,803 INFO L273 TraceCheckUtils]: 197: Hoare triple {36171#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:26:52,803 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:26:52,803 INFO L273 TraceCheckUtils]: 199: Hoare triple {36171#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:26:52,803 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:26:52,803 INFO L273 TraceCheckUtils]: 201: Hoare triple {36171#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:26:52,803 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:26:52,803 INFO L273 TraceCheckUtils]: 203: Hoare triple {36171#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36171#true} is VALID [2018-11-23 12:26:52,804 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:26:52,804 INFO L273 TraceCheckUtils]: 205: Hoare triple {36171#true} assume !(~i~0 < 100); {36171#true} is VALID [2018-11-23 12:26:52,804 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:26:52,804 INFO L273 TraceCheckUtils]: 207: Hoare triple {36171#true} assume true; {36171#true} is VALID [2018-11-23 12:26:52,804 INFO L268 TraceCheckUtils]: 208: Hoare quadruple {36171#true} {36172#false} #74#return; {36172#false} is VALID [2018-11-23 12:26:52,804 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:26:52,804 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:26:52,804 INFO L273 TraceCheckUtils]: 211: Hoare triple {36172#false} assume !false; {36172#false} is VALID [2018-11-23 12:26:52,824 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:26:52,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:52,824 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:26:52,833 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:26:52,917 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:26:52,917 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:26:52,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:52,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:26:53,262 INFO L256 TraceCheckUtils]: 0: Hoare triple {36171#true} call ULTIMATE.init(); {36171#true} is VALID [2018-11-23 12:26:53,262 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:26:53,263 INFO L273 TraceCheckUtils]: 2: Hoare triple {36171#true} assume true; {36171#true} is VALID [2018-11-23 12:26:53,263 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36171#true} {36171#true} #66#return; {36171#true} is VALID [2018-11-23 12:26:53,263 INFO L256 TraceCheckUtils]: 4: Hoare triple {36171#true} call #t~ret13 := main(); {36171#true} is VALID [2018-11-23 12:26:53,263 INFO L273 TraceCheckUtils]: 5: Hoare triple {36171#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:26:53,264 INFO L273 TraceCheckUtils]: 6: Hoare triple {36232#(<= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:26:53,264 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:26:53,265 INFO L273 TraceCheckUtils]: 8: Hoare triple {36174#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:26:53,265 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:26:53,265 INFO L273 TraceCheckUtils]: 10: Hoare triple {36175#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:26:53,266 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:26:53,266 INFO L273 TraceCheckUtils]: 12: Hoare triple {36176#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -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:26:53,267 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:26:53,267 INFO L273 TraceCheckUtils]: 14: Hoare triple {36177#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -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:26:53,268 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:26:53,268 INFO L273 TraceCheckUtils]: 16: Hoare triple {36178#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -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:26:53,269 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:26:53,269 INFO L273 TraceCheckUtils]: 18: Hoare triple {36179#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -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:26:53,270 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:26:53,271 INFO L273 TraceCheckUtils]: 20: Hoare triple {36180#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -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:26:53,271 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:26:53,272 INFO L273 TraceCheckUtils]: 22: Hoare triple {36181#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -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:26:53,272 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:26:53,273 INFO L273 TraceCheckUtils]: 24: Hoare triple {36182#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -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:26:53,274 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:26:53,274 INFO L273 TraceCheckUtils]: 26: Hoare triple {36183#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -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:26:53,275 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:26:53,275 INFO L273 TraceCheckUtils]: 28: Hoare triple {36184#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -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:26:53,276 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:26:53,276 INFO L273 TraceCheckUtils]: 30: Hoare triple {36185#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -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:26:53,277 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:26:53,278 INFO L273 TraceCheckUtils]: 32: Hoare triple {36186#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -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:26:53,278 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:26:53,279 INFO L273 TraceCheckUtils]: 34: Hoare triple {36187#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -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:26:53,279 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:26:53,280 INFO L273 TraceCheckUtils]: 36: Hoare triple {36188#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -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:26:53,280 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:26:53,281 INFO L273 TraceCheckUtils]: 38: Hoare triple {36189#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -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:26:53,282 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:26:53,282 INFO L273 TraceCheckUtils]: 40: Hoare triple {36190#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -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:26:53,283 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:26:53,283 INFO L273 TraceCheckUtils]: 42: Hoare triple {36191#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -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:26:53,284 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:26:53,284 INFO L273 TraceCheckUtils]: 44: Hoare triple {36192#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -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:26:53,285 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:26:53,286 INFO L273 TraceCheckUtils]: 46: Hoare triple {36193#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -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:26:53,286 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:26:53,287 INFO L273 TraceCheckUtils]: 48: Hoare triple {36194#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -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:26:53,287 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:26:53,288 INFO L273 TraceCheckUtils]: 50: Hoare triple {36195#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -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:26:53,289 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:26:53,289 INFO L273 TraceCheckUtils]: 52: Hoare triple {36196#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -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:26:53,290 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:26:53,290 INFO L273 TraceCheckUtils]: 54: Hoare triple {36197#(<= main_~i~1 24)} assume !!(~i~1 < 100);assume -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:26:53,291 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:26:53,291 INFO L273 TraceCheckUtils]: 56: Hoare triple {36198#(<= main_~i~1 25)} assume !!(~i~1 < 100);assume -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:26:53,292 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:26:53,292 INFO L273 TraceCheckUtils]: 58: Hoare triple {36199#(<= main_~i~1 26)} assume !!(~i~1 < 100);assume -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:26:53,293 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:26:53,294 INFO L273 TraceCheckUtils]: 60: Hoare triple {36200#(<= main_~i~1 27)} assume !!(~i~1 < 100);assume -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:26:53,294 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:26:53,295 INFO L273 TraceCheckUtils]: 62: Hoare triple {36201#(<= main_~i~1 28)} assume !!(~i~1 < 100);assume -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:26:53,295 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:26:53,296 INFO L273 TraceCheckUtils]: 64: Hoare triple {36202#(<= main_~i~1 29)} assume !!(~i~1 < 100);assume -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:26:53,297 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:26:53,297 INFO L273 TraceCheckUtils]: 66: Hoare triple {36203#(<= main_~i~1 30)} assume !!(~i~1 < 100);assume -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:26:53,298 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:26:53,298 INFO L273 TraceCheckUtils]: 68: Hoare triple {36204#(<= main_~i~1 31)} assume !!(~i~1 < 100);assume -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:26:53,299 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:26:53,299 INFO L273 TraceCheckUtils]: 70: Hoare triple {36205#(<= main_~i~1 32)} assume !!(~i~1 < 100);assume -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:26:53,300 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:26:53,300 INFO L273 TraceCheckUtils]: 72: Hoare triple {36206#(<= main_~i~1 33)} assume !!(~i~1 < 100);assume -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:26:53,301 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:26:53,302 INFO L273 TraceCheckUtils]: 74: Hoare triple {36207#(<= main_~i~1 34)} assume !!(~i~1 < 100);assume -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:26:53,302 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:26:53,303 INFO L273 TraceCheckUtils]: 76: Hoare triple {36208#(<= main_~i~1 35)} assume !!(~i~1 < 100);assume -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:26:53,303 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:26:53,304 INFO L273 TraceCheckUtils]: 78: Hoare triple {36209#(<= main_~i~1 36)} assume !!(~i~1 < 100);assume -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:26:53,305 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:26:53,305 INFO L273 TraceCheckUtils]: 80: Hoare triple {36210#(<= main_~i~1 37)} assume !!(~i~1 < 100);assume -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:26:53,306 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:26:53,306 INFO L273 TraceCheckUtils]: 82: Hoare triple {36211#(<= main_~i~1 38)} assume !!(~i~1 < 100);assume -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:26:53,307 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:26:53,307 INFO L273 TraceCheckUtils]: 84: Hoare triple {36212#(<= main_~i~1 39)} assume !!(~i~1 < 100);assume -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:26:53,308 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:26:53,309 INFO L273 TraceCheckUtils]: 86: Hoare triple {36213#(<= main_~i~1 40)} assume !(~i~1 < 100); {36172#false} is VALID [2018-11-23 12:26:53,309 INFO L256 TraceCheckUtils]: 87: Hoare triple {36172#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {36172#false} is VALID [2018-11-23 12:26:53,309 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:26:53,309 INFO L273 TraceCheckUtils]: 89: Hoare triple {36172#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:26:53,309 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:26:53,310 INFO L273 TraceCheckUtils]: 91: Hoare triple {36172#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:26:53,310 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:26:53,310 INFO L273 TraceCheckUtils]: 93: Hoare triple {36172#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:26:53,310 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:26:53,310 INFO L273 TraceCheckUtils]: 95: Hoare triple {36172#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:26:53,310 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:26:53,311 INFO L273 TraceCheckUtils]: 97: Hoare triple {36172#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:26:53,311 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:26:53,311 INFO L273 TraceCheckUtils]: 99: Hoare triple {36172#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:26:53,311 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:26:53,311 INFO L273 TraceCheckUtils]: 101: Hoare triple {36172#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:26:53,311 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:26:53,311 INFO L273 TraceCheckUtils]: 103: Hoare triple {36172#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:26:53,311 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:26:53,312 INFO L273 TraceCheckUtils]: 105: Hoare triple {36172#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:26:53,312 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:26:53,312 INFO L273 TraceCheckUtils]: 107: Hoare triple {36172#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:26:53,312 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:26:53,312 INFO L273 TraceCheckUtils]: 109: Hoare triple {36172#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:26:53,312 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:26:53,312 INFO L273 TraceCheckUtils]: 111: Hoare triple {36172#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:26:53,312 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:26:53,312 INFO L273 TraceCheckUtils]: 113: Hoare triple {36172#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:26:53,312 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:26:53,313 INFO L273 TraceCheckUtils]: 115: Hoare triple {36172#false} assume !(~i~0 < 100); {36172#false} is VALID [2018-11-23 12:26:53,313 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:26:53,313 INFO L273 TraceCheckUtils]: 117: Hoare triple {36172#false} assume true; {36172#false} is VALID [2018-11-23 12:26:53,313 INFO L268 TraceCheckUtils]: 118: Hoare quadruple {36172#false} {36172#false} #70#return; {36172#false} is VALID [2018-11-23 12:26:53,313 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:26:53,313 INFO L256 TraceCheckUtils]: 120: Hoare triple {36172#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {36172#false} is VALID [2018-11-23 12:26:53,313 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:26:53,313 INFO L273 TraceCheckUtils]: 122: Hoare triple {36172#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:26:53,313 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:26:53,313 INFO L273 TraceCheckUtils]: 124: Hoare triple {36172#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:26:53,314 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:26:53,314 INFO L273 TraceCheckUtils]: 126: Hoare triple {36172#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:26:53,314 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:26:53,314 INFO L273 TraceCheckUtils]: 128: Hoare triple {36172#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:26:53,314 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:26:53,314 INFO L273 TraceCheckUtils]: 130: Hoare triple {36172#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:26:53,314 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:26:53,314 INFO L273 TraceCheckUtils]: 132: Hoare triple {36172#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:26:53,314 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:26:53,314 INFO L273 TraceCheckUtils]: 134: Hoare triple {36172#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:26:53,315 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:26:53,315 INFO L273 TraceCheckUtils]: 136: Hoare triple {36172#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:26:53,315 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:26:53,315 INFO L273 TraceCheckUtils]: 138: Hoare triple {36172#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:26:53,315 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:26:53,315 INFO L273 TraceCheckUtils]: 140: Hoare triple {36172#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:26:53,315 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:26:53,315 INFO L273 TraceCheckUtils]: 142: Hoare triple {36172#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:26:53,315 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:26:53,315 INFO L273 TraceCheckUtils]: 144: Hoare triple {36172#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:26:53,316 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:26:53,316 INFO L273 TraceCheckUtils]: 146: Hoare triple {36172#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:26:53,316 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:26:53,316 INFO L273 TraceCheckUtils]: 148: Hoare triple {36172#false} assume !(~i~0 < 100); {36172#false} is VALID [2018-11-23 12:26:53,316 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:26:53,316 INFO L273 TraceCheckUtils]: 150: Hoare triple {36172#false} assume true; {36172#false} is VALID [2018-11-23 12:26:53,316 INFO L268 TraceCheckUtils]: 151: Hoare quadruple {36172#false} {36172#false} #72#return; {36172#false} is VALID [2018-11-23 12:26:53,316 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:26:53,316 INFO L273 TraceCheckUtils]: 153: Hoare triple {36172#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:53,316 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:26:53,317 INFO L273 TraceCheckUtils]: 155: Hoare triple {36172#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:53,317 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:26:53,317 INFO L273 TraceCheckUtils]: 157: Hoare triple {36172#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:53,317 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:26:53,317 INFO L273 TraceCheckUtils]: 159: Hoare triple {36172#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:53,317 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:26:53,317 INFO L273 TraceCheckUtils]: 161: Hoare triple {36172#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:53,317 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:26:53,317 INFO L273 TraceCheckUtils]: 163: Hoare triple {36172#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:53,317 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:26:53,318 INFO L273 TraceCheckUtils]: 165: Hoare triple {36172#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:53,318 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:26:53,318 INFO L273 TraceCheckUtils]: 167: Hoare triple {36172#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:53,318 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:26:53,318 INFO L273 TraceCheckUtils]: 169: Hoare triple {36172#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:53,318 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:26:53,318 INFO L273 TraceCheckUtils]: 171: Hoare triple {36172#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:53,318 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:26:53,318 INFO L273 TraceCheckUtils]: 173: Hoare triple {36172#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:53,318 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:26:53,319 INFO L273 TraceCheckUtils]: 175: Hoare triple {36172#false} assume !(~i~2 < 99); {36172#false} is VALID [2018-11-23 12:26:53,319 INFO L273 TraceCheckUtils]: 176: Hoare triple {36172#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {36172#false} is VALID [2018-11-23 12:26:53,319 INFO L256 TraceCheckUtils]: 177: Hoare triple {36172#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {36172#false} is VALID [2018-11-23 12:26:53,319 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:26:53,319 INFO L273 TraceCheckUtils]: 179: Hoare triple {36172#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:26:53,319 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:26:53,319 INFO L273 TraceCheckUtils]: 181: Hoare triple {36172#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:26:53,319 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:26:53,319 INFO L273 TraceCheckUtils]: 183: Hoare triple {36172#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:26:53,319 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:26:53,320 INFO L273 TraceCheckUtils]: 185: Hoare triple {36172#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:26:53,320 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:26:53,320 INFO L273 TraceCheckUtils]: 187: Hoare triple {36172#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:26:53,320 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:26:53,320 INFO L273 TraceCheckUtils]: 189: Hoare triple {36172#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:26:53,320 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:26:53,320 INFO L273 TraceCheckUtils]: 191: Hoare triple {36172#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:26:53,320 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:26:53,320 INFO L273 TraceCheckUtils]: 193: Hoare triple {36172#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:26:53,320 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:26:53,321 INFO L273 TraceCheckUtils]: 195: Hoare triple {36172#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:26:53,321 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:26:53,321 INFO L273 TraceCheckUtils]: 197: Hoare triple {36172#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:26:53,321 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:26:53,321 INFO L273 TraceCheckUtils]: 199: Hoare triple {36172#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:26:53,321 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:26:53,321 INFO L273 TraceCheckUtils]: 201: Hoare triple {36172#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:26:53,321 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:26:53,321 INFO L273 TraceCheckUtils]: 203: Hoare triple {36172#false} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {36172#false} is VALID [2018-11-23 12:26:53,321 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:26:53,322 INFO L273 TraceCheckUtils]: 205: Hoare triple {36172#false} assume !(~i~0 < 100); {36172#false} is VALID [2018-11-23 12:26:53,322 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:26:53,322 INFO L273 TraceCheckUtils]: 207: Hoare triple {36172#false} assume true; {36172#false} is VALID [2018-11-23 12:26:53,322 INFO L268 TraceCheckUtils]: 208: Hoare quadruple {36172#false} {36172#false} #74#return; {36172#false} is VALID [2018-11-23 12:26:53,322 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:26:53,322 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:26:53,322 INFO L273 TraceCheckUtils]: 211: Hoare triple {36172#false} assume !false; {36172#false} is VALID [2018-11-23 12:26:53,342 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:26:53,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:26:53,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2018-11-23 12:26:53,371 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 212 [2018-11-23 12:26:53,372 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:26:53,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states. [2018-11-23 12:26:53,556 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:26:53,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-23 12:26:53,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-23 12:26:53,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 12:26:53,558 INFO L87 Difference]: Start difference. First operand 151 states and 155 transitions. Second operand 44 states. [2018-11-23 12:26:54,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:54,617 INFO L93 Difference]: Finished difference Result 218 states and 226 transitions. [2018-11-23 12:26:54,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-23 12:26:54,618 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 212 [2018-11-23 12:26:54,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:26:54,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 12:26:54,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 134 transitions. [2018-11-23 12:26:54,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 12:26:54,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 134 transitions. [2018-11-23 12:26:54,620 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 134 transitions. [2018-11-23 12:26:54,745 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:26:54,748 INFO L225 Difference]: With dead ends: 218 [2018-11-23 12:26:54,748 INFO L226 Difference]: Without dead ends: 154 [2018-11-23 12:26:54,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 12:26:54,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-11-23 12:26:54,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2018-11-23 12:26:54,826 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:26:54,827 INFO L82 GeneralOperation]: Start isEquivalent. First operand 154 states. Second operand 153 states. [2018-11-23 12:26:54,827 INFO L74 IsIncluded]: Start isIncluded. First operand 154 states. Second operand 153 states. [2018-11-23 12:26:54,827 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 153 states. [2018-11-23 12:26:54,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:54,829 INFO L93 Difference]: Finished difference Result 154 states and 158 transitions. [2018-11-23 12:26:54,830 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 158 transitions. [2018-11-23 12:26:54,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:54,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:54,830 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 154 states. [2018-11-23 12:26:54,830 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 154 states. [2018-11-23 12:26:54,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:26:54,833 INFO L93 Difference]: Finished difference Result 154 states and 158 transitions. [2018-11-23 12:26:54,833 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 158 transitions. [2018-11-23 12:26:54,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:26:54,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:26:54,834 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:26:54,834 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:26:54,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-11-23 12:26:54,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 157 transitions. [2018-11-23 12:26:54,836 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 157 transitions. Word has length 212 [2018-11-23 12:26:54,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:26:54,837 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 157 transitions. [2018-11-23 12:26:54,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-23 12:26:54,837 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2018-11-23 12:26:54,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-11-23 12:26:54,838 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:26:54,838 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:26:54,838 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:26:54,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:54,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1698842739, now seen corresponding path program 41 times [2018-11-23 12:26:54,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:26:54,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:26:54,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:54,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:26:54,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:26:54,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:55,902 INFO L256 TraceCheckUtils]: 0: Hoare triple {37711#true} call ULTIMATE.init(); {37711#true} is VALID [2018-11-23 12:26:55,902 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:26:55,902 INFO L273 TraceCheckUtils]: 2: Hoare triple {37711#true} assume true; {37711#true} is VALID [2018-11-23 12:26:55,902 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37711#true} {37711#true} #66#return; {37711#true} is VALID [2018-11-23 12:26:55,902 INFO L256 TraceCheckUtils]: 4: Hoare triple {37711#true} call #t~ret13 := main(); {37711#true} is VALID [2018-11-23 12:26:55,902 INFO L273 TraceCheckUtils]: 5: Hoare triple {37711#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(400);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:26:55,903 INFO L273 TraceCheckUtils]: 6: Hoare triple {37713#(= main_~i~1 0)} assume !!(~i~1 < 100);assume -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:26:55,903 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:26:55,904 INFO L273 TraceCheckUtils]: 8: Hoare triple {37714#(<= main_~i~1 1)} assume !!(~i~1 < 100);assume -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:26:55,904 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:26:55,904 INFO L273 TraceCheckUtils]: 10: Hoare triple {37715#(<= main_~i~1 2)} assume !!(~i~1 < 100);assume -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:26:55,905 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:26:55,906 INFO L273 TraceCheckUtils]: 12: Hoare triple {37716#(<= main_~i~1 3)} assume !!(~i~1 < 100);assume -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:26:55,906 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:26:55,907 INFO L273 TraceCheckUtils]: 14: Hoare triple {37717#(<= main_~i~1 4)} assume !!(~i~1 < 100);assume -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:26:55,907 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:26:55,908 INFO L273 TraceCheckUtils]: 16: Hoare triple {37718#(<= main_~i~1 5)} assume !!(~i~1 < 100);assume -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:26:55,908 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:26:55,909 INFO L273 TraceCheckUtils]: 18: Hoare triple {37719#(<= main_~i~1 6)} assume !!(~i~1 < 100);assume -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:26:55,910 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:26:55,910 INFO L273 TraceCheckUtils]: 20: Hoare triple {37720#(<= main_~i~1 7)} assume !!(~i~1 < 100);assume -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:26:55,911 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:26:55,911 INFO L273 TraceCheckUtils]: 22: Hoare triple {37721#(<= main_~i~1 8)} assume !!(~i~1 < 100);assume -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:26:55,912 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:26:55,912 INFO L273 TraceCheckUtils]: 24: Hoare triple {37722#(<= main_~i~1 9)} assume !!(~i~1 < 100);assume -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:26:55,913 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:26:55,914 INFO L273 TraceCheckUtils]: 26: Hoare triple {37723#(<= main_~i~1 10)} assume !!(~i~1 < 100);assume -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:26:55,914 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:26:55,915 INFO L273 TraceCheckUtils]: 28: Hoare triple {37724#(<= main_~i~1 11)} assume !!(~i~1 < 100);assume -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:26:55,915 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:26:55,916 INFO L273 TraceCheckUtils]: 30: Hoare triple {37725#(<= main_~i~1 12)} assume !!(~i~1 < 100);assume -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:26:55,916 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:26:55,917 INFO L273 TraceCheckUtils]: 32: Hoare triple {37726#(<= main_~i~1 13)} assume !!(~i~1 < 100);assume -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:26:55,918 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:26:55,918 INFO L273 TraceCheckUtils]: 34: Hoare triple {37727#(<= main_~i~1 14)} assume !!(~i~1 < 100);assume -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:26:55,919 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:26:55,919 INFO L273 TraceCheckUtils]: 36: Hoare triple {37728#(<= main_~i~1 15)} assume !!(~i~1 < 100);assume -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:26:55,920 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:26:55,920 INFO L273 TraceCheckUtils]: 38: Hoare triple {37729#(<= main_~i~1 16)} assume !!(~i~1 < 100);assume -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:26:55,921 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:26:55,921 INFO L273 TraceCheckUtils]: 40: Hoare triple {37730#(<= main_~i~1 17)} assume !!(~i~1 < 100);assume -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:26:55,922 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:26:55,923 INFO L273 TraceCheckUtils]: 42: Hoare triple {37731#(<= main_~i~1 18)} assume !!(~i~1 < 100);assume -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:26:55,923 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:26:55,924 INFO L273 TraceCheckUtils]: 44: Hoare triple {37732#(<= main_~i~1 19)} assume !!(~i~1 < 100);assume -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:26:55,924 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:26:55,925 INFO L273 TraceCheckUtils]: 46: Hoare triple {37733#(<= main_~i~1 20)} assume !!(~i~1 < 100);assume -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:26:55,926 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:26:55,926 INFO L273 TraceCheckUtils]: 48: Hoare triple {37734#(<= main_~i~1 21)} assume !!(~i~1 < 100);assume -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:26:55,927 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:26:55,927 INFO L273 TraceCheckUtils]: 50: Hoare triple {37735#(<= main_~i~1 22)} assume !!(~i~1 < 100);assume -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:26:55,928 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:26:55,928 INFO L273 TraceCheckUtils]: 52: Hoare triple {37736#(<= main_~i~1 23)} assume !!(~i~1 < 100);assume -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:26:55,929 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:26:55,930 INFO L273 TraceCheckUtils]: 54: Hoare triple {37737#(<= main_~i~1 24)} assume !!(~i~1 < 100);assume -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:26:55,930 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:26:55,931 INFO L273 TraceCheckUtils]: 56: Hoare triple {37738#(<= main_~i~1 25)} assume !!(~i~1 < 100);assume -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:26:55,931 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:26:55,932 INFO L273 TraceCheckUtils]: 58: Hoare triple {37739#(<= main_~i~1 26)} assume !!(~i~1 < 100);assume -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:26:55,932 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:26:55,933 INFO L273 TraceCheckUtils]: 60: Hoare triple {37740#(<= main_~i~1 27)} assume !!(~i~1 < 100);assume -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:26:55,934 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:26:55,934 INFO L273 TraceCheckUtils]: 62: Hoare triple {37741#(<= main_~i~1 28)} assume !!(~i~1 < 100);assume -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:26:55,935 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:26:55,935 INFO L273 TraceCheckUtils]: 64: Hoare triple {37742#(<= main_~i~1 29)} assume !!(~i~1 < 100);assume -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:26:55,936 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:26:55,936 INFO L273 TraceCheckUtils]: 66: Hoare triple {37743#(<= main_~i~1 30)} assume !!(~i~1 < 100);assume -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:26:55,937 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:26:55,938 INFO L273 TraceCheckUtils]: 68: Hoare triple {37744#(<= main_~i~1 31)} assume !!(~i~1 < 100);assume -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:26:55,938 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:26:55,939 INFO L273 TraceCheckUtils]: 70: Hoare triple {37745#(<= main_~i~1 32)} assume !!(~i~1 < 100);assume -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:26:55,939 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:26:55,940 INFO L273 TraceCheckUtils]: 72: Hoare triple {37746#(<= main_~i~1 33)} assume !!(~i~1 < 100);assume -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:26:55,941 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:26:55,941 INFO L273 TraceCheckUtils]: 74: Hoare triple {37747#(<= main_~i~1 34)} assume !!(~i~1 < 100);assume -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:26:55,942 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:26:55,942 INFO L273 TraceCheckUtils]: 76: Hoare triple {37748#(<= main_~i~1 35)} assume !!(~i~1 < 100);assume -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:26:55,943 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:26:55,943 INFO L273 TraceCheckUtils]: 78: Hoare triple {37749#(<= main_~i~1 36)} assume !!(~i~1 < 100);assume -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:26:55,944 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:26:55,944 INFO L273 TraceCheckUtils]: 80: Hoare triple {37750#(<= main_~i~1 37)} assume !!(~i~1 < 100);assume -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:26:55,945 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:26:55,946 INFO L273 TraceCheckUtils]: 82: Hoare triple {37751#(<= main_~i~1 38)} assume !!(~i~1 < 100);assume -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:26:55,946 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:26:55,947 INFO L273 TraceCheckUtils]: 84: Hoare triple {37752#(<= main_~i~1 39)} assume !!(~i~1 < 100);assume -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:26:55,947 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:26:55,948 INFO L273 TraceCheckUtils]: 86: Hoare triple {37753#(<= main_~i~1 40)} assume !!(~i~1 < 100);assume -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:26:55,949 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:26:55,949 INFO L273 TraceCheckUtils]: 88: Hoare triple {37754#(<= main_~i~1 41)} assume !(~i~1 < 100); {37712#false} is VALID [2018-11-23 12:26:55,949 INFO L256 TraceCheckUtils]: 89: Hoare triple {37712#false} call #t~ret5 := bAnd(~#x~0.base, ~#x~0.offset); {37711#true} is VALID [2018-11-23 12:26:55,950 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:26:55,950 INFO L273 TraceCheckUtils]: 91: Hoare triple {37711#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:26:55,950 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:26:55,950 INFO L273 TraceCheckUtils]: 93: Hoare triple {37711#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:26:55,950 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:26:55,950 INFO L273 TraceCheckUtils]: 95: Hoare triple {37711#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:26:55,951 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:26:55,951 INFO L273 TraceCheckUtils]: 97: Hoare triple {37711#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:26:55,951 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:26:55,951 INFO L273 TraceCheckUtils]: 99: Hoare triple {37711#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:26:55,951 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:26:55,951 INFO L273 TraceCheckUtils]: 101: Hoare triple {37711#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:26:55,951 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:26:55,952 INFO L273 TraceCheckUtils]: 103: Hoare triple {37711#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:26:55,952 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:26:55,952 INFO L273 TraceCheckUtils]: 105: Hoare triple {37711#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:26:55,952 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:26:55,952 INFO L273 TraceCheckUtils]: 107: Hoare triple {37711#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:26:55,952 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:26:55,952 INFO L273 TraceCheckUtils]: 109: Hoare triple {37711#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:26:55,952 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:26:55,952 INFO L273 TraceCheckUtils]: 111: Hoare triple {37711#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:26:55,952 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:26:55,953 INFO L273 TraceCheckUtils]: 113: Hoare triple {37711#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:26:55,953 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:26:55,953 INFO L273 TraceCheckUtils]: 115: Hoare triple {37711#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:26:55,953 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:26:55,953 INFO L273 TraceCheckUtils]: 117: Hoare triple {37711#true} assume !(~i~0 < 100); {37711#true} is VALID [2018-11-23 12:26:55,953 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:26:55,953 INFO L273 TraceCheckUtils]: 119: Hoare triple {37711#true} assume true; {37711#true} is VALID [2018-11-23 12:26:55,953 INFO L268 TraceCheckUtils]: 120: Hoare quadruple {37711#true} {37712#false} #70#return; {37712#false} is VALID [2018-11-23 12:26:55,953 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:26:55,953 INFO L256 TraceCheckUtils]: 122: Hoare triple {37712#false} call #t~ret8 := bAnd(~#x~0.base, ~#x~0.offset); {37711#true} is VALID [2018-11-23 12:26:55,954 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:26:55,954 INFO L273 TraceCheckUtils]: 124: Hoare triple {37711#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:26:55,954 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:26:55,954 INFO L273 TraceCheckUtils]: 126: Hoare triple {37711#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:26:55,954 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:26:55,954 INFO L273 TraceCheckUtils]: 128: Hoare triple {37711#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:26:55,954 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:26:55,954 INFO L273 TraceCheckUtils]: 130: Hoare triple {37711#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:26:55,954 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:26:55,954 INFO L273 TraceCheckUtils]: 132: Hoare triple {37711#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:26:55,955 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:26:55,955 INFO L273 TraceCheckUtils]: 134: Hoare triple {37711#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:26:55,955 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:26:55,955 INFO L273 TraceCheckUtils]: 136: Hoare triple {37711#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:26:55,955 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:26:55,955 INFO L273 TraceCheckUtils]: 138: Hoare triple {37711#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:26:55,955 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:26:55,955 INFO L273 TraceCheckUtils]: 140: Hoare triple {37711#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:26:55,955 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:26:55,955 INFO L273 TraceCheckUtils]: 142: Hoare triple {37711#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:26:55,956 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:26:55,956 INFO L273 TraceCheckUtils]: 144: Hoare triple {37711#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:26:55,956 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:26:55,956 INFO L273 TraceCheckUtils]: 146: Hoare triple {37711#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:26:55,956 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:26:55,956 INFO L273 TraceCheckUtils]: 148: Hoare triple {37711#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:26:55,956 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:26:55,956 INFO L273 TraceCheckUtils]: 150: Hoare triple {37711#true} assume !(~i~0 < 100); {37711#true} is VALID [2018-11-23 12:26:55,956 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:26:55,956 INFO L273 TraceCheckUtils]: 152: Hoare triple {37711#true} assume true; {37711#true} is VALID [2018-11-23 12:26:55,957 INFO L268 TraceCheckUtils]: 153: Hoare quadruple {37711#true} {37712#false} #72#return; {37712#false} is VALID [2018-11-23 12:26:55,957 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:26:55,957 INFO L273 TraceCheckUtils]: 155: Hoare triple {37712#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:55,957 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:26:55,957 INFO L273 TraceCheckUtils]: 157: Hoare triple {37712#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:55,957 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:26:55,957 INFO L273 TraceCheckUtils]: 159: Hoare triple {37712#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:55,957 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:26:55,957 INFO L273 TraceCheckUtils]: 161: Hoare triple {37712#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:55,957 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:26:55,958 INFO L273 TraceCheckUtils]: 163: Hoare triple {37712#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:55,958 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:26:55,958 INFO L273 TraceCheckUtils]: 165: Hoare triple {37712#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:55,958 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:26:55,958 INFO L273 TraceCheckUtils]: 167: Hoare triple {37712#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:55,958 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:26:55,958 INFO L273 TraceCheckUtils]: 169: Hoare triple {37712#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:55,958 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:26:55,958 INFO L273 TraceCheckUtils]: 171: Hoare triple {37712#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:55,958 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:26:55,959 INFO L273 TraceCheckUtils]: 173: Hoare triple {37712#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:55,959 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:26:55,959 INFO L273 TraceCheckUtils]: 175: Hoare triple {37712#false} assume !!(~i~2 < 99);call #t~mem11 := read~int(~#x~0.base, ~#x~0.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:26:55,959 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:26:55,959 INFO L273 TraceCheckUtils]: 177: Hoare triple {37712#false} assume !(~i~2 < 99); {37712#false} is VALID [2018-11-23 12:26:55,959 INFO L273 TraceCheckUtils]: 178: Hoare triple {37712#false} call write~int(~temp~0, ~#x~0.base, 396 + ~#x~0.offset, 4); {37712#false} is VALID [2018-11-23 12:26:55,959 INFO L256 TraceCheckUtils]: 179: Hoare triple {37712#false} call #t~ret12 := bAnd(~#x~0.base, ~#x~0.offset); {37711#true} is VALID [2018-11-23 12:26:55,959 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:26:55,959 INFO L273 TraceCheckUtils]: 181: Hoare triple {37711#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:26:55,959 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:26:55,960 INFO L273 TraceCheckUtils]: 183: Hoare triple {37711#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:26:55,960 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:26:55,960 INFO L273 TraceCheckUtils]: 185: Hoare triple {37711#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:26:55,960 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:26:55,960 INFO L273 TraceCheckUtils]: 187: Hoare triple {37711#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:26:55,960 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:26:55,960 INFO L273 TraceCheckUtils]: 189: Hoare triple {37711#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:26:55,960 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:26:55,960 INFO L273 TraceCheckUtils]: 191: Hoare triple {37711#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:26:55,960 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:26:55,961 INFO L273 TraceCheckUtils]: 193: Hoare triple {37711#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:26:55,961 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:26:55,961 INFO L273 TraceCheckUtils]: 195: Hoare triple {37711#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:26:55,961 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:26:55,961 INFO L273 TraceCheckUtils]: 197: Hoare triple {37711#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:26:55,961 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:26:55,961 INFO L273 TraceCheckUtils]: 199: Hoare triple {37711#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:26:55,961 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:26:55,961 INFO L273 TraceCheckUtils]: 201: Hoare triple {37711#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:26:55,961 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:26:55,962 INFO L273 TraceCheckUtils]: 203: Hoare triple {37711#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:26:55,962 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:26:55,962 INFO L273 TraceCheckUtils]: 205: Hoare triple {37711#true} assume !!(~i~0 < 100);call #t~mem2 := read~int(~x.base, ~x.offset + 4 * ~i~0, 4);~res~0 := ~bitwiseAnd(~res~0, #t~mem2);havoc #t~mem2; {37711#true} is VALID [2018-11-23 12:26:55,962 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:26:55,962 INFO L273 TraceCheckUtils]: 207: Hoare triple {37711#true} assume !(~i~0 < 100); {37711#true} is VALID [2018-11-23 12:26:55,962 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:26:55,962 INFO L273 TraceCheckUtils]: 209: Hoare triple {37711#true} assume true; {37711#true} is VALID [2018-11-23 12:26:55,962 INFO L268 TraceCheckUtils]: 210: Hoare quadruple {37711#true} {37712#false} #74#return; {37712#false} is VALID [2018-11-23 12:26:55,962 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:26:55,963 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:26:55,963 INFO L273 TraceCheckUtils]: 213: Hoare triple {37712#false} assume !false; {37712#false} is VALID [2018-11-23 12:26:55,983 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:26:55,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:26:55,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 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:26:55,991 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1